Abstract
Leader election is an extensively studied problem in Ad hoc networks. In our study, an extended idea of leader election algorithms for energy saving on arbitrary changing topological environment is derived. Our focus is to reduce the number of leader election processes, to make it more energy efficient. The proposed algorithm shows that each node maintains a list of candidates to minimize the total number of leader elections. Simulation results show that the leader election algorithm using candidates has less leader elections process and generates less message than those of the existing leader election algorithms.
This research was supported by the Yeungnam University EmTEC and SAMSUNG research grants in 2006.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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), pp. 350–360 (2004)
Afek, Y., Bremler, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago Journal of Theoretical Computer Science (December 1998)
Bayazit, O., Lien, J., Amato, N.: Better group behaviors in complex environments using global roadmaps. In: 8th International Conference on the Simulation and Synthesis of living systems (Alife ‘02), Sydney, NSW, Australia, December 2002, pp. 362–370 (2002)
DeCleene, B., et al.: Secure group communication for Wireless Networks. In: Proceedings of MILCOM 2001 (October 2001)
Perkins, C.E., Royer, E.: Ad-hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90–100 (1999)
Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Micro sensor networks. In: Proceedings of Hawaiian International Conference on Systems Science (January 2000)
Malpani, N., Welch, J., Vaidya, N.: Leader election Algorithms for Mobile Ad Hoc Networks. In: Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston, MA (August 2000)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Gallager, R., Humblet, P., Humblet, P., Spira, P.: A Distributed Algorithm for Minimum Weight Spanning Trees. ACM Transactions on Programming Languages and Systems 4(1), 66–77 (1983)
Peleg, D.: Time Optimal Leader Election in General Networks. Journal of Parallel and Distributed Computing 8(1), 96–99 (1990)
Coore, D., Nagpal, R., Weiss, R.: Paradigms for Structure in an Amorphous Computer. Technical report 1614, Massachussetts Institute of Technology Artificial Intelligence Laboratory (October 1997)
Afek, Y., Kutten, S., Yung, M.: Local Detection for Global Self Stabilization. Theoretical Computer Science 186(1-2), 199–230 (1997)
Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election part 1: Complete graph protocols. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol. 579, pp. 167–180. Springer, Heidelberg (1992)
Lin, C., Gerla, M.: Adaptive Clustering for Mobile Wireless Networks. IEEE journal on selected areas in communications 15(7), 1265–1275 (1997)
Dijkstra, E.W., Scholten, C.S.: Termination detection for diffusing computations. Information Processing Letters 11(1), 1–4 (1980)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Lee, S., Muhammad, R.M., Kim, C. (2007). A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks. In: Lee, YH., Kim, HN., Kim, J., Park, Y., Yang, L.T., Kim, S.W. (eds) Embedded Software and Systems. ICESS 2007. Lecture Notes in Computer Science, vol 4523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72685-2_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-72685-2_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72684-5
Online ISBN: 978-3-540-72685-2
eBook Packages: Computer ScienceComputer Science (R0)