Research On Coverage Algorithm For Mobile Sensor Network

As a new type of wireless sensor network (WSN), mobile wireless sensor network (mWSN) has many excellences, such as high fidelity sensing data, node position adjustable, controllable node mobility and network deployment flexibility, so it has been widely used in unattended scene, disaster scene, emergency rescuing scene and health care monitoring. For the great value in use and very broad application prospects of mWSN, it has become an industry and academic focus. However, k-coverage has become a crtical issue in mWSN under the conditions of strong network monitoring capacity, higher rate of data fault-tolerant and high reliability data transmission. This paper, aiming at the issue of mWSN k-coverage, makes the following contributions:(1) Nodes of mWSN may lead to coverage holes in networks and suffer the inefficient network coverage owning to the movement, energy loss, physical damage, errors, failures or other factors. Aiming at the issue mentioned above, this paper proposes a k-coverage algorithm clustering-based for mobile wireless sensor network(KCAC). Firstly, using the location information of nodes acquired from target monitoring networks, a network map table can be built by base station and network coverage holes in the destination monitoring network can be obtained through scanning. Then, using the idea of branch & bound method and spire search grid, virtual graph can be created for each coverage hole and by using the topology sort to search oriented virtual graph, the mobile sequences can be generated so that all of the coverage holes in network can be repaired by controlling the mobility of nodes and k-coverage of target monitoring networks can be achieved finally.(2) For the dynamic topology of mWSN and the limit of node energy, the existing WSN routing algorithms are hard to be applied in mWSN. Therefore, based on the k-coverage algorithm, this paper proposes a hierarchical model routing algorithm(HMRA) for mobile wireless sensor network. The main idea of the algorithm is to use the method of hiberarchy with longitudinal to route data, thereby source sensor nodes determine the direction of packet forwarding by comparing the current grid ID with destination grid. When the packet reaches its target grid, the receiver will broadcast messages to member nodes of the cluster. If the timeout of data forwarding triggers, the current grid will use the sliding window model to determine the direction of data forwarding. HMRA routing algorithm proposed in this paper is simple and easy to implement, with many merits like high success rate packet forwarding, reducing network load, increasing the network throughput and ensuring data communication network effective as well.(3) KCAC algorithm and HMRA algorithm are designed in this paper and are implemented by simulations under the platform of Windows XP and Matlab 7.0. In the simulation of KCAC algorithm, this paper mainly focuses on following items: the initial and final target network deployment, network area coverage and the variance of coverage uniformity. In the simulation of HMRA algorithm, the algorithm performance is verified according to the connectivity radius, area coverage and networks size.