Skip to main content

Leader Election Based on Centrality and Connectivity Measurements in Ad Hoc Networks

  • Conference paper
Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6070))

Abstract

Decision making process for agent systems is an important issue in dynamic network environment. This study proposes a novel method for determining leader node by measuring centrality and connectivity in the networks. The proposed method shows that each node maintains a list of the agent candidate to minimize the load of agent reelection. The agent provides services for various operations of the network and controls problems of network in both wired and wireless systems. The proposed agent decision method uses the topological centrality of the network, the degree of connectivity, node energy states as election keys. Simulations and numeric analysis are shown to verify the effect of the proposed decision method.

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. Vasudevan, S., Kurose, J., Towsley, D.: Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks. In: Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004), Berlin, Germany, pp. 350–360. IEEE Computer Society, Los Alamitos (2004)

    Chapter  Google Scholar 

  2. DeCleene, B., Dondeti, L., Griffin, S., Hardjono, T., Kiwior, D., Kurose, J., Towsley, D., Vasudevan, S., Zhang, C.: Secure group communication for Wireless Networks. In: Proceedings of the IEEE Military Communications Conference (MILCOM 2001), pp. 113–117 (2001)

    Google Scholar 

  3. Perkins, C.E., Belding-Royer, E.M.: Ad-hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd Workshop on Mobile Computing Systems and Applications (WMCSA 1999), New Orleans, LA, USA, pp. 90–100. IEEE Computer Society, Los Alamitos (1999)

    Chapter  Google Scholar 

  4. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Micro sensor networks. In: Proceedings of the 33rd Hawaiian International Conference on Systems Science, Washington, DC, USA, p. 8020. IEEE Computer Society, Los Alamitos (2000)

    Google Scholar 

  5. Malpani, N., Welch, J., Vaidya, N.: Leader election Algorithms for Mobile Ad Hoc Networks. In: Proceedings of 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 93–103. ACM, New York (2000)

    Google Scholar 

  6. Bayazit, O.B., Lien, J.M., Amato, N.M.: Better group behaviors in complex environments using global roadmaps. In: Proceedings of 8th International Conference on the Simulation and Synthesis of living systems (Alife 2002), pp. 362–370. MIT Press, Cambridge (2002)

    Google Scholar 

  7. Afek, Y., Bremler, A.: Self-stabilizing unidirectional network algorithms by power supply. In: Proceedings of the 8th annual ACM-SIAM symposium on Discrete algorithms (SODA 1997), pp. 111–120. Society for Industrial and Applied Mathematics, Philadelphia (1997)

    Google Scholar 

  8. Gallager, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum Weight Spanning Trees. ACM Transactions on Programming Languages and Systems 5(1), 66–77 (1983)

    Article  MATH  Google Scholar 

  9. Peleg, D.: Time Optimal Leader Election in General Networks. Journal of Parallel and Distributed Computing 8(1), 96–99 (1990)

    Article  MathSciNet  Google Scholar 

  10. Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems 8(4), 424–440 (1997)

    Article  Google Scholar 

  11. Afek, Y., Kutten, S., Yung, M.: Local Detection for Global Self Stabilization. Theoretical Computer Science 186(1-2), 199–230 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lin, C.R., Gerla, M.: Adaptive Clustering for Mobile Wireless Networks. IEEE journal on selected areas in communications 15(7), 1265–1275 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, M., Kim, C., Jung, J.J. (2010). Leader Election Based on Centrality and Connectivity Measurements in Ad Hoc Networks. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2010. Lecture Notes in Computer Science(), vol 6070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13480-7_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13480-7_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13479-1

  • Online ISBN: 978-3-642-13480-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics