An introduction to genetic algorithms
An introduction to genetic algorithms
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint
IEEE Transactions on Mobile Computing
Genetic Algorithm for Energy Efficient Clusters in Wireless Sensor Networks
ITNG '07 Proceedings of the International Conference on Information Technology
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Local search genetic algorithm for optimal design of reliablenetworks
IEEE Transactions on Evolutionary Computation
Cluster based self-organization management protocols for wireless sensor networks
IEEE Transactions on Consumer Electronics
IEEE Communications Magazine
A genetic approach for WSN lifetime maximization through dynamic linking and management
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Efficiency issues of evolutionary k-means
Applied Soft Computing
International Journal of Communication Systems
Hi-index | 0.00 |
Sensor nodes forming a sensor network usually have limited energy capacity so it is important to minimize sensor nodes' energy consumption because of difficulty in supplying additional energy for the sensor nodes. Much attention has been given to the clustering technique as an efficient way of reducing the energy consumption of a sensor node. Energy saving results can vary greatly depending on the number and size of clusters and the distance among the sensor nodes. In this paper, we aim to find an optimal cluster formation by applying a genetic algorithm in which the chromosome contains the information about the relative position of the nodes. The Location-aware two-dimensional GA (LA2D-GA) proposed in this paper can performs more efficient gene evolution than one-dimensional GA (1D-GA) by giving unique location information to each node. The effectiveness of our algorithm is shown by simulation.