Detecting Separation in Robotic and Sensor Networks

Details Detecting Separation in Robotic and Sensor Networks Detecting Separation in Robotic and Sensor Networks

2011-02-16

arxiv.org/abs/1102.3396v1

Computer Science

Robotics

Scientific paper

In this paper we consider the problem of monitoring detecting separation of agents from a base station in robotic and sensor networks. Such separation can be caused by mobility and/or failure of the agents. While separation/cut detection may be performed by passing messages between a node and the base in static networks, such a solution is impractical for networks with high mobility, since routes are constantly changing. We propose a distributed algorithm to detect separation from the base station. The algorithm consists of an averaging scheme in which every node updates a scalar state by communicating with its current neighbors. We prove that if a node is permanently disconnected from the base station, its state converges to $0$. If a node is connected to the base station in an average sense, even if not connected in any instant, then we show that the expected value of its state converges to a positive number. Therefore, a node can detect if it has been separated from the base station by monitoring its state. The effectiveness of the proposed algorithm is demonstrated through simulations, a real system implementation and experiments involving both static as well as mobile networks.

Affiliated with

Also associated with

No associations

Rating

Detecting Separation in Robotic and Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Detecting Separation in Robotic and Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting Separation in Robotic and Sensor Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-417614