Barrier coverage in wireless sensor networks with adjustable sensing ranges. (20th March 2014)

• Record Type: Journal Article
• Authors: Deng, Xianjun; Wang, Bang; Wang, Changqing; Liu, Wenyu
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 15:Number 1/2/3(2014)
• Page Start: 121
• Page End: 132
• Publication Date: 2014-03-20
• Subjects: barrier coverage -- BLM -- barrier lifetime maximisation -- BLM -- barrier gap mending -- BGM -- adjustable sensing ranges -- ubiquitous computing -- sensor networks -- network lifetime -- simulation -- energy consumption; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

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.