Fructifying the network performance of ivanet thru a rectified associative service mechanism: An algorithmic proposal

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Internet based Vehicular (iVANET) ad-hoc networks are meticulously especial case of normal VANET. It is basically made of a combined wired Internet as well as vehicular ad hoc network for developing a new baby-boom of omnipresent and ubiquitous computing. The Internet connectivity is usually extended to V2I (vehicle to infrastructure) communication whilst ad-hoc networks are used in vehicle to vehicle (V2V) communication. The latency is one of the main matters of concern in VANET. By minimizing distance between data source and the remote vehicle through rectified caching technique along with redefined cache lookup mechanism, the latency can be shortened by a significant factor in iVANET environment. In this paper various cache invalidation schemes are studied and analyzed. Exploring the possibilities of caching schemes which can be hybridized or mutated, paper introduces an algorithmic proposal along with redefined services mechanism for cache lookup and invalidation, which strives for achieving low latency with reduced negative acknowledgement (NACK) in the network. This paper introduces a rectified algorithm for guaranteed delivery of the queried data and efficiently invalidating cache contents at different levels of hierarchy. The proposed work is anticipated to fructify the network performance minimizing the cost and bandwidth utilization during cache invalidation and hence guarantees improved quality of service (QoS).

Cite

CITATION STYLE

APA

Akbar, M., & Ahmad, S. (2019). Fructifying the network performance of ivanet thru a rectified associative service mechanism: An algorithmic proposal. International Journal of Innovative Technology and Exploring Engineering, 8(11), 4291–4297. https://doi.org/10.35940/ijitee.K2064.0981119

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free