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

Weifa Liang; Yuzhen Liu; Xiaoxing Guo

doi:10.1109/WCNC.2005.1424830

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

Weifa Liang^*, Yuzhen Liu, Xiaoxing Guo

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Citations (Scopus)

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. 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. We then conduct extensive experiments by simulations to analyze the performance of the proposed algorithms. The experimental results show that the proposed algorithms outperform those existing algorithms that do not take into account the power load balancing among the nodes.

Original language	English
Title of host publication	2005 IEEE Wireless Communications and Networking Conference, WCNC 2005
Subtitle of host publication	Broadband Wireless for the Masses - Ready for Take-off
Pages	2026-2031
Number of pages	6
DOIs	https://doi.org/10.1109/WCNC.2005.1424830
Publication status	Published - 2005
Event	2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off - New Orleans, LA, United States Duration: 13 Mar 2005 → 17 Mar 2005

Publication series

Name	IEEE Wireless Communications and Networking Conference, WCNC
Volume	4
ISSN (Print)	1525-3511

Conference

Conference	2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off
Country/Territory	United States
City	New Orleans, LA
Period	13/03/05 → 17/03/05

Access to Document

10.1109/WCNC.2005.1424830

Cite this

Liang, W., Liu, Y., & Guo, X. (2005). On-line disjoint path routing for network capacity maximization in ad hoc networks. In 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wireless for the Masses - Ready for Take-off (pp. 2026-2031). Article NET34-4 (IEEE Wireless Communications and Networking Conference, WCNC; Vol. 4). https://doi.org/10.1109/WCNC.2005.1424830

@inproceedings{d442a7987d554d74a3820fcb19001cf6,

title = "On-line disjoint path routing for network capacity maximization in ad hoc networks",

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. 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. We then conduct extensive experiments by simulations to analyze the performance of the proposed algorithms. The experimental results show that the proposed algorithms outperform those existing algorithms that do not take into account the power load balancing among the nodes.",

keywords = "Ad hoc networks, Disjoint path routing, Energy consumption optimization, Load-balanced routing, Network capacity, On-line algorithm, Power awareness, Wireless communication network",

author = "Weifa Liang and Yuzhen Liu and Xiaoxing Guo",

year = "2005",

doi = "10.1109/WCNC.2005.1424830",

language = "English",

isbn = "0780389662",

series = "IEEE Wireless Communications and Networking Conference, WCNC",

pages = "2026--2031",

booktitle = "2005 IEEE Wireless Communications and Networking Conference, WCNC 2005",

note = "2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off ; Conference date: 13-03-2005 Through 17-03-2005",

}

Liang, W, Liu, Y & Guo, X 2005, On-line disjoint path routing for network capacity maximization in ad hoc networks. in 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wireless for the Masses - Ready for Take-off., NET34-4, IEEE Wireless Communications and Networking Conference, WCNC, vol. 4, pp. 2026-2031, 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off, New Orleans, LA, United States, 13/03/05. https://doi.org/10.1109/WCNC.2005.1424830

On-line disjoint path routing for network capacity maximization in ad hoc networks. / Liang, Weifa; Liu, Yuzhen; Guo, Xiaoxing.
2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wireless for the Masses - Ready for Take-off. 2005. p. 2026-2031 NET34-4 (IEEE Wireless Communications and Networking Conference, WCNC; Vol. 4).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Liang, Weifa

AU - Liu, Yuzhen

AU - Guo, Xiaoxing

PY - 2005

Y1 - 2005

N2 - 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. We then conduct extensive experiments by simulations to analyze the performance of the proposed algorithms. The experimental results show that the proposed algorithms outperform those existing algorithms that do not take into account the power load balancing among the nodes.

AB - 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. We then conduct extensive experiments by simulations to analyze the performance of the proposed algorithms. The experimental results show that the proposed algorithms outperform those existing algorithms that do not take into account the power load balancing among the nodes.

KW - Ad hoc networks

KW - Disjoint path routing

KW - Energy consumption optimization

KW - Load-balanced routing

KW - Network capacity

KW - On-line algorithm

KW - Power awareness

KW - Wireless communication network

UR - http://www.scopus.com/inward/record.url?scp=24944442944&partnerID=8YFLogxK

U2 - 10.1109/WCNC.2005.1424830

DO - 10.1109/WCNC.2005.1424830

M3 - Conference contribution

SN - 0780389662

T3 - IEEE Wireless Communications and Networking Conference, WCNC

SP - 2026

EP - 2031

BT - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005

T2 - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off

Y2 - 13 March 2005 through 17 March 2005

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this