Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Murali Kodialam Bell Laboratories, Lucent Technologies, Holmdel, NJ
Thyaga Nandagopal Bell Laboratories, Lucent Technologies, Holmdel, NJ
Published in:
Cover Image
 
· Proceeding
MobiCom '03 Proceedings of the 9th annual international conference on Mobile computing and networking
Pages 42-54
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-753-2 doi>10.1145/938985.938991
Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 72
· Downloads (cumulative): 2,441
· Citation Count: 79


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder