Pub Date : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348565
Estela Carmona Cejudo, Huiling Zhu, Jiangzhou Wang
The problem of resource allocation in multicarrier non-orthogonal multiple access (NOMA) systems is non-deterministic polynomial time (NP)-hard and requires exhaustive search, which has prohibitive computational complexity. Computationally-efficient algorithms that provide a performance close to optimal are needed. In this paper, the problem of resource allocation is divided into two sub-problems, namely subcarrier assignment and power allocation. The optimal users’ channel condition relationship is derived in terms of effective system sum-rate, and a computationally-efficient ideal partner search algorithm (IPSA) is proposed. Further, optimal power allocation (OPA) is studied in terms of fairness, and an OPA coefficient is theoretically derived based on the channel condition ratio of two NOMA users. Numerical results show that IPSA with OPA outperforms IPSA with fractional transmit power allocation (FTPA), the strongest user-weakest user (SUWU) scheme and user grouping (UG) in terms of achievable system effective sum-rate, average user bit error rate (BER) and number of users with a poor BER. Further, the computational complexity of IPSA with OPA is much lower than that of exhaustive search.
{"title":"Resource Allocation in Downlink Multicarrier NOMA under a Fairness Constraint","authors":"Estela Carmona Cejudo, Huiling Zhu, Jiangzhou Wang","doi":"10.1109/VTC2020-Fall49728.2020.9348565","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348565","url":null,"abstract":"The problem of resource allocation in multicarrier non-orthogonal multiple access (NOMA) systems is non-deterministic polynomial time (NP)-hard and requires exhaustive search, which has prohibitive computational complexity. Computationally-efficient algorithms that provide a performance close to optimal are needed. In this paper, the problem of resource allocation is divided into two sub-problems, namely subcarrier assignment and power allocation. The optimal users’ channel condition relationship is derived in terms of effective system sum-rate, and a computationally-efficient ideal partner search algorithm (IPSA) is proposed. Further, optimal power allocation (OPA) is studied in terms of fairness, and an OPA coefficient is theoretically derived based on the channel condition ratio of two NOMA users. Numerical results show that IPSA with OPA outperforms IPSA with fractional transmit power allocation (FTPA), the strongest user-weakest user (SUWU) scheme and user grouping (UG) in terms of achievable system effective sum-rate, average user bit error rate (BER) and number of users with a poor BER. Further, the computational complexity of IPSA with OPA is much lower than that of exhaustive search.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114996118","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 : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348486
Wei Yang Bryan Lim, Zehui Xiong, D. Niyato, Jianqiang Huang, Xiansheng Hua, C. Miao
In the Internet of Vehicles (IoV) paradigm, a model owner is able to leverage on the enhanced capabilities of Intelligent Connected Vehicles (ICV) to develop promising Artificial Intelligence (AI) based applications, e.g., for traffic efficiency. However, in some cases, a model owner may have insufficient data samples to build an effective AI model. To this end, we propose a Federated Learning (FL) based privacy preserving approach to facilitate collaborative FL among multiple model owners in the IoV. Our system model enables collaborative model training without compromising data privacy given that only the model parameters instead of the raw data are exchanged within the federation. However, there are two main challenges of incentive mismatches between workers and model owners, as well as among model owners. For the former, we leverage on the self-revealing mechanism in contract theory under information asymmetry. For the latter, we use the coalitional game theory approach that rewards model owners based on their marginal contributions. The numerical results validate the performance efficiency of our proposed hierarchical incentive mechanism design.
{"title":"Incentive Mechanism Design for Federated Learning in the Internet of Vehicles","authors":"Wei Yang Bryan Lim, Zehui Xiong, D. Niyato, Jianqiang Huang, Xiansheng Hua, C. Miao","doi":"10.1109/VTC2020-Fall49728.2020.9348486","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348486","url":null,"abstract":"In the Internet of Vehicles (IoV) paradigm, a model owner is able to leverage on the enhanced capabilities of Intelligent Connected Vehicles (ICV) to develop promising Artificial Intelligence (AI) based applications, e.g., for traffic efficiency. However, in some cases, a model owner may have insufficient data samples to build an effective AI model. To this end, we propose a Federated Learning (FL) based privacy preserving approach to facilitate collaborative FL among multiple model owners in the IoV. Our system model enables collaborative model training without compromising data privacy given that only the model parameters instead of the raw data are exchanged within the federation. However, there are two main challenges of incentive mismatches between workers and model owners, as well as among model owners. For the former, we leverage on the self-revealing mechanism in contract theory under information asymmetry. For the latter, we use the coalitional game theory approach that rewards model owners based on their marginal contributions. The numerical results validate the performance efficiency of our proposed hierarchical incentive mechanism design.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115478288","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 : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348800
F. Adachi, R. Takahashi
In this paper, a multi-user MIMO using zeroforcing (ZF)-based multiplexing coordinated with user-wise spatial diversity is proposed assuming time-division duplex (TDD). The downlink and uplink signal-to-noise ratios (SNRs) are analyzed for the given multi-user MIMO channel. It is shown that the downlink capacity is the same for all users while the uplink capacity is not necessarily the same. The closed-form expressions for the downlink and uplink SNRs conditioned on the 2-user virtual MIMO channel are derived. It is shown that the uplink sum capacity is higher than the downlink sum capacity. The downlink and uplink capacities are numerically evaluated by Monte Carlo simulation in a Rayleigh fading environment. It is shown that the link capacity can be improved by increasing the number of user antennas while keeping the ZF matrix size in the same level.
{"title":"Multi-user MIMO using ZF-based Multiplexing Coordinated with User-wise Spatial Diversity","authors":"F. Adachi, R. Takahashi","doi":"10.1109/VTC2020-Fall49728.2020.9348800","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348800","url":null,"abstract":"In this paper, a multi-user MIMO using zeroforcing (ZF)-based multiplexing coordinated with user-wise spatial diversity is proposed assuming time-division duplex (TDD). The downlink and uplink signal-to-noise ratios (SNRs) are analyzed for the given multi-user MIMO channel. It is shown that the downlink capacity is the same for all users while the uplink capacity is not necessarily the same. The closed-form expressions for the downlink and uplink SNRs conditioned on the 2-user virtual MIMO channel are derived. It is shown that the uplink sum capacity is higher than the downlink sum capacity. The downlink and uplink capacities are numerically evaluated by Monte Carlo simulation in a Rayleigh fading environment. It is shown that the link capacity can be improved by increasing the number of user antennas while keeping the ZF matrix size in the same level.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124260981","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 : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348649
Yujie Wen, Xiaotian Zhou, Fang Fang, Haixia Zhang, D. Yuan
This paper deals with the joint time and power allocation problem in the cooperative Non-Orthogonal Division Multiple Access (NOMA) based Mobile Edge Computing (MEC) system. We consider a basic three-node MEC system consisting of a Far User (FU), a Near User (NU), and a Base Station (BS) equipped with the MEC server. In the proposed system, the tasks of the users are divided into two parts which are executed locally and at the edge server, respectively. Moreover, the NU would help offload the FU's task together with his own through NOMA transmission. The optimization problem of joint cooperation time slots assignment and power allocation at both NU and FU is formulated to minimize the total energy consumption of users. To efficiently solve it, an algorithm is proposed through employing Lagrange duality method. Simulation results demonstrate that the proposed algorithm can outperform the existing schemes and improve the energy efficiency of the system remarkably.
{"title":"Joint Time and Power Allocation for Cooperative NOMA based MEC System","authors":"Yujie Wen, Xiaotian Zhou, Fang Fang, Haixia Zhang, D. Yuan","doi":"10.1109/VTC2020-Fall49728.2020.9348649","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348649","url":null,"abstract":"This paper deals with the joint time and power allocation problem in the cooperative Non-Orthogonal Division Multiple Access (NOMA) based Mobile Edge Computing (MEC) system. We consider a basic three-node MEC system consisting of a Far User (FU), a Near User (NU), and a Base Station (BS) equipped with the MEC server. In the proposed system, the tasks of the users are divided into two parts which are executed locally and at the edge server, respectively. Moreover, the NU would help offload the FU's task together with his own through NOMA transmission. The optimization problem of joint cooperation time slots assignment and power allocation at both NU and FU is formulated to minimize the total energy consumption of users. To efficiently solve it, an algorithm is proposed through employing Lagrange duality method. Simulation results demonstrate that the proposed algorithm can outperform the existing schemes and improve the energy efficiency of the system remarkably.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125140344","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 : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348822
G. M. Zilli, Wei-Ping Zhu
We propose a joint hybrid precoder and combiner design for narrowband single-user massive MIMO systems. The analog precoder and combiner are computed by an iterative algorithm based on the constrained singular value decomposition (CSVD), which guarantees the constant modulus constraints of the phase-shifters in the analog beamforming are attained. The digital precoder is obtained from the SVD of the reduced-dimension effective channel, after taking into account the effect of the analog beamforming. Numerical simulation results show that the proposed HBF design outperforms several designs existing in the literature in terms of the achievable sum-rate, even when only imperfect channel state information (CSI) is available.
{"title":"Constrained-SVD based Hybrid Beamforming Design for Millimeter-Wave Communications","authors":"G. M. Zilli, Wei-Ping Zhu","doi":"10.1109/VTC2020-Fall49728.2020.9348822","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348822","url":null,"abstract":"We propose a joint hybrid precoder and combiner design for narrowband single-user massive MIMO systems. The analog precoder and combiner are computed by an iterative algorithm based on the constrained singular value decomposition (CSVD), which guarantees the constant modulus constraints of the phase-shifters in the analog beamforming are attained. The digital precoder is obtained from the SVD of the reduced-dimension effective channel, after taking into account the effect of the analog beamforming. Numerical simulation results show that the proposed HBF design outperforms several designs existing in the literature in terms of the achievable sum-rate, even when only imperfect channel state information (CSI) is available.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125149909","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 : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348749
Cheng Yang, Wei-dang Lu, Guoxing Huang, L. Qian, Bo Li, Yi Gong
Wireless sensor networks (WSNs) have the disadvantages of short lifetime due to the limited energy of the energy storage batteries of the sensor nodes and scarcity of spectrum resources as the number of sensor nodes increasing. Simultaneous wireless information and power transfer (SWIPT) can make WSNs solve the problem of short lifetime through sensor nodes harvest energy from radio-frequency (RF) signals. Cognitive radio(CR) can make WSNs solve the problem of the scarcity of spectrum resources through sensor nodes sense and access free licensed spectrum. This paper mainly investigates the performance of an underlay cognitive sensor network (CSN). The sensor nodes in the underlay CSN can communicate with each other through the help of energy harvesting (EH) relay sensor node (RSN) by using amplify-and-forward (AF) relaying protocol. To maximize the throughput of CSN, we propose a algorithm through optimizing the transmit power of sensor nodes. Simulation results show the algorithm is correct and has good performance.
{"title":"Power Optimization in Two-way AF Relaying SWIPT based Cognitive Sensor Networks","authors":"Cheng Yang, Wei-dang Lu, Guoxing Huang, L. Qian, Bo Li, Yi Gong","doi":"10.1109/VTC2020-Fall49728.2020.9348749","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348749","url":null,"abstract":"Wireless sensor networks (WSNs) have the disadvantages of short lifetime due to the limited energy of the energy storage batteries of the sensor nodes and scarcity of spectrum resources as the number of sensor nodes increasing. Simultaneous wireless information and power transfer (SWIPT) can make WSNs solve the problem of short lifetime through sensor nodes harvest energy from radio-frequency (RF) signals. Cognitive radio(CR) can make WSNs solve the problem of the scarcity of spectrum resources through sensor nodes sense and access free licensed spectrum. This paper mainly investigates the performance of an underlay cognitive sensor network (CSN). The sensor nodes in the underlay CSN can communicate with each other through the help of energy harvesting (EH) relay sensor node (RSN) by using amplify-and-forward (AF) relaying protocol. To maximize the throughput of CSN, we propose a algorithm through optimizing the transmit power of sensor nodes. Simulation results show the algorithm is correct and has good performance.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125911419","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 : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348843
Zhe Luo, Fan Wang, Mengying Ding, Yan Chen
The pilot design and the corresponding receiver algorithm are the key issue to support massive access via grant-free uplink transmission. In this paper, we propose a Superposition Bloom Filter (SBF) pilot design, where an SBF pilot is composed of several sequences. A SBF pilot can be distinguished from another one by different combination of sequences, i.e., the signature of the SBF pilot. The key improvement over previous BF-related work is to consider superposed complex hash-coded information instead of binary one. To guarantee the detection performance under large pilot pool size, we give the rule of constructing pilot pool based on (K;D;ρ)-expander and design a receiver algorithm including correlation-based sequence detection and compressed sensing (CS) based signature recognition, which uses the amplitude and phase information of received sequences. The simulation results show our proposed SBF pilot and corresponding receiver algorithm greatly improve the detection performance in terms of missing detection probability and false alarm probability in frequency-selective channels, compared with previous work.
{"title":"Enabling Massive Access of IoT by Superposition Bloom Filter and Compressed Sensing","authors":"Zhe Luo, Fan Wang, Mengying Ding, Yan Chen","doi":"10.1109/VTC2020-Fall49728.2020.9348843","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348843","url":null,"abstract":"The pilot design and the corresponding receiver algorithm are the key issue to support massive access via grant-free uplink transmission. In this paper, we propose a Superposition Bloom Filter (SBF) pilot design, where an SBF pilot is composed of several sequences. A SBF pilot can be distinguished from another one by different combination of sequences, i.e., the signature of the SBF pilot. The key improvement over previous BF-related work is to consider superposed complex hash-coded information instead of binary one. To guarantee the detection performance under large pilot pool size, we give the rule of constructing pilot pool based on (K;D;ρ)-expander and design a receiver algorithm including correlation-based sequence detection and compressed sensing (CS) based signature recognition, which uses the amplitude and phase information of received sequences. The simulation results show our proposed SBF pilot and corresponding receiver algorithm greatly improve the detection performance in terms of missing detection probability and false alarm probability in frequency-selective channels, compared with previous work.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123443678","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}
As Internet of Things (IoT) technology is growing fast, it is clearly forseen that the number of IoT devices and the scale of connections will be further expanded. IoT is capable of taking advantage of the existing network infrastructure effectively, so as to achieve data sharing between devices. However, the large scale and complexity of the network structure will bring potential security risks to IoT system. The traditional access control model is more complex and centralized. This paper aims to build a trust-driven distributed self-collaborative security architecture of IoT based on blockchain and smart contracts, which could overcome the single-point failure problem of centralized entities. Implementation of the security architecture shows that it still possesses characteristics including scalability, lightweight, and fine granularity, while the secure access control preserves the privacy of IoT devices.
{"title":"Trust-driven Distributed Self-collaborative Security Architecture of IoT Based on Blockchain and Smart Contracts","authors":"Hong-Ze Li, Sirun Xu, Saifei Li, Guangcheng Sun, Xiaowei Zhang, Lian-shan Yan","doi":"10.1109/VTC2020-Fall49728.2020.9348760","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348760","url":null,"abstract":"As Internet of Things (IoT) technology is growing fast, it is clearly forseen that the number of IoT devices and the scale of connections will be further expanded. IoT is capable of taking advantage of the existing network infrastructure effectively, so as to achieve data sharing between devices. However, the large scale and complexity of the network structure will bring potential security risks to IoT system. The traditional access control model is more complex and centralized. This paper aims to build a trust-driven distributed self-collaborative security architecture of IoT based on blockchain and smart contracts, which could overcome the single-point failure problem of centralized entities. Implementation of the security architecture shows that it still possesses characteristics including scalability, lightweight, and fine granularity, while the secure access control preserves the privacy of IoT devices.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125550237","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 : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348659
Adriana Arteaga, Pablo Palacios Játiva, Sandra Céspedes Umaña, César A. Azurdia-Meza
In this work, we present a comparative study of two strategies for opportunistic vehicular access over TV White Spaces (TVWS) spectrum, in the presence of fixed secondary networks. When the vehicular network meets other opportunistic users in the same TVWS channel, the first strategy is searching for a TVWS channel for exclusive vehicular access, while the other approach explores the coexistence between the vehicular network and the fixed secondary network. To carry out the evaluation of the strategies, we use the NS-3 network simulator, including some of the cognitive radio modules developed. Results showed that, in the case of study, the strategy of coexistence between the vehicular network and other opportunistic users over the TVWS channel (i.e., sharing the same TV channel) reduces the average access channel delay up to 15% and the average packet loss up to 17%.
{"title":"Evaluation of Opportunistic Access Strategies for Vehicular Networking Over TVWS","authors":"Adriana Arteaga, Pablo Palacios Játiva, Sandra Céspedes Umaña, César A. Azurdia-Meza","doi":"10.1109/VTC2020-Fall49728.2020.9348659","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348659","url":null,"abstract":"In this work, we present a comparative study of two strategies for opportunistic vehicular access over TV White Spaces (TVWS) spectrum, in the presence of fixed secondary networks. When the vehicular network meets other opportunistic users in the same TVWS channel, the first strategy is searching for a TVWS channel for exclusive vehicular access, while the other approach explores the coexistence between the vehicular network and the fixed secondary network. To carry out the evaluation of the strategies, we use the NS-3 network simulator, including some of the cognitive radio modules developed. Results showed that, in the case of study, the strategy of coexistence between the vehicular network and other opportunistic users over the TVWS channel (i.e., sharing the same TV channel) reduces the average access channel delay up to 15% and the average packet loss up to 17%.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125688462","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 : 2020-11-01DOI: 10.1109/VTC2020-Fall49728.2020.9348646
J. Misic, V. Mišić, Xiaolin Chang, Haytham Qushtom
This work proposes and evaluates a Practical Byzantine Fault Tolerance (PBFT)-inspired ordering service for IoT data collection and block formation in a permissioned blockchain environment. We implement an algorithm for atomic insertion of request to ordering service in which each ordering node can initiate insertion and lead the consensus protocol, unlike traditional current implementations of ordering service which rely on a single point of entry. We have modeled record insertion service into the P2P ordering service with constant number of nodes, variable request rate, and known distribution of one-way propagation delays among the ordering peers. Performance results show the behavior of system descriptors and the limits of system capacity expressed in terms of total request rate.
{"title":"PBFT-based ordering service for IoT domains","authors":"J. Misic, V. Mišić, Xiaolin Chang, Haytham Qushtom","doi":"10.1109/VTC2020-Fall49728.2020.9348646","DOIUrl":"https://doi.org/10.1109/VTC2020-Fall49728.2020.9348646","url":null,"abstract":"This work proposes and evaluates a Practical Byzantine Fault Tolerance (PBFT)-inspired ordering service for IoT data collection and block formation in a permissioned blockchain environment. We implement an algorithm for atomic insertion of request to ordering service in which each ordering node can initiate insertion and lead the consensus protocol, unlike traditional current implementations of ordering service which rely on a single point of entry. We have modeled record insertion service into the P2P ordering service with constant number of nodes, variable request rate, and known distribution of one-way propagation delays among the ordering peers. Performance results show the behavior of system descriptors and the limits of system capacity expressed in terms of total request rate.","PeriodicalId":132628,"journal":{"name":"2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126952002","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
扫码关注我们
求助内容：
应助结果提醒方式：