Maximizing power saving with state transition overhead for multiple mobile subscriber stations in WiMAX

作     者：Bo LI Sung-kwon PARK 

作者机构：Department of Electronic Engineering Hanyang University Seoul 133791 Korea Guangdong Provincial Key Laboratory of Big Data Analysis and Processing Sun Yat-Sen University Guangzhou 510006 China 

出 版 物：《Frontiers of Information Technology & Electronic Engineering》 (信息与电子工程前沿（英文版）)

年 卷 期：2016年第17卷第10期

页      面：1085-1094页

核心收录：

学科分类：0810[工学-信息与通信工程] 080904[工学-电磁场与微波技术] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 0839[工学-网络空间安全] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 0835[工学-软件工程] 081001[工学-通信与信息系统] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the Ministry of Science, ICT and Future Planning (Korea), the Information Technology Research Center Support Program (No. IITP-2016-H860116-1005) the Research Fund of Hanyang University, Korea (No. HY-2016), and supervised by the Institute for Information & Communications Technology Promotion 

主　　题：Power saving class State transition overhead IEEE 802.16e/m Quality of service 

摘      要：In the IEEE 802.16e/m standard, three power saving classes （PSCs） are defined to save the energy of a mobile sub- scriber station （MSS）. However, how to set the parameters of PSCs to maximize the power saving and guarantee the quality of service is not specified in the standard. Thus, many algorithms were proposed to set the PSCs in IEEE 802.16 networks. However, most of the proposed algorithms consider only the power saving for a single MSS. In the algorithms designed for multiple MSSs, the sleep state, which is set for activation of state transition overhead power, is not considered. The PSC setting for real-time connections in multiple MSSs with consideration of the state transition overhead is studied. The problem is non-deterministic polynomial time hard （NP-hard）, and a suboptimal algorithm for the problem is proposed. Simulation results demonstrate that the energy saving of the proposed algorithm is higher than that of state-of-the-art algorithms and approaches the optimum limit.