跳到主要內容

簡易檢索 / 詳目顯示

回結果列表
研究生： 馮至正
Zhi-zheng Ferng
論文名稱： 在無線隨意網路下使用遊戲理論之路由協定
A Routing Protocol using Game Theory in Wireless Ad Hoc Networks
指導教授： 吳中實
Jung-shyr Wu
口試委員:
學位類別： 碩士
Master
系所名稱： 資訊電機學院 - 通訊工程學系
Department of Communication Engineering
畢業學年度： 95
語文別： 中文
論文頁數： 42
中文關鍵詞： 無線隨意網路 、遊戲理論 、路由協定
外文關鍵詞： wireless ad hoc network, game theory, routing prot
相關次數： 點閱：12  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 無線網路與行動運算為目前蓬勃發展的學門，在第四代行動通訊發展中，隨意網路以及其他無線網路與固定式的Internet架構最後終將結合在一起。有著易於維護，靈活不需固定基礎設備，具有自我架構與管理能力以及建構成本低廉的無線隨意網路仍然將占有一席之地，並持續開發新的商業化應用。
    對於自主性甚高的隨意網路，我們提出一個將遊戲理論應用在隨意網路路由的路由協定。由各自節點實際的需求來訂出路由成本，並以VCG機制來計算出最小成本路徑。

    Wireless networks and mobile computing today has become a rising branch of discipline. In the development of the 4th generation mobile communication, mobile ad hoc networks, infrastructure wireless networks, and fixed internet framework will eventually get united. Wireless ad hoc networks with easy maintenance, flexibility, self-organization and management capabilities, and low cost properties will still play a great role and do continued development of new commercial applications.
    With the highly independent ad hoc networks, we propose a routing protocol using game theory applied to the routing. The cost will be set by the respective nodes and we compute the least-cost path by using VCG mechanism.

    目錄 IV 表目錄 VII 圖目錄 VIII 第一章 序論 1 1.1 研究背景 1 1.2 研究動機 3 1.3 論文架構 4 第二章 相關背景及研究 5 2.1 隨意網路 5 2.1.1 隨意網路定義 5 2.1.2 隨意網路的歷史與發展現況 5 2.1.3 隨意網路路由 6 2.2 遊戲理論 9 2.2.1 賽局定義 10 2.2.2 合作賽局 11 2.2.3 非合作賽局 11 2.2.4 均衡概念與納許均衡(Nash Equilibrium) 13 2.2.5 Vickrey拍賣 14 2.3 使用遊戲理論之隨意網路轉送機制 14 2.3.1 偵測式激勵方式(Detection-based Incentive Approach) 15 2.3.2 刺激式激勵方式(Motivation-based Incentive Approach) 16 2.3.3 Vickrey-Clarke-Groves(VCG)機制 17 第三章 使用遊戲理論之路由協定 18 3.1 系統模型 18 3.1.1 網路模型 18 3.1.2 路由賽局(Routing Game) 18 3.1.3 路由協定設計 19 3.1.4 定價機制 20 3.2 路由演算法 23 3.3.1 尋找路徑 23 3.3.2 資料傳輸 24 第四章 實驗模擬及數據分析 25 4.1 系統架構 25 4.2 數據分析 27 Source-Destination Pairs數量與行動性對網路效能之比較 28 第五章 結論與未來發展 38 5.1 結論 38 5.2 未來發展 38 參考文獻 40

    [1] N. Abramsson, “The ALOHA system-another alternative for computer communications,” Proc. of AFIPS Conf., pp. 37:695–702, 1970.
    [2] IEEE STD. 802.11. Wireless LAN medium access control (MAC) and physical layer (PHY) specifications. 1999.
    [3] J. Macker and S. Corson, “Mobile Ad Hoc Networks (MANET),” IETF WG Charter., http://www.ietf.org/html.charters/manet-charter.html, 1997.
    [4] E. Royer and C.-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Wireless Networks,” IEEE Personal Communication, pp. 46–55, Apr. 1999.
    [5] C. E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," Computer Communication.Rev., pp. 234-44, Oct. 1994.
    [6] C.-C. Chiang, "Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel," Proceeding of IEEE SlCON ''97, pp. 197-211, Apr. 1997.
    [7] S. Murthy J.J. Garcia-Luna-Aceves, “A routing protocol for packet radio networks,” in Proceedings of the First Annual ACM International Conference on Mobile Computing and Networking, Berkeley, CA, pp. 86–95, 1995.
    [8] C. E. Perkins and E. M. Royer, “Ad Hoc On-demand Distance Vector Routing,” Proc. 2nd IEEE Wksp. Mobile Comp. Sys. And Apps., pp.90-100, Feb., 1999.
    [9] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” T. Imielinski and H. Korth, Eds. Mobile Computing, Ch. 5, Kluwer, 1996.
    [10] M.S. Corson and A. Ephremides,” A distributed routing algorithm for mobile wireless networks,” ACM/Baltzer Wireless Networks 1 1, pp. 61–81, 1995.
    [11] V. Park and M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proceeding of INFOCOM ’97, 1997.
    [12] C-K. Toh, "Associativity-Based Routing for Ad-Hoc Mobile Networks,” Wireless Personal Communications, vol. 4, no. 2, pp. 1-36, Mar. 1997.
    [13] R. Dube et al., "Signal Stability based Adaptive Routing (SA) for Ad-Hoc Mobile Networks, " IEEE Personal Communications, pp. 36-45, Feb. 1997.
    [14] Haas, Z.J., "A New Routing Protocol for the Reconfigurable Wireless Networks," ICUPC''97, San Diego, CA, Oct. 12, 1997.
    [15] John Von Neumann and Oskar Morgenstern, Theory Of Games And Economic Behavior. Princeton University Press, May 1980.
    [16] Nash, J. “Equilibrium points in n-person games,” Proc. of the national academy of sciences, pp. 48–49, 1950.
    [17] R. Molva, Core: A COllaborative REputation mechanism to enforce node cooperation in Mobile Ad Hoc Networks, Institute EurecomResearch Report RR-02-062 , December 2001
    [18] S. Buchegger and J.Y. Le Boudec, “Performance analysis of the CONFIDANT protocol: cooperation of nodes – fairness in dynamic ad-hoc networks,” Proceedings of ACM MobiHoc, June 2002
    [19] S. Marti et. al, “Mitigating routing misbehavior in mobile ad hoc networks,” Proceedings of Sixth Annual IEEE/ACM Intl. conference on Mobile Computing and Networking, pp. 255-265 April 2000.
    [20] L. Buttyan and J. P. Hubaux, “Nuglets: A virtual currency to stimulate cooperation in self organized mobile ad-hoc networks,” Swiss Federal Institute of Technology, Lausanne, Switzerland, Report no. DSC /2001/001, January 2001.
    [21] M. Felegyhazi, L. Buttyan and J.-P. Hubaux, “Equilibrium analysis of packet forwarding strategies in wireless ad hoc networks – the static case,” Proceedings of IEEE Personal Wireless Communications, pp. 776-789, September 2003.
    [22] M. Jakobsson, J. P. Hubaux, and L. Buttyan, “A micropayment scheme encouraging collaboration in multi-hop cellular networks,” in Proceedings of Financial Crypto 2003, La Guadeloupe, January 2003.
    [23] B. Lamparter, K. Paul, and D. Westhoff, “Charging Support for Ad Hoc Stub Networks,” Journal of Computer Communication, Special Issue on Internet Pricing and Charging: Algorithms, Technology and Applications, Elsevier Science, summer 2003.
    [24] Vickrey William, “Counterspeculation, Auctions, and Competitive Sealed Tenders,” Journal of Finance, March 1961, 16(1), pp. 8−37.
    [25] E. Clarke, “Multipart pricing of public goods,” Public Choice 8, pp. 19-33, 1971.
    [26] T. Groves, “Incentives in teams,” Econometrica 41, pp. 617-631, 1973.
    [27] The Network Simulator - ns-2 http://www.isi.edu/nsnam/ns/
    [28] E. Hyytiä, P. Lassila, L. Nieminen, J. Virtamo, “Spatial node distribution in the random waypoint mobility model,” submitted for publication, Apr. 2004.

    QR CODE
    :::