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

Authors:
Weifa Liang;Yuzhen Liu
Affiliations:
Department of Computer Science, Australian National University, Canberra, ACT 0200, Australia;Department of Computer Science, Australian National University, Canberra, ACT 0200, Australia
Venue:
Ad Hoc Networks
Year:
2007

Citing 11
Cited 2

On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
Online power-aware routing in wireless Ad-hoc networks

Proceedings of the 7th annual international conference on Mobile computing and networking
A Survey of Energy Efficient Network Protocols for Wireless Networks

Wireless Networks
Constructing minimum-energy broadcast trees in wireless ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
Resource management in energy-limited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Minimum energy disjoint path routing in wireless ad-hoc networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Maximizing Battery Life Routing in Wireless Ad Hoc Networks

HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9
Distributed algorithms for computing shortest pairs of disjoint paths

IEEE Transactions on Information Theory
Competitive routing of virtual circuits in ATM networks

IEEE Journal on Selected Areas in Communications

Minimizing point-to-point transmission energy with error correction coding and transmission power control

ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Survey Paper: Routing protocols in ad hoc networks: A survey

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 transmission energy consumption, under the constraint that the local network lifetime is no less than @c times of the optimum after the realization of each disjoint path connection request, where @c is constant with 0