Optimising sink-connected barrier coverage in wireless sensor networks
by Yung-Liang Lai; Jehn-Ruey Jiang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 20, No. 1, 2015

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.

Online publication date: Mon, 14-Sep-2015

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