A Routing Algorithm Based On Geographical Location Information For Wireless Sensor Network

Wireless Sensor Networks (WSN), an integrated technology of sensors, embedded computing, wireless communications and distributed information processing, will be widely applied in military, industrial, environmental and commercial fields. The newly emerging Internet of Things, as the recent application field of WSN, depends on the theoretical reseach and technological innovation of WSN. WSN consists of a large number of dense sensor nodes, of which the energy and computing capabilities directly affect the network's efficiency and life cycle. Death caused by excessive energy consumption of a node will increase the burden of communication of its neighbor nodes, which may lead to the emergence of communications blackout due to some regional node energy depletion, even the failure of the entire wireless sensor network. How to use nodes'energy efficiently and extend the network lifetime is a priority in the study of wireless sensor network. For extra energy expenditure and energy consumption imbalance brought by random and repeated selection of cluster nodes in LEACH algorithm, this thesis propose a novel geographical location information-based routing algorithm for WSN on the basis of the existing routing algorithms. Analyzing and comparing the simulation results verify the effectiveness of the presented algorithm. Our work mainly covers the following aspects:1. For the uneven distribution problem of cluster head nodes, a new division method of the network is developed by using the base station to scan the dispersal area. This division method guarantees that all the divided grids have the same shape and area, achieving network's energy consumption equalization. Regional division is no need in subsequent rounds, while nodes receive control information sent by the base station. By this means, communication and computation overhead are saved.2. According to the nodes'residual energy and geographical location information, cluster heads are selected within each grid in the proposed fan-shaped division area. By applying the minimum energy transmitting model, data transmission is achieved from the outer cluster head node to the inner cluster head node, until the base station. This method avoids the re-election of the cluster head nodes with low residual energy, thus reduces the energy consumption in communication between the cluster head and cluster head, and communication between ordinary nodes and cluster head.3. To solve the "hot spot" problem generated by routing in WSN, backup nodes are sown in different density in each layer according to the energy consumption, which balances the network lifecycle vertically. The improved method avoids monitor blind area caused by the premature death of some nodes in certain clusters, so that the lifetime of WSN can be extended.4. Numerical simulations of the geographical location information-based routing algorithm for WSN are carried out. By comparison with the original LEACH protocol, simulation results verify the presented algorithm is effective in many ways such as saving energy consumption, balancing node energy consumption and extending network's lifetime. It is demonstrated that the existing energy overhead and consumption imbalance problems in LEACH algorithm is solved through our algorithm.Finally, the research works are summarized, and the prospects of the development of WSN are overlooked. WSN routing algorithm and energy issues are worthy of further study.