Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 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
上傳時間 17-Jun-2015 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
dc.contributor 資科系
dc.creator (作者) Jang, Hung-chin
dc.creator (作者) 張宏慶zh_TW
dc.date (日期) 2010
dc.date.accessioned 17-Jun-2015 15:02:37 (UTC+8)-
dc.date.available 17-Jun-2015 15:02:37 (UTC+8)-
dc.date.issued (上傳時間) 17-Jun-2015 15:02:37 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/75879-
dc.description.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.
dc.format.extent 2792221 bytes-
dc.format.mimetype application/pdf-
dc.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
dc.subject (關鍵詞) Wireless Mesh Network; Interference Reduction; Voronoi Diagram; Delaunay Triangulation Algorithm
dc.title (題名) Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.5121/jgraphhoc.2010.2106
dc.doi.uri (DOI) http://dx.doi.org/10.5121/jgraphhoc.2010.2106