A performance study of LEACH and direct diffusion routing protocols in wireless sensor network

Abstract EN

The Wireless Sensor Network (WSN) is composed of a large number of sensor nodes with limited computation communication, and battery facilities.

One of the common applications of this network is environment monitoring through sensing motion, measuring temperature, humidity and radiation.

One of the basic activities in WSN is data gathering which represents a great challenge.

Many routing protocols are proposed for that network to collect and aggregate the data.

The most popular ones are hierarchy and data centric routing protocols.

The main goal of this study is to identify the most preferable routing protocol, to be used in each mobility model.

This paper studies the performance of LEACH (Low Energy Adaptive Clustering Hierarchy) from hierarchy routing protocol and direct diffusion from data centric routing protocol which is not clarified until now.

Moreover, a comparison between LEACH and direct diffusion protocol using NS2 simulator will be made, and an analysis of these protocols will be conducted.

The comparison includes packet delivery ratio, throughput, average energy ratio, average delay, network lifetime, and routing overhead.

The performance is evaluated by varying the number of sensor nodes under three mobility models Reference Point Group Mobility Model (RPGM), Manhattan and random waypoint mobility model.

Simulation results show that LEACH routing protocol has a good performance in RPGM and Manhattan than random waypoint mobility model.

Direct diffusion has a good performance in random waypoint mobility model than in RPGM and Manhattan mobility model.