A reactive scheduling approach to combat remote interference in TDMA-based Wireless Mesh Networks

In the context of Time Division Multiple Access (TDMA) Wireless Mesh Networks (WMNs), distributed scheduling solutions, where nodes coordinate transmissions locally, are particularly appealing because they require less signaling overhead and are more reactive than centralized solutions. However, they are also more subject to interference from nodes that lie outside the local neighborhood where transmissions are scheduled. In this paper, we first provide numerical evidence that this phenomenon, which is often disregarded in the context of TDMA scheduling for WMNs, can severely affect the network performance. Secondly, we propose a distributed reactive approach to counterbalance the negative effects of interference, based on scheduling re-negotiation, and we compare the results obtained with different allocation algorithms through simulation.

[1]  C. Siva Ram Murthy,et al.  Slot Allocation Schemes for Delay Sensitive Traffic Support in Asynchronous Wireless Mesh Networks , 2003, HiPC.

[2]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[3]  Howard Jay Siegel,et al.  Eliminating Memory for Fragmentation Within Partitionable SIMD/SPMD Machines , 1991, IEEE Trans. Parallel Distributed Syst..

[4]  Roger Wattenhofer,et al.  Complexity in geometric SINR , 2007, MobiHoc '07.

[5]  Shahrokh Valaee,et al.  Link Scheduling for Minimum Delay in Spatial Re-Use TDMA , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  Leandros Tassiulas,et al.  Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[7]  Gustavo Alonso,et al.  Log-normal shadowing meets SINR: A numerical study of Capacity in Wireless Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[8]  John E. Shore On the external storage fragmentation produced by first-fit and best-fit allocation strategies , 1975, CACM.

[9]  Edward W. Knightly,et al.  End-to-end performance and fairness in multihop wireless backhaul networks , 2004, MobiCom '04.

[10]  Songwu Lu,et al.  Characterizing flows in large wireless data networks , 2004, MobiCom '04.

[11]  Luciano Lenzini,et al.  Scheduling and Dynamic Relocation for IEEE 802.11s Mesh Deterministic Access , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[12]  Ian F. Akyildiz,et al.  A survey on wireless mesh networks , 2005, IEEE Communications Magazine.

[13]  Luciano Lenzini,et al.  Interference-aware distributed scheduling in TDMA Wireless Mesh Networks , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[14]  Prasant Mohapatra,et al.  Soft-TDMAC: A Software TDMA-Based MAC over Commodity 802.11 Hardware , 2009, IEEE INFOCOM 2009.

[15]  Dimitrios Koutsonikolas,et al.  TDM MAC protocol design and implementation for wireless mesh networks , 2008, CoNEXT '08.

[16]  Kang G. Shin,et al.  On accurate measurement of link quality in multi-hop wireless mesh networks , 2006, MobiCom '06.

[17]  Carter Bays,et al.  A comparison of next-fit, first-fit, and best-fit , 1977, CACM.