Gentile, C.
and Van dyck, R.
(2002),
Kinetic Spanning Trees for Minimum-Power Routing in MANETS, IEEE Vehicular Technology Conference, Undefined, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151095
(Accessed December 6, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Kinetic Spanning Trees for Minimum-Power Routing in MANETS
Published
Author(s)
,
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. By computing the sequence of trees using one execution of the distributed routing algorithm, in contrast to computing the tree for a single time instant, the number of routing messages is substantially reduced. Moreover, the total power required to route through the trees as a function of time is also lower.Conference Dates
May 6-9, 2002
Conference Location
Undefined
Conference Title
IEEE Vehicular Technology Conference
Pub Type
Conferences
Download Paper
Keywords
kinetic spanning trees, MANET, wireless ad hoc networks
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created May 29, 2002, Updated October 12, 2021