Spatial CSMA: A distributed scheduling algorithm for the SIR model with time-varying channels

2015 21st National Conference on Communications, NCC 2015

Volumn , Issue , 2015, Pages

  Swamy, Peruru Subrahmanya ^a   Ganti, Radha Krishna ^a   Jagannathan, Krishna ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CARRIER SENSE MULTIPLE ACCESS; GRAPH ALGORITHMS; GRAPHIC METHODS;

DISTRIBUTED SCHEDULING ALGORITHMS; GENERALIZED MODELS; INTERFERENCE MODELING; RATE OF CONVERGENCE; SIGNAL-TO-INTERFERENCE RATIO; THROUGHPUT OPTIMALITY; THROUGHPUT-OPTIMAL; TIME VARYING CHANNEL;

TIME VARYING NETWORKS;

EID: 84929104795     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCC.2015.7084891     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," Automatic Control, IEEE Transactions on, vol. 37, no. 12, pp. 1936-1948, 1992.
2. C. Joo, X. Lin, and N. B. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks," IEEE/ACM Transactions on Networking (TON), vol. 17, no. 4, pp. 1132-1145, 2009.
3. L. Jiang and J. Walrand, "A distributed CSMA algorithm for throughput and utility maximization in wireless networks," IEEE/ACM Transactions on Networking (TON), vol. 18, no. 3, pp. 960-972, 2010.
4. D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times. American Mathematical Soc., 2009.
5. P. Bremaud, Markov chains: Gibbs fields, Monte Carlo simulation, and queues. springer, 1999, vol. 31.
6. B. Kauffmann, F. Baccelli, A. Chaintreau, V. Mhatre, K. Papagiannaki, and C. Diot, "Measurement-based self organization of interfering 802.11 wireless access networks," in INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, May 2007, pp. 1451-1459.
7. 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," Networking, IEEE/ACM Transactions on, vol. 20, no. 3, pp. 825-836, 2012.
8. S.-Y. Yun, J. Shin, and Y. Yi, "CSMA over time-varying channels: optimality, uniqueness and limited backoff rate," in Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing. ACM, 2013, pp. 137-146.
9. C. Joo, X. Lin, J. Ryu, and N. B. Shroff, "Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels," in Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing. ACM, 2013, pp. 89-98.
10. D. Qian, D. Zheng, J. Zhang, and N. Shroff, "CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model," in INFOCOM, 2010 Proceedings IEEE. IEEE, 2010, pp. 1-9.
11. F. Baccelli and C. Singh, "Adaptive spatial Aloha, fairness and stochastic geometry," in Modeling &Optimization in Mobile, Ad Hoc &Wireless Networks (WiOpt), 2013 11th International Symposium on. IEEE, 2013, pp. 7-14.
12. G. Brar, D. M. Blough, and P. Santi, "Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks," in Proceedings of the 12th annual international conference on Mobile computing and networking. ACM, 2006, pp. 2-13.
13. P. C. Pinto and M. Z. Win, "Communication in a Poisson field of interferers," in Information Sciences and Systems, 2006 40th Annual Conference on. IEEE, 2006, pp. 432-437.
14. J. Luo and D. Guo, "Compressed neighbor discovery for wireless ad hoc networks: the Rayleigh fading case," in Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on. IEEE, 2009, pp. 308-313.
15. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," Networking, IEEE/ACM Transactions on, vol. 13, no. 2, pp. 411-424, 2005.
16. S. Rajagopalan, D. Shah, and J. Shin, "Network adiabatic theorem: an efficient randomized protocol for contention resolution," in ACM SIGMETRICS Performance Evaluation Review, vol. 37, no. 1. ACM, 2009, pp. 133-144.