Abstract
Wireless sensor networks are usually randomly deployed in the monitored region. This initial deployment does neither achieve area coverage, nor ensure network connectivity. Thus, a redeployment algorithm has to be applied in order to meet these two requirements. In this paper, we overview existing centralized redeployment algorithms such as virtual forces or particle swarm optimization category, as well as distributed algorithms such as Distributed Self-Spreading Algorithm, Force based Genetic Algorithm, Mass-Spring Relaxation Algorithm, unified Scheme for Deployment and Relocation. We then discuss some open issues related to algorithm convergence, assumptions about the initial knowledge available like the initial topology, number of sensor nodes and obstacle positions.
| Original language | English |
|---|---|
| Pages (from-to) | 946-951 |
| Number of pages | 6 |
| Journal | Procedia Computer Science |
| Volume | 10 |
| DOIs | |
| Publication status | Published - 1 Jan 2012 |
| Event | 3rd International Conference on Ambient Systems, Networks and Technologies, ANT 2012 and 9th International Conference on Mobile Web Information Systems, MobiWIS 2012 - Niagara Falls, ON, Canada Duration: 27 Aug 2012 → 29 Aug 2012 |
Keywords
- Connectivity
- Coverage
- Deployment
- Mobile robot network
- Mobile sensor network
- Redeployment
- Wireless sensor network
Fingerprint
Dive into the research topics of 'Overview of deployment and redeployment algorithms for mobile wireless sensor networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver