Abstract

We investigate mobile sensor deployment algorithms when the sensors have a limited communication range and they estimate other sensors location from the messages they receive from them. These pragmatic constraints bring two implications: the former implies that each sensor will only be aware of the presence of those sensors whose communication ranges include that sensor, and the latter indicates that location information can be inaccurate, due to estimations error. Consequently, the conventional Voronoi-based mobile sensor deployment algorithms fail to guarantee a simple, reliable coverage detection; additionally, the sensors are prone to collision. We introduce a new set of Voronoi-based diagrams, named guaranteed Voronoi diagrams with limited communication, to tackle the above problems.

Full Text
Published version (Free)

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 call