Bottleneck Analysis for Routing and Call Scheduling in Multi-Hop Wireless Networks

In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (time division multiple access) based wireless network. As we deal with multi-hop networks, these selected links represent a routing solution (paths) providing enough capacity to achieve the routers requirements of bandwidth. We present a cross-layer formulation of the problem that computes joint routing and scheduling. We use a branch-and-price algorithm to solve optimally the problem. A column generation algorithm is used to cope with the exponential set of rounds. The branch-and-bound algorithm provides mono-routing. We run experiments on networks from the literature, with different number of gateways. Experimental results as well as theoretical insights let us conjecture that the bottleneck region analysis is enough to find the optimal solution. The Integer Round-Up Property (IRUP) seems to hold for our problem.

[1]  Stéphane Pérennes,et al.  Bandwidth Allocation in Radio Grid Networks , 2008 .

[2]  Patricio Reyes,et al.  Optimal Design of Wireless Mesh Networks , 2008 .

[3]  Stéphane Pérennes,et al.  On the complexity of bandwidth allocation in radio networks , 2008, Theor. Comput. Sci..

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  James B. Orlin.  A polynomial algorithm for integer programming covering problems satisfying the integer round-up property , 1982, Math. Program..

[6]  Anthony Ephremides,et al.  Multi-hop routing and scheduling in wireless networks subject to SINR constraints , 2007, 2007 46th IEEE Conference on Decision and Control.

[7]  Hervé Rivano,et al.  A Branch-and-Price Approach to the Bandwidth Allocation Problem in Wireless Networks , 2008 .

[8]  Gurvan Huiban,et al.  Multiobjective Analysis in Wireless Mesh Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[9]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

[10]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[11]  Injong Rhee,et al.  Message stability detection for reliable multicast , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Hervé Rivano,et al.  Evaluation stochastique et simulation des réseaux radio , 2006 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[15]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[16]  L. Trotter,et al.  Integer Rounding for Polymatroid and Branching Optimization Problems , 1981 .

[17]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[18]  Ritesh Madan,et al.  Distributed algorithms for maximum lifetime routing in wireless sensor networks , 2006, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[19]  Di Yuan,et al.  Resource optimization of spatial TDMA in ad hoc radio networks: a column generation approach , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  J. Bermond,et al.  Efficient Gathering in Radio Grids with Interference † , 2005 .

[21]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[22]  Xiang-Yang Li,et al.  Efficient interference-aware TDMA link scheduling for static wireless networks , 2006, MobiCom '06.

[23]  Harish Viswanathan,et al.  Throughput-range tradeoff of wireless mesh backhaul networks , 2006, IEEE Journal on Selected Areas in Communications.

[24]  Bo Li,et al.  Joint routing and scheduling in multi-radio multi-channel multi-hop wireless networks , 2005, 2nd International Conference on Broadband Networks, 2005..