Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 99-104).

1. Introduction -- 1.1 Motivation -- 1.2 Wireless networks -- 1.3 Real-time systems -- 1.4 Overview of book --

2. A study of the base case -- 2.1 A basic system model for real-time wireless networks -- 2.2 Feasibility analysis -- 2.3 Scheduling policies -- 2.4 Proofs of optimality -- 2.5 Simulation results --

3. Admission control -- 3.1 An efficient algorithm when packet generation is periodic -- 3.2 Admission control under fading channels --

4. Scheduling policies -- 4.1 An extended system model -- 4.2 A framework for determining scheduling policies -- 4.3 Scheduling over unreliable fading channels -- 4.4 Scheduling policy under rate adaptation --

5. Utility maximization without rate adaptation -- 5.1 Problem formulation and decomposition -- 5.2 A bidding procedure between clients and access point -- 5.3 A scheduling policy for the access point -- 5.3.1 Convergence of the weighted transmission policy -- 5.3.2 Optimality of the weighted transmission policy -- 5.4 Simulation results --

6. Utility maximization with rate adaptation -- 6.1 Problem overview -- 6.2 Examples of applications -- 6.2.1 Delay-constrained wireless networks with rate adaptation -- 6.2.2 Mobile cellular networks -- 6.2.3 Dynamic spectrum allocation -- 6.3 A utility maximization approach -- 6.3.1 Convex programming formulation -- 6.3.2 An on-line scheduling policy -- 6.4 Incentive compatible auction design -- 6.4.1 Basic mechanism and incentive compatibility property -- 6.4.2 Proof of optimality -- 6.4.3 Implementation issues -- 6.5 Algorithms for specific applications -- 6.5.1 Delay-constrained wireless networks with rate adaptation -- 6.5.2 Mobile cellular networks -- 6.5.3 Dynamic spectrum allocation --

7. Systems with both real-time flows and non-real-time flows -- 7.1 System overview and problem formulation -- 7.2 A solution using dual decomposition -- 7.3 A dynamic algorithm and its convergence --

8. Broadcasting and network coding -- 8.1 System model -- 8.2 A framework for designing feasibility-optimal policies -- 8.3 Scheduling without network coding -- 8.4 Broadcasting with XOR coding -- 8.5 Broadcasting with linear coding -- 8.6 Simulation results --

A. Lyapunov analysis and its application to queuing systems -- B. Incentive compatible auction design -- Bibliography -- Authors' biographies.

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

INSPEC

Google scholar

Google book search

With the explosive increase in the number of mobile devices and applications, it is anticipated that wireless traffic will increase exponentially in the coming years. Moreover, future wireless networks all carry a wide variety of flows, such as video streaming, online gaming, and VoIP, which have various quality of service (QoS) requirements. Therefore, a new mechanism that can provide satisfactory performance to the complete variety of all kinds of flows, in a coherent and unified framework, is needed. In this book, we introduce a framework for real-time wireless networks. This consists of a model that jointly addresses several practical concerns for real-time wireless networks, including per-packet delay bounds, throughput requirements, and heterogeneity of wireless channels. We detail how this framework can be employed to address a wide range of problems, including admission control, packet scheduling, and utility maximization.

Also available in print.

Title from PDF t.p. (viewed on June 15, 2013).