메뉴 건너뛰기




Volumn , Issue , 2007, Pages 3678-3683

Delay-minimized route design for wireless sensor-actuator networks

Author keywords

[No Author keywords available]

Indexed keywords

ACTUATORS; ALGORITHMS; COMPUTER SIMULATION; DATA ACQUISITION; PROBLEM SOLVING; ROUTERS;

EID: 36348956230     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2007.673     Document Type: Conference Paper
Times cited : (10)

References (20)
  • 2
    • 85074375621 scopus 로고    scopus 로고
    • Next century challenges: Scalable coordination in sensor networks
    • Seattle, Washington, U.S
    • D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, "Next century challenges: Scalable coordination in sensor networks," in Proc. of ACM MobiCom, Seattle, Washington, U.S., 1999.
    • (1999) Proc. of ACM MobiCom
    • Estrin, D.1    Govindan, R.2    Heidemann, J.3    Kumar, S.4
  • 4
    • 25844459686 scopus 로고    scopus 로고
    • Joint mobility and routing for lifetime elongation in wireless sensor networks
    • Mar
    • J. Luo and J. Hubaux, "Joint mobility and routing for lifetime elongation in wireless sensor networks," in Proc. of the 24th IEEE INFOCOM, Mar 2005.
    • (2005) Proc. of the 24th IEEE INFOCOM
    • Luo, J.1    Hubaux, J.2
  • 11
    • 27644520438 scopus 로고    scopus 로고
    • A message ferrying approach for data delivery in sparse mobile ad hoc networks
    • Mar
    • W. Zhao, M. Ammar, and E. Zegura, "A message ferrying approach for data delivery in sparse mobile ad hoc networks," in Proc. of ACM MobiHoc'04, Mar 2005.
    • (2005) Proc. of ACM MobiHoc'04
    • Zhao, W.1    Ammar, M.2    Zegura, E.3
  • 12
    • 33845477672 scopus 로고    scopus 로고
    • Partitioning-based mobile element scheduling in wireless sensor networks
    • Santa Clara, U.S, Sep
    • Y. Gu, D. Bozdag, E. Ekici, F. Ozguner, and C-G. Lee, "Partitioning-based mobile element scheduling in wireless sensor networks," in Proc. of SECON, Santa Clara, U.S., Sep 2005, pp. 386-395.
    • (2005) Proc. of SECON , pp. 386-395
    • Gu, Y.1    Bozdag, D.2    Ekici, E.3    Ozguner, F.4    Lee, C.-G.5
  • 13
    • 34250247769 scopus 로고
    • Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
    • Dec
    • N. Christofides, A. Mingozzi, and P. Toth, "Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations," Mathematical Programming, no. 1, pp. 255-282, Dec 1981.
    • (1981) Mathematical Programming , Issue.1 , pp. 255-282
    • Christofides, N.1    Mingozzi, A.2    Toth, P.3
  • 15
  • 17
    • 0026923887 scopus 로고
    • Fast algorithms for geometric traveling salesman problem
    • J. Bentley, "Fast algorithms for geometric traveling salesman problem," ORSA Journal on Computing, pp. 387-411, 1992.
    • (1992) ORSA Journal on Computing , pp. 387-411
    • Bentley, J.1
  • 18
    • 0032156828 scopus 로고    scopus 로고
    • Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems
    • Sep
    • S. Arora, "Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems," Journal of ACM, vol. 45, no. 5, pp. 753-782, Sep 1998.
    • (1998) Journal of ACM , vol.45 , Issue.5 , pp. 753-782
    • Arora, S.1
  • 20
    • 0037968893 scopus 로고    scopus 로고
    • SPEED: A. real-time routing protocol for sensor networks
    • Providence, RI, U.S, May
    • T. He, J. Stankovic, C. Lu, and T. Abdelzaher, "SPEED: A. real-time routing protocol for sensor networks," in Proc. of the IEEE ICDCS, Providence, RI, U.S., May 2003, pp. 46-55.
    • (2003) Proc. of the IEEE ICDCS , pp. 46-55
    • He, T.1    Stankovic, J.2    Lu, C.3    Abdelzaher, T.4


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