Network coding is a promising technology that increases the system throughput via reducing the number of transmissions for the packets delivered from the source node to the destination node in the saturated traffic scenario. Nevertheless, some packets can suffer from the metric of end-to-end delay. Since it takes the queuing delay in the intermediate node to wait for other packets to be encoded...

In this paper, average frequency correlation and rootmean-squared (rms) delay spread estimation for wireless communication systems are described. A practical algorithm for averaged channel frequency correlation estimation, which can be used for measuring frequency selectivity, is given. Average rms delay spread of the channel is obtained directly from the channel frequency correlation estimate ...

In this paper a novel adaptive bandwidth allocation scheme called Prudent Creditization Polling (PCP) is proposed and adapted with the reservation protocol IPACT. PCP attempts to reduce the average queue length at the ONUs and the average packet delay throughout the network. At each polling period, PCP attempts to creditize the request of the ONUs that suffer from high RTT, high average delay p...

For wireless data traffic, energy efficiency can be improved by adapting the transmission power and rate over time based on the offered traffic as well as any channel state information. In this context, a variety of transmission scheduling approaches have been studied including [1, 2, 3]. These approaches attempt to manage the fundamental trade-off between packet delay and transmission power or...

The primary objective of the National Airspace System (NAS) is the transportation of passengers and cargo. It is no surprise, therefore, that passenger trip time performance is positively correlated with passenger satisfaction, airfare elasticity, and airline profits. Regulatory consumer information available to airline passengers provides measures of trip performance using only flight data (an...

In Part I of this paper, the optimal throughput–delay tradeoff for static wireless networks was shown to be , where and are the average packet delay and throughput in a network of nodes, respectively. While this tradeoff captures the essential network dynamics, packets need to scale down with the network size. In this “fluid model, ” no buffers are required. Due to this packet scaling, does not...

A controlled multiaccess protocol for packet satellite communication is introduced and analyzed in this paper. This protocol is fully distributed and no on-board processing is required for the satellite. A control parameter f is used to adaptively control the packet transmission rate such that maximum system capacity can be attained and the average delay is always minimized for a given throughp...

We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user’s transmission rate and power based on the channel state information as well as the buffer occupancy; the objectives are to regulate both the long-term average tra...

Our objective is to use information on the vehicles approaching an intersection to control the traffic signal. Recent work in this area has used this information to minimize the average delay of vehicles controlled by the signal. We demonstrate that, when there are significant differences in the volume of traffic approaching from different directions, the average delay of the vehicles in the lo...