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
What is difference between jframe and swing?
Why should the implementation of any swing callback (like a listener) execute quickly?
What is event in java swing?
When we should go for codebase in applet?
Is javafx better than swing?
What is the difference between swing and awt?
What is swing api?
How to render an html page using only swing.
Which containers use a border Layout as their default layout in swing?
Which method is used by the applet to recognize the height and width?
What is a swing day?
Write a program to include the internal frame in swing.
What are the benefits if Swing over AWT?
What are swing components?
Who created the swing?