Efficient Forwarding Strategy for Opportunistic Network Based on Node Similarity

Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 768)

Abstract

In opportunistic network, it is a key problem to choose proper neighbors for forwarding messages. To avoid the low deliver ratio of transmission caused by node movement, dynamic change of network topology and other factors, a data forwarding algorithm—Efficient Forwarding Strategy for Opportunistic Network Based on Node Similarity(EFSNS) was proposed from the perspective of combining social network with opportunistic network. In the study, it is adopted the edit distance of data packets between nodes to calculate the social similarity, and then selects the appropriate neighbors according to the similarity to obtain one or more reliable communication paths. The experimental results show that the proposed algorithm outperforms typical routing algorithms in terms of the deliver ratio, delivery delay and routing overhead.

Keywords

Opportunistic network Social network Edit distance Similarity Routing algorithm 

Notes

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Grant No. 71633006, Grant No. 61672540, Grant No. 61379057). This work is supported by the China Postdoctoral Science Foundation funded project (Grant No. 2017M612586). This work is supported by the Postdoctoral Science Foundation of Central South University (Grant No. 185684).

References

  1. 1.
    Boldrini, C., Lee, K., Önen, M., et al.: Opportunistic networks. Comput. Commun. 48(14), 1–4 (2014)CrossRefGoogle Scholar
  2. 2.
    Dong, L.: Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks. Wireless Netw. 18(8), 949–965 (2012)CrossRefGoogle Scholar
  3. 3.
    Jang, K., Lee, J., Kim, S.K., et al.: An adaptive routing algorithm considering position and social similarities in an opportunistic network. Wireless Netw. 22(5), 1537–1551 (2016)CrossRefGoogle Scholar
  4. 4.
    Kerdsri, J., Wipusitwarakun, K.: Research article dynamic rendezvous based routing algorithm on sparse opportunistic network environment. Int. J. Distrib. Sens. Netw. 2015, 12 (2015)Google Scholar
  5. 5.
    Chen, W., Chennikara-Varghese, J., Pang, M., et al.: Method to establish and organize an ad-hoc wireless peer to peer network: WO, US 7720026 B2[P] (2010)Google Scholar
  6. 6.
    Tamhane, S.A., Kumar, M., Passarella, A., et al.: Service composition in opportunistic networks. In: IEEE International Conference on Green Computing and Communications, pp. 285–292. IEEE (2012)Google Scholar
  7. 7.
    Tseng, Y.C., Wu, F.J., Lai, W.T.: Opportunistic data collection for disconnected wireless sensor networks by mobile mules. Ad Hoc Netw. 11(3), 1150–1164 (2013)CrossRefGoogle Scholar
  8. 8.
    Chakchouk, N.: A survey on opportunistic routing in wireless communication networks. IEEE Commun. Surv. Tutorials 17(4), 1 (2015)CrossRefGoogle Scholar
  9. 9.
    Zhu, L., Li, C., Li, B., et al.: Geographic routing in multilevel scenarios of vehicular ad hoc networks. IEEE Trans. Veh. Technol., 1 (2015)Google Scholar
  10. 10.
    Wang, X., Lin, Y., Zhang, S., et al.: A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters. Enterprise Inf. Syst. 3(2), 1–30 (2015)CrossRefGoogle Scholar
  11. 11.
    Wu, J., Chen, Z.: Sensor communication area and node extend routing algorithm in opportunistic networks. Peer-to-Peer Network. Appl., 1–11 (2016)Google Scholar
  12. 12.
    Ying, Z., Zhang, C., Li, F., et al.: Geo-social: routing with location and social metrics in mobile opportunistic networks. In: IEEE International Conference on Communications, pp. 3405–3410. IEEE (2015)Google Scholar
  13. 13.
    Hui, P., Crowcroft, J., Yoneki, E.: BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10(11), 1576–1589 (2010)CrossRefGoogle Scholar
  14. 14.
    Yuan, P., Ma, H., Fu, H.: Hotspot-Entropy Based Data Forwarding in Opportunistic Social Networks. Elsevier Science Publishers B.V., Amsterdam (2015)Google Scholar
  15. 15.
    Risley, G.H.R., Elmore, A.C., Burken, J.G., et al.: Development of a waterjet system for direct delivery of granular iron and activated carbon to remediate contaminated aqueous sediments. Remediat. J. 21(3), 103–119 (2011)CrossRefGoogle Scholar
  16. 16.
    Rusli, M.E., Harris, R., Punchihewa, A.: Performance analysis of implicit acknowledgement coordination scheme for opportunistic routing in wireless sensor networks. In: International Symposium on Telecommunication Technologies, pp. 131–136. IEEE (2013)Google Scholar
  17. 17.
    Li, Y., Hui, P., Jin, D., et al.: Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks. IEEE Commun. Lett. 14(11), 1026–1028 (2010)CrossRefGoogle Scholar
  18. 18.
    Huang, W., Zhang, S., Zhou, W.: Spray and wait routing based on position prediction in opportunistic networks. In: International Conference on Computer Research and Development, pp. 232–236. IEEE (2011)Google Scholar
  19. 19.
    Gibran, K.: The PRoPHET: A New Annotated Edition. OneWorld Publications, London (2012)Google Scholar
  20. 20.
    Sok, P., Tan, S.C., Kim, K.: PRoPHET routing protocol based on neighbor node distance using a community mobility model in delay tolerant networks (2013)Google Scholar
  21. 21.
    Gao, Z., Shi, Y., Chen, S., et al.: Exploiting social relationship for opportunistic routing in mobile social networks. IEICE Trans. Commun. E98.B(10), 2040–2048 (2015)CrossRefGoogle Scholar
  22. 22.
    Ker, N.A., Ott, J., et al.: The ONE simulator for DTN protocol evaluation. In: International Conference on Simulation TOOLS and Techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), p. 55 (2009)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  1. 1.School of SoftwareCentral South UniversityChangshaChina

Personalised recommendations