Randomized algorithms
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of 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
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Characterizing mobility and network usage in a corporate wireless local-area network
Proceedings of the 1st international conference on Mobile systems, applications and services
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Locating mobile nodes with EASE: learning efficient routes from encounter histories alone
IEEE/ACM Transactions on Networking (TON)
Low-cost communication for rural internet kiosks using mechanical backhaul
Proceedings of the 12th annual international conference on Mobile computing and networking
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
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the super-critical regime
IEEE/ACM Transactions on Networking (TON)
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
Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks
IEEE Transactions on Information Theory
Delay and capacity tradeoff analysis for motioncast
IEEE/ACM Transactions on Networking (TON)
Performance Modeling for Relay Cooperation in Delay Tolerant Networks
Mobile Networks and Applications
Delay and capacity in MANETs under random walk mobility model
Wireless Networks
| Hi-index | 0.06 |
In this paper, we provide the scaling laws for the transport capacity of a wide class of mobile wireless ad hoc networks. Our analysis generalizes previous results obtained under restrictive assumptions on the node mobility process and overall node density over the network area. The broader family of mobile networks that we consider is able to account for many important characteristics usually recognized in real traces of both human and vehicular mobility. In particular, we consider clustered networks of heterogeneous nodes, in which the shape of the spatial distribution of each node around one or more home-points plays a fundamental role in determining the overall transport capacity. We identify different operational regimes that arise within our general class of mobile networks, and for each regime we characterize the asymptotic network capacity.