Skip to main content
SpringerLink
Log in

An Opportunistic Network Coding Routing for Opportunistic Networks

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

In opportunistic networks (OppNets), instead of assuming a complete path, messages are exchanged opportunistically when two nodes encounter. To support efficient and reliable end-to-end messaging in OppNets, a number of routing protocols based on network coding have been proposed. However, few efforts in the studies focus on opportunistic network coding (ONC). It is because the coding opportunities do not probably exist in OppNets due to nodal mobility, low density, lossy link, etc. In this paper, an ONC routing model for OppNets based on a new hybrid communication scheme was proposed. The communication scheme combines contact-based communication mode used by most routing protocols in OppNets and contact duration-based communication mode employed by few routing protocols in OppNets. We also designed an ONC routing protocol based on the ONC routing model in OppNets. Simulated results show that compared with Epidemic routing, the ONC routing can achieve higher delivery ratio and lower delay but consume fewer network cost.

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
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44, 1–4 (2006)

    Article  Google Scholar 

  2. Boldrini, C., Lee, K., Onen, M., et al.: Opportunistic networks. Comput. Commun. 48, 1–4 (2014)

    Article  Google Scholar 

  3. Mota, V.F.S., et al.: Protocols, mobility models and tools in opportunistic networks: a survey. Comput. Commun. 48, 5–19 (2014)

    Article  Google Scholar 

  4. Katti, S., Rahul, H., Hu, W.J., et al.: XORs in the air: practical wireless network coding. IEEE-ACM Trans. Netw. 16, 497–510 (2008)

    Article  Google Scholar 

  5. Sengupta, S., Rayanchu, S., Banerjee, S.: Network coding-aware routing in wireless networks. IEEE-ACM Trans. Netw. 18, 1158–1170 (2010)

    Article  Google Scholar 

  6. Khreishah, A., Khalil, I.M., Wu, J.: Distributed network coding-based opportunistic routing for multicast. MobiHoc 12, 115–124 (2012)

    Google Scholar 

  7. Amerimehr, M.H., Ashtiani, F.: Delay and throughput analysis of a two-way opportunistic network coding-based relay network. IEEE Trans. Wirel. Commun. 13, 2863–2873 (2014)

    Article  Google Scholar 

  8. Chachulski, S., et al.: Trading structure for randomness in wireless opportunistic routing. ACM SIGCOMM Comput. Commun. Rev. 37, 169–180 (2007)

    Article  Google Scholar 

  9. Iqbal, M.A., Dai, B., Huang, B., Hassan, A., Yu, S.: Survey of network coding-aware routing protocols in wireless networks. J. Netw. Comput. Appl. 34, 1956–1970 (2011)

    Article  Google Scholar 

  10. Widmer, J., Le Boudec, J.Y.: Network coding for efficient communication in extreme networks. In: SIGCOMM’05 (WDTN). ACM, New York, pp. 284–291 (2005)

  11. Yunfeng, L., Baochun, L., Ben, L. : Efficient network coded data transmissions in disruption tolerant networks. In: ICC’08, IEEE (2008)

  12. Zeng, D.Z., Guo, S., Jin, H. et al.: Dynamic segmented network coding for reliable data dissemination in delay tolerant networks. In: ICC’12, New York, pp. 63–67 (2012)

  13. Xiaolan, Z., Neglia, G., Kurose, J., et al.: Benefits of network coding for unicast application in disruption-tolerant networks. IEEE/ACM Trans. Netw. 21, 1407–1420 (2013)

    Article  Google Scholar 

  14. Ali, A., Panda, M., Chahed, T., Altman, E.: Improving the transport performance in delay tolerant networks by random linear network coding and global acknowledgments. Ad Hoc Netw. 11, 2567–2587 (2013)

    Article  Google Scholar 

  15. Hassanabadi, B., Valaee, S.: Reliable periodic safety message broadcasting in VANETs using network coding. IEEE Trans. Wirel. Commun. 13, 1284–1297 (2014)

    Article  Google Scholar 

  16. Eagle, Nathan, Pentland, Alex S.: Reality mining: sensing complex social systems. Pers. Ubiquitous Comput. 10, 255–268 (2006)

    Article  Google Scholar 

  17. Pan, H., Augustin, C., James, S. et al.: Pocket switched networks and human mobility in conference environments. In: SIGCOMM’05 (WDTN), pp. 244–251 (2005)

  18. Vahdat, A., Becker, D.: Epidemic Routing for Partially Connected Ad Hoc Networks. Technical Report, CS-200006 (2000)

  19. Mueller, K.: SimPy. https://simpy.readthedocs.org/en/latest/index.html

Download references

Acknowledgments

This paper is supported by the National Natural Science Fund of China under Grant Nos. 61170241 and 61472097, the Research Fund for the Scientific Items of Jilin Provincial Department of Education No. 2013207, and this paper is also funded by the International Exchange Program of Harbin Engineering University for Innovation-oriented Talents Cultivation.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Harbin Engineering University, Harbin, 150001, China

    Jiansheng Yao, Chunguang Ma, Peng Wu, Gang Du & Qi Yuan

  2. College of Computer Science, Jilin Normal University, Siping, 136000, China

    Jiansheng Yao

Authors
  1. Jiansheng Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunguang Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peng Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gang Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Qi Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jiansheng Yao or Chunguang Ma.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yao, J., Ma, C., Wu, P. et al. An Opportunistic Network Coding Routing for Opportunistic Networks. Int J Parallel Prog 45, 157–171 (2017). https://doi.org/10.1007/s10766-015-0392-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10766-015-0392-3

Keywords

Search

Navigation