Chiping Tang

Energy Optimization under Informed Mobility

Energy optimization is important in wireless ad hoc networks, where node battery power is usually limited. Research results show that such a network can exploit controlled node mobility to reduce communication-related energy consumption. However, node movement itself usually consumes energy. In this paper we study the energy optimization problem that accounts for energy costs associated with both communication and physical node movement. We refer to this model as informed mobility. We first review the theoretical foundations on how to reduce total communication energy consumption, as well as increase system lifetime, by combining node movement and transmission power adaptation. Next, we describe and analyze the informed mobility optimization problem. Based on this analysis, we introduce localized algorithms and protocols for informed mobility. We propose iMobif, a flow-based informed mobility framework that collects network information for mobility decision making. We demonstrate how to use iMobif to minimize total communication energy consumption as well as to maximize system lifetime. We compare the performance of iMobif to that of systems with no mobility or only cost-unaware mobility. Simulation results show iMobif is effective in reducing energy consumption relative to such systems

On the cost-quality tradeoff in topology-aware overlay path probing

Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n/sup 2/), which is prohibitive in large-scale overlay networks. Several methods have been proposed to reduce probing overhead, although at a cost in terms of probing completeness. In this paper, an orthogonal solution is proposed that trades probing overhead for estimation accuracy in sparse networks such as the Internet. The proposed solution uses network-level path composition information (for example, as provided by a topology server) to infer path quality without full-scale probing. The inference metrics include latency, loss rate and available bandwidth. This approach is used to design several probing algorithms, which are evaluated through analysis and simulation. The results show that the proposed method can significantly reduce probing overhead while providing hounded quality estimations for all n /spl times/ (n - 1) overlay paths. The solution is well suited to medium-scale overlay networks in the Internet. In other environments, it can be combined with extant probing algorithms to further improve performance.

Modeling multicast packet losses in wireless LANs

Experiments with an IEEE 802.11 wireless LAN show that the packet losses at multiple nodes can exhibit a certain degree of correlation. Analysis and simulation results show that conventional packet loss models do not adequately capture the loss characteristics exhibited in experimental traces. This paper proposes a new approach for modeling packet losses that explicitly accounts for spatial loss correlation. The improved accuracy of the new approach, compared to conventional models, is demonstrated by comparing results of simulations and experiments.

Service Clouds: A Distributed Infrastructure for Constructing Autonomic Communication Services

This paper describes Service Clouds, a distributed infrastructure designed to facilitate rapid prototyping and deployment of services that enhance communication performance, robustness, and security. The infrastructure combines adaptive middleware functionality with an overlay network substrate in order to support dynamic instantiation and reconfiguration of services. The Service Clouds architecture includes a collection of low-level facilities that can be either invoked directly by applications or used to compose more complex services. After describing the Service Clouds architecture, we present results of two experimental case studies conducted on the PlanetLab Internet testbed, the first to improve throughput of bulk data transfer, and the second to enhance the robustness of multimedia streaming

Service Clouds: Distributed Infrastructure for Adaptive Communication Services

This paper describes service clouds, a distributed infrastructure designed to facilitate rapid prototyping and deployment of adaptive communication services. The infrastructure combines adaptive middleware functionality with an overlay network substrate in order to support dynamic instantiation and reconfiguration of services. The service clouds architecture includes a collection of low-level facilities that can be invoked directly by applications or used to compose more complex services. After describing the service clouds architecture, we present results of experimental case studies conducted on the PlanetLab Internet testbed alone and a mobile computing testbed.

A study of adaptive forward error correction for wireless collaborative computing

This paper addresses the problem of reliably multicasting Web resources across wireless local area networks (WLANs) in support of collaborative computing applications. An adaptive forward error correction (FEC) protocol is described, which adjusts the level of redundancy in the data stream in response to packet loss conditions. The proposed protocol is intended for use on a proxy server that supports mobile users on a WLAN. The software architecture of the proxy service and the operation of the adaptive FEC protocol are described. The performance of the protocol is evaluated using both experimentation on a mobile computing testbed as well as simulation. The results of the performance study show that the protocol can quickly accommodate worsening channel characteristics in order to reduce delay and increase throughput for reliable multicast channels.

Improving multipath reliability in topology-aware overlay networks

Use of multiple paths between node pairs can enable an overlay network to bypass Internet link failures. Selecting high quality primary and backup paths is challenging, however. To maximize communication reliability, an overlay multipath routing protocol must account for both the failure probability of a single path and link sharing among multiple paths. We propose a practical solution that exploits physical topology information and end-to-end path quality measurement results to select high quality path pairs. Simulation results show the proposed approach is effective in achieving higher multipath reliability in overlay networks at reasonable communication cost.

A distributed approach to topology-aware overlay path monitoring

Path probing is essential to maintain an efficient overlay network topology. However, the cost of complete probing can be as high as O(n/sup 2/), which is prohibitive in large-scale overlay networks. Recently we proposed a method that trades probing overhead for inference accuracy in sparse networks such as the Internet. The method uses physical path information to infer path quality for all of the n/spl times/(n-1) overlay paths, while actually probing only a subset of the paths. We propose and evaluate a distributed approach to implement this method. We describe a minimum diameter, link-stress bounded overlay spanning tree, which is used to collect and disseminate path quality information. All nodes in the tree collaborate to infer the quality of all paths. Simulation results show this approach can achieve a high-level of inference accuracy while reducing probing overhead and balancing link stress on the spanning tree.

iMobif: an informed mobility framework for energy optimization in wireless ad hoc networks

Recent research results show that a wireless ad hoc network can exploit controlled node mobility to reduce communication energy consumption. Node movement, however, may consume a certain amount of energy. To achieve overall energy optimization, wireless nodes that adopt a controlled mobility strategy must account for this cost. In this paper we propose iMobif, a flow-based informed mobility framework that collects network information to facilitate decision-making with respect to mobility. We demonstrate how to use iMobif to minimize total communication energy consumption as well as to maximize system lifetime. Simulation results show iMobif is effective in reducing energy consumption relative to that of systems with no mobility or only cost-unaware mobility.

Topology-aware overlay path probing

Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n^2), which is prohibitive in large-scale overlay networks. Several methods have been proposed to reduce probing overhead, although at a cost in terms of probing completeness. In this paper, an orthogonal solution is proposed that trades probing overhead for estimation accuracy in sparse networks such as the Internet. The proposed solution uses network-level path composition information (for example, as provided by a topology server) to infer path quality without full-scale probing. The inference metrics include latency, loss rate and available bandwidth. This approach is used to design several probing algorithms, which are evaluated through extensive simulation. The results show that the proposed method can reduce probing overhead significantly while providing bounded quality estimations for all of the nx(n-1) overlay paths. The solution is well suited to medium-scale overlay networks in the Internet. In other environments, it can be combined with extant probing algorithms to further improve performance.