Mobility

Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network

Free registration required

Executive Summary

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, the authors first convert network problems into geometry problems in graph theory, and then solve the interference problem by geometric algorithms. They first define line intersection in a graph to reflect radio interference problem in a wireless mesh network.

  • Format: PDF
  • Size: 2726.8 KB