Results 1  10
of
23
The Capacity of Heterogeneous Wireless Networks
 Proc. IEEE INFOCOM
, 2010
"... Abstract—A substantial body of the literature exists addressing the capacity of wireless networks. However, it is commonly assumed that all nodes in the network are identical. The issue of heterogeneity has not been embraced into the discussions. In this paper, we investigate the throughput capacity ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
Abstract—A substantial body of the literature exists addressing the capacity of wireless networks. However, it is commonly assumed that all nodes in the network are identical. The issue of heterogeneity has not been embraced into the discussions. In this paper, we investigate the throughput capacity of heterogeneous wireless networks with general network settings. Specifically, we consider an extended network with n normal nodes and m nb (0 b 1) more powerful helping nodes in a rectangular area with width sðnÞ and length n=sðnÞ, where sðnÞ nw and 0 w 1=2. We assume that there are n flows in the network. All the n normal nodes are sources while only randomly chosen nd (0 d 1) normal nodes are destinations. We further assume that the n normal nodes are uniformly and independently distributed, while the m helping nodes are either regularly placed or uniformly and independently distributed, resulting in two different kinds of networks called Regular Heterogeneous Wireless Networks and Random Heterogeneous Wireless Networks, respectively. We show that network capacity is determined by the shape of the network area, the number of destination nodes, the number of helping nodes, and the bandwidth of helping nodes. We also find that heterogeneous wireless networks can provide throughput higher in the order sense than traditional homogeneous wireless networks only under certain conditions. Index Terms—Heterogeneous wireless networks, extended networks, achievable throughput Ç 1
Optimal multicast capacity and delay tradeoffs
 IEEE Trans. Mobile Computing
, 2013
"... Abstract—In this paper, we give a global perspective of multicast capacity and delay analysis in Mobile Adhoc Networks (MANETs). Specifically, we consider two node mobility models: (1) twodimensional i.i.d. mobility, (2) onedimensional i.i.d. mobility. Two mobility timescales are included in th ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we give a global perspective of multicast capacity and delay analysis in Mobile Adhoc Networks (MANETs). Specifically, we consider two node mobility models: (1) twodimensional i.i.d. mobility, (2) onedimensional i.i.d. mobility. Two mobility timescales are included in this paper: (i) Fast mobility where node mobility is at the same timescale as data transmissions; (ii) Slow mobility where node mobility is assumed to occur at a much slower timescale than data transmissions. Given a delay constraint D, we first characterize the optimal multicast capacity for each of the four mobility models, and then we develop a scheme that can achieve a capacitydelay tradeoff close to the upper bound up to a logarithmic factor. Our study can be further extended to twodimensional/onedimensional hybrid random walk fast/slow mobility models and heterogeneous networks. I.
Impacts of topology and traffic pattern on capacity of hybrid wireless networks,” IEEE Trans. Mobile Comput., to be published
 IEEE/ACM Trans. Netw
, 2009
"... Abstract—In this paper, we investigate the throughput capacity in wireless hybrid networks with various network topologies and traffic patterns. Specifically, we consider n randomly distributed nodes, out of which there are n source nodes and ndð0 < d < 1Þ randomly chosen destination nodes, to ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we investigate the throughput capacity in wireless hybrid networks with various network topologies and traffic patterns. Specifically, we consider n randomly distributed nodes, out of which there are n source nodes and ndð0 < d < 1Þ randomly chosen destination nodes, together with nbð0 < b < 1Þ base stations in a network area of 0; nw 0; n1wð0 < w 12Þ. We first study the throughput capacity when the base stations are regularly placed and their transmission power is large enough for them to directly transmit to any nodes associated with them. We show that a pernode throughput of maxfminfnb1; nd1g;minf nw1ffiffiffiffiffiffiffi logn p; nd1gg bits/sec is achievable by all nodes. We then investigate the throughput capacity when the base stations are uniformly and randomly placed, and their transmission power is as small as that of the normal nodes. We present that each node can achieve a throughput of maxfminfnb1logn; nd1g;minf n w1ffiffiffiffiffiffiffi logn p; nd1gg bits/sec. In both settings, we observe that only when d> b and d> w, the maximum achievable throughput can be determined by both the number of base stations and the shape of network area. In all the other cases, the maximum achievable throughput is only constrained by the number of destination nodes. Moreover, the results in these two settings are the same except for the case d> b> w, in which the random placement of base stations will cause a degradation factor of logn on the maximum achievable throughput compared to the regular placement. Finally, we also show that our results actually hold for different power propagation models. Index Terms—Hybrid wireless networks, throughput capacity, network topology, traffic pattern. Ç 1
Capacity Scaling of Multihop Cellular Networks
 Proc. IEEE INFOCOM
, 2011
"... Abstract—Wireless cellular networks are largescale networks in which asymptotic capacity investigation is no longer a cliché. A substantial body of work has been carried out to improve the capacity of cellular networks by introducing ad hoc communications, resulting in the socalled multihop cell ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
(Show Context)
Abstract—Wireless cellular networks are largescale networks in which asymptotic capacity investigation is no longer a cliché. A substantial body of work has been carried out to improve the capacity of cellular networks by introducing ad hoc communications, resulting in the socalled multihop cellular networks. Most of the previous research allows ad hoc transmissions between certain source and destination pairs to alleviate base stations’ relay burden. However, since reports show that Internet data traffic is becoming more and more dominant in cellular networks, we explore in this paper the capacity of multihop cellular networks with all traffic going through base stations and ad hoc transmissions only acting as relay. We first investigate the capacity of regular multihop cellular networks where both nodes and base stations are regularly placed. By fully exploiting the link rate variability, we find that multihop cellular networks can have higher pernode throughput than traditional cellular networks by a scaling factor of log 2 푛. Then, for the first time we extend our study to the capacity of heterogeneous multihop cellular networks where nodes are distributed according to a general Inhomogeneous Poisson Process and base stations are randomly placed. We show that under certain conditions multihop cellular networks can also outperform traditional cellular networks by a scaling factor of log 2 푛. Moreover, both throughputfairness and bandwidthfairness are considered as fairness constraints for both kinds of networks. I.
The Capacity of ThreeDimensional Wireless Ad Hoc Networks
"... Abstract—Network capacity investigation has been intensive in the past few years. A large body of work has appeared in the literature. However, so far most of the effort has been made on twodimensional wireless networks only. With the great development of wireless technologies, wireless networks ar ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Abstract—Network capacity investigation has been intensive in the past few years. A large body of work has appeared in the literature. However, so far most of the effort has been made on twodimensional wireless networks only. With the great development of wireless technologies, wireless networks are envisioned to extend from twodimensional space to threedimensional space. In this paper, we investigate for the first time the throughput capacity of 3D regular ad hoc networks (RANETs) and of 3D heterogeneous ad hoc networks (HANETs), respectively, by employing a generalized physical model. In 3D RANETs, we assume that the nodes are regularly placed, while in 3D HANETs, we consider that the nodes are distributed according to a general Nonhomogeneous Poisson Process (NPP). We find both lower and upper bounds in both types of networks in a broad power propagation regime, i.e., when the path loss exponent is no less than 2. I.
Smooth TradeOffs between Throughput and Delay in Mobile Ad Hoc Networks
"... Abstract—Throughput capacity in mobile ad hoc networks has been studied extensively under many different mobility models. However, most previous research assumes global mobility, and the results show that a constant pernode throughput can be achieved at the cost of very high delay. Thus, we are hav ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Abstract—Throughput capacity in mobile ad hoc networks has been studied extensively under many different mobility models. However, most previous research assumes global mobility, and the results show that a constant pernode throughput can be achieved at the cost of very high delay. Thus, we are having a very big gap here, i.e., either low throughput and low delay in static networks or high throughput and high delay in mobile networks. In this paper, employing a practical restricted random mobility model, we try to fill this gap. Specifically, we assume that a network of unit area with n nodes is evenly divided into cells with an area of n 2, each of which is further evenly divided into squares with an area of n 2 ð0 1 2 Þ. All nodes can only move inside the cell which they are initially distributed in, and at the beginning of each time slot, every node moves from its current square to a uniformly chosen point in a uniformly chosen adjacent square. By proposing a new multihop relay scheme, we present smooth tradeoffs between throughput and delay by controlling nodes ’ mobility. We also consider a network of area n ð0 1Þ and find that network size does not affect the results obtained before. Index Terms—Mobile ad hoc networks, throughput, delay, restricted mobility. Ç 1
T.: Throughput and delay analysis of hybrid wireless networks with multihop uplinks
 In: Proc. IEEE Infocom
, 2011
"... Abstract—How much information can one send through a random ad hoc network of ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract—How much information can one send through a random ad hoc network of
Heterogeneity Increases Multicast Capacity in Clustered Network
"... Abstract—In this paper, we investigate the multicast capacity for static network with heterogeneous clusters. We study the effect of heterogeneities on the achievable capacity from two aspects, including heterogeneous cluster traffic (HCT) and heterogeneous cluster size (HCS). HCT means cluster cli ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we investigate the multicast capacity for static network with heterogeneous clusters. We study the effect of heterogeneities on the achievable capacity from two aspects, including heterogeneous cluster traffic (HCT) and heterogeneous cluster size (HCS). HCT means cluster clients are more likely to appear near the cluster head, instead of being uniformly distributed across the network and HCS means each cluster is also not equal in size as most prior literatures assume. Both of these two properties are commonly found in realistic networks. For this class of networks, we find that HCT increases network capacity for all the clusters and HCS does not influence the network capacity. Our work can generalize various results obtained under nonheterogeneous networks in the literature. I.
ConvergeCast with MIMO
, 2010
"... This paper investigates throughput and delay based on a newly predominant traffic pattern, called convergecast, where each of the n nodes in the network act as a destination with k randomly chosen sources corresponding to it. Adopting MultipleInputMultipleOutput (MIMO) technology, we devise two ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
This paper investigates throughput and delay based on a newly predominant traffic pattern, called convergecast, where each of the n nodes in the network act as a destination with k randomly chosen sources corresponding to it. Adopting MultipleInputMultipleOutput (MIMO) technology, we devise two manytoone cooperative schemes under convergecast for both static and mobile ad hoc networks (MANETs), respectively. In a static network, our scheme highly utilizes hierarchical cooperation MIMO transmission. This feature overcomes the bottleneck which hinders convergecast traffic from yielding ideal performance in traditional ad hoc network, by turning the originally interfering signals into interferenceresistant ones. It helps to achieve an aggregate throughput up to Ω(n1−) for any > 0. In the mobile ad hoc case, our scheme characterizes on joint transmission from multiple nodes to multiple receivers. With optimal network division where the number of nodes per cell is constant bounded, the achievable pernode throughput can reach Θ(1) with the corresponding delay reduced to Θ(k). The gain comes from the strong and intelligent cooperation between nodes in our scheme, along with the maximum number of concurrent active cells and the shortest waiting time before transmission for each node within a cell. This, to a great extent, increases the chances for each destination to receive the data it needs with minimum overhead on extra transmission. Moreover, our convergebased analysis well unifies and generalizes previous work since the results derived from convergecast in our schemes can also cover other traffic patterns. Last but not least, our cooperative schemes are of interest not only from a theoretical perspective but also shed light on future design of MIMO schemes in wireless networks. 1
1Scaling Laws for Throughput Capacity and Delay in Wireless Networks – A Survey
"... Abstract—The capacity scaling law of wireless networks has been considered as one of the most fundamental issues. In this survey, we aim at providing a comprehensive overview of the development in the area of scaling laws for throughput capacity and delay in wireless networks. We begin with backgro ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract—The capacity scaling law of wireless networks has been considered as one of the most fundamental issues. In this survey, we aim at providing a comprehensive overview of the development in the area of scaling laws for throughput capacity and delay in wireless networks. We begin with background information on the notion of throughput capacity of random networks. Based on the benchmark random network model, we then elaborate the advanced strategies adopted to improve the throughput capacity, and other factors that affect the scaling laws. We also present the fundamental tradeoffs between throughput capacity and delay under a variety of mobility models. In addition, the capacity and delay for hybrid wireless networks are surveyed, in which there are at least two types of nodes functioning differently, e.g., normal nodes and infrastructure nodes. Finally, recent studies on scaling law for throughput capacity and delay in emerging vehicular networks are introduced. Index Terms—Fundamental limits, scaling laws, throughput capacity, delay, wireless networks. I.