The neighborhoods method and routing in sensor networks

The paper proposes and tests a new technique for routing sensor networks. The method is based on the decomposition of a simply connected configuration of sensors on the set of disjoint neighborhoods with respect to the route start. The number of neighborhood which gets the destination node is equal to the number of hops. Backward pass neighborhoods will determine the route as a sequence of nodes. The routing technique is generalized to the case of dynamic configuration of sensors.