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)
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
Analysis of a reputation system for Mobile Ad-Hoc Networks with liars
Performance Evaluation
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
Lowest weight: reactive clustering algorithm for adhoc networks
PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications
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
IEEE Network: The Magazine of Global Internetworking
Exposing WPA2 security protocol vulnerabilities
International Journal of Information and Computer Security
Hi-index | 0.00 |
Clustering in ad hoc networks consists of dividing the network into clusters managed by clusterheads. This technique has been used for different goals. However, as far as we know, no existing clustering algorithms have considered the existence of malicious nodes for clusterheads election and maintenance. Consequently, we propose a REputation based Clustering Algorithm (RECA) that aims to elect trustworthy, stable and high energy clusterheads that can be used to manage the security of the network. Simulation results have shown that RECA converges to a stable and convenient network division into clusters with no untrustworthy clusterheads and mainly one hop members.