A Mobility Aware Technique for Clustering on Mobile Ad-Hoc Networks | SpringerLink
Skip to main content

A Mobility Aware Technique for Clustering on Mobile Ad-Hoc Networks

  • Conference paper
Distributed Computing and Networking (ICDCN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4308))

Included in the following conference series:

Abstract

Clustering for mobile ad-hoc networks (MANETs) has attracted the interest of many researchers as it offers enhanced scalability and performance improvement. The main challenge of the clustering algorithms is the formation of stable clusters despite the topological changes due to the host mobility. In this paper, we present a novel clustering algorithm, which first predicts the future host mobility and then uses this information to build a stable clustering structure over hosts that will probably exhibit low mobility in the future. In this way, long lifetime for the clustering structure is guaranteed, thereby eliminating the need for frequent reclustering. For predicting the future host mobility, we use provably good information theoretic techniques, which allow on-line learning of a reliable probabilistic model for future mobility.

This work is co-funded by 75% from E.U. and 25% from the Greek Government under the framework of the Education and Initial Vocational Training II, programme “Archimedes”.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Gerla, M., Tsai, J.: Multicluster, Mobile, Multimedia Radio Network. ACM Baltzer Journal of Wireless Network 1(3), 255–265 (1995)

    Article  Google Scholar 

  2. McDonald, A., Znatti, T.: A Mobility-Based Framework for Adaptive Clustering in Wireless Ad Hoc Networks. IEEE Journal on Selected Areas in Communications 17, 1466–1487 (1999)

    Article  Google Scholar 

  3. Basu, P., Khan, N., Little, T.: A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks. In: Proc. of the 21st International Conference on Distributed Computing Systems Workshops (ICDCSW 2001), pp. 413–418 (2001)

    Google Scholar 

  4. Er, I., Seah, W.: Mobility-based d-Hop Clustering Algorithm for Mobile Ad Hoc Networks. In: Proc. of IEEE Wireless Communications and Networking Conference (WCNC 2004), vol. 4, pp. 2359–2364 (2004)

    Google Scholar 

  5. Basagni, S.: Distributed Clustering for Ad-Hoc Networks. In: Proc. of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 1999), pp. 310–315 (June 1999)

    Google Scholar 

  6. Basagni, S.: Distributed and Mobility-Adaptive Clustering for Multimedia Support in Multi-hop Wireless Networks. In: Proc. of IEEE International Vehicular Technology Conference, pp. 889–893 (September 1999)

    Google Scholar 

  7. Chatterjee, M., Das, S., Turgut, D.: WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks. Cluster Computing 5, 193–204 (2002)

    Article  Google Scholar 

  8. Sivavakeesar, S., Pavlou, G., Liotta, A.: Stable Clustering Through Mobility Prediction for Large-Scale Multihop Ad Hoc Networks. In: Proc. of the IEEE Wireless Communications and Networking Conference, WCNC 2004 (March 2004)

    Google Scholar 

  9. Johnson, D., Maltz, D.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Imelinsky, T., Korth, H. (eds.) Mobile Computing, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996)

    Chapter  Google Scholar 

  10. Bhattacharya, A., Das, S.K.: LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks. Wireless Networks 8, 121–135 (2002)

    Article  MATH  Google Scholar 

  11. Bell, T.C., Cleary, J.G., Witten, I.H.: Text Compression. Prentice Hall, Englewood Cliffs (1990)

    Google Scholar 

  12. Ziv, J., Lempel, A.: Compression of Individual Sequences via Variable-rate Coding. IEEE Transactions on Information Theory 24(5), 530–536 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gerla, M., Kwon, T.J., Pei, G.: On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering. In: Proc. of IEEE Wireless Communications and Networking Conference, WCNC 2000 (September 2000)

    Google Scholar 

  14. Marathe, V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple Heuristics for Unit Disk Graphs. Networks 25(2), 59–68 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Konstantopoulos, C., Gavalas, D., Pantziou, G. (2006). A Mobility Aware Technique for Clustering on Mobile Ad-Hoc Networks. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_45

Download citation

  • DOI: https://doi.org/10.1007/11947950_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68139-7

  • Online ISBN: 978-3-540-68140-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics