메뉴 건너뛰기




Volumn , Issue , 2004, Pages 246-250

Fault-tolerant relay node placement in wireless sensor networks: Formulation and approximation

Author keywords

Fault tolerance; Relay node placement; Wireless sensor network

Indexed keywords

RELAY NODE PLACEMENT; WIRELESS SENSOR NETWORKS;

EID: 2942525470     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (125)

References (16)
  • 2
    • 0034539015 scopus 로고    scopus 로고
    • Directed diffusion: A scalable and robust communication paradigm for sensor networks
    • C. Intanagonwiwat, R. Govindan, and D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, Proceedings of ACM MOBICOM'2000, pp. 56-67.
    • Proceedings of ACM MOBICOM'2000 , pp. 56-67
    • Intanagonwiwat, C.1    Govindan, R.2    Estrin, D.3
  • 6
    • 84907695140 scopus 로고    scopus 로고
    • Fault-tlerant clustering of wireless sensor networks
    • G. Gupta, M. Younis, Fault-Tolerant clustering of wireless sensor networks, Proceedings of IEEE WCNC'2003, pp. 1579-1584.
    • Proceedings of IEEE WCNC'2003 , pp. 1579-1584
    • Gupta, G.1    Younis, M.2
  • 7
    • 0037632539 scopus 로고    scopus 로고
    • Load-balanced clustering of wireless sensor networks
    • G. Gupta, M. Younis, Load-Balanced clustering of wireless sensor networks, Proceedings of IEEE ICC'2003, pp. 1848-1852.
    • Proceedings of IEEE ICC'2003 , pp. 1848-1852
    • Gupta, G.1    Younis, M.2
  • 10
    • 0032755118 scopus 로고    scopus 로고
    • Steiner tree problem with minimum number of steiner points and bounded edge-length
    • G. Lin and G. Xue, Steiner tree problem with minimum number of steiner points and bounded edge-length, Information Processing Letters, Vol. 69(1999), pp. 53-57.
    • (1999) Information Processing Letters , vol.69 , pp. 53-57
    • Lin, G.1    Xue, G.2
  • 11
    • 0242527323 scopus 로고    scopus 로고
    • Connected sensor cover: Self-organization of sensor networks for efficient query execution
    • H.Gupta, Samir R. Das, Q. Gu, Connected sensor cover: self-organization of sensor networks for efficient query execution, Proceedings of ACM MOBIHOC'2003, pp. 189-200.
    • Proceedings of ACM MOBIHOC'2003 , pp. 189-200
    • Gupta, H.1    Das, S.R.2    Gu, Q.3
  • 12
    • 1542269184 scopus 로고    scopus 로고
    • Minimum energy disjoint path routing in wireless ad-hoc network
    • A. Srinivas, E. Modiano, Minimum energy disjoint path routing in wireless ad-hoc network, Proceedings of ACM MOBICOM'2003, pp. 122-133.
    • Proceedings of ACM MOBICOM'2003 , pp. 122-133
    • Srinivas, A.1    Modiano, E.2
  • 14
    • 0015955981 scopus 로고
    • Disjoint paths in a network
    • J.W. Suurballe, Disjoint paths in a network, Networks, Vol. 4 (1974), pp. 125-145.
    • (1974) Networks , vol.4 , pp. 125-145
    • Suurballe, J.W.1
  • 15
    • 0021897852 scopus 로고
    • Approximation schemes for covering and packing problems in image processing and VLSI
    • D. S. Hochbaum, W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, Journal of ACM Vol. 32 (1985), pp. 130-136.
    • (1985) Journal of ACM , vol.32 , pp. 130-136
    • Hochbaum, D.S.1    Maass, W.2


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