A handshake algorithm for scheduling communications in wireless sensor networks. (2nd October 2020)

• Record Type: Journal Article
• Authors: Taktak, Emna; Tounsi, Mohamed; Mosbah, Mohamed; Mnif, Abdessalem; Hadj Kacem, Ahmed
• Is Part Of: Concurrency and computation. Volume 34:Number 7(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-10-02
• Subjects: distributed scheduler -- energy efficiency -- fault tolerance -- handshake algorithm -- wireless sensor network; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.6038
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Wireless sensor networks (WSNs) are composed of sensors exchanging the information that they collect from the environment. The use of a scheduler offers an efficient solution to eliminate information redundancy and possible collisions in this network. A scheduler is responsible for choosing the sensors to exchange information at each step of the algorithm's execution. This article presents a WSN handshake algorithm (WSN‐HS) scheduling the communications between every two sensors safely in an exclusive mode. Our WSN‐HS is energy‐efficient. It tries to elaborate communications between sensors with the minimum of messages and thus with the minimum of energy consumption. In addition, our algorithm is fault‐tolerant to sensors' disappearance. Hence, when a sensor runs out of energy, the other sensors in the network will not be blocked and they will continue executing the distributed algorithm. We compare and evaluate our algorithm with another handshake algorithm. The results of the simulation done with two examples of distributed algorithms show that our algorithm significantly minimizes the energy consumption in the WSN. Moreover, in this article, we detail the analysis that emphasizes the efficiency of our WSN‐HS algorithm.