A new robust genetic algorithm for dynamic cluster formation in wireless sensor networks

Sudha R. Mudundi, Hesham H Ali

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Citations (Scopus)

Abstract

Wireless sensor networks are widely deployed for a wide range of data gathering applications such as collecting environmental information, collecting military data, and monitoring large buildings. However, the limited energy of the sensor nodes requires efficient gathering of information so that the network lifetime is increased. In literature it is proved that this efficiency can be achieved by clustering the sensor nodes in the network. In this paper, we present a new robust genetic algorithm for forming dynamic clusters in sensor networks. The proposed genetic clustering algorithm (GCA) takes into consideration the energies and the distance between the nodes to form efficient clusters. The algorithm aims at forming well-balanced clusters so that the load is balanced in the network. The algorithm can be applied in scenarios where a central node controls the sensor network and requires efficient clustering. Simulation results show that the algorithm forms balanced clusters that increase the network lifetime by having minimum energy dissipation in the network. Results are also compared with other clustering protocols and it is shown that GCA has lesser node deaths and more data signals sent to the base station.

Original languageEnglish (US)
Title of host publicationProceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007
Pages360-367
Number of pages8
StatePublished - Dec 1 2007
Event7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007 - Montreal, QC, Canada
Duration: May 30 2007Jun 1 2007

Publication series

NameProceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007

Conference

Conference7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007
CountryCanada
CityMontreal, QC
Period5/30/076/1/07

Fingerprint

Wireless sensor networks
Genetic algorithms
Sensor nodes
Clustering algorithms
Sensor networks
Base stations
Energy dissipation
energy
Network protocols
Monitoring
building
Military
monitoring
scenario
death
efficiency
simulation

Keywords

  • Clustering techniques
  • Genetic algorithms and wireless networks
  • Sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Mudundi, S. R., & Ali, H. H. (2007). A new robust genetic algorithm for dynamic cluster formation in wireless sensor networks. In Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007 (pp. 360-367). (Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007).

A new robust genetic algorithm for dynamic cluster formation in wireless sensor networks. / Mudundi, Sudha R.; Ali, Hesham H.

Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007. 2007. p. 360-367 (Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mudundi, SR & Ali, HH 2007, A new robust genetic algorithm for dynamic cluster formation in wireless sensor networks. in Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007. Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007, pp. 360-367, 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007, Montreal, QC, Canada, 5/30/07.
Mudundi SR, Ali HH. A new robust genetic algorithm for dynamic cluster formation in wireless sensor networks. In Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007. 2007. p. 360-367. (Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007).
Mudundi, Sudha R. ; Ali, Hesham H. / A new robust genetic algorithm for dynamic cluster formation in wireless sensor networks. Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007. 2007. pp. 360-367 (Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007).
@inproceedings{9dfda387b55243b485d8ba901ffe8865,
title = "A new robust genetic algorithm for dynamic cluster formation in wireless sensor networks",
abstract = "Wireless sensor networks are widely deployed for a wide range of data gathering applications such as collecting environmental information, collecting military data, and monitoring large buildings. However, the limited energy of the sensor nodes requires efficient gathering of information so that the network lifetime is increased. In literature it is proved that this efficiency can be achieved by clustering the sensor nodes in the network. In this paper, we present a new robust genetic algorithm for forming dynamic clusters in sensor networks. The proposed genetic clustering algorithm (GCA) takes into consideration the energies and the distance between the nodes to form efficient clusters. The algorithm aims at forming well-balanced clusters so that the load is balanced in the network. The algorithm can be applied in scenarios where a central node controls the sensor network and requires efficient clustering. Simulation results show that the algorithm forms balanced clusters that increase the network lifetime by having minimum energy dissipation in the network. Results are also compared with other clustering protocols and it is shown that GCA has lesser node deaths and more data signals sent to the base station.",
keywords = "Clustering techniques, Genetic algorithms and wireless networks, Sensor networks",
author = "Mudundi, {Sudha R.} and Ali, {Hesham H}",
year = "2007",
month = "12",
day = "1",
language = "English (US)",
isbn = "9780889866591",
series = "Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007",
pages = "360--367",
booktitle = "Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007",

}

TY - GEN

T1 - A new robust genetic algorithm for dynamic cluster formation in wireless sensor networks

AU - Mudundi, Sudha R.

AU - Ali, Hesham H

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Wireless sensor networks are widely deployed for a wide range of data gathering applications such as collecting environmental information, collecting military data, and monitoring large buildings. However, the limited energy of the sensor nodes requires efficient gathering of information so that the network lifetime is increased. In literature it is proved that this efficiency can be achieved by clustering the sensor nodes in the network. In this paper, we present a new robust genetic algorithm for forming dynamic clusters in sensor networks. The proposed genetic clustering algorithm (GCA) takes into consideration the energies and the distance between the nodes to form efficient clusters. The algorithm aims at forming well-balanced clusters so that the load is balanced in the network. The algorithm can be applied in scenarios where a central node controls the sensor network and requires efficient clustering. Simulation results show that the algorithm forms balanced clusters that increase the network lifetime by having minimum energy dissipation in the network. Results are also compared with other clustering protocols and it is shown that GCA has lesser node deaths and more data signals sent to the base station.

AB - Wireless sensor networks are widely deployed for a wide range of data gathering applications such as collecting environmental information, collecting military data, and monitoring large buildings. However, the limited energy of the sensor nodes requires efficient gathering of information so that the network lifetime is increased. In literature it is proved that this efficiency can be achieved by clustering the sensor nodes in the network. In this paper, we present a new robust genetic algorithm for forming dynamic clusters in sensor networks. The proposed genetic clustering algorithm (GCA) takes into consideration the energies and the distance between the nodes to form efficient clusters. The algorithm aims at forming well-balanced clusters so that the load is balanced in the network. The algorithm can be applied in scenarios where a central node controls the sensor network and requires efficient clustering. Simulation results show that the algorithm forms balanced clusters that increase the network lifetime by having minimum energy dissipation in the network. Results are also compared with other clustering protocols and it is shown that GCA has lesser node deaths and more data signals sent to the base station.

KW - Clustering techniques

KW - Genetic algorithms and wireless networks

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=56149086728&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=56149086728&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9780889866591

T3 - Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007

SP - 360

EP - 367

BT - Proceedings of the 7th IASTED International Conferences on Wireless and Optical Communications, WOC 2007

ER -