Introduction to algorithms
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
The capacity of wireless networks
IEEE Transactions on Information Theory
Heterogeneous multi-channel wireless networks: routing and link layer protocols
ACM SIGMOBILE Mobile Computing and Communications Review
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Impact of multiple channels and radios on the performance of a TDMA based wireless mesh network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multicast capacity for multi-hop multi-channel multi-radio wireless networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
From theory to practice: evaluating static channel assignments on a wireless mesh network
INFOCOM'10 Proceedings of the 29th conference on Information communications
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model
Foundations and Trends® in Networking
Multicast capacity of wireless ad hoc networks under Gaussian channel model
IEEE/ACM Transactions on Networking (TON)
Channel, capacity, and flow assignment in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the price of security in large-scale wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
With the availability of multiple unlicensed spectral bands, and potential cost-based limitations on the capabilities of individual nodes, it is increasingly relevant to study the performance of multi-channel wireless networks with channel switching constraints. To this effect, some constraint models have been recently proposed, and connectivity and capacity results have been formulated for networks of randomly deployed single-interface nodes subject to these constraints. One of these constraint models is termed random (c, f) assignment, wherein each node is pre-assigned a random subset of f channels out of c (each having bandwidth Wc), and may only switch on these. Previous results for this model established bounds on network capacity, and proved that when c=O(logn), the per-flow capacity is O(W√prndnlogn) and Ω(W√fcnlogn) (where prnd = 1 - (1-fc)(1-fc-1)...(1-fc-f+1) ≥ 1-ε-f2c). In this paper we present a lower bound construction that matches the previous upper bound. This establishes the capacity as Θ(W√prndnlogn). The surprising implication of this result is that when f=Ω(√c), random (c, f) assignment yields capacity of the same order as attainable via unconstrained switching. The routing/scheduling procedure used by us to achieve capacity requires synchronized route-construction for all flows in the network, leading to the open question of whether it is possible to achieve capacity using asynchronous procedures.