

Author: Rifà-Pous Helena
Publisher: Springer Publishing Company
ISSN: 0929-6212
Source: Wireless Personal Communications, Vol.56, Iss.3, 2011-02, pp. : 625-636
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
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.
Related content


Cluster-Based Autoconfiguration for Mobile Ad hoc Networks
By Li Longjiang
Wireless Personal Communications, Vol. 49, Iss. 4, 2009-06 ,pp. :


Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks
By Hu Yih-Chun
Wireless Networks, Vol. 11, Iss. 1-2, 2005-01 ,pp. :


Power proximity based key management for secure multicast in ad hoc networks
By Lazos Loukas
Wireless Networks, Vol. 13, Iss. 1, 2007-02 ,pp. :

