Autonomous Algorithms for Centralized and Distributed Interference Coordination: A Virtual Layer Based Approach

Interference mitigation techniques are essential for improving the performance of interference limited wireless networks. In this paper, we introduce novel interference mitigation schemes for wireless cellular networks with space division multiple access (SDMA). The schemes are based on a virtual layer that captures and simplifies the complicated interference situation in the network and that is used for power control. We show how optimization in this virtual layer generates gradually adapting power control settings that lead to autonomous interference minimization. Thereby, the granularity of control ranges from controlling frequency sub-band power via controlling the power on a per-beam basis, to a granularity of only enforcing average power constraints per beam. In conjunction with suitable short-term scheduling, our algorithms gradually steer the network towards a higher utility. We use extensive system-level simulations to compare three distributed algorithms and evaluate their applicability for different user mobility assumptions. In particular, it turns out that larger gains can be achieved by imposing average power constraints and allowing opportunistic scheduling instantaneously, rather than controlling the power in a strict way. Furthermore, we introduce a centralized algorithm, which directly solves the underlying optimization and shows fast convergence, as a performance benchmark for the distributed solutions. Moreover, we investigate the deviation from global optimality by comparing to a branch-and-bound-based solution.Comment: revised versio

Distributed Algorithms for Spectrum Allocation, Power Control, Routing, and Congestion Control in Wireless Networks

We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate simultaneously on the same frequency band, we first devise a spectrum allocation scheme that divides the whole spectrum into multiple sub-bands and activates conflict-free links on each sub-band. We show that the minimum number of required sub-bands grows asymptotically at a logarithmic rate with the chromatic number of network connectivity graph. A simple distributed and asynchronous algorithm is developed to feasibly activate links on the available sub-bands. Given a feasible spectrum allocation, we then design node-based distributed algorithms for optimally controlling the transmission powers on active links for each sub-band, jointly with traffic routes and user input rates in response to channel states and traffic demands. We show that under specified conditions, the algorithms asymptotically converge to the optimal operating point.Comment: 14 pages, 5 figures, submitted to IEEE/ACM Transactions on Networkin

Wireless Network Stability in the SINR Model

We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal to Interference and Noise Ratio) interference model. Specifically, we make the following contributions. We give a distributed algorithm that achieves $\Omega(\frac{1}{\log^2 n})$-efficiency on all networks (where $n$ is the number of links in the network), for all length monotone, sub-linear power assignments. For the power control version of the problem, we give a distributed algorithm with $\Omega(\frac{1}{\log n(\log n + \log \log \Delta)})$-efficiency (where $\Delta$ is the length diversity of the link set).Comment: 10 pages, appeared in SIROCCO'1

Dynamic algorithms for multicast with intra-session network coding

The problem of multiple multicast sessions with intra-session network coding in time-varying networks is considered. The network-layer capacity region of input rates that can be stably supported is established. Dynamic algorithms for multicast routing, network coding, power allocation, session scheduling, and rate allocation across correlated sources, which achieve stability for rates within the capacity region, are presented. This work builds on the back-pressure approach introduced by Tassiulas et al., extending it to network coding and correlated sources. In the proposed algorithms, decisions on routing, network coding, and scheduling between different sessions at a node are made locally at each node based on virtual queues for different sinks. For correlated sources, the sinks locally determine and control transmission rates across the sources. The proposed approach yields a completely distributed algorithm for wired networks. In the wireless case, power control among different transmitters is centralized while routing, network coding, and scheduling between different sessions at a given node are distributed

Transmission control algorithms in power-controlled wireless ad hoc networks

Wireless networks have become an indispensable component of almost any communication systems. In particular, there has been a growing interest in wireless ad hoc networks, where no centralized management is required and therefore, they can be set up and become operational in almost no time. Due to the shared nature of the wireless channels and the existence of high co-channel interference in wireless ad hoc networks, the role of the transmission control algorithms such as power control and admission control schemes becomes extremely important. Power control algorithms manage the power allocation process and admission control algorithms grant network access to a new link while protecting the transmission quality of other links. Because of the distributed nature of ad hoc networks, the transmission control algorithms have to be also distributed and should not rely on any information to be provided at the network level. In this work, new transmission control algorithms for power-controlled ad hoc networks are investigated where each algorithm is designed to achieve a specific performance objective. In particular, an autonomous power control algorithm is proposed to achieve the maximum uniform signal-to-interference-plus-noise ratio (SIR) of the network. Moreover, an asynchronous power control with active link protection is introduced which allows the links to update their powers asynchronously and at the same time, guarantees the target SIR of the existing links when a new link enters the network. Furthermore, a novel distributed admission control algorithm is proposed which can be used as an add-on module to most of the asynchronous power control algorithms and delivers an ideal admission decision. Finally, the feasible SIR region is investigated which can be considered as the upper bound for the achievable rates of any transmission control algorithm

Novel Medium Access Control (MAC) Protocols for Wireless Sensor and Ad Hoc Networks (WSANs) and Vehicular Ad Hoc Networks (VANETs)

Efficient medium access control (MAC) is a key part of any wireless network communication architecture. MAC protocols are needed for nodes to access the shared wireless medium efficiently. Providing high throughput is one of the primary goals of the MAC protocols designed for wireless networks. MAC protocols for Wireless Sensor and Ad hoc networks (WSANs) must also conserve energy as sensor nodes have limited battery power. On the other hand, MAC protocols for Vehicular Ad hoc networks (VANETs) must also adapt to the highly dynamic nature of the network. As communication link failure is very common in VANETs because of the fast movement of vehicles so quick reservation of packet transmission slots by vehicles is important. In this thesis we propose two new distributed MAC algorithms. One is for WSANs and the other one is for VANETs. We demonstrate using simulations that our algorithms outperform the state-of-the-art algorithms

Distributed power control for wireless networks via the alternating direction method of multipliers

Utility-based power control in wireless networks has been widely recognized as an effective mechanism to managing co-channel interferences. It is based on the maximization of system utility subject to power constraints, which is referred to as power control optimization problem. Global coupling between the mutual interference of wireless channels increases the difficulty of searching global optimum significantly. In this paper, we decouple the optimization problems with concave and non-concave utility functions; and transform them into a global consensus problem by introducing locally slack variables. We then propose two distributed iterative optimization algorithms for the global consensus problems with concave and non-concave objective functions, respectively, based on an alternating direction method of multipliers. Furthermore, we prove that both algorithms converge to the global optimum of the total network utility. Simulation results show the effectiveness of the algorithms. Comparison experiments show that the developed algorithms compare favourably against some other well-known algorithms