메뉴 건너뛰기




Volumn 11, Issue 2, 2006, Pages 187-200

Locating and bypassing holes in sensor networks

Author keywords

Distributed algorithms; Routing; Sensor networks

Indexed keywords

DISTRIBUTED ALGORITHMS; GEOGRAPHIC ROUTING; PATH MIGRATION; SENSOR NETWORKS;

EID: 33646734122     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11036-006-4471-y     Document Type: Article
Times cited : (209)

References (15)
  • 3
    • 0242513476 scopus 로고    scopus 로고
    • DIMENSIONS: Why do we need a new data handling architecture for sensor networks'?
    • ACM Princeton, NJ, USA, Oct.
    • D. Ganesan and D. Estrin, DIMENSIONS: Why do we need a new data handling architecture for sensor networks'? In Proceedings of the ACM Workshop on Hot Topics in Networks (ACM Princeton, NJ, USA, Oct. 2002), pp. 143-148.
    • (2002) Proceedings of the ACM Workshop on Hot Topics in Networks , pp. 143-148
    • Ganesan, D.1    Estrin, D.2
  • 12
    • 0035509489 scopus 로고    scopus 로고
    • A survey on position-based routing in mobile ad hoc networks
    • M. Mauve, J. Widmer and H. Hartenstein, A survey on position-based routing in mobile ad hoc networks. IEEE Network Magazine, 15(6) (2001) 30-39.
    • (2001) IEEE Network Magazine , vol.15 , Issue.6 , pp. 30-39
    • Mauve, M.1    Widmer, J.2    Hartenstein, H.3
  • 15
    • 0013163991 scopus 로고    scopus 로고
    • Routing with guaranteed delivery in geometric and wirelss networks
    • I. Stojmenovic, editor, (John Wiley and Sons)
    • J. Urrutia, Routing with guaranteed delivery in geometric and wirelss networks. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing (John Wiley and Sons, 2002) pp. 393-406.
    • (2002) Handbook of Wireless Networks and Mobile Computing , pp. 393-406
    • Urrutia, J.1


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