Optimal 1-coverage by homogeneous mobile sensor nodes using hexagonal scheme

Mobile sensor nodes are featured with node mobility along with standard sensor functions. They can move around after being deployed. In many situations placement of static sensor nodes might not be possible and human intervention is not feasible. Mobile sensor nodes are very useful in such hazardous and disastrous situations. When a group of mobile sensor nodes are deployed to cover an area for search operations, coordination among the deployed nodes is very important. A mobile sensor node (MSN) depletes more energy during the traversal. Whenever there arises a failure, in one of the deployed mobile sensor nodes, the remaining fault-free mobile sensor nodes should travel to cover the remaining uncovered area. In this work we propose a Mobile Traversal Algorithm (MTA), for mobile sensor nodes to cover a rectangular region of interest (ROI). It makes MSNs to travel shorter distances to extend effective operational duration of the network and also to provide fault tolerance mechanism.