Constant-time distributed scheduling policies for ad hoc wireless networks

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2006, Pages 1258-1263

  Lin, Xiaojun ^a   Rasool, Shahzada B ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PUBLIC POLICY; SCHEDULING;

COMPUTATION TIME; DISTRIBUTED SCHEDULING; NETWORK SIZE; SCHEDULING POLICIES;

AD HOC NETWORKS;

EID: 34548328716     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2006.376968     Document Type: Conference Paper

References (21)

1. P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, March 2000.
2. L. Tassiulas and A. Ephremides, "Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks," IEEE Transactions on Automatic Control, vol. 37, no. 12, pp. 1936-1948, December 1992.
3. M. J. Neely, E. Modiano, and C. E. Rohrs, "Dynamic Power Allocation and Routing for Time Varying Wireless Networks," in Proceedings of IEEE INFOCOM, San Brancisco, April 2003.
4. A. Eryilmaz, R. Srikant, and J. Perkins, "Stable Scheduling Policies for Bading Wireless Channels," IEEE/ACM Transactions on Networking, vol. 13, no. 2, pp. 411-424, April 2005.
5. R. L. Cruz and A. V. Santhanam, "Optimal Routing, Link Scheduling and Power Control in Multi-hop Wireless Networks," in Proceedings of IEEE INFOCOM, San Brancisco, April 2003.
6. X. Lin and N. B. Shroff, "The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks," in Proceedings of IEEE INFOCOM, Miami, FL, March 2005.
7. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput Guarantees in Maximal Scheduling in Wireless Networks," in Proceedings of 43rd Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, September 2005.
8. _, "Achieving Queue Length Stability Through Maximal Scheduling in Wireless Networks," in Proceedings of Information Theory and Applications Inaugural Workshop, University of California, San Diego, February 2006.
9. X. Wu, R. Srikant, and J. R. Perkins, "Queue-Length Stability of Maximal Greedy Schedules in Wireless Network," in Proceedings of Information Theory and Applications Inaugural Workshop, University of California, San Diego, February 2006.
10. X. Wu and R. Srikant, "Bounds on the Capacity Region of Multihop Wireless Networks Under Distributed Greedy Scheduling," in Proceedings of IEEE INFOCOM, Barcelona, Spain, April 2006.
11. M. Hanckowiak, M. Karonski, and A. Panconesi, "On the Distributed Complexity of Computing Maximal Matching," SIAM Journal of Discrete Mathematics, vol. 15, no. 1, pp. 41-57, 2001.
12. J. G. Dai and B. Prabhakar, "The Throughput of Data Switches with and without Speedup," in Proceedings of IEEE INFOCOM, Tel Aviv, Israel, March 2000, pp. 556-564.
13. E. Leonardi, M. Mellia, B. Neri, and M. A. Marsan, "On the Stability of Input-Queued Switches with Speed-Up," IEEE/ACM Transactions on Networking, vol. 9, no. 1, pp. 104-118, February 2001.
14. S. Sarkar and L. Tassiulas, "End-to-end Bandwidth Guarantees Through Fair Local Spectrum Share in Wireless Ad-hoc Networks," in Proceedings of the IEEE Conference on Decision and Control, Maui, Hawaii, December 2003.
15. Y Yi and S. Shakkottai, "Hop-by-hop Congestion Control over a Wireless Multi-hop Network," in Proceedings of IEEE INFOCOM, Hong Kong, March 2004.
16. D. E. Drake and S. Hougardy, "A Linear-Time Approximation Algorithm for Weighted Matchings in Graph," ACM Transactions on Algorithms, vol. 1, no. 1, pp. 107-122, July 2005.
17. X. Lin and S. Rasool, "Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks," Technical Report, Purdue Uniersity, available at http://min.ecn.purdue.edu/~linx/papers.html, 2006.
18. B. Hajek and G. Sasaki, "Link Scheduling in Polynomial Time," IEEE Transactions on Information Theory, vol. 34, no. 5, pp. 910-917, September 1988.
19. J. G. Dai, "On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach via Bluid Limit Models," Annals of Applied Probability, vol. 5, pp. 49-77, 1995.
20. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable Scheduling Policies for Broadcast Channels," in ISIT 2002, Lausanne, Switzerland, June-July 2002.
21. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "On the Complexity of Scheduling in Wireless Networks," in ACM Mobicom, Los Angeles, CA, September 2006.