Constant-time distributed scheduling policies for ad hoc wireless networks

IEEE Transactions on Automatic Control

Volumn 54, Issue 2, 2009, Pages 231-242

  Lin, Xiaojun ^a   Rasool, Shahzada B ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Ad hoc wireless networks; Constant time scheduling algorithms; Distributed algorithms; Efficiency ratio

Indexed keywords

AD HOC NETWORKS; PARALLEL ALGORITHMS; REAL TIME SYSTEMS; SCHEDULING; TELECOMMUNICATION NETWORKS;

AD HOC WIRELESS NETWORKS; APPROXIMATION RATIOS; CAPACITY REGIONS; COMPUTATION TIME; CONSTANT-TIME SCHEDULING ALGORITHMS; DISTRIBUTED ALGORITHMS; DISTRIBUTED SCHEDULING; EFFICIENCY RATIO; LARGE NETWORKS; NETWORK SIZES; NEW CLASS; SCHEDULING POLICIES; UNIQUE FEATURES;

SCHEDULING ALGORITHMS;

EID: 61349122836     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2008.2010888     Document Type: Article

References (44)

1. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks," in Proc. IEEE Conf. Decision Control, San Diego, CA, Dec. 2006, pp. 1258-1263.
2. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
3. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
4. M. J. Neely, E. Modiano, and C. E. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," in Proc. IEEE INFOCOM San Francisco, CA, Apr. 2003, pp. 745-755.
5. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Networking, vol. 13, no. 2, pp. 411-424, Apr. 2005.
6. R. L. Cruz and A. V. Santhanam, "Optimal routing, link scheduling and power control in multi-hop wireless networks," in Proc. IEEE INFOCOM San Francisco, CA, Apr. 2003, pp. 702-711.
7. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on cross-layer rate control in wireless networks," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, pp. 1804-1814.
8. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on cross-layer congestion control in wireless networks," IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 302-315, Apr. 2006.
9. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in wireless networks," in Proc. 43rd Annu. Allerton Conf. Commun., Control Comput., Monticello, IL, Sep. 2005, [CD ROM].
10. P. Chaporkar, K. Kar, and S. Sarkar, "Achieving queue length stability through maximal scheduling in wireless networks," in Proc. Inform. Theory Appl. Inaugural Workshop, San Diego, CA, Feb. 2006, [CD ROM].
11. X. Wu, R. Srikant, and J. R. Perkins, "Queue-length stability of maximal greedy schedules in wireless network," in Proc. Inform. Theory Appl. Inaugural Workshop, San Diego, CA, Feb. 2006, [CD ROM].
12. X. Wu and R. Srikant, "Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks," in Proc. IEEE INFOCOM Barcelona, Spain, Apr. 2006, pp. 1-12.
13. T. Weller and B. Hajek, "Scheduling nonuniform traffic in a packet-switching system with small propagation delay," IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 813-823, Dec. 1997.
14. J. G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 556-564.
15. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "On the stability of input-queued switches with speed-up," IEEE/ACM Trans. Networking, vol. 9, no. 1, pp. 104-118, Feb. 2001.
16. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. IEEE INFOCOM, New York, NY, Mar./Apr. 1998, vol. 2, pp. 533-539.
17. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," in Proc. ACM SIGMETRICS, Jun. 2006, pp. 27-38.
18. A. Israeli and A. Itai, "A fast and simple randomized parallel algorithm for maximal matching," Inform. Processing Lett., vol. 22, no. 2, pp. 77-80, Jan. 1986.
19. J. G. Dai, "On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models," Annals Appl. Prob., vol. 5, no. 1, pp. 49-77, Feb. 1995.
20. A. N. Rybko and A. L. Stolyar, "Ergodicity of stochastic processes describing the operation of open queueing networks," Problems Inform. Transm., vol. 28, pp. 199-220, 1992.
21. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inform. Theory, vol. IT-34, no. 5, pp. 910-917, Sep. 1988.
22. 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 Control, Maui, HI, Dec. 2003, pp. 564-569.
23. Y. Yi and S. Shakkottai, "Hop-by-hop congestion control over a wireless multi-hop network," in Proc. IEEE INFOCOM, Hong Kong, Mar. 2004, pp. 2548-2558.
24. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
25. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest queue first scheduling: Second order properties using fluid limits," Adv. Appl. Prob., vol. 38, no. 2, pp. 505-521, Jun. 2006.
26. A. Brzezinski, G. Zussman, and E. Modiano, "Enabling distributed throughput maximization in wireless mesh networks_A partitioning approach," in ACM Mobicom, Los Angeles, CA, Sep. 2006, pp. 26-37.
27. D. E. Drake and S. Hougardy, "A linear-time approximation algorithm for weighted matchings in graph," ACM Trans. Algorithms, vol. 1, no. 1, pp. 107-122, Jul. 2005.
28. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "On the complexity of scheduling in wireless networks," in ACM Mobicom, Los Angeles, CA, Sep. 2006, pp. 227-238.
29. H. Balakrishnan, C. L. Barrett, V. S. A. Kumar, M. V. Marathe, and S. Thite, "The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks," IEEE J. Selected Areas Commun., vol. 22, no. 6, pp. 1069-1079, Aug. 2004.
30. D. Peleg, Distributed Computing: A Locality-Sensitive Approach. Philadelphia, PA: Society for Idustrial and Applied Mathematics (SIAM), 2000.
31. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for broadcast channels," in Proc. ISIT'02, Lausanne, Switzerland, Jun./Jul. 2002, p. 382.
32. R. Durrett, Probability: Theory and Examples, 3rd ed. Belmont, CA: Brooks/Cole, 2005.
33. Y. S. Chow, "On a strong law of large numbers for martingales," Annals Math. Stat., vol. 38, no. 2, p. 610, Apr. 1967.
34. J. M. Borwein and A. S. Lewis, Convex Analysis and Nonlinear Optimization: Theory and Examples. New York: Springer, 2000.
35. A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks," in Proc. IEEE INFOCOM Anchorage, AK, May 2007, pp. 1631-1639.
36. C. Joo and N. B. Shroff, "Performance of random access scheduling schemes in multi-hop wireless networks," in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 19-27.
37. P. R. Kumar and T. I. Seidman, "Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems," IEEE Trans. Automat. Control, vol. 35, no. 3, pp. 289-298, Mar. 1990.
38. S. H. Lu and P. R. Kumar, "Distributed scheduling based on due dates and buffer priorities," IEEE Trans. Automat. Control, vol. 36, no. 12, pp. 1406-1416, Dec. 1991.
39. C. Humes, "A regulator stabilization technique: Kumar-Seidman revisited," IEEE Trans. Automat. Control, vol. 39, no. 1, pp. 191-196, Jan. 1994.
40. X. Wu and R. Srikant, "Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing," in Proc. IEEE CDC, Seville, Spain, Dec. 2005, pp. 5342-5347.
41. X. Lin and N. B. Shroff, "The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks," Purdue University, West Lafayette, IN, Tech. Rep., 2004 [Online]. Available: http://min.ecn.purdue.edu/~linx/papers.html
42. S. Ray and S. Sarkar, "Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning," in Proc. Inform. Theory Appl. 2nd Workshop, Univ. California, San Diego, CA, Jan. 2007.
43. K. Jung and D. Shah, "Low delay scheduling in wireless network," in Proc. IEEE ISIT, Nice, France, Jun. 2007, pp. 1396-1400.
44. S. Sanghavi, L. Bui, and R. Srikant, "Distributed link scheduling with constant overhead," in Proc. ACM SIGMETRICS, San Diego, CA, Jun. 2007, pp. 313-324.