Access the full text.
Sign up today, get DeepDyve free for 14 days.
We develop distributed algorithms for adaptive sensor networks that respond to directing a target through a region of space. We model this problem as an online distributed motion planning problem. Each sensor node senses values in its perception space and has the ability to trigger exceptions events we call “danger” and model as “obstacles”. The danger/obstacle landscape changes over time. We present algorithms for computing distributed maps in perception space and for using these maps to compute adaptive paths for a mobile node that can interact with the sensor network. We give the analysis to the protocol and report on hardware experiments using a physical sensor network consisting of Mote sensors. We also show how to reduce searching space and communication cost using Voronoi diagram.
ACM Transactions on Sensor Networks (TOSN) – Association for Computing Machinery
Published: Aug 1, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.