메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 81-90

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

Author keywords

Algorithm; Energy efficiency; Graph theory; Scheduling; Time optimum; Wireless sensor networks

Indexed keywords

ALGORITHMS; ENERGY EFFICIENCY; GRAPH THEORY; PACKET NETWORKS; SCHEDULING;

EID: 39049142657     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MOBHOC.2006.278656     Document Type: Conference Paper
Times cited : (28)

References (21)
  • 1
    • 0942290212 scopus 로고    scopus 로고
    • Time-contrained scheduling of weighted packets on trees and meshes
    • M. Adler, S. Khanna, R. Rajarman, and A. Rosen. Time-contrained scheduling of weighted packets on trees and meshes. Algorithmica, 36:123-152, 2003.
    • (2003) Algorithmica , vol.36 , pp. 123-152
    • Adler, M.1    Khanna, S.2    Rajarman, R.3    Rosen, A.4
  • 3
    • 0035183395 scopus 로고    scopus 로고
    • General dynamic routing with per-packet delay guarantees of o(distance+1/session rate)
    • M. Andrews, A. Fernandez, M. Harchol-Balter, T. Leighton, and L. Zhang. General dynamic routing with per-packet delay guarantees of o(distance+1/session rate). SIAM J. Comput., 30(5):1594-1623, 2000.
    • (2000) SIAM J. Comput , vol.30 , Issue.5 , pp. 1594-1623
    • Andrews, M.1    Fernandez, A.2    Harchol-Balter, M.3    Leighton, T.4    Zhang, L.5
  • 5
    • 3142768006 scopus 로고    scopus 로고
    • Fine-grained network time synchronization using reference broadcasts
    • J. Elson, L. Girod, and D. Estrin. Fine-grained network time synchronization using reference broadcasts. In ACM SIGOPS, 2002.
    • (2002) ACM SIGOPS
    • Elson, J.1    Girod, L.2    Estrin, D.3
  • 7
    • 25644459930 scopus 로고    scopus 로고
    • Lightweight time synchronization for sensor networks
    • J. Gruenen and J. Rabaey. Lightweight time synchronization for sensor networks. In ACM WSNA, 2003.
    • (2003) ACM WSNA
    • Gruenen, J.1    Rabaey, J.2
  • 8
    • 0000897531 scopus 로고    scopus 로고
    • Fast algorithms for finding o(congestion+dilation) packet routing schedules
    • T. Leighton, B. M. Maggs, and A. W. Richa. Fast algorithms for finding o(congestion+dilation) packet routing schedules. Combinatorica, 19(3):395-401, 1999.
    • (1999) Combinatorica , vol.19 , Issue.3 , pp. 395-401
    • Leighton, T.1    Maggs, B.M.2    Richa, A.W.3
  • 12
    • 0029358479 scopus 로고
    • Competitive routing of virtual circuits in ATM networks
    • S. Plotkin. Competitive routing of virtual circuits in ATM networks. IEEE Journal of Selected Areas in Communications, 13(6):1128-1136, 1995.
    • (1995) IEEE Journal of Selected Areas in Communications , vol.13 , Issue.6 , pp. 1128-1136
    • Plotkin, S.1
  • 13
    • 85021245281 scopus 로고    scopus 로고
    • Qulanet 3.9 http://www.scalable-networks.com
    • Qulanet 3.9 http://www.scalable-networks.com
  • 14
    • 16244404344 scopus 로고    scopus 로고
    • Energy-efficient, collision-free medium access control for wireless sensor networks
    • V. Rajendran, K. Obraczka, and J.J. Garcia-Luna-Aceves. Energy-efficient, collision-free medium access control for wireless sensor networks. In ACM SenSys, 2003.
    • (2003) ACM SenSys
    • Rajendran, V.1    Obraczka, K.2    Garcia-Luna-Aceves, J.J.3
  • 17
    • 0035704478 scopus 로고    scopus 로고
    • A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
    • A. Srinivasan and C. Teo. A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. SIAM J. Comput., 30(6):2051-2068, 2001.
    • (2001) SIAM J. Comput , vol.30 , Issue.6 , pp. 2051-2068
    • Srinivasan, A.1    Teo, C.2
  • 18
    • 0019213414 scopus 로고
    • The relative neighborhood graph of a finite planar set
    • G. T. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12(4):261-268, 1980.
    • (1980) Pattern Recognition , vol.12 , Issue.4 , pp. 261-268
    • Toussaint, G.T.1
  • 20
    • 0036343658 scopus 로고    scopus 로고
    • An energy-efficient mac protocol for wireless sensor networks
    • W. Ye, J. Heidemann, and D. Estrin. An energy-efficient mac protocol for wireless sensor networks. In IEEE INFOCOM, 2002.
    • (2002) IEEE INFOCOM
    • Ye, W.1    Heidemann, J.2    Estrin, D.3
  • 21
    • 0042474515 scopus 로고    scopus 로고
    • On-demand power management for ad hoc networks
    • R. Zheng and R. Kravets. On-demand power management for ad hoc networks. In IEEE INFOCOM, 2003.
    • (2003) IEEE INFOCOM
    • Zheng, R.1    Kravets, R.2


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