Skip to main content

Advertisement

SpringerLink
Log in

Connectedness-Aware Copy-Adaptive Routing Protocol in Intermittently Connected Networks

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

In the intermittently connected networks where the complete paths from a source to a destination do not always exist, multi-copy forwarding is considered to be capable of providing more reliable transmission than single-copy forwarding. However, injecting too many copies into a network can cause unnecessary network resource consumption that degrades the network performance, especially if the network nodes are low-cost and resource-constrained. Therefore, copy control is a critical efficiency mechanism for the forwarding protocols in such situations. Using a preset threshold is a common copy-control mechanism used by many multi-copy forwarding protocols. The preset threshold is the maximum allowed number of copies of a packet in a network, calculated before running these protocols. It can effectively reduce the unnecessary copies and provide better performance than the protocols without using copy control. However, preset threshold makes the protocol less flexible with respect to the variations of network characteristics such as density or connectedness caused by node failures or new nodes joining. In this paper, we propose a multi-copy routing algorithm, Connectedness-Aware Copy-Adaptive Routing (CACAR) protocol, which adopts a novel copy-control mechanism. CACAR estimates the network connectedness locally and conducts the copy control and the next-hop selection based on the measured connectedness. This proposed protocol can achieve a higher delivery rate and lower latency without sacrificing the energy efficiency compared with other benchmark multi-copy routing protocols.

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. Y. Li and R. Bartos, A survey of protocols for intermittently connected delay-tolerant wireless sensor networks, Journal of Network and Computer Applications, Vol. 41, pp. 411–423, 2014.

    Article  Google Scholar 

  2. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, Directed diffusion for wireless sensor networking, IEEE/ACM Transactions on Networking, Vol. 11, No. 1, pp. 2–16, 2003.

    Article  Google Scholar 

  3. D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, Highly-resilient, energy-efficient multipath routing in wireless sensor networks, SIGMOBILE Mobile Computing and Communications Review, Vol. 5, No. 4, pp. 11–25, 2001.

    Article  Google Scholar 

  4. A. Bagula and K. Mazandu, Energy constrained multipath routing in wireless sensor networks. In Ubiquitous Intelligence and Computing, Series Lecture Notes in Computer Science, Vol. 5061, pp. 453–467, Springer, Berlin Heidelberg, 2008.

  5. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, Efficient routing in intermittently connected mobile networks: the multiple-copy case, IEEE/ACM Transactions on Networking, Vol. 16, pp. 77–90, 2008.

    Article  Google Scholar 

  6. T. Spyropoulos, K. Psounis, and C. Raghavendra, Efficient routing in intermittently connected mobile networks: the single-copy case, IEEE/ACM Transactions on Networking, Vol. 16, No. 1, pp. 63–76, 2008.

    Article  Google Scholar 

  7. O. Gnawali, R. Fonseca, K. Jamieson, D. Moss, and P. Levis, Collection tree protocol. In Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, ser. SenSys ’09 ACM, pp. 1–14, 2009.

  8. M. Xiao, J. Wu, C. Liu, and L. Huang, Tour: time-sensitive opportunistic utility-based routing in delay tolerant networks. In Proceedings of 2013 IEEE INFOCOM 2013, pp. 2085–2091, 2013.

  9. A. Vahdat and D. Becker, Epidemic routing for partially connected ad hoc networks, Department of Computer Science, Duke University, Tech. Rep. Technical Report CS-2000-06, 2000.

  10. A. Lindgren, A. Doria, and O. Schelén, Probabilistic routing in intermittently connected networks, SIGMOBILE Mobile Computing and Communications Review, Vol. 7, No. 3, pp. 19–20, 2003.

  11. S. Grasic, E. Davies, A. Lindgren, and A. Doria, The evolution of a DTN routing protocol - PRoPHETv2. In Proceedings of the 6th ACM Workshop on Challenged Networks, ser. CHANTS ’11 ACM, pp. 27–30, 2011.

  12. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, Spray and Focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In Proceedings of the 5th Annual IEEE International Conference on PerCom Workshops ’07, pp. 79–85, 2007.

  13. A. T. Prodhan, R. Das, H. Kabir, and G. C. Shoja, TTL based routing in opportunistic networks, Journal of Network and Computer Applications, Vol. 34, pp. 1660–1670, 2011.

    Article  Google Scholar 

  14. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, ser. WDTN’05, pp. 252–259, 2005.

  15. Z. Ning, L. Liu, F. Xia, B. Jedari, I. Lee, and W. Zhang, CAIS: a copy adjustable incentive scheme in community-based socially aware networking, IEEE Transactions on Vehicular Technology, Vol. 66, No. 4, pp. 3406–3419, 2017.

    Article  Google Scholar 

  16. M. Xiao, J. Wu, and L. Huang, Home-based zero-knowledge multi-copy routing in mobile social networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 26, No. 5, pp. 1238–1250, 2015.

    Article  Google Scholar 

  17. P. Yuan and C. Wang, OPPO: an optimal copy allocation scheme in mobile opportunistic networks, Peer-to-Peer Networking and Applications, Vol. 11, No. 1, pp. 102–109, 2018.

    Article  Google Scholar 

  18. X. Guan, M. Chen, and T. Ohtsuki, Epidemic theory based H + 1 hop forwarding for intermittently connected mobile ad hoc networks, EURASIP Journal on Wireless Communications and Networking, Vol. 2012, No. 1, pp. 1–10, 2012.

    Article  Google Scholar 

  19. M. Musolesi, S. Hailes, and C. Mascolo, Adaptive routing for intermittently connected mobile ad hoc networks. In Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks, ser. WOWMOM’05, pp. 183–189, 2005.

  20. J. M. Soares, M. Franceschinis, R. M. Rocha, W. Zhang, and M. A. Spirito, Opportunistic data collection in sparse wireless sensor networks, EURASIP Journal on Wireless Communications Networking, Vol. 2011, pp. 6:1–6:20, 2011.

    Article  Google Scholar 

  21. T. Hu and Y. Fei, An adaptive routing protocol based on connectivity prediction for underwater disruption tolerant networks. In 2013 IEEE Global Communications Conference (GLOBECOM), pp. 65–71, 2013.

  22. Y. Li and R. Bartos, Interaction based routing algorithm for opportunistic mobile social networks. In 2017 14th IEEE Annual Consumer Communications and Networking Conference (CCNC), pp. 492–497, 2017.

  23. M. Li, D. Agrawal, D. Ganesan, and A. Venkataramani, Block-switched networks: a new paradigm for wireless transport. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, pp. 423–436, 2009.

  24. Y. Li, R. Bartos, and J. Swan, Transport protocol with acknowledgement-assisted storage management for intermittently connected wireless sensor networks, Distributed Computing and Networking, ser. Lecture Notes in Computer Science, Vol. 7730, pp. 57–71. Springer, Berlin Heidelberg, 2013.

  25. Y. Li, R. Bartos, and J. Swan, Dacksis: an efficient transport protocol with acknowledgement-assisted storage management for intermittently connected wireless sensor networks, Pervasive and Mobile Computing, Vol. 13, No. 0, pp. 272–285, 2014.

    Article  Google Scholar 

  26. Y. Li and R. Bartos, Energy efficient reactive store-and-forward protocol for intermittently connected networks. In 2013 IEEE Global Communications Conference (GLOBECOM), pp. 563–568, 2013.

  27. V. Naumov and T. Gross, Connectivity-aware routing (CAR) in vehicular ad-hoc networks. In 26th IEEE International Conference on Computer Communications (INFOCOM ’07), pp. 1919–1927, 2007.

  28. Q. Yang, A. Lim, S. Li, J. Fang, and P. Agrawal, ACAR: adaptive connectivity aware routing for vehicular ad hoc networks in city scenarios, Mobile Networks and Applications, Vol. 15, No. 1, pp. 36–60, 2010.

    Article  Google Scholar 

  29. H. Guo, X. Wang, H. Cheng, and M. Huang, A location aided controlled spraying routing algorithm for Delay Tolerant Networks, Ad Hoc Networks, Vol. 66, pp. 16–25, 2017.

    Article  Google Scholar 

  30. B. Wu, H. Shen, and K. Chen, Exploiting active subareas for multicopy routing in VDTNs, IEEE Transactions on Vehicular Technology, Vol. 67, No. 5, pp. 4374–4388, 2018.

    Google Scholar 

  31. O. Gnawali, R. Fonseca, K. Jamieson, M. Kazandjieva, D. Moss, and P. Levis, CTP: an efficient, robust, and reliable collection tree protocol for wireless sensor networks, ACM Transactions on Sensor Network, Vol. 10, No. 1, pp. 16:1–16:49, 2013.

  32. P. Levis, N. Patel, D. Culler, and S. Shenker, Trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks. In Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation vol. 1, ser. NSDI’04 (USENIX Association), pp. 2–2, 2004.

  33. Contiki, Contiki Operating System, http://www.contiki-os.org, 2012.

  34. F. Österlind, A sensor network simulator for the Contiki OS, Swedish Institute of Computer Science, SICS Report, 2009.

  35. BonnMotion, http://net.cs.uni-bonn.de/wg/cs/applications/bonnmotion, 2016.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Colby College, 5852 Mayflower Hill, Waterville, ME, 04901, USA

    Ying Li

  2. Department of Computer Science, University of New Hampshire, 33 Academic Way, Durham, NH, 03824-3597, USA

    Radim Bartos

Authors
  1. Ying Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Radim Bartos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ying Li.

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

Li, Y., Bartos, R. Connectedness-Aware Copy-Adaptive Routing Protocol in Intermittently Connected Networks. Int J Wireless Inf Networks 26, 230–242 (2019). https://doi.org/10.1007/s10776-019-00433-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10776-019-00433-y

Keywords

Search

Navigation