Improved algorithms for latency minimization in wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5556 LNCS, Issue PART 2, 2009, Pages 447-458

  Fanghänel, Alexander ^a   Keßelheim, Thomas ^a   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; CONSTANT FACTOR APPROXIMATION; EFFICIENT ALGORITHM; ENERGY EFFICIENT; EUCLIDEAN SPACES; IMPROVED ALGORITHM; LOWER BOUNDS; METRIC SPACES; MULTI-HOP SCHEDULING; POWER ASSIGNMENT; POWER LEVELS; SCHEDULING AND ROUTING; SCHEDULING PROBLEM; SIGNAL TO INTERFERENCE PLUS NOISE RATIO; SINGLE-HOP; SOURCE-DESTINATION PAIRS; UPPER AND LOWER BOUNDS;

ASPECT RATIO; COLOR; COMPUTATION THEORY; CONTROL THEORY; ENERGY EFFICIENCY; GEOMETRY; LINGUISTICS; SET THEORY; SIGNAL RECEIVERS; TOPOLOGY; TRANSLATION (LANGUAGES); TWO DIMENSIONAL; UNMANNED AERIAL VEHICLES (UAV); WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

SCHEDULING ALGORITHMS;

EID: 70350417574     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02930-1_37     Document Type: Conference Paper

References (19)

1. Meyer auf der Heide, F., Vöcking, B.: A packet routing protocol for arbitrary networks. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 291-302. Springer, Heidelberg (1995)
2. Banerjee, S., Misra, A.: Minimum energy paths for reliable communication in multi-hop wireless networks. In: Proceedings of the 3rd ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 146-156 (2002)
3. Bansal, N., Liu, Z.: Capacity, delay and mobility in wireless ad-hoc networks. In: Conference of the IEEE Communications Society (INFOCOM), vol. 2, pp. 1553-1563 (2003)
4. Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Cross-layer latency minimization in wireless networks with SINR constraints. In: Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 110-119 (2007)
5. Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: Proceedings of the 27th Conference of the IEEE Communications Society (INFOCOM), pp. 1166-1174 (2008)
6. Fanghänel, A., Keßelheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: PODC 2009 (submitted, 2009)
7. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46, 388-404 (2000)
8. Thite, S., Balakrishnan, H., Barrett, C.L., Kumar, V.S.A., Marathe, M.V.: The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications 22(6), 1069-1079 (2004)
9. Kozat, U.C., Tassiulas, L.: Network layer support for service discovery in mobile ad hoc networks. In: Proceedings of the 22nd Conference of the IEEE Communications Society (INFOCOM), pp. 1965-1975 (2003)
10. Krumke, S.O., Marathe, M.V., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 7(6), 575-584 (2001)
11. Leighton, F.T., Maggs, B.M., Ranade, A.G., Rao, S.B.: Randomized routing and sorting on fixed-connection networks. Journal of Algorithms (1994)
12. Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica (1994)
13. Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In. In: Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM), pp. 1433-1441 (2007)
14. Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proceedings of the 25th Conference of the IEEE Communications Society (INFOCOM), pp. 1-13 (2006)
15. Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets SINR: The scheduling complexity of arbitrary topologies. In: Proceedings of the 7th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 310-321 (2006)
16. Raghavan, P., Tompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365-374 (1987)
17. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multi-hop radio networks. ACM SIGCOMM Computer Communication Review 22(4), 211-222 (1992)
18. Srinivasan, A., Teo, C.-P.: A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. In: STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, New York, USA, pp. 636-643 (1997)
19. Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-efficient broadcast and multicast trees in wireless networks. Mobile Networks and Applications (MONET) 7(6), 481-492 (2002)