Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
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
Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Capacity of a wireless ad hoc network with infrastructure
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Multicast capacity of wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Throughput, delay, and mobility in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
The capacity of heterogeneous wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Capacity of hybrid wireless networks with directional antenna and delay constraint
IEEE Transactions on Communications
Speed Improves Delay-Capacity Trade-Off in MotionCast
IEEE Transactions on Parallel and Distributed Systems
The capacity of wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Capacity of ad hoc wireless networks with infrastructure support
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study the effect of various geometries on the capacity of wireless networks via percolation, which was not considered much before. Percolation theory was first applied to derive an achievable rate 1/√n in [5] by constructing a highway system, in contrast with the previous result Θ(1/√nlogn) in [6], where n is the number of the nodes. While a highway system that consists of both horizontal and vertical edge-disjoint paths exists in a square network, B. Liu et al. in [1] pointed out that the horizontal paths will disappear if the width of a strip network is increasing more slowly than log n. In this paper, first we take a deeper look at the percolation in a strip network. We discover that when a highway system exists, the capacity is restricted by the maximum length of the sides. Moreover, a sub-highway system is still in presence when the highway system disappears. Secondly, we consider the situations in a triangle network. Conditions that percolation highway exists in it, and the achievable rate for a triangle network are discussed. We find that corner effect can be a bottleneck of the capacity. By combining the achievable rate of the former networks, we attribute the variance between them to their symmetry discrepancies. Finally, we turn to the capacity of three dimensional (3D) networks via percolation. The whole study shows that geometric symmetry plays a significant role in the percolation and the capacity, thereby shedding a light on the network design and the scheduling.