Computer and Modernization ›› 2014, Vol. 0 ›› Issue (10): 81-84,91.doi: 10.3969/j.issn.1006-2475.2014.10.019

Previous Articles     Next Articles

Improvement and Implementation on Schnyder Routing Algorithm on Wireless Sensor Networks

  

  1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
  • Received:2014-07-23 Online:2014-11-03 Published:2014-11-05

Abstract: The virtual coordinate-based geometric routing protocol is an important direction of research on wireless sensor networks. At present, when the nodes in the network topology failure, the algorithm is no longer applicable because the structure of Schnyder wood was destroyed and the probability of greed condition will decrease sharply with the increasing of node failure rate. Inspired by the compass in real life, a novel algorithm called Greedy-Compass Double Model Routing Algorithm is proposed in order to solve the problem of node failure. The angle is the basic of choice by calculating the source nodes with neighbor nodes and destination node. Finally, an experiment demonstrated that the improved algorithm can effectively solve the node failure problem in geometric routing algorithm.

Key words: wireless sensor networks, geometric routing algorithm, Schnyder algorithm, node failure

CLC Number: