Algorithm for routing data used in unorganized wireless sensor networks

摘要

This technique can be used in wireless sensor networks which do not have a specific layer or function for routing. It is not necessary to know all the nodes that make up the route, only the neighbor node that provides the shortest route, the one that is delivering the message to the gateway with as few hops as possible. The algorithm can be easy implemented in the CPU of each node using C or Assembler programming language.