Name
Abstract | ||
|---|---|---|
A dyanmic ad-hoc network consists of a collectionof mobile hosts with frequently changing networktopology. We propose a distributed algorithm that adaptsto the topology by utilizing spanning trees in the regionswhere the topology is stable, and resorting to an intelligentflooding-like approach in highly dynamic regions ofthe network. Routing is performed using the spanningtrees based a hold-and-forward or shuttling method. Weintroduce the notion of connectivity-through-time and holding... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/WCNC.1999.796997 | WCNC |
Keywords | Field | DocType |
network topology,performance,mobile robots,simulation,ad hoc networks,routing protocol,mobile computing,throughput,spanning tree,distributed algorithm,network routing,reachability,mobile computers,spine,routing protocols,computer networks,taxonomy,ad hoc network,dst,distributed algorithms,protocols | Mobile ad hoc network,Dynamic Source Routing,Static routing,Hierarchical routing,Computer science,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Optimized Link State Routing Protocol,Wireless ad hoc network,Distributed computing | Conference |
Citations | PageRank | References |
16 | 1.70 | 8 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Radhakrishnan | 1 | 53 | 4.61 |
| Gopal Racherla | 2 | 27 | 4.43 |
| Chandra N. Sekharan | 3 | 105 | 12.77 |
| Nageswara S. V. Rao | 4 | 809 | 101.28 |
| S. G. Batsell | 5 | 147 | 14.67 |