Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
On conditions for constant throughput in wireless networks
ACM Transactions on Sensor Networks (TOSN)
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobility emulator for DTN and MANET applications
Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization
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)
Throughput scaling of wireless networks with random connections
IEEE Transactions on Information Theory
Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks
IEEE Transactions on Information Theory
Scaling laws for overlaid wireless networks: a cognitive radio network versus a primary network
IEEE/ACM Transactions on Networking (TON)
Mobile geometric graphs: detection, coverage and percolation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Impact of correlated mobility on delay-throughput performance in mobile ad hoc networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.96 |
We study the capacity of ad hoc wireless networks with mobile nodes. The mobility model examined is one where the nodes are restricted to move along one-dimensional paths. We examine the scaling laws for the per-user throughput achievable over long time-scales, making this suitable for applications with loose delay constraints. We show that under this regime of restricted mobility, we attain a constant throughput (i.e.,$Theta(1)$) per user, which is significantly higher than the throughput of fixed networks, which decays as$O(1over sqrtn)$with the number of nodes$n$, as shown by Gupta and Kumar.