Barrier coverage in wireless sensor networks with adjustable sensing ranges
by Xianjun Deng; Bang Wang; Changqing Wang; Wenyu Liu
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 15, No. 1/2/3, 2014

Abstract: In this paper, we study the barrier lifetime maximisation (BLM) and barrier gap mending (BGM) problem in a sensor network, where sensors can choose to use different sensing ranges when constructing a sensor barrier. In the BLM problem, for small-scale sensor networks, we propose a linear programming optimisation method. For large-scale sensor networks, we propose two distributed heuristics to select a next node to construct barriers. Simulation results show that compared with the randomised one, the greedy scheme can achieve longer lifetime. In the BGM problem, we study how to efficiently mend barrier gaps in a hybrid sensor network consisting of both stationary and mobile sensors. We propose two gap mending schemes: the min-max scheme to minimise the maximal energy consumption to move sensors, and the max-lifetime scheme to maximise the lifetime of barrier coverage after mending all gaps. Simulation results show that the min-max scheme can achieve a lower maximal moving distance and the max-lifetime scheme can efficiently extend the barrier 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