Energy Efficient Resource Allocation in Heterogenous Software Defined Network : A Reverse Combinatorial Auction Approach
Zhang, D., Chang, Z., Zolotukhin, M., & Hämäläinen, T. (2015). Energy Efficient Resource Allocation in Heterogenous Software Defined Network : A Reverse Combinatorial Auction Approach. In Proceedings of the 4th IEEE/CIC International Conference on Communications in China (ICCC'2015). Symposium on Signal Processing for Communications (pp. 739-744). IEEE. https://doi.org/10.1109/ICCChina.2015.7448686
© 2015 IEEE. This is an author's post-print version of an article whose final and definitive form has been published in the conference proceeding by IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
In this paper, resource allocation for energy effi- ciency in heterogeneous Software Defined Network (SDN) with multiple network service providers (NSPs) is studied. The considered problem is modeled as a reverse combinatorial auction game, which takes different quality of service (QoS) requirements into account. The heterogeneous network selection associated with power allocation problem is optimized by maximizing the energy efficiency of data transmission. By exploiting the properties of fractional programming, the resulting non-convex Winner Determination Problem (WDP) is transformed into an equivalent subtractive convex optimization problem. The proposed reverse combinatorial auction game is proved to be strategy-proof with low computing complexity. Simulation results illustrate that with SDN controller, the proposed iterative ascending price algorithm converges in a small number of iterations and demonstrates the trade-off between energy efficiency and heterogeneous QoS requirement, especially ensures high fairness among different network service providers. ...
Parent publication ISBN978-1-5090-0243-6
ConferenceIEEE/CIC International Conference on Communications in China
Is part of publicationProceedings of the 4th IEEE/CIC International Conference on Communications in China (ICCC'2015). Symposium on Signal Processing for Communications
Publication in research information system
MetadataShow full item record
Showing items with similar title or keywords.
Chang, Zheng (University of Jyväskylä, 2013)
Khan, Wali Ullah; Jameel, Furqan; Ristaniemi, Tapani; Khan, Shafiullah; Sidhu, Guftaar Ahmad Sardar; Liu, Ju (Institute of Electrical and Electronics Engineers, 2020)Non-orthogonal multiple access (NOMA) holds the promise to be a key enabler of 5G communication. However, the existing design of NOMA systems must be optimized to achieve maximum rate while using minimum transmit power. ...
Energy-Efficient Edge Computing Service Provisioning for Vehicular Networks : A Consensus ADMM Approach Zhou, Zhenyu; Feng, Junhao; Chang, Zheng; Shen, Xuemin Sherman (Institute of Electrical and Electronics Engineers, 2019)In vehicular networks, in-vehicle user equipment (UE) with limited battery capacity can achieve opportunistic energy saving by offloading energy-hungry workloads to vehicular edge computing nodes via vehicle-to-infrastructure ...
Chang, Zheng; Zhang, Qianqian; Guo, Xijuan; Ristaniemi, Tapani (SpringerOpen, 2015)Most of the existed works on the radio resource allocation (RRA) problem commonly assume the channel-state information (CSI) can be perfectly obtained by the transmission source. However, such assumption is not practical ...
Energy efficient and distributed resource allocation for wireless powered OFDMA multi-cell networks Chang, Zheng; Wang, Zhongyu; Guo, Xijuan; Han, Zhu; Ristaniemi, Tapani (IEEE, 2017)In this paper, we investigate the energy efficient resource allocation problem for the wireless powered OFDMA multi-cell networks. In the considered system, the users who have data to transmit in the uplink can only be ...