Skip to main content


Log in

Optimizing the communication distance of an ad hoc wireless sensor networks by genetic algorithms

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript


In this paper we provide our preliminary idea of using Genetic Algorithms (GAs) to solve the ad hoc Wireless Sensor Networks (WSNs) distance optimization problem. Our objective is to minimize the communication distance over a distributed sensor network. The proposed sensor network will be autonomously divided into set of k-clusters (k is unknown) to reduce the energy consumption for the overall network. On doing this, we use GAs to specify; the location of cluster-heads, the number of clusters and the cluster-mumbers which, if chosen, will minimize the communication distance over the distributed sensor network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others


  • Bandyopadhyay S, Coyle EJ (2003) An energy efficient hierarchical clustering algorithm for wireless sensor networks. In: Proceedings of the IEEE conference on computer communications (INFOCOM)

  • Benini E, Toffolo A (2002) Optimal design of horizontal-axis wind turbines using blade-element theory and evolutionary computation. J Solar Energy Eng 124(4):357–363

    Article  Google Scholar 

  • Carlos MS, Figueiredo NEF, Loureiro AAF (2006) Self-organization algorithms for wireless networks. Taylor & Francis Group, LLC

  • Chandrakasan A, Heinzelman WR, Balakrishnan H (2000) Energy efficient communication protocol for wireless micro-sensor networks. In: Proceedings of the Hawaii international conference on system science, Maui, Hawaii, pp 3005–3014

  • Chandrakasan AP, Heinzelman WR (2002) An application-specific protocol architecture for wireless micro-sensor network. IEEE Trans Wireless Commun 1(4): 660–670

    Article  Google Scholar 

  • Das S, Chatterjee M, Turgut D (2002) Wca: a weighted clustering algorithm for mobile ad hoc networks. J Cluster Comput (Special Issue on Mobile Ad hoc Networks) 5: 193–204

    Google Scholar 

  • Gao S, Yuan P, Ji C, Zhang Y, Li Z (2004) Particle swarm optimization for mobile ad hoc networks clustering. Networking, Sensing and Control, IEEE Int Conf 1:372–375

    Article  Google Scholar 

  • Halgamuge SK, Gurn SM, Fernando S (2005) Paticle swarm optimisers for cluster formation in wirless sensor networks. Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), Melbourne

  • Heylighen F, Gershenson C (2003) The meaning of self-organization in computing. IEEE Intelligent Systems, Trends and Controversies

  • Hussain S, Matin AW (2006) Base station assisted hierarchical clusterbased routing. In: Proceedings of the international conference on wireless and mobile communications (ICWMC). IEEE Computer Society

  • Jin S, Zhou M, Wu AS (2003) Sensor network optimization using a genetic algorithm. In: Proceedings of the 7th world multiconference on systemics, cybernetics, and informatics. URL

  • Laurent LVAWC, Helal D, Zory J (2007) Wireless sensor networks devices: Overview, issues, state of the art and promising technologies. ST J Res, 4, No.1

  • Matin AW, Hussain S (2006) Intelligent hierarchical cluster-based routing. In: Proceedings of the international workshop on mobility and scalability in wireless sensor networks (MSWSN) in IEEE International Conference on Distributed Computing in Sensor Networks (DCOSS), pp 165–172

  • Obaidy M, Ayesh A, Sheta A (2008) Optimizing the communication distance of an ad hoc mobile sensor networks by genetic algorithms. In: Proceedings of the forth international workshop on advanced computation for engineering applications (ACEA08), pp 17–23

  • Ostrosky R, Rabani Y (2002) Polynomial-time approximation schemes for geometric min.sum median clustering. J ACM 49(2): 139–156

    Article  MathSciNet  Google Scholar 

  • Pardalos P, Wolkowicz H (1994) Quadratic assignments and related problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16

  • Procopiuc CM, Agarwal PK (1998) Exact and approximation algorithms for clustering. In: Proceedings of the ninth annual ACM-SIAM symposium on discrete algorithms

  • Rahul Khanna HL, Chen H-H (2006) Self-organization of sensor networks using genetic algorithms. In: Proceedings of IEEE ICC

  • Sahin F, Tillett J, Rao R, Rao TM (2002) Cluster-head identification in ad hoc sensor networks using particle swarm optimization. In: IEEE international conference on personal wireless communication, pp 201–205

  • Sankarasubramaniam Y, Akyildiz I, Su W, Cayirci E (2002) A survey on sensor networks. In: IEEE commun Magazine, pp 102–114

  • Sheta A, Turabieh H (2006) A comparision between genetic algorithms and sequential quadratic programming in solving constrained optimization problems. ICGST Int J Artif Intell Mach Learn (AIML) 6(1): 67–74

    Google Scholar 

  • Sridhar G, Sridhar V (2004) Energy management in ad hoc mobile wireless networks. In: First working conference on wireless on-demand network systems

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Mohaned Al-Obaidy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Al-Obaidy, M., Ayesh, A. & Sheta, A.F. Optimizing the communication distance of an ad hoc wireless sensor networks by genetic algorithms. Artif Intell Rev 29, 183 (2008).

Download citation

  • Published:

  • DOI: