Energy-Efficient Transmissions With Individual Packet Delay Constraints

Chen, Wanshi; Neely, Michael J.; Mitra, Urbashi

doi:10.1109/tit.2008.920344

Cited by 88 publications

(64 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in 802. 16 broadband wireless networks, the superposition of up to four IPPs is used to model the HTTP, TCP and FTP traffic [23], [24]. For the multimedia service over IP network offered by the 3rd Generation Partnership Project (3GPP), MMPP can provide accurate models for the voice traffic, Internet protocol traffic and video traffic respectively [25].…”

Section: Introductionmentioning

confidence: 99%

Base-Station Sleeping Control and Power Matching for Energy–Delay Tradeoffs With Bursty Traffic

Bao

Miao

et al. 2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-In this paper, we study sleeping control and power matching for a single cell in cellular networks with bursty traffic. The base station (BS) sleeps whenever the system is empty, and wakes up when N users are assembled during the sleep period. The service capacity of the BS in the active mode is controlled through adjusting its transmit power. The total power consumption and average delay are analyzed, based on which the impact of parameter N and transmit power on the energy-delay tradeoff is studied. It is shown that given the average traffic load, the more bursty the traffic is, the less the total power is consumed, while the delay performance of more bursty traffic is better only under certain circumstances. The optimal energy-delay tradeoff is then obtained through joint sleeping control and power matching optimization. The relationship between the optimal control parameters and the asymptotic performance are also provided. Moreover, the influence of the traffic autocorrelation is explored, which shows less impact on the system performance compared with that of the burstiness. Numerical results show the energy saving gain of the joint sleeping control and power matching scheme, as well as the impact of burstiness on the optimal energy-delay tradeoff.

show abstract

Section: Introductionmentioning

confidence: 99%

Base-Station Sleeping Control and Power Matching for Energy–Delay Tradeoffs With Bursty Traffic

Bao

Miao

et al. 2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…For instance, in case of call admission control of IEEE 802.11 standard, the distributed coordinated function results in a delay, which may be very different from its av-1 Introduction 4 erage value [28]. The works [29], [30] consider power allocation problems for bounded delay constraints. Due to the random variations of the wireless fading channels with possible deep fades, providing bounded delay guarantees is either infeasible or results in a very high energy consumption or low transmission rate, in practice.…”

Section: Resource Allocation Under Delay Constraintsmentioning

confidence: 99%

Radio Resource Allocation Over Fading Channels Under Statistical Delay Constraints

Phan¹,

Le‐Ngoc²

2017

SpringerBriefs in Electrical and Computer Engineering

View full text Add to dashboard Cite

Wireless data transmission suffers from the fading nature of wireless channels, where the instantaneous channel conditions and hence transmission rates randomly fluctuate over time. Consequently, data arrivals at each transmitter might not be transmitted instantly. To cope with this situation, the transmitter employs buffer to store the data temporarily for later transmission. While data buffering enables more efficient radio resource allocation to opportunistically select the favorable fading conditions for transmission, it introduces queuing delay that needs to be controlled in order to meet the end-to-end delay quality-ofservice (QoS) requirements in supporting delay-sensitive communications. In this thesis, we study and develop radio resource allocation schemes for buffer-aided communications over wireless fading channels under statistical delay constraints. Using the buffering capability as a means to exploit the fading diversity, the nodes (source and relay) perform resource allocation, and adapt their transmissions to the channel state information (CSI) in order to enhance the system throughput while maintaining the statistical delay QoS requirements in terms of upper-bounded average delay or delay-outage probability.The thesis starts by considering a source-destination communications link over a fading channel with data arriving at the source transmission buffer. In the first scenario, the source is assumed to have a maximum power constraint and an average delay constraint. We consider admission control applied on random data arrivals to the source buffer in order to avoid constraint violation, and study the joint optimal data admission control and power allocation (AC-PA) problem for throughput maximization. In the second scenario, we consider an energy-harvesting (EH) source, where random amounts of energy are harvested from renewable energy sources, and stored in a battery during the course of data transmission. In every transmission time slot, the source is constrained to use at most the amount of energy currently stored. We then explore optimal power allocation problems for such EH systems under average delay or delay-outage constraints. We formulate the problems as infinite horizon constrained Markov decision process (MDP) problems, which incorporate the random variations of the fading channel, data arrival, and EH processes. A novel solution approach based on post-decision state-value function is proposed to study the properties of the optimal solutions. We also propose online allocation algorithms when the statistical knowledge of the random processes is unknown, which is typical in real-life communications. Illustrative results demonstrate the effectiveness of the proposed algorithms over existing approaches iii under similar power and delay constraints.The thesis continues with a source-relay-destination communications link over fading channels with buffers available at both source and relay, as part of a multi-hop network. We investigate and develop optimal resource allocation schemes ...

show abstract

“…The work in [12] deals with the problem of packet scheduling with deadlines within a pre-defined time window [0, T). Based on that, the authors in [16] explore the energy-efficient packet transmission with individual packet delay constraints, in which a trade-off between flexible energy and delay is analyzed under various individual packet delay constraints and bandwidth efficiencies.…”

Section: Delay Tolerant Networkmentioning

confidence: 99%

Increased Energy Efficiency via Delay-Tolerant Transmissions in Cognitive Radio Networks

Zhao

Friderikos

2013

NPA

View full text Add to dashboard Cite

We are currently witnessing the emergence of two important trends in wireless networks, namely the increased usage of Internet like applications, many of them which are delay tolerant, and cognitive radio techniques. In this paper, the focus is on how to capitalize the delay tolerance of various applications (such as email, Peer to Peer networks, social networking & operating system updates and file transfers to mention just a few) to reduce the energy consumption in cognitive networks. Since it becomes feasible to estimate the Primary Users (PU) connections for the Secondary Users (SU) by contacting a trusted database containing the information of PU traffic, a scheme is proposed that explicitly utilize the distribution of SU traffic loads to provide load-balancing. By modeling the problem under investigation as an M/M/K/L queuing system, the performance of the SUs competition is analyzed under various traffic blocking thresholds and queuing delays. To this end, by optimizing the frequency channel utilization, the number of SU connection that can be accommodated simultaneously is derived. A wide set of numerical investigations reveal how message transmission delays and the use of available white spaces can reduce the energy consumption without affecting PU traffic.

show abstract

Energy-Efficient Transmissions With Individual Packet Delay Constraints

Cited by 88 publications

References 17 publications

Base-Station Sleeping Control and Power Matching for Energy–Delay Tradeoffs With Bursty Traffic

Base-Station Sleeping Control and Power Matching for Energy–Delay Tradeoffs With Bursty Traffic

Radio Resource Allocation Over Fading Channels Under Statistical Delay Constraints

Increased Energy Efficiency via Delay-Tolerant Transmissions in Cognitive Radio Networks

Contact Info

Product

Resources

About