Maximum-objective-trust clustering solution and analysis in mobile ad hoc networks

Authors:
Qiang Zhang;Guangming Hu;Zhenghu Gong
Affiliations:
School of Computer, National University of Defense Technology, Hunan, China;School of Computer, National University of Defense Technology, Hunan, China;School of Computer, National University of Defense Technology, Hunan, China
Venue:
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Year:
2007

Citing 6
Cited 0

A cluster-based approach for routing in dynamic networks

ACM SIGCOMM Computer Communication Review
Multicluster, mobile, multimedia radio network

Wireless Networks
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
Distributed Clustering for Ad Hoc Networks

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks

ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Security for cluster based ad hoc networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layer-structure and the choosing of clusterheads is the key problem of all. Traditional ways of clustering lack of instructions of trust mechanisms. This paper presents a maximum-objective-trust-based clustering solution (MOTBCS), which aims at the opinion of maximum stable links and energy viewpoint and gives nodes their objective trust estimation. This solution can be better suitable for the realistic working environments for MANETs. We make necessary simulations for our design and results show that MOTBCS can generate more stable clustering groups. It also has less communication costs and better efficiency than other clustering algorithms.