English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94586/125118 (76%)
Visitors : 30542565      Online Users : 104
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/75879
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/75879

    Title: Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
    Authors: Jang, Hung-chin
    Contributors: 資科系
    Keywords: Wireless Mesh Network;Interference Reduction;Voronoi Diagram;Delaunay Triangulation Algorithm
    Date: 2010
    Issue Date: 2015-06-17 15:02:37 (UTC+8)
    Abstract: 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.
    Relation: International Journal on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks , vol. abs/1003.3, no. 1, pp. 62-85
    Data Type: article
    DOI 連結: http://dx.doi.org/10.5121/jgraphhoc.2010.2106
    DOI: 10.5121/jgraphhoc.2010.2106
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0310jgraph6.pdf2726KbAdobe PDF853View/Open

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

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback