Routing Analysis in Wireless Mesh Network with Bandwidth Allocation
T.S. Starlin1, D. Jasmine David2
1T.S. Starlin, Electronics and Communication Engineering, Karunya University, Coimbatore, India.
2D. Jasmine David, Electronics and Communication Engineering, Karunya University, Coimbatore, India.
Manuscript received on January 23, 2013. | Revised Manuscript received on February 17, 2013. | Manuscript published on February 28, 2013. | PP: 290-295 | Volume-2 Issue-3, February 2013. | Retrieval Number: C1109022313/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Wireless Mesh Network (WMN) is an important network to provide Internet access to remote areas and wireless connections in a metropolitan scale. As part of the Internet, WMN has to support diversified multimedia applications to all its users. It is essential to provide efficient Quality-of-Service support to the networks. Searching the path with the maximum available bandwidth is one of the fundamental issues for supporting in the WMN. The available path bandwidth is defined as the maximum additional rate a flow can push through saturating its path. Therefore, if the rate of traffic in a new flow on a path is no greater than the available bandwidth of this path, accepting the new traffic will not exit the bandwidth guaranteed of the existing flows. Due to interference among channel links, the bandwidth is a bottleneck metric in wired networks, is neither a defect nor additive in wireless networks. In this paper a computing path weight which captures the available path bandwidth information is proposed. This paper also show that the efficient routing protocol based on the new path weight which provides the consistency and loop-freeness to the network. The consistency property guarantees that each node makes an appropriate packet forwarding decision, so that a data packet does traverse through the exact path. The simulation experiments also show that the proposed path weight gives high-throughput paths.
Keywords: Wireless mesh networks, routing, efficient routing proactive hop-by-hop routing, distributed algorithm.