政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/32656
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113325/144300 (79%)
造訪人次 : 51155210      線上人數 : 835
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/32656


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/32656


    題名: 隨意網路中以價格機制為基礎之效率路徑選擇演算法
    Efficient Routing Path Selection Algorithm based on Pricing Mechanism in Ad Hoc Networks
    作者: 林建圻
    貢獻者: 蔡子傑
    Tsai,Tzu-Chieh
    林建圻
    關鍵詞: 隨意網路
    定價
    路由
    日期: 2006
    上傳時間: 2009-09-17 13:58:01 (UTC+8)
    摘要: 隨著行動通訊技術日漸進步，隨意網路具備不需要事先建設基礎設施、使用者可以自由移動等特性，未來將很有發展潛力。隨意網路亦具有多跳接的特性，通常都必須由別人幫忙轉送封包到達目的地端。想要使隨意網路能夠普及化，必須提供一個良好的動機，讓隨意網路中的使用者彼此互相合作，願意互相幫忙轉送封包。我們根據參考的論文所提出來的虛擬貨幣交易網路，分析網路資源數量與價錢的關係，提出了一個合理的定價機制。同時也結合隨意網路移動的特性，讓使用者選擇效率較高的路由來傳遞封包。最後我們提出了一個簡單的路由協議，結合了價格機制，而能應用於隨意網路中。實驗結果顯示我們的路由協議能夠提昇整體的網路效能。使用此價格機制結合我們提出的路由協議對使用者而言也是最具經濟效益的。
    In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority. Therefore, they are motivated to cooperate in order to support the basic functions of the network. However, the nodes are not willing to forward packets for the benefits of other nodes in civilian applications on mobile ad hoc networks. In view of this, we adopt the “pay for service” model of cooperation, and propose a pricing mechanism combined with routing protocol. The scheme considers users’ benefits and interference effect in wireless networks, and can distribute traffic load more evenly to improve network performance. The simulation results show that our algorithm outperforms other routing protocols. Using our pricing mechanism and routing protocol at the same time can achieve more economical efficiency.
    參考文獻: [1] Z. J. Haas et al., “Guest Editorial”, IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Networks, Vol. 17, No. 8, pp. 1329-1332, August 1999.
    [2] Satyabrata Chakrabarti and Amitabh Mishra, “QoS Issues in Ad Hoc Wireless Networks”, IEEE Communications Magazine, Vol. 39, No. 2, pp. 142-148, February 2001.
    [3] Buttyan, L. and Hubaux, J.P., “Enforcing Service Availability in Mobile Ad-Hoc WANs”, IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing, August 2000
    [4] M. Conti, E. Gregori, and G. Maselli, "Cooperation Issues in Mobile Ad Hoc Networks", IEEE ICDCS Workshops, Tokyo, Japan, March 2004.
    [5] Buttyan, L. and Hubaux, J.P., “Stimulating Cooperation in Self-organizing Mobile Ad Hoc Networks” ACM/Kluwer Mobile Networks and Applications, vol. 8, no. 5, pp.579-592, October 2003.
    [6] A. Pfitzmann, B. Pfitzmann and M. Waidner, “Trusting mobile user devices and security modules”, IEEE Computer, February 1997
    [7] Zhong, S., Yang, R., Chen, J., “Sprite : A Simple, Cheat- Proof, Credit-Based System for Mobile Ad-hoc Networks”, IEEE INFOCOM 2003, San Francisco, March, 2003.
    [8] Crowcroft, J., Gibbens, R., Kelly, F., and Ostring, S., " Modelling incentives for collaboration in Mobile Ad Hoc Networks", Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), March 2003.
    [9] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks”, in Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking, pp.255–265, 2000.
    [10] Charles E. Perkins and Pravin Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile computers”, in Proceedings of the SIGCOMM ’94 Conference on Communications Architectures, Protocols and Applications, pp. 234-244, August 1994. A revised version of the paper is available from http://www.cs.umd.edu/projects/mcml/papers/Sigcomm94.ps.
    [11] Padmini Misra, “Routing Protocols for Ad Hoc Mobile Wireless Networks”, http://www.cse.ohio-state.edu/~jain/cis788-99/adhoc_routing/index.html, 1999.
    [12] Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu and Jorjeta Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, in Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom ’98), Dallas, Texas, USA. October 25 – 30, 1998.
    [13] Charles E. Perkins, Elizabeth M. Royer and Samir R. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing”, IETF RFC3561, http://www.ietf.org/rfc/rfc3561.txt, July 2003.
    [14] David B. Johnson, Davis A. Maltz and Yih-Chun Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)”, IETF Internet-Draft, http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-10.txt, July 2004.
    [15] 周大慶、沈大白、張大成、敬永康、柯瓊鳳, “風險管理新標竿-風險值理論與應用”, 台北:智勝文化事業有限公司
    [16] http://www.isi.edu/nsnam/ns/
    描述: 碩士
    國立政治大學
    資訊科學學系
    93753016
    95
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0093753016
    資料類型: thesis
    顯示於類別:[資訊科學系] 學位論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    75301601.pdf45KbAdobe PDF2728檢視/開啟
    75301602.pdf11KbAdobe PDF2670檢視/開啟
    75301603.pdf64KbAdobe PDF2709檢視/開啟
    75301604.pdf17KbAdobe PDF2699檢視/開啟
    75301605.pdf45KbAdobe PDF2826檢視/開啟
    75301606.pdf130KbAdobe PDF2795檢視/開啟
    75301607.pdf236KbAdobe PDF2797檢視/開啟
    75301608.pdf153KbAdobe PDF2715檢視/開啟
    75301609.pdf90KbAdobe PDF2706檢視/開啟
    75301610.pdf117KbAdobe PDF21571檢視/開啟
    75301611.pdf87KbAdobe PDF2927檢視/開啟
    75301612.pdf12KbAdobe PDF2626檢視/開啟
    75301613.pdf44KbAdobe PDF2732檢視/開啟


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


    社群 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 ©   - 回饋