Performance of Random Access Scheduling Schemes in Multi-hop Wireless Networks

The performance of scheduling schemes in multi-hop wireless networks has attracted significant attention in the recent literature. It is well known that optimal scheduling solutions require centralized information and lead to impractical implementations due to their enormous complexity (high-degree polynomial or NP-hard, depending on the interference scenario). Further, multi-hop networks typically require distributed algorithms that operate on local information. Thus, in this paper, we develop a constant-time distributed random access algorithm for scheduling in multi-hop wireless networks. An important feature of this scheme is that it is guaranteed to achieve a fraction (efficiency factor) of the optimal performance. We show that this scheme theoretically achieves a superior efficiency factor as well as numerically achieves a significant performance improvement over the state-of-the-art. Simulation results also confirm that the performance of this scheme is close to a greedy centralized scheme.

[1]  Koushik Kar,et al.  Cross-layer rate optimization for proportional fairness in multihop wireless networks with random access , 2006, IEEE Journal on Selected Areas in Communications.

[2]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[4]  R. Srikant,et al.  Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[5]  Ness B. Shroff,et al.  Maximum weighted matching with interference constraints , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[6]  Xiaojun Lin,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[7]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks , 2006, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  Leandros Tassiulas,et al.  End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[9]  Marco Ajmone Marsan,et al.  On the stability of input-queued switches with speed-up , 2001, TNET.

[10]  Xiaojun Lin,et al.  Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks , 2006, CDC.

[11]  Koushik Kar,et al.  Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access , 2005, MobiHoc '05.

[12]  Alessandro Panconesi,et al.  On the distributed complexity of computing maximal matchings , 1997, SODA '98.

[13]  Yung Yi,et al.  Learning contention patterns and adapting to load/topology changes in a MAC scheduling algorithm , 2006, 2006 2nd IEEE Workshop on Wireless Mesh Networks.