On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Load-Balancing Clusters in Wireless Ad Hoc Networks
ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
An efficient management algorithm for clustering in mobile ad hoc network
Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks
Ad Hoc Networking
A mobility aware technique for clustering on mobile ad-hoc networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Stable and energy efficient clustering of wireless ad-hoc networks with LIDAR algorithm
PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications
Lowest weight: reactive clustering algorithm for adhoc networks
PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications
Adaptive weighted clustering for large scale mobile ad hoc networking systems
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Zone-Based clustering for intrusion detection architecture in ad-hoc networks
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
A dominating set based clustering algorithm for mobile ad hoc networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Hierarchical clustering algorithm based on mobility in mobile ad hoc networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
A novel architecture of intrusion detection system
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Constructing a MANET Based on Clusters
Wireless Personal Communications: An International Journal
| Hi-index | 0.24 |
Clustering in ad hoc networks is an organization method which consists in grouping the nodes into clusters (groups) managed by nodes called clusterheads. This technique has been used for different goals as routing efficiency, transmission management, information collection, etc. As far as we know, no existing clustering algorithms have taken into account the trust level of nodes for clusterheads election. In this paper, we propose a clustering algorithm for security in ad hoc networks that we called CASAN. CASAN aims to elect trustworthy, stable and high-energy clusterheads that can be used to offer security for application level. Simulations were conducted to evaluate CASAN in terms of clusters stability, load balancing and number of hops to clusterheads. Furthermore, we compare CASAN performances to an existing clustering algorithm called weighted clustering algorithm. Results show that it gives a convenient network division with stable clusters and mainly one hop members.