Linear Time Approximation Algorithms for the Relay Node Placement Problem in Wireless Sensor Networks with Hexagon Tessellation.
Chi-Chang ChenChi-Yu ChangPo-Ying ChenPublished in: J. Sensors (2015)
Keyphrases
- approximation algorithms
- wireless sensor networks
- worst case
- multi hop
- node selection
- topology control
- base station
- np hard
- undirected graph
- disjoint paths
- special case
- energy efficient
- cluster head
- relay nodes
- vertex cover
- sensor nodes
- sensor networks
- approximation ratio
- network design problem
- minimum cost
- residual energy
- facility location problem
- energy consumption
- malicious nodes
- energy efficiency
- open shop
- mobile nodes
- approximation schemes
- randomized algorithms
- routing algorithm
- wireless networks
- primal dual
- data transmission
- set cover
- polynomial time approximation
- directed graph
- upper bound
- constant factor
- np hardness
- resource constrained
- precedence constraints
- routing protocol
- lower bound
- constant factor approximation
- ad hoc networks