282 research outputs found

    Random Access Transport Capacity

    Full text link
    We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the average maximum rate of successful end-to-end transmissions, multiplied by the communication distance, and normalized by the network area. We show that a simple upper bound on this quantity is computable in closed-form in terms of key network parameters when the number of retransmissions is not restricted and the hops are assumed to be equally spaced on a line between the source and destination. We also derive the optimum number of hops and optimal per hop success probability and show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants as well. Numerical results demonstrate that the upper bound is accurate for the purpose of determining the optimal hop count and success (or outage) probability.Comment: Submitted to IEEE Trans. on Wireless Communications, Sept. 200

    Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks

    Full text link
    The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast channel, even without any network interference, it is known that such gains collapse due to interstream interference if the feedback is delayed or low rate. In this paper, we investigate SDMA in the presence of interference from many other simultaneously active transmitters distributed randomly over the network. In particular we consider zero-forcing beamforming in a decentralized (ad hoc) network where each receiver provides feedback to its respective transmitter. We derive closed-form expressions for the outage probability, network throughput, transmission capacity, and average achievable rate and go on to quantify the degradation in network performance due to residual self-interference as a function of key system parameters. One particular finding is that as in the classical broadcast channel, the per-user feedback rate must increase linearly with the number of transmit antennas and SINR (in dB) for the full multiplexing gains to be preserved with limited feedback. We derive the throughput-maximizing number of streams, establishing that single-stream transmission is optimal in most practically relevant settings. In short, SDMA does not appear to be a prudent design choice for interference-limited wireless networks.Comment: Submitted to IEEE Transactions on Wireless Communication

    Spatial CSMA: A Distributed Scheduling Algorithm for the SIR Model with Time-varying Channels

    Full text link
    Recent work has shown that adaptive CSMA algorithms can achieve throughput optimality. However, these adaptive CSMA algorithms assume a rather simplistic model for the wireless medium. Specifically, the interference is typically modelled by a conflict graph, and the channels are assumed to be static. In this work, we propose a distributed and adaptive CSMA algorithm under a more realistic signal-to-interference ratio (SIR) based interference model, with time-varying channels. We prove that our algorithm is throughput optimal under this generalized model. Further, we augment our proposed algorithm by using a parallel update technique. Numerical results show that our algorithm outperforms the conflict graph based algorithms, in terms of supportable throughput and the rate of convergence to steady-state.Comment: This work has been presented at National Conference on Communication, 2015, held at IIT Bombay, Mumbai, Indi

    Packet Travel Times in Wireless Relay Chains under Spatially and Temporally Dependent Interference

    Full text link
    We investigate the statistics of the number of time slots TT that it takes a packet to travel through a chain of wireless relays. Derivations are performed assuming an interference model for which interference possesses spatiotemporal dependency properties. When using this model, results are harder to arrive at analytically, but they are more realistic than the ones obtained in many related works that are based on independent interference models. First, we present a method for calculating the distribution of TT. As the required computations are extensive, we also obtain simple expressions for the expected value E[T]\mathrm{E} [T] and variance var[T]\mathrm{var} [T]. Finally, we calculate the asymptotic limit of the average speed of the packet. Our numerical results show that spatiotemporal dependence has a significant impact on the statistics of the travel time TT. In particular, we show that, with respect to the independent interference case, E[T]\mathrm{E} [T] and var[T]\mathrm{var} [T] increase, whereas the packet speed decreases

    Role of Interference and Computational Complexity in Modern Wireless Networks: Analysis, Optimization, and Design

    Get PDF
    Owing to the popularity of smartphones, the recent widespread adoption of wireless broadband has resulted in a tremendous growth in the volume of mobile data traffic, and this growth is projected to continue unabated. In order to meet the needs of future systems, several novel technologies have been proposed, including cooperative communications, cloud radio access networks (RANs) and very densely deployed small-cell networks. For these novel networks, both interference and the limited availability of computational resources play a very important role. Therefore, the accurate modeling and analysis of interference and computation is essential to the understanding of these networks, and an enabler for more efficient design.;This dissertation focuses on four aspects of modern wireless networks: (1) Modeling and analysis of interference in single-hop wireless networks, (2) Characterizing the tradeoffs between the communication performance of wireless transmission and the computational load on the systems used to process such transmissions, (3) The optimization of wireless multiple-access networks when using cost functions that are based on the analytical findings in this dissertation, and (4) The analysis and optimization of multi-hop networks, which may optionally employ forms of cooperative communication.;The study of interference in single-hop wireless networks proceeds by assuming that the random locations of the interferers are drawn from a point process and possibly constrained to a finite area. Both the information-bearing and interfering signals propagate over channels that are subject to path loss, shadowing, and fading. A flexible model for fading, based on the Nakagami distribution, is used, though specific examples are provided for Rayleigh fading. The analysis is broken down into multiple steps, involving subsequent averaging of the performance metrics over the fading, the shadowing, and the location of the interferers with the aim to distinguish the effect of these mechanisms that operate over different time scales. The analysis is extended to accommodate diversity reception, which is important for the understanding of cooperative systems that combine transmissions that originate from different locations. Furthermore, the role of spatial correlation is considered, which provides insight into how the performance in one location is related to the performance in another location.;While it is now generally understood how to communicate close to the fundamental limits implied by information theory, operating close to the fundamental performance bounds is costly in terms of the computational complexity required to receive the signal. This dissertation provides a framework for understanding the tradeoffs between communication performance and the imposed complexity based on how close a system operates to the performance bounds, and it allows to accurately estimate the required data processing resources of a network under a given performance constraint. The framework is applied to Cloud-RAN, which is a new cellular architecture that moves the bulk of the signal processing away from the base stations (BSs) and towards a centralized computing cloud. The analysis developed in this part of the dissertation helps to illuminate the benefits of pooling computing assets when decoding multiple uplink signals in the cloud. Building upon these results, new approaches for wireless resource allocation are proposed, which unlike previous approaches, are aware of the computing limitations of the network.;By leveraging the accurate expressions that characterize performance in the presence of interference and fading, a methodology is described for optimizing wireless multiple-access networks. The focus is on frequency hopping (FH) systems, which are already widely used in military systems, and are becoming more common in commercial systems. The optimization determines the best combination of modulation parameters (such as the modulation index for continuous-phase frequency-shift keying), number of hopping channels, and code rate. In addition, it accounts for the adjacent-channel interference (ACI) and determines how much of the signal spectrum should lie within the operating band of each channel, and how much can be allowed to splatter into adjacent channels.;The last part of this dissertation contemplates networks that involve multi-hop communications. Building on the analytical framework developed in early parts of this dissertation, the performance of such networks is analyzed in the presence of interference and fading, and it is introduced a novel paradigm for a rapid performance assessment of routing protocols. Such networks may involve cooperative communications, and the particular cooperative protocol studied here allows the same packet to be transmitted simultaneously by multiple transmitters and diversity combined at the receiver. The dynamics of how the cooperative protocol evolves over time is described through an absorbing Markov chain, and the analysis is able to efficiently capture the interference that arises as packets are periodically injected into the network by a common source, the temporal correlation among these packets and their interdependence

    Interference Modeling And Control In Wireless Networks

    Get PDF
    With the successful commercialization of IEEE802.11 standard, wireless networks have become a tight-knit of our daily life. As wireless networks are increasingly applied to real- time and mission-critical tasks, how to ensuring real-time, reliable data delivery emerges as an important problem. However, wireless communication is subject to various dynamics and uncertainties due to the broadcast nature of wireless signal. In particular, co-channel interfer- ence not only reduces the reliability and throughput of wireless networks, it also increases the variability and uncertainty in data communication [64, 80, 77]. A basis of interference control is the interference model which \emph{predicts} whether a set of concurrent transmissions may interfere with one another. Two commonly used models, the \textit{SINR model} and the \textit{radio-K model}, are thoroughly studied in our work. To address the limitations of those models, we propose the physical-ratio-K(PRK) interference model as a reliablility-oriented instantiation of the ratio-K model, where the link-specific choice of K adapts to network and environmental conditions as well as application QoS requirements to ensure certain minimum reliability of every link. On the other hand, the interference among the transmissions, limits the number of con- current transmissions. We formulate the concept of \emph{interference budget} that, given a set of scheduled transmissions in a time slot, characterizes the additional interference power that can be tolerated by all the receivers without violating the application requirement on link reliability. We propose the scheduling algorithm \emph{iOrder} that optimizes link ordering by considering both interference budget and queue length in scheduling. Through both simulation and real-world experiments, we observe that optimizing link ordering can improve the performance of existing algorithms by a significant. Based on the strong preliminary research result on interference modeling and control, we will extend our method into distributed protocol designs. One future work will focus on imple- menting the \textit{PRK model} in a distributed protocols. We will also explore the benefits of using multiple channels in the interference control

    Interference Mitigation in Frequency Hopping Ad Hoc Networks

    Get PDF
    Radio systems today exhibit a degree of flexibility that was unheard of only a few years ago. Software-defined radio architectures have emerged that are able to service large swathes of spectrum, covering up to several GHz in the UHF bands. This dissertation investigates interference mitigation techniques in frequency hopping ad hoc networks that are capable of exploiting the frequency agility of software-defined radio platforms
    corecore