Sangsu Jung

Distributed potential field based routing and autonomous load balancing for wireless mesh networks

Congested hot spots and node failures severely degrade the performance of wireless mesh networks. However, conventional routing schemes are inefficient in mitigation of the problems. Considering analogy to physics, we propose a novel distributed potential-field-based routing scheme for anycast wireless mesh networks, which is robust to sudden traffic and network perturbations, effectively balancing load among multiple gateways and mesh nodes with little control overhead. Simulation results exhibit autonomous load balancing and failure-tolerant performance in wireless mesh networking.

Multipath Video Real-Time Streaming by Field-Based Anycast Routing

Wireless mesh networking (WMN) for video surveillance provides a strong potential for rapid deployment in a large community, for which reliability and survivability for real-time streaming are the key performance measure. However, current routing protocols do not provide a robust solution to meet video transmission requirements such as providing load balancing for the high data rate and delay requirements. We propose an application of field-based anycast routing (FAR) protocol, which utilizes rapid routing dynamics inspired by an electrostatic potential field model governed by Poissons equation. This routing metric takes into account geometric proximity and congestion degree in order to increase delivery ratio and decrease end-to-end delay, which determine the quality of the delivered video. In addition, FAR protects node failure with an on-the-fly rerouting process that guarantees the continuity of video streaming. Simulation results show 100% delivery ratio in congestion situations and it shows tolerance to different delay requirements compared with AODV and FDMR protocols in terms of delivering real-time and non real-time video surveillance which verifies FAR as a strong candidate for video transmission over WMN.

Greedy Local Routing Strategy for Autonomous Global Load Balancing Based on Three-Dimensional Potential Field

We discuss a traffic load balancing scheme for three-dimensional (3D) wireless mesh networks (WMNs), which deals with global load balancing through only one-hop local information. With a finite element method (FEM), we derive a distributed form of a solution for 3D Poissons equation to construct a routing metric sensitive to traffic loads. For practical validation, we implement it on an IEEE 802.11-based WMN testbed platform. Experiment results show that our protocol chooses routing paths more efficiently for network-wide load balancing than a state-of-the-art routing protocol, OLSR-ETX.

Autonomous load balancing anycast routing protocol for wireless mesh networks

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, costefficient rapid deployment, and long distance communications. To boost the strength of WMNs, it is required to balance loads among multiple gateways as well as mesh nodes. However, there have been only few practical and easily-implementable solutions for load balancing of WMNs. In this paper, we propose a distributed autonomous load balancing routing mechanism for anycast WMNs where most traffic flows are for the Internet access through any mesh gateways. Without flooding of control messages, our protocol finds optimized paths implicitly considering geographical distance and a congestion degree based on analogy of physics theory, Poissons equation and by use of a distributed form of a finite element method. Through simulations, we assess the performance of our protocol compared with the anycast modifications of traditional shortest-path routing and geographic routing under dynamically varying network scenarios.

Autonomous load balancing anycast routing for wireless mesh networks: VoIP call support

Voice over IP (VoIP) over a wireless mesh network (WMN) is a killer application candidate of the next generation services over wireless and mobile network infrastructure. Yet, the routing and transport efficiencies in consideration of specific attributes of WMNs have been little emphasized. Distinctively from conventional networks, the major traffic pattern of WMNs is anycast (one-to-one-of-many). To fully utilize the service aspects of WMNs, load balancing and scalability should simultaneously be supported. For VoIP, one challenge is to maintain the perceived quality depending on both loss and delay. In this paper, we assess autonomous load balancing anycast routing regarding VoIP supportability. The protocol is based on physics analogy and a distributed algorithm. We compare the protocol with shortest-path routing and back-pressure routing via simulations. Simulation results exhibit that autonomous load balancing of the protocol efficiently supports voice calls to guarantee the certain level of quality.

A novel content caching replacement strategy inspired by a human memory system

We propose an innovative content caching replacement strategy for future content delivery networks. Ultimately, we provide new insight in caching design by the inspiration of a human memory system.

One-touch caching for content delivery in wireless consumer networks

As consumer traffic rapidly increases, content caching becomes common in intermediate nodes for rapid content transportation reducing content-trip delay. Compared with wired content caching systems, wireless caching systems require a lighter-weight caching mechanism because of limited processing capability. In this paper, we address that one-touch caching just keeping the most-recently requested content and replacing a random content among existing contents for storage of the new content significantly enhances caching performance with little computational overhead. Through simulation results, it is demonstrated that our scheme shows hit-ratio comparable to LFU (least-frequently-used) and LRU (least-recently-used) caching strategies.