Improved n 1-cover discovery using perimeter coverage information
by James C. Beyer, David H.C. Du, Ewa Kusmierek
International Journal of Sensor Networks (IJSNET), Vol. 3, No. 3, 2008

Abstract: Over-deploying sensors into a coverage region allows for coverage guarantees in the face of random deployments. Extending the lifetime of these deployments by only turning on a handful of sensors that cover the entire region is a viable means of conserving energy. In order to maximally extend the life of a sensor network, several problems must be solved. These are: the 1-cover, the k-cover and n 1-covers. The 1-cover and k-cover problems have been solved previously; however, the n 1-cover problem has proven more difficult to address. We present a perimeter-centric approach to the NP-complete n 1-covers problem, which chooses neighbours based on an optimal disk placement theory, but takes practical constraints into consideration. Simulation results have shown that our system outperforms both the critical field selection algorithm and an n 1-cover selection algorithm derived from Zhang and Hou's OGDC algorithm.

Online publication date: Sun, 25-May-2008

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 Sensor Networks (IJSNET):
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