Skip to main content
SpringerLink
Log in

An Improved Routing Algorithm Based on Social Link Awareness in Delay Tolerant Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The routing efficiency in delay tolerant networks is degraded due to intermittent connection and high latency. Additionally, socially selfish nodes in social networks refuse to provide message forwarding service since there are limited resources. To solve these problems, an improved routing algorithm based on the social link awareness is proposed. In this algorithm, multiple social features of the nodes’ behaviors are utilized to quantify the nodes pairs’ social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and increases the successful delivery ratio, thereby improving the routing efficiency.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of ACM SIGCOMM’03 (pp. 27–34).

  2. Fan, X., Shan, Z., Zhang, B., & Chen, H. (2008). State of the art of the architecture and techniques for delay tolerant networks. Acta Electronica Sinica, 36(1), 161–170.

    Google Scholar 

  3. Zhang, L., & Zhou, X. (2010). Routing protocols for delay and disruption tolerant networks. Journal of Software, 21(10), 2554–2572.

    Google Scholar 

  4. Zhiwen, Y., & Zhiyong, Y. (2012). Socially aware computing. Chinese Journal of Computers, 35(1), 16–26.

    Article  Google Scholar 

  5. Krohn, M., Freedman, M., & Mazieres, D. (2004). On-the-fly verification of rateless erasure codes for efficient content distribution. Symposium on Security and Privacy (pp. 226–239).

  6. Pentland, A. (2005). Socially aware computation and communication. IEEE Computer, 38(3), 63–70.

    Google Scholar 

  7. Li, F., & Wu, J. (2009). LocalCom: A community-based epidemic forwarding scheme in disruption-tolerant networks. Sensor, mesh and ad hoc communications and networks, 2009. SECON ’09. 6th Annual IEEE Communications Society Conference on, Rome (pp. 22–26). doi:10.1109/SAHCN.2009.5168942.

  8. Wang, J., Zhu, J., & Liu, Y. (2009). Copy-limited and sociality-based routing algorithm for delay-tolerant networks. Journal of South China University of Technology (Natural Science Edition), 37(5), 84–89.

    Google Scholar 

  9. Li, Y., Yuan, C., Su, L., Depeng J., & Zeng, L. (2011). Integrating forwarding and replication in DTN routing: A social network perspective. Vehicular Technology Conference (VTC Spring) (pp. 1–5). doi:10.1109/VETECS.2011.5956737.

  10. Zhang, Y., Zhao, J. (2009). Social network analysis on data diffusion in delay tolerant networks. In MobiHoc ’09: Proc. tenth ACM international symposium on Mobile ad hoc networking and, computing, 2009.

  11. Wang, Y., Yang, W., & Wu, J. (2012). Analysis of a hypercube-based social feature multi-path routing in delay tolerant networks. Parallel and Distributed Systems, IEEE Transactions on (pp. 1–11). doi:10.1109/TPDS.2012.235.

  12. Abdelkader, T., Naik, K., Nayak, A., Goel, N., & Srivastava, V. (2012). SGBR: A routing protocol for delay tolerant networks using social grouping. Parallel and Distributed Systems, IEEE Transactions on, 1–11. doi:10.1109/TPDS.2012.281.

  13. Daly, E. M., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant MANETs. In Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and, computing (pp. 32–40).

  14. Li, Z., & Shen, H. (2011). SEDUM: Exploiting social networks in utility-based distributed routing for DTNs. Computers, IEEE Transactions on, 99, 1. doi:10.1109/TC.2011.232.

    MathSciNet  Google Scholar 

  15. Li, Q., Zhu, S., & Cao, G. (2010). Routing in socially selfish delay tolerant networks. INFOCOM, 2010 Proceedings IEEE (pp. 1–9). doi:10.1109/INFCOM.2010.5462138.

  16. Hui, P., & Crowcroft, J. (2007). How small labels create big improvements. International Workshop on Intermittently Connected Mobile Ad hoc Networks in conjunction with IEEE PerCom, 2007 (pp. 19–23). doi:10.1109/PERCOMW.2007.55.

  17. Hui, P., Crowcroft, J., & Yonek, E. (2011). BUBBLE Rap: Social-based forwarding in delay-tolerant networks. Mobile Computing, IEEE Transactions on, 10(11), 1576–1589. doi:10.1109/TMC.2010.246.

    Article  Google Scholar 

  18. Mei, A., Morabito, G., Santi, P., & Stefa. J. (2011). Social-aware stateless forwarding in pocket switched networks. INFOCOM, Proc. 30th IEEE Conference on Computer Communications(INFOCOM) mini-conference. doi:10.1109/INFCOM.2011.5935076.

  19. Gao, W., & Cao, G. (2011). User-centric data dissemination in disruption tolerant networks. In Proc. 30th IEEE Conference on. Computer Communications (INFOCOM). doi:10.1109/INFCOM.2011.5935157.

  20. Fabbri, F., & Verdone, R. (2011). A sociability-based routing scheme for delay-tolerant networks. EURASIP Journal on Wireless Communications and Networking.

  21. Bulut, E., & Szymanski, B. (2012). Exploiting friendship relations for efficient routing in mobile social networks. Parallel and Distributed Systems, IEEE Transactions on, 99, 1–14. doi:10.1109/TPDS.2012.83.

    Google Scholar 

  22. Spyropoulos, T., Psounis, K., Cauligi, S., et al. (2008). Efficient routng in intermittently connected mobile networks: The multiple-copy case. IEEE Transactions on Networking, 16(1), 77–90.

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by National 973 Program of China (2011CB302903); National Natural Science Foundation of China (61170276,61100199,61201160,61100213); Specialized Research Fund for the Doctoral Program of Higher Education (SRFDP) (20113223120007); Program of Natural Science for Universities of Jiangsu Province (10KJA510035, 12KJD510007); Open research fund of Key Lab of Broadband Wireless Comm. and Sensor Netw. Technology (NUPT), Ministry of Education (NYKL201102, 05, 07).

Author information

Authors and Affiliations

  1. Key Lab of Broadband Wireless Communication and Sensor Network Technology (Nanjing University of Posts and Telecommunications), Ministry of Education, Nanjing, 210003, China

    Kun Wang & Huang Guo

Authors
  1. Kun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huang Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kun Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, K., Guo, H. An Improved Routing Algorithm Based on Social Link Awareness in Delay Tolerant Networks. Wireless Pers Commun 75, 397–414 (2014). https://doi.org/10.1007/s11277-013-1369-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1369-4

Keywords

Search

Navigation