Skip to main content

Advertisement

Springer Nature Link
Log in

A Diversity-based Selfish Node Detection Algorithm for Socially Aware Networking

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

Because mobile devices only have the limited resource in socially aware networking, some network nodes are unwilling to sacrifice their resource to forward messages to others for free, thus forming selfish nodes. However selfish nodes will cause dropping in the message delivery rate and affect the network performance, so this paper has proposed a diversity-based selfish node detection algorithm (DSNDA). Firstly, it mainly applies the node forwarding willingness mechanism to detect whether the node is selfish. If the node has the inadequate resource, that is, it cannot forward any messages for others; then it will be selfish. If the node’s resource is enough and the node has forwarded messages to other nodes, it indicates that the node is not selfish. Otherwise, DSNDA algorithm will use reputation mechanism to check the node further. If the node has broken faith, it indicates that the node is selfish. On the contrary the message confirmation mechanism will be employed to make the final check on the node. If a message does not be received or discarded after the node’s receiving it, which proves that it has selfish behaviour. If not, the node is normal. It can be proved by the simulation experiment and results that the DSNDA algorithm has significantly improved the delivery rate of messages, comparing with other algorithms. At the same time, reducing the network delay, thus verifying the feasibility of DSNDA.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14

Similar content being viewed by others

References

  1. Dai, W., Qiu, M., Qiu, L., Chen, L., Wu, A. (2017). Who moved my data? privacy protection in smartphones. IEEE Communications Magazine, 55 (1), 20–25.

    Article  Google Scholar 

  2. Xia, F., Liu, L., Li, J., Ma, J., Vasilakos, A.V. (2017). Socially-aware networking: a survey. IEEE Systems Journal, 9 (3), 904–921.

    Article  Google Scholar 

  3. Feng, X., Li, L., Jie, L., Ahmed, A.M., Ma, J. (2015). Beeinfo: Interest-based forwarding using artificial bee colony for socially aware networking. IEEE Transactions on Vehicular Technology, 64 (3), 1188–1200.

    Article  Google Scholar 

  4. Xia, F., Liu, L., Jedari, B., Das, S.K. (2016). Pis: a multi-dimensional routing protocol for socially-aware networking. IEEE Transactions on Mobile Computing, 15 (11), 2825–2836.

    Article  Google Scholar 

  5. Ning, Z., Li, L., Feng, X., Jedari, B., Lee, I., Zhang, W. (2017). Cais: a copy adjustable incentive scheme in community-based socially aware networking. IEEE Transactions on Vehicular Technology, 66 (4), 3406–3419.

    Article  Google Scholar 

  6. Xiong, Z., Wu, Y., Ye, C., Zhang, X., Xu, F. (2019). Color image chaos encryption algorithm combining crc and nine palace map. Multimedia Tools and Applications, 78, 31035–31055.

    Article  Google Scholar 

  7. Xu, F., Xu, Q., Xiong, Z., Xiao, N., Xie, Y., Deng, M., Hao, H. (2019). Intelligent distributed routing scheme based on social similarity for mobile social networks. Future Generation Computer Systems, 96, 472–480.

    Article  Google Scholar 

  8. Xu, F., Xiao, N., Deng, M., Xie, Y., Xu, Q. (2019). Efficient opportunistic routing with social context awareness for distributed mobile social networks. Concurrency and Computation: Practice and Experience (5).

  9. Yueruer, O., Sheng, Z., Moreno, W., Leung, V.C.M. (2016). Context-awareness for mobile sensing: A survey and future directions. Communications Surveys & Tutorials, 18 (1), 68–93.

    Article  Google Scholar 

  10. Qiu, M., Zhong, M., Wang, J., Yang, L.T., Yang, X. (2014). Enabling cloud computing in emergency management systems. IEEE Cloud Computing, 1 (4), 60–67.

    Article  Google Scholar 

  11. Penner, T., Sciarrone, A., Guirguis, M., Bisio, I., Lavagetto, F. (2017). Context-awareness over transient cloud in d2d networks: energy performance analysis and evaluation. European Transactions on Telecommunications, 28 (2), 63–74.

    Google Scholar 

  12. Guo, Y., Zhuge, Q., Hu, J., Yi, J. (2013). Data placement and duplication for embedded multicore systems with scratch pad memory. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32 (6), 809–817.

    Article  Google Scholar 

  13. Gai, K., Qiu, M., Zhao, H., Sun, X. (2017). Resource management in sustainable cyber-physical systems using heterogeneous cloud computing. IEEE Transactions on Sustainable Computing, 3 (2), 60–72.

    Article  Google Scholar 

  14. Dai, W., Qiu, L., Wu, A., Qiu, M. (2016). Cloud infrastructure resource allocation for big data applications. IEEE Transactions on Big Data, 4 (3), 313–324.

    Article  Google Scholar 

  15. Mei, K.Q., Zhang, K., Huang, M. (2004). An empirical study of web interface design on small display devices. IEEE/WIC/ACM International Conference on Web Intellgence (WI’04), pp. 29–35.

  16. Li, Y., Su, G., & Wang, Z. (2012). Evaluating the effects of node cooperation on dtn routing. AEU - International Journal of Electronics and Communications, 66 (1), 62–67.

    Article  Google Scholar 

  17. Li, Q., Zhu, S., & Cao, G. (2010). Routing in socially selfish delay tolerant networks. In Infocom: IEEE.

  18. Panagakis, A., Vaios, A., Stavrakakis, I. (2007). On the effects of cooperation in dtns. In International conference on communication systems software & middleware.

  19. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Handbook of Systemic Autoimmune Diseases.

  20. Spyropoulos, T., Psounis, K., Raghavendra, C.S. (2005). Spray and Wait: An efficient routing scheme for intermittently connected mobile networks. In ACM SIGCOMM Workshop on delay-tolerant networking.

  21. Li, Q., Zhu, S., Cao, G. (2010). Routing in socially selfish delay tolerant networks. In Infocom: IEEE.

  22. Li, Y., Su, G., Wang, Z. (2012). Evaluating the effects of node cooperation on dtn routing. AEU - International Journal of Electronics and Communications, 66 (1), 62–67.

    Article  Google Scholar 

  23. Xuebin, M.A., Zheng, T.Y., Mingzhu, L.I. (2019). Analysis and regulation of effects of selfishness on opportunistic network. Acta Electronica Sinica, 47 (4), 837–847.

    Google Scholar 

  24. Junling, L.V., Song, H., Zhili, H. E., Pan, D. (2017). Survey of research on node’s selfish behavior in opportunistic networks. Computer Engineering and Applications, 53 (18), 7–16 + 50.

    Google Scholar 

  25. Jedari, B., Xia, F., Chen, H., Das, S.K., Tolba, A., Al-Makhadmeh, Z. (2017). A social-based watchdog system to detect selfish nodes in opportunistic mobile networks. Future Generation Computer Systems, 777–888.

  26. Liu, K., Jing, D., Varshney, P.K., Balakrishnan, K. (2007). An acknowledgment-based approach for the detection of routing misbehavior in manets. IEEE Transactions on Mobile Computing, 6 (5), 536–550.

    Article  Google Scholar 

  27. Bigwood, G., & Henderson, T. (2011). Ironman: Using social networks to add incentives and reputation to opportunistic networks. In Proceeding of IEEE third international conference on social computing (socialcom), Boston, MA USA (pp. 65–72).

  28. Buchegger, S., & Boudec, Jyl. (2002). Performance analysis of the confidant protocol. Cheminform, 38 (4), 1014–1021.

    Google Scholar 

  29. Michiardi, P., & Molva, R. (2002). Core: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In Advanced communications and multimedia security, IFIP TC6/TC11 sixth joint working conference on communications and multimedia security, September 26-27, 2002, Portoroz, Slovenia (pp. 107–121).

  30. Liu, Q., & Hou, P. (2015). Incentives node detects policy in the opportunistic network. Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition), 27 (2), 266–272.

    Google Scholar 

  31. Marti, S., Giuli, T.J., Lai, K., Baker, M. (2000). Mitigating routing misbehavior in mobile ad hoc networks. ACM, 255–265.

  32. Zhang, Y., Jianbo, L.I., Ying, L.I. (2019). Opportunistic network data offloading algorithm based on selfishness and centrality. Computer Engineering, 045 (006), 152–159.

    Google Scholar 

  33. Keränen, A., Ott, J., Kärkkäinen, T. (2009). The one simulator for dtn protocol evaluation. In International conference on simulation tools & techniques (pp. 1–10).

  34. Lindgren, A., Doria, A., Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7 (3), 19–20.

    Article  Google Scholar 

Download references

Acknowledgements

This paper was supported by the National Natural Science Foundation of China (No. 61972136), MOE (Ministry of Education in China) Project of Humanities and Social Sciences (No.20YJAZH112), the Natural Science Foundation of Hubei Province (No.2020CFB497), Hubei Provincial Department of Education Outstanding Youth Scientific Innovation Team Support Foundation (T201410,T2020 017), Hubei Province Higher Education Teaching Research Project (No.2018432).

Author information

Authors and Affiliations

  1. School of Computer and Information Science, Hubei Engineering University, Xiaogan, Hubei, 432000, China

    Nan Xiao, Zenggang Xiong, Fang Xu, Xuemin Zhang, Qiong Xu, Xiaochao Zhao & Conghuan Ye

  2. School of Computer Science and Information Engineering, Hubei University, Wuhan, Hubei, 430062, China

    Nan Xiao, Zenggang Xiong & Qiong Xu

  3. School of Information Engineering, Nanchang University, Nanchang, Jiangxi, 330031, China

    Rang Xinyi

Authors
  1. Nan Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rang Xinyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zenggang Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fang Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xuemin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Qiong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Xiaochao Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Conghuan Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zenggang Xiong.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiao, N., Xinyi, R., Xiong, Z. et al. A Diversity-based Selfish Node Detection Algorithm for Socially Aware Networking. J Sign Process Syst 93, 811–825 (2021). https://doi.org/10.1007/s11265-021-01666-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-021-01666-y

Keywords