Advertisement

Genetic Algorithm for Clustering in Wireless Adhoc Sensor Networks

  • Rajeev Sachdev
  • Kendall E. Nygard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5659)

Abstract

Sensor networks pose a number of challenging conceptual and optimization problems. A fundamental problem in sensor networks is the clustering of the nodes into groups served by a high powered relay head, then forming a backbone among the relay heads for data transfer to the base station. We address this problem with a genetic algorithm (GA) as a search technique.

Keywords

Genetic Algorithm Sensor Network Sensor Node Wireless Sensor Network Minimum Span Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tasoulis, D., Vrahatis, M.: Novel approaches in unsupervised clustering. In: NEMIS 2004 Final Conference in Knowledge Mining, Patras, Greece (2004)Google Scholar
  2. 2.
    Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. In: 9th Sysposium on Discrete Algorithms, San Francisco, California, pp. 658–667 (1998)Google Scholar
  3. 3.
    Megiddo, N., Supowit, K.: On the complexity of some common geometric problems. SIAM Journal on Computing 13, 182–196 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Werner, J.C., Fogarty, T.C.: Genetic algorithm applied in clustering datasets. South Bank University, London (2002)Google Scholar
  5. 5.
    Painho, M., Bacao, F.: Using genetic algorithms in clustering problems. GeoComputation (2000)Google Scholar
  6. 6.
    Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)CrossRefGoogle Scholar
  7. 7.
    Vieira, M.A., Vieira, L.F., Ruiz, L.B., Loureiro, A.A., Fernandes, A.O., Nogueir, N.: Scheduling nodes in wireless sensor networks: A Voronoi approach. In: 28th Annual IEEE International Conference on Local Computer Networks (LCN 2003) (2003)Google Scholar
  8. 8.
    Preparata, F.P., Shamos, M.I.: Computational Geometry An Introduction. Springer, New york (1985)CrossRefzbMATHGoogle Scholar
  9. 9.
  10. 10.
    Fitness Proportionate Selection (2007), http://en.wikipedia.org/wiki/Fitness_proportionate_selection

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Rajeev Sachdev
    • 1
  • Kendall E. Nygard
    • 1
  1. 1.North Dakota State UniversityFargoUSA

Personalised recommendations