Robust Wireless Sensor Network Deployment
In this work we present a decentralized deployment algorithm for wireless mobile sensor networks focused on deployment Efficiency, connectivity Maintenance and network Reparation (EMR). We assume that a group of mobile sensors is placed in the area of interest to be covered, without any prior knowle...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2016-04-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/2163/pdf |
| _version_ | 1827323817796567040 |
|---|---|
| author | Milan Erdelj Nathalie Mitton Tahiry Razafindralambo |
| author_facet | Milan Erdelj Nathalie Mitton Tahiry Razafindralambo |
| author_sort | Milan Erdelj |
| collection | DOAJ |
| description | In this work we present a decentralized deployment algorithm for wireless mobile sensor networks focused on deployment Efficiency, connectivity Maintenance and network Reparation (EMR). We assume that a group of mobile sensors is placed in the area of interest to be covered, without any prior knowledge of the environment. The goal of the algorithm is to maximize the covered area and cope with sudden sensor failures. By relying on the locally available information regarding the environment and neighborhood, and without the need for any kind of synchronization in the network, each sensor iteratively chooses the next-step movement location so as to form a hexagonal lattice grid. Relying on the graph of wireless mobile sensors, we are able to provide the properties regarding the quality of coverage, the connectivity of the graph and the termination of the algorithm. We run extensive simulations to provide compactness properties of the deployment and evaluate the robustness against sensor failures. We show through the analysis and the simulations that EMR algorithm is robust to node failures and can restore the lattice grid. We also show that even after a failure, EMR algorithm call still provide a compact deployment in a reasonable time. |
| first_indexed | 2024-04-25T01:58:39Z |
| format | Article |
| id | doaj.art-880b63342f694d33aca15a60c7c87cea |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:58:39Z |
| publishDate | 2016-04-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-880b63342f694d33aca15a60c7c87cea2024-03-07T15:29:03ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502016-04-01Vol. 17 no. 3Distributed Computing and...10.46298/dmtcs.21632163Robust Wireless Sensor Network DeploymentMilan Erdelj0https://orcid.org/0000-0001-7931-5942Nathalie Mitton1https://orcid.org/0000-0002-8817-6275Tahiry Razafindralambo2Université de Technologie de CompiègneSelf-organizing Future Ubiquitous NetworkLaboratoire d'Informatique et de MathématiquesIn this work we present a decentralized deployment algorithm for wireless mobile sensor networks focused on deployment Efficiency, connectivity Maintenance and network Reparation (EMR). We assume that a group of mobile sensors is placed in the area of interest to be covered, without any prior knowledge of the environment. The goal of the algorithm is to maximize the covered area and cope with sudden sensor failures. By relying on the locally available information regarding the environment and neighborhood, and without the need for any kind of synchronization in the network, each sensor iteratively chooses the next-step movement location so as to form a hexagonal lattice grid. Relying on the graph of wireless mobile sensors, we are able to provide the properties regarding the quality of coverage, the connectivity of the graph and the termination of the algorithm. We run extensive simulations to provide compactness properties of the deployment and evaluate the robustness against sensor failures. We show through the analysis and the simulations that EMR algorithm is robust to node failures and can restore the lattice grid. We also show that even after a failure, EMR algorithm call still provide a compact deployment in a reasonable time.https://dmtcs.episciences.org/2163/pdfwireless sensor networkdeployment[info.info-dm] computer science [cs]/discrete mathematics [cs.dm][info.info-ni] computer science [cs]/networking and internet architecture [cs.ni] |
| spellingShingle | Milan Erdelj Nathalie Mitton Tahiry Razafindralambo Robust Wireless Sensor Network Deployment Discrete Mathematics & Theoretical Computer Science wireless sensor network deployment [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-ni] computer science [cs]/networking and internet architecture [cs.ni] |
| title | Robust Wireless Sensor Network Deployment |
| title_full | Robust Wireless Sensor Network Deployment |
| title_fullStr | Robust Wireless Sensor Network Deployment |
| title_full_unstemmed | Robust Wireless Sensor Network Deployment |
| title_short | Robust Wireless Sensor Network Deployment |
| title_sort | robust wireless sensor network deployment |
| topic | wireless sensor network deployment [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-ni] computer science [cs]/networking and internet architecture [cs.ni] |
| url | https://dmtcs.episciences.org/2163/pdf |
| work_keys_str_mv | AT milanerdelj robustwirelesssensornetworkdeployment AT nathaliemitton robustwirelesssensornetworkdeployment AT tahiryrazafindralambo robustwirelesssensornetworkdeployment |