首页 > 最新文献

2019 IEEE 19th International Conference on Communication Technology (ICCT)最新文献

英文 中文
Research on Image Matching in Printing Defects Detection Based on Machine Vision 基于机器视觉的印刷缺陷检测图像匹配研究
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8947055
Yihong Wang
A new similarity algorithm based on image difference and template matching is proposed to solve the problem of real-time matching between the printing image and the template image based on the similarity algorithm in online printing detection. According to this similarity, besides judging whether the printing image matches with the template, whether the printing image is defective or not, it can also judge whether the printing image is offset or deflected relative to the template. If there is a deflection, Hough transform based on mathematical morphology is used to calculate the deflection angle of the printing image relative to the template image, and then the printing image is corrected according to the deflection angle. If there is an offset, the offset of the printing image relative to the template image is calculated according to the principle of phase consistency, and then the printing image is corrected according to the offset. At the end of this paper, the comparative experiments with the similarity-based image matching method are carried out. The experimental results have verified the superiority of the image matching based on the similarity which is proposed in this paper. In addition, the experiments on the offset and deflection of the printing image relative to template image have been respectively carried out. The results verify the feasibility and validity of the proposed method in the paper.
针对在线印刷检测中基于相似度算法的打印图像与模板图像的实时匹配问题,提出了一种基于图像差异和模板匹配的相似度算法。根据这种相似性,除了判断印刷图像是否与模板匹配、印刷图像是否有缺陷外,还可以判断印刷图像相对于模板是否偏移或偏转。如果存在偏转,则采用基于数学形态学的霍夫变换计算印刷图像相对于模板图像的偏转角度,然后根据偏转角度对印刷图像进行校正。如果存在偏移,则根据相位一致性原理计算印刷图像相对于模板图像的偏移量,然后根据偏移量对印刷图像进行校正。最后,与基于相似度的图像匹配方法进行了对比实验。实验结果验证了本文提出的基于相似度的图像匹配方法的优越性。此外,还分别进行了印刷图像相对于模板图像的偏移和偏转实验。结果验证了本文方法的可行性和有效性。
{"title":"Research on Image Matching in Printing Defects Detection Based on Machine Vision","authors":"Yihong Wang","doi":"10.1109/ICCT46805.2019.8947055","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8947055","url":null,"abstract":"A new similarity algorithm based on image difference and template matching is proposed to solve the problem of real-time matching between the printing image and the template image based on the similarity algorithm in online printing detection. According to this similarity, besides judging whether the printing image matches with the template, whether the printing image is defective or not, it can also judge whether the printing image is offset or deflected relative to the template. If there is a deflection, Hough transform based on mathematical morphology is used to calculate the deflection angle of the printing image relative to the template image, and then the printing image is corrected according to the deflection angle. If there is an offset, the offset of the printing image relative to the template image is calculated according to the principle of phase consistency, and then the printing image is corrected according to the offset. At the end of this paper, the comparative experiments with the similarity-based image matching method are carried out. The experimental results have verified the superiority of the image matching based on the similarity which is proposed in this paper. In addition, the experiments on the offset and deflection of the printing image relative to template image have been respectively carried out. The results verify the feasibility and validity of the proposed method in the paper.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131720455","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}
引用次数: 1
A Queueing Framework for Channel Allocation Protocol in Multi-user Multi-channel Cognitive Radio Network 多用户多信道认知无线网络中信道分配协议的排队框架
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8947175
Shi Wang, A. Alfa, B. T. Maharaj, Filip Palunčić
In order to optimize the efficiency of radio resource utilization in the cognitive radio network (CRN), the channel allocation protocol plays a crucial role. However, how to build a general and adaptable framework for the design and evaluation of the protocol, especially in a complex context, such as multiuser multi-channel CRN, is still a open issue. A channel allocation framework based on queueing theory is introduced in this paper. A mechanism with flexible and configurable features, namely distribution probability matrix, is applied to implement and evaluate channel allocation protocols. This framework can provide various comprehensive performance evaluations, such as average queue length, throughput and delay, to carry out protocol evaluation. Moreover, the performance metrics of all the users are obtained independently and simultaneously. Using this framework, a modified maximum rate protocol, namely maximum throughput protocol, is implemented and comprehensive performance evaluation compared to the maximum rate protocol is carried out. The convenience and effectiveness of this channel allocation framework is revealed by the modeling process and numerical results.
为了优化认知无线网络(CRN)中无线电资源的利用效率,信道分配协议起着至关重要的作用。然而,如何建立一个通用的、适应性强的框架来设计和评估协议,特别是在复杂的环境下,如多用户多通道CRN,仍然是一个悬而未决的问题。介绍了一种基于排队理论的信道分配框架。采用一种灵活可配置的机制,即分布概率矩阵来实现和评估信道分配协议。该框架可以提供各种综合性能评估,如平均队列长度、吞吐量和延迟,以进行协议评估。此外,所有用户的性能指标都是独立且同时获得的。在此框架下,实现了一种改进的最大速率协议,即最大吞吐量协议,并与最大速率协议进行了综合性能评价。模拟过程和数值结果表明了该信道分配框架的方便性和有效性。
{"title":"A Queueing Framework for Channel Allocation Protocol in Multi-user Multi-channel Cognitive Radio Network","authors":"Shi Wang, A. Alfa, B. T. Maharaj, Filip Palunčić","doi":"10.1109/ICCT46805.2019.8947175","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8947175","url":null,"abstract":"In order to optimize the efficiency of radio resource utilization in the cognitive radio network (CRN), the channel allocation protocol plays a crucial role. However, how to build a general and adaptable framework for the design and evaluation of the protocol, especially in a complex context, such as multiuser multi-channel CRN, is still a open issue. A channel allocation framework based on queueing theory is introduced in this paper. A mechanism with flexible and configurable features, namely distribution probability matrix, is applied to implement and evaluate channel allocation protocols. This framework can provide various comprehensive performance evaluations, such as average queue length, throughput and delay, to carry out protocol evaluation. Moreover, the performance metrics of all the users are obtained independently and simultaneously. Using this framework, a modified maximum rate protocol, namely maximum throughput protocol, is implemented and comprehensive performance evaluation compared to the maximum rate protocol is carried out. The convenience and effectiveness of this channel allocation framework is revealed by the modeling process and numerical results.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131728521","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}
引用次数: 2
ICCT 2019 Preface
Pub Date : 2019-10-01 DOI: 10.1109/icct46805.2019.8947233
{"title":"ICCT 2019 Preface","authors":"","doi":"10.1109/icct46805.2019.8947233","DOIUrl":"https://doi.org/10.1109/icct46805.2019.8947233","url":null,"abstract":"","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126784339","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}
引用次数: 0
Public Data Integrity Checking for Cloud Storage with Privacy Preserving 具有隐私保护的云存储公共数据完整性检查
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8947275
Hao Yan, Zheng Zhang, Shuo Qiu, Haizhong Qian, Zhiguo Bian, Yanan Liu
Cloud storage service makes people easily to maintain and manage amounts of data with lower cost. In order to ensure the cloud server honestly keeps the client’s data, some remote data integrity checking (RDIC) schemes have been presented. However, in many schemes the original data is not protected at all so that public verifier is able to obtain the data through the integrity checking. To address this issue, we propose an efficient RDIC scheme with data privacy-preserving. In our scheme, we utilize the data masking technique to randomize the original data before generating the final proof which makes the verifier can not get any knowledge about the stored data. Furthermore, experiment result exhibits that our scheme is very efficient and feasible for real applications.
云存储服务使人们能够以较低的成本轻松地维护和管理大量的数据。为了保证云服务器诚实地保存客户端数据,提出了一些远程数据完整性检查(RDIC)方案。然而,在许多方案中,原始数据根本不受保护,因此公共验证者可以通过完整性检查来获取数据。为了解决这个问题,我们提出了一种有效的RDIC方案,并保证了数据的隐私性。在我们的方案中,我们利用数据屏蔽技术在生成最终证明之前对原始数据进行随机化,使得验证者无法获得存储数据的任何信息。实验结果表明,该方案在实际应用中是有效可行的。
{"title":"Public Data Integrity Checking for Cloud Storage with Privacy Preserving","authors":"Hao Yan, Zheng Zhang, Shuo Qiu, Haizhong Qian, Zhiguo Bian, Yanan Liu","doi":"10.1109/ICCT46805.2019.8947275","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8947275","url":null,"abstract":"Cloud storage service makes people easily to maintain and manage amounts of data with lower cost. In order to ensure the cloud server honestly keeps the client’s data, some remote data integrity checking (RDIC) schemes have been presented. However, in many schemes the original data is not protected at all so that public verifier is able to obtain the data through the integrity checking. To address this issue, we propose an efficient RDIC scheme with data privacy-preserving. In our scheme, we utilize the data masking technique to randomize the original data before generating the final proof which makes the verifier can not get any knowledge about the stored data. Furthermore, experiment result exhibits that our scheme is very efficient and feasible for real applications.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122558768","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}
引用次数: 0
Information Coupled Irregular Repetition Slotted ALOHA 信息耦合不规则重复开槽ALOHA
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8946999
Dai Jia, Junli Jia
In this paper, we propose a novel approach to enhance the performance of irregular repetition slotted ALOHA (IRSA) protocol, which is called information coupled IRSA (ICIRSA). If transmission error happens, NACK is feedback and user chooses one of its replicas in the next frame and network coded it with the previous packet. As a result, the information from two independent frames are coupled and can be recovered together. Then, we employ density evolution analysis to evaluate the threshold of channel traffic load. After that, the performance of throughput and error probability are simulated. Simulation results show that the proposed IC-IRSA protocol outperforms conventional IRSA protocol significantly.
本文提出了一种提高不规则重复开槽ALOHA (IRSA)协议性能的新方法,即信息耦合IRSA (ICIRSA)。如果发生传输错误,则反馈NACK,用户在下一帧中选择它的一个副本,网络将其与前一个数据包进行编码。因此,来自两个独立帧的信息是耦合的,可以一起恢复。然后,我们采用密度演化分析来评估信道业务负载的阈值。然后对吞吐量和错误概率的性能进行了仿真。仿真结果表明,所提出的IC-IRSA协议明显优于传统的IRSA协议。
{"title":"Information Coupled Irregular Repetition Slotted ALOHA","authors":"Dai Jia, Junli Jia","doi":"10.1109/ICCT46805.2019.8946999","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8946999","url":null,"abstract":"In this paper, we propose a novel approach to enhance the performance of irregular repetition slotted ALOHA (IRSA) protocol, which is called information coupled IRSA (ICIRSA). If transmission error happens, NACK is feedback and user chooses one of its replicas in the next frame and network coded it with the previous packet. As a result, the information from two independent frames are coupled and can be recovered together. Then, we employ density evolution analysis to evaluate the threshold of channel traffic load. After that, the performance of throughput and error probability are simulated. Simulation results show that the proposed IC-IRSA protocol outperforms conventional IRSA protocol significantly.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116669366","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}
引用次数: 1
Modeling and Security Analysis Method of Quantum Key Distribution Protocol Based on Colored Petri Nets 基于有色Petri网的量子密钥分发协议建模及安全性分析方法
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8947177
Xiaoming Yang, Jian Jiao, Yunmei Shi, Yong Liu
As the core of quantum communication, the security analysis of Quantum Key Distribution (QKD) has always been a hot and difficult issue in the field of quantum communication. Aiming at the complicated and cumbersome problems existing in the current QKD protocol security analysis method, this paper proposes a formal analysis method based on colored Petri nets, and the Petri net model of BB84 protocol and B92 protocol is established by using this method. Man-in-the-middle attack is a common attack mode in quantum communication at present. We also use this method to model and analyze the man-in-the-middle attack. The experimental results show that BB84 and B92 protocols are as vulnerable to man-in-the-middle attack as any classical protocol without authentication.
量子密钥分发(QKD)作为量子通信的核心,安全性分析一直是量子通信领域的热点和难点问题。针对目前QKD协议安全分析方法存在的复杂繁琐的问题,本文提出了一种基于彩色Petri网的形式化分析方法,并利用该方法建立了BB84协议和B92协议的Petri网模型。中间人攻击是目前量子通信中常见的一种攻击方式。我们还使用该方法对中间人攻击进行建模和分析。实验结果表明,BB84和B92协议与任何经典协议一样容易受到中间人攻击。
{"title":"Modeling and Security Analysis Method of Quantum Key Distribution Protocol Based on Colored Petri Nets","authors":"Xiaoming Yang, Jian Jiao, Yunmei Shi, Yong Liu","doi":"10.1109/ICCT46805.2019.8947177","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8947177","url":null,"abstract":"As the core of quantum communication, the security analysis of Quantum Key Distribution (QKD) has always been a hot and difficult issue in the field of quantum communication. Aiming at the complicated and cumbersome problems existing in the current QKD protocol security analysis method, this paper proposes a formal analysis method based on colored Petri nets, and the Petri net model of BB84 protocol and B92 protocol is established by using this method. Man-in-the-middle attack is a common attack mode in quantum communication at present. We also use this method to model and analyze the man-in-the-middle attack. The experimental results show that BB84 and B92 protocols are as vulnerable to man-in-the-middle attack as any classical protocol without authentication.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123830372","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}
引用次数: 2
Massive Connection Aware Effective Rate Optimization in NOMA Based Small Cell Networks 基于NOMA的小蜂窝网络大规模连接感知效率优化
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8947194
Min Hui, Jian Chen, Long Yang
NOMA based small cell network is a promising framework to support massive connection and high throughput. In this paper, massive connection requirement is taken into account in a downlink NOMA based small cell network, where the locations of small cell base stations and UEs are modeled by stochastic geometry. To evaluate the performance of the network, we adopt effective rate as a novel metric for overhead as well as validation reasons. In addition, an effective rate maximization problem by jointly optimize power allocation (PA) and QoS requirements is formulated. We propose to decouple the original problem into power allocation random initialization subproblem and effective rate enhancement subproblem, in order to develop a suboptimal resource allocation algorithm. Finally, the effectiveness and convergence of the proposed algorithm are confirmed by numerical results. We show that: 1) optimal solutions prefer to assign higher target SINR requirements to some UEs with worse channel condition from a perspective of whole UE cluster; 2) the random PA initialization has significant effect on the performance of the algorithm.
基于NOMA的小蜂窝网络是一种很有前途的支持大连接和高吞吐量的网络框架。本文考虑了基于下行NOMA的小蜂窝网络的海量连接需求,采用随机几何模型对小蜂窝基站和终端的位置进行建模。为了评估网络的性能,我们采用有效率作为开销和验证原因的新度量。此外,还提出了通过共同优化功率分配(PA)和QoS要求来实现有效速率最大化的问题。我们提出将原问题解耦为功率分配随机初始化子问题和效率增强子问题,以开发次优资源分配算法。最后,通过数值结果验证了该算法的有效性和收敛性。研究表明:1)从整个终端集群的角度来看,最优解倾向于为信道条件较差的终端分配更高的目标信噪比要求;2)随机PA初始化对算法性能有显著影响。
{"title":"Massive Connection Aware Effective Rate Optimization in NOMA Based Small Cell Networks","authors":"Min Hui, Jian Chen, Long Yang","doi":"10.1109/ICCT46805.2019.8947194","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8947194","url":null,"abstract":"NOMA based small cell network is a promising framework to support massive connection and high throughput. In this paper, massive connection requirement is taken into account in a downlink NOMA based small cell network, where the locations of small cell base stations and UEs are modeled by stochastic geometry. To evaluate the performance of the network, we adopt effective rate as a novel metric for overhead as well as validation reasons. In addition, an effective rate maximization problem by jointly optimize power allocation (PA) and QoS requirements is formulated. We propose to decouple the original problem into power allocation random initialization subproblem and effective rate enhancement subproblem, in order to develop a suboptimal resource allocation algorithm. Finally, the effectiveness and convergence of the proposed algorithm are confirmed by numerical results. We show that: 1) optimal solutions prefer to assign higher target SINR requirements to some UEs with worse channel condition from a perspective of whole UE cluster; 2) the random PA initialization has significant effect on the performance of the algorithm.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122441997","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}
引用次数: 0
Novel ACE Scheme for PAPR Reduction of High Broadband OFDM Systems 一种降低高宽带OFDM系统PAPR的ACE新方案
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8947241
Yuzhuo Liu, Yong Wang
The high broadband Orthogonal Frequency Division Multiplexing (OFDM) system is characterized by high-order constellation and a large of sub-carriers. In order to overcome the major drawback of high Peak-to-Average Power Ratio (PAPR) of OFDM signal, traditional Active Constellation Extension (ACE) techniques maybe pay more price, such as increasing the iteration numbers, thus, costing the more system resources. To address this challenge, a novel Pre-distortion ACE (PD-ACE) scheme is proposed in this paper. By defining a special expandable region for internal constellation and extending the original constellation points, PD-ACE can significantly reduce the PAPR level with only one iteration, thereby, not only increasing the convergence speed, but also decreasing the complexity of system implementation. Simulation results show that, at the expense of acceptable BER performance, the proposed scheme exhibits a better performance for PAPR reduction with low computation complexity compared with traditional methods.
高宽带正交频分复用(OFDM)系统具有高阶星座和大量子载波的特点。传统的主动星座扩展(ACE)技术为了克服OFDM信号峰值平均功率比(PAPR)高的主要缺点,可能要付出更多的代价,如增加迭代次数,从而消耗更多的系统资源。为了解决这一问题,本文提出了一种新的预失真ACE (PD-ACE)方案。PD-ACE通过为内部星座定义一个特殊的可扩展区域,对原有星座点进行扩展,只需一次迭代即可显著降低PAPR水平,从而提高了收敛速度,降低了系统实现的复杂性。仿真结果表明,在降低误码率的前提下,与传统方法相比,该方案具有较低的计算复杂度和较好的PAPR降低性能。
{"title":"Novel ACE Scheme for PAPR Reduction of High Broadband OFDM Systems","authors":"Yuzhuo Liu, Yong Wang","doi":"10.1109/ICCT46805.2019.8947241","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8947241","url":null,"abstract":"The high broadband Orthogonal Frequency Division Multiplexing (OFDM) system is characterized by high-order constellation and a large of sub-carriers. In order to overcome the major drawback of high Peak-to-Average Power Ratio (PAPR) of OFDM signal, traditional Active Constellation Extension (ACE) techniques maybe pay more price, such as increasing the iteration numbers, thus, costing the more system resources. To address this challenge, a novel Pre-distortion ACE (PD-ACE) scheme is proposed in this paper. By defining a special expandable region for internal constellation and extending the original constellation points, PD-ACE can significantly reduce the PAPR level with only one iteration, thereby, not only increasing the convergence speed, but also decreasing the complexity of system implementation. Simulation results show that, at the expense of acceptable BER performance, the proposed scheme exhibits a better performance for PAPR reduction with low computation complexity compared with traditional methods.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131181824","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}
引用次数: 1
Miniaturization Design of Normal-Mode Helical Antenna Based on Capacitive Loading 基于容性负载的正模螺旋天线小型化设计
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8947283
Liangxian Zhang, Fumin Lin
This paper discusses the design of an electrically small normal-mode helical antenna (NMHA) with a capacitive loading and an innovative coupling feed structure. With this structure, the height of the helical antenna can be effectively reduced (0.064λ totally) while ensuring the mode of the antenna and high realized gain (2.02dBi). The electromagnetic analysis of a compact electrically small normal-mode helical antenna are presented. To understand the working mechanism, an equivalent circuit model of the helical antenna is proposed and analyzed. This innovative structure makes the antenna compact enough to be widely used in short-range communication devices. The simulated results of the antenna show that the proposed structure has a pretty high radiation efficiency, good impedance matching and high gain.
本文讨论了一种具有电容加载和创新耦合馈电结构的小尺寸正模螺旋天线的设计。采用这种结构,可以有效降低螺旋天线的高度(共0.064λ),同时保证天线的模式和高实现增益(2.02dBi)。介绍了一种小型电小正模螺旋天线的电磁特性分析。为了理解螺旋天线的工作原理,提出了螺旋天线的等效电路模型并进行了分析。这种创新的结构使天线足够紧凑,可以广泛应用于短程通信设备。仿真结果表明,该天线结构具有较高的辐射效率、良好的阻抗匹配和较高的增益。
{"title":"Miniaturization Design of Normal-Mode Helical Antenna Based on Capacitive Loading","authors":"Liangxian Zhang, Fumin Lin","doi":"10.1109/ICCT46805.2019.8947283","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8947283","url":null,"abstract":"This paper discusses the design of an electrically small normal-mode helical antenna (NMHA) with a capacitive loading and an innovative coupling feed structure. With this structure, the height of the helical antenna can be effectively reduced (0.064λ totally) while ensuring the mode of the antenna and high realized gain (2.02dBi). The electromagnetic analysis of a compact electrically small normal-mode helical antenna are presented. To understand the working mechanism, an equivalent circuit model of the helical antenna is proposed and analyzed. This innovative structure makes the antenna compact enough to be widely used in short-range communication devices. The simulated results of the antenna show that the proposed structure has a pretty high radiation efficiency, good impedance matching and high gain.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128028562","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}
引用次数: 0
Intelligent Selection: A Neural Network-Based MAC Protocol-Selection Mechanism for Wireless Ad hoc Networks 智能选择:一种基于神经网络的无线自组网MAC协议选择机制
Pub Date : 2019-10-01 DOI: 10.1109/ICCT46805.2019.8947101
Kecan Kou, L. Lei, Lijuan Zhang, Shengsuo Cai, Gaoqing Shen
In wireless ad hoc networks, a suitable MAC protocol can provide better QoS (Quality of Service) guarantees. However, in modern warfare environment, the combat missions change rapidly. A fixed MAC protocol may be not suitable for the highly changeable environments and combat missions. To solve this problem, we propose a neural network-based MAC protocol-selection mechanism to select the optimal MAC protocol for new missions based on the real-time environment information of the battlefield, i.e., the intelligent selection (IS) algorithm. In IS, we prepare the empirical data set with massive mission data, and construct the learning model through making use of the neural network. Experimental results demonstrate that the prediction accuracy of the proposed IS algorithm is over 0.93.
在无线自组织网络中,合适的MAC协议可以提供更好的服务质量保证。然而,在现代战争环境下,作战任务变化迅速。固定的MAC协议可能不适合高度多变的环境和作战任务。针对这一问题,提出了一种基于神经网络的MAC协议选择机制,根据战场实时环境信息为新任务选择最优的MAC协议,即智能选择(IS)算法。在IS中,我们利用海量任务数据准备经验数据集,并利用神经网络构建学习模型。实验结果表明,该算法的预测精度在0.93以上。
{"title":"Intelligent Selection: A Neural Network-Based MAC Protocol-Selection Mechanism for Wireless Ad hoc Networks","authors":"Kecan Kou, L. Lei, Lijuan Zhang, Shengsuo Cai, Gaoqing Shen","doi":"10.1109/ICCT46805.2019.8947101","DOIUrl":"https://doi.org/10.1109/ICCT46805.2019.8947101","url":null,"abstract":"In wireless ad hoc networks, a suitable MAC protocol can provide better QoS (Quality of Service) guarantees. However, in modern warfare environment, the combat missions change rapidly. A fixed MAC protocol may be not suitable for the highly changeable environments and combat missions. To solve this problem, we propose a neural network-based MAC protocol-selection mechanism to select the optimal MAC protocol for new missions based on the real-time environment information of the battlefield, i.e., the intelligent selection (IS) algorithm. In IS, we prepare the empirical data set with massive mission data, and construct the learning model through making use of the neural network. Experimental results demonstrate that the prediction accuracy of the proposed IS algorithm is over 0.93.","PeriodicalId":306112,"journal":{"name":"2019 IEEE 19th International Conference on Communication Technology (ICCT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134233028","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}
引用次数: 2
期刊
2019 IEEE 19th International Conference on Communication Technology (ICCT)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1