Interested to Buy Any Domain ? << Click Here >> for more details...
please any one explain this project:
Minimizing recovery state in geographic ad hoc routing
- 1 Answers
- 3652 Views
- IBM, I also Faced
- E-Mail Answers
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 |
What is difference between jframe and swing?
What do you mean by java swing?
What is the use of JTree?
What is a swing day?
What is sling swing?
What is swing api?
Which swing methods are thread-safe?
What are the different components that are used to show a container?
what do u mean by GUI framework
What are all the components used in Swing?
What is Java Swing?
What is swing and awt in java?
Core Java 
