Efficient multicast routing in wireless ATM networks

doi:10.1109/GLOCOM.1998.776883

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 會議論文 > Item 987654321/38780

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/38780

題名:	Efficient multicast routing in wireless ATM networks
作者:	Fang-Tsou, Chao-tsong;Sheu, Shiann-tsong;Hsu, Wu-hsiao;Hsiao, Ming-ching
貢獻者:	淡江大學資訊工程學系;淡江大學電機工程學系
日期:	1998-11-08
上傳時間:	2010-04-15 10:45:38 (UTC+8)
出版者:	Institute of Electrical and Electronics Engineers (IEEE)
摘要:	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.
關聯:	Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE (Volume:2 ), pp.1024-1029
DOI:	10.1109/GLOCOM.1998.776883
顯示於類別:	[資訊工程學系暨研究所] 會議論文 [電機工程學系暨研究所] 會議論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
0780349849_2p1024-1029.pdf		358Kb	Adobe PDF	558	檢視/開啟
index.html		0Kb	HTML	332	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....