Scheduling in Cognitive Radio Sensor Networks-An Auction-based Mechanism

In this paper, we introduce a novel scheduling mechanism for cognitive radio sensor networks. Our approach aims at defining an optimized time slot and channel assignment that exploits spatial reuse with respect to all types of nodes communications interferences. We identify first all types of nodes conflicts, then, we solve the spatial dependencies by the mean of the Maximum Matching graph theory problem. We use after a First-price sealed-bid auction (FPSB) to perform channels and time slots assignment to completely independent cognitive sensor nodes. Our approach outperforms existing solution for scheduling in CRSN, by reducing the total length of communications and maximizing the stability factor.