Research On Mobile Node Scheduling Algorithm In Wireless Sensor Networks

Wireless sensor networks (WSNs) synthesize modern network communication technology, distributed information processing, and embedded computing technology and the sensor technology. It has a promising application prospect in various fields and has been a new hot research topic in recent years. As the performance improved and the cost reduced, using mobile nodes as nodes of sensor network has become feasible. This kind of mobile sensor network has all functions that wireless sensor networks have. The mobility increases the coverage range and upgrades the sensing ability of sensor network. Mobile sensor network can be extensively used in planetary exploration, military reconnaissance and disaster rescue. In this dissertation we mainly consider the mobile sensor node scheduling problem in WSNs, according to the current typical mobile sensor node scheduling strategies, by theoretical research and computer simulation.The main works are as follows:1. The current typical mobile sensor node scheduling strategies are discussed. By selectively analysing and comparing of a bidding protocol and a neighbor-information-based (NIBS) node-Scheduling scheme, the advantages and disadvantages are given.2. A distributed mobile sensor node algorithm is proposed through the above algorithms’analysis, including the candidate nodes selection strategy based on neighbor-information-based and the candidate nodes mobile strategy. The relationship between the rate of coverage change and sensor node number, as well as the rate of coverage change and the sensor radius is simulated and analyzed.3. We optimize the mobile sensor node algorithm by calculating the producing condition of the coverage hole area through mathematic analysis of center angles. The results show that, the optimal algorithm can achieve the coverage balance, and gain a high quality of service with a sufficient sensing coverage in WSNs.