Fair inter-TAP routing and backhaul assignment for wireless mesh networks

Although limiting the number of backhauls, specifically chosen transit access points (TAPs) that forward traffic from other TAPs, reduces the overall costs of a wireless mesh network (WMN), an egress bottleneck is induced, which aggregates traffic and limits the bandwidth. To avoid such problems while working to minimize budgetary expenses, we balanced traffic flow on ‘to-be-determined’ backhauls and adjacent links, a mixed nonlinearand integer-programming problem that minimizes the aggregated flow subject to budget, backhaul assignment, top-level load-balanced routing, and link capacity constraints. Two algorithms are proposed, weighted backhaul assignment (WBA) and greedy load-balanced routing (GLBR), that operate in conjunction with Lagrangean relaxation (LR), used for constructing LR-based heuristics and also as a means of quantification and evaluation of the proposed algorithms. Experiment results show that the proposed algorithms achieve near-optimization, outperforming related solutions. Copyright © 2008 John Wiley & Sons, Ltd.

[1]  Marco Conti,et al.  Mesh networks: commodity multihop ad hoc networks , 2005, IEEE Communications Magazine.

[2]  Symeon Papavassiliou,et al.  An efficient and fair cooperative approach for resource management in wireless networks , 2005, Wirel. Commun. Mob. Comput..

[3]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[4]  Richard Han,et al.  A node-centric load balancing algorithm for wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[5]  Gen-Huey Chen,et al.  Stability aware cluster routing protocol for mobile ad-hoc networks , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..

[6]  Ching-Chi Hsu,et al.  Routing in wireless/mobile ad‐hoc networks via dynamic group construction , 2000, Mob. Networks Appl..

[7]  Tzu-Jane Tsai,et al.  A access-based clustering protocol for multihop wireless ad hoc networks , 2001, IEEE J. Sel. Areas Commun..

[8]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[9]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[10]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[11]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[12]  Josef Urban,et al.  BRAIN - an architecture for a broadband radio access network of the next generation , 2001, Wirel. Commun. Mob. Comput..

[13]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[14]  Yi Pan,et al.  Architecture, mobility management, and quality of service for integrated 3G and WLAN networks , 2005, Wirel. Commun. Mob. Comput..

[15]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[16]  Qun Li,et al.  Three power-aware routing algorithms for sensor networks , 2003, Wirel. Commun. Mob. Comput..

[17]  Zygmunt J. Haas,et al.  Determining the optimal configuration for the zone routing protocol , 1999, IEEE J. Sel. Areas Commun..

[18]  Roger Karrer,et al.  Enabling large-scale wireless broadband , 2004, Comput. Commun. Rev..

[19]  Elizabeth M. Belding-Royer,et al.  Hierarchical routing in ad hoc mobile networks , 2002, Wirel. Commun. Mob. Comput..

[20]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[21]  Michael A. Trick,et al.  Cliques and clustering: A combinatorial approach , 1998, Oper. Res. Lett..

[22]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[23]  Martin G. Christopher.  Network Flows: Theory, Algorithms, and Applications , 1994 .