Kinetic Spanning Trees for Minimum-Power Routing in MANETS
by
Camillo Gentile And
BibTeX
@MISC{And_kineticspanning,
author = {Camillo Gentile And},
title = {Kinetic Spanning Trees for Minimum-Power Routing in MANETS},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A distributed kinetic spanning tree algorithm is proposed for routing in wireless mobile ad hoc networks. Assuming a piecewise linear motion model for the nodes, the sequence of shortest-path spanning trees is determined, valid until the time of the next node trajectory change.
Citations
| 283 | A distributed algorithm for minimumweight spanning trees - Gallager, Humblet, et al. - 1983 |
| 85 | Wireless sensor networks - Pottie, Kaiser - 2000 |
| 81 | Kinetic data structures — a state of the art report - Guibas - 1998 |
| 73 | Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees - Frederickson - 1997 |
| 24 | Parametric and kinetic minimum spanning trees - Agarwal, Eppstein, et al. - 1998 |
| 3 | A performance analysis of hierarchical shortest path algorithms - Fetterer, Shekhar - 1997 |
