Authors
Uthman Baroudi, Anas Al-Roubaiey, Samir Mekid, Abdelhafid Bouhraoua
Publication date
2012/6/25
Conference
2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications
Pages
1714-1720
Publisher
IEEE
Description
The contemporary routing algorithms were built and tested under the assumption of uniformly distributed sensor nodes. However, this assumption is not always true. In some industrial applications and due to the scope of the ongoing monitoring process, sensors are installed and condensed in some area, while they are sparse in other areas. In this work, we investigate the impact of sensor node deployment distributions on the performance of different flavors of LEACH routing algorithm. Further, we study the impact of base station location, and different data loads. A comparison between LEACH and LEACH-C is conducted. The results show that different sensor distributions leads to significant differences in network performance. Furthermore, it shows that LEACH-C out performs LEACH almost in all distributions variations and base station locations.
Total citations
2014201520162017201820192020111112
Scholar articles
U Baroudi, A Al-Roubaiey, S Mekid, A Bouhraoua - 2012 IEEE 11th International Conference on Trust …, 2012