Randomized algorithms
Multiuser Detection
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
On the maximum stable throughput problem in random networks with directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the capacity improvement of ad hoc wireless networks using directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
Proceedings of the 11th annual international conference on Mobile computing and networking
Optimal throughput-delay scaling in wireless networks: part I: the fluid model
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Hot topic: physical-layer network coding
Proceedings of the 12th annual international conference on Mobile computing and networking
Embracing wireless interference: analog network coding
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Challenges: towards truly scalable ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Bits-per-Joule Capacity of Energy-Limited Wireless Networks
IEEE Transactions on Wireless Communications
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
IEEE Communications Magazine
The capacity of wireless ad hoc networks with multi-packet reception
IEEE Transactions on Communications
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Improved asymptotic multicast throughput for random extended networks
Computer Communications
Cell-based snapshot and continuous data collection in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop paths and nodes can transmit or receive at most one packet at a time. We define the energy efficiency ·(n) as the bit-meters of information transferred in the network for each unit energy. We compute the energy efficiency of many different techniques aimed at increasing the capacity of wireless networks and show that, in order to achieve higher transport capacity, a lower energy efficiency must be attained. Using the physical model, we compute the throughput capacity of random wireless ad hoc networks in which nodes are endowed with multi-packet reception (MPR) capabilities. We show that λ(n)= Θ (R(n))(1-2/α) / n1/α) bits per second constitutes a tight upper and lower bound for the throughput of random wireless ad hoc networks, where α2 is the path loss parameter in the physical model, n is the total number of nodes in the network, and R(n) is the MPR receiver range. In doing so, we close the gap between the lower and upper bounds for the throughput capacity of wireless networks in the physical model. Compared to the original result derived for plain routing by Gupta and Kumar, MPR achieves a capacity gain of at least Θ((log n)α-2/2α) when RR(n)= Θ(√log n/n).