Randomized algorithms
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
On the maximum stable throughput problem in random networks with directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Throughput capacity of random ad hoc networks with infrastructure support
Proceedings of the 9th annual international conference on Mobile computing and networking
Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
Characterizing mobility and network usage in a corporate wireless local-area network
Proceedings of the 1st international conference on Mobile systems, applications and services
Extracting places from traces of locations
ACM SIGMOBILE Mobile Computing and Communications Review
The capacity of wireless networks
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
Even One-Dimensional Mobility Increases the Capacity of Wireless Networks
IEEE Transactions on Information Theory
Multicast capacity for hybrid wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Scaling properties of delay tolerant networks with correlated motion patterns
Proceedings of the 4th ACM workshop on Challenged networks
Delay-throughput performance in mobile ad-hoc networks with heterogeneous nodes
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the super-critical regime
IEEE/ACM Transactions on Networking (TON)
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the subcritical regime
IEEE/ACM Transactions on Networking (TON)
Capacity of mobile ad hoc network with infrastructure support
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
On delay constrained multicast capacity of large-scale mobile ad-hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the impact of mobility on multicast capacity of wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Impact of correlated mobility on delay-throughput performance in mobile ad-hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
ACM Computing Surveys (CSUR)
Multicast capacity of wireless ad hoc networks under Gaussian channel model
IEEE/ACM Transactions on Networking (TON)
Closing the gap in the multicast capacity of hybrid wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Cost efficient data transfer for M2M infrastructure with heterogeneous wireless networks
Proceedings of the first ACM international workshop on Practical issues and applications in next generation wireless networks
Analysing delay-tolerant networks with correlated mobility
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Impact of correlated mobility on delay-throughput performance in mobile ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Capacity scaling of general cognitive networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analytical studies strongly rely on the assumption that nodes are identical and uniformly visit the entire network space. Experimental data, however, have shown that the mobility pattern of individual nodes is typically restricted over the area, while the overall node density is often largely inhomogeneous, due to prevailing clustering behavior resulting from hot-spots. Such ubiquitous features of realistic mobility processes demand to reconsider the scaling laws for the per-user throughput achievable by the store-carry-forward communication paradigm which provides the foundation of many promising applications of delay tolerant networking. We show how the analysis of the asymptotic capacity of dense mobile ad-hoc networks can be transformed, under mild assumptions, into a Maximum Concurrent Flow (MCF) problem over anassociated Generalized Random Geometric Graph (GRGG). Our methodology allows to identify the scaling laws for a general class of mobile wireless networks, and to precisely determine under which conditions the mobility of nodes can indeed be exploited to increase the per-node throughput. At last we propose a simple, asymptotically optimal, scheduling and routing scheme that achieves the maximum transport capacity of the network.