File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1117/12.541023
- Scopus: eid_2-s2.0-10044265500
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Peer-to-peer model for the area coverage and cooperative control of mobile sensor networks
Title | Peer-to-peer model for the area coverage and cooperative control of mobile sensor networks |
---|---|
Authors | |
Keywords | Sensor network coverage Graph theory Mobile sensor networks Sensor deployment |
Issue Date | 2004 |
Publisher | SPIE - International Society for Optical Engineering. The Journal's web site is located at https://www.spiedigitallibrary.org/conference-proceedings-of-spie |
Citation | Proceedings of SPIE - The International Society for Optical Engineering, 2004, v. 5403, n. PART 2, p. 439-450 How to Cite? |
Abstract | This paper presents a novel model and distributed algorithms for the cooperation and redeployment of mobile sensor networks. A mobile sensor network composes of a collection of wireless connected mobile robots equipped with a variety of sensors. In such a sensor network, each mobile node has sensing, computation, communication, and locomotion capabilities. The locomotion ability enhances the autonomous deployment of the system. The system can be rapidly deployed to hostile environment, inaccessible terrains or disaster relief operations. The mobile sensor network is essentially a cooperative multiple robot system. This paper first presents a peer-to-peer model to define the relationship between neighboring communicating robots. Delaunay Triangulation and Voronoi diagrams are used to define the geometrical relationship between sensor nodes. This distributed model allows formal analysis for the fusion of spatio-temporal sensory information of the network. Based on the distributed model, this paper discusses a fault tolerant algorithm for autonomous self-deployment of the mobile robots. The algorithm considers the environment constraints, the presence of obstacles and the nonholonomic constraints of the robots. The distributed algorithm enables the system to reconfigure itself such that the area covered by the system can be enlarged. Simulation results have shown the effectiveness of the distributed model and deployment algorithms. |
Persistent Identifier | http://hdl.handle.net/10722/212787 |
ISSN | 2023 SCImago Journal Rankings: 0.152 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tan, Jindong | - |
dc.contributor.author | Xi, Ning | - |
dc.date.accessioned | 2015-07-28T04:05:00Z | - |
dc.date.available | 2015-07-28T04:05:00Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | Proceedings of SPIE - The International Society for Optical Engineering, 2004, v. 5403, n. PART 2, p. 439-450 | - |
dc.identifier.issn | 0277-786X | - |
dc.identifier.uri | http://hdl.handle.net/10722/212787 | - |
dc.description.abstract | This paper presents a novel model and distributed algorithms for the cooperation and redeployment of mobile sensor networks. A mobile sensor network composes of a collection of wireless connected mobile robots equipped with a variety of sensors. In such a sensor network, each mobile node has sensing, computation, communication, and locomotion capabilities. The locomotion ability enhances the autonomous deployment of the system. The system can be rapidly deployed to hostile environment, inaccessible terrains or disaster relief operations. The mobile sensor network is essentially a cooperative multiple robot system. This paper first presents a peer-to-peer model to define the relationship between neighboring communicating robots. Delaunay Triangulation and Voronoi diagrams are used to define the geometrical relationship between sensor nodes. This distributed model allows formal analysis for the fusion of spatio-temporal sensory information of the network. Based on the distributed model, this paper discusses a fault tolerant algorithm for autonomous self-deployment of the mobile robots. The algorithm considers the environment constraints, the presence of obstacles and the nonholonomic constraints of the robots. The distributed algorithm enables the system to reconfigure itself such that the area covered by the system can be enlarged. Simulation results have shown the effectiveness of the distributed model and deployment algorithms. | - |
dc.language | eng | - |
dc.publisher | SPIE - International Society for Optical Engineering. The Journal's web site is located at https://www.spiedigitallibrary.org/conference-proceedings-of-spie | - |
dc.relation.ispartof | Proceedings of SPIE - The International Society for Optical Engineering | - |
dc.subject | Sensor network coverage | - |
dc.subject | Graph theory | - |
dc.subject | Mobile sensor networks | - |
dc.subject | Sensor deployment | - |
dc.title | Peer-to-peer model for the area coverage and cooperative control of mobile sensor networks | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1117/12.541023 | - |
dc.identifier.scopus | eid_2-s2.0-10044265500 | - |
dc.identifier.volume | 5403 | - |
dc.identifier.issue | PART 2 | - |
dc.identifier.spage | 439 | - |
dc.identifier.epage | 450 | - |
dc.identifier.issnl | 0277-786X | - |