메뉴 건너뛰기




Volumn 53, Issue 10, 2009, Pages 1697-1711

Centroid virtual coordinates - A novel near-shortest path routing paradigm

Author keywords

Self organization; Virtual coordinates; Wireless Sensor Networks

Indexed keywords

ANCHOR NODES; EXTENSIVE SIMULATIONS; FREE SOLUTIONS; GEOGRAPHIC ROUTING; LOCATION-AWARE; NEAR-SHORTEST PATHS; NUMBER OF HOPS; OPTIMAL STATE; PATH LENGTHS; POSITIONING TECHNIQUES; SELF-ORGANIZATION; SHORTEST PATHS; STATELESS ROUTING; TRANSMISSION MODELS; VIRTUAL COORDINATES;

EID: 67349191559     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2008.12.017     Document Type: Article
Times cited : (18)

References (29)
  • 3
    • 24944436932 scopus 로고    scopus 로고
    • Research challenges for wireless sensor networks
    • (Special Issue on Embedded Sensor Networks and Wireless Computing)
    • Stankovic J.A. Research challenges for wireless sensor networks. ACM SIGBED Review 1 2 (2004) 1-4 (Special Issue on Embedded Sensor Networks and Wireless Computing)
    • (2004) ACM SIGBED Review , vol.1 , Issue.2 , pp. 1-4
    • Stankovic, J.A.1
  • 9
    • 33745069352 scopus 로고    scopus 로고
    • Node clustering in wireless sensor networks: recent developments and deployment challenges
    • May/June
    • Younis O., Krunz M., and Ramasubramanian S. Node clustering in wireless sensor networks: recent developments and deployment challenges. IEEE Network 20 3 (2006) 20-25 May/June
    • (2006) IEEE Network , vol.20 , Issue.3 , pp. 20-25
    • Younis, O.1    Krunz, M.2    Ramasubramanian, S.3
  • 11
    • 26844530562 scopus 로고    scopus 로고
    • Efficient clustering algorithms for self-organizing wireless sensor networks
    • Krishnan R., and Starobinski D. Efficient clustering algorithms for self-organizing wireless sensor networks. Elsevier Journal of Ad-Hoc Networks 4 1 (2006) 36-59
    • (2006) Elsevier Journal of Ad-Hoc Networks , vol.4 , Issue.1 , pp. 36-59
    • Krishnan, R.1    Starobinski, D.2
  • 12
    • 23844450416 scopus 로고    scopus 로고
    • Algorithms for ad hoc and sensor networks
    • Wattenhofer R. Algorithms for ad hoc and sensor networks. Elsevier Computer Communications 28 (2005) 1498-1504
    • (2005) Elsevier Computer Communications , vol.28 , pp. 1498-1504
    • Wattenhofer, R.1
  • 14
    • 10944266504 scopus 로고    scopus 로고
    • HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
    • Younis O., and Fahmy S. HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing 3 4 (2004) 366-379
    • (2004) IEEE Transactions on Mobile Computing , vol.3 , Issue.4 , pp. 366-379
    • Younis, O.1    Fahmy, S.2
  • 15
    • 22744459473 scopus 로고    scopus 로고
    • Configuring and managing a large-scale monitoring network solving real world challenges for ultra-low powered and long-range wireless mesh networks
    • Dugas C. Configuring and managing a large-scale monitoring network solving real world challenges for ultra-low powered and long-range wireless mesh networks. International Journal of Network Management 15 (2005) 269-282
    • (2005) International Journal of Network Management , vol.15 , pp. 269-282
    • Dugas, C.1
  • 26
    • 33845249645 scopus 로고    scopus 로고
    • Anchor-free distributed localization in sensor networks, MIT Laboratory for Computer Science
    • Tech. Rep. 892, April
    • N.B. Priyantha, H. Balakrishnan, E. Demaine, S. Teller, Anchor-free distributed localization in sensor networks, MIT Laboratory for Computer Science, Tech. Rep. 892, April 2003.
    • (2003)
    • Priyantha, N.B.1    Balakrishnan, H.2    Demaine, E.3    Teller, S.4
  • 27
    • 85069078915 scopus 로고    scopus 로고
    • CC1101, Low-Cost Low-Power Sub-1 GHz RF Transceiver, Enhanced CC1100 Rev. C, data sheet swrs061c [available online] ed, Texas Instruments, Inc, 27 May, 2008
    • CC1101, Low-Cost Low-Power Sub-1 GHz RF Transceiver - Enhanced CC1100 (Rev. C), data sheet swrs061c [available online] ed., Texas Instruments, Inc., 27 May, 2008.


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