Optimal k-Anycast Routing Algorithm for Sleep-Wake Scheduling Wireless Sensor Networks
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{JICS-11-208,
author = {Xin Xu, Yun-li Gu and Ya-ping Cheng},
title = {Optimal k-Anycast Routing Algorithm for Sleep-Wake Scheduling Wireless Sensor Networks},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {11},
number = {3},
pages = {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．
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22513.html}
}
TY - JOUR
T1 - Optimal k-Anycast Routing Algorithm for Sleep-Wake Scheduling Wireless Sensor Networks
AU - Xin Xu, Yun-li Gu and Ya-ping Cheng
JO - Journal of Information and Computing Science
VL - 3
SP - 208
EP - 213
PY - 2024
DA - 2024/01
SN - 11
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22513.html
KW - k-anycast, genetic algorithm, wireless sensor networks, routing algorithm.
AB - 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．
Xin Xu, Yun-li Gu and Ya-ping Cheng. (2024). Optimal k-Anycast Routing Algorithm for Sleep-Wake Scheduling Wireless Sensor Networks.
Journal of Information and Computing Science. 11 (3).
208-213.
doi:
Copy to clipboard