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
Scaling laws for ad hoc wireless networks: an information theoretic approach
Foundations and Trends® in Networking
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
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
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 subcritical regime
IEEE/ACM Transactions on Networking (TON)
Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks
IEEE Transactions on Information Theory
Network capacity region and minimum energy function for a delay-tolerant mobile ad hoc network
IEEE/ACM Transactions on Networking (TON)
Delay and capacity tradeoff analysis for motioncast
IEEE/ACM Transactions on Networking (TON)
On the critical delays of mobile networks under Lévy walks and Lévy flights
IEEE/ACM Transactions on Networking (TON)
Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks
IEEE/ACM Transactions on Networking (TON)
Delay and capacity in MANETs under random walk mobility model
Wireless Networks
Hi-index | 0.06 |
We analyze the capacity scaling laws of mobile ad hoc networks comprising heterogeneous nodes and spatial inhomogeneities. Most of previous work relies on the assumption that nodes are identical and uniformly visit the entire network space. Experimental data, however, show that the mobility pattern of individual nodes is usually restricted over the area, while the overall node density is often largely inhomogeneous due to the presence of node concentration points. In this paper we introduce a general class of mobile networks which incorporates both restricted mobility and inhomogeneous node density, and describe a methodology to compute the asymptotic throughput achievable in these networks by the store-carry-forward communication paradigm. We show how the analysis can be mapped, under mild assumptions, into a Maximum Concurrent Flow (MCF) problem over an associated Generalized Random Geometric Graph (GRGG). Moreover, we propose an asymptotically optimal scheduling and routing scheme that achieves the maximum network capacity.