An admission control algorithm for multi-hop 802.11e based WLANs
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Capacity of a wireless ad hoc network with infrastructure
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Routing in outer space: fair traffic load in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
An admission control algorithm for multi-hop 802.11e-based WLANs
Computer Communications
A gateway placement algorithm in wireless mesh networks
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Throughput of cellular systems with conferencing mobiles and cooperative base stations
EURASIP Journal on Wireless Communications and Networking - Theory and Applications in Multiuser/Multiterminal Communications
On the Capacity of Hybrid Wireless Networks with Opportunistic Routing
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
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
Scalability and performance evaluation of hierarchical hybrid wireless networks
IEEE/ACM Transactions on Networking (TON)
Cognitive networks achieve throughput scaling of a homogeneous network
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Opportunistic relaying in wireless networks
IEEE Transactions on Information Theory
On the capacity of hybrid wireless networks with opportunistic routing
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
Capacity of mobile ad hoc network with infrastructure support
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Capacity of wireless networks with heterogeneous traffic
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
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
Optimal throughput of two-hop relay networks with different relay cooperation
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Cellular systems with non-regenerative relaying and cooperative base stations
IEEE Transactions on Wireless Communications
A geometry study on the capacity of wireless networks via percolation
IEEE Transactions on Communications
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
On optimizing gateway placement for throughput in wireless mesh networks
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
DTN support for news dissemination in an urban area
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
On multicast throughput scaling of hybrid wireless networks with general node density
Computer Networks: The International Journal of Computer and Telecommunications Networking
The minimum number of gateways for maximizing throughput in wireless mesh networks
Proceedings of the Second Symposium on Information and Communication Technology
Throughput capacity of UWB ad-hoc networks with infrastructure support
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Fine grained load balancing in multi-hop wireless networks
Journal of Parallel and Distributed Computing
Mitigating the impact of node mobility using mobile backbone for heterogeneous MANETs
Computer Communications
DTN support for news dissemination in an urban area
Computer Networks: The International Journal of Computer and Telecommunications Networking
Throughput and energy-aware routing for 802.11 based mesh networks
Computer Communications
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Channel assignment strategies for optimal network capacity of IEEE 802.11s
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Asymptotic Throughput Capacity Analysis of Multi-Channel, Multi-Interface Wireless Mesh Networks
Wireless Personal Communications: An International Journal
Opportunistic networks architecture with fixed infrastructure nodes
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
The capacity of aeronautical ad-hoc networks
Proceedings of the second ACM MobiHoc workshop on Airborne networks and communications
Wireless Personal Communications: An International Journal
Hi-index | 0.13 |
We determine the asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network with both ad hoc nodes, which communicate with each other via shared wireless links of capacity W bits/s, and infrastructure nodes which in addition are interconnected with each other via high capacity links. Specifically, we consider a network model where ad hoc nodes are randomly spatially distributed and choose to communicate with a random destination. We identify three scaling regimes, depending on the growth of the number of infrastructure nodes, m relative to the number of ad hoc nodes n, and show the asymptotic scaling for the per user throughput as n becomes large. We show that when m ≲ √n/logn the per user throughput is of order W/√n log n and could be realized by allowing only ad hoc communications, i.e., not deploying the infrastructure nodes at all. Whenever √n/log n ≲ m ≲ n/log n, the order for the per user throughput is Wm/n and, thus, the total additional bandwidth provided by m infrastructure nodes is effectively shared among ad hoc nodes. Finally, whenever m ≳ n/log n, the order of the per user throughput is only W/log n, suggesting that further investments in infrastructure nodes will not lead to improvement in throughput. The results are shown through an upper bound which is independent of the routing strategy, and by constructing scenarios showing that the upper bound is asymptotically tight.