اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCapacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation
104
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Recent work has characterized the sum capacity of time-varying/frequency-selective wireless interference networks and $X$ networks within $o(log({SNR}))$, i.e., with an accuracy approaching 100% at high SNR (signal to noise power ratio). In this paper, we seek similar capacity characterizations for wireless networks with relays, feedback, full duplex operation, and transmitter/receiver cooperation through noisy channels. First, we consider a network with $S$ source nodes, $R$ relay nodes and $D$ destination nodes with random time-varying/frequency-selective channel coefficients and global channel knowledge at all nodes. We allow full-duplex operation at all nodes, as well as causal noise-free feedback of all received signals to all source and relay nodes. The sum capacity of this network is characterized as $frac{SD}{S+D-1}log({SNR})+o(log({SNR}))$. The implication of the result is that the capacity benefits of relays, causal feedback, transmitter/receiver cooperation through physical channels and full duplex operation become a negligible fraction of the network capacity at high SNR. Some exceptions to this result are also pointed out in the paper. Second, we consider a network with $K$ full duplex nodes with an independent message from every node to every other node in the network. We find that the sum capacity of this network is bounded below by $frac{K(K-1)}{2K-2}+o(log({SNR}))$ and bounded above by $frac{K(K-1)}{2K-3}+o(log({SNR}))$.
قيم البحث
اقرأ أيضاً
This work addresses a strategy to mitigate jamming attack on low-latency communication by a Full-Duplex (FD) adversary in fast-fading channel conditions. The threat model is such that the FD adversary can jam a frequency band and measure the jammed b
ands power level. We first point out that due to the presence of this FD adversary, Frequency Hopping (FH) fails. We then propose a fast-forward cooperative relaying scheme, wherein the victim node hops to the frequency band of a nearby FD helper node that fast-forwards the victims symbol along with its symbol. At the same time, the victim and the helper cooperatively pour some fraction of their power on the jammed band to engage the adversary. Due to fast-fading channel conditions, the victim and the helper use amplitude based non-coherent signalling referred to as Non-Coherent Fast-Forward Full-Duplex (NC-F2FD) relaying. To minimize the error-rate of this strategy, we jointly design the constellations at the helper node and the victim node by formulating an optimization problem. Using non-trivial results, we first analyse the objective function and then, based on the analytical results, propose a low-complexity algorithm to synthesize the fast-forwarded constellations. Through simulations, we show that the error performance of the victim improves after employing our countermeasure.
Recently, several working implementations of in--band full--duplex wireless systems have been presented, where the same node can transmit and receive simultaneously in the same frequency band. The introduction of such a possibility at the physical la
yer could lead to improved performance but also poses several challenges at the MAC layer. In this paper, an innovative mechanism of channel contention in full--duplex OFDM wireless networks is proposed. This strategy is able to ensure efficient transmission scheduling with the result of avoiding collisions and effectively exploiting full--duplex opportunities. As a consequence, considerable performance improvements are observed with respect to standard and state--of--the--art MAC protocols for wireless networks, as highlighted by extensive simulations performed in ad hoc wireless networks with varying number of nodes.
We consider a full-duplex decode-and-forward system, where the wirelessly powered relay employs the time-switching protocol to receive power from the source and then transmit information to the destination. It is assumed that the relay node is equipp
ed with two sets of antennas to enable full-duplex communications. Three different interference mitigation schemes are studied, namely, 1) optimal 2) zero-forcing and 3) maximum ratio combining/maximum ratio transmission. We develop new outage probability expressions to investigate delay-constrained transmission throughput of these schemes. Our analysis show interesting performance comparisons of the considered precoding schemes for different system and link parameters.
Capacity gains from transmitter and receiver cooperation are compared in a relay network where the cooperating nodes are close together. Under quasi-static phase fading, when all nodes have equal average transmit power along with full channel state i
nformation (CSI), it is shown that transmitter cooperation outperforms receiver cooperation, whereas the opposite is true when power is optimally allocated among the cooperating nodes but only CSI at the receiver (CSIR) is available. When the nodes have equal power with CSIR only, cooperative schemes are shown to offer no capacity improvement over non-cooperation under the same network power constraint. When the system is under optimal power allocation with full CSI, the decode-and-forward transmitter cooperation rate is close to its cut-set capacity upper bound, and outperforms compress-and-forward receiver cooperation. Under fast Rayleigh fading in the high SNR regime, similar conclusions follow. Cooperative systems provide resilience to fading in channel magnitudes; however, capacity becomes more sensitive to power allocation, and the cooperating nodes need to be closer together for the decode-and-forward scheme to be capacity-achieving. Moreover, to realize capacity improvement, full CSI is necessary in transmitter cooperation, while in receiver cooperation optimal power allocation is essential.
This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general end-to-end ca
pacity results for multi-terminal or adhoc networks, the transmission capacity (TC) framework allows for quantification of achievable single-hop rates by focusing on a simplified physical/MAC-layer model. By using stochastic geometry to quantify the multi-user interference in the network, the relationship between the optimal spatial density and success probability of transmissions in the network can be determined, and expressed -- often fairly simply -- in terms of the key network parameters. The basic model and analytical tools are first discussed and applied to a simple network with path loss only and we present tight upper and lower bounds on transmission capacity (via lower and upper bounds on outage probability). We then introduce random channels (fading/shadowing) and give TC and outage approximations for an arbitrary channel distribution, as well as exact results for the special cases of Rayleigh and Nakagami fading. We then apply these results to show how TC can be used to better understand scheduling, power control, and the deployment of multiple antennas in a decentralized network. The paper closes by discussing shortcomings in the model as well as future research directions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
