Parameter optimisation in duty-cycled wireless sensor networks under expected network lifetime
by Guangjie Han; Hui Guo; Chenyu Zhang; Lei Shu
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 15, No. 1/2/3, 2014

Abstract: In wireless sensor networks (WSNs), extensive research has focused on extending network lifetime and reducing energy consumption. The dispensable energy consumption among sensor nodes may cause network partition. Therefore, it is urgent to optimise network parameters and collect information from WSNs in an energy efficient manner during an expected network lifetime. In this paper, we propose a connected k-neighbourhood (CKN) algorithm based approach to optimise network parameters. The CKN mechanism is an energy saving algorithm with coordinated duty-cycled sleep schedule, which can adjust sensor nodes's the sleep/awake state to maximum data collection under expected network lifetime. We compare the energy consumption of network adopting CKN mechanism with that of network adopting random sleep (RS) mechanism, then further prove that we can get the maximum data collection by adjusting corresponding network parameters of the WSN. Simulation and performance analysis contribute to select the most appropriate network parameters under expected network lifetime.

Online publication date: Wed, 19-Mar-2014

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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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