Improving The Performance of Lightweight On demand Ad hoc Distance Vector next generation (LOADng) Protocol on Wireless Sensor Network using Agglomerative Hierarchical Clustering

Abstract

Sensor technologies are becoming increasingly important in acquiring information about nearby environments, and their application in wireless sensor networks is becoming increasingly prevalent. A large number of sensor nodes that are installed in the field to observe certain events defines these networks. Due to the limited battery capacity in sensor nodes, energy efficiency is a major and challenging problem in such power constrained networks. To extend the lifetime of wireless sensor networks as well as conserving its power, some network parameters have been considered, which play an important role in the reduction of power consumption. These parameters are as battery capacity, communication radius, node density and query period. They have a direct impact on the network’s lifetime. These parameters have to be chosen in such a way that the network use its energy resources efficiently. To enhance these parameters effectively, different routing mechanisms are used. Routing has great role in maintaining effective path in between nodes. There are several routing strategies or route discovery mechanisms. In this thesis, the energy effective Lightweight On demand Ad hoc Distance Vector next generation (LOADng) routing mechanisms are discovered by using agglomerative hierarchical algorithms. The routing processes starting from route discovery to packet transmission were studied. The control messages used in LOADng protocols such as (RREQ, RREP, RERR, RREP_Ack), generating to forwarding are briefly examined. Introducing an energy-efficient data forwarding strategy based on node clustering to improve network stability and lifetime while lowering energy consumption is the contribution of this work. To achieve this contribution, a special simulation tool that helps in analyzing the effects of the parameters on sensor network lifetime has been designed and implemented by NS3 and GNU plot is used for plotting the graph. The results are simulated and compared in three different metrics such as packet delivery ratio (PDR), Average end to end delay (EED), Normalized routing overhead.