4,871 research outputs found
When Channel Bonding is Beneficial for Opportunistic Spectrum Access Networks
Transmission over multiple frequency bands combined into one logical channel
speeds up data transfer for wireless networks. On the other hand, the
allocation of multiple channels to a single user decreases the probability of
finding a free logical channel for new connections, which may result in a
network-wide throughput loss. While this relationship has been studied
experimentally, especially in the WLAN configuration, little is known on how to
analytically model such phenomena. With the advent of Opportunistic Spectrum
Access (OSA) networks, it is even more important to understand the
circumstances in which it is beneficial to bond channels occupied by primary
users with dynamic duty cycle patterns. In this paper we propose an analytical
framework which allows the investigation of the average channel throughput at
the medium access control layer for OSA networks with channel bonding enabled.
We show that channel bonding is generally beneficial, though the extent of the
benefits depend on the features of the OSA network, including OSA network size
and the total number of channels available for bonding. In addition, we show
that performance benefits can be realized by adaptively changing the number of
bonded channels depending on network conditions. Finally, we evaluate channel
bonding considering physical layer constraints, i.e. throughput reduction
compared to the theoretical throughput of a single virtual channel due to a
transmission power limit for any bonding size.Comment: accepted to IEEE Transactions on Wireless Communication
Energy and bursty packet loss tradeoff over fading channels: a system-level model
Energy efficiency and quality of service (QoS) guarantees are the key design goals for the 5G wireless communication systems. In this context, we discuss a multiuser scheduling scheme over fading channels for loss tolerant applications. The loss tolerance of the application is characterized in terms of different parameters that contribute to quality of experience (QoE) for the application. The mobile users are scheduled opportunistically such that a minimum QoS is guaranteed. We propose an opportunistic scheduling scheme and address the cross-layer design framework when channel state information (CSI) is not perfectly available at the transmitter and the receiver. We characterize the system energy as a function of different QoS and channel state estimation error parameters. The optimization problem is formulated using Markov chain framework and solved using stochastic optimization techniques. The results demonstrate that the parameters characterizing the packet loss are tightly coupled and relaxation of one parameter does not benefit the system much if the other constraints are tight. We evaluate the energy-performance tradeoff numerically and show the effect of channel uncertainty on the packet scheduler design
Cognitive Access Policies under a Primary ARQ process via Forward-Backward Interference Cancellation
This paper introduces a novel technique for access by a cognitive Secondary
User (SU) using best-effort transmission to a spectrum with an incumbent
Primary User (PU), which uses Type-I Hybrid ARQ. The technique leverages the
primary ARQ protocol to perform Interference Cancellation (IC) at the SU
receiver (SUrx). Two IC mechanisms that work in concert are introduced: Forward
IC, where SUrx, after decoding the PU message, cancels its interference in the
(possible) following PU retransmissions of the same message, to improve the SU
throughput; Backward IC, where SUrx performs IC on previous SU transmissions,
whose decoding failed due to severe PU interference. Secondary access policies
are designed that determine the secondary access probability in each state of
the network so as to maximize the average long-term SU throughput by
opportunistically leveraging IC, while causing bounded average long-term PU
throughput degradation and SU power expenditure. It is proved that the optimal
policy prescribes that the SU prioritizes its access in the states where SUrx
knows the PU message, thus enabling IC. An algorithm is provided to optimally
allocate additional secondary access opportunities in the states where the PU
message is unknown. Numerical results are shown to assess the throughput gain
provided by the proposed techniques.Comment: 16 pages, 11 figures, 2 table
- …