Approximation algorithms for minimum energy multicast routing with reception cost in wireless sensor networks

  • Authors:
  • Deying Li;Zewen Liu;Yi Hong;Wenping Chen

  • Affiliations:
  • School of Information, Renmin University of China, Beijing, P.R. China;Nanchang University, Nanchang, P.R. China;School of Information, Renmin University of China, Beijing, P.R. China;School of Information, Renmin University of China, Beijing, P.R. China

  • Venue:
  • COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study the minimum energy multicast problem with reception cost in wireless sensor networks. Suppose there are n nodes in the network. Each node v has l(v) transmission power levels to be chosen and its reception cost is B(v) if it receives a message. The problem of our concerning is: given a multicast request, how to find a multicast tree such that the total energy cost of the multicast tree including transmitting cost and reception cost is minimized. We firstly propose a general algorithm Fix-MEM-R-G for the case while each node has the fixed power level. Based on Fix-MEM-R-G algorithm, we propose an approximation algorithm. We also propose a heuristic algorithm for this special case. For the general case that each node has multiple power levels, we propose a general algorithm NF-MEM-R-G and an approximation algorithm based on NF-MEM-R-G algorithm. We also propose a heuristic algorithm for general case.