Bandwidth guaranteed routing in wireless mesh networks

  • Authors:
  • Hongju Cheng;Nuo Yu;Qin Liu;Xiaohua Jia

  • Affiliations:
  • School of Computing, Wuhan University, Wuhan, P.R. China;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;School of Computing, Wuhan University, Wuhan, P.R. China;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

  • Venue:
  • WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.