A team of robotic agents for surveillance
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Autonomous Robots
Predictive distance-based mobility management for multidimensional PCS networks
IEEE/ACM Transactions on Networking (TON)
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A reliable sensor data collection network using unmanned aircraft
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Minimum spanning tree on spatio-temporal networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Hi-index | 0.00 |
This paper proposes search algorithms utilizing multiple mobile sensor nodes (MSN). Our goal is to minimize the total search time in a given search area while enabling cooperation among the MSNs and tolerating possible failures of one or more MSNs. We first describe a Lane Based Search (LBS) strategy in which each mobile sensor node is in charge of a subarea called a lane. We then propose and analyze two distributed synchronization schemes, namely Alternating Column Synchronization (ACS) and Strict Line Synchronization (SLS), which are essential for co-operation and fault tolerance to MSN failures. Simulations were performed to evaluate their performances in terms of the total search time. We show through simulation results and numerical analysis that strict line synchronization with appropriate parameters outperforms alternating column synchronization.