International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 11, No. 5, 8 May 2019
Cover page and Table of Contents: PDF (size: 479KB)
Multicopy Energy Aware Distance and Inter-Contact Delay Routing (EDICDR) Approach for Delay Tolerant Networks
Full Text (PDF, 479KB), PP.36-42
Views: 0 Downloads: 0
Author(s)
Savita
1,*
D. K. Lobiyal
1
Index Terms
Delay tolerant networks (DTNs), Energy control, Opportunistic networks, Overhead, Routing
Abstract
In this paper, we propose to optimize energy and overheads of a network by reducing the copies of messages in the network. The key idea behind the proposed scheme is to select the distance of encountered node from the destination to decide the relay nodes. This limits the number of relay nodes and thus reduces the communication energy and message overheads by producing lesser number of copies of the messages in the network. Further to maintain delivery of messages, the proposed protocol evaluates delivery probability of relay nodes. The measures of probability are inter-contact delay and variance in delay between the nodes. This probability is used to decide how many copies of a message is transferred to the encountered node. This further reduces the communication energy as well as message overheads. The simulation results show that our proposed strategy reduces message overheads and energy consumption as compared to the previous existing strategy while maintaining comparable delivery probability.
Cite This Paper
Savita, D. K. Lobiyal,"Multicopy Energy Aware Distance and Inter-Contact Delay Routing (EDICDR) Approach for Delay Tolerant Networks", International Journal of Computer Network and Information Security(IJCNIS), Vol.11, No.5, pp.36-42, 2019. DOI:10.5815/ijcnis.2019.05.05
Reference
[1]M. J. Khabbaz, C. M. Assi, and W. F. Fawaz, “Disruption-tolerant networking: A comprehensive survey on recent developments and persisting challenges,” IEEE Commun. Surv. Tutorials, vol. 14, no. 2, pp. 607–640, 2012.
[2]S. Jain, K. Fall, and R. Patra, “Routing in a delay tolerant network,” ACM SIGCOMM Comput. Commun. Rev., vol. 34, no. 4, p. 145, 2004.
[3]A. E. Al Fagih and H. S. Hassanein, “Routing Schemes for Delay - Tolerant Networks - An Applications Perspective Technical Report 2012-588,” no. December 2010, 2012
[4]P.R. Makawana, & R.H. Jhaveri, “Encounter record trust-based scheme against flooding attack in delay tolerant networks”, Vol. 9, no. 4, pp 399–409, 2017.
[5]“Time Evolving DTN.” [Online]. Available: http://www.engr.uconn.edu/~tehrani/teaching/CE_Seminar/Farahmand.pdf.
[6]Y. S. Uddin, N. G. Ave, D. M. Nicol, and R. H. Kravets, “A Post-Disaster Mobility Model for Delay Tolerant Networking,” pp. 2785–2796, 2009.
[7]Z. and D. S. Zhang, “Routing in Intermittently Connected Mobile Adhoc Networks and Delay Tolerant Networks: Overview and Challenges,” pp. 24–37, 2006.
[8]P. Puri, “A Survey Paper on Routing in Delay-tolerant Networks,” pp. 215–220, 2013.
[9]H.?;Weihua Z. Samuel, “‘Unauthorized Messages in DTN Based Mobile Ad Hoc Networks’,,” in IEEE Procedding of Global Telecommunications Conference, GLOBECOM, 2009.
[10]Li Z, Shen H (2013) SEDUM: Exploiting social networks in utility-based distributed routing for DTNs. IEEE Transactions on Computers 62(1): pp.83-97..
[11]J. Shen, S. Moh, and I. Chung, “Routing Protocols in Delay Tolerant Networks?: A Comparative Survey,” pp. 1577–1580, 2008.
[12]W. Zhao, M. Ammar, E. Zegura, and C. Computing, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Categories and Subject Descriptors,” pp. 187–198.
[13]S. Merugu, M. H. Ammar, and E. W. Zegura, “Routing in Space and Time in Networks with Predictable Mobility,” Time, no. iii, pp. 1–13, 2004.
[14]A. Vahdat and D. Becker, “Epidemic Routing for Partially-Connected Ad Hoc Networks.”
[15]T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and Wait?: An Efficient Routing Scheme for,” Direct, pp. 252–259, 2005.
[16]A. Lindgren, A. Doria, and O. Schelén, “Probabilistic routing in intermittently connected networks,” ACM SIGMOBILE Mob. Comput. Commun. Rev., vol. 7, no. 3, p. 19, 2003.
[17]C. Becker and G. Schiele, “New mechanisms for routing in ad hoc networks through world models,” pp. 1–4.
[18]M. Y. S. Uddin, H. Ahmadi, T. Abdelzaher, and R. Kravets, “Intercontact routing for energy constrained disaster response networks,” IEEE Trans. Mob. Comput., vol. 12, no. 10, pp. 1986–1998, 2013.
[19]V. Conan, J. Leguay, T. Friedman, “Fixed Point Opportunistic Routing in Delay Tolerant Networks,” IEEE J. Selected Areas Comm., vol. 26, no. 5, pp. 773-782, 2008.
[20]J. LeBrun, C.N. Chuah, D. Ghosal, and M. Zhang, “Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks,” in IEEE VTC ’05-Spring, Stockholm, Sweden, 2005.
[21]H. Huang, W. Shu, M. Li, and M.-Y. Wu, “A mobility prediction-based adaptive data gathering protocol for delay tolerant mobile sensor network,” in IEEE GLOBECOM ’08, New Orleans, Louisiana, USA, 2008.
[22]M. Demmer, and K. Fall, “DTLSR: delay tolerant routing for developing regions,” in ACM NSDR ’07, Kyoto, Japan, 2007.
[23]EPC Jones, L. Li, JK Schmidtke, PAS Ward Practical Routing in Delay-Tolerant Networks. IEEE Transactions on Mobile Computing 6(8):943-959, 2007.
[24]C. Liu and J. Wu, “Scalable routing in delay tolerant networks,” in Proc.ACM MobiHoc, 2007.
[25]J. Zhu, J. Cao, M. Liu, Y. Zheng, H. Gong, and G. Chen, “A mobility prediction-based adaptive data gathering protocol for delay tolerant mobile sensor network,” in IEEE GLOBECOM ’08, New Orleans, Louisiana, USA, 2008.
[26]S. Dhurandher, D. Sharma, I. Woungang, and S. Bhati, “HBPR: History based prediction for routing in infrastructure-less opportunistic networks,” in 2013 IEEE 27th Int. Conf. Adv. Inf. Networking and Applications (AINA), Barcelona, pp. 931–936.
[27]B. Poonguzharselvi, and V. Vetriselvi, “Data forwarding in opportunistic network using mobile traces,” CS and IT-CSCP, pp. 425-430, 2012.
[28]Y. Ko and N. H. Vaidya, “Location-Aided Routing ( LAR ) in mobile ad hoc networks ?,” vol. 6, pp. 307–321, 2000.
[29]M. Y. S. Uddin, H. Ahmadi, T. Abdelzaher, and R. Kravets, “A Low-energy, Multi-copy Inter-contact Routing Protocol for Disaster Response Networks,” 2009 6th Annu. IEEE Commun. Soc. Conf. Sensor, Mesh Ad Hoc Commun. Networks, pp. 1–9, Jun. 2009.
[30]Savita and Lobiyal, D.K. (2015) ‘Location information in inter-contact based routing approach in delay tolerant network’, Proceedings of the 3rd International Conference on Recent Trends in Computing, IRCTC Procedia Computer Science, Vol. 57, No. 1, pp.1367-1375.
[31]A. Ker?nen, T. K?rkk?inen, and J. Ott, “Simulating Mobility and DTNs with the ONE (Invited Paper),” J. Commun., vol. 5, no. 2, pp. 92–105, Feb. 2010.
[32]A. Ker?nen, J. Ott, and T. K?rkk?inen, “The ONE simulator for DTN protocol evaluation,” Proc. Second Int. ICST Conf. Simul. Tools Tech., 2009.
[33]X. Liu and Y. Chen, “Report of A DTN Simulator - THE ONE,” no. January 2011, pp. 1–8, 2013.