A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead In Mobile Ad Hoc Networks

Journal Title: International Journal of Modern Engineering Research (IJMER) - Year 2014, Vol 4, Issue 1

Abstract

Mobile ad hoc networks consist of a collection of mobile nodes without having a fixed infrastructure. Due to the infrastructure less network, there exist frequent link breakages which lead to frequent path failures and route discoveries. A mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. So, rebroadcast is very costly and consumes too much network resource. In the existing System, different mechanisms are proposed for improving the routing performance. In the gossip-based routing overhead is reduced. However, when the network density is high, the gossip-based approach is limited. In the Dynamic Probabilistic Route Discovery scheme,eachnodedeterminestheforwardingprobability according to the number of its neighbors and the set of neighbors which are covered by the previous broadcast. So, coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANET propose a novel Ra rebroadcast delay to determine the rebroadcast order, and then it obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. The advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also  improvetherouting performance. To improve the quality of routing particularly in mobile ad hoc networks, improved routing protocol have been proposed such as Optimized Link State Routing Protocol (OLSR).

Authors and Affiliations

S. Divya

Keywords

Related Articles

 esign and Implementation of an Encryption and Decryption Using Non-Linear RM-PRNG

 Pseudo Random Number Generator (PRNG) is an algorithm for generating a sequence of numbers. Due to speed in number generation pseudorandom numbers are very important. The increasing application of cryptographicalgo...

 Characterisation of potential pollution sources in the quantitative assessment of risk to groundwater resources within the Birmingham aquifers, UK

 This work presents a methodological approach where distribution of potential pollution sources and  historical frequency of pollution incidents are included in the assessment of risk to groundwater resources....

A Case study for near net Shape – Flashless forging for full yoke (Sleeve Yoke OMNI)

Forging is a metal forming process commonly used in industry. Forging process is strongly affected by the process parameters. In a progressive press forging process, an initial block of metal (billet) is compressed b...

 An Efficient Distributed Control Law for Load Balancing in Content Delivery Networks

 Content Delivery Networks (CDN) aim at overcoming the inherent limitations of the Internet. The main concept at the basis of this technology is the delivery at edge points of the network, in proximity to the reques...

 Finite Element Analysis of Single Point Cutting Tool

 In this project, temperature at tool-tip interface is determined, generated in high-speed machining operations. Specifically, three different analyses are comparing to an experimental measurement of temperature...

Download PDF file
  • EP ID EP88118
  • DOI -
  • Views 125
  • Downloads 0

How To Cite

S. Divya (2014). A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead In Mobile Ad Hoc Networks. International Journal of Modern Engineering Research (IJMER), 4(1), 152-158. https://europub.co.uk/articles/-A-88118