Title: Optimising sink-connected barrier coverage in wireless sensor networks

Authors: Yung-Liang Lai; Jehn-Ruey Jiang

Addresses: Department of Computer Science and Information Engineering, Taoyuan Innovation Institute of Technology, Jhongli City, Taoyuan 32091, Taiwan ' Department of Computer Science and Information Engineering, National Central University, Jhongli City, Taoyuan 32001, Taiwan

Abstract: This paper proposes an algorithm, named the optimal node selection algorithm (ONSA), to solve the sink-connected barrier coverage optimisation problem, which is concerned with how to select randomly deployed sensor nodes of a wireless sensor network (WSN) to reach two optimisation goals: 1) to maximise the degree of barrier coverage with the minimum number of detecting nodes; 2) to make the detecting nodes sink-connected with the minimum number of forwarding nodes. The detecting nodes are those for detecting intruders crossing a belt-shaped area of interest. On detecting intruders, they send intruding event notifications to one of the sink nodes with the help of the forwarding nodes to relay the notifications. We prove the optimality of ONSA, analyse its time complexity, perform simulations for it, and compare the simulation results with those of a related algorithm to show ONSA's advantages.

Keywords: WSNs; wireless sensor networks; barrier coverage; maximum flow minimum cost algorithm; sink connectivity; energy efficiency; node selection; optimisation; intrusion detection; simulation.

DOI: 10.1504/IJAHUC.2015.071661

International Journal of Ad Hoc and Ubiquitous Computing, 2015 Vol.20 No.1, pp.39 - 48

Received: 13 Mar 2013
Accepted: 05 Nov 2013
Published online: 14 Sep 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article