Find the maximum k-disjoint coverage sets in WSN using genetic algorithm
by Jie Jia, Jian Chen, Guiran Chang, Jie Li
International Journal of Modelling, Identification and Control (IJMIC), Vol. 9, No. 1/2, 2010

Abstract: A major concern in wireless sensor networks is to maximise network lifetime (in terms of rounds) while maintaining a high quality of service (QoS), which includes target coverage and network connectivity. This paper generalises the searching procedure to maximise the total number of rounds. A novel searching algorithm is proposed on the basis of improved NSGA-II to select the optimal coverage set which includes two competing objectives, the coverage rate and the number of working nodes. As another new contribution, we apply the novel algorithm in the k-disjoint coverage sets problem. All the sensors are divided into k-disjoint sets, guaranteeing each set with full coverage. By alternating coverage subsets and using only one at each round, the maximum network lifetime is achieved. Numerical and simulation results are provided to examine our analysis for wireless sensor networks.

Online publication date: Thu, 01-Apr-2010

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 Modelling, Identification and Control (IJMIC):
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