Efficient multicast routing in wireless ATM networks

Author

Chao-Tsong Fang Tsou ; Sheu, Shiann-Tsong ; Hsu, Wu-Hsiao ; Hsiao, Ming-Ching

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Tamkang Univ., Tamsui, Taiwan

Volume

2

fYear

1998

fDate

1998

Firstpage

1024

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, the network is modeled as a graph with nodes denoting the BS and edges representing 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 moving 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 that 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

Keywords

asynchronous transfer mode; graph theory; mobile radio; multicast communication; telecommunication network routing; trees (mathematics); coverage areas; fixed base station; graph; minimal-spanning tree; mobile user; multicast routing algorithm; probability-based multicast tree algorithm; wireless ATM networks; Asynchronous transfer mode; Costs; Heuristic algorithms; Intelligent networks; Multicast algorithms; Personal communication networks; Protocols; Roaming; Routing; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE

Conference_Location

Sydney,NSW

Print_ISBN

0-7803-4984-9

Type

conf

DOI

10.1109/GLOCOM.1998.776883

Filename

776883