A trust enhanced secure clustering framework for wireless ad hoc networks
详细信息 查看全文
- 作者：Pushpita Chatterjee (1)
Uttam Ghosh (2)
Indranil Sengupta (3)
Soumya K. Ghosh (1) - 关键词：Ad hoc networks ; Cluster ; Security ; Trust ; Routing ; Leader
- 刊名：Wireless Networks
- 出版年：2014
- 出版时间：October 2014
- 年：2014
- 卷：20
- 期：7
- 页码：1669-1684
- 全文大小：912 KB
- 参考文献：1. Balakrishnnan, V., Varadharajan, V., Tupakula, U. K., & Lucs, P. (2007). Trust and recommendations in mobile ad hoc networks. in / Proceedings of 10th IEEE international conference on networking and services (pp. 64鈥?9).
2. Chatterjee, P., Sengupta, I., & Ghosh, S. (2012). Stacrp: A secure trust based auction oriented clustering routing protocol for securing mobile ad hoc networks. / Cluster Computing, 15, 303鈥?20. CrossRef
3. Wang, X., Liu, L., & Su, J. (2012). RLM: A general model for trust representation and aggregation. / IEEE Transactions on Services Computing, / 5(1), 131鈥?43.
4. Chatterjee, M., Das, S. K., & Turgut, D. (2000, November). An on-demand weighted clustering algorithm WCA for ad hoc networks. in / Proceedings of IEEE GLOBECOM 2000 (pp. 1697鈥?701).
5. Malpani, N., Welch, J., & Vaidya N. (2000, August). Leader election algorithms for mobile ad hoc networks. in / Proceedings of 4th international workshop on discrete algorithms and methods for mobile computing and communications (pp. 96鈥?03).
6. Vasudevan, S., Decleene, B., Immerman, N., Kurose, J., & Towsley, D. (2003). Leader election algorithms for wireless ad hoc networks. in / Proceedings of DARPA information survivability conference and exposition (pp. 261鈥?72).
7. Yu, Y., Wang, J., Song, M., & Song, J. (2010). Network traffic prediction and result analysis based on seasonal ARIMA and correlation coefficient. in / Proceedings of the 2010 international conference on intelligent system design and engineering application, ISDEA鈥?0 (Vol. 01, pp. 980鈥?83).
8. Stoica, P., Friedlander, B., & Soderstrom, T. (1986). Least-squares, yule-walker, and overdetermined yule-walker estimation of ar parameters: A monte carlo analys is of finite-sample properties. / International Journal of Control, 43, 13鈥?7. CrossRef
9. Akaike, H. (1974). A new look at statistical model identification. / IEEE Transactions on Automatic Control, 19, 716鈥?23. CrossRef
10. Dempster, A. P. (1968). A generalization of bayesian interface. / Journal of Royal Statistical Society, 30, 205鈥?47.
11. Shieh, S.-P., Lin, C.-T. Yang, W.-B., & Sun, H.-M. (2000). Digital multisignature schemes for authenticating delegates in mobile code systems. / IEEE Transactions on Vehicular Technology, 49(4), 1464鈥?473. CrossRef
12. Bettstetter, C., & Konig, S. (2002). On the message and time complexity of a distributed mobility-adaptive clustering algorithm in wireless ad hoc networks. in / Proceeding of the 4th European wireless (pp. 128鈥?34).
13. Sucec, J., & Marsic, I. (2001). Hierarchical routing overhead in mobile ad hoc netorks. / IEEE Transactions on Mobile Computing, 3, 45鈥?6.
14. Cho, J.-H., Swami, A., & Chen, I.-R. (2012). Modeling and analysis of trust management with trust chain optimization in mobile ad hoc networks. / Journal of Network and Computer Applications, / 35(3), 1001鈥?012.
15. Yu, J. Y., & Chong, P. H. J. (2006). An efficient clustering scheme for large and dense mobile ad hoc networks (manets). / Computer Communications, 30, 5鈥?6. CrossRef
16. Chiang, C. -C., Wu, H. -K., Liu, W., & Gerla, M. (1997, April). Routing in clustered multihop, mobile wireless networks with fading channel. in / IEEE Singapore international conference on networks, SICON鈥?7, (pp. 197鈥?11).
17. Safa, H., Artail, H., Tabet, D. (2010). A cluster-based trust-aware routing protocol for mobile ad hoc networks. / Wireless Networks, 16, 969鈥?84. CrossRef
18. Fall, K., & Varadhan, K. ns Manual. isi.edu/nsnam/ns/doc.
19. Ghosh, U., & Datta, R. (2011). A secure dynamic IP configuration scheme for mobile ad hoc networks. / Ad Hoc Networks, 9(7), 1327鈥?342. CrossRef
20. Yan, Z., & Prehofer, C. (2011). Autonomic trust management for a component-based software system. / IEEE Transactions on Dependable and Secure Computing, / 8(6), 810鈥?23.
21. Pirzada, A. A., & McDonald, C. (2004). Establishing trust in pure ad-hoc networks. In / Proceedings of the 27th Australasian Conference on Computer Science (ACSC 鈥?4) (Vol. 26, pp. 47鈥?4), Dunedin, New Zealand.
22. Ghosh, T., Pissinou, N., & Makki, K. (2004, May). Collaborative trust-based routing in multi-hop ad hoc networks. in / Proceedings of 3rd international IFIP-TC06 networking conference, Lecture Notes in Computer Science (pp. 1446鈥?451).
23. Ghosh, T., Pissinou, N., & Makki, K. (2005). Towards designing a trust routing solution in mobile ad hoc networks. / Mobile Networks and Applications, 10, 985鈥?95. CrossRef
24. Virendra, M., Jadliwala, M., Chandrasekaran, M., & Upadhyaya, S. (2005). Quantifying trust in mobile ad hoc networks. In / Proceedings of IEEE KIMAS 2005 (pp. 65鈥?1).
25. Theodorakopoulos, G., & Baras, J. S. (2006). On trust models and trust evaluation metrics for ad hoc networks. / IEEE Journal on Selected Areas in Communications, 24(2), 318鈥?28.
26. Boukerche, A., & Ren, Y. (2008). A security management scheme using a novel computational reputation model for wireless and mobile ad hoc networks. In / Proceedings of the 5th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 鈥?8) (pp. 88鈥?5). New York, NY: ACM.
27. Cho, J.-H., Swami, A., & Chen, I. R. (2012). Modeling and analysis of trust management with trust chain optimization in mobile ad hoc networks. / Journal of Network and Computer Applications, / 35(3), 1001鈥?012. - 作者单位：Pushpita Chatterjee (1)
Uttam Ghosh (2)
Indranil Sengupta (3)
Soumya K. Ghosh (1)
1. School of Information Technology, Indian Institute of Technology, Kharagpur, India
2. Department of E&ECE, Indian Institute of Technology, Kharagpur, India
3. Department of CSE, Indian Institute of Technology, Kharagpur, India - ISSN：1572-8196
文摘
Secure clustering in Wireless Ad Hoc Networks is a very important issue. Traditional cryptographic solution is useless against threats from internal compromised nodes. In light of this, we propose a novel distributed secure trust aware clustering protocol that provides secure solution for data delivery. A trust model is proposed that computes the trust of a node using self and recommendation evidences of its one-hop neighbors. Therefore, it is lightweight in terms of computational and communication requirements, yet powerful in terms of flexibility in managing trust. In addition, the proposed clustering protocol organizes the network into one-hop disjoint clusters and elects the most qualified, trustworthy node as a Clusterhead. This election is done by an authenticated voting scheme using parallel multiple signatures. Analysis of the protocol shows that it is more efficient and secure compared to similar existing schemes. Simulation results show that proposed protocol outperforms the popular ECS, CBRP and CBTRP in terms of throughput and packet delivery ratio with a reasonable communication overhead and latency in presence of malicious nodes.