|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 3 van 9 gevonden artikelen
| Titel: |
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network |
| Auteur: |
Hung-Chin Jang |
| Verschenen in: |
The international journal on applications of graph theory in wireless ad hoc networks and sensor networks : J GRAPH-HOC |
| Paginering: | Jaargang 2 (2010) nr. 1 pagina's 62-85 |
| Jaar: |
2010 |
| Inhoud: |
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should helpto relay packets of neighboring nodes toward gateway using multi-hop routing mechanisms. Wireless meshnetworks 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 causessignificant degradation of system performance. In this paper, we first convert network problems intogeometry problems in graph theory, and then solve the interference problem by geometric algorithms. Wefirst define line intersection in a graph to reflect radio interference problem in a wireless mesh network. Wethen use plan sweep algorithm to find intersection lines, if any; employ Voronoi diagram algorithm todelimit the regions among nodes; use Delaunay Triangulation algorithm to reconstruct the graph in orderto minimize the interference among nodes. Finally, we use standard deviation to prune off those longerlinks (higher interference links) to have a further enhancement. The proposed hybrid solution is proved tobe able to significantly reduce interference in a wireless mesh network in O(n log n) time complexity. |
| Uitgever: |
Academy & Industry Research Collaboration Center (AIRCC) (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 3 van 9 gevonden artikelen
| << vorige | volgende >> |