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
Is swing part of core java?
Is swing an adjective?
What are swing controls?
What is swing package in java?
What is swing framework in java?
How to change button color in java swing?
Why swing is better than awt?
What is swing gui in java?
Why swings are used in java?
what are the steps required in creating an empty table drop?
What is swing control in java?
What is an event and what are the models available for event handling?
What is layout in java swing?
What is import javax swing?
What is the difference between a scrollbar and a jscrollpane ?