This paper proposes novel scheduling techniques to support real-time traffic and data bursty traffic under quality of service guarantees. In particular, two polling-based approaches are compared: (i) when a source is enabled to transmit, a burst of packets is sent at once; (ii) within the time interval destined to a traffic class, a cyclic service of the sources is allowed on a packet basis. Considering both radio channel conditions and protocol signaling overhead, this paper compares these two different approaches and the Dynamic Slot Assignment++ (DSA++) scheme appeared in the literature, showing that our second scheme (case ii) achieves a good performance.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||A novel polling-based scheduling approach for an efficient radio resource sharing in wireless networks|
|Citazione:||Andreadis, A., Benelli, G., & Giambene, G. (2003). A novel polling-based scheduling approach for an efficient radio resource sharing in wireless networks. In 2003 IEEE 58TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS1-5, PROCEEDINGS (pp.1647-1651). New York : IEEE.|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|
File in questo prodotto: