Performance of random access scheduling schemes in multi-hop wireless networks

IEEE/ACM Transactions on Networking

Volumn 17, Issue 5, 2009, Pages 1481-1493

  Joo, Changhee ^a   Shroff, Ness B ^a  

^a Ohio State University   (United States)

Author keywords

Capacity region; Communication systems; Multi hop wireless networks; Random access scheduling; Stability

Indexed keywords

ANALYTICAL RESULTS; CAPACITY REGION; DISTRIBUTED OPERATIONS; HIGH THROUGHPUT; LOCAL INFORMATION; MULTI-HOP TRAFFIC; MULTI-HOP WIRELESS NETWORKS; MULTIHOP; MULTIHOP WIRELESS NETWORK; PERFORMANCE GUARANTEES; RANDOM ACCESS; RANDOM ACCESS SCHEDULING; SCHEDULING PROBLEM; SCHEDULING SCHEMES; SINGLE-HOP; THROUGHPUT OPTIMAL SCHEDULING; THROUGHPUT PERFORMANCE; TIME COMPLEXITY; WIRELESS SYSTEMS;

COMMUNICATION SYSTEMS; SCHEDULING; SYSTEM STABILITY; THROUGHPUT;

WIRELESS NETWORKS;

EID: 70350558445     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2008.2010857     Document Type: Article

References (21)

1. X. Lin and N. B. Shroff, "Joint rate control and scheduling in multihop wireless networks," in Proc. IEEE Conf. Decision and Control, Dec. 2004, vol. 2, pp. 1484-1489.
2. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu, "Joint asynchronous congestion control and distributed scheduling for multi-hop wireless networks," in IEEE INFOCOM 2006, Barcelona, Spain, Apr. 2006, 12 pp.
3. Y. Yi, G. de Veciana, and S. Shakkottai, "Learning contention patterns and adapting to load/topology changes in a MAC scheduling algorithm," in Proc. 2nd IEEE Workshop on Wireless Mesh Networks (WiMesh 2006) Sep. 2006, pp. 23-32.
4. X. Wang and K. Kar, "Cross-layer rate control in multi-hop wireless networks with random access," in ACM MOBIHOC, May 2005.
5. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on cross-layer congestion control in wireless networks," IEEE/ACM Trans. Netw., vol. 14, no. 2, pp. 302-315, Apr. 2006.
6. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks," in Proc. IEEE Conf. Decision and Control, Dec. 2006, pp. 1258-1263.
7. P. Chaporkar, K. Kar, X. Luo, and S. Sarkar, "Throughput and fairness guarantees through maximal scheduling in wireless networks," IEEE Trans. Inf. Theory, vol. 54, no. 2, pp. 572-594, Feb. 2008.
8. X. Wu and R. Srikant, "Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks," in IEEE INFOCOM 2006 Barcelona, Spain, Apr. 2006, 12 pp.
9. A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks," in IEEE INFOCOM 2007 Anchorage, Alaska, May 2007, pp. 1631-1639.
10. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," ACM Sigmetrics Performance Evaluation Review, vol. 34, no. 1, pp. 27-38, 2006.
11. S. Sanghavi, L. Bui, and R. Srikant, "Distributed link scheduling with constant overhead," in ACM Sigmetrics, Jun. 2007.
12. A. Eryilmaz, A. Ozdaglar, and E. Modiano, "Polynomial complexity algorithms for full utilization of multi-hop wireless networks," in IEEE INFOCOM 2007, Anchorage, Alaska, May 2007, pp. 499-507.
13. S. Sarkar and L. Tassiulas, "End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks," in Proc. IEEE Conf. Decision and Control, Dec. 2003, vol. 1, pp. 564-569.
14. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
15. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "On the stability of input-queued switches with speed-up," IEEE/ACM Trans. Netw., vol. 9, no. 1, pp. 104-118, Feb. 2001.
16. M. Hanckowiak, M. Karonski, and A. Panconesi, "On the distributed complexity of computing maximal matchings," SIAM J. Discrete Mathematics, vol. 15, no. 1, pp. 41-57, 2001.
17. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in IEEE INFOCOM'98, San Francisco, CA, Mar.-Apr. 1998, vol. 2, pp. 533-539.
18. G. Sharma, C. Joo, and N. B. Shroff, "Distributed scheduling schemes for throughput guarantees in wireless networks," in 44th Annual Allerton Conf. Communications, Control, and Computing, Univ. Illinois, Sep. 2006.
19. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "Maximum weighted matching with interference constraints," in 4th Annual IEEE Int. Conf. Pervasive Computing and Communications Workshops (PerCom Workshops 2006) Pisa, Italy, Mar. 2006, 5 pp.
20. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits," Advances in Applied Probability, vol. 38, no. 2, pp. 505-521, 2006.
21. J. G. Dai, "On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models," Annals of Applied Probability, vol. 5, no. 1, pp. 49-77, 1995.