Carrier-Based Coverage Augmentation in Wireless Sensor and Robot Networks

• Published in: 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops pp. 234 - 239
• Main Authors: Falcon, R, Xu Li, Nayak, A
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2010
• ISBN: 9781424474714; 142447471X
• ISSN: 1545-0678
• DOI: 10.1109/ICDCSW.2010.60

Carrier-based sensor placement involves mobile robots carrying and dropping (static) sensors for optimal coverage formation. Existing solutions target at traditional area coverage problem and unrealistically assume that robots carry sensors all together (ignoring the physical dimension of sensors and the limit of robot capacity). In this paper, we consider realistic scenarios that robots have to repeatedly reload sensors and address the FOCUSED coverage (F-coverage) problem in an unknown two-dimensional environment. In F-coverage, sensors are required to surround a point of interest (POI), maximizing coverage radius. We propose a Carrier Based Coverage Augmentation protocol (CBCA). Robots enter the environment from fixed locations, called base points, and move toward the POI. As soon as they get in touch with already deployed sensors, they search (by communication) along the network border for best sensor placement points with respect to F-coverage optimization, and move to drop sensors at the discovered locations. Border nodes store locations of failed sensors (if any exists) inside the network as well as adjacent available deployment spots outside the network, and recommend them to robots during the search process. Robots return to base points for reloading, after finishing with currently loaded sensors, and re-enter the environment to augment existing F-coverage. At the end o the paper, we propose an optimization technique to reduce augmentation delay and save robot energy.