Distributed exploratory coverage with limited mobility Online publication date: Sat, 05-Jul-2014
by Sriram Chellappan; M.E. Snyder; Mayur Thakur
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 4, No. 2, 2014
Abstract: The impact of limited mobility in mobile sensor platforms is a limiting factor in the effectiveness of coverage algorithms. As the usage of autonomous drones increases in applications ranging from search-and-rescue, detection of forest fires, and surveillance, the ability for these platforms to employ distributed algorithms is increasingly important. In this paper, we examine the problem of exploratory coverage, wherein the objective is to move a number of mobile sensors to fully explore (and hence, sense every point in) a target area in order to detect any critical event that has already occurred in the area. Further, we present a taxonomy of coverage problems as identified by the relationships between sensor range, coverage area, number of sensors, and mobility (range). We then design a purely localised and distributed approximation algorithm for our problem, and provide simulation results for sparse and balanced deployments to demonstrate the effects of limited mobility on exploratory coverage.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook