Applying a Minimum Routing Cost Spanning Tree to Many-to-Many in Wireless Sensor Networks.
A. S. M. Sanwar HosenGihwan ChoPublished in: ICHIT (1) (2012)
Keyphrases
- spanning tree
- minimum cost
- wireless sensor networks
- routing algorithm
- routing protocol
- minimum total cost
- edge disjoint
- data aggregation
- minimum spanning tree
- biological inspired
- np hard
- lowest cost
- energy aware
- routing scheme
- network lifetime
- minimum spanning trees
- ad hoc networks
- undirected graph
- minimum weight
- energy efficient
- approximation algorithms
- multi hop
- maximum lifetime
- sensor networks
- energy consumption
- total cost
- shortest path
- network topology
- topology control
- load distribution
- sensor nodes
- edge weights
- base station
- node selection
- routing decisions
- weighted graph
- multimedia