Randomized algorithms
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)
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
Locating mobile nodes with EASE: learning efficient routes from encounter histories alone
IEEE/ACM Transactions on Networking (TON)
Scaling laws for ad hoc wireless networks: an information theoretic approach
Foundations and Trends® in Networking
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
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)
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Even One-Dimensional Mobility Increases the Capacity of Wireless Networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Optimal 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)
Throughput and delay scaling laws for mobile overlaid wireless networks
Journal of Network and Computer Applications
Delay and capacity in MANETs under random walk mobility model
Wireless Networks
| Hi-index | 754.84 |
In this paper, we analyze asymptotic delay-throughput tradeoffs in mobile ad hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spatial heterogeneity has the ability to drastically improve upon existing scaling laws established under the assumption that nodes are identical and uniformly visit the entire network area. In particular, we consider the situation in which each node moves around its own home-point according to a restricted mobility process which results into a spatial stationary distribution that decays as a power law of exponent δ with the distance from the home-point. For such restricted mobility model, we propose a novel class of scheduling and routing schemes, which significantly outperforms all delay-throughput results previously obtained in the case of identical nodes. In particular, for δ = 2 it is possible to achieve almost constant delay and almost constant per-node throughput (except for a polylogarithmic factor) as the number of nodes increases, even without resorting to sophisticated coding or signal processing techniques.