Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks

  • Authors:
  • Weifa Liang;Xiaoxing Guo

  • Affiliations:
  • IEEE;IEEE

  • Venue:
  • IEEE Transactions on Mobile Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present new algorithms for online multicast routing in ad hoc networks where nodes are energy-constrained. The objective is to maximize the total amount of multicast message data routed successfully over the network without any knowledge of future multicast request arrivals and generation rates. Specifically, we first propose an online algorithm for the problem based on an exponential function of energy utilization at each node. The competitive ratio of the proposed algorithm is analyzed if admission control of multicast requests is permitted. We then provide another online algorithm for the problem, which is based on minimizing transmission energy consumption for each multicast request and guaranteeing that the local network lifetime is no less than \gamma times of the optimum, where \gamma is constant with 0