6,949 research outputs found
A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods
The interference imposes a significant negative impact on the performance of
wireless networks. With the continuous deployment of larger and more
sophisticated wireless networks, reducing interference in such networks is
quickly being focused upon as a problem in today's world. In this paper we
analyze the interference reduction problem from a graph theoretical viewpoint.
A graph coloring methods are exploited to model the interference reduction
problem. However, additional constraints to graph coloring scenarios that
account for various networking conditions result in additional complexity to
standard graph coloring. This paper reviews a variety of algorithmic solutions
for specific network topologies.Comment: 10 pages, 5 figure
Assigning channels via the meet-in-the-middle approach
We study the complexity of the Channel Assignment problem. By applying the
meet-in-the-middle approach we get an algorithm for the -bounded Channel
Assignment (when the edge weights are bounded by ) running in time
. This is the first algorithm which breaks the
barrier. We extend this algorithm to the counting variant, at the
cost of slightly higher polynomial factor.
A major open problem asks whether Channel Assignment admits a -time
algorithm, for a constant independent of . We consider a similar
question for Generalized T-Coloring, a CSP problem that generalizes \CA. We
show that Generalized T-Coloring does not admit a
-time algorithm, where is the
size of the instance.Comment: SWAT 2014: 282-29
Tight lower bound for the channel assignment problem
We study the complexity of the Channel Assignment problem. A major open
problem asks whether Channel Assignment admits an -time algorithm, for
a constant independent of the weights on the edges. We answer this question
in the negative i.e. we show that there is no -time algorithm
solving Channel Assignment unless the Exponential Time Hypothesis fails. Note
that the currently best known algorithm works in time so our lower bound is tight
Radio Co-location Aware Channel Assignments for Interference Mitigation in Wireless Mesh Networks
Designing high performance channel assignment schemes to harness the
potential of multi-radio multi-channel deployments in wireless mesh networks
(WMNs) is an active research domain. A pragmatic channel assignment approach
strives to maximize network capacity by restraining the endemic interference
and mitigating its adverse impact on network performance. Interference
prevalent in WMNs is multi-faceted, radio co-location interference (RCI) being
a crucial aspect that is seldom addressed in research endeavors. In this
effort, we propose a set of intelligent channel assignment algorithms, which
focus primarily on alleviating the RCI. These graph theoretic schemes are
structurally inspired by the spatio-statistical characteristics of
interference. We present the theoretical design foundations for each of the
proposed algorithms, and demonstrate their potential to significantly enhance
network capacity in comparison to some well-known existing schemes. We also
demonstrate the adverse impact of radio co- location interference on the
network, and the efficacy of the proposed schemes in successfully mitigating
it. The experimental results to validate the proposed theoretical notions were
obtained by running an exhaustive set of ns-3 simulations in IEEE 802.11g/n
environments.Comment: Accepted @ ICACCI-201
Partially-Distributed Resource Allocation in Small-Cell Networks
We propose a four-stage hierarchical resource allocation scheme for the
downlink of a large-scale small-cell network in the context of orthogonal
frequency-division multiple access (OFDMA). Since interference limits the
capabilities of such networks, resource allocation and interference management
are crucial. However, obtaining the globally optimum resource allocation is
exponentially complex and mathematically intractable. Here, we develop a
partially decentralized algorithm to obtain an effective solution. The three
major advantages of our work are: 1) as opposed to a fixed resource allocation,
we consider load demand at each access point (AP) when allocating spectrum; 2)
to prevent overloaded APs, our scheme is dynamic in the sense that as the users
move from one AP to the other, so do the allocated resources, if necessary, and
such considerations generally result in huge computational complexity, which
brings us to the third advantage: 3) we tackle complexity by introducing a
hierarchical scheme comprising four phases: user association, load estimation,
interference management via graph coloring, and scheduling. We provide
mathematical analysis for the first three steps modeling the user and AP
locations as Poisson point processes. Finally, we provide results of numerical
simulations to illustrate the efficacy of our scheme.Comment: Accepted on May 15, 2014 for publication in the IEEE Transactions on
Wireless Communication
- …