Oblivious interference scheduling

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 220-229

  Fanghänel, Alexander ^a   Kesselheim, Thomas ^a   Räcke, Harald ^b   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Interference; Physical model; Power control; Scheduling; SINR

Indexed keywords

APPROXIMATION RATIOS; BI-DIRECTIONAL COMMUNICATION; COLORING PROBLEMS; ENGINEERING COMMUNITY; INTERFERENCE; METRIC SPACES; PERFORMANCE GUARANTEES; PHYSICAL MODEL; POLYNOMIAL-TIME ALGORITHMS; POWER ASSIGNMENT; POWER LEVELS; SCHEDULING PROBLEM; SIGNAL TO INTERFERENCE PLUS NOISE RATIO; SINR; SQUARE ROOTS; TIME SLOTS;

APPROXIMATION ALGORITHMS; COLOR; COLORING; COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION; POWER CONTROL; SIGNAL RECEIVERS; SIGNAL TO NOISE RATIO; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

SET THEORY;

EID: 70350666356     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582752     Document Type: Conference Paper

References (15)

1. H. Balakrishnan, C. L. Barrett, V. S. Anil 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. J. Sel. Areas Commun., 22(6):1069-1079, 2004.
2. N. Bansal and Z. Liu. Capacity, delay and mobility in wireless ad-hoc networks. In Proc. of the 22nd INFOCOM, volume 2, pages 1553-1563, 2003.
3. D. Chafekar, V. S. Anil Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan. Cross-layer latency minimization in wireless networks with SINR constraints. In Proc. of the 8th MOBIHOC, pages 110-119, 2007.
4. D. Chafekar, V. S. Anil Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan. Approximation algorithms for computing capacity of wireless networks with SINR constraints. In Proc. of the 27th INFOCOM, pages 1166-1174, 2008.
5. A. Fanghänel, T. Kesselheim, and B. Vöcking. Improved algorithms for latency minimization in wireless networks with energy-efficient power control. In Proc. of the 36th ICALP, 2009. to appear.
6. A. Gupta, M. T. Hajiaghayi, and H. Räcke. Oblivious network design. In Proc. of the 17th SODA, pages 970-979, 2006.
7. P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In William M. McEneaney, George Yin, and Qing Zhang, editors, Stochastic Analysis, Control, Optimization, and Applications: A Volume in Honor of W. H. Fleming, Systems & Control: Foundations & Applications, pages 547-566. Birkhäuser, 1998.
8. P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Trans. Inform. Theory, 46:388-404, 2000.
9. R. Hekmat and P. Van Mieghem. Interference in wireless multi-hop ad-hoc networks and its effect on network capacity. Wireless Networks, 10(4):389-399, 2004.
10. U. C. Kozat and L. Tassiulas. Network layer support for service discovery in mobile ad hoc networks. In Proc. of the 22nd INFOCOM, pages 1965-1975, 2003.
11. S. O. Krumke, M. V. Marathe, and S. S. Ravi. Models and approximation algorithms for channel assignment in radio networks. Wireless Networks, 7(6):575-584, 2001.
12. T. Moscibroda and R. Wattenhofer. The complexity of connectivity in wireless networks. In Proc. of the 25th INFOCOM, pages 1-13, 2006.
13. T. Moscibroda, R. Wattenhofer, and A. Zollinger. Topology control meets SINR: The scheduling complexity of arbitrary topologies. In Proc. of the 7th MOBIHOC, pages 310-321, 2006.
14. S. Ramanathan and E. L. Lloyd. Scheduling algorithms for multi-hop radio networks. SIGCOMM Comput. Commun. Rev., 22(4):211-222, 1992.
15. S. Singh and C. S. Raghavendra. PAMAS - Power aware multi-access protocol with signalling for ad hoc networks. SIGCOMM Comput. Commun. Rev., 28(3):5-26, 1998.