please any one explain this project:
Minimizing recovery state in geographic ad hoc routing
Answer / c
ABSTRACT
Geographic ad hoc networks use position information for
routing. They often utilize stateless greedy forwarding and
require the use of recovery algorithms when the greedy approach
fails. We propose a novel idea based on virtual repositioning
of nodes that allows to increase the efficiency of
greedy routing and significantly increase the success of the
recovery algorithm based on local information alone.
We explain the problem of predicting dead ends which the
greedy algorithm may reach and bypassing voids in the network,
and introduce NEAR, Node Elevation Ad-hoc Routing,
a solution that incorporates both virtual positioning
and routing algorithms that improve performance in ad-hoc
networks containing voids. We demonstrate by simulations
the advantages of our algorithm over other geographic adhoc
routing solutions.
Categories and Subject Descriptors: C.2.2 Computer
Systems Organization: Computer-Communication Networks
-Network Protocols
General Terms:Algorithms, Performance, Theory
Keywords:Ad-Hoc, Routing, Distributed, Elevation, Repositioning
| Is This Answer Correct ? | 1 Yes | 0 No |
How can you draw using Swing components?
What is import javax swing in java?
What is meant by Swing?
Is there any heavyweight component in swings?
How to create image slideshow in java swing?
Is swing part of core java?
Can a class be it?s own event handler? Explain how to implement this?
What is the purpose of transferhandler class?
Name the method, to expand & collapse nodes in a Jtree?
What is container in java swing?
What is swing framework in java?
Why swing is better than awt?