scispace - formally typeset
Open AccessBook

Resource Allocation and Cross Layer Control in Wireless Networks

TLDR
In this article, the authors present abstract models that capture the cross-layer interaction from the physical to transport layer in wireless network architectures including cellular, ad-hoc and sensor networks as well as hybrid wireless-wireline.
Abstract
Information flow in a telecommunication network is accomplished through the interaction of mechanisms at various design layers with the end goal of supporting the information exchange needs of the applications. In wireless networks in particular, the different layers interact in a nontrivial manner in order to support information transfer. In this text we will present abstract models that capture the cross-layer interaction from the physical to transport layer in wireless network architectures including cellular, ad-hoc and sensor networks as well as hybrid wireless-wireline. The model allows for arbitrary network topologies as well as traffic forwarding modes, including datagrams and virtual circuits. Furthermore the time varying nature of a wireless network, due either to fading channels or to changing connectivity due to mobility, is adequately captured in our model to allow for state dependent network control policies. Quantitative performance measures that capture the quality of service requirements in these systems depending on the supported applications are discussed, including throughput maximization, energy consumption minimization, rate utility function maximization as well as general performance functionals. Cross-layer control algorithms with optimal or suboptimal performance with respect to the above measures are presented and analyzed. A detailed exposition of the related analysis and design techniques is provided.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

FemtoCaching: Wireless video content delivery through distributed caching helpers

TL;DR: The theoretical contribution of this paper lies in formalizing the distributed caching problem, showing that this problem is NP-hard, and presenting approximation algorithms that lie within a constant factor of the theoretical optimum.
Journal ArticleDOI

Recent and Emerging Topics in Wireless Industrial Communications: A Selection

TL;DR: This paper discusses a selection of promising and interesting research areas in the design of protocols and systems for wireless industrial communications that have either emerged as hot topics in the industrial communications community in the last few years, or which could be worthwhile research Topics in the next few years.
Posted Content

FemtoCaching: Wireless Video Content Delivery through Distributed Caching Helpers

TL;DR: In this paper, the authors propose a system where helpers with low-rate backhaul but high storage capacity cache popular video files, and analyze the optimum way of assigning files to the helpers in order to minimize the expected downloading time for files.
Journal ArticleDOI

Fairness and optimal stochastic control for heterogeneous networks

TL;DR: The combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events.
Journal ArticleDOI

A Dynamic Offloading Algorithm for Mobile Computing

TL;DR: A dynamic offloading algorithm based on Lyapunov optimization is presented, which has low complexity to solve the offloading problem and shows that the proposed algorithm saves more energy than the existing algorithm while meeting the requirement of application execution time.
References
More filters
Book

Elements of information theory

TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Book

Nonlinear Programming

Book

Wireless Communications

Journal ArticleDOI

The capacity of wireless networks

TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Journal ArticleDOI

Network information flow

TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
Related Papers (5)