Pub Date : 2019-08-01DOI: 10.1109/ICCChinaW.2019.8849964
Yutong Xie, Zhengzhuo Xu, Yuxing Zhong, Jing Xu, Shimin Gong, Yi Wang
Wireless Internet of Things (IoT) devices can be deployed for data acquisition and decision making, e.g., the wearable sensors used for healthcare monitoring. Due to limited computation capability, the low-power IoT devices can optionally offload power-consuming computation to a nearby computing server. To balance power consumption in data offloading and computation, we propose a novel hybrid data offloading scheme that allows each device to offload data via either the conventional RF communications or low-power backscatter communications. Such a flexibility makes it more complicated to optimize the offloading strategy with uncertain workload and energy supply at each device. As such, we propose the deep reinforcement learning (DRL) to learn the optimal offloading policy from past experience. In particular, we rely on the policy-based DRL approach for continuous control problems in the actor-critic framework. By interacting with the network environment, we can optimize each user's energy harvesting time and the workload allocation among different offloading schemes. The numerical results show that the proposed DRL approach can achieve much higher reward and learning speed compared to the conventional deep Q-network method.
{"title":"Backscatter-Assisted Computation Offloading for Energy Harvesting IoT Devices via Policy-based Deep Reinforcement Learning","authors":"Yutong Xie, Zhengzhuo Xu, Yuxing Zhong, Jing Xu, Shimin Gong, Yi Wang","doi":"10.1109/ICCChinaW.2019.8849964","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849964","url":null,"abstract":"Wireless Internet of Things (IoT) devices can be deployed for data acquisition and decision making, e.g., the wearable sensors used for healthcare monitoring. Due to limited computation capability, the low-power IoT devices can optionally offload power-consuming computation to a nearby computing server. To balance power consumption in data offloading and computation, we propose a novel hybrid data offloading scheme that allows each device to offload data via either the conventional RF communications or low-power backscatter communications. Such a flexibility makes it more complicated to optimize the offloading strategy with uncertain workload and energy supply at each device. As such, we propose the deep reinforcement learning (DRL) to learn the optimal offloading policy from past experience. In particular, we rely on the policy-based DRL approach for continuous control problems in the actor-critic framework. By interacting with the network environment, we can optimize each user's energy harvesting time and the workload allocation among different offloading schemes. The numerical results show that the proposed DRL approach can achieve much higher reward and learning speed compared to the conventional deep Q-network method.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125679446","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 : 2019-08-01DOI: 10.1109/ICCChinaW.2019.8849945
Xuewan Zhang, G. Han, Dalong Zhang, Liuqing Yang
Sparse code multiple access (SCMA) is a competitive non-orthogonal multiple access (NOMA) technique for the internet of medical things (IoMT). The essential problem of SCMA is to design the large scale codebooks with high coding gain. In this article, a new lattice-based codebook design method is proposed to generate the multi-dimensional constellation. Firstly, an optimization problem about multi-dimensional constellations is constructed to quest the real constellation with maximum coding gain. Secondly, by combining the dimensions of the real constellations, we construct the basic complex mother constellation. The mother constellation can increase the power diversity and ensure the constant Euclidean distance between constellation points. Finally, we generate the mother codebooks with designed mapping matrix by constellation rotation. Simulation results demonstrate that the designed codebook has higher coding gain with large codebook size, especially under the high signal to noise ratio (SNR) condition.
{"title":"A Lattice-Based SCMA Codebook Design for IoMT Communications","authors":"Xuewan Zhang, G. Han, Dalong Zhang, Liuqing Yang","doi":"10.1109/ICCChinaW.2019.8849945","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849945","url":null,"abstract":"Sparse code multiple access (SCMA) is a competitive non-orthogonal multiple access (NOMA) technique for the internet of medical things (IoMT). The essential problem of SCMA is to design the large scale codebooks with high coding gain. In this article, a new lattice-based codebook design method is proposed to generate the multi-dimensional constellation. Firstly, an optimization problem about multi-dimensional constellations is constructed to quest the real constellation with maximum coding gain. Secondly, by combining the dimensions of the real constellations, we construct the basic complex mother constellation. The mother constellation can increase the power diversity and ensure the constant Euclidean distance between constellation points. Finally, we generate the mother codebooks with designed mapping matrix by constellation rotation. Simulation results demonstrate that the designed codebook has higher coding gain with large codebook size, especially under the high signal to noise ratio (SNR) condition.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134085052","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}
Terahertz (THz) communication system is envisioned as a promising alternative to support ultra-high speed data transmission for future indoor application scenarios. Due to the existence of the potential obstacles, the line-of-sight communication links for indoor THz communication are not reliable. In this paper, we thus investigate the utilization of intelligent reflecting surface (IRS) to enhance the reflecting transmission of the THz communication system. Specifically, an IRS consists of a large number of reflecting elements, and the phase-shift of each reflecting element is adjustable. Based on the principle of IRS, the propagation direction of THz signals can be changed via adjusting all the phase-shifts of IRS, and then we are able to improve the sum-rate performance by selecting the optimal values of the phase-shifts. Accordingly, we first propose a local search (LS) method, which can greatly decease the complexity compared with the traditional exhaustive search method. However, the LS method suffers a certain performance loss. To this end, we then propose a cross-entropy (CE) method that is feasible to promote the sum-rate compared with the LS method. Numerical results verify the above conclusions, and also show the merit of the IRS-enhanced THz communication system.
{"title":"Sum-rate Maximization for Intelligent Reflecting Surface Based Terahertz Communication Systems","authors":"Wenjie Chen, Xinying Ma, Zhuoxun Li, Ningyuan Kuang","doi":"10.1109/ICCChinaW.2019.8849960","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849960","url":null,"abstract":"Terahertz (THz) communication system is envisioned as a promising alternative to support ultra-high speed data transmission for future indoor application scenarios. Due to the existence of the potential obstacles, the line-of-sight communication links for indoor THz communication are not reliable. In this paper, we thus investigate the utilization of intelligent reflecting surface (IRS) to enhance the reflecting transmission of the THz communication system. Specifically, an IRS consists of a large number of reflecting elements, and the phase-shift of each reflecting element is adjustable. Based on the principle of IRS, the propagation direction of THz signals can be changed via adjusting all the phase-shifts of IRS, and then we are able to improve the sum-rate performance by selecting the optimal values of the phase-shifts. Accordingly, we first propose a local search (LS) method, which can greatly decease the complexity compared with the traditional exhaustive search method. However, the LS method suffers a certain performance loss. To this end, we then propose a cross-entropy (CE) method that is feasible to promote the sum-rate compared with the LS method. Numerical results verify the above conclusions, and also show the merit of the IRS-enhanced THz communication system.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121933951","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 : 2019-08-01DOI: 10.1109/ICCChinaW.2019.8849949
Xiangxiang Zhang, T. Luo
We present and use a recurrent neural network as RNN decoder for the convolutional code under correlated noise. Using the bidirectional GRU(Gated Recurrent Unit) network and the fully connected neural network(DNN), the sequence feature information of the convolutional code is extracted, and the decoding result is calculated by the fully connected neural network. The RNN neural network decoder achieves better BER(Bit Error Rate) performance than the traditional Viterbi decoding algorithm for convolutional codes with shorter memory lengths, such as (2, 1, 3) convolutional codes under correlated noise. The greater noise correlation, the greater performance improvement of the decoder relative to the traditional Viterbi decoding algorithm. Besides, the RNN decoder is close to the MAP performance under the AWGN channel. In addition, the decoder is robust under different noise correlation models. Due to the limitation of the structure and complexity of the RNN decoder, as the memory length of the convolutional code increases, its decoding performance is gradually reduced, which is not suitable for convolutional codes with long memory lengths.
{"title":"A RNN Decoder for Channel Decoding under Correlated Noise","authors":"Xiangxiang Zhang, T. Luo","doi":"10.1109/ICCChinaW.2019.8849949","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849949","url":null,"abstract":"We present and use a recurrent neural network as RNN decoder for the convolutional code under correlated noise. Using the bidirectional GRU(Gated Recurrent Unit) network and the fully connected neural network(DNN), the sequence feature information of the convolutional code is extracted, and the decoding result is calculated by the fully connected neural network. The RNN neural network decoder achieves better BER(Bit Error Rate) performance than the traditional Viterbi decoding algorithm for convolutional codes with shorter memory lengths, such as (2, 1, 3) convolutional codes under correlated noise. The greater noise correlation, the greater performance improvement of the decoder relative to the traditional Viterbi decoding algorithm. Besides, the RNN decoder is close to the MAP performance under the AWGN channel. In addition, the decoder is robust under different noise correlation models. Due to the limitation of the structure and complexity of the RNN decoder, as the memory length of the convolutional code increases, its decoding performance is gradually reduced, which is not suitable for convolutional codes with long memory lengths.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127727296","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 : 2019-08-01DOI: 10.1109/ICCChinaW.2019.8849929
Pengcheng Shi, Zhenyong Wang, Ci He, Xuanying Zhang, Wei Cai
Spinal codes are a new class of rateless codes that can achieve the channel capacity over time-varying channel condition. Pseudo random hash function is the core of spinal codes, which is executed to generate spines in every encoding and decoding process. However, due to the complexity of hash function, the decoding of spinal codes is complicated. A method to decrease the computational complexity of spinal codes is proposed in this paper by using chaotic Kent map. Compared with hash function, the chaotic Kent map can significantly decrease the computational complexity of decoding process in bubble decoder. Simulation shows that the performance of Kent map is almost similar to that of hash function, but the complexity of chaotic Kent map is only 25% of that of the bubble decoder when the segment length is 8.
{"title":"A novel spinal codes based on chaotic Kent mapping","authors":"Pengcheng Shi, Zhenyong Wang, Ci He, Xuanying Zhang, Wei Cai","doi":"10.1109/ICCChinaW.2019.8849929","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849929","url":null,"abstract":"Spinal codes are a new class of rateless codes that can achieve the channel capacity over time-varying channel condition. Pseudo random hash function is the core of spinal codes, which is executed to generate spines in every encoding and decoding process. However, due to the complexity of hash function, the decoding of spinal codes is complicated. A method to decrease the computational complexity of spinal codes is proposed in this paper by using chaotic Kent map. Compared with hash function, the chaotic Kent map can significantly decrease the computational complexity of decoding process in bubble decoder. Simulation shows that the performance of Kent map is almost similar to that of hash function, but the complexity of chaotic Kent map is only 25% of that of the bubble decoder when the segment length is 8.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114643928","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 : 2019-08-01DOI: 10.1109/ICCChinaW.2019.8849961
Chao Li, Siye Wang
Coexistence of multiple wireless systems in a 5G network can cause interference in the same frequency band and deteriorate the performance of the received signal. In this paper, a novel algorithm is proposed in antenna array processing to handle interference-coexistence communication. We adopt a linear filter which is called Linearly Constrained Minimum Variance (LCMV) filter. On the basis of traditional singly linearly constrained least mean square (LC-LMS), we introduce a log-sum penalty on the coefficients and add it into the cost function. We derive the iterative formula of filter weights. By simulations in antenna environment with signal of interest, noise and interferences, we prove that the convergence rate of the new method is faster than traditional one. Moreover, the mean-square-error(MSE) of the proposed method is also verified. Experiment results demonstrate that our method has lower MSE than the traditional LC-LMS algorithm. The proposed adaptive beamforming scheme can be applied in 5G system to deal with the coexistence of signals and interferences.
{"title":"An improved Adaptive BeamForming Algorithm for 5G Interference-coexistence communication","authors":"Chao Li, Siye Wang","doi":"10.1109/ICCChinaW.2019.8849961","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849961","url":null,"abstract":"Coexistence of multiple wireless systems in a 5G network can cause interference in the same frequency band and deteriorate the performance of the received signal. In this paper, a novel algorithm is proposed in antenna array processing to handle interference-coexistence communication. We adopt a linear filter which is called Linearly Constrained Minimum Variance (LCMV) filter. On the basis of traditional singly linearly constrained least mean square (LC-LMS), we introduce a log-sum penalty on the coefficients and add it into the cost function. We derive the iterative formula of filter weights. By simulations in antenna environment with signal of interest, noise and interferences, we prove that the convergence rate of the new method is faster than traditional one. Moreover, the mean-square-error(MSE) of the proposed method is also verified. Experiment results demonstrate that our method has lower MSE than the traditional LC-LMS algorithm. The proposed adaptive beamforming scheme can be applied in 5G system to deal with the coexistence of signals and interferences.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128205253","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}
Based on Belief-Desire-Intention(BDI) architecture,the Agent built in Answer set programming (ASP) is applied to a security platform.Firstly, the task planning is described in BDI models for different autonomous agents,which corresponding structure and cooperation mechanism are explained in detail; Secondly, the symbol language $mathcal{L}_{p}$ including predicate set is created for the security task, which defines the unified abstract symbols for representation, interaction and state machine.The paper describes the system as a dynamic application program in ASP to solve multi-agents problem. in additional, the method to solve the conflict of beliefs in multi-agent collaboration process is given with a technical framework called Equibel, which shares beliefs among agents and the renewal of their own beliefs. Finally, the theoretical method is simulated and validated with the security application background.The simulation results prove the effectiveness of Agent method, which can upgrade the traditional security system conveniently.
基于信念-欲望-意图(Belief-Desire-Intention, BDI)体系结构，将Agent内置在回答集编程(Answer set programming, ASP)中应用于安全平台。首先，对不同自治主体的BDI模型中的任务规划进行了描述，详细说明了相应的结构和协作机制;其次，为安全任务创建了包含谓词集的符号语言$mathcal{L}_{p}$，定义了用于表示、交互和状态机的统一抽象符号。本文将该系统描述为ASP中解决多智能体问题的动态应用程序。在此基础上，提出了解决多智能体协作过程中信念冲突的技术框架Equibel，即智能体之间的信念共享和自身信念的更新。最后，结合安全应用背景对理论方法进行了仿真验证。仿真结果证明了Agent方法的有效性，可以方便地对传统安防系统进行升级。
{"title":"Application of Agent in Security Platform","authors":"Haijun Gu, Shucun Zhu, Yinsheng Cui, Xin Miao, Haoyu Liu, Meiqi Liu","doi":"10.1109/ICCChinaW.2019.8849959","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849959","url":null,"abstract":"Based on Belief-Desire-Intention(BDI) architecture,the Agent built in Answer set programming (ASP) is applied to a security platform.Firstly, the task planning is described in BDI models for different autonomous agents,which corresponding structure and cooperation mechanism are explained in detail; Secondly, the symbol language $mathcal{L}_{p}$ including predicate set is created for the security task, which defines the unified abstract symbols for representation, interaction and state machine.The paper describes the system as a dynamic application program in ASP to solve multi-agents problem. in additional, the method to solve the conflict of beliefs in multi-agent collaboration process is given with a technical framework called Equibel, which shares beliefs among agents and the renewal of their own beliefs. Finally, the theoretical method is simulated and validated with the security application background.The simulation results prove the effectiveness of Agent method, which can upgrade the traditional security system conveniently.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134416538","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 : 2019-08-01DOI: 10.1109/ICCChinaW.2019.8849951
Yingting Liu, Ruyi Xiao, Jianmei Shen, Hongwu Yang, Chun-man Yan
This paper studies the outage performance of the hybrid amplify-and-forward (AF) relaying protocol in simultaneous wireless information and power transfer (SWIPT) systems with direct link. In the hybrid power-time switching based relaying (HPTSR), the block time T is divided into two parts. One is used for energy harvesting and information processing, and the other is used for information transmission from relay to destination node. During the part of energy harvesting and information processing, one portion of the received signal is used for energy harvesting (EH) and the other portion of the received signal is used for information processing. An analytical expressions for outage probability is derived in the hybrid AF-based relay network. Our numerical results verify our analytical expressions and shows that the proposed system performance of the hybrid protocol in the presence of the direct link outperforms the hybrid protocol without direct link.
{"title":"Performance Analysis for Hybrid AF Relaying Protocol in SWIPT Systems with Direct Link","authors":"Yingting Liu, Ruyi Xiao, Jianmei Shen, Hongwu Yang, Chun-man Yan","doi":"10.1109/ICCChinaW.2019.8849951","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849951","url":null,"abstract":"This paper studies the outage performance of the hybrid amplify-and-forward (AF) relaying protocol in simultaneous wireless information and power transfer (SWIPT) systems with direct link. In the hybrid power-time switching based relaying (HPTSR), the block time T is divided into two parts. One is used for energy harvesting and information processing, and the other is used for information transmission from relay to destination node. During the part of energy harvesting and information processing, one portion of the received signal is used for energy harvesting (EH) and the other portion of the received signal is used for information processing. An analytical expressions for outage probability is derived in the hybrid AF-based relay network. Our numerical results verify our analytical expressions and shows that the proposed system performance of the hybrid protocol in the presence of the direct link outperforms the hybrid protocol without direct link.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128482804","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 : 2019-08-01DOI: 10.1109/ICCChinaW.2019.8849932
Quan Yuan, Zhenyong Wang, Xuanying Zhang, Ci He, Wei Cai
The existing active user detection for uplink grant-free SCMA adopts a detection method of 4G competitive access. The pilot sequence used for the detection are ZC sequences which occupy many resource elements. In the mass machine type communication scenario, the uplink access has the characteristics of sparsity, so the user's activity can be estimated by using compressed sensing. In this paper, a sparse block circulant matrix is used as the pilot matrix (observation matrix). Combined with the OMP algorithm, the active user detection in uplink grant-free SCMA is realized under the condition of unknown active user sparsity. The simulation results show that the active user detection scheme proposed in this paper has comparable performance to the existing detection methods under the premise of reducing pilot overhead.
{"title":"Sparse pilot matrix design for uplink grant-free SCMA system","authors":"Quan Yuan, Zhenyong Wang, Xuanying Zhang, Ci He, Wei Cai","doi":"10.1109/ICCChinaW.2019.8849932","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849932","url":null,"abstract":"The existing active user detection for uplink grant-free SCMA adopts a detection method of 4G competitive access. The pilot sequence used for the detection are ZC sequences which occupy many resource elements. In the mass machine type communication scenario, the uplink access has the characteristics of sparsity, so the user's activity can be estimated by using compressed sensing. In this paper, a sparse block circulant matrix is used as the pilot matrix (observation matrix). Combined with the OMP algorithm, the active user detection in uplink grant-free SCMA is realized under the condition of unknown active user sparsity. The simulation results show that the active user detection scheme proposed in this paper has comparable performance to the existing detection methods under the premise of reducing pilot overhead.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128641923","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}
The Internet of Things is stepping out of its infancy into full maturity, requiring massive data processing and storage. Unfortunately, because of the unique characteristics of resource constraints, short-range communication, and self-organization in IoT, it always resorts to the cloud or fog nodes for outsourced computation and storage, which has brought about a series of novel challenging security and privacy threats. For this reason, one of the critical challenges of having numerous IoT devices is the capacity to manage them and their data. A specific concern is from which devices or Edge clouds to accept join requests or interaction requests. This paper discusses a design concept for developing the IoT data management platform, along with a data management and lineage traceability implementation of the platform based on blockchain and smart contracts, which approaches the two major challenges: how to implement effective data management and enrich rational interoperability for trusted groups of linked Things; And how to settle conflicts between untrusted IoT devices and its requests taking into account security and privacy preserving. Experimental results show that the system scales well with the loss of computing and communication performance maintaining within the acceptable range, works well to effectively defend against unauthorized access and empower data provenance and transparency, which verifies the feasibility and efficiency of the design concept to provide privacy, fine-grained, and integrity data management over the IoT devices by introducing the blockchain-based data management platform.
{"title":"IoT Data Management and Lineage Traceability: A Blockchain-based Solution","authors":"Hongyan Cui, Zunming Chen, Yu Xi, Hao Chen, Jiawang Hao","doi":"10.1109/ICCChinaW.2019.8849969","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2019.8849969","url":null,"abstract":"The Internet of Things is stepping out of its infancy into full maturity, requiring massive data processing and storage. Unfortunately, because of the unique characteristics of resource constraints, short-range communication, and self-organization in IoT, it always resorts to the cloud or fog nodes for outsourced computation and storage, which has brought about a series of novel challenging security and privacy threats. For this reason, one of the critical challenges of having numerous IoT devices is the capacity to manage them and their data. A specific concern is from which devices or Edge clouds to accept join requests or interaction requests. This paper discusses a design concept for developing the IoT data management platform, along with a data management and lineage traceability implementation of the platform based on blockchain and smart contracts, which approaches the two major challenges: how to implement effective data management and enrich rational interoperability for trusted groups of linked Things; And how to settle conflicts between untrusted IoT devices and its requests taking into account security and privacy preserving. Experimental results show that the system scales well with the loss of computing and communication performance maintaining within the acceptable range, works well to effectively defend against unauthorized access and empower data provenance and transparency, which verifies the feasibility and efficiency of the design concept to provide privacy, fine-grained, and integrity data management over the IoT devices by introducing the blockchain-based data management platform.","PeriodicalId":252172,"journal":{"name":"2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129971396","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
扫码关注我们
求助内容：
应助结果提醒方式：