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 102
- Downloads 0
Invariant Moments based War Scene Classification using ANN and SVM: A Comparative Study
In this paper we are trying to classify a war scene from the natural scene. For this purpose two set of image categories are taken viz., opencountry & war tank. By using Invariant Moments features are extracted from...
PDPKDES ( Pre Distributed Powerful Key for Data Encryption Standard)
Data encryption standard in spite of being a great algorithm in terms of a good combination of confusion and diffusion steps, doesn’t largely used because of a weak key concept. The key used in DES is only 64 bits (or 56...
An Efficient Pruning Technique for Mining Frequent Itemsets in Spatial Databases
Frequent Itemset Mining is evaluating the rules and relationship within the data items are optimizing it, in the large spatial databases (for e.g. Images, Docs, AVI files etc).It is one of the major problems in DM (Data...
Quantum Computation and Consciousness in Cyclic and Mythological Models of Universe
Cyclic models such as Steinhardt-Turok model, Baum-Frampton model, and CCC models have been proposed for the universe. It has been postulated that the value of the physical constants in different aeons may possibly be di...
A Genetic Algorithm Optimized Decision Tree- SVM based Stock Market Trend Prediction System
Prediction of stock market trends has been an area of great interest both to researchers attempting to uncover the information hidden in the stock market data and for those who wish to profit by trading stocks. The extre...