Randomized algorithms
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
Throughput capacity of random ad hoc networks with infrastructure support
Proceedings of the 9th annual international conference on Mobile computing and networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Modelling and performance analysis of the distributed scheduler in IEEE 802.16 mesh mode
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and 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
Throughput and delay optimization in interference-limited multihop networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Algorithm design for base station placement problems in sensor networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
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 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
Performance optimization of interference-limited multihop networks
IEEE/ACM Transactions on Networking (TON)
Efficient route discovery in hybrid networks
Ad Hoc Networks
Capacity of multichannel wireless networks under the protocol model
IEEE/ACM Transactions on Networking (TON)
Mobility increases the connectivity of K-hop clustered wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Capacity and delay of hybrid wireless broadband access networks
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Capacity scaling of wireless networks with inhomogeneous node density: upper bounds
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)
Scalability and performance evaluation of hierarchical hybrid wireless networks
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)
Impact of traffic localization on communication rates in ad-hoc networks
Wireless Networks
Capacity of mobile ad hoc network with infrastructure support
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Downlink capacity of hybrid cellular ad hoc networks
IEEE/ACM Transactions on Networking (TON)
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
A geometry study on the capacity of wireless networks via percolation
IEEE Transactions on Communications
Capacity scaling of wireless networks with inhomogeneous node density: lower bounds
IEEE/ACM Transactions on Networking (TON)
Throughput capacity of UWB ad-hoc networks with infrastructure support
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Network capacity of wireless ad hoc networks with delay constraint
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Analysis of capacity improvement by directional antennas in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Network topology models for multihop wireless networks
ISRN Communications and Networking
Mobility increases the connectivity of wireless networks
IEEE/ACM Transactions on Networking (TON)
A Constructive Capacity Lower Bound of the Inhomogeneous Wireless Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.01 |
We present capacity results for three classes of wireless ad hoc networks, using a general framework that allows their unified treatment. The results hold with probability going to 1 as the number of nodes in the network approaches infinity, and under a general model for channel fading.We first study asymmetric networks that consist of n source nodes and around nd destination nodes, communicating over a wireless channel. Each source node creates data traffic that is directed to a destination node chosen at random. When ½ ‹ d ‹ 1, an aggregate throughput that increases with n as n½ is achievable. If, however, 0 ‹ d ‹ ½, bottlenecks are formed and the aggregate throughput can not increase faster than nd.We also consider cluster networks, that consist of n client nodes and around nd cluster heads, communicating over a wireless channel. Each of the clients wants to communicate with one of the cluster heads, but the particular choice of cluster head is not important. In this setting, the maximum aggregate throughput is on the order of nd, and it can be achieved with no transmissions taking place between client nodes.We conclude with the study of hybrid networks. These consist of n wireless nodes and around nd access points. The access points are equipped with wireless transceivers, but are also connected with each other through an independent network of infinite capacity. Their only task is to support the operation of the wireless nodes. When ½ ‹ d ‹ 1, an aggregate throughput on the order of nd is achievable, through the use of the infrastructure. If, however, 0 ‹ d ‹ ½, using the infrastructure offers no significant gain, and the wireless nodes can achieve an aggregate throughput on the order of n½ by using the wireless medium only.