20,644 research outputs found
Cloud Compute-and-Forward with Relay Cooperation
We study a cloud network with M distributed receiving antennas and L users,
which transmit their messages towards a centralized decoder (CD), where M>=L.
We consider that the cloud network applies the Compute-and-Forward (C&F)
protocol, where L antennas/relays are selected to decode integer equations of
the transmitted messages. In this work, we focus on the best relay selection
and the optimization of the Physical-Layer Network Coding (PNC) at the relays,
aiming at the throughput maximization of the network. Existing literature
optimizes PNC with respect to the maximization of the minimum rate among users.
The proposed strategy maximizes the sum rate of the users allowing nonsymmetric
rates, while the optimal solution is explored with the aid of the Pareto
frontier. The problem of relay selection is matched to a coalition formation
game, where the relays and the CD cooperate in order to maximize their profit.
Efficient coalition formation algorithms are proposed, which perform joint
relay selection and PNC optimization. Simulation results show that a
considerable improvement is achieved compared to existing results, both in
terms of the network sum rate and the players' profits.Comment: Submitted to IEEE Transactions on Wireless Communication
Fronthaul-Constrained Cloud Radio Access Networks: Insights and Challenges
As a promising paradigm for fifth generation (5G) wireless communication
systems, cloud radio access networks (C-RANs) have been shown to reduce both
capital and operating expenditures, as well as to provide high spectral
efficiency (SE) and energy efficiency (EE). The fronthaul in such networks,
defined as the transmission link between a baseband unit (BBU) and a remote
radio head (RRH), requires high capacity, but is often constrained. This
article comprehensively surveys recent advances in fronthaul-constrained
C-RANs, including system architectures and key techniques. In particular, key
techniques for alleviating the impact of constrained fronthaul on SE/EE and
quality of service for users, including compression and quantization,
large-scale coordinated processing and clustering, and resource allocation
optimization, are discussed. Open issues in terms of software-defined
networking, network function virtualization, and partial centralization are
also identified.Comment: 5 Figures, accepted by IEEE Wireless Communications. arXiv admin
note: text overlap with arXiv:1407.3855 by other author
Capacity of wireless erasure networks
In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels. However, we assume there is no interference in reception. Such models are therefore appropriate for wireless networks where all information transmission is packetized and where some mechanism for interference avoidance is already built in. This paper looks at multicast problems over these networks. The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained. It turns out that the capacity region has a nice max-flow min-cut interpretation. The definition of cut-capacity in these networks incorporates the broadcast property of the wireless medium. It is further shown that linear coding at nodes in the network suffices to achieve the capacity region. Finally, the performance of different coding schemes in these networks when no side information is available to the destinations is analyzed
Cyclic Distributed Space–Time Codes for Wireless Relay Networks With No Channel Information
In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver, or relays. The coding scheme uses distributed space–time coding, that is, the relay nodes cooperate to encode the transmitted signal so that the receiver senses a space–time codeword. It is inspired by noncoherent differential techniques. The proposed strategy is available for any number of relays nodes. It is analyzed, and shown to yield a diversity linear in the number of relays. We also study the resistance of the scheme to relay node failures, and show that a network with R relay nodes and d of them down behaves, as far as diversity is concerned, as a network with R-d nodes. Finally, our construction can be easily generalized to the case where the transmitter and receiver nodes have several antennas
Improving Macrocell - Small Cell Coexistence through Adaptive Interference Draining
The deployment of underlay small base stations (SBSs) is expected to
significantly boost the spectrum efficiency and the coverage of next-generation
cellular networks. However, the coexistence of SBSs underlaid to an existing
macro-cellular network faces important challenges, notably in terms of spectrum
sharing and interference management. In this paper, we propose a novel
game-theoretic model that enables the SBSs to optimize their transmission rates
by making decisions on the resource occupation jointly in the frequency and
spatial domains. This procedure, known as interference draining, is performed
among cooperative SBSs and allows to drastically reduce the interference
experienced by both macro- and small cell users. At the macrocell side, we
consider a modified water-filling policy for the power allocation that allows
each macrocell user (MUE) to focus the transmissions on the degrees of freedom
over which the MUE experiences the best channel and interference conditions.
This approach not only represents an effective way to decrease the received
interference at the MUEs but also grants the SBSs tier additional transmission
opportunities and allows for a more agile interference management. Simulation
results show that the proposed approach yields significant gains at both
macrocell and small cell tiers, in terms of average achievable rate per user,
reaching up to 37%, relative to the non-cooperative case, for a network with
150 MUEs and 200 SBSs
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
- …