A scalable distributed multicast algorithm for lifetime maximization in large-scale resource-limited multihop wireless networks

Song Guo; Victor Leung; Oliver Yang

doi:10.1145/1143549.1143633

A scalable distributed multicast algorithm for lifetime maximization in large-scale resource-limited multihop wireless networks

Song Guo, Victor Leung, Oliver Yang

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

16 Citations (Scopus)

Abstract

We consider the problem of maximizing the multicast lifetime in multihop wireless networks in which each node is static and has limited energy, bandwidth, memory, and computation capabilities. Unlike most multicast algorithms that use centralized greedy algorithms, our algorithm can construct a global optimal maximum lifetime multicast tree in a distributed manner. It has a low complexity of O(λu) for both memory and computation requirements at each node u, where λu, is the degree of node u. The simulation results have shown that it has an expected linear communication complexity under different network sizes and multicast group sizes. This means that our distributed algorithm is also scalable in terms of communication overhead and it is very useful for large-scale energy and bandwidth constrained multihop wireless networks like sensor networks..

Original language	English
Title of host publication	IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference
Pages	419-424
Number of pages	6
Volume	2006
DOIs	https://doi.org/10.1145/1143549.1143633
Publication status	Published - 1 Dec 2006
Externally published	Yes
Event	IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference - Vancouver, BC, Canada Duration: 3 Jul 2006 → 6 Jul 2006

Conference

Conference	IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference
Country/Territory	Canada
City	Vancouver, BC
Period	3/07/06 → 6/07/06

Keywords

Distributed algorithm
Maximum lifetime multicast
Multihop wireless network

ASJC Scopus subject areas

General Engineering
Computer Networks and Communications
Computer Science Applications
Software

More information

10.1145/1143549.1143633

Cite this

@inproceedings{20c5c9fbda974594aaf7499004cb476e,

title = "A scalable distributed multicast algorithm for lifetime maximization in large-scale resource-limited multihop wireless networks",

abstract = "We consider the problem of maximizing the multicast lifetime in multihop wireless networks in which each node is static and has limited energy, bandwidth, memory, and computation capabilities. Unlike most multicast algorithms that use centralized greedy algorithms, our algorithm can construct a global optimal maximum lifetime multicast tree in a distributed manner. It has a low complexity of O(λu) for both memory and computation requirements at each node u, where λu, is the degree of node u. The simulation results have shown that it has an expected linear communication complexity under different network sizes and multicast group sizes. This means that our distributed algorithm is also scalable in terms of communication overhead and it is very useful for large-scale energy and bandwidth constrained multihop wireless networks like sensor networks..",

keywords = "Distributed algorithm, Maximum lifetime multicast, Multihop wireless network",

author = "Song Guo and Victor Leung and Oliver Yang",

year = "2006",

month = dec,

day = "1",

doi = "10.1145/1143549.1143633",

language = "English",

isbn = "1595933069",

volume = "2006",

pages = "419--424",

booktitle = "IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference",

note = "IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference ; Conference date: 03-07-2006 Through 06-07-2006",

}

Guo, S, Leung, V & Yang, O 2006, A scalable distributed multicast algorithm for lifetime maximization in large-scale resource-limited multihop wireless networks. in IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference. vol. 2006, pp. 419-424, IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference, Vancouver, BC, Canada, 3/07/06. https://doi.org/10.1145/1143549.1143633

A scalable distributed multicast algorithm for lifetime maximization in large-scale resource-limited multihop wireless networks. / Guo, Song; Leung, Victor; Yang, Oliver.
IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference. Vol. 2006 2006. p. 419-424.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - A scalable distributed multicast algorithm for lifetime maximization in large-scale resource-limited multihop wireless networks

AU - Guo, Song

AU - Leung, Victor

AU - Yang, Oliver

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We consider the problem of maximizing the multicast lifetime in multihop wireless networks in which each node is static and has limited energy, bandwidth, memory, and computation capabilities. Unlike most multicast algorithms that use centralized greedy algorithms, our algorithm can construct a global optimal maximum lifetime multicast tree in a distributed manner. It has a low complexity of O(λu) for both memory and computation requirements at each node u, where λu, is the degree of node u. The simulation results have shown that it has an expected linear communication complexity under different network sizes and multicast group sizes. This means that our distributed algorithm is also scalable in terms of communication overhead and it is very useful for large-scale energy and bandwidth constrained multihop wireless networks like sensor networks..

AB - We consider the problem of maximizing the multicast lifetime in multihop wireless networks in which each node is static and has limited energy, bandwidth, memory, and computation capabilities. Unlike most multicast algorithms that use centralized greedy algorithms, our algorithm can construct a global optimal maximum lifetime multicast tree in a distributed manner. It has a low complexity of O(λu) for both memory and computation requirements at each node u, where λu, is the degree of node u. The simulation results have shown that it has an expected linear communication complexity under different network sizes and multicast group sizes. This means that our distributed algorithm is also scalable in terms of communication overhead and it is very useful for large-scale energy and bandwidth constrained multihop wireless networks like sensor networks..

KW - Distributed algorithm

KW - Maximum lifetime multicast

KW - Multihop wireless network

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

U2 - 10.1145/1143549.1143633

DO - 10.1145/1143549.1143633

M3 - Conference article published in proceeding or book

SN - 1595933069

SN - 9781595933065

VL - 2006

SP - 419

EP - 424

BT - IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference

T2 - IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference

Y2 - 3 July 2006 through 6 July 2006

ER -

A scalable distributed multicast algorithm for lifetime maximization in large-scale resource-limited multihop wireless networks

Abstract

Conference

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this