Vortex Search Topology Control Algorithm for Wireless Sensor Networks

Abstract

Abstract:Wireless sensor networks (WSNs) is composed of a huge number of sensor nodes that are densely deployed in a target environment. One of the major fundamental challenges in WSNs is the Topology control (TC). TC algorithms try to reduction the average of nodes transition radius without reduction of the network connectivity. This paper has proposed a metaheuristic algorithm for TC based on the vortex search (VS) algorithm for WSNs termed VSTC. VSTC algorithm dynamically adjusts transition radius of nodes, so the proper transition radius can be obtained using VS algorithm, so the position of each node is to calculate and represented in a binary format to enhance the coverage area and reduce the number of active nodes. Furthermore, the proposed algorithm is under a less average number of neighbours and the energy consumption compared with the present algorithms. In addition, the proposed algorithm is simulated with the A1 topology algorithm (A1), A3 topology algorithm (A3), and topology control scheme based on particle swarm optimization algorithm (PSOTCS) algorithm, the experimental results have been provided the highest in terms of the high residual energy by 34% and the number of active nodes was decreased by 18%.

Binary grey wolf optimisation‐based topology control for WSNs

“…Vertex sort TC (VSTC) algorithm [17] adjusts the transition radius of nodes. A location of each node is used and characterised in a binary system to augment the coverage area and decrease the quantity of ANs.…”

A Mechanized Formal Refinement Proof of Modbus Communication Using Event-B Proof System

“…Event-B can be regarded as a method for correct-by-construction software development. Event-B has gained widespread attention with it tool support which can be employed to specify different communication protocols as in [11], wireless communication [12], Wireless Sensor Networks [13] or in hybrid encryption technique [14].…”