On-Line Disjoint Path Routing for Network Capacity Maximization in 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. We first present two on-line algorithms for the problem. One is based on maximizing the network lifetime and another is based on an exponential function of energy utilization at nodes....[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 2005)|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.