메뉴 건너뛰기




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

Improved algorithms for latency minimization in wireless networks

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;

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

References (19)
  • 1
    • 84947727275 scopus 로고
    • A packet routing protocol for arbitrary networks
    • Mayr, E.W, Puech, C, eds, STACS 1995, Springer, Heidelberg
    • 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)
    • (1995) LNCS , vol.900 , pp. 291-302
    • Meyer auf der Heide, F.1    Vöcking, B.2
  • 3
    • 0042014445 scopus 로고    scopus 로고
    • Capacity, delay and mobility in wireless ad-hoc networks
    • INFOCOM
    • 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)
    • (2003) Conference of the IEEE Communications Society , vol.2 , pp. 1553-1563
    • Bansal, N.1    Liu, Z.2
  • 10
    • 0035506896 scopus 로고    scopus 로고
    • Models and approximation algorithms for channel assignment in radio networks
    • 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)
    • (2001) Wireless Networks , vol.7 , Issue.6 , pp. 575-584
    • Krumke, S.O.1    Marathe, M.V.2    Ravi, S.S.3
  • 13
    • 34548302059 scopus 로고    scopus 로고
    • 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)
    • 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)
  • 16
    • 51249173817 scopus 로고
    • Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    • Raghavan, P., Tompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365-374 (1987)
    • (1987) Combinatorica , vol.7 , Issue.4 , pp. 365-374
    • Raghavan, P.1    Tompson, C.D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.