Scalable hierarchical rings based routing to a mobile robot in wireless sensor networks

Location service provides location information of robots to sensors, to enable event reporting. Existing protocols apply partial flooding to trace robots, leading to poor scalability. We propose a novel scalable location service, which applies hierarchical rings to update robot location and guide routing toward it. Each mobile robot creates a set of hierarchical update rings of doubling radii. Whenever the robot leaves its k-th ring, it updates its new location to sensors along its newly defined k-th ring, and re-defines all smaller rings for future decisions. When a sensor needs to route to the mobile robot, it starts searching from its smallest ring and sends location query to the sensors along the ring. If the query fails, the search then extends to the next larger ring, until it intersects an existing update ring, from which the search can be directed towards reported center. The location of destination is updated whenever another more recent ring is intersected. Our scheme guarantees message delivery if robot remains connected to sensors during its move. The theoretical analysis and simulation results demonstrate better scalability than previous protocols for the similar goal. © 2014 IEEE.