Fengxia Ding

Learn More
Minimum disc cover problem which is NP-hard is kernel of node scheduling protocol in wireless sensor networks. Size of disc cover set obtained by approximate algorithm determines performance of node scheduling protocol. But the approximation ratios of present approximate algorithms aren't good. This paper proposes a local Voronoi diagrams-based approximate(More)
  • 1