Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A new distributed algorithm to find breadth first search trees
IEEE Transactions on Information Theory
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Local Barrier Coverage in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Coverage Control in Sensor Networks
Coverage Control in Sensor Networks
Strong barrier coverage with directional sensors
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Multi-round sensor deployment for guaranteed barrier Coverage
INFOCOM'10 Proceedings of the 29th conference on Information communications
Barrier coverage with sensors of limited mobility
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Exploiting data fusion to improve the coverage of wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
One major application category for wireless sensor networks is to detect intruders entering protected areas. Early research has studied the barrier coverage problem for intruder detection. However, an open problem is to build sensor barriers with minimum cost in wireless sensor networks. This is a critical problem (called minimum-cost barrier coverage), and its solution can be widely used in sensor barrier applications, such as border security and intruder detection. In this paper, we present a complete solution to the minimum-cost barrier coverage problem. The cost here can be any performance measurement and normally is defined as the resource consumed or occupied by the sensor barriers. Our algorithm, called the PUSH-PULL-IMPROVE algorithm, is the first one that provides a distributed solution to the minimum-cost barrier coverage problem in asynchronous wireless sensor networks. It can be used for protected areas of any size and shape with homogeneous or heterogeneous networks. In our algorithm, each node does not necessarily know its exact location and only needs to communicate with its neighbors. For a deployment of n sensors and a cost measurement with maximum value C"m"a"x, our algorithm has O(n^2log(nC"m"a"x)) message complexity and O(n^2log(nC"m"a"x)) time complexity to find K barriers. Simulation results verify the performance of the algorithm. We observe that the actual number of messages sent in the simulations is much less than n^2.