Please use this identifier to cite or link to this item:
Title: SWCA : a secure weighted clustering algorithm in wireless ad hoc networks
Authors: Zeng, Y
Cao, J 
Guo, S
Yang, K
Li, X
Issue Date: 2009
Source: IEEE Wireless Communications and Networking Conference, WCNC, 2009, 4917979 How to cite?
Abstract: Clustering has been widely used in wireless ad hoc networks for various purposes such as routing, broadcasting and Qos. Many clustering algorithms have been proposed. However, most of them implicitly assume that nodes behave honestly in the clustering process. In practice, there might be some malicious nodes trying to manipulate the clustering process to make them serve as clusterheads, which can obtain some special power, e.g., eavesdropping more messages. In this paper we present a Secure Weighted Clustering Algorithm (SWCA). SWCA uses the Weighted Clustering Algorithm (WCA) for clustering and TELSA for efficiently authenticating packets. We propose a novel neighbor verification scheme to check whether the values of election-related features (e.g., node degree) are forged by malicious nodes. Also, we theoretically analyze the probability for a malicious node to tamper node degree without being detected and derive a lower bound on the probability. Finally, simulation results show that SWCA is secure but still has comparable performance with WCA. To the best of our knowledge, SWCA is the first algorithm considering the security of 1-hop type clustering (in this type only the clusterhead can communicate with ordinary members directly) in ad hoc networks.
Description: 2009 IEEE Wireless Communications and Networking Conference, WCNC 2009, Budapest, 5-8 April 2009
ISBN: 9781424429486
ISSN: 1525-3511
DOI: 10.1109/WCNC.2009.4917979
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jan 24, 2019

Page view(s)

Last Week
Last month
Citations as of Jan 14, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.