696 research outputs found
Outage Analysis of Full-Duplex Architectures in Cellular Networks
The implementation of full-duplex (FD) radio in wireless communications is a
potential approach for achieving higher spectral efficiency. A possible
application is its employment in the next generation of cellular networks.
However, the performance of large-scale FD multiuser networks is an area mostly
unexplored. Most of the related work focuses on the performance analysis of
small-scale networks or on loop interference cancellation schemes. In this
paper, we derive the outage probability performance of large-scale FD cellular
networks in the context of two architectures: two-node and three-node. We show
how the performance is affected with respect to the model's parameters and
provide a comparison between the two architectures.Comment: to appear in Proc. IEEE VTC 2015 Spring, Glasgo
Passive Loop Interference Suppression in Large-Scale Full-Duplex Cellular Networks
Loop interference (LI) in wireless communications, is a notion resulting from
the full-duplex (FD) operation. In a large-scale network, FD also increases the
multiuser interference due to the large number of active wireless links that
exist. Hence, in order to realize the FD potentials, this interference needs to
be restricted. This paper presents a stochastic geometry model of FD cellular
networks where the users and base stations employ directional antennas. Based
on previous experimental results, we model the passive suppression of the LI at
each FD terminal as a function of the angle between the two antennas and show
the significant gains that can be achieved by this method. Together with the
reduction of multiuser interference resulting from antenna directionality, our
model demonstrates that FD can potentially be implemented in large-scale
directional networks.Comment: to appear in Proc. IEEE SPAWC 201
Recommended from our members
Combinatorial Embeddings and Representations
Topological embeddings of complete graphs and complete multipartite graphs give rise to combinatorial designs when the faces of the embeddings are triangles. In this case, the blocks of the design correspond to the triangular faces of the embedding. These designs include Steiner, twofold and Mendelsohn triple systems, as well as Latin squares. We look at construction methods, structural properties and other problems concerning these cases.
In addition, we look at graph representations by Steiner triple systems and by combinatorial embeddings. This is closely related to finding independent sets in triple systems. We examine which graphs can be represented in Steiner triple systems and combinatorial embeddings of small orders and give several bounds including a bound on the order of Steiner triple systems that are guaranteed to represent all graphs of a given maximum degree. Finally, we provide an enumeration of graphs of up to six edges representable by Steiner triple systems
- …