A dynamic energy-aware algorithm for self-optimizing wireless sensor networks

Syed I. Nayer, Hesham H Ali

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

10 Citations (Scopus)

Abstract

Wireless sensor networks are distributed ad-hoc networks that consist of small sensor devices collecting and transmitting data. In such devices, optimizing power consumption due to sensing and routing data is an open area for researchers. In earlier works, approaches based on the Gur game, ant algorithms and evolutionary algorithms were introduced. These approaches have been employed to control the number of active sensors in wireless networks required to guarantee high performance parameters while taking energy conservation into consideration. These studies though ignored the coverage redundancy, which is a key issue in sensor networks. In this paper, we use the mathematical paradigm of the Gur Game in order to achieve the optimal assignment of active sensors while maximizing the number of regions covered by sensor nodes. We use a dynamic clustering algorithm that employs the concept of connected dominating sets. The proposed algorithm addresses this problem by playing Gur Game among the cluster nodes. We also further develop the earlier developed ants algorithm and genetic algorithm to take into consideration node addition and deletion. A simulation study was used to test the proposed algorithms under different network scenarios.

Original languageEnglish (US)
Title of host publicationSelf-Organizing Systems - Third International Workshop, IWSOS 2008, Proceedings
Pages262-268
Number of pages7
DOIs
StatePublished - Dec 1 2008
Event3rd International Workshop on Self-Organizing Systems, IWSOS 2008 - Vienna, Austria
Duration: Dec 10 2008Dec 12 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5343 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Workshop on Self-Organizing Systems, IWSOS 2008
CountryAustria
CityVienna
Period12/10/0812/12/08

Fingerprint

Wireless Sensor Networks
Wireless sensor networks
Ant Algorithm
Sensor
Game
Energy
Sensors
Vertex of a graph
Connected Dominating Set
Dynamic Algorithms
Distributed Networks
Energy Conservation
Ad hoc networks
Ad Hoc Networks
Sensor nodes
Clustering algorithms
Evolutionary algorithms
Deletion
Sensor networks
Sensor Networks

Keywords

  • Ants algorithms
  • Connected dominating set
  • Genetic algorithms
  • Gur game
  • Quality of Service (QoS)
  • Self optimizing
  • Wireless sensor networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Nayer, S. I., & Ali, H. H. (2008). A dynamic energy-aware algorithm for self-optimizing wireless sensor networks. In Self-Organizing Systems - Third International Workshop, IWSOS 2008, Proceedings (pp. 262-268). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5343 LNCS). https://doi.org/10.1007/978-3-540-92157-8-23

A dynamic energy-aware algorithm for self-optimizing wireless sensor networks. / Nayer, Syed I.; Ali, Hesham H.

Self-Organizing Systems - Third International Workshop, IWSOS 2008, Proceedings. 2008. p. 262-268 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5343 LNCS).

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

Nayer, SI & Ali, HH 2008, A dynamic energy-aware algorithm for self-optimizing wireless sensor networks. in Self-Organizing Systems - Third International Workshop, IWSOS 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5343 LNCS, pp. 262-268, 3rd International Workshop on Self-Organizing Systems, IWSOS 2008, Vienna, Austria, 12/10/08. https://doi.org/10.1007/978-3-540-92157-8-23
Nayer SI, Ali HH. A dynamic energy-aware algorithm for self-optimizing wireless sensor networks. In Self-Organizing Systems - Third International Workshop, IWSOS 2008, Proceedings. 2008. p. 262-268. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-92157-8-23
Nayer, Syed I. ; Ali, Hesham H. / A dynamic energy-aware algorithm for self-optimizing wireless sensor networks. Self-Organizing Systems - Third International Workshop, IWSOS 2008, Proceedings. 2008. pp. 262-268 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8bf39da183f144488c480fd2c04dc4cd,
title = "A dynamic energy-aware algorithm for self-optimizing wireless sensor networks",
abstract = "Wireless sensor networks are distributed ad-hoc networks that consist of small sensor devices collecting and transmitting data. In such devices, optimizing power consumption due to sensing and routing data is an open area for researchers. In earlier works, approaches based on the Gur game, ant algorithms and evolutionary algorithms were introduced. These approaches have been employed to control the number of active sensors in wireless networks required to guarantee high performance parameters while taking energy conservation into consideration. These studies though ignored the coverage redundancy, which is a key issue in sensor networks. In this paper, we use the mathematical paradigm of the Gur Game in order to achieve the optimal assignment of active sensors while maximizing the number of regions covered by sensor nodes. We use a dynamic clustering algorithm that employs the concept of connected dominating sets. The proposed algorithm addresses this problem by playing Gur Game among the cluster nodes. We also further develop the earlier developed ants algorithm and genetic algorithm to take into consideration node addition and deletion. A simulation study was used to test the proposed algorithms under different network scenarios.",
keywords = "Ants algorithms, Connected dominating set, Genetic algorithms, Gur game, Quality of Service (QoS), Self optimizing, Wireless sensor networks",
author = "Nayer, {Syed I.} and Ali, {Hesham H}",
year = "2008",
month = "12",
day = "1",
doi = "10.1007/978-3-540-92157-8-23",
language = "English (US)",
isbn = "3540921567",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "262--268",
booktitle = "Self-Organizing Systems - Third International Workshop, IWSOS 2008, Proceedings",

}

TY - GEN

T1 - A dynamic energy-aware algorithm for self-optimizing wireless sensor networks

AU - Nayer, Syed I.

AU - Ali, Hesham H

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Wireless sensor networks are distributed ad-hoc networks that consist of small sensor devices collecting and transmitting data. In such devices, optimizing power consumption due to sensing and routing data is an open area for researchers. In earlier works, approaches based on the Gur game, ant algorithms and evolutionary algorithms were introduced. These approaches have been employed to control the number of active sensors in wireless networks required to guarantee high performance parameters while taking energy conservation into consideration. These studies though ignored the coverage redundancy, which is a key issue in sensor networks. In this paper, we use the mathematical paradigm of the Gur Game in order to achieve the optimal assignment of active sensors while maximizing the number of regions covered by sensor nodes. We use a dynamic clustering algorithm that employs the concept of connected dominating sets. The proposed algorithm addresses this problem by playing Gur Game among the cluster nodes. We also further develop the earlier developed ants algorithm and genetic algorithm to take into consideration node addition and deletion. A simulation study was used to test the proposed algorithms under different network scenarios.

AB - Wireless sensor networks are distributed ad-hoc networks that consist of small sensor devices collecting and transmitting data. In such devices, optimizing power consumption due to sensing and routing data is an open area for researchers. In earlier works, approaches based on the Gur game, ant algorithms and evolutionary algorithms were introduced. These approaches have been employed to control the number of active sensors in wireless networks required to guarantee high performance parameters while taking energy conservation into consideration. These studies though ignored the coverage redundancy, which is a key issue in sensor networks. In this paper, we use the mathematical paradigm of the Gur Game in order to achieve the optimal assignment of active sensors while maximizing the number of regions covered by sensor nodes. We use a dynamic clustering algorithm that employs the concept of connected dominating sets. The proposed algorithm addresses this problem by playing Gur Game among the cluster nodes. We also further develop the earlier developed ants algorithm and genetic algorithm to take into consideration node addition and deletion. A simulation study was used to test the proposed algorithms under different network scenarios.

KW - Ants algorithms

KW - Connected dominating set

KW - Genetic algorithms

KW - Gur game

KW - Quality of Service (QoS)

KW - Self optimizing

KW - Wireless sensor networks

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

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

U2 - 10.1007/978-3-540-92157-8-23

DO - 10.1007/978-3-540-92157-8-23

M3 - Conference contribution

SN - 3540921567

SN - 9783540921561

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 262

EP - 268

BT - Self-Organizing Systems - Third International Workshop, IWSOS 2008, Proceedings

ER -