Publication:
Distributed sensor deployment using potential fields

dc.contributor.authorGAZİ, VEYSEL
dc.contributor.authorsHanay, Y. Sinan; Gazi, Veysel
dc.date.accessioned2022-03-12T20:32:52Z
dc.date.accessioned2026-01-11T10:36:54Z
dc.date.available2022-03-12T20:32:52Z
dc.date.issued2017
dc.description.abstractMaximization of sensing coverage has been an important problem in mobile sensor networks. In this work, we present two novel algorithms for maximizing sensing coverage in 2D and 3D spaces. We evaluate our methods by comparing with two previously proposed methods. All the four methods are based on potential fields. The previous work used the same potential function, however the algorithms we propose here use two different potential functions. Potential fields require low complexity, which is crucial for resource lacking mobile sensor nodes. Though potential fields are widely used for path planning in robotics, only a few works used potential fields for coverage maximization in mobile sensor networks. Through simulations, we compare our proposal with the previous algorithms, and show that the algorithm we propose here outperforms previous algorithms. (C) 2017 Elsevier B.V. All rights reserved.
dc.identifier.doi10.1016/j.adhoc.2017.09.006
dc.identifier.eissn1570-8713
dc.identifier.issn1570-8705
dc.identifier.urihttps://hdl.handle.net/11424/234440
dc.identifier.wosWOS:000416189300007
dc.language.isoeng
dc.publisherELSEVIER SCIENCE BV
dc.relation.ispartofAD HOC NETWORKS
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectMobile sensor networks
dc.subjectSensing coverage maximization
dc.subjectPotential fields
dc.subjectSTABILITY ANALYSIS
dc.subjectNETWORKS
dc.subjectAGGREGATIONS
dc.subjectCOVERAGE
dc.subjectROBOTS
dc.subjectSWARMS
dc.titleDistributed sensor deployment using potential fields
dc.typearticle
dspace.entity.typePublication
oaire.citation.endPage86
oaire.citation.startPage77
oaire.citation.titleAD HOC NETWORKS
oaire.citation.volume67

Files