Search

The energy consumption is considered to be the major challenge in wireless sensor networks. In this paper, we shed light on a new approach to overcome the energy consumption problems. The objective of this work is to integrate an improved algorithm which is the K-means to create a balanced energy on clusters and to use the Gaussian elimination algorithm during the election of cluster head that will guarantee the distribution of energy consumption. To address the problem of the optimal number of groups, we use Davies Bouldin index to increase the network lifetime. The simulation result shows that the proposed protocol extends the network lifetime compared to Leach, iMod-Leach, leach-C, and CELRP. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are used to retrieve information in hostile environments that are not always accessible to human beings. Once they are deployed, the sensors are considered autonomous. Their lifetime is equivalent to the lifetime of their battery. The energy factor is the center of all the concerns of the sensors: economic routing protocols, adapted wireless technology, etc. Energy costs must be minimized because energy is a key constraint in sensor networks. This paper is part of the study of the routing problem in WSNs. Indeed, the problem consists of the nodes located around the base station (BS), which transmit data to other nodes, their energy is depleted more quickly. This causes energy holes and areas called hot spot. To address this problem, we used the unequal clustering mechanism in order to solve the network hot spot problem. Clusters closer to the BS have smaller sizes than those farther from the BS to overcome the energy over-consumption around the BS. The evaluation of our solution will be carried out using the platform Omnet++/Castalia. The simulation results obtained allow a glimpse of the energy gained by the proposed protocol compared to the protocol Eeuc. Energy efficiency is achieved thanks to the use of a network management policy which enables to balance the energy levels of different nodes, consequently, extends the lifetime of the network. • The hierarchical architecture in Wireless Sensor Networks (WSN) has been widely adopted. • A new routing algorithm Multi Hop based Competition Radius is developed aiming to increase the WSN's life time. • Simulation results show that the proposed algorithm presents efficient results in terms of network lifetime, Latency and energy consumption. [ABSTRACT FROM AUTHOR]