簡易檢索 / 詳目顯示

研究生: 吳愷儒
Wu, Kai-Ju
論文名稱: 基於賽局理論之著色演算法解決無線人體區域網路之頻道分配
Coloring-Based Channel Allocation for Inter-WBANs: A Game Theory Approach
指導教授: 許健平
Sheu, Jang-Ping
口試委員: 王志宇
Wang, Chih-Yu
洪樂文
Hong, Yao-Win
學位類別: 碩士
Master
系所名稱:
論文出版年: 2018
畢業學年度: 107
語文別: 英文
論文頁數: 37
中文關鍵詞: 無線人體區域網路頻道分配著色問題賽局理論
外文關鍵詞: WBAN, Channel Allocation, Graph Coloring, Game Theory
相關次數: 點閱:4下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在本篇論文中,我們探討了數個無線人體區域網路(WBAN)存在同一地點的問題。此共存問題會造成同頻道間的干擾並且導致網路性能的下降。例如:電量的消耗或是封包碰撞。我們將頻道分配的問題轉化成著色問題去避免同頻道間的干擾。本篇論文的目標是提高同頻道間的再利用並且確保網路中有最多的WBAN被分配到頻道。我們提出了一個分散式的著色演算法,稱之為DTIC。DTIC使用了不完全著色的概念並考慮了兩步鄰居之間的相關頻道分配來達成我們的目標。除此之外,我們設計了一個傳輸協定,此協定能避免WBAN之間互相溝通時產生的封包碰撞。根據模擬結果顯示,與其他方法相比,我們的演算法在同頻道之間有較高的再利用。


    In this thesis, we address the coexistence problem of Wireless Body area network (WBAN), which may cause severe co-channel interference and leads to performance degradation such as energy waste and packet collision. We formulate the channel allocation problem as a graph coloring problem to avoid the co-channel interference. Our main objective is to increase the co-channel reuse and allocate channels to as many WBANs as possible. We propose a distributed two-hop incomplete coloring (DTIC) algorithm based on game theoretic perspective to solve the graph coloring problem. The DTIC algorithm uses incomplete coloring and two-hop dependencies to accomplish our goal. In addition, we design a message passing protocol to avoid the packet collision when each WBAN communicates with each other. Simulation results show that our algorithm has better co-channel reuse than previous work.

    封面 摘要 目錄 I. Introduction.....1 II. Related Work.....4 III. A Distributed Two-Hop Incomplete Coloring (DTIC) Algorithm .....7 3.1 Network Environment and Modeling.....7 3.1.1 Graph Coloring Problem Modeling.....7 3.1.2 Graph Transformation.....9 3.2 Distributed Message Passing Protocol.....11 3.2.1 Random Access Period.....11 3.2.2 Scheduled Access Period.....12 3.3 Game Theory.....13 3.4 Nash Equilibrium.....22 IV. Performance Evaluation.....25 4.1 Number of Coloring Rounds.....26 4.2 VPC and Number of Uncolored Nodes.....27 4.3 Throughput.....31 V. Conclusion.....34 References.....35

    [1] M. Chen, S. Gonzalez, A. Vasilakos, H. Cao, and V.C. Leung, “Body Area Networks: A Survey,” Mobile Networks and Applications, vol. 16, no. 2, pp. 171-193, 2011.
    [2] S. Movassaghi, M. Abolhasan, J. Lipman, D. Smith, and A. Jamalipour. “Wireless Body Area Networks: A Survey,” IEEE Communications Surveys and Tutorials, vol. 16, no3 3, pp. 1658-1686, 2014.
    [3] “IEEE Standard for Local and Metropolitan Area Networks - Part 15.6: Wireless Body Area Networks,” IEEE Std 802.15.6-2012, Feb. 2012.
    [4] B. Zhen, M. Patel, S. Lee, E. Won, and A. Astrin, “Tg6 Technical Requirements Document (TRD),” IEEE P802.15-08-0644-09-0006, 2008.
    [5] L. Tan, Z. Feng, W. Li, Z. Jing, and T. Gulliver, “Graph Coloring Based Spectrum Allocation for Femtocell Downlink Interference Mitigation,” in IEEE Wireless Communications and Networking Conference (WCNC), pp. 1248–1252, 2011.
    [6] R. Chang, Z. Tao, J. Zhang, and C.-C. Kuo, “A Graph Approach to Dynamic Fractional Frequency Reuse (FFR) in Multi-Cell OFDMA networks,” in IEEE International Conference on Communications (ICC), pp. 1–6, 2009.
    [7] E. Pateromichelakis, M. Shariat, A. ul Quddus, and R. Tafazolli, “On the Evolution of Multi-Cell Scheduling in 3GPP LTE / LTE-A,” IEEE Communications Surveys Tutorials, vol. 15, no. 2, pp. 701–717, 2013.
    [8] A. Mishra, S. Banerjee, and W. Arbaugh, “Weighted Coloring Based Channel Assignment for WLANs,” SIGMOBILE Mob. Comput. Commun. Rev., vol. 9, no. 3, pp. 19–31, 2005.
    [9] S. Ramanathan, “A Unified Framework and Algorithm for Channel Assignment in Wireless Networks,” Wireless Networks, vol. 5, no. 2, pp. 81-94, Mar. 1999.
    [10] W. Wang and X. Liu, “List-Coloring Based Channel Allocation for Open-Spectrum Wireless Networks,” in Proc. of IEEE VTC, pp. 690–694, 2005.
    [11] H. Zheng and C. Peng, “Collaboration and Fairness in Opportunistic Spectrum Access,” in Proc. IEEE Int. Conf. Communications, pp. 3132–3136, 2005.
    [12] C. Peng, H. Zheng, and B. Y. Zhao, “Utilization and Fairness in Spectrum Assignment for Opportunistic Spectrum Access,” ACM Mobile Networks and Applications (MONET), vol. 11, no. 4, pp. 555–76, 2006.
    [13] S. H. Cheng and C. Y. Huang, “Coloring-Based Inter-WBAN Scheduling for Mobile Wireless Body Area Networks,” IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 2, pp. 250–259, 2013.
    [14] N. Nie and C. Comaniciu, “Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks,” Mobile Netw. Applicat., vol. 11, no. 6, pp. 779–797, 2006.
    [15] J.P. Sheu, Z. X. Wu, C. Ma, and R. B. Jagadeesha, “Interference-Aware Channel Allocation Algorithm with Game Theoretic Approach for Cognitive Radio Networks,” Proc. of 20th IEEE Intl. Conference on Parallel & Distributed Systems (ICPADS), pp. 41-46, 2014.
    [16] S. Movassaghi, M. Abolhasan, and D. Smith, “Smart Spectrum Allocation for Interference Mitigation in Wireless Body Area Networks,” in Proceedings of IEEE ICC, 2014.
    [17] G.-T. Chen, W.-T. Chen, and S.-H. Shen, “2L-Mac: A Mac Protocol with Two-Layer Interference Mitigation in Wireless Body Area Networks for Medical Applications,” in Communications (ICC), 2014 IEEE International Conference on, pp. 3523–3528, 2014.
    [18] S. Misra, and S. Sarkar, “Priority-Based Time-Slot Allocation in Wireless Body Area Networks During Medical Emergency Situations: An Evolutionary Game-Theoretic Perspective,” IEEE Trans. J. Biomed. Health Inform., vol. 19, no. 2, pp. 541–548, 2015.
    [19] P. N. Panagopoulou and P. G. Spirakis, “A Game Theoretic Approach for Efficient Graph Coloring,” International Symposium on Algorithms and Computation, pp. 183–195, 2008.
    [20] I. Chatzigiannakis, C. Koninis, P. N. Panagopoulou, and P. G. Spirakis, “Distributed Game-Theoretic Vertex Coloring,” International Conference On Principles of Distributed Systems, pp. 103–118, 2010.
    [21] M. Kearns, M. L. Littman, and S. Singh, “Graphical Models for Game Theory,” in Proc. 17th Conf. Uncertainty Artif. Intell., pp. 253–260, 2001.
    [22] V. Rajendran, K. Obraczka, J. J. Garcia-Luna-Aceves, “Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks,” Wireless networks, vol. 12, no. 1, pp. 63–78, 2006.
    [23] Bao, L., & Garcia-Luna-Aceves, J. J. (2002, November). “Hybrid channel access scheduling in ad hoc networks,” Proc. IEEE Tenth International Conference on Network Protocols (ICNP), pp. 46–57, 2002.
    [24] K. M. Chandy, and L. Lamport, “Distributed Snapshots: Determining Global States of Distributed Systems,” ACM Transactions on Computer Systems (TOCS), vol. 3, pp. 63-75, 1985.
    [25] L. Bao and J. J. Garcia-Luna-Aceves. “A New Approach to Channel Access Scheduling for Ad Hoc Networks,” in Proceedings of the 7th annual international conference on Mobile computing and networking, pp. 210–221, 2001.
    [26] D. Monderer and L. Shapley, “Potential Games,” Games Economic Behavior, vol. 14, pp. 124–143, 1996.
    [27] Q. D. Lã, Y. H. Chew, B. H. Soong, “Potential Game Theory: Applications in Radio Resource Allocation,” Springer, 2016.
    [28] L. D. Moura, and N. Bjørner, “Z3: An efficient SMT solver,” International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 337–340, 2008.
    [29] V. Tolety, “Load Reduction in Ad Hoc Networks Using Mobile Servers,,” 1999.

    QR CODE