Optimised placement of wireless sensor networks by evolutionary algorithm
by Kangshun Li; Zhichao Wen; Zhaopeng Wang; Shen Li
International Journal of Computational Science and Engineering (IJCSE), Vol. 15, No. 1/2, 2017

Abstract: In wireless sensor networks, computing the sensor nodes collection that meets the requirements is called the problem of network coverage optimisation for wireless sensor network; also called the problem of minimum connected covering node set. The innovation points of this article are as follows: Firstly, it analyses the deficiencies of traditional evolution algorithm fitness function, puts forward an improved fitness function design scheme, and proves that it has advantage of solving problem on wireless sensor networks coverage optimisation. Secondly, it applies the method of control variables, comparison and analysis of the influence on the various operations and parameters selection in evolution algorithms on the optimisation results and performance, and then points out how to design algorithms to best optimise effect and performance.

Online publication date: Mon, 21-Aug-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com