A Survey on Placement of Sensor Nodes in Deployment of Wireless Sensor Networks
| Autor: | K. Bala Sai, V. Lahari, G.V.V. Manikrisha, K. Swetha |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
business.industry
Wireless network Computer science 010401 analytical chemistry 02 engineering and technology 01 natural sciences 0104 chemical sciences Voronoi partition Software deployment Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering Redundancy (engineering) Wireless 020201 artificial intelligence & image processing business Voronoi diagram Wireless sensor network Computer network Parametric statistics |
| Zdroj: | 2019 International Conference on Intelligent Sustainable Systems (ICISS). |
| DOI: | 10.1109/iss1.2019.8907968 |
| Popis: | Wireless Sensor Networks (WSN) denotes a set of geometrically dispersed and identified sensor nodes for recording and maintaining the environment and physical states and manages the obtained information at the center. The number of nodes and their locations is directly proportional to the coverage area of the sensor nodes and are referred as coverage pints. The placement of sensor nodes has become an important challenge in covering a small parametric and physical change that occurs in particular location. In wireless networks such issues were based on placement of sensor nodes. This influences the performance of wireless sensor network storage connectivity and resilience. For wireless Sensors many deployment schemes has been proposed. This paper describes about the comparative analysis of the various deployment strategies of sensor nodes with the random placement in these networks using voronoi diagram. The random deployment of sensor nodes in WSN will be helpful for avoiding some of the problems in applications like crowd management, occurrence of accidents etc. By maintaining the network connectivity the proposed algorithm decreases the redundancy and removes the isolated nodes. Lastly, the to heal coverage holes the algorithm tries to divide the field into different voronoi cells and tries to deploy nodes were ever required and thus nodes are moved into their local best positions according to Voronoi partition. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|