Doctoral Dissertations

Date of Award

8-2014

Degree Type

Dissertation

Degree Name

Doctor of Philosophy

Major

Computer Engineering

Major Professor

Hairong Qi, Qing Cao

Committee Members

Husheng Li, Xiaobing Feng

Abstract

Barrier coverage is a critical issue in wireless sensor networks (WSNs) for security applications, which aims to detect intruders attempting to penetrate protected areas. However, it is difficult to achieve desired barrier coverage after initial random deployment of sensors because their locations cannot be controlled or predicted. In this dissertation, we explore how to leverage the mobility capacity of mobile sensors to improve the quality of barrier coverage.

We first study the 1-barrier coverage formation problem in heterogeneous sensor networks and explore how to efficiently use different types of mobile sensors to form a barrier with pre-deployed different types of stationary sensors. We introduce a novel directional barrier graph model and prove that the minimum cost of mobile sensors required to form a barrier with stationary sensors is the length of the shortest path from the source node to the destination node on the graph. In addition, we formulate the problem of minimizing the cost of moving mobile sensors to fill in the gaps on the shortest path as a minimum cost bipartite assignment problem and solve it in polynomial time using the Hungarian algorithm.

We further study the k-barrier coverage formation problem in sensor networks. We introduce a novel weighted barrier graph model and prove that determining the minimum number of mobile sensors required to form k-barrier coverage is related with but not equal to finding k vertex-disjoint paths with the minimum total length on the WBG. With this observation, we propose an optimal algorithm and a faster greedy algorithm to find the minimum number of mobile sensors required to form k-barrier coverage.

Finally, we study the barrier coverage formation problem when sensors have location errors. We derive the minimum number of mobile sensors needed to fill in a gap with a guarantee when location errors exist and propose a progressive method for mobile sensor deployment. Furthermore, we propose a fault tolerant weighted barrier graph to find the minimum number of mobile sensors needed to form barrier coverage with a guarantee.

Both analytical and experimental studies demonstrated the effectiveness of our proposed algorithms.

Files over 3MB may be slow to open. For best results, right-click and select "save as..."

Share

COinS