Next Hop Selection Algorithm using DS Evidence Theory for Wireless Sensor Networks

Wireless Sensor Networks (WSN) plays a vital role in a wide area of applications, encompassing environmental assessment, healthcare, automated industrial system etc,. The limited energy of sensor nodes poses a significant challenge, as it makes it difficult to maintain the network’s operation for an extended period and ensure reliable data transmission. To address this significant issue, this work proposes a new routing algorithm called the DS Evidence Theory-Based Energy Balanced Algorithm. The proposed algorithm adopts a distributed approach, where sensor nodes collaboratively form clusters based on their residual energy levels. Nodes then exchange information with neighbouring nodes to gather evidence related to energy levels and network topology. Employing Dempster’s rule of combination, the algorithm fuses the collected evidence to calculate a belief measure for each node concerning its energy level. The crux of the algorithm lies in its energy balancing strategy, where cluster heads collaboratively redistribute energy among nodes within their clusters to achieve a balanced energy distribution throughout the network. Consequently, the network’s lifetime is significantly enhanced, as no single node is excessively burdened, thus preventing early node failures. The primary objective of the proposed approach is to find the optimal next hop selection for efficient data transmission. From this work it is evident that sine membership function performs precise than triangular membership function.