On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messages routed successfully by the network without any knowledge of future disjoint path connection request arrivals and generation rates. Specifically, in this paper we first present two centralized on-line algorithms for the problem. One is based on maximizing local network lifetime, which aims to minimize the...[Show more]
|Collections||ANU Research Publications|
|Source:||Ad Hoc Networks|
|01_Liang_On-line_disjoint_path_routing_2007.pdf||985.82 kB||Adobe PDF||Request a copy|
|02_Liang_On-line_disjoint_path_routing_2007.pdf||102.05 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.