Home // ICWMC 2011, The Seventh International Conference on Wireless and Mobile Communications // View article

Sink-Connected Barrier Coverage Optimization for Wireless Sensor Networks

Authors:
Yung-Liang Lai
Jehn-Ruey Jiang

Keywords: Wireless sensor networks; Barrier coverage; Maximum flow minimum cost algorithm; Sink connectivity

Abstract:
This paper addresses the sink-connected barrier coverage optimization problem, which is concerned with how to select randomly deployed sensor nodes of a wireless sensor network (WSN) to reach two optimization goals: (1) to maximize the degree of barrier coverage by the minimum number of detecting nodes, and (2) to make the detecting nodes sink-connected by the minimum number of forwarding nodes. The detecting nodes are those for detecting intruders crossing the boundary of a monitored region. On detecting intruders, they send intruding event notifications to one of the sink nodes with the help of the forwarding nodes relaying. An algorithm, called optimal node selection algorithm (ONSA), is proposed for solving the problem on the basis of the maximum flow minimum cost algorithm. We perform simulations for ONSA and compare the results with those of a related algorithm, the global determination algorithm (GDA). The simulation results show that ONSA is better than GDA in terms of the number of nodes required in constructing sink-connected barrier coverage.

Pages: 198 to 203

Copyright: Copyright (c) IARIA, 2011

Publication date: June 19, 2011

Published in: conference

ISSN: 2308-4219

ISBN: 978-1-61208-140-3

Location: Luxembourg City, Luxembourg

Dates: from June 19, 2011 to June 24, 2011