Results 1 - 10
of
45
An Energy-Aware Data-Centric Generic Utility Based Approach in Wireless Sensor Networks
, 2004
"... Distinct from wireless ad hoc networks, wireless sensor networks are data-centric, application-oriented, collaborative, and energyconstrained in nature. In this paper, formulate the problem of data transport in sensor networks as an optimization problem whose objective function is to maximize the am ..."
Abstract
-
Cited by 21 (1 self)
- Add to MetaCart
(Show Context)
Distinct from wireless ad hoc networks, wireless sensor networks are data-centric, application-oriented, collaborative, and energyconstrained in nature. In this paper, formulate the problem of data transport in sensor networks as an optimization problem whose objective function is to maximize the amount of information (utility) collected at sinks (subscribers), subject to the flow, energy and channel bandwidth constraints. Also, based on a Markov model extended from [3], we derive the link delay and the node capacity in both the single and multi-hop environments, and figure them in the problem formulation. We study three special cases under the problem formulation. In particular, we consider the energy-aware flow control problem, derive an energy aware flow control solution, and investigate via ns-2 simulation its performance. The simulation results show that the proposed energy-aware flow control solution can achieve high utility and low delay without congesting the network. 1.
Limitations of Equation-based Congestion Control in Mobile Ad hoc Networks
"... Equation-based congestion control has been a promising alternative to TCP for real-time multimedia streaming over the Internet. However, its behavior remains unknown in the mobile ad hoc wireless network (MANET) domain. In this paper, we study the behavior of TFRC (TCP Friendly Rate Control [1], [2] ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
Equation-based congestion control has been a promising alternative to TCP for real-time multimedia streaming over the Internet. However, its behavior remains unknown in the mobile ad hoc wireless network (MANET) domain. In this paper, we study the behavior of TFRC (TCP Friendly Rate Control [1], [2]) over a wide range of MANET scenarios, in terms of throughput fairness and smoothness. Our result shows that while TFRC is able to maintain throughput smoothness in MANET, it obtains less throughput than the competing TCP flows (i.e., being conservative). We analyze several factors contributing to TFRC's conservative behavior in MANET, many of which are inherent to the MANET network. We also show that TFRC's conservative behavior cannot be completely corrected by tuning its loss event interval estimator. Our study shows the limitations of applying TFRC to the MANET domain, and reveals some fundamental difficulties in doing so. At the same
GRACE-1: Cross-Layer Adaptation for Multimedia Quality and Battery Energy
, 2006
"... Mobile devices primarily processing multimedia data need to support multimedia quality with limited battery energy. To address this challenging problem, researchers have introduced adaptation into multiple system layers, ranging from hardware to applications. Given these adaptive layers, a new chal ..."
Abstract
-
Cited by 18 (0 self)
- Add to MetaCart
(Show Context)
Mobile devices primarily processing multimedia data need to support multimedia quality with limited battery energy. To address this challenging problem, researchers have introduced adaptation into multiple system layers, ranging from hardware to applications. Given these adaptive layers, a new challenge is how to coordinate them to fully exploit the adaptation benefits. This paper presents a novel cross-layer adaptation framework, called GRACE-1, that coordinates the adaptation of the CPU hardware, OS scheduling, and multimedia quality based on users ’ preferences. To balance the benefits and overhead of cross-layer adaptation, GRACE-1 takes a hierarchical approach: It globally adapts all three layers to large system changes, such as application entry or exit, and internally adapts individual layers to small changes in the processed multimedia data. We have implemented GRACE-1 on an HP laptop with the adaptive Athlon CPU, Linux-based OS, and video codecs. Our experimental results show that, compared to schemes that adapt only some layers or adapt only to large changes, GRACE-1 reduces the laptop’s energy consumption up to 31.4 percent while providing better or the same video quality.
The Rate Variability-Distortion (VD) Curve of Encoded Video and its Impact on Statistical Multiplexing
, 2005
"... Encoded video is expected to contribute a significant portion of the load on future communication systems and networks, which often employ statistical multiplexing. In such systems, the number of video streams that can be supported depends both on the mean bit rate as well as bit rate variability of ..."
Abstract
-
Cited by 14 (11 self)
- Add to MetaCart
(Show Context)
Encoded video is expected to contribute a significant portion of the load on future communication systems and networks, which often employ statistical multiplexing. In such systems, the number of video streams that can be supported depends both on the mean bit rate as well as bit rate variability of the video streams. At the same time, the utility (revenue) earned from video streaming depends both on the number of supported video streams as well as their quality level. In this paper we examine the interplay between video quality, traffic variability, and utility for open-loop encoded video. We introduce the rate variability-distortion (VD) curve which relates the bit rate variability to the quality level of an encoded video. We find that the VD curve generally exhibits a characteristic “hump” behavior of first increasing, peaking, and subsequently decreasing variability for increasing quality. We examine the impact of video content characteristics, encoding parameters, and traffic smoothing on the VD behavior. We describe a methodology for assessing (i) the set of the video streams that can be supported with a statistical quality of service requirement, and (ii) the utility earned from video streaming over a link. This methodology is based on the rate-distortion and rate variability-distortion characteristics of the videos. We find that the statistical multiplexing gain and the utility as a function of the video quality level typically exhibit a “hump ” similar to the VD curve.
Determining utility functions for streaming low bitrate football video
- in Proc.of IMSA
, 2004
"... Multimedia services such as streaming live soccer over mobile and wireless networks might require a great deal of network resources and could be expensive for the consumer. In order to allocate resources optimally from both the network and the consumer perspectives. Therefore, it is important to be ..."
Abstract
-
Cited by 12 (3 self)
- Add to MetaCart
(Show Context)
Multimedia services such as streaming live soccer over mobile and wireless networks might require a great deal of network resources and could be expensive for the consumer. In order to allocate resources optimally from both the network and the consumer perspectives. Therefore, it is important to be able to determine the utility of the stream as the match evolves. We investigate experimentally how to determine the utility function for a streaming soccer service. Our experiment shows that low bit rate animations of sequences from a soccer match have higher utility than 28kbps real scene video but lower than or equal to 384kbps depending on the measure of utility used, e.g. quality or effectiveness. This shows that animations are a viable alternative to low bit rate video and has implications for utility-based scheduling since this shows that lower bit rates can have higher utility.
Maximizing network utilization with max–min fairness in wireless sensor networks
, 2008
"... ..."
(Show Context)
Adaptive Call Admission Control for QoS/Revenue Optimization in CDMA Cellular Networks
- ACM Journal on Wireless Networks (WINET
, 2004
"... In this paper, we show how online management of both quality of service (QoS) and provider revenue can be performed in CDMA cellular networks by adaptive control of system parameters to changing traffic conditions. The key contribution is the introduction of a novel call admission control and bandwi ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
(Show Context)
In this paper, we show how online management of both quality of service (QoS) and provider revenue can be performed in CDMA cellular networks by adaptive control of system parameters to changing traffic conditions. The key contribution is the introduction of a novel call admission control and bandwidth degradation scheme for real-time traffic as well as the development of a Markov model for the admission controller. This Markov model incorporates important features of 3G cellular networks, such as CDMA intra- and inter-cell interference, different call priorities and soft handover. From the results of the Markov model the threshold for maximal call degradation is periodically adjusted according to the currently measured traffic in the radio access network. As a consequence, QoS and revenue measures can be optimized with respect to a predefined goal. To illustrate the effectiveness of the proposed QoS/revenue management approach, we present quantitative results for the Markov model and a comprehensive simulation study considering a half-day window of a daily usage pattern. Keywords: Network management & control, admission control, quality of service, queueing/performance evaluation.-2-1
Approaches to Congestion Control in Packet Networks
- Journal of Internet Engineering, Klidarithmos Press
, 2004
"... We discuss congestion control algorithms, using network awareness as a criterion to categorize di#erent approaches. The first category ("the box is black") consists of a group of algorithms that consider the network as black box, assuming no knowledge of its state, other than the binary fe ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
(Show Context)
We discuss congestion control algorithms, using network awareness as a criterion to categorize di#erent approaches. The first category ("the box is black") consists of a group of algorithms that consider the network as black box, assuming no knowledge of its state, other than the binary feedback upon congestion. The second category ("the box is grey") groups approaches that use measurements to estimate available bandwidth, level of contention or even the temporary characteristics of congestion. Due to the possibility of wrong estimations and measurements, the network is considered a grey box. The third category ("the box is green") contains the bimodal congestion control, which calculates explicitly the fair-share, as well as the network-assisted control, where the network communicates its state to the transport layer; the box now is becoming green.
Utility Fair Congestion Control For Real-Time Traffic
- IEEE INFOCOM
, 2005
"... Abstract. This paper deals with a new approach to integrate congestion control for real-time applications and elastic traffic into a unified framework. In our previous work, we proposed a new fairness criterion, utility proportional fairness, that takes characteristics of real-time applications into ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
(Show Context)
Abstract. This paper deals with a new approach to integrate congestion control for real-time applications and elastic traffic into a unified framework. In our previous work, we proposed a new fairness criterion, utility proportional fairness, that takes characteristics of real-time applications into account. We complement this framework by deriving a general method to generate utility functions for layered multimedia applications. Finally, we demonstrate our approach through ns-simulations. 1
Priority pricing in utility fair networks
- Proc. of IEEE Int. Conf. on Network Protocols. IEEE
, 2005
"... This paper deals with a new pricing approach in utility fair networks, where the user’s application is associated with a utility function. We allow users to have concave as well as non-concave utility functions. Bandwidth is allocated such that utility values of applications are shared fairly. In th ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
(Show Context)
This paper deals with a new pricing approach in utility fair networks, where the user’s application is associated with a utility function. We allow users to have concave as well as non-concave utility functions. Bandwidth is allocated such that utility values of applications are shared fairly. In this work, we derive a fairness measure for utility functions that takes their specific shape into account. Based on this fairness measure, we present a simple pricing mechanism: the user announces his utility function and the network charges in accordance with the fairness measure. Then, we apply our pricing mechanism to a content provider’s network. In our model, customers want to scale their utilities to achieve their goals (e.g. file download, multimedia streaming) in a cost optimal way. In this regard, we formulate a download problem with predefined deadline as an optimal control problem and account for dynamic changes of the state of congestion by using (online) model predictive control techniques. Finally, we develop online control strategies and implement them in a User Agent (UA) that automatically scales the utilities. 1.