Modify LEACH Algorithm for Wireless Sensor Network
Research on wireless sensor networks has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Prolonged network lifetime, scalability, and load balancing are important requirement for many sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we introduce an energy efficient clustering algorithm for sensor networks based on the LEACH protocol. LEACH (Low Energy Adaptive Clustering Hierarchy) is one of popular cluster-based structures, which has been widely proposed in wireless sensor networks. LEACH uses a TDMA based MAC protocol, and In order to maintain a balanced energy consumption. The proposed protocol adds feature to LEACH to reduce the consumption of the network resource in each round. The proposed protocol is simulated and the results show a significant reduction in network energy consumption compared to LEACH.
Keywords: Wireless sensor networks, hierarchical Clustering , LEACH protocol, network lifetime
Download Full-Text
ABOUT THE AUTHORS
Mortaza
Graduate Student of Islamic Azad University, Shabestar Branch. Shabestar, Iran.
Mohammad Ali
Mohammad Ali Jabraeil Jamali. received his B.Sc. in Electrical Engineering and M.Sc. in Computer Hardware Engineering from Oromie University in 1994 and Tehran Science and Research Branch of Islamic Azad University in 2003, respectively. Currently, he is a Ph.D. student and Faculty Member at the Tehran Science and Research Branch of Islamic Azad University under supervision of Dr. Ahmad khademzadeh and Islamic Azad University, Shabestar Branch, respectively. His research interests include VLSI Design, Interconnection Network, Fault Tolerant, Ad hoc Network, Sensor Network and Computer Architectures. Email: m_jamali@itrc.ac.ir Education B.S., University of Oromie M.S., University of Oromie Ph.D., Science and Research Branch,Islamic Azad University of Tehran Journal Papers 1-The Optimum Location of Delay Latches Between Dynamic Pipeline Stages 2- Improved Circles Intersection Algorithm for Localization in Wireless Sensor Networks 3- An energy-efficient algorithm for connected target coverage problem in wireless sensor network 4-DAMQ-Based Schemes for chemes Efficiently Using the Buffer Spaces of a NoC Router
Mortaza
Graduate Student of Islamic Azad University, Shabestar Branch. Shabestar, Iran.
Mohammad Ali
Mohammad Ali Jabraeil Jamali. received his B.Sc. in Electrical Engineering and M.Sc. in Computer Hardware Engineering from Oromie University in 1994 and Tehran Science and Research Branch of Islamic Azad University in 2003, respectively. Currently, he is a Ph.D. student and Faculty Member at the Tehran Science and Research Branch of Islamic Azad University under supervision of Dr. Ahmad khademzadeh and Islamic Azad University, Shabestar Branch, respectively. His research interests include VLSI Design, Interconnection Network, Fault Tolerant, Ad hoc Network, Sensor Network and Computer Architectures. Email: m_jamali@itrc.ac.ir Education B.S., University of Oromie M.S., University of Oromie Ph.D., Science and Research Branch,Islamic Azad University of Tehran Journal Papers 1-The Optimum Location of Delay Latches Between Dynamic Pipeline Stages 2- Improved Circles Intersection Algorithm for Localization in Wireless Sensor Networks 3- An energy-efficient algorithm for connected target coverage problem in wireless sensor network 4-DAMQ-Based Schemes for chemes Efficiently Using the Buffer Spaces of a NoC Router
