please any one explain this project:
Minimizing recovery state in geographic ad hoc routing
- 1 Answers
- 2895 Views
- IBM, I also Faced
- E-Mail Answers
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
Which types of components are used in designing swing based gui?
What is a swing day?
What are the features of swing in java?
How to move from one page to another in java swing?
How to print in java swing application?
Is swing still used?
Is java swing deprecated?
Is swing thread-safe?
What are the advantages of swing over awt?
Is java swing still used?
What is java swing components?
What is awt and swing in java?
Is java swing a framework?
Which swing methods are thread-safe?
Explain how to render an html page using only swing.
