logo

SCIENCE CHINA Information Sciences, Volume 59, Issue 12: 122310(2016) https://doi.org/10.1007/s11432-015-5467-7

A secure routing scheme based on social network analysis in wireless mesh networks

More info
  • ReceivedAug 14, 2015
  • AcceptedSep 30, 2015
  • PublishedApr 22, 2016

Abstract

As an extension of wireless ad hoc and sensor networks, wireless mesh networks (WMNs) are employed as an emerging key solution for wireless broadband connectivity improvement. Due to the lack of physical security guarantees, WMNs are susceptible to various kinds of attack. In this paper, we focus on node social selfish attack, which decreases network performance significantly. Since this type of attack is not obvious to detect, we propose a security routing scheme based on social network and reputation evaluation to solve this attack issue. First, we present a dynamic reputation model to evaluate a node's routing behavior, from which we can identify selfish attacks and selfish nodes. Furthermore, a social characteristic evaluation model is studied to evaluate the social relationship among nodes. Groups are built based on the similarity of node social status and we can get a secure routing based on these social groups of nodes. In addition, in our scheme, nodes are encouraged to enter into multiple groups and friend nodes are recommended to join into groups to reduce the possibility of isolated nodes. Simulation results demonstrate that our scheme is able to reflect node security status, and routings are chosen and adjusted according to security status timely and accurately so that the safety and reliability of routing are improved.


Acknowledgment

Acknowledgments

This work was supported in part by National Natural Science Foundation of China (Grant Nos. 61302071, 61471109, 61502075), Fundamental Research Funds for the Central Universities (Grant Nos. N150404015, DUT15QY06, DUT15RC(3)009), China Postdoctoral Science Foundation Funded Project (Grant No. 2015M580224), Liaoning Province Doctor Startup Fund (Grant No. 201501166), and State Key Laboratory for Novel Software Technology, Nanjing University (Grant No. KFKT2015B12).


References

[1] Zhang Z S, Huangfu W, Long K P, et al. On the designing principles and optimization approaches of bio-inspired self-organized network: a survey. Sci China Inf Sci, 2013, 56: 071301 Google Scholar

[2] Huangfu W, Zhang Z S, Chai X M, et al. Survivability-oriented optimal node density for randomly deployed wireless sensor networks. Sci China Inf Sci, 2014, 57: 029301 Google Scholar

[3] Jo M, Han L, Kim D, et al. Selfish attacks and detection in cognitive radio ad-hoc networks. IEEE Netw, 2013, 27: 46-50 CrossRef Google Scholar

[4] Beres E, Adve R. Selection coorperation in multi-source cooperative networks. IEEE Trans Mobile Comput, 2008, 7: 118-127 Google Scholar

[5] Zhang Z, Long K P, Wang J, et al. On swarm intelligence inspired self-organized networking: its bionic mechanisms, designing principles and optimization approaches. IEEE Commun Surv Tut, 2014, 16: 513-537 CrossRef Google Scholar

[6] Zhang Z, Long K P, Wang J. Self-organization paradigms and optimization approaches for cognitive radio technologies: a survey. IEEE Wirel Commun, 2013, 20: 36-42 Google Scholar

[7] Mei A. Social-aware stateless forwarding in pocket switched networks. In: Proceedings of IEEE International Conference on Computer Communications (INFOCOM), Shanghai, 2011. 251--255. Google Scholar

[8] Szott S. Selfish insider attacks in IEEE 802. 11s wireless mesh networks. IEEE Commun Mag, 2014, 52: 227-233 Google Scholar

[9] Zhu H, Du S, Gao Z, et al. A probabilistic misbehavior detection scheme toward efficient trust establishment in delay-tolerant networks. IEEE Trans Parall Distr, 2014, 25: 22-32 CrossRef Google Scholar

[10] Chen I, Bao F, Chang M, et al. Dynamic trust management for delay tolerant networks and its application to secure routing. IEEE Trans Parall Distr, 2014, 25: 1200-1210 CrossRef Google Scholar

[11] Paris S, Nita-Rotaru C, Martignon F, et al. Cross-layer metrics for reliable routing in wireless mesh networks. IEEE/ACM Trans Netw, 2013, 21: 1003-1016 CrossRef Google Scholar

[12] Mahmoud M, Shen X. FESCIM: fair, efficient, and secure cooperation incentive mechanism for multihop cellular networks. IEEE Trans Mobile Comput, 2012, 11: 753-766 CrossRef Google Scholar

[13] Guo J, Zhou X, Yuan J, et al. Secure access control guarding against Internal attacks in distributed networks. Wirel Pers Commun, 2013, 68: 1595-1609 CrossRef Google Scholar

[14] Masdari M, Bazarchi S, Bidaki M. Analysis of secure LEACH-based clustering protocols in wireless sensor networks. J Netw Comput Appl, 2013, 36: 1243-1260 CrossRef Google Scholar

[15] Qazi S, Raad R, Mu Y, et al. Securing DSR against wormhole attacks in multirate ad hoc networks. J Netw Comput Appl, 2013, 36: 582-592 CrossRef Google Scholar

[16] Yu Y, Guo L, Wang X, et al. Routing security scheme based on reputation evaluation in hierarchical ad hoc networks. Comput Netw, 2010, 54: 1460-1469 CrossRef Google Scholar

[17] Li Q, Zhu S, Cao G. Routing in socially selfish delay tolerant networks. In: Proceedings of IEEE International Conference on Computer Communications (INFOCOM), San Diego, 2010. 15--19. Google Scholar

[18] Yong L, Hui P, Jin D. Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks. IEEE Commun Lett, 2010, 14: 1026-1028 CrossRef Google Scholar

[19] Ganeriwal S, Srivastava M. Reputation-based framework for high integrity sensor networks. In: Proceedings of ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), Hamburg, 2011. 66--77. Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1