Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Formation of a geometric pattern with a mobile wireless sensor network

Formation of a geometric pattern with a mobile wireless sensor network Mobile wireless sensor networks (MWSNs) will enable information systems to gather detailed information about the environment on an unprecedented scale. These self‐organizing, distributed networks of sensors, processors, and actuators that are capable of movement have a broad range of potential applications, including military reconnaissance, surveillance, planetary exploration, and geophysical mapping. In many of the foreseen applications, the MWSN will need to form a geometric pattern without assistance from the user. In military reconnaissance, for example, the nodes will be dropped onto the battlefield from a plane and land at random positions. The nodes will be expected to arrange themselves into a predetermined formation in order to perform a specific task. Thus, we present algorithms for forming a line, circle, and regular polygon from a given set of random positions. The algorithms are distributed and use no communication between the nodes to minimize energy consumption. Unlike past studies of geometric problems where algorithms are either tested in simulations where each node has global knowledge of all the other nodes or implemented on a small number of robots, the robustness of our algorithms has been studied with simulations that model the sensor system in detail. The simulations demonstrate that the algorithms are robust against random errors in the sensors and actuators. © 2004 Wiley Periodicals, Inc. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Field Robotics Wiley

Formation of a geometric pattern with a mobile wireless sensor network

Loading next page...
 
/lp/wiley/formation-of-a-geometric-pattern-with-a-mobile-wireless-sensor-network-VN1OUERnuY

References (22)

Publisher
Wiley
Copyright
Copyright © 2004 Wiley Subscription Services, Inc., A Wiley Company
ISSN
1556-4959
eISSN
1556-4967
DOI
10.1002/rob.20033
Publisher site
See Article on Publisher Site

Abstract

Mobile wireless sensor networks (MWSNs) will enable information systems to gather detailed information about the environment on an unprecedented scale. These self‐organizing, distributed networks of sensors, processors, and actuators that are capable of movement have a broad range of potential applications, including military reconnaissance, surveillance, planetary exploration, and geophysical mapping. In many of the foreseen applications, the MWSN will need to form a geometric pattern without assistance from the user. In military reconnaissance, for example, the nodes will be dropped onto the battlefield from a plane and land at random positions. The nodes will be expected to arrange themselves into a predetermined formation in order to perform a specific task. Thus, we present algorithms for forming a line, circle, and regular polygon from a given set of random positions. The algorithms are distributed and use no communication between the nodes to minimize energy consumption. Unlike past studies of geometric problems where algorithms are either tested in simulations where each node has global knowledge of all the other nodes or implemented on a small number of robots, the robustness of our algorithms has been studied with simulations that model the sensor system in detail. The simulations demonstrate that the algorithms are robust against random errors in the sensors and actuators. © 2004 Wiley Periodicals, Inc.

Journal

Journal of Field RoboticsWiley

Published: Oct 1, 2004

There are no references for this article.