ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Position-Based k-Disjoint Path Routing for Reliable Data Gathering in Wireless Sensor Networks
Cited 2 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
백장운, 남영진, 서대화
발행일
201208
출처
IEICE Transactions on Communications, v.E95-B no.8, pp.2658-2660
ISSN
0916-8516
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1587/transcom.E95.B.2658
협약과제
12ZS1100, 지식서비스기반 SW 핵심기술연구, 황승구
초록
This paper proposes a novel routing algorithm that constructs position-based k-disjoint paths to realize greater resiliency to patterned failure. The proposed algorithm constructs k-disjoint paths that are spatially distributed by using the hop-count based positioning system. Simulation results reveal that the proposed algorithm is more resilient to patterned failure than other routing algorithms, while it has low power consumption and small delay. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.
키워드
Disjoint-path routing, Patterned failure, Position-based, Wireless sensor networks
KSP 제안 키워드
Disjoint path routing, Information and communication, Routing algorithm, Wireless sensor networks(WSNs), low power consumption, position-based, positioning system, reliable data gathering, simulation results