Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655225
Dimitris M. Hatzopoulos, I. Koutsopoulos, G. Koutitas, Ward Van Heddeghem
This paper explores the problem of virtual machine (VM) allocation in a network of cloud server facilities which are deployed in different geographical areas. Each cloud server facility is connected to the conventional power grid network and in addition it is supported by an attached renewable energy source (RES). We address the problem of energy-efficient task allocation in the system in the presence of a time-varying grid energy price and the unpredictability and time variation of provisioned power by the RES. The objective is to reduce the total cost of power consumption for the operator. The key idea is to match the VM load with the RES provisioned power. Each request for a task to be executed in the cloud is associated with a VM request with certain resource requirements and a deadline by which it needs to be completed. The cloud provider has to create a VM with the resource requirements of the request and to execute the VM before the deadline. We propose an online algorithm with given look-ahead horizon, in which the grid power prices and patterns of output power of the RESs are known a priori and we compare it with a greedy online algorithm. Numerical results on real traces of cloud traffic and renewable source generation patterns are encouraging in terms of the performance of our techniques and motivate further research on the topic.
{"title":"Dynamic virtual machine allocation in cloud server facility systems with renewable energy sources","authors":"Dimitris M. Hatzopoulos, I. Koutsopoulos, G. Koutitas, Ward Van Heddeghem","doi":"10.1109/ICC.2013.6655225","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655225","url":null,"abstract":"This paper explores the problem of virtual machine (VM) allocation in a network of cloud server facilities which are deployed in different geographical areas. Each cloud server facility is connected to the conventional power grid network and in addition it is supported by an attached renewable energy source (RES). We address the problem of energy-efficient task allocation in the system in the presence of a time-varying grid energy price and the unpredictability and time variation of provisioned power by the RES. The objective is to reduce the total cost of power consumption for the operator. The key idea is to match the VM load with the RES provisioned power. Each request for a task to be executed in the cloud is associated with a VM request with certain resource requirements and a deadline by which it needs to be completed. The cloud provider has to create a VM with the resource requirements of the request and to execute the VM before the deadline. We propose an online algorithm with given look-ahead horizon, in which the grid power prices and patterns of output power of the RESs are known a priori and we compare it with a greedy online algorithm. Numerical results on real traces of cloud traffic and renewable source generation patterns are encouraging in terms of the performance of our techniques and motivate further research on the topic.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"80 1","pages":"4217-4221"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74164484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6654988
Petri Leppaaho, N. Beijar, R. Kantola, Jesus Llorente Santos
Customer Edge Switching (CES) provides policy based reachability to hosts in a private network without the disadvantages caused by traditional mechanisms for traversing Network Address Translators (NAT). The solution enables transparent communication across address realms without keep-alive signalling and application layer code in end systems as required by the current recommended approach to NAT traversal. Although most protocols traverse the customer edge correctly, we identify a few protocols that require special processing because of the IP addresses carried in the user data. This paper first presents the results of protocol compatibility testing with CES and selects two protocols, SIP and FTP, for further study. The paper then reports the implementation of Application Layer Gateways for these two protocols and provides guidelines for processing other protocols. The proposed approach significantly cuts the session establishment delays typical in SIP. The presented work is a part of a larger project that proposes the Customer Edge Switching to replace NATs and introduce co-operative firewalls for protecting customer networks.
{"title":"Traversal of the customer edge with NAT-unfriendly protocols","authors":"Petri Leppaaho, N. Beijar, R. Kantola, Jesus Llorente Santos","doi":"10.1109/ICC.2013.6654988","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654988","url":null,"abstract":"Customer Edge Switching (CES) provides policy based reachability to hosts in a private network without the disadvantages caused by traditional mechanisms for traversing Network Address Translators (NAT). The solution enables transparent communication across address realms without keep-alive signalling and application layer code in end systems as required by the current recommended approach to NAT traversal. Although most protocols traverse the customer edge correctly, we identify a few protocols that require special processing because of the IP addresses carried in the user data. This paper first presents the results of protocol compatibility testing with CES and selects two protocols, SIP and FTP, for further study. The paper then reports the implementation of Application Layer Gateways for these two protocols and provides guidelines for processing other protocols. The proposed approach significantly cuts the session establishment delays typical in SIP. The presented work is a part of a larger project that proposes the Customer Edge Switching to replace NATs and introduce co-operative firewalls for protecting customer networks.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"65 1","pages":"2933-2938"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80196892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655372
Cen Lin, M. Tao, Gordon L. Stüber, Yuan Liu
In this paper, we study the cross layer design and optimization for delay quality-of-service (QoS) provisioning in spectrum sharing femtocell networks. Our goal is to find the optimal resource allocation policy to maximize the throughput for each femtocell user, addressing the co-channel interference problem in the physical layer and the individual statistical delay-QoS guarantee problem from the upper layers. The statistical delay-QoS requirement is characterized by the QoS exponent. By integrating the concept of effective capacity, the cross-layer optimization problem is formulated as an effective capacity maximization game. With partial dual decomposition, this game is solved through a hierarchical structure. Specifically, we derive the optimal power allocation policy for femtocell users and design a distributed algorithm to obtain the Nash Equilibrium (N.E.). Numerical results show that the proposed policy can efficiently improve the performance of the networks.
{"title":"Distributed cross-layer resource allocation for statistical QoS provisioning in femtocell networks","authors":"Cen Lin, M. Tao, Gordon L. Stüber, Yuan Liu","doi":"10.1109/ICC.2013.6655372","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655372","url":null,"abstract":"In this paper, we study the cross layer design and optimization for delay quality-of-service (QoS) provisioning in spectrum sharing femtocell networks. Our goal is to find the optimal resource allocation policy to maximize the throughput for each femtocell user, addressing the co-channel interference problem in the physical layer and the individual statistical delay-QoS guarantee problem from the upper layers. The statistical delay-QoS requirement is characterized by the QoS exponent. By integrating the concept of effective capacity, the cross-layer optimization problem is formulated as an effective capacity maximization game. With partial dual decomposition, this game is solved through a hierarchical structure. Specifically, we derive the optimal power allocation policy for femtocell users and design a distributed algorithm to obtain the Nash Equilibrium (N.E.). Numerical results show that the proposed policy can efficiently improve the performance of the networks.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"43 1","pages":"5000-5004"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79404288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655183
R. Moraes, Paschalis Tsiaflakis, M. Moonen
This paper deals with the problem of power allocation in a multi-user, multicarrier communication system. This problem arises, for example, in wireless OFDM or digital subscriber line networks. Users transmitting concurrently on the same sub-carriers cause interference to each other, and this interference is a serious limitation for system performance. We consider the problem of maximizing the weighted sum of users' data rates. The optimization variables are vectors containing the powers for all users on each tone. The problem is intrinsically difficult due to the non-concavity of the utility function. We propose to change the (cartesian) power vector by its polar coordinates vector equivalent. The main contribution of this paper is to show that at least for one dimension of the polar coordinates vector, the radius, the problem is concave and thus easy to solve. We develop an algorithm based in such a polar coordinates formulation to exploit such concavity. It is demonstrated that the algorithm we propose saves considerably on computational cost compared to previous algorithms.
{"title":"Reduced complexity dynamic spectrum management based on a polar coordinates formulation","authors":"R. Moraes, Paschalis Tsiaflakis, M. Moonen","doi":"10.1109/ICC.2013.6655183","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655183","url":null,"abstract":"This paper deals with the problem of power allocation in a multi-user, multicarrier communication system. This problem arises, for example, in wireless OFDM or digital subscriber line networks. Users transmitting concurrently on the same sub-carriers cause interference to each other, and this interference is a serious limitation for system performance. We consider the problem of maximizing the weighted sum of users' data rates. The optimization variables are vectors containing the powers for all users on each tone. The problem is intrinsically difficult due to the non-concavity of the utility function. We propose to change the (cartesian) power vector by its polar coordinates vector equivalent. The main contribution of this paper is to show that at least for one dimension of the polar coordinates vector, the radius, the problem is concave and thus easy to solve. We develop an algorithm based in such a polar coordinates formulation to exploit such concavity. It is demonstrated that the algorithm we propose saves considerably on computational cost compared to previous algorithms.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"68 1","pages":"3991-3995"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76525516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655367
Kai Yang, Jie Yang, Jinsong Wu, C. Xing
In this paper, we investigate the performance of cooperative decode-and-forward (DF) multiple-input multiple-output (MIMO) relaying system with orthogonal space-time block code (OSTBC) transmissions over correlated Nakagami-m fading channels. For maximal ratio combining (MRC) receiver at the destination, we provide the compact closed-form expressions for cumulative distribution function (CDF) and probability density function (PDF) of the instantaneous end-to-end signal-to-noise ratio (SNR). In addition, the exact analytical expressions are also derived for the outage probability (OP) and symbol error rate (SER) relying on CDF. Furthermore, we present the asymptotic expressions for OP and SER in the high SNR regime, from which we gain an insight into the system performance and derive the achievable diversity order and array gain. The analytical expressions are validated through Monte-Carlo simulations.
{"title":"Performance analysis of cooperative DF relaying over correlated Nakagami-m fading channels","authors":"Kai Yang, Jie Yang, Jinsong Wu, C. Xing","doi":"10.1109/ICC.2013.6655367","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655367","url":null,"abstract":"In this paper, we investigate the performance of cooperative decode-and-forward (DF) multiple-input multiple-output (MIMO) relaying system with orthogonal space-time block code (OSTBC) transmissions over correlated Nakagami-m fading channels. For maximal ratio combining (MRC) receiver at the destination, we provide the compact closed-form expressions for cumulative distribution function (CDF) and probability density function (PDF) of the instantaneous end-to-end signal-to-noise ratio (SNR). In addition, the exact analytical expressions are also derived for the outage probability (OP) and symbol error rate (SER) relying on CDF. Furthermore, we present the asymptotic expressions for OP and SER in the high SNR regime, from which we gain an insight into the system performance and derive the achievable diversity order and array gain. The analytical expressions are validated through Monte-Carlo simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"76 1","pages":"4973-4977"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91158194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655132
D. Divakaran, G. Mohan
Bandwidth-sharing in data-center networks is an important problem that affects the growth of multi-tenant datacenters. A promising solution approach is the use of advance reservations. Such systems are usually based on deterministic models, assuming users to have precise knowledge of bandwidth they require, which is unlikely. This work takes a deviation and proposes a probabilistic model, where bandwidth requirements are specified along with some probabilities. As user-estimate of bandwidth depends on the cost they incur, we tie up the model with differential pricing; and formulate bandwidth allocation as a two-phase - static and dynamic - optimization problem. We show that the problem in each phase is NP-hard. We develop a bandwidth-allocator that processes requests and defines bandwidth profiles for accepted requests by solving the optimization problems. Numerical studies show that, in comparison to the deterministic model, our model brings down the number of rejected requests significantly, while allocating more bandwidth and thereby increasing revenue for providers.
{"title":"Probabilistic-bandwidth guarantees with pricing in data-center networks","authors":"D. Divakaran, G. Mohan","doi":"10.1109/ICC.2013.6655132","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655132","url":null,"abstract":"Bandwidth-sharing in data-center networks is an important problem that affects the growth of multi-tenant datacenters. A promising solution approach is the use of advance reservations. Such systems are usually based on deterministic models, assuming users to have precise knowledge of bandwidth they require, which is unlikely. This work takes a deviation and proposes a probabilistic model, where bandwidth requirements are specified along with some probabilities. As user-estimate of bandwidth depends on the cost they incur, we tie up the model with differential pricing; and formulate bandwidth allocation as a two-phase - static and dynamic - optimization problem. We show that the problem in each phase is NP-hard. We develop a bandwidth-allocator that processes requests and defines bandwidth profiles for accepted requests by solving the optimization problems. Numerical studies show that, in comparison to the deterministic model, our model brings down the number of rejected requests significantly, while allocating more bandwidth and thereby increasing revenue for providers.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"58 1","pages":"3716-3720"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85520086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655592
A. Awada, B. Wegmann, I. Viering, A. Klein
The Long Term Evolution (LTE) is a new radio access technology (RAT) which is currently being deployed on top of the second generation (2G) or third generation (3G) mobile networks. As a result, user equipments (UEs) will be handed over from one RAT to another. To improve the robustness of the inter-RAT handovers and reduce cost, self-organizing networks (SONs) are used to configure the inter-RAT handover thresholds in an automatic and autonomous way replacing the current manual optimization methods. The handover thresholds can be configured cell-specifically or cell-pair specifically where a dedicated handover threshold is configured with respect to each target cell of handover. However, both optimization paradigms can fail to resolve all mobility failure events in some cells where radio conditions are not stationary along the cell border. In this paper, we propose a new paradigm for configuring and optimizing the inter-RAT handover thresholds based on the locations of UEs in the cell. Simulation results show that the new paradigm outperforms cell-specific and cell-pair specific schemes by resolving additional numbers of mobility failure events.
{"title":"A location-based self-optimizing algorithm for the inter-RAT handover parameters","authors":"A. Awada, B. Wegmann, I. Viering, A. Klein","doi":"10.1109/ICC.2013.6655592","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655592","url":null,"abstract":"The Long Term Evolution (LTE) is a new radio access technology (RAT) which is currently being deployed on top of the second generation (2G) or third generation (3G) mobile networks. As a result, user equipments (UEs) will be handed over from one RAT to another. To improve the robustness of the inter-RAT handovers and reduce cost, self-organizing networks (SONs) are used to configure the inter-RAT handover thresholds in an automatic and autonomous way replacing the current manual optimization methods. The handover thresholds can be configured cell-specifically or cell-pair specifically where a dedicated handover threshold is configured with respect to each target cell of handover. However, both optimization paradigms can fail to resolve all mobility failure events in some cells where radio conditions are not stationary along the cell border. In this paper, we propose a new paradigm for configuring and optimizing the inter-RAT handover thresholds based on the locations of UEs in the cell. Simulation results show that the new paradigm outperforms cell-specific and cell-pair specific schemes by resolving additional numbers of mobility failure events.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"26 1","pages":"6168-6173"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76317287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6654810
Hongli Zhang, Panpan Li, Zhigang Zhou, Xiaojiang Du, Weizhe Zhang
As cloud computing services are gaining popularity, many organizations are considering migrating their large-scale computing applications to cloud. Different cloud service providers (CSPs) may have different computing platforms and billing methods. Most cloud customers don't know which CSP is more suitable for their applications and how much computing resource should be purchased. To address this issue, in this paper, we present a performance prediction scheme that allows a cloud customer to accurately predict computing resource (e.g., running time) for an application. The proposed scheme identifies application's control flow and scaling blocks, constructs a miniature version program to run in local machines, and then replays it in cloud to get the performance ratio between local and cloud. Our real-network experiments show that the scheme can achieve high prediction accuracy with low overhead.
{"title":"A performance prediction scheme for computation-intensive applications on cloud","authors":"Hongli Zhang, Panpan Li, Zhigang Zhou, Xiaojiang Du, Weizhe Zhang","doi":"10.1109/ICC.2013.6654810","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654810","url":null,"abstract":"As cloud computing services are gaining popularity, many organizations are considering migrating their large-scale computing applications to cloud. Different cloud service providers (CSPs) may have different computing platforms and billing methods. Most cloud customers don't know which CSP is more suitable for their applications and how much computing resource should be purchased. To address this issue, in this paper, we present a performance prediction scheme that allows a cloud customer to accurately predict computing resource (e.g., running time) for an application. The proposed scheme identifies application's control flow and scaling blocks, constructs a miniature version program to run in local machines, and then replays it in cloud to get the performance ratio between local and cloud. Our real-network experiments show that the scheme can achieve high prediction accuracy with low overhead.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"10 1","pages":"1957-1961"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84882568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655641
Li-Hsing Yen, Jiun-Jang Su, Kuei-Li Huang, C. Tseng, Kuan-Ming Liao
Crossover nodes have been utilized to achieve smooth handoffs for micro mobility management schemes. IEEE 802.11s supports proxy-based frame delivery services for mobile hosts roaming within a wireless mesh network (WMN). Discovering crossover node for mobile hosts in 802.11s WMNs, however, faces several challenges due to intrinsic properties of mesh networks. This paper identifies these challenges and proposes a scheme suitable for crossover node discovery under 802.11s WMNs. This scheme is characterized by source-oriented, MAP-centric, and per-source. It can be performed off-line with the derived results cached for on-line retrievals during handoffs. Simulation results show that the proposed scheme can reduce packet losses due to handoffs, and confirm the necessity of the source-oriented principle.
{"title":"Crossover node discovery for IEEE 802.11s wireless mesh networks","authors":"Li-Hsing Yen, Jiun-Jang Su, Kuei-Li Huang, C. Tseng, Kuan-Ming Liao","doi":"10.1109/ICC.2013.6655641","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655641","url":null,"abstract":"Crossover nodes have been utilized to achieve smooth handoffs for micro mobility management schemes. IEEE 802.11s supports proxy-based frame delivery services for mobile hosts roaming within a wireless mesh network (WMN). Discovering crossover node for mobile hosts in 802.11s WMNs, however, faces several challenges due to intrinsic properties of mesh networks. This paper identifies these challenges and proposes a scheme suitable for crossover node discovery under 802.11s WMNs. This scheme is characterized by source-oriented, MAP-centric, and per-source. It can be performed off-line with the derived results cached for on-line retrievals during handoffs. Simulation results show that the proposed scheme can reduce packet losses due to handoffs, and confirm the necessity of the source-oriented principle.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"203 1","pages":"6432-6437"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77040247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-11-07DOI: 10.1109/ICC.2013.6655537
Jingxian Wu, G. Wang, Y. R. Zheng
Energy efficiency (EE) and spectral efficiency (SE) feature one of the most fundamental tradeoffs in communication systems. In this paper, we propose an optimum transmission scheme for coded Type-I automatic repeat request (ARQ) systems to balance the EE-SE tradeoff. The optimization is performed with respect to a new design metric, the normalized EE (NEE), which is defined as the energy per bit normalized by the SE. Minimizing NEE means either reducing the energy per bit or increasing the SE, it thus yields a balanced tradeoff between the two. The system design incorporates a wide range of practical system parameters, such as circuit power, modulation, coding, and detection errors in the physical layer, and frame length and protocol overhead in the media access control layer. Under the constraints of fixed modulation level and data rate, the optimum transmission energy and frame length are identified as closed-form expressions of the system parameters. Simulation results show that minimizing the NEE instead of energy per bit almost doubles the SE with less than 1 dB loss in EE.
{"title":"Energy and spectral efficient transmissions of coded ARQ systems","authors":"Jingxian Wu, G. Wang, Y. R. Zheng","doi":"10.1109/ICC.2013.6655537","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655537","url":null,"abstract":"Energy efficiency (EE) and spectral efficiency (SE) feature one of the most fundamental tradeoffs in communication systems. In this paper, we propose an optimum transmission scheme for coded Type-I automatic repeat request (ARQ) systems to balance the EE-SE tradeoff. The optimization is performed with respect to a new design metric, the normalized EE (NEE), which is defined as the energy per bit normalized by the SE. Minimizing NEE means either reducing the energy per bit or increasing the SE, it thus yields a balanced tradeoff between the two. The system design incorporates a wide range of practical system parameters, such as circuit power, modulation, coding, and detection errors in the physical layer, and frame length and protocol overhead in the media access control layer. Under the constraints of fixed modulation level and data rate, the optimum transmission energy and frame length are identified as closed-form expressions of the system parameters. Simulation results show that minimizing the NEE instead of energy per bit almost doubles the SE with less than 1 dB loss in EE.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"5883-5887"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84336524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：