Interference Aware Routing for Minimum Frame Length Schedules in Wireless Mesh Networks

The focus of this paper is on routing in wireless mesh networks (WMNs) that results in spatial TDMA (STDMA) schedules with minimum frame length. In particular, the emphasis is on spanning tree construction; and we formulate the joint routing, power control, and scheduling problem as a mixedinteger linear program (MILP). Since this is an -complete problem, we propose a low-complexity iterative pruning-based routing scheme that utilizes scheduling information to construct the spanning tree. A randomized version of this scheme is also discussed and numerical investigations reveal that the proposed iterative pruning algorithms outperform previously proposed routing schemes that aim to minimize the transmitted power or interference produced in the network without explicitly taking into account scheduling decisions.

[1]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[2]  Oded Goldreich,et al.  On the np-completeness of certain network testing problems , 1984, Networks.

[3]  Vasilis Friderikos,et al.  Approximate dynamic programming for link scheduling in wireless mesh networks , 2008, Comput. Oper. Res..

[4]  Izhak Rubin,et al.  On the performance of graph-based scheduling algorithms for packet radio networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[5]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[6]  Robert J. Marks,et al.  Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels , 2005, IEEE/ACM Transactions on Networking.

[8]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[9]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[10]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  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).

[12]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[13]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[15]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

[18]  J. Gronkvist.  Traffic controlled spatial reuse TDMA in multi-hop radio networks , 1998, Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (Cat. No.98TH8361).

[19]  Leandros Tassiulas,et al.  Routing for network capacity maximization in energy-constrained ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  A.-M. Chou,et al.  Slot allocation strategies for TDMA protocols in multihop packet radio networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[21]  Geert J. Heijenk,et al.  Interference-based routing in multi-hop wireless infrastructures , 2006, Comput. Commun..

[22]  Vasilis Friderikos,et al.  Multi-rate power-controlled link scheduling for mesh broadband wireless access networks , 2007, IET Commun..

[23]  Craig G. Prohazka.  Decoupling Link Scheduling Constraints in Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.