Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks
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...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Mobile Computing|
|01_Liang_Online_Multicasting_for_2006.pdf||1.27 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.