Skip to main content

Genetic Algorithm for Clustering in Wireless Adhoc Sensor Networks

  • Conference paper
GeoSensor Networks (GSN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5659))

Included in the following conference series:

  • 569 Accesses

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tasoulis, D., Vrahatis, M.: Novel approaches in unsupervised clustering. In: NEMIS 2004 Final Conference in Knowledge Mining, Patras, Greece (2004)

    Google Scholar 

  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. Megiddo, N., Supowit, K.: On the complexity of some common geometric problems. SIAM Journal on Computing 13, 182–196 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Werner, J.C., Fogarty, T.C.: Genetic algorithm applied in clustering datasets. South Bank University, London (2002)

    Google Scholar 

  5. Painho, M., Bacao, F.: Using genetic algorithms in clustering problems. GeoComputation (2000)

    Google Scholar 

  6. Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)

    Book  Google Scholar 

  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. Preparata, F.P., Shamos, M.I.: Computational Geometry An Introduction. Springer, New york (1985)

    Book  MATH  Google Scholar 

  9. Minimum Spanning Tree (1997), http://www2.toki.or.id/book/AlgDesignManual/BOOK/BOOK4/NODE161.HTM

  10. Fitness Proportionate Selection (2007), http://en.wikipedia.org/wiki/Fitness_proportionate_selection

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sachdev, R., Nygard, K.E. (2009). Genetic Algorithm for Clustering in Wireless Adhoc Sensor Networks. In: Trigoni, N., Markham, A., Nawaz, S. (eds) GeoSensor Networks. GSN 2009. Lecture Notes in Computer Science, vol 5659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02903-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02903-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02902-8

  • Online ISBN: 978-3-642-02903-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics