Abstract

Mobile sensor network is the collection of independent and scattered sensors with capacity of mobility. In recent years, Mobility of Sensors has been utilized to improve the target coverage quality and network connectivity in randomly deployed mobile sensor networks. Target coverage and Network connectivity are two main challenging issues of mobile sensor networks. Target coverage covers a set of specified points of interest in the randomly deployed MSNs. Target coverage is usually interpreted as how well a sensor network will cover an area of interest. Network Connectivity is defined as the ability of the sensor nodes to collect data and report data to the sink node. Target Coverage and Network Connectivity may also affect the quality of network. In this paper, for target coverage, two algorithms i.e. basic algorithm based on clique partitions and TV Greedy algorithm based on voronoi diagrams of target are proposed. For network Connectivity, an optimal solution based on Steiner tree concept is proposed. In addition, LZW compression algorithm is used to compress data, due to which energy consumption is minimized.

Authors and Affiliations