Font Size: a A A

Void Predicted Geography Routing For Wireless Sensor Network

Posted on:2016-08-17Degree:MasterType:Thesis
Country:ChinaCandidate:Y F WangFull Text:PDF
GTID:2308330464952603Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
Wireless Sensor Network (WSN) is a self-organizing and multi-hop wireless net works, and consists of a large number of sensor nodes, it can be used for real-time monitoring.collecting,and transmitting of various data. Wireless Sensor Network deployed fast and convenient, with a wide range of applications, and it now draws more and more international concern, concern. For the very limited computing power, storage capacity, and communication capability, as well as the energy carried by the nodes, the traditional routing algorithms are not suitable for wireless sensor networks, so it is particularly important to study out a routing algorithm for wireless sensor networks.Geographic routing algorithm is a popular research direction. It does not need to obtain the topology of the entire network, but local network nodes’geographical position information to select routing, greatly reducing the energy consumption and control overhead, and perform well on scalability. Geographic routing algorithms mainly using greedy forwarding and choose the one closest to the destination node’s neighbor nodes from the local area as the next hop node, so that the data gradually close to the destination node When the network has enough nodes and nodes are well-distributed, the algorithm has high performance, the routing path is generally close to or reach the optimal routing. But when the network deployment is not uniform or part of nodes’energy used up, it leads to the appearance of routing Voids, and can not greedy forwarding any more, which will seriously affect the efficiency of routing.In order to solve the problem of routing void, many experts and scholars around the world spend a lot of time and energy on it, and they put forward many algorithms.These algorithms can be divided into several categories:flooding, perimeter forwarding Expand the scope of neighbor nodes and cost based etc. GPSR algorithm is a classical algorithm of geographic routing algorithm based on perimeter forwarding, When meeting the routing hole,GPSR will use the right hand rule to perimeter forwarding, eventually find a path to the destination node. If there has a path from the source node to destination node, GPSR algorithm can send packets to the destination node, that is to say the GPSR algorithm is a maximum delivery algorithm.Based on GPSR is proposed.this paper proposed a void predicted geography routing for wireless sensor network (VPGR).VPGR divide the communication range of node into four quadrants, it according to the number of neighbor node in four quadrants to judge whether a node is Void or not.Lots of Void node can be predicted, then choose a closest to the destination node as next hop, thus reducing the number of encounter the routing Void, improves routing efficiency. At the same time, we optimize perimeter forwarding too.make it no longer single rely on the right-hand rule to forwarding,but according to the topology of the network to dynamically select the forwarding direction.Through simulation results, the average hops of VPGR is 22.46% less than the GPSR, while the average number of hops, control overhead and packet delivery rate is slightly better than the RPR algorithm...
Keywords/Search Tags:Wireless sensor network(WSN), Geographic routing, Void prediction, Perimeter forwarding
PDF Full Text Request
Related items