please any one explain this project:
Minimizing recovery state in geographic ad hoc routing
Answer Posted / 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 |
Post New Answer View All Answers
Explain the difference between awt and swt.
Why do we use swing in java?
What is event in java swing?
Why should the implementation of any swing callback (like a listener) execute quickly?
Which package is needed for swing components?
Where is java swing used?
Which layout does swing use by default?
What is swing framework in java?
Is swing part of core java?
What is the difference between swing and applet?
Which method is used for setting security in applets?
What are the features of swing in java?
How to change button color in java swing?
What is layout in java swing?
What is the base class for all swing components?