政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/39841
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 109927/140876 (78%)
造访人次 : 45968754      在线人数 : 194
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/39841


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/39841


    题名: Interference-aware Topology Control in Wireless Mesh Network
    作者: 張宏慶
    Jang, Hung-Chin
    贡献者: 國立政治大學資訊科學系
    关键词: 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
    日期: 2008-09
    上传时间: 2010-05-27 16:51:34 (UTC+8)
    摘要: 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.
    關聯: The Mobility 2008 Conference (mobility 2008)
    数据类型: conference
    DOI 連結: http://dx.doi.org/10.1145/1506270.1506365
    DOI: 10.1145/1506270.1506365
    显示于类别:[資訊科學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    03.pdf779KbAdobe PDF2825检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


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