Interference-aware joint routing and TDMA link scheduling for static wireless networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 19, Issue 12, 2008, Pages 1709-1726

  Wang, Yu ^a   Wang, Weizhao ^b   Li, Xiang Yang ^c,d   Song, Wen Zhan ^e  

^a University of North Carolina at Charlotte   (United States)

^b GOOGLE INC   (United States)

^c Illinois Institute of Technology   (United States)

^d MICROSOFT RESEARCH ASIA   (China)

^e WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Distributed algorithm; Graph coloring; Interference; Link scheduling; Wireless networks

Indexed keywords

LINEARIZATION; PARALLEL ALGORITHMS; REAL TIME SYSTEMS; ROUTING PROTOCOLS; SCHEDULING; SCHEDULING ALGORITHMS; TIME DIVISION MULTIPLE ACCESS; TRANSMISSIONS; WIRELESS TELECOMMUNICATION SYSTEMS;

COMMUNICATION LINKS; CONSTANT FACTORS; DISTRIBUTED ALGORITHM; DISTRIBUTED ALGORITHMS; EXTENSIVE SIMULATIONS; FLOW ROUTING; GRAPH COLORING; INTERFERENCE; INTERFERENCE EFFECTS; INTERFERENCE MODELS; INTERFERENCE RANGES; JOINT ROUTING; LINEAR PROGRAMMING FORMULATIONS; LINK CAPACITIES; LINK SCHEDULING; MATHEMATICAL FORMULATIONS; MULTI-HOP WIRELESS NETWORKS; RTS/CTS; SCHEDULINGS; TIME SLOTS; TRAFFIC LOADS; TRANSMISSION POWERS; TRANSMISSION RANGES; UNIT DISK GRAPH MODELS;

WIRELESS NETWORKS;

EID: 57049115953     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2008.53     Document Type: Article

References (36)

1. M. Alicherry, R. Bhatia, and L. Li, "Joint Channel Assignment and Routing for Throughput Optimization in Multi-Radio Wireless Mesh Networks," Proc. ACM MobiCom, 2005.
2. M. Kodialam and T. Nandagopal, "The Effect of Interference on the Capacity of Multi-Hop Wireless Networks," Proc. IEEE Int'l Symp. Information Theory (ISIT), 2004.
3. M. Kodialam and T. Nandagopal, "Characterizing Achievable Rates in Multi-Hop Wireless Networks: The Joint Routing and Scheduling Problem," Proc. ACM MobiCom, 2003.
4. M. Kodialam and T. Nandagopal, "Characterizing the Capacity Region in Multi-Radio Multi-Channel Wireless Mesh Networks," Proc. ACM MobiCom 2005.
5. S. Krumke, M. Marathe, and S.S. Ravi, "Models and Approximation Algorithms for Channel Assignment in Radio Networks," ACM Wireless Networks, vol. 7, no. 6, pp. 575-584, 2001.
6. A. Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan, "End-to-End Packet-Scheduling in Wireless Ad-Hoc Networks," Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2004.
7. V.S.A. Kumar, M.V. Marathe, S. Parthasarathy, and A. Srinivasan, "Algorithmic Aspects of Capacity in Wireless Networks," SIGMETRICS Performance Evaluation Rev., vol. 33, no. 1, pp. 133-144, 2005.
8. T. Moscibroda and R. Wattenhofer, "Coloring Unstructured Radio Networks," Proc. 17th ACM Symp. Parallelism in Algorithms and Architectures (SPAA), 2005.
9. S. Ramanathan, "A Unified Framework and Algorithm for Channel Assignment in Wireless Networks," Wireless Networks, vol. 5, no. 2, pp. 81-94, 1999.
10. A. Ephremedis and T. Truong, "Scheduling Broadcasts in Multihop Radio Networks," IEEE Trans. Comm., vol. 38, no. 4, pp. 456-460, 1990.
11. E. Arikan, "Some Complexity Results About Packet Radio Networks," IEEE Trans. Information Theory, vol. 30, no. 4, pp. 190-198, 1984.
12. S. Even, O. Goldreich, S. Moran, and P. Tong, "On the NP Completeness of Certain Network Testing Problems," Networks, vol. 14, no. 1, pp. 1-24, 1984.
13. K. Jain, J. Padhye, V.N. Padmanabhan, and L. Qiu, "Impact of Interference on Multi-Hop Wireless Network Performance," Proc. ACM MobiCom, 2003.
14. W. Wang, Y. Wang, X.-Y. Li, W.Z. Song, and O. Frieder, "Efficient Interference-Aware TDMA Link Scheduling for Static Wireless Networks," Proc. ACM MobiCom, 2006.
15. P. Gupta and P. Kumar, "Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. IT-46, no. 2, pp. 388-404, 2000.
16. J. Gronkvist and A. Hansson, "Comparison Between Graph-Based and Interference-Based STDMA Scheduling," Proc. ACM MobiHoc, 2001.
17. A. Behzad and I. Rubin, "On the Performance of Graph-Based Scheduling Algorithms for Packet Radio Networks," Proc. IEEE Global Telecomm. Conf. (GLOBECOM), 2003.
18. S. Yi, Y. Pei, and S. Kalyanaraman, "On the Capacity Improvement of Ad Hoc Wireless Networks Using Directional Antennas," Proc. ACM MobiHoc 2003.
19. D.S. Hochbaum, "Efficient Bounds for the Stable Set, Vertex Cover, and Set Packing Problems," Discrete Applied Math., vol. 6, pp. 243-254, 1983.
20. G.D. Marco and A. Pelc, "Fast Distributed Graph Coloring with o(δ)Colors," Proc. 12th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2001.
21. S. Irani, "Coloring Inductive Graphs On-Line," Algorithmica, vol. 11, no. 1, pp. 53-72, 1994.
22. I. Caragiannis, A.V. Fishkin, C. Kaklamanis, and E. Papaioannou, "A Tight Bound for Online Colouring of Disk Graphs," Theoretical Computer Science, vol. 384, nos. 2-3, pp. 152-160, 2007.
23. QualNet Simulator, http://www.scalable-networks.com, 2008.
24. D.B. Johnson and D.A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," Mobile Computing, Kluwer Academic Publishers, 1996.
25. C.E. Perkins, E. Belding-Royer, and S. Das, Ad-Hoc On-Demand Distance Vector Routing, IETF RFC 3561, 2003.
26. C. Berge, Graphs and Hyper Graphs. North-Holland, 1973.
27. A. Panconesi and A. Srinivasan, "Improved Distributed Algorithms for Coloring and Network Decomposition Problems," Proc. 24th Ann. ACM Symp. Theory of Computing (STOC), 1992.
28. S. Gandham, M. Dawande, and R. Prakash, "Link Scheduling in Sensor Networks: Distributed Edge Coloring Revisited," Proc. IEEE INFOCOM 2005.
29. U. Feige and J. Kilian, "Zero Knowledge and the Chromatic Number," J. Computer System Science, vol. 57, no. 2, pp. 187-199, 1998.
30. A. Panconesi and R. Rizzi, "Some Simple Distributed Algorithms for Sparse Networks," Distributed Computing, vol. 14, no. 2, pp. 97-100, 2001.
31. A. Goldberg, S. Plotkin, and G. Shannon, "Parallel Symmetry Breaking in Sparse Graphs," Proc. 19th Ann. ACM Symp. Theory of Computing (STOC) 1987.
32. L. Chen, S.H. Low, and J.C. Doyle, "Joint Congestion Control and Media Access Control Design for Wireless Ad Hoc Networks," Proc. IEEE INFOCOM, 2005.
33. L. Chen, S.H. Low, M. Chiang, and J.C. Doyle, "Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks," Proc. IEEE INFOCOM, 2006.
34. M.J. Neely, E. Modiano, and C.E. Rohrs, "Dynamic Power Allocation and Routing Time Varying Wireless Networks," IEEE J. Selected Areas Comm., vol. 23, no. 1, pp. 89-103, 2005.
35. L. Xiao, M. Johansson, and S. Boyd, "Simultaneous Routing and Resource Allocation via Dual Decomposition," IEEE Trans. Comm., vol. 52, no. 7, pp. 1136-1144, 2004.
36. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu, "Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks," Proc. IEEE INFOCOM, 2006.