Distributed SINR based scheduling algorithm for multi-hop wireless networks

MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems

Volumn , Issue , 2010, Pages 376-380

  Ryu, Jiho ^a   Joo, Changhee ^b   Kwon, Ted Taekyoung ^a   Shroff, Ness B ^c   Choi, Yanghee ^a  

^a Seoul National University   (South Korea)

^b Korea University of Technology and Education   (South Korea)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

csma ca; discrete time markov chain; sinr; wireless scheduling

Indexed keywords

CARRIER SENSING; CSMA/CA; DELAY PERFORMANCE; DISCRETE TIME MARKOV CHAINS; DISTRIBUTED ALGORITHM; DISTRIBUTED IMPLEMENTATION; DISTRIBUTED SCHEDULING; INTERFERENCE MODELS; MULTIHOP WIRELESS NETWORK; SIMULTANEOUS TRANSMISSION; SINR; SYSTEM STATE; THROUGHPUT OPTIMALITY; TRANSMISSION FAILURES; WIRELESS SCHEDULING;

CARRIER SENSE MULTIPLE ACCESS; MARKOV PROCESSES; QUEUEING NETWORKS; WIRELESS NETWORKS;

SCHEDULING ALGORITHMS;

EID: 78650223391     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1868521.1868583     Document Type: Conference Paper

References (16)

1. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," in IEEE Transactions on Automatic Control, vol. 36, pp. 1936-1948, 1992.
2. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on cross-layer congestion control in wireless networks," in IEEE/ACM Trans. Netw., vol. 14, no. 2, pp. 302-315, 2006.
3. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "On the stability of input-queued switches with speed-up," in IEEE/ACM Trans. Netw., vol. 9, no. 1, pp. 104-118, 2001.
4. N. McKeown, "Scheduling algorithms for input-queued cell switches," Ph.D. dissertation, Univ. California, Berkeley, 1995.
5. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits," in Adv. Appl. Probab., vol. 38, no. 2, pp. 505-521, 2006.
6. J.-H. Hoepman, "Simple distributed weighted matchings," Oct. 2004 [Online]. http://arxiv.org/abs/cs/0410047v1
7. C. Joo, "A Local Greedy Scheduling Scheme with Provable Performance Guarantee," in ACM MobiHoc, 2008.
8. L. Jiang and J. Walrand, "A distributed CSMA algorithm for throughput and utility maximization in wireless networks," in Allerton Conference, 2008.
9. P. Marbach and A. Eryilmaz, "A backlog-based csma mechanism to achieve fairness and throughput-optimality in wireless networks," in Allerton Conference, 2008.
10. J. Ni and R. Srikant, "Distributed CSMA/CA Algorithms for Achieving Maximum Throughput in Wireless Networks," in ITA, 2009.
11. J. Ni, B. Tan, and R. Srikant, "Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks," in IEEE INFOCOM 2010.
12. D. Qian and D. Zheng and J. Zhang and N, Shroff, "CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model," in IEEE INFOCOM 2010.
13. N. Ehsan and R. Cruz, "On the optimal SINR in random access networks with spatial reuse," in IEEE CISS, 2006.
14. A. Dimakis, R. Srikant, and J. R. Perkins, "Stable Scheduling policies for fading wireless channels," in IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 411-424, 2005.
15. L. Qiu, Y. Zhang, F. Wang, M. K. Han, R. Mahajan, "A General Model of Wireless Interference," in ACM MobiCom, 2007.
16. Theodore Rappaport, "Wireless Communications: Principles and Practice," Prentice Hall PTR, 2001.