A hybrid strategy for real-time traffic signal control of urban road networks

The recently developed traffic signal control strategy known as traffic-responsive urban control (TUC) requires availability of a fixed signal plan that is sufficiently efficient under undersaturated traffic conditions. To drop this requirement, the well-known Webster procedure for fixed-signal control derivation at isolated junctions is appropriately employed for real-time operation based on measured flows. It is demonstrated via simulation experiments and field application that the following hold: 1) The developed real-time demand-based approach is a viable real-time signal control strategy for undersaturated traffic conditions. 2) It can indeed be used within TUC to drop the requirement for a prespecified fixed signal plan. 3) It may, under certain conditions, contribute to more efficient results, compared with the original TUC method

An Approximate Inner Bound to the QoS Aware Throughput Region of a Tree Network under IEEE 802.15.4 CSMA/CA and Application to Wireless Sensor Network Design

We consider a tree network spanning a set of source nodes that generate measurement packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count. We assume that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive sufficient conditions for the tree network to approximately satisfy certain given QoS targets such as end-to-end delivery probability and delay under a given rate of generation of measurement packets at the sources (arrival rates vector). The structures of our sufficient conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the network. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and BS) that meet the sufficient conditions, a shortest path tree achieves the maximum throughput

LaSR: a supple multi-connectivity scheduler for multi-RAT OFDMA systems

Network densification over space and spectrum is expected to be key to enabling the requirements of next generation mobile systems. The pitfall is that radio resource allocation becomes substantially more complex. In this paper we propose LaSR, a practical multi-connectivity scheduler for OFDMA-based multi-RAT systems. LaSR makes optimal discrete control actions by solving a sequence of simple optimization problems that do not require prior information of traffic patterns. In marked contrast to previous work, the flexibility of our approach allows us to construct scheduling policies that achieve a good balance between system cost and utility satisfaction, while jointly operate across heterogeneous RATs, accommodate real-system requirements, and guarantee system stability. Examples of system requirements considered in this paper include (but are not limited to): constraints on how scheduling data can be encoded onto signaling protocols (e.g. LTE's DCI), delays when turning on/off radio units, or on/off cycles when using unlicensed spectrum. We evaluate our scheduler via a thorough simulation campaign in a variety of scenarios with e.g. mobile users, RATs using unlicensed spectrum (using a duty cycle access mechanism), imperfect queue state information, and constrained signaling protocol.The authors would like to thank the Spanish Government (Ministerio de Economía y Competitividad, Fondo Europeo de Desarrollo Regional, FEDER) for its support through the project ADVICE (TEC2015-71329-C2-1-R) and 5G-Transformer Project (Grant 761536)