Search

Summary: Providing the appropriate coverage is quite essential for the effective functioning of many applications in Wireless Sensor Networks. Therefore, the efficiency of node deployment algorithms to supply the requested coverage is of high significance. In this paper, inspired by the equilibrium of molecules, a novel node deployment algorithm, called Smart Self‐organising Node Deployment (SSND), is proposed to provide maximum coverage. Despite other proposed algorithms, which provide coverage based on the collective movement of nodes with massive energy consumption, SSND moves one sensor in every neighbourhood at each step to reduce the sensor nodes' movement and hence the energy consumption. The chosen sensor nodes at each time step are distributedly determined by an eligibility function to reduce the non‐essential movements while improving the accuracy of the reported locations of neighbours. Our extensive simulation study shows that SSND can achieve up to 30% coverage improvement compared to those of other algorithms in most scenarios and provides an adequate trade‐off between coverage and energy consumption. [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]