Comparison of L-PEDAP routing protocol with random way point mobility model in mobile sensor networks

Routing protocols in wireless sensor networks helps node to send and receive packets. Traditional hierarchical routing algorithms combine adaptability to changing environments with energy aware aspects. In this random mobility model structure, which nodes can construct from the position of their 1-hop neighbors. This also describes topology, route computation and route maintenance protocols to respond to predicted sensor failures and addition of new sensors. Localized - Power Efficient Data Aggregation Protocol (L-PEDAP) and Ad hoc on demand Distance Vector routing protocol (AODV) are compared. The performance of these two routing protocols (L-PEDAP, AODV) is based on metrics such as packet delivery ratio, end to end delay; energy consumption and throughput, also this work will analyze and compare the performance of protocols using NS-2.34, when various other mobility models are applied to these protocols.