ACM Home Page
Please provide us with feedback. Feedback
Load-balanced routing for mesh networks
Full text PdfPdf (683 KB)
Source ACM SIGMOBILE Mobile Computing and Communications Review archive
Volume 10 ,  Issue 4  (October 2006) table of contents
POSTER SESSION: Poster abstracts from MobiCom 2005 table of contents
Pages: 3 - 5  
Year of Publication: 2006
ISSN:1559-1662
Authors
Yaling Yang  University of Illinois at Urbana Champaign
Jun Wang  University of Illinois at Urbana Champaign
Robin Kravets  University of Illinois at Urbana Champaign
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 87,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1215976.1215979
What is a DOI?

ABSTRACT

Due to the static nature of nodes, in mesh networks, a poor choice of paths may remain unchanged for a long time and create hot spots. Hence, it is very important to design path weight functions (also called routing metrics) to facilitate load-balanced routing in mesh networks. Such path weight functions (PWFs) must reflect the shared nature of wireless channels and support easy calculation of loop-free paths. In this abstract, we present our theoretical studies of the requirements on PWFs and design the first PWF, called Metric of Interference and Channel-switching (MIC), that satisfies these requirements. Our simulation results show that MIC's performance is substantially better than existing PWFs. (See our technical report [5] for more details.)



Collaborative Colleagues:
Yaling Yang: colleagues
Jun Wang: colleagues
Robin Kravets: colleagues