English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113313/144292 (79%)
Visitors : 50918641      Online Users : 342
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/32699
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/32699


    Title: 多網卡無線網狀網路下支援點對點串流的品質感知多重骨幹建置設計
    Quality-Aware Multiple Backbone Construction on Multi-interface Wireless Mesh Networks for P2P Streaming
    Authors: 陳維鴻
    Chen, Wei Hung
    Contributors: 蔡子傑
    陳維鴻
    Chen, Wei Hung
    Keywords: 無線網狀網路
    路由
    點對點影音傳輸
    史坦納樹
    多頻道
    WMNs
    routing
    p2p streaming
    steiner tree
    multi-channel
    Date: 2008
    Issue Date: 2009-09-17 14:05:05 (UTC+8)
    Abstract: 無線網狀網路(WMNs)為目前熱門的廣域無線網路接取技術。使用者可以透過WMNs隨時在各處使用即時影音播放的服務。相較於傳統的主從式架構,低成本且容易建置的點對點架構更適用於影音串流的應用;在進行即時影音播放的時候,影音播放的品質便為相當重要的目標。因為多媒體應用服務對於延遲及網路傳輸效能相當敏感,且WMNs的傳輸過程中常會面臨同頻道干擾的問題而使得傳輸的效能銳減,當每個網路節點都具有多張無線網路卡時,如何善用WMNs多頻道傳輸的特性提升效能更是顯得特別重要。在本篇論文中,我們利用WMNs多頻道傳輸的特性進行多媒體群播傳輸,參考史坦納樹的概念來改善現有的MAODV路由演算法,以傳輸品質較佳的鏈結改良原本尋找最小跳躍數路徑的方式,建立兩棵完全互斥的群播樹作為點對點傳輸的骨幹網路,並以MDC的概念將影像串流編碼成兩份獨立的子串流分別經由不同的群播樹傳輸。經實驗評估,我們的方法在網路負載較高的環境下能有效的降低延遲並提高整體系統的效能。
    In WMNs, users can enjoy the real-time video streaming service anytime and anywhere through the services. Compared to the client/server model, P2P approaches is more suitable for video streaming applications because of its low cost and easy deployment. But when using the real-time multimedia service in WMNs, the multimedia applications are very sensitive to delay time and the performance of packets transmission. And the performance is significantly influenced by the co-channel interference, so that it is important to know how to transmit by multi-channel to enhance the performance. In our approach, we choose the better quality links for routing instead of the minimum hop-count path in MAODV. Then we distribute the video streaming to receivers by multicast in multi-channel WMNs, and refer to the Steiner tree concept to modify the MAODV routing protocol to construct two disjoint multicast trees as the backbone for the P2P structure. Therefore, we can adopt the MDC scheme to encode the video into two independent sub-streams and transmit separately along these trees. Experiment results show that in higher network traffic load environment, our scheme is more effective to reduce the latency and improve overall system performance.
    Reference: [1] N. Nandiraju, D. Nandiraju, L. Santhanam, B. He, J. Wang, and D. P. Agrawal, ”Wireless mesh networks: current challenges and future directions of web-in-the-sky,” IEEE Wireless Communications, vol. 14, no. 4, pp. 79-89, Aug 2007.
    [2] Y.Tu, J.Sun, M.Hefeeda, and S.Prabhakar, “An analytical study of peer-to-peer media streaming systems.” ACM TOMCCAP, 1:354–376, Nov.2005.
    [3] Dongyan Xu, Mohamed Hefeeda, Susanne Hambrusch, and Bharat Bhargava, “On peer-to-peer media streaming,” IEEE Conference on Distributed Computing and Systems, July 2002, pp. 363–371.
    [4] G. Zeng, B. Wang, Y. Ding, L. Xiao, and M. Mutka, “Multicast algorithms for multi-channel wireless mesh networks,” IEEE ICNP, 2007.
    [5] U.T. Nguyen, “On Multicast Routing in Wireless Mesh Networks,” Elsevier Journal of Computer Communications, Special Issue on Resource Management and Routing in Wireless Mesh Networks, vol. 31, no. 7, May 2008, pp. 1385-1399
    [6] P.M. Ruiz and A.F. Gomez-Skarmeta. Approximating optimal multicast trees in wireless multihop networks. Proceedings of the IEEE International Symposium on Computers and Communications (ISCC), La Manga del Mar Menor, Spain, June 2005.
    [7] V.K. Goyal. “Multiple description coding: Compression meets the network,” IEEE Signal Processing Magazine, pages 74–93, September 2001.
    [8] J. Apostolopoulos and S. Wee, “Unbalanced multiple description video communication using path diversity,” Proc. Int’l Conf. Image Processing. Thessaloniki, Greece: IEEE, Oct. 2001.
    [9] C.E. Perkins and E.M. Royer. Ad-hoc on-demand distance vector routing. Workshop on Mobile Computing and Systems Applications, 1999.
    [10] Elizabeth M. Royer and Charles E. Perkins. Multicast ad hoc on demand distance vector (maodv) routing. IETF Internet Draft. draft-ietf-manet-maodv-00.txt, July, 2000.
    [11] E.M. Royer and C.E. Perkins, “Multicast operation of the ad–hoc on–demand distance vector routing protocol,” Proc. ACM Intern. Conf. on Mobile Comp. and Netw. (MobiCom), (Seattle, WA), 1999.
    [12] H.I. Chee-Onn CHOW, "Multiple Tree Multicast Ad Hoc On-Demand Distance Vector (MT-MAODV) Routing Protocol for Video Multicast over Mobile Ad Hoc Networks," IEICE TRANS. COMMUN., vol. E91-B, pp. 428-436, 2008.
    [13] D. S. J. D. Couto, D. Aguayo, J. Bicket, and R. Morris, "A High Throughput Path Metric for MultiHop Wireless Routing," MobiCom `03, San Diego, California, USA, 2003.
    [14] R. Draves, J. Padhye, and B. Zill, “Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks,” ACM Annual Int’l. Conf. Mobile Comp. and Net. (MOBICOM), 2004, pp. 114–28.
    [15] B.Y. Wu and K. Chao, Spanning Trees and Optimization Problems. CRC Press, 2003.
    [16] R. Novak, J. Ruge, and G. Kandus. Steiner tree based distributed multicast routing in networks. Steiner Trees in Industries, 8(5):1–25, 2000.
    [17] R. Novak, J. Rugelj, and G. Kandus. A note on distributed multicast routing in point-to-point networks. Comput. Oper. Res., 28:1149–1164, 2001.
    [18] “The network simulator - ns2”, http://www.isi.edu/nsnam/ns.
    [19] Y. Zhu and T. Kunz, “MAODV Implementation for NS-2.26,” Tech Report SCE-04-01, Department of Systems and Computer Engineering, Carleton University, Canada, January 2004.
    [20] R. Agüero Calvo and J. Pérez Campo. Adding multiple interfaces support in ns-2. Technical report, University of Cantabria, 2007.
    Description: 碩士
    國立政治大學
    資訊科學學系
    95753022
    97
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0095753022
    Data Type: thesis
    DOI 連結: http://dx.doi.org/10.1109/MOBHOC.2009.5336934
    DOI: 10.1109/MOBHOC.2009.5336934
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    302201.pdf97KbAdobe PDF2856View/Open
    302202.pdf62KbAdobe PDF2730View/Open
    302203.pdf118KbAdobe PDF2994View/Open
    302204.pdf88KbAdobe PDF2823View/Open
    302205.pdf172KbAdobe PDF2905View/Open
    302206.pdf361KbAdobe PDF2963View/Open
    302207.pdf1123KbAdobe PDF2993View/Open
    302208.pdf413KbAdobe PDF21115View/Open
    302209.pdf62KbAdobe PDF2795View/Open
    302210.pdf67KbAdobe PDF21104View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback