Back to Results
First PageMeta Content
Routing algorithms / Spanning tree / Routing / Minimum spanning tree / Bellman–Ford algorithm / Shortest path problem / Wireless Routing Protocol / IEEE 802.1aq / Theoretical computer science / Mathematics / Graph theory


Kinetic Spanning Trees for Minimum-Power Routing in MANETS Camillo Gentile and Robert E. Van Dyck National Institute of Standards and Technology Wireless Communications Technologies Group Gaithersburg, MD[removed]cgentile,
Add to Reading List

Document Date: 2009-02-03 16:25:35


Open Document

File Size: 86,16 KB

Share Result on Facebook

City

Killarney / /

Company

Ford / X5 / Node S A / /

Country

Ireland / /

Currency

SGD / /

/

Facility

Robert E. Van Dyck National Institute of Standards and Technology Wireless Communications Technologies Group Gaithersburg / /

IndustryTerm

distributed kinetic spanning tree algorithm / ad hoc networks / energy cost / proposed distributed algorithm / larger network / approximate solution / kinetic spanning tree algorithm / proposed kinetic spanning tree algorithm / hierarchical shortest path algorithms / mobile ad hoc networks / Wireless sensor networks / kinetic spanning tree algorithms / distributed routing algorithm / mobile ad hoc network / hierarchical networks / /

Organization

Institute of Standards and Technology Wireless Communications Technologies Group Gaithersburg / /

Person

Camillo Gentile / Robert E. Van Dyck / /

Position

straight-forward / /

ProvinceOrState

West Virginia / /

Technology

proposed distributed algorithm / kinetic spanning tree algorithms / distributed algorithm / proposed algorithm / distributed kinetic spanning tree algorithm / kinetic spanning tree algorithm / Wireless Communications Technologies / proposed kinetic spanning tree algorithm / simulation / distributed routing algorithm / hierarchical shortest path algorithms / two algorithms / /

SocialTag