Utility bounds of joint congestion and medium access control for CSMA based wireless networks

KSII Transactions on Internet and Information Systems

Volumn 11, Issue 1, 2017, Pages 193-213

  Wang, Tao ^a   Yao, Zheng ^a   Zhang, Baoxian ^a   Li, Cheng ^b  

^a UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Joint optimization; Link scheduling; Multi path routing; Network utility maximization; Weighted network capacity

Indexed keywords

ACCESS CONTROL; CARRIER SENSE MULTIPLE ACCESS; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS; WIRELESS NETWORKS;

JOINT OPTIMIZATION; LINK SCHEDULING; MULTI PATH ROUTING; NETWORK UTILITY MAXIMIZATION; WEIGHTED NETWORKS;

MEDIUM ACCESS CONTROL;

EID: 85011067333     PISSN: 19767277     EISSN: 22881468     Source Type: Journal    
DOI: 10.3837/tiis.2017.01.010     Document Type: Article

References (28)

1. Mung Chiang, Steven H. Low, Robert A. Calderbank, and John C. Doyle, “Layering as optimization decomposition - A mathematical theory of network architectures,” in Proc. of the IEEE, vol. 95, no. 1, pp. 255-312, January 2007.
2. Steven H. Low and David E. Lapsley, “Optimization Flow Control, I: Basic Algorithm and Convergence,” IEEE/ACM Transactions on Networking, vol. 7, no. 6, pp. 861-874, December 1999.
3. Xiaojun Lin, Ness B. Shroff, and R. Srikant, “On the connection-level stability of congestion-controlled communication networks,” IEEE Transactions on Information Theory, vol. 54, no. 5, pp. 2317-2338, May 2008.
4. Roberto Cominetti and Cristobal Guzmán, “Network congestion control with Markovian multipath routing,” Mathematical Programming, vol. 147, no. 1, pp. 231-251, October 2014.
5. Andres Ferragut and Fernando Paganini, “Network Resource Allocation for Users With Multiple connections fairness and stability,” IEEE/ACM Transactions on Networking, vol. 22, no. 2, pp. 349-362, April 2014.
6. Jang-Won Lee, Mung Chiang, and Robert A. Calderbank, “Jointly optimal congestion and medium access control in ad hoc wireless,” in Proc. of IEEE 2006 Vehicular Technology Conference (VTC’06), pp. 284-288, May 2006.
7. Xin Wang and Koushik Kar, “Cross-layer rate optimization for proportional fairness in multihop wireless networks with random access,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 8, pp. 1548-1559, August 2006.
8. Atilla Eryilmaz and R. Srikant, “Joint Congestion Control, Routing and MAC for stability and fairness in wireless networks,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 8, pp. 1514-1524, August 2006.
9. Michael J. Neely, Eytan Modiano, and Chih-Ping Li, “Fairness and optimal stochastic control for heterogeneous networks,” IEEE/ACM Transactions on Networking, vol. 16, no. 2, pp. 396-409, Apr. 2008.
10. Peng Wang and Stephan Bohacek, “Practical Computation of Optimal Schedules in Multihop Wireless Networks,” IEEE/ACM Transactions on Networking, vol. 19, no. 2, pp. 305-318, April 2011.
11. Libin Jiang and Jean Walrand, “A Distributed CSMA Algorithm for Throughput and Utility Maximization in wireless networks,” IEEE/ACM Transactions on Networking, vol. 18, no. 3, pp. 960-972, June 2010.
12. Jiaping Liu, Yung Yi, Alexandre Proutierel, Mung Chiang, and H. Vincent Poort, “Convergence and Tradeoff of Utility-Optimal CSMA,” in Proc. of Broadband Communications, Networks, and Systens Conference, pp. 1-8, September 2009.
13. Libin Jiang and Jean Walrand, “Approaching Throughput-Optimality in a Distributed CSMA Scheduling Algorithms with Collisions,” IEEE/ACM Transactions on Networking, vol. 19, no. 3, pp. 816-829, June 2011.
14. Caihong Kai and Shengli Zhang, “Throughput Analysis of CSMA Wireless Networks with Finite Offered-load,” in Proc. of IEEE 2013 International Conference on Communications (ICC’13), pp. 6101-6106, June 2013.
15. Hyeryung Jang, Se-Young Yun, Jinwoo Shin, and Yung Yi, “Distributed Learning for Utility Maximization over CSMA-based Wireless Multihop Networks,” in Proc. of IEEE International Conference on Computer Communications (INFOCOM’14), pp. 280-288, May 2014.
16. Jian Ni, Bo Tan, and R. Srikant, “Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks,” IEEE/ACM Transactions on Networking, vol. 20, no. 3, pp. 825-836, June 2012.
17. Se-Young Yun, Jinwoo Shin, and Yung Yi, “CSMA over time-varying channels: optimality, uniqueness and limited backoff rate,” in Proc. of ACM 2013 Internatinal symposium on Mobile ad hoc networking and computing (MobiHoc’13), pp. 137-146, July 2013.
18. Jin-Ghoo Choi, Changhee Joo, Junshan Zhang, and N. B. Shroff, “Distributed Link Scheduling Under SINR Model in multihop wireless networks,” IEEE/ACM Transactions on Networking, vol. 22, no. 4, pp. 1204-1217, August 2014.
19. Michael J. Neely, Eytan Modiano, and Charles E. Rohrs, “Dynamic Power Allocation and Routing for time varing wireless networks,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 1, pp. 98-103, January 2005.
20. Giuseppe Bianchi, “Performance analysis of the IEEE 802.11 distributed coordination function,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 3, pp. 535-547, March 2000.
21. Bruno Nardelli and Edward W. Knightly, “Closed-form throughput expressions for CSMA networks with collisions and hidden terminals,” in Proc. of IEEE 2012 International Conference on Computer Communications (INFOCOM’12), pp. 2309-2317, March 2012.
22. Beakcheol Jang and Mihail. L. Sichitiu, “IEEE 802.11 Saturation Throughput Analysis in the Presence of Hidden Terminals,” IEEE/ACM Transactions on Networking, vol. 20, no. 2, pp. 557-570, April 2012.
23. Nikolaos M. Freris, “Performance bounds for CSMA-based Medium Access Control,” in Proc. of IEEE Decision and Control and European Control Conference (CDC-EDC’11), pp. 5945-5950, December 2011.
24. Sankrith Subramanian, Eduardo L. Pasiliao, John M. Shea, Jess W. Curtis, and Warren E. Dixon, “Throughput Maximization in CSMA Networks with Collisions and Hidden Terminals,” Springer Proceedings in Mathematics and Statistics, pp. 195-205, July 2012.
25. Soung Chang Liew, Cai Hong Kai, Hang Ching Leung, and Piu Wong, “Back-of-the-envelope computation of throughput distributions in CSMA wireless networks,” IEEE Transactions on Mobile Computing, vol. 9, no. 9, pp. 1319-1331, May 2010.
26. Xin Wang and Koushik Kar, “Throughput Modelling and Fairness Issues in CSMA/CA Based Ad-Hoc Networks,” in Proc. of IEEE 2005 International Conference on Computer Communications (INFOCOM’05), pp. 23-31, March 2005.
27. F.P. Kelly, Reversibility and Stochastic Networks, Wiley, 1979.
28. Libin Jiang and Jean Walrand, “Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput,” Technical Report, University of California at Berkeley, March 2009.