Pub Date : 2014-11-06DOI: 10.1109/ICC.2014.6883860
Hauke Holtkamp, G. Dietl, H. Haas
This paper addresses the assignment of transmission and sleep time slots between interfering transmitters with the objective of minimal power consumption. In particular, we address the constructive alignment of Discontinuous Transmission (DTX) time slots under link rate constraints. Due to the complexity of the combinatorial optimization problem at hand, we resort to heuristic assignment strategies. We derive four time slot alignment solutions (sequential alignment, random alignment, p-persistent ranking and DTX alignment with memory) and identify trade-offs. One of the proposed solutions, namely, DTX alignment with memory addresses identified issues of the other three solutions by maintaining memory of past alignment and channel quality to buffer short term changes in channel quality. All strategies are found to exhibit similar convergence behavior, but different power consumption and retransmission probabilities. DTX alignment with memory is shown to achieve up to 40% savings in power consumption and more than 20% lower retransmission probability than the State-Of-The-Art (SotA).
{"title":"Distributed DTX alignment with memory","authors":"Hauke Holtkamp, G. Dietl, H. Haas","doi":"10.1109/ICC.2014.6883860","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883860","url":null,"abstract":"This paper addresses the assignment of transmission and sleep time slots between interfering transmitters with the objective of minimal power consumption. In particular, we address the constructive alignment of Discontinuous Transmission (DTX) time slots under link rate constraints. Due to the complexity of the combinatorial optimization problem at hand, we resort to heuristic assignment strategies. We derive four time slot alignment solutions (sequential alignment, random alignment, p-persistent ranking and DTX alignment with memory) and identify trade-offs. One of the proposed solutions, namely, DTX alignment with memory addresses identified issues of the other three solutions by maintaining memory of past alignment and channel quality to buffer short term changes in channel quality. All strategies are found to exhibit similar convergence behavior, but different power consumption and retransmission probabilities. DTX alignment with memory is shown to achieve up to 40% savings in power consumption and more than 20% lower retransmission probability than the State-Of-The-Art (SotA).","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116211849","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 : 2014-08-28DOI: 10.1109/ICC.2014.6883394
Yu Ding, Zhuo Peng, Yuanyuan Zhou, Chao Zhang
We look into the issue that the amount of entropy kept by the pseudorandom number generator (PRNG) of Android is constantly low. We find that the accusation against this issue of causing poor performance and low frame rate experienced by users is ungrounded. We also investigate possible security vulnerabilities resulting from this issue. We find that this issue does not affect the quality of random numbers that are generated by the PRNG and used in Android applications because recent Android devices do not lack entropy sources. However, we identify a vulnerability in which the stack canary for all future Android applications is generated earlier than the PRNG is properly setup. This vulnerability makes stack overflow simpler and threats Android applications linked with native code (through NDK) as well as Dalvik VM instances. An attacker could nullify the stack protecting mechanism, given the knowledge of the time of boot or a malicious app running on the victim device. This vulnerability also affects the address space layout randomization (ASLR) mechanism on Android, and can turn it from a weak protection to void. We discuss in this paper several possible attacks against this vulnerability as well as ways of defending. As this vulnerability is rooted in an essential Android design choice since the very first version, it is difficult to fix.
{"title":"Android low entropy demystified","authors":"Yu Ding, Zhuo Peng, Yuanyuan Zhou, Chao Zhang","doi":"10.1109/ICC.2014.6883394","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883394","url":null,"abstract":"We look into the issue that the amount of entropy kept by the pseudorandom number generator (PRNG) of Android is constantly low. We find that the accusation against this issue of causing poor performance and low frame rate experienced by users is ungrounded. We also investigate possible security vulnerabilities resulting from this issue. We find that this issue does not affect the quality of random numbers that are generated by the PRNG and used in Android applications because recent Android devices do not lack entropy sources. However, we identify a vulnerability in which the stack canary for all future Android applications is generated earlier than the PRNG is properly setup. This vulnerability makes stack overflow simpler and threats Android applications linked with native code (through NDK) as well as Dalvik VM instances. An attacker could nullify the stack protecting mechanism, given the knowledge of the time of boot or a malicious app running on the victim device. This vulnerability also affects the address space layout randomization (ASLR) mechanism on Android, and can turn it from a weak protection to void. We discuss in this paper several possible attacks against this vulnerability as well as ways of defending. As this vulnerability is rooted in an essential Android design choice since the very first version, it is difficult to fix.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129761182","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 : 2014-08-28DOI: 10.1109/ICC.2014.6883523
Sandeep Mavuduru Kannappa, Tariq M. Ali, M. Saquib
In a cognitive wireless network, the sudden arrival of a primary user (PU) can force one or more secondary users (SU) to terminate their ongoing communication. Buffers can be utilized to prevent them from dropping, but their effectiveness depends on the tolerance of the SUs to the buffer waiting time. In this paper, we propose to dynamically assign service rates to the SUs to complement the gain offered by the network buffers in reducing the dropping probability of the SUs. Our analysis is based on a two-dimensional Markov chain with four state variables. Performance metrics for the SUs such as dropping, blocking and completion probabilities, and the average time spent in buffer are derived. Our analytical results demonstrate that depending on the network condition, the proposed dynamic spectrum assignment scheme is alone capable of reducing the dropping probability substantially. Since the sum of call completion, blocking and dropping probabilities is 1, the reduction of dropping probability of the SUs is achieved by increasing the sum of call blocking and completion probabilities, which not necessarily implies higher blocking or reduced completion probabilities.
{"title":"Analysis of a buffered cognitive wireless network with dynamic spectrum assignment","authors":"Sandeep Mavuduru Kannappa, Tariq M. Ali, M. Saquib","doi":"10.1109/ICC.2014.6883523","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883523","url":null,"abstract":"In a cognitive wireless network, the sudden arrival of a primary user (PU) can force one or more secondary users (SU) to terminate their ongoing communication. Buffers can be utilized to prevent them from dropping, but their effectiveness depends on the tolerance of the SUs to the buffer waiting time. In this paper, we propose to dynamically assign service rates to the SUs to complement the gain offered by the network buffers in reducing the dropping probability of the SUs. Our analysis is based on a two-dimensional Markov chain with four state variables. Performance metrics for the SUs such as dropping, blocking and completion probabilities, and the average time spent in buffer are derived. Our analytical results demonstrate that depending on the network condition, the proposed dynamic spectrum assignment scheme is alone capable of reducing the dropping probability substantially. Since the sum of call completion, blocking and dropping probabilities is 1, the reduction of dropping probability of the SUs is achieved by increasing the sum of call blocking and completion probabilities, which not necessarily implies higher blocking or reduced completion probabilities.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122881101","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 : 2014-08-28DOI: 10.1109/ICC.2014.6883719
T. Han, N. Ansari
With the development of green energy technologies, base stations (BSs) can be powered by green energy in order to reduce the on-grid power consumption, and subsequently reduce the carbon footprints. As smart grid advances, power trading among distributed power generators and energy consumers will be enabled. In this paper, we have investigated the optimization of smart grid enabled mobile networks in which green energy is generated in individual BSs and can be shared among the BSs. In order to minimize the on-grid power consumption of this network, we have proposed to jointly optimize the BS operation and the power distribution. The joint BS operation and Power distribution Optimization (BPO) problem is challenging due to the complex coupling of the optimization of mobile networks and that of power grid. We have proposed an approximation solution that decomposes the BPO problem into two subproblems and solves the BPO by address these subproblems. The simulation results show that by jointly optimizing the BS operation and the power distribution, the network achieves about 18% on-grid power savings.
{"title":"Smart grid enabled mobile networks: Jointly optimizing BS operation and power distribution","authors":"T. Han, N. Ansari","doi":"10.1109/ICC.2014.6883719","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883719","url":null,"abstract":"With the development of green energy technologies, base stations (BSs) can be powered by green energy in order to reduce the on-grid power consumption, and subsequently reduce the carbon footprints. As smart grid advances, power trading among distributed power generators and energy consumers will be enabled. In this paper, we have investigated the optimization of smart grid enabled mobile networks in which green energy is generated in individual BSs and can be shared among the BSs. In order to minimize the on-grid power consumption of this network, we have proposed to jointly optimize the BS operation and the power distribution. The joint BS operation and Power distribution Optimization (BPO) problem is challenging due to the complex coupling of the optimization of mobile networks and that of power grid. We have proposed an approximation solution that decomposes the BPO problem into two subproblems and solves the BPO by address these subproblems. The simulation results show that by jointly optimizing the BS operation and the power distribution, the network achieves about 18% on-grid power savings.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116269368","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 : 2014-08-28DOI: 10.1109/ICC.2014.6883889
A. Sakr, E. Hossain
We propose an energy-efficient resource allocation scheme for downlink transmission in two-tier Network MIMO OFDMA-based macrocell-femtocell networks where the femto-cells form clusters of equal size. The proposed scheme uses a joint zero-forcing beamforming with semi-orthogonal user selection (ZFBF-SUS) transmission at each network tier to perform allocation of subcarrier and precoding coefficients. Then, power allocation is optimized in order to maximize the total system energy efficiency (i.e., average number of successfully transmitted bits per energy unit [bit/Joule], or equivalently, the average data rate per unit power [bps/Watt]). The macro base stations (MBSs) and the femto base stations (FBSs) in a cluster maximize their energy efficiency in a distributed manner while considering the cross-tier interference and the capacity limitations of backhaul links. The problem of maximizing energy efficiency is formulated as a fractional program and solved by using the Dinkelbach iterative algorithm. Numerical results show that the proposed scheme outperforms the scheme that maximizes the system average capacity, in terms of energy efficiency, and also improves the total system performance in terms of energy efficiency and average system capacity when compared to a single-tier system.
{"title":"Energy-efficient downlink transmission in two-tier network MIMO OFDMA networks","authors":"A. Sakr, E. Hossain","doi":"10.1109/ICC.2014.6883889","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883889","url":null,"abstract":"We propose an energy-efficient resource allocation scheme for downlink transmission in two-tier Network MIMO OFDMA-based macrocell-femtocell networks where the femto-cells form clusters of equal size. The proposed scheme uses a joint zero-forcing beamforming with semi-orthogonal user selection (ZFBF-SUS) transmission at each network tier to perform allocation of subcarrier and precoding coefficients. Then, power allocation is optimized in order to maximize the total system energy efficiency (i.e., average number of successfully transmitted bits per energy unit [bit/Joule], or equivalently, the average data rate per unit power [bps/Watt]). The macro base stations (MBSs) and the femto base stations (FBSs) in a cluster maximize their energy efficiency in a distributed manner while considering the cross-tier interference and the capacity limitations of backhaul links. The problem of maximizing energy efficiency is formulated as a fractional program and solved by using the Dinkelbach iterative algorithm. Numerical results show that the proposed scheme outperforms the scheme that maximizes the system average capacity, in terms of energy efficiency, and also improves the total system performance in terms of energy efficiency and average system capacity when compared to a single-tier system.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124883259","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 : 2014-08-28DOI: 10.1109/ICC.2014.6883952
J. Leithon, Teng Joon Lim, Sumei Sun
In this paper, we study the problem of minimizing the energy cost incurred by a Cellular Network Operator (CNO) in a Smart Grid (SG) environment. We consider a CNO that deploys several Cellular Base Stations (CBS) to serve a given geographical area. Each CBS is equipped with a limited-capacity battery and can be powered either by the SG or by a renewable-energy (RE) harvester. Given this topology, two-way energy flow is allowed between each CBS and the SG and between any pair of CBSs in the network through the SG. The space-time-dependent energy-buying and energy-sharing costs and the energy-selling prices are made known to the CNO in advance. Therefore, in order to minimize the total cost incurred by the CNO, we find the optimal energy-management strategy by solving a constrained optimization problem. The proposed strategy ensures that the instantaneous energy demand of each CBS and the constraints imposed by each battery are satisfied at every point in time. We evaluate the performance of the proposed solution using simulations. Our results show that a significant cost reduction can be achieved by implementing the proposed strategy.
{"title":"Energy exchange among base stations in a Cellular Network through the Smart Grid","authors":"J. Leithon, Teng Joon Lim, Sumei Sun","doi":"10.1109/ICC.2014.6883952","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883952","url":null,"abstract":"In this paper, we study the problem of minimizing the energy cost incurred by a Cellular Network Operator (CNO) in a Smart Grid (SG) environment. We consider a CNO that deploys several Cellular Base Stations (CBS) to serve a given geographical area. Each CBS is equipped with a limited-capacity battery and can be powered either by the SG or by a renewable-energy (RE) harvester. Given this topology, two-way energy flow is allowed between each CBS and the SG and between any pair of CBSs in the network through the SG. The space-time-dependent energy-buying and energy-sharing costs and the energy-selling prices are made known to the CNO in advance. Therefore, in order to minimize the total cost incurred by the CNO, we find the optimal energy-management strategy by solving a constrained optimization problem. The proposed strategy ensures that the instantaneous energy demand of each CBS and the constraints imposed by each battery are satisfied at every point in time. We evaluate the performance of the proposed solution using simulations. Our results show that a significant cost reduction can be achieved by implementing the proposed strategy.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114938277","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 : 2014-08-28DOI: 10.1109/ICC.2014.6884231
Nikolaos Nomikos, Themistoklis Charalambous, I. Krikidis, D. Vouyioukas, M. Johansson
In this work, we study a cooperative network with multiple full-duplex buffer-aided relays. A hybrid cooperative relaying policy is proposed that employs power adaptation and consists of two alternative schemes: (i) full-duplex transmission through the relay which requires the least total power expenditure and loop interference is mitigated through power adaptation; (ii) buffer-aided max - link selection with power adaptation, when full-duplexity is not feasible. Aiming to reduce the overhead of channel state information (CSI) acquisition and processing, we propose a suboptimal distributed method for relay selection, for which the network performance is not degraded significantly. We show that power adaptation offers reduced overhead of CSI acquisition. Numerical results and comparisons with other state-of-the-art relaying schemes are provided and performance evaluation in terms of throughput, power minimization and switching rate, show the benefits of the proposed hybrid scheme.
{"title":"Hybrid cooperation through full-duplex opportunistic relaying and max-link relay selection with transmit power adaptation","authors":"Nikolaos Nomikos, Themistoklis Charalambous, I. Krikidis, D. Vouyioukas, M. Johansson","doi":"10.1109/ICC.2014.6884231","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884231","url":null,"abstract":"In this work, we study a cooperative network with multiple full-duplex buffer-aided relays. A hybrid cooperative relaying policy is proposed that employs power adaptation and consists of two alternative schemes: (i) full-duplex transmission through the relay which requires the least total power expenditure and loop interference is mitigated through power adaptation; (ii) buffer-aided max - link selection with power adaptation, when full-duplexity is not feasible. Aiming to reduce the overhead of channel state information (CSI) acquisition and processing, we propose a suboptimal distributed method for relay selection, for which the network performance is not degraded significantly. We show that power adaptation offers reduced overhead of CSI acquisition. Numerical results and comparisons with other state-of-the-art relaying schemes are provided and performance evaluation in terms of throughput, power minimization and switching rate, show the benefits of the proposed hybrid scheme.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131516137","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 : 2014-08-28DOI: 10.1109/ICC.2014.6884119
H. Sokun, A. B. Sediq, S. Ikki, H. Yanikomeroglu
Despite the rich literature on cooperative networks, employment of different modulation levels by the source and relay terminals has not been investigated thoroughly from the physical layer perspective. In this paper, we investigate the bit error rate (BER) performance of selective relaying in a multi-relay decode-and-forward cooperative network where the source and the relays transmit using different modulation levels. Specifically, we derive a closed form expression for the end-to-end (uncoded) BER. To draw further insights on the BER performance, we also provide a simpler approximate BER expression that is accurate in the high signal-to-noise ratio regime. Finally, simulation results are presented to verify the analytical results. The derived BER expressions can be utilized in various other scenarios in which the destination selects the best signal (in terms of minimizing BER) among a set of signals which use different modulation levels. The set of signals to choose from may have already been received through orthogonal channels (selection combining), or this signal set may correspond to a set of “candidate” transmissions. The latter scenario is often referred to as selective transmission; applications of this scenario include selective relaying (the setting in this paper), fast base-station selection, and coordinated multipoint transmission and reception (CoMP).
{"title":"Selective DF relaying in multi-relay networks with different modulation levels","authors":"H. Sokun, A. B. Sediq, S. Ikki, H. Yanikomeroglu","doi":"10.1109/ICC.2014.6884119","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884119","url":null,"abstract":"Despite the rich literature on cooperative networks, employment of different modulation levels by the source and relay terminals has not been investigated thoroughly from the physical layer perspective. In this paper, we investigate the bit error rate (BER) performance of selective relaying in a multi-relay decode-and-forward cooperative network where the source and the relays transmit using different modulation levels. Specifically, we derive a closed form expression for the end-to-end (uncoded) BER. To draw further insights on the BER performance, we also provide a simpler approximate BER expression that is accurate in the high signal-to-noise ratio regime. Finally, simulation results are presented to verify the analytical results. The derived BER expressions can be utilized in various other scenarios in which the destination selects the best signal (in terms of minimizing BER) among a set of signals which use different modulation levels. The set of signals to choose from may have already been received through orthogonal channels (selection combining), or this signal set may correspond to a set of “candidate” transmissions. The latter scenario is often referred to as selective transmission; applications of this scenario include selective relaying (the setting in this paper), fast base-station selection, and coordinated multipoint transmission and reception (CoMP).","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131565025","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 : 2014-08-28DOI: 10.1109/ICC.2014.6884037
Junjie Pan, F. Gao
Compressive sensing (CS) has recently attracted lots of attention and has been extended to more structured architectures, for example the linear time-invariant system identification. However, prevalent CS methods used for channel estimation, such as Basis Pursuit Denoising (BPDN) and Dantzig selector (DS), require computational complexity as high as O(N3), where N is the length of the channel. When N is very large, the complexity will aggravate the hardware burden. In this paper, we propose a new channel estimation scheme that uses the expander graph based compressive sensing. The computation complexity is demonstrated to be as low as O((P - N)N), where P is the length of the training vector.
{"title":"Efficient channel estimation using expander graph based compressive sensing","authors":"Junjie Pan, F. Gao","doi":"10.1109/ICC.2014.6884037","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884037","url":null,"abstract":"Compressive sensing (CS) has recently attracted lots of attention and has been extended to more structured architectures, for example the linear time-invariant system identification. However, prevalent CS methods used for channel estimation, such as Basis Pursuit Denoising (BPDN) and Dantzig selector (DS), require computational complexity as high as O(N3), where N is the length of the channel. When N is very large, the complexity will aggravate the hardware burden. In this paper, we propose a new channel estimation scheme that uses the expander graph based compressive sensing. The computation complexity is demonstrated to be as low as O((P - N)N), where P is the length of the training vector.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134432467","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 : 2014-08-28DOI: 10.1109/ICC.2014.6884198
Fanzhao Wang, Qingyang Song, Shiqiang Wang, Lei Guo
Physical-layer network coding (PNC) is an effective strategy for increasing the throughput of wireless networks. In the current literatures, PNC without rate and power adaptation is mainly focused. Realizing that the transmission efficiency can be improved through rate and power adaptation in wireless networks, this paper focuses on developing a rate and power adaptation scheme for PNC. Through formulating how the data rate and transmission power affect the bit error rate (BER) of involved links in PNC, we observe that with a given data rate, the transmission power has to satisfy some constraints. Using these power constraints, we obtain a candidate set of optimal transmission power. By traversing the candidate set and the data rates supported by nodes, a rate and power adaptation scheme is developed. To test its performance, we apply the proposed scheme into an existing PNC-supported MAC protocol. Simulation results demonstrate that the proposed scheme can improve the throughput and delay performance in various scenarios.
{"title":"Rate and power adaptation for physical-layer network coding with M-QAM modulation","authors":"Fanzhao Wang, Qingyang Song, Shiqiang Wang, Lei Guo","doi":"10.1109/ICC.2014.6884198","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884198","url":null,"abstract":"Physical-layer network coding (PNC) is an effective strategy for increasing the throughput of wireless networks. In the current literatures, PNC without rate and power adaptation is mainly focused. Realizing that the transmission efficiency can be improved through rate and power adaptation in wireless networks, this paper focuses on developing a rate and power adaptation scheme for PNC. Through formulating how the data rate and transmission power affect the bit error rate (BER) of involved links in PNC, we observe that with a given data rate, the transmission power has to satisfy some constraints. Using these power constraints, we obtain a candidate set of optimal transmission power. By traversing the candidate set and the data rates supported by nodes, a rate and power adaptation scheme is developed. To test its performance, we apply the proposed scheme into an existing PNC-supported MAC protocol. Simulation results demonstrate that the proposed scheme can improve the throughput and delay performance in various scenarios.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126205892","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
扫码关注我们
求助内容：
应助结果提醒方式：