Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure.
Bing-Hong LiuWei-Chieh KeChin-Hsien TsaiMing-Jer TsaiPublished in: IEEE Trans. Computers (2008)
Keyphrases
- data aggregation
- wireless sensor networks
- minimum cost
- np complete
- np hard
- spanning tree
- scheme for wireless sensor networks
- energy efficient
- moving objects
- sensor networks
- polynomially solvable
- tree structure
- approximation algorithms
- network flow problem
- sensor nodes
- network flow
- energy consumption
- randomly generated
- base station
- multi hop
- special case
- graph structure
- image sequences
- data dissemination
- resource constrained
- network simplex algorithm
- capacity constraints
- linear programming
- key management
- edit operations
- video sequences
- data transmission
- energy efficiency
- routing algorithm
- routing protocol
- index structure
- search space
- optimal solution