Adaptive CSMA under the SINR model: Fast convergence through local gibbs optimization

2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015

Volumn , Issue , 2016, Pages 271-278

  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

ALGORITHMS; APPROXIMATION ALGORITHMS; CARRIER SENSE MULTIPLE ACCESS; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; NUMERICAL METHODS; SCHEDULING ALGORITHMS; SIGNAL INTERFERENCE; SIGNAL TO NOISE RATIO; SPURIOUS SIGNAL NOISE; STOCHASTIC SYSTEMS; TIME VARYING NETWORKS;

BETHE APPROXIMATION; INTERFERENCE MODELING; LOCAL OPTIMIZATIONS; ORDERS OF MAGNITUDE; SIGNAL TO INTERFERENCE PLUS NOISE RATIO; SINGLE-HOP WIRELESS NETWORKS; STOCHASTIC GRADIENT DESCENT; THROUGHPUT OPTIMALITY;

OPTIMIZATION;

EID: 84969749823     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2015.7447015     Document Type: Conference Paper

References (19)

1. 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.
2. 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.
3. 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.
4. P. Bremaud, Markov chains: Gibbs fields, Monte Carlo simulation, and queues. springer, 1999, vol. 31.
5. D. Lee, D. Yun, J. Shin, Y. Yi, and S.-Y. Yun, "Provable per-link delayoptimal CSMA for general wireless network topology, " in INFOCOM, 2014 Proceedings IEEE. IEEE, 2014, pp. 2535-2543.
6. M. M. Halldorsson and T. Tonoyan, "How well can graphs represent wireless interference" arXiv preprint arXiv: 1411. 1263, 2014.
7. 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.
8. J.-G. Choi, C. Joo, J. Zhang, and N. B. Shroff, "Distributed link scheduling under SINR model in multihop wireless networks, " IEEE/ACM Transactions on Networking (TON), vol. 22, no. 4, pp. 1204-1217, 2014.
9. P. S. Swamy, R. K. Ganti, and K. Jagannathan, "Spatial CSMA: A distributed scheduling algorithm for the SIR model with time-varying channels, " in Communications (NCC), 2015 Twenty First National Conference on. IEEE, 2015, pp. 1-6.
10. C. H. Kai and S. C. Liew, "Applications of belief propagation in CSMA wireless networks, " Networking, IEEE/ACM Transactions on, vol. 20, no. 4, pp. 1276-1289, 2012.
11. S.-Y. Yun, J. Shin, and Y. Yi, "CSMA using the Bethe approximation for utility maximization, " in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on. IEEE, 2013, pp. 206-210.
12. M. J. Wainwright and M. I. Jordan, "Graphical models, exponential families, and variational inference, " Foundations and TrendsR in Machine Learning, vol. 1, no. 1-2, pp. 1-305, 2008.
13. K. P. Murphy, Y. Weiss, and M. I. Jordan, "Loopy belief propagation for approximate inference: An empirical study, " in Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence. Morgan Kaufmann Publishers Inc., 1999, pp. 467-475.
14. F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler, "An aloha protocol for multihop mobile wireless networks, " Information Theory, IEEE Transactions on, vol. 52, no. 2, pp. 421-436, 2006.
15. 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.
16. 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.
17. S. Boyd and L. Vandenberghe, Convex optimization. Cambridge university press, 2009.
18. L. Jiang and J. Walrand, "Scheduling and congestion control for wireless and processing networks, " Synthesis Lectures on Communication Networks, vol. 3, no. 1, pp. 1-156, 2010.
19. P. S. Swamy, R. K. Ganti, and K. Jagannathan, "Adaptive CSMA under the SINR model: Fast convergence through local Gibbs optimization, " Tech. Rep., 2015. [Online]. Available: www. ee. iitm. Ac. in/-rganti/Tech Report. pdf