Autonomous load balancing field-based anycast routing protocol for wireless mesh networks = 무선 메쉬 네트워크를 위한 자율 부하 분산 필드 기반 애니캐스트 라우팅 프로토콜

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 408
  • Download : 0
A wireless mesh network (WMN) is expected to be a key enabler for next generation networking due to its infrastructure-less strengths such as scalability, cost-efficient rapid deployment, and long distance communications. In a WMN, in its nature, a mesh node cooperates to forward a packet to a destination with each other. In this process, traffic concentrates on a specific region, and forms a congested hot spot which increases channel access contention and queueing delays. Thus, path load balancing is essential for improving the performance of a WMN. Compared with a wired network, the scalability of a WMN is more challengeable due to the unstable nature of wireless links including interference and fading. Conventional shortest-path routing, which requires the route maintenance process, is vulnerable to congested hot spots and node failures. Because control messages consume the available bandwidth for data traffic, network throughput decreases. In this sense, a protocol design of a WMN is required to cover scalable distributed networking with minimum control overheads. A WMN is a hub-and-spoke type network, where mesh gateways as hubs play a role to provide Internet access. The majority of traffic in a WMN is from mesh clients to mesh gateways or vice versa. As a result, the throughput capacity of an entire WMN totally depends on the utilization efficiency of mesh gateways. To maximize the throughput efficiency in a WMN, load balancing among mesh gateways is a primary issue. As a load balancing routing scheme, back-pressure routing is well-known. Back-pressure routing utilizes queue length information for routing decisions, but no consideration of path length causes unnecessary long paths which involve frequent channel access contention and queueing delays. On the other hand, geographic routing fully exploits scalable distributed networking. Because there is no route maintenance, geographic routing with few control overheads minimizes the consumption of wirele...
Rhee, June-Kooresearcher이준구researcher
한국과학기술원 : 정보통신공학과,
Issue Date
455460/325007  / 020065223

학위논문(박사) - 한국과학기술원 : 정보통신공학과, 2010.08, [ xii, 121 p. ]


electrostatic analysis; wireless LAN; communication system traffic; routing; field based routing; 필드 기반 라우팅; 전자기학 분석; 무선랜; 통신 시스템 트래픽; 라우팅

Appears in Collection
Files in This Item
There are no files associated with this item.


  • mendeley


rss_1.0 rss_2.0 atom_1.0