Wireless Sensor Network Routing Research Based On Topology Information Perception

As an emerging technology, wireless sensor networks have been developing rapidly in recent years. Such networks consist of large numbers of low-cost micro sensor nodes distributed in target area in charge of real-time environmental Monitoring. There are many different applications including military, medicine, agriculture and transportation applications. More and more domestic and foreign scholars and specialists pay highly attention to it. Generally, Wireless sensor networks have great application value and broad development prospects.The energy of wireless sensor nodes is limited, therefore energy efficiency is the main goal of routing design. Network topology is the main basis of routing design, at the same time dynamic network topology increases the difficulties on the design. The salient features of the network topology are that topology boundary includes external and internal boundary. This paper mainly describes explicit boundary topology information acquisition by self organizing algorithm, thereby efficient routing protocol is proposed.Scholars at home and abroad have raised a number of boundary detection algorithms, but these algorithms are just intended primarily for accessing to boundary information, there is no distinction between boundary topology information, boundary topology information are not clear enough to improve routing performance. And networks rely mainly on the GPS device to obtain nodes location information, this leads to a huge cost of funds and energy in large scale network, so it doesn’t apply to low power wireless sensor networks. From the three dimensions of boundary topology information acquisition, boundary information distinguish, and determine the node coordinates, this paper respectively proposes innovative ways to get the clear boundary topology information. Ultimately combined with network topology information, chapter5proposes energy efficient routing strategy.First of all, this article analyzes the impact of edge information on routing topology, proposes fuzzy edge detection algorithm which gets topological boundary information by distributed computing using one hop node information. This algorithm is relative lower complexity than other boundary detection algorithm and could adjust the edge width. Aim to get more specific geographical information, this article proposed topology recognition algorithm based on gradient domain which divides monitoring areas into multiple gradient domain by selecting two source node, and distinguishes boundary topology information according to the characteristic that gradient rings are divided by topological edges, thus distinguishes inside and outside boundary to get more clear topology information.This article proposes minimum energy consumption tree routing topology edge based on boundary information. First of all, divides the network into multiple gradient rings according to the topology information, and calculates best tree node of gradient rings, and enters the stage of routing establishment. The stage is divided into hierarchical routing tree establishment phase and the data transmission phase.In hierarchical routing tree establishment stage, first determines the tree nodes of the gradient rings, establishes upper-level routing tree, and each tree node stand for the root node of lower levels; non-root nodes add on the nearest root node to establish the underlying routing tree, so completed establishment of hierarchical routing tree.After routing established the whole network goes into the data transmission phase, the nodes transfer data to root node according to its allocated time slots, eventually converge to sink nodes. For one round in two phases, each round must select the tree node again.Chapter6using VC6.0and Matlab for algorithm simulation, first compares routing delay between LEACH and PEGASIS, analyzes on the size of gradient ring, at last make comparison among routing algorithm in this article, LEACH and LEACH-C and GAF routing algorithm respectively in the situation of none boundary hole and boundary hole. Eventually conclusions:minimum energy consumption tree routing based on topology boundary has low transmission delay, balanced node load and extendes the network life period.Finally, gives a summary about analysis topology acquisition algorithm and routing algorithm in this article, and prospects about next-stage work need to be done in the future.