Abstract
Delay-tolerant network (DTN) is a kind of wireless network that is specified by its discontinuous connectivity among the nodes. Due to the increasing use of wireless communications and infrastructure-less networks, DTNs should be considered accurate. epidemic routing, as a replication-based routing protocol is defined to overcome the intermittent connectivity issue in these networks. In this routing, all nodes maintain their buffer messages index which is called the summary vectors. The nodes exchange their summary vectors when they meet their neighbors. All carried messages by a node that are not presented in its neighbors are transmitted. So, a node sends multiple copies of a message to other nodes that do not have that message. The replication process consumes a high amount of network resources such as node energy. To address the resource problem, this paper intends to propose an effective mechanism for message delivering into those networks. This work formulated an energy-efficient probabilistic forwarding method of heterogeneous sets of nodes having two different transmission radii as well as two different amounts of available energies. We propose a static policy-based message forwarding method of two different forwarding probabilities for the heterogeneous sets of nodes. Our analytical result is supported by the simulation outcomes in terms of message delivery probabilities and the number of transmissions of the network. The results of this work can be considered in new applications such as delay-tolerant Internet of things.
Similar content being viewed by others
References
Zhao J, Cao G (2008) VADD: vehicle-assisted data delivery in vehicular ad hoc networks. IEEE Trans Veh Technol 57(3):1910–1922
Farnoud F, Valace S (2009) Reliable broadcast of safety messages in vehicular ad hoc networks. In: Proceedings of IEEE INFOCOM, pp 226–234
Burgess J, Gallagher B, Jensen D, Levine BN (2006) MaxProp: routing for vehicle-based disruption-tolerant networks. In: Proceedings of IEEE INFOCOM, pp 1–11
Yang X, Liu J, Zhao F, Vaidya N (2004) A vehicle-to-vehicle communication protocol for cooperative collision warning. In: Proceedings of MOBIQUITOUS, pp 114–123
Fall K (2003) A delay-tolerant network architecture for challenged internet. In: Proceedings of ACM SIGCOM, pp 27–34
Burleigh S, Hooke A, Torgerson L, Fall K, Cerf V, Durst B, Scott K, Weiss H (2003) Delay-tolerant networking: an approach to interplanetary internet. IEEE Commun Mag 41(6):128–136
Gao W, Li Q, Zhao B, Cao G (2009) Multicasting in delay-tolerant networks: a social network perspective. In: Proceedings of ACM MobiHoc, pp 299–308
Blumenthal M, Clark D (2001) Rethinking the design of the internet: the end-to-end arguments vs. the brave new world. ACM Trans Internet Technol 1(1):70–109
Jain S, Fall K, Patra R (2004) Routing in a delay-tolerant network. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp 145–158
Zhang Z (2006) Routing in intermittently connected mobile ad hoc networks and delay-tolerant networks: overview and challenges. Commun Surv Tuts 8(1):24–37
Fall K, Farrell S (2008) DTN: an architectural retrospective. IEEE J Sel Areas Commun 26(5):828–836
Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Duke Univ, Durham, NC. Tech Rep CS-200006
Groenevelt R, Nain P, Koole G (2005) The message delay in mobile ad hoc networks. Perform Eval 62(1–4):210–228
Haas Z, Halpern J, Li L (2006) Gossip-based ad hoc routing. IEEE/ACM Trans Netw 14(3):479–491
Spyropoulos T, Psounis K, Raghavendra C (2008) Efficient routing in intermittently connected mobile networks: the multiple-copy cases. IEEE/ACM Trans Netw 16(1):77–90
Hui P, Crowcroft J, Yoneki E (2008) Bubble rap: social-based forwarding in delay-tolerant networks. In: Proceedings of ACM MobiHoc, pp 241–250
Balasubramanian A, Levin B, Venkataramani A (2007) DTN routing as a resource allocation problem. In: Proceedings of ACM SIGCOMM, pp 373–384
Acer U, Kalyanaraman S, Abouzeid A (2007) Weak state routing for large-scale dynamic networks. In: Proceedings of ACM MobiCom, pp 290–301
Krifa A, Spyropoulos T (2008) Optimal buffer management policies for delay-tolerant networks. In: Proceedings of IEEE SECON, pp 260–268
Krifa A, Barakat C, Spyropoulos T (2008) An optimal joint scheduling and drop policy for delay-tolerant networks. In: Proceedings of WoWMoM, pp 1–6
Hay D, Giaccone P (2009) Optimal routing and scheduling for deterministic delay-tolerant networks. In: Proceedings of IEEE WONS, pp 25–32
Liu C, Wu J (2009) An optimal probabilistic forwarding protocol in delay-tolerant networks. In: Proceedings of ACM MobiHoc, pp 105–114
Zhang X, Neglia G, Kurose J, Towsley D (2007) Performance modeling of epidemic routing. Comput Netw 51(10):2867–2891
Spyropoulos T, Turletti T, Obraczka K (2009) Routing in delay-tolerant networks comprising heterogeneous node populations. IEEE Trans MobiCom 8(8):1132–1147
Small T, Haas Z (2005) Resource and performance tradeoffs in delay tolerant wireless networks. In: Proceedings of WDTN, pp 260–267
Neglia G, Zhang X (2006) Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study. In: Proceedings of CHANTS, pp 237–244
Banerjee N, Corner MD, Towsley D, Levine BN (2008) Relays, base stations, and meshes: enhancing mobile networks with infrastructure. In: Proceedings of MobiCom, pp 81–91
Ip YK, Lau WC, Yue OC (2008) Performance modeling of epidemic routing with heterogeneous node types. In: Proceedings of IEEE ICC, pp 219–224
Benamar N, Singh KD, Benamar M, El Ouadghiri D, Bonnin JM (2014) Routing protocols in vehicular delay tolerant networks: a comprehensive survey. Comput Commun 48:141–158
Bai L, Ma X, Ouyang Z, Zhan X (2014) Heterogeneous probabilistic model based spray routing protocol for delay tolerant networks. In: 6th International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, pp 340–345
Thakur R, Bansal KL, Kappalli M (2016) An energy efficient hybrid routing strategy for delay tolerant networks. In: 4th International Conference on Parallel, Distributed and Grid Computing (PDGC), pp 720–725
Bista BB, Rawat DB (2016) Energy consumption and performance of delay tolerant network routing protocols under different mobility models. In: 7th International Conference on Intelligent Systems, Modelling and Simulation (ISMS), pp 325–330
Cabacas RA, Nakamura H, Ra IH (2014) Energy consumption analysis of delay tolerant network routing protocols. Int J Softw Eng Appl 8(2):1–10
De Rango F, Amelio S, Fazio P (2015) Epidemic strategies in delay tolerant networks from an energetic point of view: main issues and performance evaluation. J Netw 10(01):4–14
Bista BB (2016) Improving energy consumption of epidemic routing in delay tolerant networks. In: 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), pp 278–283
Wu Y, Deng S, Huang H (2015) Performance analysis of hop-limited epidemic routing in DTN with limited forwarding times. Int J Commun Syst 28(15):2035–2050
Wu J, Zhu Y, Liu L, Yu B, Pan J (2016) Energy-efficient routing in multi-community DTN with social selfishness considerations. In: Global Communications Conference (GLOBECOM), pp 1–7
Li Y, Jiang Y, Jin D, Su L, Zeng L, Wu D (2010) Energy-efficient optimal opportunistic forwarding for delay-tolerant networks. IEEE Trans Veh Technol 59(9):4500–4512
Chaithanya Manam VK, Mahendran V, Siva Ram Murthy C (2012) Performance modeling of routing in delay-tolerant networks with node heterogeneity. In: IEEE COMSNETS, pp 1–10
Keränen A, Ott J, Kärkkäinen T (2009) The ONE simulator for DTN protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, ICST
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
Coefficients of (18) are calculated as follows:
Coefficients of (26) are:
To solve (36), if:
The four roots \(y_{1},y_{2},y_{3},y_{4}\) for the general quartic equation \(e+dy+cy^{2}+by^{3}+ay^{4}=0\) are given in the following formula:
where p and q are:
and
with
Rights and permissions
About this article
Cite this article
Karimi, S., Darmani, Y. p-Epidemic forwarding method for heterogeneous delay-tolerant networks. J Supercomput 75, 7244–7264 (2019). https://doi.org/10.1007/s11227-019-02886-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-019-02886-7