A Genetic Algorithm for Cost-Aware

  • Si W
  • Srivastava G
  • Zhang Y
  • et al.
ISSN: 21693536
N/ACitations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

In wireless sensor networks(WSN),there exists the question about wireless link failure. However,most scholars pay more attention to the network lifetime while designing routing algorithms,but ignore the routing robustness problem. In this paper,an anycast routing algorithm based on evolutionary algorithm for WSN is proposed. The algorithm takes both the network lifetime and routing robustness as the optimization objectives,and finds the best fitness of them by multi-objective evolutionary algorithm. Experimental results show that the algorithm is effective,and experimental data show that:compared with anycast routing algorithm based on single-objective(network lifetime)optimization,the proposed algorithm can balance network lifetime and routing robustness better; compared with traditional single-path anycast routing algorithm,the performances of the proposed algorithm are better in terms of network lifetime,routing robustness and scalability.

Author supplied keywords

Cite

CITATION STYLE

APA

Si, W., Srivastava, G., Zhang, Y. Y., Jiang, L., Zhao, D., Gaaloul, W., … Zhang, X. (2019). A Genetic Algorithm for Cost-Aware. IEEE Access, 7(3), 198–212. Retrieved from http://dx.doi.org/10.1007/978-3-030-03596-9_20 https://doi.org/10.1007/s10257-018-0385-z https://doi.org/10.1016/j.ins.2019.01.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free