Elements of information theory
Elements of information theory
Randomized algorithms
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Using directional antennas for medium access control in ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
On the interdependence of routing and data compression in multi-hop sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Introduction to Algorithms
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Lattice Quantization With Side Information: Codes, Asymptotics, and Applications in Sensor Networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
On the scalability and capacity of wireless networks with omnidirectional antennas
Proceedings of the 3rd international symposium on Information processing in sensor networks
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 scalable model for channel access protocols in multihop ad hoc networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Space-based multi-hop networking
Computer Networks and ISDN Systems - Interplanetary internet
On Designing MAC Protocols for Wireless Networks Using Directional Antennas
IEEE Transactions on Mobile Computing
Multibeam Antenna-Based Topology Control with Directional Power Intensity for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Extending the capacity of ad hoc networks beyond network coding
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Challenges: towards truly scalable ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and 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
The capacity and energy efficiency of wireless ad hoc networks with multi-packet reception
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Space-based multi-hop networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the super-critical regime
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless ad hoc networks with multi-packet reception
IEEE Transactions on Communications
Multi-commodity flow problem for multi-hop wireless networks with realistic smart antenna model
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Capacity of hybrid wireless networks with directional antenna and delay constraint
IEEE Transactions on Communications
A novel approach to power allocation in wireless ad hoc networks
Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Improved asymptotic multicast throughput for random extended networks
Computer Communications
Exact and approximation algorithms for geometric and capacitated set cover problems
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On how to circumvent the MANET scalability curse
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Pervasive and Mobile Computing
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Network topology models for multihop wireless networks
ISRN Communications and Networking
| Hi-index | 0.00 |
We consider the problem of determining rates of growth for the maximum stable throughput achievable in dense wireless networks. We formulate this problem as one of finding maximum flows on random unit-disk graphs. Equipped with the max-flow/min-cut theorem as our basic analysis tool, we obtain rates of growth under three models of communication: (a) omnidirectional transmissions; (b) "simple" directional transmissions, in which sending nodes generate a single beam aimed at a particular receiver; and (c) "complex" directional transmissions, in which sending nodes generate multiple beams aimed at multiple receivers. Our main finding is that an increase of Θlog2n in maximum stable throughput is all that can be achieved by allowing arbitrarily complex signal processing (in the form of generation of directed beams) at the transmitters and receivers. We conclude therefore that neither directional antennas, nor the ability to communicate simultaneously with multiple nodes, can be expected in practice to effectively circumvent the constriction on capacity in dense networks that results from the geometric layout of nodes in space.