NIST · ИТ · e3cd2131af62708fe0a4
Kinetic Spanning Trees for Minimum-Power Routing in MANETS
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
NIST · ИТОфициальный источник · 2002-05-30
{
"title_en": "Kinetic Spanning Trees for Minimum-Power Routing in MANETS",
"designation": "",
"series": "",
"status": "",
"date": "2002-05-30",
"date_original": "May 30, 2002",
"url": "https://www.nist.gov/publications/kinetic-spanning-trees-minimum-power-routing-manets",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Camillo Gentile , R E. Van Dyck",
"abstract_excerpt_en": "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",
"id": "e3cd2131af62708fe0a4",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Kinetic Spanning Trees for Minimum-Power Routing in MANETS",
"designation": "",
"series": "",
"status": "",
"date": "2002-05-30",
"date_original": "May 30, 2002",
"url": "https://www.nist.gov/publications/kinetic-spanning-trees-minimum-power-routing-manets",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Camillo Gentile , R E. Van Dyck",
"abstract_excerpt_en": "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"
}
],
"translation_state": "none"
}