Detection of Disappeared Node Using LLFR Algorithm in MANET
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2016, Vol 4, Issue 2
Abstract
Mobile ad hoc networks (MANETs) are ideal for situations where a fixed infrastructure is unavailable or infeasible. MANET may suffer from network partitioning.Because where a fixed infrastructure is unavailable (or) infeasible. Overcome this problem use new class of the mobile ad hoc network is called autonomous mobile mesh network (AMMNET).Its capable of following the mesh clients and adapt the topology for communication. And network topology to ensure good connectivity for both inter and intragroup communication. AMMNET is robust against network partitioning and providing high throughput for the clients. There is a issue in AMMNET is link breakage .The proposed system presents to recover the link failure using Local Link Failure(LLFR)algorithm for detecting the disappeared node. LLFR algorithm for Ad hoc networks that establishes recovery from link failures spontaneously at the point of link breakage. In such cases, a reliable link failure recovery is the main criteria that will determine the performance of the network in terms of Quality of Service (QoS).Failure of link cause disappearing mobile clients to recover this node using LLFR algorithm and to produce efficient performance.
Authors and Affiliations
Parameswaran. T, Dr. PalaniSamy. C, Cinthiya. S
A Highly Auto Configuration for A Node Using Addressing Protocol in Ad Hoc Networks
The addressing configuration may be a key challenge in networks owing to the shortage of infrastructure. Autonomous addressing protocols need a distributed and self-managed mechanism to avoid address collisions in an ex...
Pipe Cutting-A Different Approach
one problem which the present invention solves is the cutting of pipes located in trenches or other points similarly difficult of access. For example, in repairing or adding connections to installed gas mains it is freq...
Special pairs of rectangles and sphenic number
We present pairs of Rectangles, such that in each pair, the sum of their areas is two times the Sphenic number minus one. Also we present the number of pairs of primitive and non-primitive rectangles.
- Splitting Graphs
Let G(V,E) be a graph. A dominating set is a subset S of V such that every vertex not in S is adjacent to at least one vertex in S. The cardinality of a minimum dominating set is called the domination number, (G). A do...
Minimize End-To-End Delay in Delay Tolerant Enabled Vehicular Ad-Hoc Networks Using Ferry Selection Approach
An existing approach “FFRDV” performs well without consideration of high speed vehicle than the speed of CF is not present in the scenario and all nearby vehicles are considered as of same category. In this research pap...