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
Scaling laws for ad hoc wireless networks: an information theoretic approach
Foundations and Trends® in Networking
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
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
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
Throughput and Delay in Random Wireless Networks With Restricted Mobility
IEEE Transactions on Information Theory
Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we analyze asymptotic delay-throughput performance of mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. In particular, we consider a scenario in which each node moves around one or more home-points (in a finite number) randomly placed over the area. For such restricted mobility model, we propose a new class of scheduling and routing schemes, which significantly outperforms all delay-throughput results previously obtained.