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: 2014-09-30
Authors : S.Vijayalakshmi; R.Kavitha;
Page : 764-770
Keywords : Wireless scheduling; SINR; CSMA; discrete time Markov chain;
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.
Other Latest Articles
- Effect of Benzotriazole Derivatives on Steel Corrosion in Solution Simulated Carbonated Concrete
- Effect of Mineral Admixtures on Mechanical Properties of High Strength Concrete Made with Locally Available Materials
- Validity of Feasibility Studies for Infrastructure Construction Projects
- Incorporation of Marble Sludge in Industrial Building Eco-blocks or Cement Bricks Formulation
Last modified: 2014-10-12 20:06:44