Abstract-Equipping wireless nodes with multiple radios can significantly increase the capacity of wireless networks, by making these radios simultaneously transmit over multiple nonoverlapping 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 provablygood 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 inductivescheduling technique, each radio can also backoff appropriately to avoid collisions. Extensive simulations demonstrate that our bounds are valid in practice.
In REF , a distributed joint channel allocation of links and packet scheduling for Software-Defined Radio, called CLDS (Collision-free Distributed Scheduling) combines the use of an access hash function with the inductive scheduling technique.
Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks
IEEE INFOCOM 2009
IEEE INFOCOM 2009
Computer Science