Optimal k-Anycast Routing Algorithm for Sleep-Wake Scheduling Wireless Sensor Networks
Year: 2016
Journal of Information and Computing Science, Vol. 11 (2016), Iss. 3 : pp. 208–213
Abstract
Finding optimal k-anycast routing paths for sleep-wake scheduling wireless sensor networks(WSN) is a NP-complete problem. Most previous research work only attends to optimizing the time delay during a hop or a single path. But in terms of the performance of the end-to-end delay, this scheme is not optimal. In this paper, an optimal k-anycast routing algorithm for sleep-wake scheduling WSN is proposed to solve the problem. In the proposed algorithm, base stations apply AODV-based multipath routing protocol to acquire k-anycast routing information, then genetic algorithm is applied to search the optimal k routing paths between nodes and bases stations. Since the proposed algorithm has the feature of global optimization ability, in contrast to previous algorithms, experiment results show that the proposed algorithm can reduce end-to-end delay more efficiently．
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2024-JICS-22513
Journal of Information and Computing Science, Vol. 11 (2016), Iss. 3 : pp. 208–213
Published online: 2016-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 6