NIST · ИТ · 3109c50131751a24ae93
Kinetic Minimum-Power Routing and Clustering in Mobile Ad-Hoc Networks
We have previously developed a distributed routing algorithm which minimizes the number of overhead messages necessary to maintain the minimum-power multi-hop routes in a mobile ad-hoc network, assuming a piece-wise linear model for the motion of the nodes
NIST · ИТОфициальный источник · 2002-09-01
{
"title_en": "Kinetic Minimum-Power Routing and Clustering in Mobile Ad-Hoc Networks",
"designation": "",
"series": "",
"status": "",
"date": "2002-09-01",
"date_original": "September 1, 2002",
"url": "https://www.nist.gov/publications/kinetic-minimum-power-routing-and-clustering-mobile-ad-hoc-networks",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Camillo Gentile , R E. Van Dyck , J Haerri",
"abstract_excerpt_en": "We have previously developed a distributed routing algorithm which minimizes the number of overhead messages necessary to maintain the minimum-power multi-hop routes in a mobile ad-hoc network, assuming a piece-wise linear model for the motion of the nodes",
"id": "3109c50131751a24ae93",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Kinetic Minimum-Power Routing and Clustering in Mobile Ad-Hoc Networks",
"designation": "",
"series": "",
"status": "",
"date": "2002-09-01",
"date_original": "September 1, 2002",
"url": "https://www.nist.gov/publications/kinetic-minimum-power-routing-and-clustering-mobile-ad-hoc-networks",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Camillo Gentile , R E. Van Dyck , J Haerri",
"abstract_excerpt_en": "We have previously developed a distributed routing algorithm which minimizes the number of overhead messages necessary to maintain the minimum-power multi-hop routes in a mobile ad-hoc network, assuming a piece-wise linear model for the motion of the nodes"
}
],
"translation_state": "none"
}