Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks最新文献

筛选
英文 中文
Spectrum Allocation and Power Control in OFDM Systems for Cognitive Radio Networks 认知无线网络OFDM系统的频谱分配与功率控制
Xingcai Zhang, Nan Chen, Nan Zhao, Y. Luo, Wentao Kan, Shuo Yang
{"title":"Spectrum Allocation and Power Control in OFDM Systems for Cognitive Radio Networks","authors":"Xingcai Zhang, Nan Chen, Nan Zhao, Y. Luo, Wentao Kan, Shuo Yang","doi":"10.1145/3514105.3514115","DOIUrl":"https://doi.org/10.1145/3514105.3514115","url":null,"abstract":"With the dramatic development of communication technology, wireless network-based applications become more and more popular. Accordingly, how to allocate scarce wireless resource becomes an urgent problem. In order to fully utilize spectrum resource and improve the fairness of allocation, a novel resource allocation scheme is investigated in OFDM Systems for cognitive radio networks (CRNs) in this paper, where cognitive small cell base stations (SBSs) are capable of communicating with multiple secondary users (SUs) via the multiple OFDM subcarriers of primary users (PUs). First, we establish the adaptive resource allocation model, and then, a joint problem of spectrum allocation and power control is formulated with the aim of maximizing the total throughput of SUs while taking the fairness issue into consideration. Finally, we introduce a modified genetic algorithm (GA)—Ploy-chromosome hybrid coding genetic algorithm with elite preserving strategy (EPGA). The analysis and simulation results show that EPGA converges rapidly and enhances the fairness requirements of SUs.","PeriodicalId":360718,"journal":{"name":"Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132086484","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
Research on Optimal and Experimental Process Parameters for an Ultrasonic Wire Bonding System 超声焊线系统工艺参数优化及实验研究
Wuwei Feng, Yuzhou Shi, Xin Chen, Cuizhu Wang, Jiang Meng, Di Wang
{"title":"Research on Optimal and Experimental Process Parameters for an Ultrasonic Wire Bonding System","authors":"Wuwei Feng, Yuzhou Shi, Xin Chen, Cuizhu Wang, Jiang Meng, Di Wang","doi":"10.1145/3514105.3514125","DOIUrl":"https://doi.org/10.1145/3514105.3514125","url":null,"abstract":"Abstract: During the ultrasonic wire bonding process, there are many process parameters such as bonding time, bonding power, bonding force and bonding temperature, can affect the bonding quality. Any inappropriate bonding parameter settings can result in a failure of the whole bonding process. A new method for bonding process parameter optimization is studied in this paper. First, an orthogonal experimental table is built and the bond strength can be considered as the bonding quality standard. Through the table, the bonding process parameters are established. Second, a refined analysis is conducted to obtain the best parameter settings. Finally, a large number of experimental samples are used for verification and the good experiments show the usefulness of the optimal method. At the same time, we also identify the bonding process parameters by ultrasonic electrical signals to ensure the efficient bonding quality. Additionally, this method can be used for different types bonding equipment with only a few changes to the method.","PeriodicalId":360718,"journal":{"name":"Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126760432","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
Adaptive Bitwise Division-based Searching Algorithm for Batch Verification 批量验证的自适应按位除法搜索算法
Ge-Jing Xu, Shiyu Jin, Kaicheng Tang, Yimin Zhou
{"title":"Adaptive Bitwise Division-based Searching Algorithm for Batch Verification","authors":"Ge-Jing Xu, Shiyu Jin, Kaicheng Tang, Yimin Zhou","doi":"10.1145/3514105.3514113","DOIUrl":"https://doi.org/10.1145/3514105.3514113","url":null,"abstract":"With the development of multicore processor, parallel computation is adopted to accelerate computation for higher efficiency. In signature verification process, batch verification has a high efficiency due to its aggregate operation. However, when there exists a invalid signature, the verification turns out failure, which is time-consuming. This paper proposes an adaptive bitwise division-based searching (ABDS) algorithm to provide a solution to the challenge. When there is only one invalid signature, the time complexity of ABDS algorithm is O(n) = 2 in parallel computation, while that of binary search (BS) algorithm is 1 + log 2n. Compared with BS algorithm, ABDS algorithm has a significant advantage in parallel computation when there are a small number of invalid signatures. The work can be used in searching problem where verification time greatly exceeds aggregation time.","PeriodicalId":360718,"journal":{"name":"Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks","volume":"507 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133089937","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
A Dynamic Identification Method of Metamorphic Relation Based on Separation of Input Pattern and Output Pattern 基于输入模式和输出模式分离的变质关系动态识别方法
Fan Wang, Xiaohua Yang, Meng Li, Jie Liu, Shiyu Yan, Shengfu Fu
{"title":"A Dynamic Identification Method of Metamorphic Relation Based on Separation of Input Pattern and Output Pattern","authors":"Fan Wang, Xiaohua Yang, Meng Li, Jie Liu, Shiyu Yan, Shengfu Fu","doi":"10.1145/3514105.3514109","DOIUrl":"https://doi.org/10.1145/3514105.3514109","url":null,"abstract":"Due to the high cost and extended period of the benchmark development, there are few verification examples for verifying nuclear power independence software. This case is named the test oracle problem. As a result, it is a challenge to adequate verification. Because metamorphic testing is no need to construct verification examples, it is critical to alleviating the above problem. Some domestic independent nuclear design software has successfully applied metamorphic testing in the verification activities. Since Oracle problem has become a common challenge in software verification in nuclear power field, metamorphic testing has broad application prospects. Aiming at great arbitrariness and low efficiency of existing methods, we introduce a dynamic identification method based on the separation of input and output patterns. In this paper, this method is applied to the burnup program (namely NUIT) to determine a set of metamorphic relations between burnup depth and nuclide density. Other burnup programs can directly apply them and learn from this example. And this method can be extended and used in the different professional nuclear fields, such as reactor physics, thermal hydraulics, source term, and radiation shielding.","PeriodicalId":360718,"journal":{"name":"Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116336137","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
Few-shot Learning via Non-negative Representation 基于非负表征的少镜头学习
Shengxiang Zhang, Nan Chen, Nan Zhao
{"title":"Few-shot Learning via Non-negative Representation","authors":"Shengxiang Zhang, Nan Chen, Nan Zhao","doi":"10.1145/3514105.3514106","DOIUrl":"https://doi.org/10.1145/3514105.3514106","url":null,"abstract":"Due to the uncertainty caused by using a small number of labeled samples, few-shot classification is a challenging problem. In the past few years, many methods have been proposed to solve few-shot classification, among which the method based on transduction has been proved to be the best. According to this idea, in this paper, we propose a new transduction-based method, which is based on the nonnegative representation. In order to obtain the classification results, we minimize the objective function with two items: (1) The first item assigns representation coefficients for each class prototype to obtain the minimum reconstruction error; (2) The second item encourages similar query samples to have consistent label allocation. At the same time, we make non-negative constraints on the representation coefficient to make the representation sparse and discriminative. Using standardized visual benchmarks, we prove that the proposed method can achieve high accuracy in various data sets, inductive and transductive settings, and is robust to the situation that the number of unlabeled samples per class is unbalanced.","PeriodicalId":360718,"journal":{"name":"Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125251001","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
Enhanced Channel-Grouping Based Rendezvous Algorithm for Cognitive Radio Ad Hoc Networks 基于增强信道分组的认知无线电自组织网络交会算法
Yuhao Li, Lei Zhao, Ce Shi, Wenbin Guo
{"title":"Enhanced Channel-Grouping Based Rendezvous Algorithm for Cognitive Radio Ad Hoc Networks","authors":"Yuhao Li, Lei Zhao, Ce Shi, Wenbin Guo","doi":"10.1145/3514105.3514117","DOIUrl":"https://doi.org/10.1145/3514105.3514117","url":null,"abstract":"Rendezvous is a fundamental building block in Cognitive Radio Ad Hoc Networks (CRAHNs), in which pairs or groups of users must find a common available channel. In earlier researches, schemes based on common control channel (CCC) are widely used to achieve rendezvous, with the problems of control channel saturation, vulnerability to jamming attacks, and unsuitability for dynamic network scenarios. Therefore, the blind rendezvous based on Channel-Hopping (CH) sequences, which requires neither CCC nor the information of the target users’ available channels, has recently attracted a lot of research interests. As a contribution to this research area, Enhanced Channel-Grouping Based (ECGB) rendezvous algorithm is proposed for decentralized rendezvous. The ECGB algorithm has the following characteristics: 1) supporting both symmetric and asymmetric models; 2) full degree of rendezvous, i.e., any pair of cognitive users can rendezvous on any available channel; 3) guaranteeing rendezvous, with the upper bound of the maximum number of rendezvous slots under the asymmetric model, which is the quadratic function of the number of all channels; 4) requiring no time-synchronization. The upper bound of maximum TTR (MTTR) for the ECGB algorithm is derived by a theoretical analysis. Moreover, simulations confirm the theoretical derivation results of MTTR and show that the algorithm has a relatively short expected TTR (ETTR).","PeriodicalId":360718,"journal":{"name":"Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127173630","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
Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks 2022年第9届无线通信与传感器网络国际会议论文集
{"title":"Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks","authors":"","doi":"10.1145/3514105","DOIUrl":"https://doi.org/10.1145/3514105","url":null,"abstract":"","PeriodicalId":360718,"journal":{"name":"Proceedings of the 2022 9th International Conference on Wireless Communication and Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115784623","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信