Rebroadcasting for Routing Reduction based upon Neighbor coverage in Ad Hoc Networks
Journal Title: International Journal on Computer Science and Engineering - Year 2014, Vol 6, Issue 7
Abstract
Cause of nodes high mobility in mobile ad hoc networks (MANETs), there are frequent link breakages exist which escort to frequent route discoveries and path failures. The route discovery procedure cannot be ignored. In a route finding, broad casting is a primary and efficient data broadcasting methodology, where a cell phone node sightless rebroadcasts the initial route request packets are received apart from it has a destination route, and thus it starts the broadcast storm crisis. In this, we explore a probabilistic rebroadcast protocol which is based on neighbor coverage decreasing routing placed in front in MANETs. In order to efficiently make the most of the neighbor coverage information, we recommend a work of fiction rebroadcast postponement to conclude the rebroadcast arrange and then we can gain the more correct added ratio of coverage with the help of sensing coverage of neighbor information. And also we describe a factor of connectivity to provide the node density altered copy. By merging the added connectivity factor and coverage ratio, we situated a practical rebroadcast possibility. Our methodology mingles the pros of the probabilistic mechanism and the neighbor coverage knowledge, which can considerably reduce the retransmissions count so as to decrease the routing above your head, and can also get better the routing routine.
Authors and Affiliations
K. MADHAVI , Dr P GOVARDHAN
Keywords
Related Articles
- EP ID EP126725
- DOI -
- Views 100
- Downloads 0
An Integer Programming-based Local Search for Large-scale Maximal Covering Problems
Maximal covering problem (MCP) is classified as a linear integer optimization problem which can be effectively solved by integer programming technique. However, as the problem size grows, integer programming requires exc...
Classification of Indian Stock Market Data Using Machine Learning Algorithms
Classification of Indian stock market data has always been a ertain appeal for researchers. In this paper, first time ombination of three supervised machine learning algorithms, lassification and regression tree (CART...
Performance Evaluation and Comparison of AODV and AOMDV
A Mobile Ad-hoc Network (MANET) is a dynamic wireless network that can be formed without the need for any pre-existing infrastructure in which each node can act as a router. One of the main challenges of MANET is the des...
Harnessing Genetic Algorithm for Vertex Cover Problem
The problem of finding a minimum vertex cover is an NP hard optimization problem. Some approximation algorithms for the problem have been proposed but most of them are neither optimal nor complete. The work proposes the...
Analyzing Motivation of Private Engineering College Students: A Fuzzy Logic Approach (A case study of private Engineering ollege)
A method for analyzing and comparing group of students motivation using fuzzy logic is proposed. A fuzzy inference system is designed and implemented using Simulink in Matlab[19] with fuzzy statistical analysis to includ...