Improved an energy-aware scheduling algorithms in wireless sensor networks using evolutionary algorithm

Fazlollah Mohammadpour, Khadijeh Afhami


Wireless sensor network is an emerging technology with low cost and wide application in various fields. A network consists of a large number of sensor nodes which are spread in a wide area to gather information from their environment. The nodes consist of sensing, computing, communications and power supply parts as four main units. But, the limited energy, low correlation and volume storage capacity and low bandwidth are the main limitations. To save energy and cut its consumption, various algorithms are used in each node. There are different approaches to cluster nodes in wireless sensor networks, such as LEACH-ER algorithm  benefits increase the reliability of the network, reduce energy consumption and increase the network lifetime, Disadvantages against error is resistant and sustainability is not high,N-LEACH algorithm the benefits of reducing energy consumption - load balance in the network. Disadvantages scalable errors in front , what happened in the network is not sustainable, A-LEACH algorithm the benefits of reducing the likelihood of error, reducing the likelihood of cluster head, Disadvantages of stability in front of the error , lack of scalability , up to the number of nodes is not expected performance. In this study, a method to extend the life of the memetic algorithm based network is presented and network nodes lifetime increase is investigated. By increasing nodes lifetime, network coverage rises, practically. Applying this method, network coverage capacity can be increased. Obtained results of present study is compared with Leach algorithm between 100 to 500 nodes are provided.

Full Text:



  • There are currently no refbacks.

Creative Commons License 
This work is licensed under a Creative Commons Attribution 3.0 License. 

Copyright © 2016 by Global Publishing Corporation

ISSN: 2394-501X

For any Technical Support contact us at