An energy-efficient scheduling for multiple MSSs in IEEE 802.16e broadband wireless

This paper proposes an energy-efficient traffic scheduling approach for 802.16e broadband wireless networks. Instead of considering a single Mobile Subscriber Station (MSS) as most of the current researchers do, multiple MSSs are considered in our work. The constant bit rate traffic with QoS delay constraint is considered in this paper. The proposed approach considers both energy efficiency and bandwidth utilization. First, we derive a minimum wakeup time for each MSS to achieve the maximum power saving by waking up the minimum number of time slots. After then, we interleave the traffic of multiple MSSs by taking advantage of feasible slot allocation. In order to support the maximum number of MSSs, our scheduling problem can be transformed into a maximum bipartite matching problem. We use the Ford-Fulkerson maximum flow algorithm to obtain a feasible schedule for multiple MSSs. Simulation results show that our proposed approach has better bandwidth utilization and achieves maximum energy saving.