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.
This research was supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2003CB314802 and the National 863 Development Plan of China under Grant No. 2006AA01Z401.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Varadharajan, V., Shankaran, R., Hitchens, M.: Security for Cluster Based Ad hoc Networks. Computer Communications 27(5), 488–501 (2004)
Ephrem ides, A., Wieselth ier, J.E., Baker, D.J.: A design concept for reliable mobile radio networks with frequency hopping signaling[A]. Proceedings of IEEE[C] 75(1), 56–73 (1987)
Gerla, M., sai, T., Multicluster, J.T.C.: mobile, multimedia radio network [J ]. Wireless Networks 1, 255–265 (1995)
Parekh, A.K.: Selecting Routers in Ad-Hoc Wireless Networks. In: Proceeding of the SBT/IEEE International Tele. Symposium (1994)
Basagni, S.: Distributed clustering for ad hoc networks[C]. In: Proceedings of International Symposium on Parallel Architectures[C], Algorithms and Networks, pp. 310–315 (1999)
Chatterjee, M., Das, S.K., Turgut, D.: WCA: a weighted clustering algorithm for mobile Ad Hoc networks [J ]. Journal of Cluster computing, Special issue on Mobile Ad hoc Networking, 193–204 (2002)
Chatterjee, M., Das, S.K., Turgut, D.: An on-demand weighted clustering algorithm (WCA ) for ad hoc networks[A]. In: Proceedings of IEEE GLOBECOM 2000 [C], San Francisco, pp. 1697–1701. IEEE Computer Society Press, Los Alamitos (2000)
Krishna, P., Vaidya, N.H., Chatterjee, M., et al.: A cluster based approach for routing in Ad Hoc networks[J ]. ACM SIGCOMM Computer Communication Review (CCR) (1997)
Amis, A.D., Prakash, R., Vuong, T.H., Huynh, D.T.: Max-M in D-Cluster formation in wireless Ad Hoc networks [C]. In: Proceedings IEEE INFOCOM 2000, Israel (2000)
Basu, P., Khan, N., Little, T.D.C.: Amobility based metric for clustering in mobile Ad Hoc networks [C]. In: Proceedings of IEEE ICDCS 2001 Workshop on Wireless Networks and Mobile computing, Phoenix, A Z, pp. 413–418. IEEE Computer Society Press, Los Alamitos (2001)
Zhang, Q., Li, D., Gong, Z., et al.: EDDTSTM: A Time-Nonlinear-Sensitive Trust Model Based on Human Mental Peculiarity in Virtual Computing Environments. Guangzhou, China. In: Proceeding of CIS. vol. 1, pp. 62–67 (2006)
Kuang, X.-H.: Research of Group Key Management in Mobile Ad hoc Networks. PhD thesis, National University of Defense Technology, Changsha, Hunan, P.R. China (2003)
Hu, G.-M.: Research on Key Security Issues in Clustered Mobile Ad hoc Networks. PhD thesis, National University of Defense Technology, Changsha, Hunan, P.R. China (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Q., Hu, G., Gong, Z. (2007). Maximum-Objective-Trust Clustering Solution and Analysis in Mobile Ad Hoc Networks. In: Perrott, R., Chapman, B.M., Subhlok, J., de Mello, R.F., Yang, L.T. (eds) High Performance Computing and Communications. HPCC 2007. Lecture Notes in Computer Science, vol 4782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75444-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-75444-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75443-5
Online ISBN: 978-3-540-75444-2
eBook Packages: Computer ScienceComputer Science (R0)