Efficient multicast routing in wireless ATM networks

Chao Tsong FangTsou; Shiann Tsong Sheu; Wu Hsiao Hsu; Ming Ching Hsiao

Efficient multicast routing in wireless ATM networks

Chao Tsong FangTsou^*
, Shiann Tsong Sheu
, Wu Hsiao Hsu
, Ming Ching Hsiao

^*Corresponding author for this work

Tamkang University

Research output: Contribution to conference › Conference Paper › peer-review

Abstract

This paper proposes an algorithm, called Probability-Based Multicast Tree (PBMT) algorithm, for multicast routing in wireless ATM networks. The PBMT is established from a fixed Base Station (BS) by several steps. First, network is modeled as a graph with nodes denote the BS and edges represent links between BS. An edge is added into any two nodes when their coverage areas overlap each other. Then, the degree of each node in the graph is computed. Based on the computed degree of each node, the probability of a mobile user moves to a new node can be determined. In order to identify the importance of each node, the cost of the edge is weighed based on the probabilities of corresponding nodes. Finally, a node with maximal degree is selected repeatedly until a minimal-spanning tree is formed. Nodes do not belong to the multicast members are pruned. Simulation has been done to compare the performance analysis by our algorithm with these of other algorithms.

Original language	English
Pages	1024-1029
Number of pages	6
State	Published - 1998
Externally published	Yes
Event	Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration - Sydney, NSW, Aust Duration: 08 11 1998 → 12 11 1998

Conference

Conference	Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration
City	Sydney, NSW, Aust
Period	08/11/98 → 12/11/98

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Cite this

@conference{37caa81e97904ada97e4a4272b6ef333,

title = "Efficient multicast routing in wireless ATM networks",

abstract = "This paper proposes an algorithm, called Probability-Based Multicast Tree (PBMT) algorithm, for multicast routing in wireless ATM networks. The PBMT is established from a fixed Base Station (BS) by several steps. First, network is modeled as a graph with nodes denote the BS and edges represent links between BS. An edge is added into any two nodes when their coverage areas overlap each other. Then, the degree of each node in the graph is computed. Based on the computed degree of each node, the probability of a mobile user moves to a new node can be determined. In order to identify the importance of each node, the cost of the edge is weighed based on the probabilities of corresponding nodes. Finally, a node with maximal degree is selected repeatedly until a minimal-spanning tree is formed. Nodes do not belong to the multicast members are pruned. Simulation has been done to compare the performance analysis by our algorithm with these of other algorithms.",

author = "FangTsou, \{Chao Tsong\} and Sheu, \{Shiann Tsong\} and Hsu, \{Wu Hsiao\} and Hsiao, \{Ming Ching\}",

year = "1998",

language = "英语",

pages = "1024--1029",

note = "Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration ; Conference date: 08-11-1998 Through 12-11-1998",

}

TY - CONF

T1 - Efficient multicast routing in wireless ATM networks

AU - FangTsou, Chao Tsong

AU - Sheu, Shiann Tsong

AU - Hsu, Wu Hsiao

AU - Hsiao, Ming Ching

PY - 1998

Y1 - 1998

N2 - This paper proposes an algorithm, called Probability-Based Multicast Tree (PBMT) algorithm, for multicast routing in wireless ATM networks. The PBMT is established from a fixed Base Station (BS) by several steps. First, network is modeled as a graph with nodes denote the BS and edges represent links between BS. An edge is added into any two nodes when their coverage areas overlap each other. Then, the degree of each node in the graph is computed. Based on the computed degree of each node, the probability of a mobile user moves to a new node can be determined. In order to identify the importance of each node, the cost of the edge is weighed based on the probabilities of corresponding nodes. Finally, a node with maximal degree is selected repeatedly until a minimal-spanning tree is formed. Nodes do not belong to the multicast members are pruned. Simulation has been done to compare the performance analysis by our algorithm with these of other algorithms.

AB - This paper proposes an algorithm, called Probability-Based Multicast Tree (PBMT) algorithm, for multicast routing in wireless ATM networks. The PBMT is established from a fixed Base Station (BS) by several steps. First, network is modeled as a graph with nodes denote the BS and edges represent links between BS. An edge is added into any two nodes when their coverage areas overlap each other. Then, the degree of each node in the graph is computed. Based on the computed degree of each node, the probability of a mobile user moves to a new node can be determined. In order to identify the importance of each node, the cost of the edge is weighed based on the probabilities of corresponding nodes. Finally, a node with maximal degree is selected repeatedly until a minimal-spanning tree is formed. Nodes do not belong to the multicast members are pruned. Simulation has been done to compare the performance analysis by our algorithm with these of other algorithms.

UR - https://www.scopus.com/pages/publications/0032274406

M3 - 论文

AN - SCOPUS:0032274406

SP - 1024

EP - 1029

T2 - Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration

Y2 - 8 November 1998 through 12 November 1998

ER -

Efficient multicast routing in wireless ATM networks

Abstract

Conference

UN SDGs

Other files and links

Fingerprint

Cite this