Research On WSN Coverage Algorithm For Rail Transit

The coverage of wireless sensor networks (WSN) is a hot research topic in recent years and it has been widely used in many fields. Also, it has a good practical significance when used in rail transit scenarios, such as the area at station and the area beside track, where real-time monitoring seems very necessary. WSN is used for real-time air quality monitoring or real-time data collection beside track. This paper reports on a study on this issue. In this paper, covering algorithms have been proposed for two rail transit scenarios: the Rail Transit Scenario at Station (RTSS) and the Rail Transit Scenario beside Track (RTST). The main contribution and work of this paper are:1. This paper summarizes the existing WSN coverage problem and also describes and compares the algorithms based on path exposure and sensor deployment strategy.2. The RTSS algorithm contains a main algorithm and a black hole algorithm, solving WSN coverage problem indoor by using fewer nodes. The black hole algorithm provides enough spare nodes for every working node.3. In RTST algorithm, size factor x and density factor y are obtained according to the analysis of energy consumption of RTST model. RTST algorithm can generate the Limited Voronoi Network based on x and y, and it can balance network energy consumption.4. The simulations are carried on to RTSS and RTST. The simulation of RTSS is based on a waiting room model. The vertex position and spare node position to place WSN nodes have been calculated. Compared to other theorems, the RTSS algorithm is more adapted to this situation. The simulation of RTST is based on three aspects:network size to three kinds of network, x factor, and y factor to network’s lifetime. In this situation, the result was that the network generated by RTST is better than uniform network and random network. Taking the appropriate values of x and y can optimize network performance.