English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49378/84106 (59%)
造訪人次 : 7382355      線上人數 : 65
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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.pdf358KbAdobe PDF491檢視/開啟
    index.html0KbHTML125檢視/開啟

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

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋