TY - CONF T1 - Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks T2 - IEEE INFOCOM 2009 Y1 - 2009 A1 - Han,Bo A1 - Kumar,V. S.A A1 - Marathe,M. V A1 - Parthasarathy,S. A1 - Srinivasan, Aravind KW - access hash function KW - Channel allocation KW - channel assignment algorithm KW - channel capacity KW - collision avoidance KW - Computer science KW - cryptography KW - distributed algorithm KW - distributed algorithms KW - Educational institutions KW - inductive-scheduling technique KW - Interference KW - interference set KW - packet scheduling algorithm KW - Peer to peer computing KW - Radio network KW - radio networks KW - radiofrequency interference KW - random oracle methodology KW - scheduling KW - Scheduling algorithm KW - simultaneous channel allocation KW - software radio KW - software-defined radio wireless network capacity KW - telecommunication congestion control KW - telecommunication security KW - Throughput KW - wireless channels KW - Wireless networks AB - Equipping wireless nodes with multiple radios can significantly increase the capacity of wireless networks, by making these radios simultaneously transmit over multiple non-overlapping channels. However, due to the limited number of radios and available orthogonal channels, designing efficient channel assignment and scheduling algorithms in such networks is a major challenge. In this paper, we present provably-good distributed algorithms for simultaneous channel allocation of individual links and packet-scheduling, in software-defined radio (SDR) wireless networks. Our distributed algorithms are very simple to implement, and do not require any coordination even among neighboring nodes. A novel access hash function or random oracle methodology is one of the key drivers of our results. With this access hash function, each radio can know the transmitters' decisions for links in its interference set for each time slot without introducing any extra communication overhead between them. Further, by utilizing the inductive-scheduling technique, each radio can also backoff appropriately to avoid collisions. Extensive simulations demonstrate that our bounds are valid in practice. JA - IEEE INFOCOM 2009 PB - IEEE SN - 978-1-4244-3512-8 M3 - 10.1109/INFCOM.2009.5062069 ER -