Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

GHFP: Geocasting with HTOF using Flooding and PRoPHET Algorithm

Author : Medha Sharma 1 Shivika Arora 2 Tanvi Bansal 3 Preeti Nagrath 4

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 :

Will Updated soon

Recent Article