Search

Summary: Wireless sensor network is an essential building block for Internet of Things (IoT) due to its usage for collecting and sensing data by the sensor nodes in a nearby environment. Energy efficiency is an important requirement for these networks as the sensors used are short on power and memory. In this paper, an enhanced energy‐efficient clustering protocol is proposed that works on three major phases under network setup: grid formation and grid head selection, clustering, and cluster head (CH) selection. Clustering is achieved using nature‐inspired grey wolf optimization (GWO) algorithm, and CH selection is accomplished using fuzzy inference‐based system. Simulation is performed in MATLAB software, and the protocol is evaluated in terms of network lifetime, the first node dead (FND), half node dead (HND), and last node dead (LND). Additionally, a prototype modeling of IoT using the Thingspeak IoT Platform provided by Mathworks is also integrated with the proposed protocol to demonstrate its usage in IoT applications. The simulation results indicated that the proposed scheme attained better performance in preserving energy and extending network lifetime. [ABSTRACT FROM AUTHOR]

Summary: Wireless sensors are considered the key elements in enabling efficient Internet of Things (IoT) networking and services. One of the key objectives in designing a WSN is increasing network lifetime by reducing the overall network energy consumption. To achieve this, several techniques have been proposed to extend the network lifetime, such as clustering. Clustering divides the network into several clusters, each with its own member nodes and a cluster‐head (CH) node. In this paper, a novel clustering mechanism is developed with the objective of extending network lifetime through load balancing in wireless sensor networks (WSNs). This is achieved by electing a new node to a provides specific tasks in the WSN to decrease energy consumption and enhance network lifetime. This node is called a relay node that is responsible of delivering the received data packets from the CHs, and then forwards them to the central node (sink). Unlike previous clustering schemes, the proposed algorithm consists of three main processes: CH selection, relay node selection, and medium access control processes. These processes depend on energy level and user's distributions. The performance of the proposed algorithm is investigated through simulation experiments in terms of network lifetime under various network parameters. The results reveal that the proposed mechanism significantly enhances network lifetime compared to previously proposed algorithms. [ABSTRACT FROM AUTHOR]