ETRI-Knowledge Sharing Plaform



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


학술지 Multi-channel Time Division Multiple Access Timeslot Scheduling with Link Recovery for Multi-hop Wireless Sensor Networks
Cited 1 time in scopus Download 110 time Share share facebook twitter linkedin kakaostory
이준희, 정운철, 최병철
International Journal of Distributed Sensor Networks, v.13 no.8, pp.1-15
Hindawi Publishing
17HH5700, 해양주권 확보를 위한 원거리 선박 무선식별 기술 및 레이더 연계 해상 모니터링 시스템 개발, 최병철
In this article, we propose a time division multiple access scheduling algorithm for end-to-end on-time packet delivery in multi-hop wireless sensor networks. Our proposed algorithm establishes a new communication path to substitute the old path including the link failed and schedules communication links on the new path by allocating timeslots satisfying end-to-end delay bound. Max?뱈in optimization is employed to maximize the number of dedicated timeslots to establish the substitute path in the event of the next link failure. We evaluate the performance of the proposed algorithm using QualNet network simulator and compare it with the performance of the algorithm that minimizes the end-to-end delay. Our numerical results show that the path survival ratio of the proposed algorithm is approximately two times higher when large number of communication links fails. In addition, we apply the global recovery and local recovery schemes to observe the increase in the overhead message exchanges. Compared to the global recovery scheme, local recovery scheme requires six times less control messages to establish the substitute path when a small number of link failures occur, whereas more than 90% communication paths survive.
KSP 제안 키워드
Communication link, Communication path, End to End(E2E), End-to-end delay bound, Link failure, Local recovery, Network simulator(NS), Numerical results, Packet delivery, Scheduling algorithm, Static wireless sensor networks(WSNs)
본 저작물은 크리에이티브 커먼즈 저작자 표시 (CC BY) 조건에 따라 이용할 수 있습니다.
저작자 표시 (CC BY)