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


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


    題名: Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
    作者: Jang, Hung-chin
    張宏慶
    貢獻者: 資科系
    關鍵詞: Wireless Mesh Network;Interference Reduction;Voronoi Diagram;Delaunay Triangulation Algorithm
    日期: 2010
    上傳時間: 2015-06-17 15:02:37 (UTC+8)
    摘要: In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mechanisms. Wireless mesh networks usually intensively deploy mesh nodes to deal with the problem of dead spot communication. However, the higher density of nodes deployed, the higher radio interference occurred. This causes significant degradation of system performance. In this paper, we first convert network problems into geometry problems in graph theory, and then solve the interference problem by geometric algorithms. We first define line intersection in a graph to reflect radio interference problem in a wireless mesh network. We then use plan sweep algorithm to find intersection lines, if any; employ Voronoi diagram algorithm to delimit the regions among nodes; use Delaunay Triangulation algorithm to reconstruct the graph in order to minimize the interference among nodes. Finally, we use standard deviation to prune off those longer links (higher interference links) to have a further enhancement. The proposed hybrid solution is proved to be able to significantly reduce interference in a wireless mesh network in O(n log n) time complexity.
    關聯: International Journal on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks , vol. abs/1003.3, no. 1, pp. 62-85
    資料類型: article
    DOI 連結: http://dx.doi.org/10.5121/jgraphhoc.2010.2106
    DOI: 10.5121/jgraphhoc.2010.2106
    顯示於類別:[資訊科學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0310jgraph6.pdf2726KbAdobe PDF21055檢視/開啟


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


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