A Computationally Efficient Energy-Aware Multicast Tree Recovery Algorithm for Ad Hoc Network
Summary :
Multicasting is an efficient communication tool for use in multi-point applications such as conferencing and information distribution. In ad hoc networks, node mobility causes frequent changes of network topology, and re-construction of the multicast tree in an efficient and effective manner becomes a critical issues. In case of link breakage, most of the multicast tree construction protocols available presently require either a total re-build of the tree or to reconnect a disjoined node back to the multicast tree via the shortest path which may disrupt the optimising factors, such as energy consumption, delay or cost, used in the building of the original tree. In this paper, we introduce a computationally efficient recovery algorithm which will also minimise the power consumption on the tree.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E86-B No.9 pp.2701-2708
- Publication Date
- 2003/09/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jim M. NG, Sadagopan SRIDHARAN, Chor Ping LOW, "A Computationally Efficient Energy-Aware Multicast Tree Recovery Algorithm for Ad Hoc Network" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 9, pp. 2701-2708, September 2003, doi: .
Abstract: Multicasting is an efficient communication tool for use in multi-point applications such as conferencing and information distribution. In ad hoc networks, node mobility causes frequent changes of network topology, and re-construction of the multicast tree in an efficient and effective manner becomes a critical issues. In case of link breakage, most of the multicast tree construction protocols available presently require either a total re-build of the tree or to reconnect a disjoined node back to the multicast tree via the shortest path which may disrupt the optimising factors, such as energy consumption, delay or cost, used in the building of the original tree. In this paper, we introduce a computationally efficient recovery algorithm which will also minimise the power consumption on the tree.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_9_2701/_p
Copy
@ARTICLE{e86-b_9_2701,
author={Jim M. NG, Sadagopan SRIDHARAN, Chor Ping LOW, },
journal={IEICE TRANSACTIONS on Communications},
title={A Computationally Efficient Energy-Aware Multicast Tree Recovery Algorithm for Ad Hoc Network},
year={2003},
volume={E86-B},
number={9},
pages={2701-2708},
abstract={Multicasting is an efficient communication tool for use in multi-point applications such as conferencing and information distribution. In ad hoc networks, node mobility causes frequent changes of network topology, and re-construction of the multicast tree in an efficient and effective manner becomes a critical issues. In case of link breakage, most of the multicast tree construction protocols available presently require either a total re-build of the tree or to reconnect a disjoined node back to the multicast tree via the shortest path which may disrupt the optimising factors, such as energy consumption, delay or cost, used in the building of the original tree. In this paper, we introduce a computationally efficient recovery algorithm which will also minimise the power consumption on the tree.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Computationally Efficient Energy-Aware Multicast Tree Recovery Algorithm for Ad Hoc Network
T2 - IEICE TRANSACTIONS on Communications
SP - 2701
EP - 2708
AU - Jim M. NG
AU - Sadagopan SRIDHARAN
AU - Chor Ping LOW
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2003
AB - Multicasting is an efficient communication tool for use in multi-point applications such as conferencing and information distribution. In ad hoc networks, node mobility causes frequent changes of network topology, and re-construction of the multicast tree in an efficient and effective manner becomes a critical issues. In case of link breakage, most of the multicast tree construction protocols available presently require either a total re-build of the tree or to reconnect a disjoined node back to the multicast tree via the shortest path which may disrupt the optimising factors, such as energy consumption, delay or cost, used in the building of the original tree. In this paper, we introduce a computationally efficient recovery algorithm which will also minimise the power consumption on the tree.
ER -
English
