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

    Title: Interference-aware Topology Control in Wireless Mesh Network
    Authors: 張宏慶
    Jang, Hung-Chin
    Contributors: 國立政治大學資訊科學系
    Keywords: Interference-aware Topology Contro;Wireless Mesh Network
    algorithms;delaunay triangulation algorithm;design interference reduction;network topology;topology control;voronoi diagram;wireless;communication wireless mesh network
    Date: 2008-09
    Issue Date: 2010-05-27 16:51:34 (UTC+8)
    Abstract: In wireless mesh networks, each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mechanism. Wireless mesh networks usually intensively deploy mesh nodes to cope with the problem of dead spot communication. However, the higher density of nodes deployed the higher radio interference occurred. And, this causes significant degradation of system performance.

    In this paper, we first transform network problem into geometry problem in graph. We define line intersection in a graph to reflect radio interference problem. We 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 refinement. This hybrid solution is able to significantly reduce interference in O(n log n) time complexity.
    Relation: The Mobility 2008 Conference (mobility 2008)
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1145/1506270.1506365
    DOI: 10.1145/1506270.1506365
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    03.pdf779KbAdobe PDF638View/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