Scaling Laws for Heterogeneous Wireless Networks

Scaling Laws for Heterogeneous Wireless Networks
Author: Urs Niesen
Publisher:
Total Pages: 215
Release: 2009
Genre:
ISBN:
GET BOOK

Download Scaling Laws for Heterogeneous Wireless Networks Book in PDF, Epub and Kindle

This thesis studies the problem of determining achievable rates in heterogeneous wireless networks. We analyze the impact of location, traffic, and service heterogeneity. Consider a wireless network with n nodes located in a square area of size n communicating with each other over Gaussian fading channels. Location heterogeneity is modeled by allowing the nodes in the wireless network to be deployed in an arbitrary manner on the square area instead of the usual random uniform node placement. For traffic heterogeneity, we analyze the n x n dimensional unicast capacity region. For service heterogeneity, we consider the impact of multicasting and caching. This gives rise to the n x 2n dimensional multicast capacity region and the 2" x n dimensional caching capacity region. In each of these cases, we obtain an explicit information-theoretic characterization of the scaling of achievable rates by providing a converse and a matching (in the scaling sense) communication architecture.

Scaling Laws for Ad Hoc Wireless Networks

Scaling Laws for Ad Hoc Wireless Networks
Author: Feng Xue
Publisher: Now Publishers Inc
Total Pages: 144
Release: 2006
Genre: Computers
ISBN: 1933019360
GET BOOK

Download Scaling Laws for Ad Hoc Wireless Networks Book in PDF, Epub and Kindle

The advent of ad hoc wireless networks demands fundamental understanding about what they can provide in the way of information transfer as well as what the appropriate architectures are for operating them. Scaling Laws for Ad-Hoc Wireless Networks: An Information Theoretic Approach addresses these questions by presenting various models and results that quantify how their information hauling capacity scales with the number of nodes in the network, and also sheds light on high level architecture design for information transport. Scaling Laws for Ad-Hoc Wireless Networks: An Information Theoretic Approach is an invaluable resource for every network engineer or researcher designing or building ad hoc wireless networks.

Interference and Resource Management in Heterogeneous Wireless Networks

Interference and Resource Management in Heterogeneous Wireless Networks
Author: Jiandong Li
Publisher: Artech House
Total Pages: 224
Release: 2017-11-30
Genre: Technology & Engineering
ISBN: 1630815098
GET BOOK

Download Interference and Resource Management in Heterogeneous Wireless Networks Book in PDF, Epub and Kindle

This authoritative resource offers a comprehensive overview of heterogeneous wireless networks, small cells, and device-to-device (D2D) communications. The book provides insight into network modeling and performance analysis of heterogeneous wireless networks. Interference management framework and design issues are covered as well as details about resource mobility, channel models, and typical and statistical interference modeling. This resource explains leveraging resource heterogeneity in interference mitigation and presents the challenges and feasible solutions for concurrent transmission. Moreover, complete coverage of interference alignment in MIMO heterogeneous networks for both downlink and uplink is presented. This book provides performance results for an ideal partially connected interference network as well as a practical heterogeneous network. Readers find practical guidance for LTE and LTE-Advanced as well as 5G in this resource. New techniques and designs for heterogeneous wireless networks are included.

Capacity Analysis of Vehicular Communication Networks

Capacity Analysis of Vehicular Communication Networks
Author: Ning Lu
Publisher: Springer Science & Business Media
Total Pages: 91
Release: 2013-09-21
Genre: Computers
ISBN: 1461483972
GET BOOK

Download Capacity Analysis of Vehicular Communication Networks Book in PDF, Epub and Kindle

This SpringerBrief focuses on the network capacity analysis of VANETs, a key topic as fundamental guidance on design and deployment of VANETs is very limited. Moreover, unique characteristics of VANETs impose distinguished challenges on such an investigation. This SpringerBrief first introduces capacity scaling laws for wireless networks and briefly reviews the prior arts in deriving the capacity of VANETs. It then studies the unicast capacity considering the socialized mobility model of VANETs. With vehicles communicating based on a two-hop relaying scheme, the unicast capacity bound is derived and can be applied to predict the throughput of real-world scenarios of VANETs. The downlink capacity of VANETs is also investigated in which access infrastructure is deployed to provide pervasive Internet access to vehicles. Different alternatives of wireless access infrastructure are considered. A lower bound of downlink capacity is derived for each type of access infrastructure. The last section of this book presents a case study based on a perfect city grid to examine the capacity-cost trade-offs of different deployments since the deployment costs of different access infrastructure are highly variable.

Information Theoretic Operating Regimes of Large Wireless Networks

Information Theoretic Operating Regimes of Large Wireless Networks
Author:
Publisher:
Total Pages: 580
Release: 2009
Genre: PPP (Computer network protocol)
ISBN:
GET BOOK

Download Information Theoretic Operating Regimes of Large Wireless Networks Book in PDF, Epub and Kindle

In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes--bandwidth- and power-limited--have proven indispensable in the design of good communication schemes. In this paper, we propose a new scaling law formulation for wireless networks that allows us to develop a theory that is analogous to the point-to-point case. We identify fundamental operating regimes of wireless networks and derive architectural guidelines for the design of optimal schemes. Our analysis shows that in a given wireless network with arbitrary size, area, power, bandwidth, etc., there are three parameters of importance: the short-distance SNR, the long-distance SNR, and the power path loss exponent of the environment. Depending on these parameters we identify four qualitatively different regimes. One of these regimes is especially interesting since it is fundamentally a consequence of the heterogeneous nature of links in a network and does not occur in the point-to-point case; the network capacity is {\em both} power and bandwidth limited. This regime has thus far remained hidden due to the limitations of the existing formulation. Existing schemes, either multihop transmission or hierarchical cooperation, fail to achieve capacity in this regime; we propose a new hybrid scheme that achieves capacity.

Capacity Scaling and Optimal Operation of Wireless Networks

Capacity Scaling and Optimal Operation of Wireless Networks
Author: Javad Ghaderi
Publisher:
Total Pages: 64
Release: 2008
Genre:
ISBN: 9780494436622
GET BOOK

Download Capacity Scaling and Optimal Operation of Wireless Networks Book in PDF, Epub and Kindle

How much information can be transferred over a wireless network and what is the optimal strategy for the operation of such network? This thesis tries to answer some of these questions from an information theoretic approach. A model of wireless network is formulated to capture the main features of the wireless medium as well as topology of the network. The performance metrics are throughput and transport capacity. The throughput is the summation of all reliable communication rates for all source-destination pairs in the network. The transport capacity is a sum rate where each rate is weighted by the distance over which it is transported. Based on the network model, we study the scaling laws for the performance measures as the number of users in the network grows. First, we analyze the performance of multihop wireless network under different criteria for successful reception of packets at the receiver. Then, we consider the problem of information transfer without arbitrary assumptions on the operation of the network. We observe that there is a dichotomy between the cases of relatively high signal attenuation and low attenuation. Moreover, a fundamental relationship between the performance metrics and the total transmitted power of users is discovered. As a result, the optimality of multihop is demonstrated for some scenarios in high attenuation regime, and better strategies than multihop are proposed for the operation in the low attenuation regime. Then, we study the performance of a special class of networks, random networks, where the traffic is uniformly distributed inside the networks. For this special class, the upperbounds on the throughput are presented for both low and high attenuation cases. To achieve the presented upperbounds, a hierarchical cooperation scheme is analyzed and optimized by choosing the number of hierarchical stages and the corresponding cluster sizes that maximize the total throughput. In addition, to apply the hierarchical cooperation scheme to random networks, a clustering algorithm is developed, which divides the whole network into quadrilateral clusters, each with exactly the number of nodes required.