Skip navigation
Skip navigation

On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks

Liang, Weifa; Liu, Yuzhen

Description

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]

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
URI: http://hdl.handle.net/1885/34965
Source: Ad Hoc Networks
DOI: 10.1016/j.adhoc.2005.11.004

Download

File Description SizeFormat Image
01_Liang_On-line_disjoint_path_routing_2007.pdf985.82 kBAdobe PDF    Request a copy
02_Liang_On-line_disjoint_path_routing_2007.pdf102.05 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator