A Fair and Secure Cluster Formation Process for Ad Hoc Networks
- 401 Downloads
An efficient approach for organizing large ad hoc networks is to divide the nodes into multiple clusters and designate, for each cluster, a clusterhead which is responsible for holding intercluster control information. The role of a clusterhead entails rights and duties. On the one hand, it has a dominant position in front of the others because it manages the connectivity and has access to other node’s sensitive information. But on the other hand, the clusterhead role also has some associated costs. Hence, in order to prevent malicious nodes from taking control of the group in a fraudulent way and avoid selfish attacks from suitable nodes, the clusterhead needs to be elected in a secure way. In this paper we present a novel solution that guarantees the clusterhead is elected in a cheat-proof manner.
KeywordsClustering Fairness Leader election Mobile ad hoc networks Security
This work is partially supported by the Spanish Ministry grants TSI-020100-2009-374 SAT2, TSI2007-65406-C03-03 E-AEGIS and CONSOLIDER CSD2007-00004 ARES.
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
- 2.Huang, Y., & Lee, W. (2003). A cooperative intrusion detection system for ad hoc networks. In: ACM Security of ad hoc sensor net. (SANS) (pp. 135–147).Google Scholar
- 3.Wang X., Guo X., Yin X. (2006) Nrce: A new random cluster election algorithm. Journal of Communication and Computer 3: 40–44Google Scholar
- 4.Sirivianos, M., Westhoff, D., Armknecht, F., & Girao, J. (2007). Non-manipulable aggregator node election protocols for wireless sensor networks. In: Modeling and optimization in mobile ad hoc wireless net. (pp 1–10). WiOptGoogle Scholar
- 5.Vasudevan, S., DeCleene, B., Immerman, N., Kurose, J., & Towsley, D. (2003). Secure leader election algorithms for wireless ad hoc networks. In: IEEE DARPA Information Survivability Conf. and Exposition (DISCEX), (pp. 261–272).Google Scholar
- 6.Sun, K., Peng, P., Ning, P., & Wang, C. (2006). Secure distributed cluster formation in wireless sensor networks. In: Annual computer security app. (ACSAC) (pp. 131–140). Washington, DC, USA: IEEE Computer Society.Google Scholar
- 8.Lee, P., Kim, J., Han, I., Ryou, H., & Ahn, W. H. (2007). Secure cluster header election techniques in sensor network. In: ISPA Workshops, LNCS (Vol. 4743, pp. 20–31). Springer.Google Scholar