메뉴 건너뛰기




Volumn , Issue , 2012, Pages 512-517

Optimized relay node placement for establishing connectivity in sensor networks

Author keywords

Network connectivity; Node placement; Topology management; Wireless Sensor Networks

Indexed keywords

ITERATIVE METHODS; SENSOR NODES; TREES (MATHEMATICS); TRIANGULATION;

EID: 84877665507     PISSN: 23340983     EISSN: 25766813     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2012.6503164     Document Type: Conference Paper
Times cited : (23)

References (14)
  • 2
    • 0036346460 scopus 로고    scopus 로고
    • ASCENT: Adaptive self-configuring sensor networks topologies
    • New York, NY, June
    • D. Cerpa and Estrin, "ASCENT: adaptive self-configuring sensor networks topologies," Proc. of the INFOCOM'02, New York, NY, June 2002
    • (2002) Proc. of the INFOCOM'02
    • Cerpa, D.1    Estrin2
  • 3
    • 39149099807 scopus 로고    scopus 로고
    • Strategies and techniques for node placement in wireless sensor networks: A survey
    • M. Younis and K. Akkaya, "Strategies and Techniques for Node Placement in Wireless Sensor Networks: A Survey," Journal of Ad-Hoc Network, 6(4), pp. 621-655, 2008.
    • (2008) Journal of Ad-Hoc Network , vol.6 , Issue.4 , pp. 621-655
    • Younis, M.1    Akkaya, K.2
  • 4
    • 43949136957 scopus 로고    scopus 로고
    • Relay sensor placement in wireless sensor networks
    • X. Cheng, D.-z. Du and L. Wang and B. Xu, "Relay Sensor Placement in Wireless Sensor Networks," Wireless Networks, 14(3), pp. 347-355, 2008.
    • (2008) Wireless Networks , vol.14 , Issue.3 , pp. 347-355
    • Cheng, X.1    Du, D.-Z.2    Wang, L.3    Xu, B.4
  • 5
    • 85008060351 scopus 로고    scopus 로고
    • Relay node placement in wireless sensor networks
    • Jan.
    • E. L. Lloyd, G. Xue, "Relay Node Placement in Wireless Sensor Networks," IEEE Trans. on Comp., 56(1), pp. 134-138, Jan 2007
    • (2007) IEEE Trans. on Comp. , vol.56 , Issue.1 , pp. 134-138
    • Lloyd, E.L.1    Xue, G.2
  • 6
    • 0032755118 scopus 로고    scopus 로고
    • Steiner tree problem with minimum number of steiner points and bounded edge-length
    • G. Lin, G. Xue, "Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-length," Information Processing Letters. 69(2), pp. 53-57, 1999.
    • (1999) Information Processing Letters , vol.69 , Issue.2 , pp. 53-57
    • Lin, G.1    Xue, G.2
  • 7
    • 0006687948 scopus 로고    scopus 로고
    • Approximations for Steiner trees with minimum number of Steiner points
    • D. Chen, et al., "Approximations for Steiner Trees with Minimum Number of Steiner Points," J. of Global Opt., Vol. 18, No. 1, pp. 17-33, 2000.
    • (2000) J. of Global Opt. , vol.18 , Issue.1 , pp. 17-33
    • Chen, D.1
  • 9
    • 79955956247 scopus 로고    scopus 로고
    • Bio-inspired relay node placemen theuristics for repairing damaged wireless sensor networks
    • F. Senel, M. Younis and K. Akkaya, "Bio-inspired Relay Node PlacemenTheuristics for Repairing Damaged Wireless Sensor Networks," in IEEE Trans. on Vehicular Tech., 60(4), pp. 1835-1848, 2011.
    • (2011) IEEE Trans. on Vehicular Tech. , vol.60 , Issue.4 , pp. 1835-1848
    • Senel, F.1    Younis, M.2    Akkaya, K.3
  • 10
    • 80052712149 scopus 로고    scopus 로고
    • Relay node placement in structurally damaged wireless sensor networks via triangular Steiner tree approximation
    • F. Senel, M. Younis, "Relay node placement in structurally damaged wireless sensor networks via triangular steiner tree approximation," Elsevier Computer Communications, 34(16), pp. 1932-1941, 2011.
    • (2011) Elsevier Computer Communications , vol.34 , Issue.16 , pp. 1932-1941
    • Senel, F.1    Younis, M.2
  • 11
    • 84976826673 scopus 로고
    • Voronoi diagrams - A study of a fundamental geometric data structure
    • F. Aurenhammer, "Voronoi diagrams - a study of a fundamental geometric data structure," ACM Computing Surveys, 23(3), pp. 345-405, 1991.
    • (1991) ACM Computing Surveys , vol.23 , Issue.3 , pp. 345-405
    • Aurenhammer, F.1


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