Abstract
In this paper, we consider the problem of covering all regions of interests (targets) by relocating a set of mobile sensors such that total movement made by them is minimized. This problem itself is a challenging one and addressed recently by some researchers under free mobility model. We consider a more restricted version of the problem where sensors can move only in two mutually perpendicular directions. We first show that the optimal point to which a sensor must move to cover a specific target is different under this model from the one where sensors can move freely, and characterize such a point. On the basis of this observation, we have developed heuristics to solve the problem. The heuristics run in two phases; the first phase ensures coverage and the second phase, connectivity. In both the phases, the sensors can move only with restricted mobility. We have run a set of experiments to evaluate the performance of the proposed algorithm and found that the total movement made in the first phase is comparable to the solution given by an IPP ( Integer Programming Problem ). For the second phase, we have presented two heuristics MinCon and MinCon_m. The algorithm MinCon works by finding connected components of the graph consisting of sensor nodes. It then identifies destination locations where some sensors must be placed so that all necessary components become connected. Once the destinations are known, the problem is solved by mapping it to an LSAP (Linear Sum Assignment Problem). The other heuristic MinCon_m improves over MinCon by moving only a subset of sensors to their destinations using the solution of LSAP. It then finds the movement of the remaining sensors applying a technique used in the first phase.
Highlights
Recent technological advances have led to the improvement of sensor frameworks which open new vistas for some potential applications like rural control, catastrophe help, biomedical and so on [1], [2]
The only way to deal with such situations is to use mobile sensors so that after initial deployment they can move to appropriate locations thereby ensuring area or target coverage whichever is desired
We show that no movement is initiated in phase 1 if all the targets are covered by the initial deployment of sensors
Summary
Recent technological advances have led to the improvement of sensor frameworks which open new vistas for some potential applications like rural control, catastrophe help, biomedical and so on [1], [2]. The existing sensor relocation algorithms for target coverage and connectivity are based on the assumption of the free mobility model [16]. Under these model, each sensor can move any amount in any direction. Assuming that the coverage area of a sensor is a circle of radius rs, we show that given a sensor s and a target t which is currently not covered by s, it is possible to find a point in O(1) time to which s should move to cover t such that distance moved by s under restricted mobility model is minimum. Two sensors si and sj can communicate with each other only if the Euclidean distance between them is less than or equal to the communication radius rc
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
