Routing Protocols and Algorithms for Wireless Sensor Networks | ||||
| The Egyptian International Journal of Engineering Sciences and Technology | ||||
| Article 4, Volume 18, Issue 4, November 2015, Page 258-263 PDF (909.57 K) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/eijest.2015.97123 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| R El Awady; A Abo-Taleb; H El Mongy* | ||||
| Department of Electronics and Communications Engineering, Faculty of Engineering, Mansoura University, Mansoura, Egypt | ||||
| Abstract | ||||
| Wireless Sensor Networks (WSNs) are attracted more attention than ever before due to the recent technology development. Wireless sensor networks depend on small battery powered devices with limited energy resources. Anonymous nodes change dynamically Network topology of WSNs. New applications and require non-conventional paradigms are enabled for designing algorithms by using WSNs. As the use of WSNs is increasing day by day, the main target is to design an effective and energy aware protocol in order to increase the network lifetime for specific application environment. Owing to the requirement for low device complexity together with low energy consumption (i.e., long network lifetime). In this research the proposed work using LEACH, ST for TEEN and M-GEAR protocols is applied. Our goal is to design a gateway based energy aware multi-hop routing protocol using MATLAB and compare the performance for M_GEAR with LEACH and TEEN protocols. Here our work describe an energy-efficient multihop routing protocol using gateway node to maximization the life time wireless sensor network and for the minimize energy consumption of sensor network. The network is divided into logical regions. Each region uses a various communication hierarchy. Two regions of the network use direct communication topology .the other two regions are further sub-divided into clusters and use multi-hop communication hierarchy. Because of the heavy energy burden, the cluster head dies and life time of network minimizes. As the distances between base station and the nodes are far, our work put gateways as intermediate between the cluster head and base station to reduce the distance. Every node elects itself as a CH independent of other region. This technique encourages better distribution of CHs in the network Cluster head is chosen randomly in M-GEAR protocol due to the low of current energy of some cluster heads of cluster. | ||||
| Keywords | ||||
| Routing Algorithms LEACH TEEN M; GEAR WSNs | ||||
|
Statistics Article View: 78 PDF Download: 187 |
||||
