A novel connectivity and coverage algorithm based on shortest path for wireless sensor networks
| Autor: | Geng Sun, Ying Zhang, Han Li, Aimin Wang, Yanheng Liu, Shuang Liang |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
General Computer Science
business.industry Node (networking) Distributed computing 020208 electrical & electronic engineering Mode (statistics) 020206 networking & telecommunications 02 engineering and technology Energy consumption Average path length Key distribution in wireless sensor networks Control and Systems Engineering Shortest path problem 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering business Algorithm Wireless sensor network Constrained Shortest Path First Mathematics Computer network |
| Zdroj: | Computers & Electrical Engineering. 71:1025-1039 |
| ISSN: | 0045-7906 |
| DOI: | 10.1016/j.compeleceng.2017.10.019 |
| Popis: | A novel shortest path connectivity and coverage algorithm (SPCCA) for wireless sensor networks is proposed to reduce the energy consumption and to extend the network lifetime. The main procedure of SPCCA is as follows: first, each node determines whether it is the redundant node. Then, the redundant nodes enter into the ready-to-sleep mode through the node selection method and the sleepless nodes enter into the active mode. In this way, the blind spot can be avoided and the energy balance can be guaranteed. Finally, the redundant nodes on the shortest path are woken up in order to guarantee the connectivity of the network. Simulation results show that the number of working nodes of SPCCA is stable and they do not increase with the number of the deployed nodes. Moreover, SPCCA has better performance than most homogeneous algorithms in terms of the network coverage, connectivity, connection cost and network lifetime. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect