اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMixed Delay Constraints in Wyners Soft-Handoff Network
65
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Wyners soft-handoff network with mixed delay constraints is considered when neighbouring receivers can cooperate over rate-limited links. Each source message is a combination of independent fast and slow bits, where the former are subject to a stringent decoding delay. Inner and outer bounds on the capacity region are derived, and the multiplexing gain region is characterized when only transmitters or only receivers cooperate.
قيم البحث
اقرأ أيضاً
The sectorized hexagonal model with mixed delay constraints is considered when both neighbouring mobile users and base stations can cooperate over rate-limited links. Each message is a combination of independent fast and slow bits, where the former a
re subject to a stringent delay constraint and cannot profit from cooperation. Inner and outer bounds on the multiplexing gain region are derived. The obtained results show that for small cooperation prelogs or moderate fast multiplexing gains, the overall performance (sum multiplexing gain) is hardly decreased by the stringent delay constraints on the fast bits. For large cooperation prelogs and large fast multiplexing gains, increasing the fast multiplexing gain by $Delta$ comes at the expense of decreasing the sum multiplexing gain by $3 Delta$.
Source-channel coding for an energy limited wireless sensor node is investigated. The sensor node observes independent Gaussian source samples with variances changing over time slots and transmits to a destination over a flat fading channel. The fadi
ng is constant during each time slot. The compressed samples are stored in a finite size data buffer and need to be delivered in at most $d$ time slots. The objective is to design optimal transmission policies, namely, optimal power and distortion allocation, over the time slots such that the average distortion at destination is minimized. In particular, optimal transmission policies with various energy constraints are studied. First, a battery operated system in which sensor node has a finite amount of energy at the beginning of transmission is investigated. Then, the impact of energy harvesting, energy cost of processing and sampling are considered. For each energy constraint, a convex optimization problem is formulated, and the properties of optimal transmission policies are identified. For the strict delay case, $d=1$, $2D$ waterfilling interpretation is provided. Numerical results are presented to illustrate the structure of the optimal transmission policy, to analyze the effect of delay constraints, data buffer size, energy harvesting, processing and sampling costs.
This paper analyses the multiplexing gain (MG) achievable over Wyners symmetric network with random user activity and random arrival of mixed-delay traffic. The mixed-delay traffic is composed of delay-tolerant traffic and delay-sensitive traffic whe
re only the former can benefit from transmitter and receiver cooperation since the latter is subject to stringent decoding delays. The total number of cooperation rounds at transmitter and receiver sides is limited to $D$ rounds. We derive inner and outer bounds on the MG region. In the limit as $Dto infty$, the bounds coincide and the results show that transmitting delay-sensitive messages does not cause any penalty on the sum MG. For finite $D$ our bounds are still close and prove that the penalty caused by delay-sensitive transmissions is small.
In this paper, we consider a cache-aided relay network, where a single server consisting of a library of N files connects with K1 relays through a shared noiseless link, and each relay connects with K2 users through a shared noiseless link. Each rela
y and user are equipped with a cache memory of M1 and M2 files, respectively. We propose a centralized and a decentralized coded caching scheme that exploit the spared transmission time resource by allowing concurrent transmission between the two layers. It is shown that both caching schemes are approximately optimal, and greatly reduce the transmission delay compared to the previously known caching schemes. Surprisingly, we show that when the relays caching size is equal to a threshold that is strictly smaller than N (e.g. M1=0.382N under the decentralized setup and (K1-1)N/K1 under the centralized setup, when K1=2), our schemes achieve the same delay as if each relay had access to the full library. To our best knowledge, this is the first result showing that even the caching size is strictly smaller than the librarys size, increasing the caching size is wasteful in reducing the transmission latency.
In cloud radio access networks (C-RANs), the baseband units and radio units of base stations are separated, which requires high-capacity fronthaul links connecting both parts. In this paper, we consider the delay-aware fronthaul allocation problem fo
r C-RANs. The stochastic optimization problem is formulated as an infinite horizon average cost Markov decision process. To deal with the curse of dimensionality, we derive a closed-form approximate priority function and the associated error bound using perturbation analysis. Based on the closed-form approximate priority function, we propose a low-complexity delay-aware fronthaul allocation algorithm solving the per-stage optimization problem. The proposed solution is further shown to be asymptotically optimal for sufficiently small cross link path gains. Finally, the proposed fronthaul allocation algorithm is compared with various baselines through simulations, and it is shown that significant performance gain can be achieved.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
