2012/09/04 by Rahul Urgaonkar, Urgaonkar, Rahul, Ram Ramanathan +5
Computer Science · Engineering · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Performance (cs.PF)
paper · pdf · doi:10.48550/arxiv.1209.0676
openalex publication_date 2012/09/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate optimal channel assignment algorithms that maximize per node\nthroughput in dense multichannel multi-radio (MC-MR) wireless networks.\nSpecifically, we consider an MC-MR network where all nodes are within the\ntransmission range of each other. This situation is encountered in many\nreal-life settings such as students in a lecture hall, delegates attending a\nconference, or soldiers in a battlefield. In this scenario, we show that\nintelligent assignment of the available channels results in a significantly\nhigher per node throughput. We first propose a class of channel assignment\nalgorithms, parameterized by T (the number of transceivers per node), that can\nachieve \Θ(1/N1/T) per node throughput using \Θ(TN1-1/T)\nchannels. In view of practical constraints on T, we then propose another\nalgorithm that can achieve \Θ(1/(\log2 N)2) per node throughput using\nonly two transceivers per node. Finally, we identify a fundamental relationship\nbetween the achievable per node throughput, the total number of channels used,\nand the network size under any strategy. Using analysis and simulations, we\nshow that our algorithms achieve close to optimal performance at different\noperating points on this curve. Our work has several interesting implications\non the optimal network design for dense MC-MR wireless networks.\n