A physical model scheduler for multi-hop wireless networks based on local information

There is wide consensus that properly taking into account wireless interference is necessary to design high performance link scheduling algorithms for multi-hop networks. However, most approaches in the literature use simplified models, which significantly abstract from the physical behavior of wireless links. Indeed, the main problem in representing the wireless propagation conditions with a proper level of detail is the very large amount of information needed, that includes the wireless link gains between all node pairs. In this paper, we propose a greedy, centralized scheduler which is based on the physical interference model but aims at exploiting local information available at each node, in order to reduce global information exchange and therefore the overhead as well as the computational complexity of the algorithm. We prove the effectiveness of our approach by extensive simulation results. We also show that our system outperforms the most up-to-date benchmark in realistic interference aware schedulers for wireless multi-hop networks.

[1]  Paolo Santi,et al.  Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks , 2006, MobiCom '06.

[2]  Marco Conti,et al.  Mobile Ad-hoc Networking - Minitrack Introduction , 2001, HICSS.

[3]  Ainslie,et al.  CORRELATION MODEL FOR SHADOW FADING IN MOBILE RADIO SYSTEMS , 2004 .

[4]  Jangeun Jun,et al.  The nominal capacity of wireless mesh networks , 2003, IEEE Wirel. Commun..

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

[6]  Leandros Tassiulas,et al.  Maximum lifetime routing in wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[7]  Catherine Rosenberg,et al.  What is the right model for wireless channel interference? , 2006, IEEE Transactions on Wireless Communications.

[8]  Leonardo Badia,et al.  A General Interference-Aware Framework for Joint Routing and Link Scheduling in Wireless Mesh Networks , 2008, IEEE Network.

[9]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.

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

[11]  Murali S. Kodialam,et al.  Characterizing the capacity region in multi-radio multi-channel wireless mesh networks , 2005, MobiCom '05.

[12]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .

[13]  Stefano Basagni,et al.  Mobile Ad Hoc Networking , 2010 .

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

[15]  Leandros Tassiulas,et al.  Jointly optimal routing and scheduling in packet radio networks , 1992, IEEE Trans. Inf. Theory.

[16]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[17]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[18]  Michele Zorzi,et al.  Gaussian Approximations for Carrier Sense Modeling in Wireless Ad Hoc Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[19]  Xiaodong Wang,et al.  Modelling and performance analysis of the distributed scheduler in IEEE 802.16 mesh mode , 2005, MobiHoc '05.

[20]  Ivan Stojmenovic,et al.  Mobile Ad Hoc Networking: Basagni/Ad Hoc Networking , 2004 .

[21]  Jean-Pierre Hubaux,et al.  A Fair Scheduling for Wireless Mesh Networks , 2005 .

[22]  Shahrokh Valaee,et al.  Distributed Link Scheduling for TDMA Mesh Networks , 2007, 2007 IEEE International Conference on Communications.