Pub Date : 2016-09-01DOI: 10.1109/VTCFall.2016.7880873
F. Santos, A. T. Akabane, R. S. Yokoyama, A. Loureiro, L. Villas
Many Vehicular Ad-hoc Networks (VANETs) applications require that each vehicle knows precisely its current position in real time. The Global Positioning System (GPS) is technology most widely used to determine the positioning of vehicles in VANETs. However, the GPS has several drawbacks, one of them is the lack of accuracy of the measurement of impact is the most unacceptable disadvantage. In this work, we propose a roadside unit- based localization scheme to improve the accuracy level of the vehicles' position for VANETs. In this way, each one of roadside units fix the relative position error and informs all vehicles that are within of the coverage area. The proposed solution requires few roadside units, which represents a low-cost of deployment, and it was able to reduce GPS error in this critical area from 7.21 m to 0.74 m.
{"title":"A Roadside Unit-Based Localization Scheme to Improve Positioning for Vehicular Networks","authors":"F. Santos, A. T. Akabane, R. S. Yokoyama, A. Loureiro, L. Villas","doi":"10.1109/VTCFall.2016.7880873","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7880873","url":null,"abstract":"Many Vehicular Ad-hoc Networks (VANETs) applications require that each vehicle knows precisely its current position in real time. The Global Positioning System (GPS) is technology most widely used to determine the positioning of vehicles in VANETs. However, the GPS has several drawbacks, one of them is the lack of accuracy of the measurement of impact is the most unacceptable disadvantage. In this work, we propose a roadside unit- based localization scheme to improve the accuracy level of the vehicles' position for VANETs. In this way, each one of roadside units fix the relative position error and informs all vehicles that are within of the coverage area. The proposed solution requires few roadside units, which represents a low-cost of deployment, and it was able to reduce GPS error in this critical area from 7.21 m to 0.74 m.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87855524","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-09-01DOI: 10.1109/VTCFall.2016.7880912
N. Becker, M. Eroz, S. Kay, Lin-nan Lee
Fixed, portable and mobile terminals use Random Access (RA) to transfer data or request more spectrally efficient dedicated resources. This paper describes a new multiple access scheme, A- SCMA, that operates with unsynchronized transmission and low power, making it particularly suitable to small machine-to-machine communications in satellite or terrestrial applications. A multicarrier version operates with large and variable packet sizes without reduced throughput or large delays.
{"title":"Asynchronous Scrambled Coded Multiple Access (A-SCMA) - A New High Efficiency Random Access Method","authors":"N. Becker, M. Eroz, S. Kay, Lin-nan Lee","doi":"10.1109/VTCFall.2016.7880912","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7880912","url":null,"abstract":"Fixed, portable and mobile terminals use Random Access (RA) to transfer data or request more spectrally efficient dedicated resources. This paper describes a new multiple access scheme, A- SCMA, that operates with unsynchronized transmission and low power, making it particularly suitable to small machine-to-machine communications in satellite or terrestrial applications. A multicarrier version operates with large and variable packet sizes without reduced throughput or large delays.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86904608","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-09-01DOI: 10.1109/VTCFall.2016.7881006
T. Iwakuni, K. Maruta, A. Ohta, Y. Shirato, Takuto Arai, Masataka Iizuka
This paper presents experimental results of our proposed null-space expansion scheme for multiuser massive MIMO in time varying channel. Multiuser MIMO transmission with proposed scheme can suppress inter-user interference (IUI) caused by outdated channel state information (CSI). The excess degrees of freedom (DoFs) of massive MIMO is exploited to perform additional null-steering using past estimated CSI. The signal-to-interference ratio (SIR) performance achieved by a null-space expansion scheme that uses measured CSI is experimentally evaluated through CSI measurements. It is confirmed that the proposed scheme shows SIR performance superior to the conventional channel prediction scheme. In addition, IUI can be stably suppressed even in high mobility environments by further increasing the null-space dimension.
{"title":"Experimental Verification of Null-Space Expansion for Multiuser Massive MIMO Using Measured Channel State Information","authors":"T. Iwakuni, K. Maruta, A. Ohta, Y. Shirato, Takuto Arai, Masataka Iizuka","doi":"10.1109/VTCFall.2016.7881006","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7881006","url":null,"abstract":"This paper presents experimental results of our proposed null-space expansion scheme for multiuser massive MIMO in time varying channel.　Multiuser MIMO transmission with proposed scheme can suppress inter-user interference (IUI) caused by outdated channel state information (CSI).　The excess degrees of freedom (DoFs) of massive MIMO is exploited to perform additional null-steering using past estimated CSI.　The signal-to-interference ratio (SIR) performance achieved by a null-space expansion scheme that uses measured CSI is experimentally evaluated through CSI measurements.　It is confirmed that the proposed scheme shows SIR performance superior to the conventional channel prediction scheme.　In addition, IUI can be stably suppressed even in high mobility environments by further increasing the null-space dimension.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87902291","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-09-01DOI: 10.1109/VTCFall.2016.7880930
Michał Sybis, K. Wesołowski, Keeth Jayasinghe, V. Venkatasubramanian, V. Vukadinovic
This paper investigates block error rate (BLER) performance and computational complexity of candidate channel coding schemes for ultra-reliable low latency communication (URLLC) in 5G. The considered candidates are the same as those identified in 3GPP: turbo, LDPC, polar, and convolutional codes. Details of code constructions and decoding algorithms are provided with computational complexity analysis. Code construction parameters, number of iterations, and list sizes are selected to provide a fair comparison among candidate coding schemes. Simulation results on BLER are shown for several code rates and small-to-moderate block sizes. The results reveal that polar and LDPC codes outperform turbo codes for short block sizes of 40 bits, while the opposite is true for medium block sizes of 200 bits. None of the schemes is a clear winner at all considered block sizes and coding rates. Other aspects like implementation complexity, latency, and flexibility will also be important when deciding the URLLC coding scheme.
{"title":"Channel Coding for Ultra-Reliable Low-Latency Communication in 5G Systems","authors":"Michał Sybis, K. Wesołowski, Keeth Jayasinghe, V. Venkatasubramanian, V. Vukadinovic","doi":"10.1109/VTCFall.2016.7880930","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7880930","url":null,"abstract":"This paper investigates block error rate (BLER) performance and computational complexity of candidate channel coding schemes for ultra-reliable low latency communication (URLLC) in 5G. The considered candidates are the same as those identified in 3GPP: turbo, LDPC, polar, and convolutional codes. Details of code constructions and decoding algorithms are provided with computational complexity analysis. Code construction parameters, number of iterations, and list sizes are selected to provide a fair comparison among candidate coding schemes. Simulation results on BLER are shown for several code rates and small-to-moderate block sizes. The results reveal that polar and LDPC codes outperform turbo codes for short block sizes of 40 bits, while the opposite is true for medium block sizes of 200 bits. None of the schemes is a clear winner at all considered block sizes and coding rates. Other aspects like implementation complexity, latency, and flexibility will also be important when deciding the URLLC coding scheme.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86345430","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-09-01DOI: 10.1109/VTCFall.2016.7880953
Meng Kuai, X. Hong, Qiangyuan Yu
Named Data Networking (NDN) has been considered as a promising networking architecture for Vehicular Ad-Hoc Networks (VANETs). However, Interest forwarding in NDN suffers severe issues in vehicular environment. Broadcast storm results in much packet loss and huge transmission overhead. Also, link disconnection caused by highly dynamic topology leads to low packet delivery ratio. On the other hand, traffic data are playing significant roles in VANETs since they are essential in varieties of Intelligent Transportation System (ITS) applications. Thus, an efficient NDN forwarding strategy using geographical characteristics to retrieve traffic data is urgently required. In this paper, we propose Density-Aware Delay-Tolerant (DADT) Interest forwarding strategy to retrieve traffic data in vehicular NDN with the purpose of improving packet delivery ratio. DADT specifically addresses data retrieval during network disruptions using Delay Tolerant Networking (DTN). It makes retransmission decision based on directional network density. Also, DADT mitigates broadcast storm by using rebroadcast deferring timer. We compared DADT against other strategies through simulation and the results show that it can achieve higher satisfaction ratio while keeping low transmission overhead.
{"title":"Density-Aware Delay-Tolerant Interest Forwarding in Vehicular Named Data Networking","authors":"Meng Kuai, X. Hong, Qiangyuan Yu","doi":"10.1109/VTCFall.2016.7880953","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7880953","url":null,"abstract":"Named Data Networking (NDN) has been considered as a promising networking architecture for Vehicular Ad-Hoc Networks (VANETs). However, Interest forwarding in NDN suffers severe issues in vehicular environment. Broadcast storm results in much packet loss and huge transmission overhead. Also, link disconnection caused by highly dynamic topology leads to low packet delivery ratio. On the other hand, traffic data are playing significant roles in VANETs since they are essential in varieties of Intelligent Transportation System (ITS) applications. Thus, an efficient NDN forwarding strategy using geographical characteristics to retrieve traffic data is urgently required. In this paper, we propose Density-Aware Delay-Tolerant (DADT) Interest forwarding strategy to retrieve traffic data in vehicular NDN with the purpose of improving packet delivery ratio. DADT specifically addresses data retrieval during network disruptions using Delay Tolerant Networking (DTN). It makes retransmission decision based on directional network density. Also, DADT mitigates broadcast storm by using rebroadcast deferring timer. We compared DADT against other strategies through simulation and the results show that it can achieve higher satisfaction ratio while keeping low transmission overhead.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82953344","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-09-01DOI: 10.1109/VTCFall.2016.7881961
Saneeha Ahmed, K. Tepe
The advancement in communication technologies has enabled ad hoc networks to collect large volumes of information. This information is vulnerable to various types of attacks amongst which false information dissemination and on-off attacks offer biggest threats to the networks. As the data in ad hoc networks depends on the events, it is necessary for any detection mechanism to first determine the true events. Then the information about these events can be used to judge the behavior of the senders. Therefore, in this work, the correct event is first learned using information from different sources including the observations of the receiver itself. This information is later used to learn the behavior of the senders. The learned behavior combined with the opinions of the neighbors about the sender allows the detection of malicious and honest nodes. In this work, a logistic trust model is used to combine the observed behavior and opinions. It is observed that logistic trust results in a high accuracy of over 99% and a low error of less than 1% even when the events are changing rapidly. It is also shown that the scheme can detect malicious majority and identify true events with high probability.
{"title":"Using Logistic Trust for Event Learning and Misbehaviour Detection","authors":"Saneeha Ahmed, K. Tepe","doi":"10.1109/VTCFall.2016.7881961","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7881961","url":null,"abstract":"The advancement in communication technologies has enabled ad hoc networks to collect large volumes of information. This information is vulnerable to various types of attacks amongst which false information dissemination and on-off attacks offer biggest threats to the networks. As the data in ad hoc networks depends on the events, it is necessary for any detection mechanism to first determine the true events. Then the information about these events can be used to judge the behavior of the senders. Therefore, in this work, the correct event is first learned using information from different sources including the observations of the receiver itself. This information is later used to learn the behavior of the senders. The learned behavior combined with the opinions of the neighbors about the sender allows the detection of malicious and honest nodes. In this work, a logistic trust model is used to combine the observed behavior and opinions. It is observed that logistic trust results in a high accuracy of over 99% and a low error of less than 1% even when the events are changing rapidly. It is also shown that the scheme can detect malicious majority and identify true events with high probability.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91462089","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-09-01DOI: 10.1109/VTCFall.2016.7881145
Pengtao Zhao, Hui Tian, Bo Fan
With mobile applications sharply developing, the battery technology becomes the bottleneck. Meanwhile, mobile users are increasingly sensitive to the latency of an application. The computation offloading in Small Cell Cloud (SCC) can economize the energy consumption of mobile devices efficiently and guarantee the makespan of an application. In this paper, we model the mobile application as a directed acyclic graph (DAG), and formulate an optimization problem of collaborative task execution to minimize the energy consumption on the mobile device while meeting a prescribed latency constraint. In order to solve this NP-hard problem, we propose a greedy algorithm based on partial critical path (GA-PCP) which can solve the problem approximately. The algorithm partitions the DAG into chains and processes these chains with the ``Add- Compare-Select" strategy to obtain the execution strategy. The algorithm can obtain a polynomial time complexity. Simulation results show that the solution of the GA-PCP is close to the optimal solution of the enumeration algorithm. Besides, the GA-PCP execution strategy can significantly save the energy consumption on the mobile device thereby prolonging its battery life, compared to the local execution.
{"title":"Partial Critical Path Based Greedy Offloading in Small Cell Cloud","authors":"Pengtao Zhao, Hui Tian, Bo Fan","doi":"10.1109/VTCFall.2016.7881145","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7881145","url":null,"abstract":"With mobile applications sharply developing, the battery technology becomes the bottleneck. Meanwhile, mobile users are increasingly sensitive to the latency of an application. The computation offloading in Small Cell Cloud (SCC) can economize the energy consumption of mobile devices efficiently and guarantee the makespan of an application. In this paper, we model the mobile application as a directed acyclic graph (DAG), and formulate an optimization problem of collaborative task execution to minimize the energy consumption on the mobile device while meeting a prescribed latency constraint. In order to solve this NP-hard problem, we propose a greedy algorithm based on partial critical path (GA-PCP) which can solve the problem approximately. The algorithm partitions the DAG into chains and processes these chains with the ``Add- Compare-Select\" strategy to obtain the execution strategy. The algorithm can obtain a polynomial time complexity. Simulation results show that the solution of the GA-PCP is close to the optimal solution of the enumeration algorithm. Besides, the GA-PCP execution strategy can significantly save the energy consumption on the mobile device thereby prolonging its battery life, compared to the local execution.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91422075","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-09-01DOI: 10.1109/VTCFall.2016.7880971
V. Frascolla, A. Morgado, Á. Gomes, M. Butt, N. Marchetti, K. Voulgaris, C. Papadias
This paper proposes a new system architecture for Licensed Shared Access (LSA) wireless networks, as well as novel band management techniques for fair and ranking-based spectrum allocation. The proposed architecture builds upon recently standardized and regulatory-accepted LSA systems and stems from the work done in the EU-funded project ADEL. Two new resource allocation algorithms are introduced and their behaviour is validated via system-level simulations.
{"title":"Dynamic Licensed Shared Access - A New Architecture and Spectrum Allocation Techniques","authors":"V. Frascolla, A. Morgado, Á. Gomes, M. Butt, N. Marchetti, K. Voulgaris, C. Papadias","doi":"10.1109/VTCFall.2016.7880971","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7880971","url":null,"abstract":"This paper proposes a new system architecture for Licensed Shared Access (LSA) wireless networks, as well as novel band management techniques for fair and ranking-based spectrum allocation. The proposed architecture builds upon recently standardized and regulatory-accepted LSA systems and stems from the work done in the EU-funded project ADEL. Two new resource allocation algorithms are introduced and their behaviour is validated via system-level simulations.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83467394","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}
To improve physical (PHY) layer security of a wireless relay system in the presence of an eavesdropper, a two-phase cooperative relaying scheme is investigated in this paper. In phase I, the source transmits confidential message, simultaneously, it cooperates with the friendly jammers and destination to create jamming signal at the eavesdropper without affecting the forwarding relay which is preselected. In phase II, the forwarding relay retransmits the decoded signal, meanwhile, the particular relay cooperates with the friendly jammers to create jamming signal at the eavesdropper without affecting the destination. We focus on the investigation of optimal power allocation for maximizing achievable secrecy rate subject to a total power constraint. Optimal relay selection and suboptimal relay selection schemes are also proposed. It is shown that as the number of relays increases, both secrecy rate and the performance of suboptimal relay selection scheme improve significantly. Numerical results are presented to validate the derived analytical results and compare them to existing work
{"title":"Destination Assisted Secret Transmission in Wireless Relay Networks","authors":"Shaobo Jia, Jiayan Zhang, Honglin Zhao, Ruoyu Zhang","doi":"10.1109/VTCFall.2016.7880959","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7880959","url":null,"abstract":"To improve physical (PHY) layer security of a wireless relay system in the presence of an eavesdropper, a two-phase cooperative relaying scheme is investigated in this paper. In phase I, the source transmits confidential message, simultaneously, it cooperates with the friendly jammers and destination to create jamming signal at the eavesdropper without affecting the forwarding relay which is preselected. In phase II, the forwarding relay retransmits the decoded signal, meanwhile, the particular relay cooperates with the friendly jammers to create jamming signal at the eavesdropper without affecting the destination. We focus on the investigation of optimal power allocation for maximizing achievable secrecy rate subject to a total power constraint. Optimal relay selection and suboptimal relay selection schemes are also proposed. It is shown that as the number of relays increases, both secrecy rate and the performance of suboptimal relay selection scheme improve significantly. Numerical results are presented to validate the derived analytical results and compare them to existing work","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80807995","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}
In this work, we consider a multiuser communication system in fading channels where the transmitter is supplied by hybrid energy sources including power grid and various renewable sources. Specially, the energy harvested from various renewable sources is stored in a limited capacity buffer, and the joint energy incoming is time-varying and possibly unpredictable. In addition, data arrives randomly to the transmitter and queues according to the individual receivers, the wireless channels fluctuate randomly due to fading. Our goal is, under this condition to develop a dynamic power allocation algorithm so as to minimize the time average amount of energy consumed from the power grid over an infinite horizon, subjecting to all data queues stability. The issue is formulated as a stochastic optimization problem and solved by Lyapunov optimization technique which does not require the statistical probabilities of energy harvesting process, data arrivals process and channel state. Simulation results demonstrate that our proposed algorithm provides obviously better performance than other two simple greedy algorithms, meanwhile the algorithm gives a guarantee that the maximum delay of all data queues cannot exceed a given value.
{"title":"Dynamic Power Allocation for a Hybrid Energy Harvesting Transmitter with Multiuser in Fading Channels","authors":"Didi Liu, Jiming Lin, Junyi Wang, Xiaohui Chen, Yibin Chen","doi":"10.1109/VTCFall.2016.7880974","DOIUrl":"https://doi.org/10.1109/VTCFall.2016.7880974","url":null,"abstract":"In this work, we consider a multiuser communication system in fading channels where the transmitter is supplied by hybrid energy sources including power grid and various renewable sources. Specially, the energy harvested from various renewable sources is stored in a limited capacity buffer, and the joint energy incoming is time-varying and possibly unpredictable. In addition, data arrives randomly to the transmitter and queues according to the individual receivers, the wireless channels fluctuate randomly due to fading. Our goal is, under this condition to develop a dynamic power allocation algorithm so as to minimize the time average amount of energy consumed from the power grid over an infinite horizon, subjecting to all data queues stability. The issue is formulated as a stochastic optimization problem and solved by Lyapunov optimization technique which does not require the statistical probabilities of energy harvesting process, data arrivals process and channel state. Simulation results demonstrate that our proposed algorithm provides obviously better performance than other two simple greedy algorithms, meanwhile the algorithm gives a guarantee that the maximum delay of all data queues cannot exceed a given value.","PeriodicalId":6484,"journal":{"name":"2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81032106","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
扫码关注我们
求助内容：
应助结果提醒方式：