Results 11  20
of
66
On Delay Constrained Multicast Capacity of LargeScale Mobile AdHoc Networks
, 907
"... Abstract — This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET consists of ns multicast sessions. Each multicast session has one source and p destinations. The wireless mobiles move according to a twodimensional i.i.d. mobi ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
(Show Context)
Abstract — This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET consists of ns multicast sessions. Each multicast session has one source and p destinations. The wireless mobiles move according to a twodimensional i.i.d. mobility model. Each source sends identical information to the p destinations in its multicast session, and the information is required to be delivered to all the p destinations within D timeslots. Given the delay constraint “ D, we n first prove that theq capacity o” D per multicast session is O min 1, (log p)(log (nsp)). ns 1 We then propose a“ jointncoding/scheduling q o ” algorithm achieving D a throughput of Θ min 1,. Our simulations show that ns the joint coding/scheduling “ n qalgorithm o ” achieves a throughput of D the same order (Θ min 1, ) under random walk model ns and random waypoint model. I.
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
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.
Network Capacity Region and Minimum Energy Function for a DelayTolerant Mobile Ad Hoc Network
 IEEE TRANSACTIONS ON NETWORKING (TO APPEAR)
"... We investigate two quantities of interest in a delaytolerant mobile ad hoc network: the network capacity region and the minimum energy function. The network capacity region is defined as the set of all input rates that the network can stably support considering all possible scheduling and routing a ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We investigate two quantities of interest in a delaytolerant mobile ad hoc network: the network capacity region and the minimum energy function. The network capacity region is defined as the set of all input rates that the network can stably support considering all possible scheduling and routing algorithms. Given any input rate vector in this region, the minimum energy function establishes the minimum time average power required to support it. In this work, we consider a cellpartitioned model of a delaytolerant mobile ad hoc network with general Markovian mobility. This simple model incorporates the essential features of locality of wireless transmissions as well as node mobility and enables us to exactly compute the corresponding network capacity and minimum energy function. Further, we propose simple schemes that offer performance guarantees that are arbitrarily close to these bounds at the cost of an increased delay.
Coding achieves the optimal delaythroughput tradeoffs in mobile adhoc networks
 in Proceedings of the IEEE International Symposium on Modeling and Optimization in Mobile, AdHoc and Wireless Networks (WiOpt
, 2007
"... Abstract — The delaythroughput tradeoff of a mobile wireless network under the twodimensional i.i.d mobility model has been investigated in [14], where we showed that the optimal tradeoff can be achieved using rateless codes. In this paper, we extend the result to a hybrid random walk model wit ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
Abstract — The delaythroughput tradeoff of a mobile wireless network under the twodimensional i.i.d mobility model has been investigated in [14], where we showed that the optimal tradeoff can be achieved using rateless codes. In this paper, we extend the result to a hybrid random walk model with fast mobiles. We first prove that the maximum throughput per sourcedestination (SD) pair is O ( √ D/n) when S = o(1) and D = ω(logS/S 2), and then propose a joint codingscheduling scheme to achieve the maximum throughput when S = o(1) and D is both ω(max{(log 2 n)logS/S 6, 3 √ nlogn}) and o(n/log 2 n), where n is the number of mobile nodes and S is the step size of the hybrid random walk. I. NOTATIONS The following notations are used throughout this paper, given nonnegative functions f(n) and g(n):
On distribution and limits of information dissemination latency and speed in mobile cognitive radio networks
 in Proc. IEEE Conf. Comput. Commun
"... Abstract—Dissemination latency and speed are central to the applications of cognitive radio networks, which have become an important component of current communication infrastructure. In this paper, we investigate the distributions and limits of information dissemination latency and speed in a cogni ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
(Show Context)
Abstract—Dissemination latency and speed are central to the applications of cognitive radio networks, which have become an important component of current communication infrastructure. In this paper, we investigate the distributions and limits of information dissemination latency and speed in a cognitive radio network where licensed users (primary users) are static and cognitive radio users (secondary users) are mobile. We show that the dissemination latency depends on the stationary spatial distribution and mobility capability
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
Throughputdelay tradeoffs in largescale manets with network coding
, 2008
"... Abstract—This paper characterizes the throughputdelay tradeoffs in mobile ad hoc networks (MANETs) with network coding, and compares results in the situation where only replication and forwarding are allowed in each node. The schemes/protocols achieving those tradeoffs in an effective and decentra ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract—This paper characterizes the throughputdelay tradeoffs in mobile ad hoc networks (MANETs) with network coding, and compares results in the situation where only replication and forwarding are allowed in each node. The schemes/protocols achieving those tradeoffs in an effective and decentralized way are proposed and the optimality of those tradeoffs is established. The scenarios in which network coding can provide significant improvement on network performance are identified under different node mobility patterns (fast and slow mobility). The insights on when and how information mixing is beneficial for MANETs with multiple unicast and multicast sessions are provided. As far as we know, this is the first work characterizing scaling laws of throughput and delay of MANETs with network coding. I.
Stochastic Properties of Mobility Models in Mobile Ad Hoc Networks
"... The stochastic model assumed to govern the mobility of nodes in a mobile ad hoc network have been shown to significantly affect the network’s coverage, maximum throughput, and achievable throughputdelay tradeoffs. In this paper, we compare several mobility models, including the random walk, random ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
The stochastic model assumed to govern the mobility of nodes in a mobile ad hoc network have been shown to significantly affect the network’s coverage, maximum throughput, and achievable throughputdelay tradeoffs. In this paper, we compare several mobility models, including the random walk, random waypoint and Manhattan models, on the basis of the number of states visited in a fixed time, the time to visit every state in a region, and the effect of the number of wandering nodes on the time to first entrance to a set of states. These metrics for a mobility model are useful for assessing the achievable event detection rates in surveillance applications where wirelesssensorequipped vehicles are used to detect events of interest in a city. We also consider mobility models based on Correlated Random Walks, which can account for time dependency, geographical restrictions, and nonzero drift. We demonstrate that these models are analytically tractable by using a matrixanalytic approach to derive new, closedform results in both the time and transformdomains for the probability that a node is at any location at any time for both semiinfinite and finite onedimensional lattices. We also derive first entrance time distributions for these walks. We find that a correlated random walk (i) covers more ground in a given amount of time and takes a smaller amount of time to cover an area completely than a random walk with the same average transition rate; (ii) has a smaller first entrance time to small sets of states than the random waypoint and random walk models and (iii) leads to a uniform distribution of nodes (except at the boundaries) in steady state. Index Terms MANET, mobility models, correlated random walk, random walk, random waypoint model.
Modeling secure connectivity of selforganized wireless ad hoc networks
 in IEEE INFOCOM
"... Abstract—Wireless ad hoc networks (WANETs) offer communications over a shared wireless channel without any preexisting infrastructure. Forming peertopeer security associations in selforganized WANETs is more challenging than in conventional networks due to the lack of central authorities. In th ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
Abstract—Wireless ad hoc networks (WANETs) offer communications over a shared wireless channel without any preexisting infrastructure. Forming peertopeer security associations in selforganized WANETs is more challenging than in conventional networks due to the lack of central authorities. In this paper, we propose a generic model to evaluate the relationship of connectivity, memory size, communication overhead and security in fully selforganized WANETs. Based on some reasonable assumptions on node deployment and mobility, we show that when the average number of authenticated neighbors of each node is Θ(1), with respect to the network size n, most of the nodes can be securely connected, forming a connected secure backbone, i.e., the secure network percolates. This connected secure backbone can be utilized to break routingsecurity dependency loop, and provide enough derived secure links connecting isolated nodes with the secure backbone in a multihop fashion, which leads to the secure connectivity of the whole network. I.