Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning

IEEE Transactions on Automatic Control

Volumn 53, Issue 10, 2008, Pages 2307-2323

  Sarkar, Saswati ^a   Ray, Saikat ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b University of Bridgeport   (United States)

Author keywords

Tree partition mapping (TPM)

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); GRAPH THEORY; KETONES; TREES (MATHEMATICS); WIRELESS NETWORKS;

APPROXIMATION FACTORS; ARBITRARY NETWORKS; CLOSE APPROXIMATIONS; COMPUTATION TIMES; DYNAMIC LINKS; GRAPH PARTITIONING; INTERFERENCE MODELS; LOGARITHMIC COMPUTATIONS; LYAPUNOV; MAXIMUM DEGREES; MAXIMUM THROUGHPUTS; NETWORK SIZES; NODE DEGREES; OF GRAPHS; TREE TOPOLOGIES; TREE-PARTITION-MAPPING (TPM);

THROUGHPUT;

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

References (29)

1. A. Brzezinski, G. Zussman, and E. Modiano, "Distributed throughput maximization in wireless mesh networks - a partitioning approach," presented at the ACM MOBICOM, Los Angeles, CA, Sep. 2006.
2. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in multihop wireless networks," presented at the 43rd Annu. Allerton Conf. Commun., Control Comput., Allerton, IL, Sep. 28-30, 2005.
3. J. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proc. INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 556-564.
4. 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.
5. D. Shah, E. Modiano, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," presented at the ACM SIGMETRICS/IFIP Performance, Jun. 2006.
6. G. Fayolle, V. A. Malyshev, and M. V. Menshikov, Topics in the Constructive Theory of Countable Markov Chains. Cambridge, U.K.: Cambridge Univ. Press, 1995.
7. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 388-404, Apr. 2000.
8. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inform. Theory, vol. IT-34, no. 6, pp. 910-917, Sep. 1988.
9. H. Hunt, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns, "Nc-approximation schemes for NP- and PSPACE-HARD problems in geometric graphs," J. Algorithms, vol. 26, no. 2, Feb. 1998.
10. 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, Feb. 1986.
11. K. Jung and D. Shah, "Low delay scheduling in wireless networks," in Proc. ISIT, 2007, pp. 1396-1400.
12. K. Jung and D. Shah, "Low Delay Scheduling in Wireless Networks," Tech. Rep., 2007 [Online]. Available: http://web.mit.edu/devavrat/www/delay.pdf
13. F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer, "Local approximation schemes for ad hoc and sensor networks," presented at the DIALM-POMC Cologne, Germany, Sep. 2, 2005.
14. P. R. Kumar and S. P. Meyn, "Stability of queueing networks and scheduling policies," IEEE Trans. Automat. Control, vol. 40, no. 2, pp. 251-260, Feb. 1995.
15. N. Li and J. C. Hou, "Topology control in heterogeneous wireless networks: Problems and solutions," in Proc. IEEE Infocom, Hong Kong, China, Mar. 2004, vol. 1, p. 234.
16. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks," in Proc. IEEE CDC-ECC'05, San Diego, CA, Dec. 2006, pp. 1258-1263.
17. X. Lin and N. Shroff, "The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks," presented at the INFOCOM, Miami, FL, Mar. 2005.
18. M. Luby, "A simple parallel algorithm for the maximal independent set problem," SIAM J. Comput., vol. 15, no. 4, pp. 1036-1055, 1986.
19. M. Neely, E. Modiano, and C. Li, "Fairness and optimal stochastic control for heterogeneous networks," presented at the INFOCOM, Miami, FL, Mar. 2005.
20. T. Nieberg, J. Hurink, and W. Kern, "A robust ptas for maximum weight independent sets in unit disk graphs," in Graph Theoretic Concepts in Computer Science. Heidelberg, Germany: Springer, 2004, pp. 214-221.
21. D. Peleg, Distributed Computing: A Locality-Sensitive Approach. Philadelphia, PA: Society of Industrial and Applied Mathematics, 2000.
22. T. Salonidis and L. Tassiulas, "Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks," in Proc. 6th ACM Int. Symp. Mobile ad hoc Networking Comput., Urbana-Champaign, IL, 2005, pp. 1545-156.
23. S. Sarkar and K. Kar, "Achieving 2/3 throughput approximation with sequential maximal scheduling under primary interference constraints," presented at the 44th Annu. Allerton Conf. Commun., Control Comput., Allerton, IL, Sep. 27-29, 2006.
24. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "On the complexity of scheduling in wireless networks," presented at the ACM MOBICOM, Los Angeles, CA, Sep. 2006.
25. R. Srikant, S. Sanghavi, and L. Bui, "Distributed link scheduling with constant overhead," presented at the ACM SIGMETRICS, 2007.
26. L. Tassiulas, "Scheduling and performance limits of networks with constantly changing topology," IEEE Trans. Inform. Theory, vol. 43, no. 3, pp. 1067-1073, May 1997.
27. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. INFOCOM, 1998, pp. 533-539.
28. L. Tassiulas and A. Ephremidis, "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.
29. X. Wu and R. Srikant, "Regulated maximal matching: A distributed scheduling algorithm for multihop wireless networks with node-exclusive spectrum sharing," in Proc. IEEE CDC-ECC'05, Seville, Spain, Dec. 2005, pp. 5342-5347.