ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

DISTRIBUTED SINR-BASED SCHEDULING ALGORITHM FOR MULTIHOP WIRELESS NETWORKS

Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 9)

Publication Date:

Authors : ; ;

Page : 764-770

Keywords : Wireless scheduling; SINR; CSMA; discrete time Markov chain;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

The problem of developing distributed scheduling algorithms for high throughput in multi hop wireless networks has been extensively studied in recent years. The design of a distributed low-complexity scheduling algorithm becomes even more challenging when taking into account a physical interference model, which requires the SINR at a receiver to be checked when making scheduling decisions. To do so, we need to check whether a transmission failure is caused by interference due to simultaneous transmissions from distant nodes. In this paper, we propose a scheduling algorithm under a physical interference model, which is amenable to Distributed implementation with 802.11 CSMA technologies. The proposed scheduling algorithm is shown to achieve throughput optimality. We present two variations of the algorithm to enhance the delay performance and to reduce the control overhead, respectively, while retaining throughput optimality.

Last modified: 2014-10-12 20:06:44