Abstract
In IEEE 802.16, power management at the Mobile Subscriber Station (MSS) side is always an important issue. The standard defines three types of power saving classes (PSCs). A PSC can bind one or multiple traffic flows. However, given multiple flows in an MSS, the standard does not define how to form PSCs, how to organize the cooperation of multiple PSCs to obtain better energy efficiency, and how to guarantee QoS of these flows. Given a set of flows and their QoS parameters, the objective of this paper is to define multiple PSCs and their listen-and-sleep-related parameters and packet-scheduling policy such that the unavailability intervals of the MSS can be maximized and the QoS of each flow can be guaranteed. To achieve this, we propose a novel fold-and-demultiplex method for an IEEE 802.16 network with PSCs of types I and II together with an earliest-next-bandwidth-first packet scheduler. Given a set of traffic flows in an MSS, the fold-and-demultiplex method first gives each flow a tentative PSC satisfying its bandwidth requirement. Then we fold them together into one long series so as to calculate the total bandwidth requirement. Finally, we demultiplex the series into multiple PSCs, each supporting one or multiple flows. It ends up with high energy efficiency of MSSs while meets flows' bandwidth requirements. Furthermore, our packet scheduler ensures that real-time flows' delay constraints can be met. To the best of our knowledge, this is the first result offering bounded packet delays under MSS's sleep-and-listen behaviors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.