學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 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
上傳時間 27-May-2010 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
dc.contributor 國立政治大學資訊科學系en_US
dc.creator (作者) 張宏慶zh_TW
dc.creator (作者) Jang, Hung-Chin-
dc.date (日期) 2008-09en_US
dc.date.accessioned 27-May-2010 16:51:34 (UTC+8)-
dc.date.available 27-May-2010 16:51:34 (UTC+8)-
dc.date.issued (上傳時間) 27-May-2010 16:51:34 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/39841-
dc.description.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.
-
dc.language en-USen_US
dc.language.iso en_US-
dc.relation (關聯) The Mobility 2008 Conference (mobility 2008)en_US
dc.subject (關鍵詞) Interference-aware Topology Contro;Wireless Mesh Networken_US
dc.subject (關鍵詞) algorithms; delaunay triangulation algorithm; design interference reduction; network topology; topology control; voronoi diagram; wireless; communication wireless mesh network-
dc.title (題名) Interference-aware Topology Control in Wireless Mesh Networken_US
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1145/1506270.1506365-
dc.doi.uri (DOI) http://dx.doi.org/10.1145/1506270.1506365-