Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3090))

Included in the following conference series:

Abstract

Unlike current clustering methods, the presented vote-based clustering (VC) algorithm uses not only node location and ID information, but also battery time information. In VC, each mobile host (MH) counts Hello messages from its neighbors. At the same time it calculates its own vote that is the weighted sum of the normalized number of valid neighbors and its normalized remaining battery time. The one with higher vote than its neighbors will be selected preferentially as a cluster head (CH). When the number of dominated MHs of a CH is more than a balance threshold, neither of new coming MHs will be permitted to participate in the current cluster. Analysis and simulation results show that VC method can improve cluster structure than Lowest ID (LID) algorithm and Highest Degree (HD) algorithm.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Perkins, C.E., Belding-Royer, E.M., Das, S.R.: Ad hoc on-demand distance vector (AODV) routing, IETF RFC 3561 (July 2003)

    Google Scholar 

  2. Kai, L., Jiandong, L.: Mobile cluster protocol in wireless ad hoc network. In: Proceeding FIP/WCC 2000 (ICCT 2000), Beijing, China, Beijing, China, August 2000, pp. 568–573 (2000)

    Google Scholar 

  3. Yi, Y., Gerla, M., Jin Kwon, T.: Efficient Flooding in Ad hoc Networks: a Comparative Performance Study, 2003082210

    Google Scholar 

  4. Yi, Y., Kwon, T.J., Gerla, M.: Passive Clustering (PC) in Ad Hoc Networks, Internet Draft, draft-ietf-yi-manet-pac-00.txt (Novomber 2001)

    Google Scholar 

  5. Qayyum, A., Viennot, L., Laouiti, A.: Multipoint relaying: An efficient technique for flooding in mobile wireless networks. (HICSS 2001)

    Google Scholar 

  6. Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol’, Internet Draft, draft-ietf-manet-olsr-11.txt (July 2003)

    Google Scholar 

  7. Tsai, J., Gerla, M.: Multicluster, mobile, multimedia radio network. ACM-Baltzer Journal of Wireless Networks 1(3), 255–265 (1995)

    Article  Google Scholar 

  8. Parekh, A.K.: Selecting routers in ad-hoc wireless networks. In: ITS (1994)

    Google Scholar 

  9. Wang, X., Li, F., Ishihara, S., Mizuno, T.: A Multicast Routing Algorithm Based on Mobile Multicast Agents in Ad-hoc Networks. IEICE Transactions on Communications E84-B(8), 2087–2094 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, F., Zhang, S., Wang, X., Xue, X., Shen, H. (2004). Vote-Based Clustering Algorithm in Mobile Ad Hoc Networks. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25978-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23034-2

  • Online ISBN: 978-3-540-25978-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics