Voting-Based Clustering Algorithm with Subjective Trust and Stability in Mobile Ad Hoc Networks

In existing clustering algorithms in mobile ad hoc networks, some of them consider only stability of cluster heads, and some others take only security into account, while only a few of them consider both factors. We propose Voting-based Clustering Algorithm with subjective trust and stability (VCA) by accessing subjective trust of node through Bayesian method and by evaluating stability of node through computing the neighbor change ratio and the residual battery power of mobile nodes. The proposed algorithm implements electing cluster heads according to the subjective trust degree and the stability of node. Compared with lowest-id, highest-degree and weight-based distributed clustering algorithm (WCA), it can improve system performance, maintain network security, and have good generality. Simulation studies show that the proposed algorithm has less communication overhead and better efficiency than existing algorithms.

[1]  Winston Khoon Guan Seah,et al.  Mobility-based d-hop clustering algorithm for mobile ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[2]  Joseph P. Macker,et al.  Mobile ad hoc networking and the IETF , 1998, MOCO.

[3]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[4]  M. Bansal,et al.  Mobile Ad hoc Networking ( MANET ) : Routing Protocol Performance Issues and Evaluation Considerations , 2010 .

[5]  Audun J sang,et al.  An Algebra for Assessing Trust in Certi cation Chains , 1998 .

[6]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[7]  David Heckerman,et al.  Causal independence for probability assessment and inference using Bayesian networks , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[8]  Jiannong Cao,et al.  Logical Location-based Routing with Hole-shadowing in Large-scale MANETs , 2006, 2006 IEEE International Conference on Communications.

[9]  Qifeng Lu Vulnerability of Wireless Routing Protocols , 2002 .

[10]  Audun Jøsang,et al.  AIS Electronic Library (AISeL) , 2017 .

[11]  Xueping Li,et al.  A Quantitative Survivability Evaluation Model for Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Networking, Sensing and Control.

[12]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[13]  Jiannong Cao,et al.  SSR: Segment-by-Segment Routing in Large-Scale Mobile Ad Hoc Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[14]  Hyunsoo Yoon,et al.  Cluster based trust evaluation in ad hoe networks , 2005, The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005..

[15]  David Heckerman,et al.  A Tutorial on Learning with Bayesian Networks , 1998, Learning in Graphical Models.

[16]  Hyunsoo Yoon,et al.  Cluster-Based Trust Evaluation Scheme in an Ad Hoc Network , 2005 .

[17]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[18]  Audun Jøsang,et al.  The right type of trust for distributed systems , 1996, NSPW '96.

[19]  B. Kadri,et al.  Secured Clustering Algorithm for Mobile Ad Hoc Networks , 2007 .

[20]  Yi-Bing Cai,et al.  A Method of Selecting Steady Path Based on Neighbor Change Ratio in Mobile Ad Hoc Networks , 2007 .

[21]  Audun Jøsang,et al.  An Algebra for Assessing Trust in Certification Chains , 1999, NDSS.

[22]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.