Barrier Coverage with Discrete Levels of Sensing and Transmission Power in Wireless Sensor Networks

• Published in: Advances in Wireless Sensor Networks pp. 14 - 23
• Main Authors: Luo, Haiming, Du, Hongwei, Huang, Hejiao, Ye, Qiang, Zhang, Jing
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2015
• Series: Communications in Computer and Information Science
• Subjects: Barrier coverage; Data aggregation; Energy efficiency; Sensor networks
• ISBN: 3662469804; 9783662469804
• ISSN: 1865-0929; 1865-0937
• DOI: 10.1007/978-3-662-46981-1_2

Barrier coverage is widely used in border surveillance. Most literatures only consider sensing in barrier coverage. In this paper, we consider not only sensing but also communication in barrier coverage under a more practical environment: multi-hop wireless sensor networks. We assume that each sensor has k+1 adjustable sensing power levels and k+1 adjustable transmission power levels. Sensing data should be aggregated and transmitted to the sink node within a latency constraint. We call minimizing the individual node’s maximum energy cost for barrier coverage subject to the latency constraint as the MIME problem. We propose several algorithms to solve the MIME problem. Firstly, we devise a distributed algorithm to minimize the sensing energy cost 1-local barrier coverage, then we use Divide and Conquer method to construct none-crossing k-barrier coverage. Finally we devise a heuristic algorithm to construct a data aggregation tree that satisfies nodes in barriers transmitting data to the sink node within the latency constraint. Simulations show that the proposed algorithms are efficient and outperform other existing algorithms.