Dynamic routing algorithm in wireless mesh network

被引：0

作者：

Gupta B.K. ^{[1
]}

Patnaik S. ^{[1
]}

Mallick M.K. ^{[1
]}

Nayak A.K. ^{[1
]}

机构：

[1] Department of Computer Science Engineering, Siksha 'O' Anusandhan University, Bhubaneswar, 753010, Odisha

来源：

International Journal of Grid and Utility Computing | 2017年 / 8卷 / 01期

关键词：

Congestion; Dynamic traffic; NS2; Routing protocol; Wireless mesh networks;

D O I：

10.1504/IJGUC.2017.082144

中图分类号：

学科分类号：

摘要：

Wireless mesh networks (WMNs) have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband internet access. WMNs have been broadly accepted in the conventional application sectors of ad hoc networks because of their advantages over other wireless networks. Traffic routing has a critical role in determining the performance of wireless mesh networks. Routing protocol design for wireless mesh networks is critical to maintain the performance and reliability of wireless mesh networks. Thus a routing protocol or an algorithm for WMNs should be carefully designed taking into account the specific characteristics of that network. Traditional routing protocols send traffic along pre-determined paths and have been shown ineffective in coping with unreliable and unpredictable wireless medium. In this paper we propose to formulate the mesh network routing problem as an optimisation problem. In the formulation of the problem we have considered both the static and dynamic traffic demand. This paper proposes a dynamic routing algorithm that is able to provide the optimal performance on all possible traffic demands. Our simulation results show that the proposed method performs competitively. Copyright © 2017 Inderscience Enterprises Ltd.

引用

页码：53 / 60

页数：7

共 26 条

[1]

Akyildiz I.F., Wang X., A survey on wireless mesh networks, Communications Magazine, 43, 9, pp. S23-S30, (2005)

[2]

Akyildiz I.F., Wang X., Wang W., Wireless mesh networks: A survey, Computer Networks, 47, pp. 445-487, (2005)

[3]

Alicherry M., Bhatia R., Li L., Joint channel assignment and rout- ing for throughput optimization in multi-radio wireless mesh networks, Proc. of ACM MobiCom., (2005)

[4]

Anil Kumar V.S., Marathe M.V., Parthasarathy S., Srinivasan A., Algorithmic aspects of capacity in wireless networks, Proc. of ACM SIGMETRICS, pp. 133-144, (2005)

[5]

Azar Y., Cohen E., Fiat A., Kaplan H., Racke H., Optimal oblivious routing in polynomial time, J. Comput. Syst. Sci., 69, 3, (2004)

[6]

Barolli A., Xhafa F., Sanchez C., Takizawa M., A study on the effect of mutation in genetic algorithms for mesh router placement problem in wireless mesh networks, International Conference on Complex, Intelligent, and Software Intensive Systems, pp. 7695-14373, (2011)

[7]

Biswas S., Morris R., Exor: Opportunistic multi-hop routing for wireless networks, Proc. of ACM SIGCOMM, pp. 133-144, (2005)

[8]

Bokhari F., Zaruba G., Partially overlapping channel assignments in wireless mesh networks, Wireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies, (2012)

[9]

Draves R., Padhye J., Zill B., Routing in multi-radio multi-hop wireless mesh networks, Proc. of ACM Mobicom, pp. 114-128, (2004)

[10]

Gambiroza V., Sadeghi B., Knightly E.W., End-to-end performance and fairness in multihop wireless backhaul networks, Proc. of ACM MobiCom., (2004)

← 1 2 3 →