| Routing protocol is one of the core technologies in wireless sensor network(WSN). Position-based routing protocols are suitable to be deployed in WSN with high efficiency, robustness and scalability, while greedy algorithm has been widely used as a promising localized routing approach for WSN. However, this routing may fail due to routing voids on random uniform deployment network. It’s important to study how to reduce the probability of a node being a routing void and how to use more recovery mechanism.This paper mainly studies the geographic routing algorithm in WSN. The specific research and implementation work include the following aspects:(1) In this paper, we analyze the probability of a node being a routing void theoretically under the condition of random uniform deployment. Based on the detailed analysis of the GPSR(Greedy Perimeter Stateless Routing), we present a new geographic routing algorithm, Protocol Based on Probability and Distance(PDRP), which finds shorter routers and reduces energy consumption. By calculating the probability of being a void node P and the distance from destination L, the algorithm selects a neighbor node whose ratio of L over P is minimized as the next hop. It is a good way to avoid encountering void node. Simulation results illustrate that PDRP is superior to GPSR in terms of packet loss rate, packet latency time, average throughput and average path length under different densities.(2) As the sensor nodes have limited battery resources, the lifetime of the network is the key consideration. We present a new energy aware geographic routing algorithm, Energy-aware Protocol Based on Probability and Distance(EPDRP). It considers both the local position information and remnant energy when choosing next-hop. We evaluate the GPSR and EPDRP algorithm using NS-2 simulator. Results show that EPDRP exhibits lower average hop count than GPSR and reduces the routing protocol overhead. It also effectively prolongs the network lifetime. |
PDF Full Text Request