政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75879

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 113961/144987 (79%)
造访人次 : 51994239 在线人数 : 284

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.pdf		2726Kb	Adobe PDF2	1055	检视/开启

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

社群 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.

数据加载中.....