Channel Assignment in Dense MC-MR Wireless Networks: Scaling Laws and Algorithms
Rahul Urgaonkar, Ram Ramanathan, Jason Redi, William N. Tetteh

TL;DR
This paper explores optimal channel assignment strategies in dense MC-MR wireless networks, proposing algorithms that significantly improve per node throughput and analyzing the fundamental limits of such networks.
Contribution
It introduces new algorithms for channel assignment that optimize throughput in dense MC-MR networks and establishes fundamental relationships between throughput, channels, and network size.
Findings
Algorithms achieve near-optimal throughput performance.
Proposed methods scale with network size and transceiver constraints.
Fundamental throughput-channel-network size relationship identified.
Abstract
We investigate optimal channel assignment algorithms that maximize per node throughput in dense multichannel multi-radio (MC-MR) wireless networks. Specifically, we consider an MC-MR network where all nodes are within the transmission range of each other. This situation is encountered in many real-life settings such as students in a lecture hall, delegates attending a conference, or soldiers in a battlefield. In this scenario, we show that intelligent assignment of the available channels results in a significantly higher per node throughput. We first propose a class of channel assignment algorithms, parameterized by T (the number of transceivers per node), that can achieve per node throughput using channels. In view of practical constraints on , we then propose another algorithm that can achieve per node throughput…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
