Localised querying and location update service in wireless sensor and robot networks with arbitrary topology Online publication date: Tue, 17-May-2016
by Milan Lukic; Ivan Mezei
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 22, No. 1, 2016
Abstract: In a typical wireless sensor and robot networks (WSRN) setup, sensor nodes detect events which require response from mobile robots. First, a static information structure is established in the network, allowing an event-detecting node to send a request to a nearby robot, to visit its location. The movement of the robots imposes changes in the network structure, which are handled in location update process. These protocols should perform in a localised, distance-sensitive, energy efficient manner. Here we present a new protocol based on localised formation of Voronoi cells (vCell), and compare it with existing protocols (Quorum and iMesh) in dense networks, sparse networks, and networks with holes in topology. We also present location update algorithms which deal with robot mobility. Our simulations show that vCell achieves nearly 100% success rate in finding the nearest robot in dense networks. In sparse networks, it outperforms the other existing solutions by up to 40%.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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