Author : Medha Sharma 1
Date of Publication :17th January 2018
Abstract: Delay Tolerant Networks (DTNs) make effective communication possible in challenging environments wherein the connectivity is intermitted or no end to end path has been established. They follow Store-carry-Forward mechanism in which the information is sent to an intermediate station, where it is kept for a certain duration and is later sent to either another intermediate station or a final station. Geocasting involves sending the message to a specific cast, followed by dissemination of message within the cast. In this treatise, we propose Geocasting with HTOF using Flooding and PRoPHET Algorithm (GHFP), an optimized geographic routing algorithm. We also delve into single copy routing schemes that use only one copy per message, thereby significantly reducing the resource requirements. Highest TTL Out First (HTOF) buffer management policy is used to enhance the network performance. Under the GHFP algorithm, the devices do not exchange any location-related information, and hence there’s no risk of any intrusion into the user’s privacy. DTN offers services in communication challenged areas which render GHFP algorithm advantageous for message transmission in diverse fields like war and disaster-prone regions, areas where government censorship imposes restrictions on the content that can be transmitted and also in advertising in expanses having high user density. The resulting analysis indicates that the GHFP algorithm is efficient in terms of latency and network overhead.
Reference :
-
- “Mobile Ad-Hoc and DTN Networks at IPCAS Lab” online available: http://www.ece.gatech.edu/research/l abs/WCCL/DTN2.html, last accessed 2017/04/23
- K. Fall, 2003, August. A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (pp. 27-34). ACM.
- C. Perkins, E. Belding-Royer and S. Das, 2003. Ad hoc on-demand distance vector (AODV) routing (No. RFC 3561).Author, F.: Article title. Journal 2(5), 99–110 (2016).
- D.B. Johnson and D.A. Maltz, 1996. Dynamic source routing in ad hoc wireless networks. Mobile computing, pp.153-181.
- J. Burgess, B. Gallagher, D. Jensen and B.N. Levine, 2006, April. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Infocom.
- A. Vahdat and D. Becker,, 2000. Epidemic routing for partially connected ad hoc networks.
- A. Lindgren, A. Doria and O. Schelén, 2003. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE mobile computing and communications review, 7(3), pp.19-20.
- T. Spyropoulos, K. Psounis and C.S. Raghavendra, 2008. Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking (ToN), 16(1), pp.77-90.Author, F., Author, S.: Title of a proceedings paper. In: Editor, F., Editor, S. (eds.) CONFERENCE 2016, LNCS, vol. 9999, pp. 1–13. Springer, Heidelberg (2016).
- T. Spyropoulos, K. Psounis and C. S. Raghavendra , 2004, October. Single-copy routing in intermittently connected mobile networks. In Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on (pp. 235-244). IEEE.
- A. Rajaei, D. Chalmers, I. Wakeman and G. Parisis, 2016, June. GSAF: Efficient and flexible geocasting for opportunistic networks. In World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2016 IEEE 17th International Symposium on A (pp. 1-9). IEEE.
- C. Maihofer, 2004. A survey of geocast routing protocols. IEEE Communications Surveys & Tutorials, 6(2).
- M. Castro, L. Galluccio, A. Kassler and C. Rametta, 2011. Opportunistic P2P communications in delay-tolerant rural scenarios. EURASIP Journal on Wireless Communications and Networking, 2011(1), p.892038.