72,917 research outputs found
Interference Mitigation in Large Random Wireless Networks
A central problem in the operation of large wireless networks is how to deal
with interference -- the unwanted signals being sent by transmitters that a
receiver is not interested in. This thesis looks at ways of combating such
interference.
In Chapters 1 and 2, we outline the necessary information and communication
theory background, including the concept of capacity. We also include an
overview of a new set of schemes for dealing with interference known as
interference alignment, paying special attention to a channel-state-based
strategy called ergodic interference alignment.
In Chapter 3, we consider the operation of large regular and random networks
by treating interference as background noise. We consider the local performance
of a single node, and the global performance of a very large network.
In Chapter 4, we use ergodic interference alignment to derive the asymptotic
sum-capacity of large random dense networks. These networks are derived from a
physical model of node placement where signal strength decays over the distance
between transmitters and receivers. (See also arXiv:1002.0235 and
arXiv:0907.5165.)
In Chapter 5, we look at methods of reducing the long time delays incurred by
ergodic interference alignment. We analyse the tradeoff between reducing delay
and lowering the communication rate. (See also arXiv:1004.0208.)
In Chapter 6, we outline a problem that is equivalent to the problem of
pooled group testing for defective items. We then present some new work that
uses information theoretic techniques to attack group testing. We introduce for
the first time the concept of the group testing channel, which allows for
modelling of a wide range of statistical error models for testing. We derive
new results on the number of tests required to accurately detect defective
items, including when using sequential `adaptive' tests.Comment: PhD thesis, University of Bristol, 201
Architecture and Operation Algorithms of Mobile Core Network with Virtualization
The analysis of the current situation in the wireless communication market shows an increase in the workload, which leads to an increase in the need in additional resources. However, the uneven loading of the infrastructure nodes leads to their loss of use; so, there is a need in introducing technologies that both do not lead to downtime of equipment and ensure the quality of load service during the day. An overview of the NFV virtualization technology has shown that it is appropriate to build wireless networks, since it provides the necessary flexibility and scalability. The method for determining the location and capacity of reserved computer resources of virtual network functions in the data centers of the mobile communication operator, method for determining the size of computing resources constant configuration time interval, and distributed method of local reconfiguration of the virtual network computing resources in the case of a failure or overload are proposed. Thus, configuration, operation, and reconfiguration processes in mobile core network with virtualized functions are described
Gossip-based service monitoring platform for wireless edge cloud computing
Edge cloud computing proposes to support shared services, by using the infrastructure at the network's edge. An important problem is the monitoring and management of services across the edge environment. Therefore, dissemination and gathering of data is not straightforward, differing from the classic cloud infrastructure. In this paper, we consider the environment of community networks for edge cloud computing, in which the monitoring of cloud services is required. We propose a monitoring platform to collect near real-time data about the services offered in the community network using a gossip-enabled network. We analyze and apply this gossip-enabled network to perform service discovery and information sharing, enabling data dissemination among the community. We implemented our solution as a prototype and used it for collecting service monitoring data from the real operational community network cloud, as a feasible deployment of our solution. By means of emulation and simulation we analyze in different scenarios, the behavior of the gossip overlay solution, and obtain average results regarding information propagation and consistency needs, i.e. in high latency situations, data convergence occurs within minutes.Peer ReviewedPostprint (author's final draft
On Modeling Heterogeneous Wireless Networks Using Non-Poisson Point Processes
Future wireless networks are required to support 1000 times higher data rate,
than the current LTE standard. In order to meet the ever increasing demand, it
is inevitable that, future wireless networks will have to develop seamless
interconnection between multiple technologies. A manifestation of this idea is
the collaboration among different types of network tiers such as macro and
small cells, leading to the so-called heterogeneous networks (HetNets).
Researchers have used stochastic geometry to analyze such networks and
understand their real potential. Unsurprisingly, it has been revealed that
interference has a detrimental effect on performance, especially if not modeled
properly. Interference can be correlated in space and/or time, which has been
overlooked in the past. For instance, it is normally assumed that the nodes are
located completely independent of each other and follow a homogeneous Poisson
point process (PPP), which is not necessarily true in real networks since the
node locations are spatially dependent. In addition, the interference
correlation created by correlated stochastic processes has mostly been ignored.
To this end, we take a different approach in modeling the interference where we
use non-PPP, as well as we study the impact of spatial and temporal correlation
on the performance of HetNets. To illustrate the impact of correlation on
performance, we consider three case studies from real-life scenarios.
Specifically, we use massive multiple-input multiple-output (MIMO) to
understand the impact of spatial correlation; we use the random medium access
protocol to examine the temporal correlation; and we use cooperative relay
networks to illustrate the spatial-temporal correlation. We present several
numerical examples through which we demonstrate the impact of various
correlation types on the performance of HetNets.Comment: Submitted to IEEE Communications Magazin
- …