DocumentCode :
462954
Title :
Minimum Cost Routing for Multiple Source-Destination Pairs in Random Access Wireless Multi-hop Networks
Author :
Hoang, XuanTung ; Lee, Younghee
Author_Institution :
Inf. & Commun. Univ., Daejeon
Volume :
1
fYear :
2007
fDate :
12-14 Feb. 2007
Firstpage :
205
Lastpage :
208
Abstract :
We present in this paper a linear programming formulation of the routing problem in wireless multihop networks. The formulation considers mutual interference among connections coexisting in the network at the MAC layer. To captures the interference effects, we develop a group of capacity constraints on the network that follow typical random access MAC protocols including IEEE 802.11 standard. Our solution for the problem is based on the subgradient method and it leads to a simple and a promising distributed routing algorithm.
Keywords :
access protocols; gradient methods; linear programming; radio networks; telecommunication network routing; IEEE 802.11 standard; MAC layer; capacity constraints; distributed routing algorithm; linear programming formulation; minimum cost routing; multiple source-destination pairs; mutual interference; random access MAC protocols; random access wireless multi-hop networks; subgradient method; Access protocols; Costs; Distributed algorithms; Interference; Iterative algorithms; Media Access Protocol; Network topology; Routing protocols; Spread spectrum communication; Wireless networks; Multihop wireless networks; mathematical programming; multi-commodity flow; routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Communication Technology, The 9th International Conference on
Conference_Location :
Gangwon-Do
ISSN :
1738-9445
Print_ISBN :
978-89-5519-131-8
Type :
conf
DOI :
10.1109/ICACT.2007.358339
Filename :
4195118
Link To Document :
بازگشت