Power-Award Services in Wireless Mobile Ad Hoc Networks

In Wireless Mobile Ad Hoc Networks (MANETs) power consumption is an important issue since most mobile hosts operate on battery. In this paper we model our networks as a weighted graph and our servers as a weighted dominating set. So nodes in weighted dominating set consume more energy to handle various bypass traffic than nodes outside the set. The problem is finding a minimum weighted dominating set in our networks. Then we model this problem as an Integer Linear programming (ILP) problem and provide an O(log n)-approximation algorithm based on randomized rounding of LP-relaxation optimal solution.

Keywords:

Wireless MANETs , Weighed dominating sets , integer programming , LPrelaxation , randomized rounding