Kinetic spanning trees for minimum-power routing in MANETs.
Camillo GentileRobert E. Van DyckPublished in: VTC Spring (2002)
Keyphrases
- spanning tree
- routing protocol
- edge disjoint
- mobile ad hoc networks
- minimum cost
- ad hoc networks
- routing algorithm
- network topology
- minimum spanning tree
- multicast routing
- transmission range
- minimum spanning trees
- undirected graph
- total length
- power consumption
- multi hop
- wireless ad hoc networks
- wireless sensor networks
- weighted graph
- routing problem
- minimum total cost
- peer to peer
- end to end delay
- intermediate nodes
- approximation algorithms
- packet forwarding
- energy conservation
- topology control
- computational complexity
- energy efficient
- worst case
- quality of service
- energy consumption
- network layer
- network connectivity
- monte carlo
- multipath
- data transmission