Abstract
Delay-Tolerant Network (DTN) is a resource-bound networking system which consists of many intermittently connected, movable devices known as nodes. Energy can be considered as an important resource for DTN scenarios since these nodes have limited energy. In order to perfect network enforcement, it is necessary to exploit the energy of the nodes efficiently. In DTN, most of the node energy is consumed because of mobility, scanning neighbors to deliver message and message transmission. Node energy has a significant role for successful transmission of messages. Higher energy of a node means that it has a high possibility to route its message with success across the network. So, for effective message routing it is mandatory to select an energy efficient routing mechanism in DTN environment. This point makes us interested to study the consumption of node energy in DTN scenarios. Within this research, the study of energy issue is focused for DTN routing approaches: Epidemic, Resource Allocation Protocol for Intentional DTN (RAPID), MaxProp, Probabilistic Routing Protocol using History of Encounters and Transitivity (PRoPHET), Spray and Wait, and Spray and Focus with their comparative performance analysis on behalf of four performance criteria: average remaining energy of node, delivery ratio, average latency, and transmission cost. Simulations are performed in Opportunistic Network Environment (ONE) simulator by varying node density while keeping message Time-To-Live (TTL) fixed and further, message TTL is changed while node density is kept fixed. We have found that Spray and Wait is the most energy efficient DTN routing scheme, whereas Spray and Focus yields the best performance in terms of delivery ratio, average latency and transmission cost.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Cao, Y., Sun, Z.: Routing in delay/disruption tolerant networks: a taxonomy, survey and challenges. IEEE Commun. Surv. Tutor. 15, 654–677 (2013)
Moreira, W., Mendes, P., Sargento, S.: Opportunistic routing based on daily routine. In: IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, San Francisco, USA, pp. 1–6 (2012)
Zhang, Y., Gao, W., Cao, G., Porta, T.L., Krishnamachari, B., Iyengar, A.: Social-aware data diffusion in delay tolerant MANETs. In: Thai, M., Pardalos, P. (eds.) Handbook of Optimization in Complex Networks. Springer Optimization and Its Applications, vol. 58. Springer, New York (2012). https://doi.org/10.1007/978-1-4614-0857-4_15
Xia, F., Jedari, B., Das, S.K.: PIS: a multi-dimensional routing protocol for socially-aware networking. IEEE Trans. Mob. Comput. 15, 2825–2836 (2016)
Socievole, A., Marano, S.: Evaluating the impact of energy consumption on routing performance in delay tolerant networks. In: Wireless Communications and Mobile Computing Conference, Cyprus, pp. 481–486 (2012)
Alaoui, E.A.A., Agoujil, S., Hajar, M., Qaraai, Y.: The performance of DTN routing protocols: a comparative study. WSEAS Trans. Commun. 14, 121–138 (2015)
Ababou, M., Bellafkih, M., El Kouch, R.: Energy efficient routing protocol for delay tolerant network based on fuzzy logic and ant colony. Int. J. Intell. Syst. Appl. 10(1), 69–77 (2018)
Cabacas, R.A., Nakamura, H., Ra, I.: Energy consumption analysis of delay tolerant network routing protocols. Int. J. Softw. Eng. Appl. 8(2), 1–10 (2014)
Bista, B.B., Rawat, D.B.: Energy consumption and performance of delay tolerant network routing protocols under different mobility models. In: International Conference on Intelligent Systems, Modelling and Simulation, Bangkok, Thailand, pp. 326–330 (2016)
Khan, M.K.M., Rahim, M.S.: Performance analysis of social-aware routing protocols in delay tolerant networks. In: International Conference on Computer Communication, Chemical, Material and Electronic Engineering, Rajshahi, Bangladesh, pp. 1–4 (2018)
Spaho, E.: Energy consumption analysis of different routing protocols in a delay tolerant network. J. Ambient Intell. Humaniz. Comput. (2019). https://doi.org/10.1007/s12652-019-01604-8
Balasubramanian, A., Levine, B.N., Venkataramani, A.: DTN routing as a resource allocation problem. In: SIGCOMM, Kyoto, Japan, pp. 373–384. ACM (2007)
Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: routing for vehicle-based disruption-tolerant networks. In: International Conference on Computer Communications, Barcelona, Spain, pp. 1–11 (2006)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: WDTN, Philadelphia, PA, pp. 252–259. ACM (2005)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: Fifth Annual IEEE International Conference on Pervasive Computing and Communications, White Plains, NY, pp. 79–85 (2007)
Opportunistic Network Environment (ONE) simulator project page. https://www.netlab.tkk.fi/tutkimus/dtn/theone. Accessed 10 Nov 2019. 11:53:38 AM, Bangladesh Standard Time
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Khan, M.K.M., Roy, S.C., Rahim, M.S., Islam, A.Z.M.T. (2020). On the Energy Efficiency and Performance of Delay-Tolerant Routing Protocols. In: Bhuiyan, T., Rahman, M.M., Ali, M.A. (eds) Cyber Security and Computer Science. ICONCS 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 325. Springer, Cham. https://doi.org/10.1007/978-3-030-52856-0_44
Download citation
DOI: https://doi.org/10.1007/978-3-030-52856-0_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-52855-3
Online ISBN: 978-3-030-52856-0
eBook Packages: Computer ScienceComputer Science (R0)