Wireless asymmetric Internet access with a downlink peak bit rate of 10 to 30 Mb/s can be achieved by using the terrestrial digital video broadcasting system (DVB-T) as a supplemental downlink together with today’s cellular systems. This paper is a study of dynamic radio resource management on a packet-by-packet basis for this broadband downlink. The dynamic single frequency networks (DSFN) sch...

In this paper, with reference to congested multimodal urban networks, within-day dynamic traffic assignment is formalized as a fixed-point problem in terms of arc flow and transit frequency temporal profiles. The main innovation is to represent transit supply using a frequency approach, instead of a run approach, thus not requiring a diachronic graph. By so doing, intra and inter modal congesti...

In this paper, we design a dynamic frame length CDMA/TDMA scheme for clustered wireless ad hoc networks with unknown traffic parameters. In this scheme, the collision-free intra-cluster communications are organized by the cluster-heads using a TDMA scheme, and a CDMA scheme is overlaid on the TDMA to organize the interference-free inter-cluster communications. Therefore, to design such a scheme...

A new method for performing Dynamic Traffic Assignment @TA) is presented which is applicable in real time, since the solution is based on feedback control. This method employs the design of nonlinear H, feedback control systems which is robust to certain class of uncertainties in the system. The solution aims at achieving user equilibrium on alternate routes in a network setting. 1.

4. Title and Subtitle Investigating Regional Dynamic Traffic Assignment Modeling for Improved Bottleneck Analysis: Final Report 5. Report Date October 2012; Revised March 2013 Published June 2013 6. Performing Organization Code 7. Author(s) Jennifer C. Duthie, N. Nezamuddin, Natalia Ruiz Juri, Tarun Rambha, Chris Melson, C. Matt Pool, Stephen Boyles, S. Travis Waller, Roshan Kumar 8. Performing...

This paper presents an algorithm that solves the “single-source minimum-cost paths for all departure times” problem in the context of dynamic traffic assignment, when arc traversal times and costs are piecewise linear increasing functions of the time of arrival to an arc.