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.