A Dynamic Energy-Aware Algorithm for Self-Optimizing Wireless Sensor Networks

  • Syed I. Nayer
  • Hesham H. Ali
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5343)


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.


Wireless sensor networks self optimizing Gur game Quality of Service (QoS) ants algorithms genetic algorithms connected dominating set 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cerpa, A., Estrin, D.: AASCENT: Adaptive Self-Configuring Sensor Networks Topologies. In: Proceedings of INFOCOM 2002 (2002)Google Scholar
  2. 2.
    Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: A scalable and robust communication paradigm for sensor networks. In: Proceedings of MobiCOM 2000 (August 2000)Google Scholar
  3. 3.
    Krishnamachari, B., Mourtada, Y., Wicker, S.: The Energy-Robustness Tradeoff for Routing in Wireless Sensor Networks. In: IEEE, Proceedings of IEEE International Conference on Communications (ICC 2003) (May 2003)Google Scholar
  4. 4.
    Li, Q., Aslam, J., Rus, D.: Online power-aware routing in wireless ad-hoc networks. In: Proceedings of MOBICOM 2001 (2001)Google Scholar
  5. 5.
    Dulman, S., Nieberg, T., Havinga, P., Hartel, P.: Multipath Routing for Data Dissemination in Energy Efficient Sensor Networks. TR-CTIT-02-20 (July 2002)Google Scholar
  6. 6.
    Deb, B., Bhatangar, S., Nath, B.: A Topology Discovery Algorithm for Sensor Networks with Applications to NW Management. In: IEEE CAS Workshop 2002 (2002)Google Scholar
  7. 7.
    Nayer, I., Ali, H.: On Employing Distributed Algorithms and Evolutionary Algorithms in Managing WSN. In: Proc. of the Intl Workshop on Theoretical and Algorithmic Aspects of Wireless Ad Hoc, Sensor, and P2P NWs, Chicago (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Syed I. Nayer
    • 1
  • Hesham H. Ali
    • 1
  1. 1.Department of Computer Science College of Information Science and TechnologyUniversity of Nebraska at OmahaOmahaUSA

Personalised recommendations