ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 Low Latency and Energy Efficient Routing Tree for Wireless Sensor Networks with Multiple Mobile Sinks
Cited 41 time in scopus Download 6 time Share share facebook twitter linkedin kakaostory
저자
한승완, 정인선, 강승호
발행일
201301
출처
Journal of Network and Computer Applications, v.36 no.1, pp.156-166
ISSN
1084-8045
출판사
Elsevier
DOI
https://dx.doi.org/10.1016/j.jnca.2012.10.003
협약과제
13PS1400, 스마트 단말용 스트리밍 유해 컨텐츠 차단 기술 개발, 한승완
초록
We propose the minimum Wiener index spanning tree (MWST) as a routing topology that is suitable for sensor networks with multiple mobile base nodes. However, it was proved that finding a spanning tree with the minimum Wiener index from a weighted graph is NP-hard. To address this problem and analyze the effectiveness of the MWST as the routing tree on sensor networks with multiple mobile base nodes, we designed two algorithms: a branch and bound algorithm for small-scale wireless sensor networks and a simulated annealing algorithm for large-scale wireless sensor networks. The simulation results show that MWST outperforms the minimum spanning tree (MST), one of the representative spanning trees used in many routing protocols for sensor networks, in terms of energy efficiency and packet delay. © 2012 Elsevier Ltd.
키워드
Branch and bound algorithm, Mobile sink, Routing tree, Simulated annealing, Wiener index, Wireless sensor networks
KSP 제안 키워드
Energy Efficiency, Energy Efficient Routing(EER), Low latency, Minimum spanning tree, Mobile Base, NP-hard, Packet Delay, Routing topology, Routing tree, Simulated Annealing(SA), Simulated Annealing Algorithm