Pub Date : 2016-05-22DOI: 10.1109/ICC.2016.7510897
Li Sun, Selvaganesh Dharmeswaran, Aswin Gokulachandran, Ashish Kumar, Dimitrios Koutsonikolas
A large number of routing protocols for Cognitive radio networks (CRNs) have been proposed recently, each based on different design goals, and evaluated in different scenarios, under different assumptions. In our previous work, we conducted the first extensive empirical performance study of routing protocols for CRNs-Coolest Path, SAMER, and CRP - under the same realistic set of assumptions. Our study revealed that SAMER significantly outperforms the other protocols under low primary user activity but its performance degrades under high PU activity. In this work, we introduce an enhanced version of SAMER (SAMER+) that performs consistently well in both low and high PU activity scenarios. The core of SAMER+ is a new path metric that balances short term throughput and long term path stability. We evaluate SAMER+ using extensive simulations and compare it against SAMER and Coolest Path. Our results show that SAMER+ significantly outperforms both protocols in a variety of scenarios.
{"title":"SAMER+: Balancing short term throughput and long term stability in cognitive radio mesh networks","authors":"Li Sun, Selvaganesh Dharmeswaran, Aswin Gokulachandran, Ashish Kumar, Dimitrios Koutsonikolas","doi":"10.1109/ICC.2016.7510897","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510897","url":null,"abstract":"A large number of routing protocols for Cognitive radio networks (CRNs) have been proposed recently, each based on different design goals, and evaluated in different scenarios, under different assumptions. In our previous work, we conducted the first extensive empirical performance study of routing protocols for CRNs-Coolest Path, SAMER, and CRP - under the same realistic set of assumptions. Our study revealed that SAMER significantly outperforms the other protocols under low primary user activity but its performance degrades under high PU activity. In this work, we introduce an enhanced version of SAMER (SAMER+) that performs consistently well in both low and high PU activity scenarios. The core of SAMER+ is a new path metric that balances short term throughput and long term path stability. We evaluate SAMER+ using extensive simulations and compare it against SAMER and Coolest Path. Our results show that SAMER+ significantly outperforms both protocols in a variety of scenarios.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127290621","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511055
A. Sah, A. Chaturvedi
Neighborhood search algorithms have been proposed for detection in large/massive multiple-input multiple-output (MIMO) systems. They iteratively search for the best vector in a fixed neighborhood. However, the ML solution may not lie in the searched space or the search may take a large number of intermediate vectors to converge. Instead of searching in a fixed neighborhood, a better way will be to look for an update which is not restricted to be in a fixed neighborhood. Motivated by this, we formulate an optimization problem to maximize the reduction in ML cost and use it to derive an expression for updating the solution. We use a metric based on the channel matrix and the error vector to determine the likelihood of a symbol being in error. Using this likelihood and the update, we propose a likelihood ascent search (LAS) algorithm to find an update which is not restricted to be in a fixed neighborhood and seeks to provide maximum reduction in ML cost. This process continues till there is a reduction in the ML cost. Compared to existing LAS based algorithms, it is found to provide better error performance, that too at a lower complexity.
{"title":"Beyond fixed neighborhood search in the likelihood ascent algorithm for MIMO systems","authors":"A. Sah, A. Chaturvedi","doi":"10.1109/ICC.2016.7511055","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511055","url":null,"abstract":"Neighborhood search algorithms have been proposed for detection in large/massive multiple-input multiple-output (MIMO) systems. They iteratively search for the best vector in a fixed neighborhood. However, the ML solution may not lie in the searched space or the search may take a large number of intermediate vectors to converge. Instead of searching in a fixed neighborhood, a better way will be to look for an update which is not restricted to be in a fixed neighborhood. Motivated by this, we formulate an optimization problem to maximize the reduction in ML cost and use it to derive an expression for updating the solution. We use a metric based on the channel matrix and the error vector to determine the likelihood of a symbol being in error. Using this likelihood and the update, we propose a likelihood ascent search (LAS) algorithm to find an update which is not restricted to be in a fixed neighborhood and seeks to provide maximum reduction in ML cost. This process continues till there is a reduction in the ML cost. Compared to existing LAS based algorithms, it is found to provide better error performance, that too at a lower complexity.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127496687","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510730
Sofiane Hamrioui, P. Lorenz
Our contribution in this paper is to propose a new solution called EQ-AODV (Energy and QoS supported AODV) for better performance in WMSNs (Wireless Multimedia Sensor Networks). EQ-AODV aims to improve AODV protocol and make it effective for multimedia data in WMSNs. This improvement is based on the adaptation of the routing process of AODV according to two parameters. The first one is the energy of sensors belonging to the routing roads and the second parameter is the nature of the packets received by these sensors. The considered data are text data, audio and video streaming data. After the evaluation of the performance and based on the obtained results, EQ-AODV showed a better performance compared to AODV. EQ-AODV improves important QoS parameters namely the network load and the end to end delay. Important improvement in terms of the life time of sensors and the consumed energy is recorded too.
{"title":"EQ-AODV: Energy and QoS supported AODV for better performance in WMSNs","authors":"Sofiane Hamrioui, P. Lorenz","doi":"10.1109/ICC.2016.7510730","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510730","url":null,"abstract":"Our contribution in this paper is to propose a new solution called EQ-AODV (Energy and QoS supported AODV) for better performance in WMSNs (Wireless Multimedia Sensor Networks). EQ-AODV aims to improve AODV protocol and make it effective for multimedia data in WMSNs. This improvement is based on the adaptation of the routing process of AODV according to two parameters. The first one is the energy of sensors belonging to the routing roads and the second parameter is the nature of the packets received by these sensors. The considered data are text data, audio and video streaming data. After the evaluation of the performance and based on the obtained results, EQ-AODV showed a better performance compared to AODV. EQ-AODV improves important QoS parameters namely the network load and the end to end delay. Important improvement in terms of the life time of sensors and the consumed energy is recorded too.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125190143","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511173
Fan Wu, S. Leng, Xiaoyan Huang, Qin Yu, Kun Yang
This paper studies the problem of optimal power allocation towards maximizing the throughput of point-to-point wireless communication systems with energy harvesting. A novel energy-transferring approach is proposed to analyze the throughput maximization problem with causality constraints, in which we study the transfer energy rather than the water level widely used in the existing literature. The proposed approach simplifies the power allocation as a linear function with respect to only two transfer energy variables, i.e., the energy transferred from the previous epoch and the energy transferred to the next epoch. Moreover, we prove that all the positive transfer energy variables can be determined by solving a set of linear equations with a special coefficient matrix derived from the KKT conditions for the dual problem. Based on the energy-transferring approach, we propose an iterative algorithm to obtain the optimal solution with a much lower complexity compared to those existing algorithms based on the directional water-filling structure results. Numerical studies verify the analytical results as well as the effectiveness of the proposed algorithm.
{"title":"Energy-transferring approach to power allocation with energy harvesting constraints","authors":"Fan Wu, S. Leng, Xiaoyan Huang, Qin Yu, Kun Yang","doi":"10.1109/ICC.2016.7511173","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511173","url":null,"abstract":"This paper studies the problem of optimal power allocation towards maximizing the throughput of point-to-point wireless communication systems with energy harvesting. A novel energy-transferring approach is proposed to analyze the throughput maximization problem with causality constraints, in which we study the transfer energy rather than the water level widely used in the existing literature. The proposed approach simplifies the power allocation as a linear function with respect to only two transfer energy variables, i.e., the energy transferred from the previous epoch and the energy transferred to the next epoch. Moreover, we prove that all the positive transfer energy variables can be determined by solving a set of linear equations with a special coefficient matrix derived from the KKT conditions for the dual problem. Based on the energy-transferring approach, we propose an iterative algorithm to obtain the optimal solution with a much lower complexity compared to those existing algorithms based on the directional water-filling structure results. Numerical studies verify the analytical results as well as the effectiveness of the proposed algorithm.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123463727","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510794
Zhuo Sun, Yixuan Xie, Jinhong Yuan, Tao Yang
In this paper we investigate the coded slotted ALOHA (CSA) schemes with repetition codes and maximum distance separable (MDS) codes over erasure channels. We derive the extrinsic information transfer (EXIT) functions of the CSA schemes over erasure channels, which allow an asymptotic analysis of the packet recovering process. Moreover, we define a traffic load threshold provided that the recovered probability is more than a given recovery ratio. The optimal distribution of the codes chosen by users in the CSA schemes is then designed to maximize the peak throughput and traffic load threshold. By performing the asymptotic analysis, we show that our optimal distributions improve the traffic load threshold by 60% for ε = 0.1 and 86% for ε = 0.135 compared to the optimal distribution for collision channels. Using repetition codes as an example, simulation results show that the obtained distributions enhance the peak throughput for erasure channels when both packet erasure channels and slot erasure channels are considered.
{"title":"Coded slotted ALOHA schemes for erasure channels","authors":"Zhuo Sun, Yixuan Xie, Jinhong Yuan, Tao Yang","doi":"10.1109/ICC.2016.7510794","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510794","url":null,"abstract":"In this paper we investigate the coded slotted ALOHA (CSA) schemes with repetition codes and maximum distance separable (MDS) codes over erasure channels. We derive the extrinsic information transfer (EXIT) functions of the CSA schemes over erasure channels, which allow an asymptotic analysis of the packet recovering process. Moreover, we define a traffic load threshold provided that the recovered probability is more than a given recovery ratio. The optimal distribution of the codes chosen by users in the CSA schemes is then designed to maximize the peak throughput and traffic load threshold. By performing the asymptotic analysis, we show that our optimal distributions improve the traffic load threshold by 60% for ε = 0.1 and 86% for ε = 0.135 compared to the optimal distribution for collision channels. Using repetition codes as an example, simulation results show that the obtained distributions enhance the peak throughput for erasure channels when both packet erasure channels and slot erasure channels are considered.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123545207","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510995
Georgios Skourletopoulos, C. Mavromoustakis, J. M. Batalla, G. Mastorakis, E. Pallis, G. Kormentzas
As network bandwidth and coverage continue to increase, the adoption rates of mobile devices are growing over time and the mobile technology is becoming increasingly industrialized. In mobile cloud marketplaces, the cloud-supported mobile services can be leased off. However, the mobile service selection may introduce technical debt (TD), which is essential to be predicted and quantified. In this context, this paper examines the incurrence of technical debt in the future when leasing cloud-based mobile services by proposing a novel quantitative model, which adopts a linear and symmetric approach as a linear growth in the number of users is predicted. The formulation of the problem is based on a cost-benefit analysis, elaborating on the potential profit that could be obtained if the number of users would be equal to the maximum value. The probability of overutilization of the selected service in the long run is also researched. Finally, a quantification tool has been developed as a proof of concept (PoC), which initiates the technical debt analysis and optimization on mobile cloud-based service level and aims to provide insights into the overutilization or underutilization of a web service when a linear increase in the number of users occurs.
{"title":"Quantifying and evaluating the technical debt on mobile cloud-based service level","authors":"Georgios Skourletopoulos, C. Mavromoustakis, J. M. Batalla, G. Mastorakis, E. Pallis, G. Kormentzas","doi":"10.1109/ICC.2016.7510995","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510995","url":null,"abstract":"As network bandwidth and coverage continue to increase, the adoption rates of mobile devices are growing over time and the mobile technology is becoming increasingly industrialized. In mobile cloud marketplaces, the cloud-supported mobile services can be leased off. However, the mobile service selection may introduce technical debt (TD), which is essential to be predicted and quantified. In this context, this paper examines the incurrence of technical debt in the future when leasing cloud-based mobile services by proposing a novel quantitative model, which adopts a linear and symmetric approach as a linear growth in the number of users is predicted. The formulation of the problem is based on a cost-benefit analysis, elaborating on the potential profit that could be obtained if the number of users would be equal to the maximum value. The probability of overutilization of the selected service in the long run is also researched. Finally, a quantification tool has been developed as a proof of concept (PoC), which initiates the technical debt analysis and optimization on mobile cloud-based service level and aims to provide insights into the overutilization or underutilization of a web service when a linear increase in the number of users occurs.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123744715","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 : 2016-05-22DOI: 10.1109/ICC.2016.7510885
Shankar Karuppayah, Emmanouil Vasilomanolakis, Steffen Haas, M. Mühlhäuser, Mathias Fischer
The ever-growing number of cyber attacks from botnets has made them one of the biggest threats on the Internet. Thus, it is crucial to study and analyze botnets, to take them down. For this, an extensive monitoring is a pre-requisite for preparing a botnet takedown, e.g., via a sinkholing attack. However, every new monitoring mechanism developed for botnets is usually tackled by the botmasters by introducing novel antimonitoring countermeasures. In this paper, we anticipate these countermeasures by proposing a set of lightweight techniques for detecting the presence of crawlers in P2P botnets, called BoobyTrap. For that, we exploit botnet-specific protocol and design constraints. We evaluate the performance of our BoobyTrap mechanism on two real-world botnets: Sality and ZeroAccess. Our results indicate that we can distinguish many crawlers from benign bots. In fact, we discovered close to 10 crawler nodes within our observation period in the Sality botnet and around 120 in the ZeroAccess botnet. In addition, we also describe the observable characteristics of the detected crawlers and suggest crawler improvements for enabling monitoring in the presence of the BoobyTrap mechanism.
{"title":"BoobyTrap: On autonomously detecting and characterizing crawlers in P2P botnets","authors":"Shankar Karuppayah, Emmanouil Vasilomanolakis, Steffen Haas, M. Mühlhäuser, Mathias Fischer","doi":"10.1109/ICC.2016.7510885","DOIUrl":"https://doi.org/10.1109/ICC.2016.7510885","url":null,"abstract":"The ever-growing number of cyber attacks from botnets has made them one of the biggest threats on the Internet. Thus, it is crucial to study and analyze botnets, to take them down. For this, an extensive monitoring is a pre-requisite for preparing a botnet takedown, e.g., via a sinkholing attack. However, every new monitoring mechanism developed for botnets is usually tackled by the botmasters by introducing novel antimonitoring countermeasures. In this paper, we anticipate these countermeasures by proposing a set of lightweight techniques for detecting the presence of crawlers in P2P botnets, called BoobyTrap. For that, we exploit botnet-specific protocol and design constraints. We evaluate the performance of our BoobyTrap mechanism on two real-world botnets: Sality and ZeroAccess. Our results indicate that we can distinguish many crawlers from benign bots. In fact, we discovered close to 10 crawler nodes within our observation period in the Sality botnet and around 120 in the ZeroAccess botnet. In addition, we also describe the observable characteristics of the detected crawlers and suggest crawler improvements for enabling monitoring in the presence of the BoobyTrap mechanism.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123791688","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511573
M. R. Amin, Mehedee Zaman, Md. Shohrab Hossain, Mohammed Atiquzzaman
Android, the fastest growing mobile operating system released in November 2007, boasts of a staggering 1.4 billion active users. Android users are susceptible to malicious applications that can hack into their personal data due to the lack of careful monitoring of their in-device security. There have been numerous works on devising malware detection methods. However, none of earlier works are conclusive enough for direct application and lack experimental validation. In this paper, we have investigated the natures and identities of malicious applications and devised two novel detection approaches for detection: network-based detection and system call based detection approaches. To evaluate our proposed approaches, we performed experiments on a subset of 1260 malwares, acquired from Android Malware Genome Project, a malware database created by Y. Zhou et al. [1] and 227 non-malware (benign) applications. Results show that our system call based approach is able to detect malwares with an accuracy of 87% which is quite significant in general malware detection context. Our proposed detection approaches along with the experimental results will provide security professionals with more precise and quantitative approaches in their investigations of mobile malwares on Android systems.
{"title":"Behavioral malware detection approaches for Android","authors":"M. R. Amin, Mehedee Zaman, Md. Shohrab Hossain, Mohammed Atiquzzaman","doi":"10.1109/ICC.2016.7511573","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511573","url":null,"abstract":"Android, the fastest growing mobile operating system released in November 2007, boasts of a staggering 1.4 billion active users. Android users are susceptible to malicious applications that can hack into their personal data due to the lack of careful monitoring of their in-device security. There have been numerous works on devising malware detection methods. However, none of earlier works are conclusive enough for direct application and lack experimental validation. In this paper, we have investigated the natures and identities of malicious applications and devised two novel detection approaches for detection: network-based detection and system call based detection approaches. To evaluate our proposed approaches, we performed experiments on a subset of 1260 malwares, acquired from Android Malware Genome Project, a malware database created by Y. Zhou et al. [1] and 227 non-malware (benign) applications. Results show that our system call based approach is able to detect malwares with an accuracy of 87% which is quite significant in general malware detection context. Our proposed detection approaches along with the experimental results will provide security professionals with more precise and quantitative approaches in their investigations of mobile malwares on Android systems.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125324091","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511515
Lou Zhao, Tao Yang, Giovanni Geraci, Jinhong Yuan
In this paper, we investigate uplink channel estimation and multiuser downlink transmission of a massive MIMO time-division duplex system in the presence of pilot contamination, where the base station (BS) with M antennas communicates with N single-antenna users in a cell. We assume that all channels are affected by Rician fading. We also assume that angles of arrival from users to the BS are different. We first analyze the impact of pilot contamination on the channel estimation, based on which we derive a tight sum-rate approximation. We also obtain the asymptotic sum-rate for large Rician K-factor in the large signal to noise ratio regime. Furthermore, we examine the impact of the Rician K-factor on the sum-rate of the system, showing that the sum-rate increases as K-factor increases.
{"title":"Downlink multiuser massive MIMO in Rician channels under pilot contamination","authors":"Lou Zhao, Tao Yang, Giovanni Geraci, Jinhong Yuan","doi":"10.1109/ICC.2016.7511515","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511515","url":null,"abstract":"In this paper, we investigate uplink channel estimation and multiuser downlink transmission of a massive MIMO time-division duplex system in the presence of pilot contamination, where the base station (BS) with M antennas communicates with N single-antenna users in a cell. We assume that all channels are affected by Rician fading. We also assume that angles of arrival from users to the BS are different. We first analyze the impact of pilot contamination on the channel estimation, based on which we derive a tight sum-rate approximation. We also obtain the asymptotic sum-rate for large Rician K-factor in the large signal to noise ratio regime. Furthermore, we examine the impact of the Rician K-factor on the sum-rate of the system, showing that the sum-rate increases as K-factor increases.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088083","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 : 2016-05-22DOI: 10.1109/ICC.2016.7511142
Md. Zoheb Hassan, Victor C. M. Leung, Md. Jahangir Hossain, Julian Cheng
We investigate a quality-of-service-aware and energy-aware adaptive power allocation scheme for a point-to-point and line-of-sight optical wireless communication system employing the coherent detection and polarization multiplexing. The proposed power allocation scheme minimizes the average transmit power and provides the delay aware quality-of-service guarantee through maintaining a required effective capacity over the fading channels. The power allocation scheme is formulated as a convex optimization problem, and using the sub-gradient method, a fast convergent algorithm for the optimal power allocation is proposed. Numerical results demonstrate the advantages of the proposed power allocation algorithm in terms of the energy saving for the case of having strict statistical delay constraints.
{"title":"QoS-aware and energy-aware adaptive power allocations for coherent optical wireless communications","authors":"Md. Zoheb Hassan, Victor C. M. Leung, Md. Jahangir Hossain, Julian Cheng","doi":"10.1109/ICC.2016.7511142","DOIUrl":"https://doi.org/10.1109/ICC.2016.7511142","url":null,"abstract":"We investigate a quality-of-service-aware and energy-aware adaptive power allocation scheme for a point-to-point and line-of-sight optical wireless communication system employing the coherent detection and polarization multiplexing. The proposed power allocation scheme minimizes the average transmit power and provides the delay aware quality-of-service guarantee through maintaining a required effective capacity over the fading channels. The power allocation scheme is formulated as a convex optimization problem, and using the sub-gradient method, a fast convergent algorithm for the optimal power allocation is proposed. Numerical results demonstrate the advantages of the proposed power allocation algorithm in terms of the energy saving for the case of having strict statistical delay constraints.","PeriodicalId":168709,"journal":{"name":"2016 IEEE International Conference on Communications (ICC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115098924","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
扫码关注我们
求助内容：
应助结果提醒方式：