Learn More
In this paper, we propose a scheduling-based medium access control (MAC) protocol for supporting multi-class services in wireless networks. The proposed protocol is a centralized MAC protocol which applies a coordinator node (CN) to coordinate the network. Our protocol is composed of a slot-scheduling algorithm called weighted scheduling and a quality of(More)
Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS.In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ)(More)
In this paper, a TV white space (TVWS) network in which there is a centralized spectrum manager (SM) is considered. The SM is connected to the geo-location database (GLDB) to periodically obtain the available spectrum fragments, and is responsible for assigning the available spectrum to the white space devices (WSDs) in its coverage region. The spectrum(More)
The majority of this paper is to develop a reliable and high-performance routing protocol for cognitive radio networks (CRN). Due to the presence of the high-priority users (primary users) in the CRN, an existing routing path may easily become unavailable for any link on the path being occupied by primary users (PUs). The most intuitive way to avoid this(More)
SUMMARY Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queue-ing(More)