Paper Info
Title
Bandwidth guaranteed routing in wireless mesh networks
Abstract
Interference can make significant impact on the performance of wireless networks. Wireless mesh networks (WMNs) allow multiple orthogonal channels to be used simultaneously in the system and the throughput can be greatly improved because transmissions on different orthogonal channels do not interfere with each other. However, due to the limited number of available orthogonal channels, interference is still a factor in WMNs. In this paper an H-hop interference model in WMNs is proposed, where the transmission is successfully received if no other nodes that are within H hops from the receiver are transmitting on the same channel simultaneously. Based on this model, the interference-free property in the TDMA WMNs is analyzed. A heuristic algorithm with max-min time slots reservation strategy is developed to get the maximum bandwidth of a given path. And it is used in the bandwidth guaranteed routing protocol to find the shortest path for a connection with bandwidth requirement. Extensive simulations show that our routing protocol decreases the blocking ratios significantly compared with the shortest path routing. © Springer-Verlag Berlin Heidelberg 2006.
Year
Venue
Field
2006
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Wireless network,Equal-cost multi-path routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Computer network,Wireless Routing Protocol,Private Network-to-Network Interface,Wireless mesh network,Routing protocol,Distributed computing
DocType
Volume
ISSN
Conference
4138 LNCS
03029743
ISBN
Citations 
PageRank 
3540371893; 9783540371892
0
0.34
References 
Authors
9
4
Name
Order
Citations
PageRank
Hongju Cheng121112.99
Yu Nuo2325.76
Li Qin300.34
Xiaohua Jia44609303.30