The characteristics of wireless communication channels may vary with time due to fading, environmental changes and movement of mobile wireless devices. Tracking and estimating channel gains of wireless channels is therefore a fundamentally important element of many wireless communication systems. In particular, the receivers in many wireless networks need to estimate the channel gains by means of a training sequence. This paper studies the scaling law (on the network size) of the overhead for channel gain monitoring in wireless network. We first investigate the scenario in which a receiver needs to track the channel gains with respect to multiple transmitters. To be concrete, suppose that there are n transmitters, and that in the current round of channel-gain estimation, no more than k channels suffer significant variations since the last round. We proves that " (k ((n+1) k)) time slots" is the minimum number of time slots needed to catch up with the k varied channels. At the same time, we propose a novel channel-gain monitoring scheme named ADMOT to achieve the overhead lower-bound. ADMOT leverages recent advances in compressive sensing in signal processing and interference processing in wireless communication, to enable the receiver to estimate all n channels in a reliable and computationally efficient manner within O(k ((n+1) k)) time slots. To our best knowledge, all previous channel-tracking schemes require (n) time slots regardless of k. Note that based on above results for single receiver scenario, the scaling law of general setting is achieved in which there are multiple transmitters, relay nodes and receivers.
(a) Channel monitoring in wireless networks . The works @cite_2 @cite_13 @cite_0 @cite_16 @cite_7 designed probing data and estimation algorithm for estimating channel gains, and the works @cite_29 @cite_14 proposed schemes to estimate channel interference. In the first set of works (which are related to our work), interference has not been shown to be an advantage (compared with nonoverlapping probing signals by different transmitters), and the overhead achieved is @math . Note that in the domain of wireless network coding communication , the work @cite_30 was the first to show the advantage of interference, and later the work @cite_26 proposed an amplify-and-forward relaying strategy for easy implementation.
@cite_30 @cite_14 @cite_26 @cite_7 @cite_29 @cite_0 @cite_2 @cite_16 @cite_13
2886781652 2102157096 2097395379 2168582397
Ubiquitous densification of wireless networks has brought up the issue of inter-and intra-cell interference. Interference significantly degrades network throughput and leads to unfair channel resource usage, especially in Wi-Fi networks, where even a low interfering signal from a hidden station may cause collisions or block channel access as it is based on carrier sensing. In the paper, we propose a joint power control and channel time scheduling algorithm for such networks, which significantly increases overall network throughput while maintaining fairness. The algorithm is based on branch-and-bound global optimization technique and guarantees that the solution is optimal with user-defined accuracy. Most cellular radio systems provide for the use of transmitter power control to reduce cochannel interference for a given channel allocation. Efficient interference management aims at achieving acceptable carrier-to-interference ratios in all active communication links in the system. Such schemes for the control of cochannel interference are investigated. The effect of adjacent channel interference is neglected. As a performance measure, the interference (outage) probability is used, i.e., the probability that a randomly chosen link is subject to excessive interference. In order to derive upper performance bounds for transmitter power control schemes, algorithms that are optimum in the sense that the interference probability is minimized are suggested. Numerical results indicate that these upper bounds exceed the performance of conventional systems by an order of magnitude regarding interference suppression and by a factor of 3 to 4 regarding the system capacity. The structure of the optimum algorithm shows that efficient power control and dynamic channel assignment algorithms are closely related. > We investigate spatial interference statistics for multigigabit outdoor mesh networks operating in the unlicensed 60-GHz "millimeter (mm) wave" band. The links in such networks are highly directional: Because of the small carrier wavelength (an order of magnitude smaller than those for existing cellular and wireless local area networks), narrow beams are essential for overcoming higher path loss and can be implemented using compact electronically steerable antenna arrays. Directionality drastically reduces interference, but it also leads to "deafness," making implicit coordination using carrier sense infeasible. In this paper, we make a quantitative case for rethinking medium access control (MAC) design in such settings. Unlike existing MAC protocols for omnidirectional networks, where the focus is on interference management, we contend that MAC design for 60-GHz mesh networks can essentially ignore interference and must focus instead on the challenge of scheduling half-duplex transmissions with deaf neighbors. Our main contribution is an analytical framework for estimating the collision probability in such networks as a function of the antenna patterns and the density of simultaneously transmitting nodes. The numerical results from our interference analysis show that highly directional links can indeed be modeled as pseudowired, in that the collision probability is small even with a significant density of transmitters. Furthermore, simulation of a rudimentary directional slotted Aloha protocol shows that packet losses due to failed coordination are an order of magnitude higher than those due to collisions, confirming our analytical results and highlighting the need for more sophisticated coordination mechanisms. Multichannel communication in a wireless mesh network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment and routing is critical for realization of optimal throughput in such networks. In this paper, we investigate the problem of finding the largest number of links that can be activated simultaneously in a wireless mesh network subject to interference, radio and connectivity constraints. Our goal is to activate all such links and we present an interference aware channel assignment algorithm that realizes this goal. We show that the Link Interference Graph created by utilizing a frequently used interference model gives rise to a special class of graphs, known as overlapping double-disk (ODD) graphs. We prove that the Maximum Independent Set computation problem is NP-complete for this special class of graphs. We provide a Polynomial Time Approximation Scheme (PTAS) for computation of the Maximum Independent Set of an ODD graph. We use this PTAS to develop a channel assignment algorithm for a multiradio multichannel Wireless Mesh Network. We evaluate the performance of our channel assignment algorithm by comparing it with the optimal solution obtained by solving an integer linear program. Experimental results demonstrate that our channel assignment algorithm produces near optimal solution in almost all instances of the problem.