An Energy Efficient Routing for Wireless Sensor Networks based on a novel Cluster Head Election | ||||
| The International Conference on Electrical Engineering | ||||
| Article 89, Volume 7, 7th International Conference on Electrical Engineering ICEENG 2010, May 2010, Page 1-17 PDF (242.39 K) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/iceeng.2010.33257 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Ashraf. Abo shosha1; Ragab. Elsagher2; Abd elwahab3 | ||||
| 1Egyptian Armed Forces. | ||||
| 2Benha High Technology Institute, Benha, Egypt. | ||||
| 3College of Engineering, Cairo University, Cairo, Egypt. | ||||
| Abstract | ||||
| Abstract: Wireless sensor networks (WSNs) consist of a limited capability nodes called sensors. These sensors may be in size of grain of dust in some applications so it has very limited resources (memory, energy, computational capabilities, transmission range…ect). Most of the WSN literature focuses on the efficient use of the network resources to increase the network life time as well as the system robustness. Unlike traditional networks, where the focus is on maximizing channel throughput or minimizing node deployment and enhancing the quality of service. This paper presents a new cluster head election algorithm aims to prolong the stable region of the network as well as the system life time by using the network energy efficiently. The presented technique is called the heterogeneity aware LEACH (HALEACH). It was compared to the Direct transmission (DT), the homogeneous LEACH, the heterogeneity unaware LEACH and the Fair protocol. The results show that HALEACH outperforms the other compared techniques. | ||||
|
Statistics Article View: 162 PDF Download: 216 |
||||
