Abstract
A leader in a network has important roles to collect data and control the network. Therefore, when a node with high centrality is selected as the leader node in the network, the network can be controlled efficiently, and the amount of resource consumed in controlling can be reduced. This study proposes a central leader election method in ad hoc networks. A representative centrality measure of social network analysis (SNA), degree or closeness is used for leader selection criteria. Each node’s degree or closeness is simply calculated by the proposed method, based on the distance matrix which is generated based on adjacency matrix. The data-collection process for creating adjacency matrix applies a tree-based data transmission for the efficient use of the limited resource in ad hoc networks. Our experiments show that the complexity of the proposed centrality calculation method is less compared with that of Dijkstra’s algorithm and that of the Bellman–Ford algorithm. The proposed election method is expected to be appropriate to apply for selecting the leader node on the limited resource in ad hoc networks.
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 2004), Berlin, Germany, pp. 350–360. IEEE Computer Society, Los Alamitos (2004)
Malpani, N., Welch, J., Waidya, 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)
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)
Peleg, D.: Time Optimal Leader Election in General Networks. Journal of Parallel and Distributed Computing 8(1), 96–99 (1990)
Wu, M., Kim, C., Jung, J.J.: Leader Election Based on Centrality and Connectivity Measurements in Ad Hoc Networks. In: 4th KES International Symposium, KES-AMSTA 2010, Gdynia, Poland, June 23-25 (2010)
Janson, S., Lavault, C., Louchard, G.: Convergence of some leader election algorithms. Discrete Mathematics and Theoretical Computer Science DMTCS 10(3), 171–196 (2008)
Vasudevan, S., Kurose, J., Towsley, D.: Design of a Leader Election Protocol in Mobile Ad Hoc Distributed Systems. In: Proceedings of the 12th IEEE International Conference on Network Protocols, pp. 350–360 (2004)
Zhang, G., Kuang, X., Chen, J., Zhang, Y.: Design and Implementation of a Leader Election Algorithm in Hierarchy Mobile Ad hoc Network. In: Proceedings of 2009 4th International Conference on Computer Science & Education (2009)
Lee, S., Muhammad, R., Kim, C.: A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks. In: Lee, Y.-H., Kim, H.-N., Kim, J., Park, Y.W., Yang, L.T., Kim, S.W. (eds.) ICESS 2007. LNCS, vol. 4523, pp. 728–738. Springer, Heidelberg (2007)
Gupta, S., Srimani, P.: Core-Based Tree with Forwarding Regions(CBT-FR); A Protocol for Reliable Multicasting in Mobile Ad Hoc Networks. Journal of Parallel and Distributed Computing 61, 1249–1277 (2001)
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)
Sundararaman, B., Buy, U., Kshemkalyani, A.: Clock Synchronization for Wireless Sensor Networks: A Survey. Ad Hoc Networks 3(3), 281–323 (2005)
Blazevic, L., Boudec, J., Giordano, S.: A Location-Based Routing Method for Mobile Ad Hoc Networks. IEEE Transactions On Mobile Computing 4(2) (2005)
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)
Freeman, L.C.: Centrality in Social Networks Conceptual Clarification. Social Networks 1, 215–239 (1978/1979)
Newman, M.E.J.: A measure of betweenness centrality based on random walks. Social Networks 27(1), 39–54 (2005)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM) 46(5), 604–632 (1999)
Jung, J.J.: Query Transformation based on Semantic Centrality. Journal of Universal Computer Science 14(7), 1031–1047 (2008)
Wu, M., Kim, S.H., Kim, C.G.: A routing method based on cost matrix in ad hoc networks. In: Nguyen, N.T., Katarzyniak, R., Chen, S.-M. (eds.) Advances in Intelligent Information and Database Systems. SCI, vol. 283, pp. 337–347. Springer, Heidelberg (2010)
Wu, M., Kim, C.: A cost matrix agent for shortest path routing in ad hoc networks. Journal of Network and Computer Applications (2010), http://dx.doi.org/10.1016/j.jnca.2010.03.013
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wu, M., Cheon, S., Kim, C. (2011). A Central Leader Election Method Using the Distance Matrix in Ad Hoc Networks. In: Nguyen, N.T., Trawiński, B., Jung, J.J. (eds) New Challenges for Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19953-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-19953-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19952-3
Online ISBN: 978-3-642-19953-0
eBook Packages: EngineeringEngineering (R0)