{"title":"A Generative Adversarial Network Based Framework for Specific Emitter Characterization and Identification","authors":"Jialiang Gong, Xiaodong Xu, Yufeng Qin, Weijie Dong","doi":"10.1109/WCSP.2019.8927888","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927888","url":null,"abstract":"Specific emitter identification (SEI) enables the classification of various unique emitters based on received waveforms using some external feature measurements from their transmit signals and has shown its potential for military and civil applications. However, the characterization of the received waveform is susceptible to various factors in propagation process, resulting in inaccurate representations for the individual emitters, so the discriminative performances of existing methods are usually challenging. To remedy these shortcomings, this paper presents a novel semi-supervised SEI using generative adversarial networks (GAN). We mitigated a representation deep network into Triple-GAN and construct a quadruple-structured framework. The overall feature information hidden in the original signals can be extracted by representation network to improve identification performance while the classification results of Triple-GAN can in turn help the representer learning more discriminative characteristics of individual emitters. Results from both simulations and real world data experiments are provided. Numerical performances indicate our conclusion that our proposed framework constantly outperforms other existing schemes in terms of classification accuracy.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","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":"128963686","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}
Yuanxin Sun, Ruoxin Kuai, Jianquan Wang, Wanbin Tang, Xiaoping Li
{"title":"VIMAC: A Vehicular Information Medium Access Control Protocol for High Reliable and Low Latency Transmissions in VANET","authors":"Yuanxin Sun, Ruoxin Kuai, Jianquan Wang, Wanbin Tang, Xiaoping Li","doi":"10.1109/WCSP.2019.8927945","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927945","url":null,"abstract":"Time division multiple access (TDMA)-based vehicular ad hoc networks (VANETs) can enhance road safety level through providing safety related applications which pose stringent latency and reliable requirements. In this paper, we propose a novel TDMA-based medium access control (MAC) protocol which is able to attain high reliable and low latency transmissions. Our proposed scheme contains two processes, prediction and allocation. The former process, prediction, can be used to mitigate a portion of collisions before their occurrences. There still exists unpredictable collisions due to the vehicular placement. In the case of prediction process being unavailable, the allocation process is able to reduce a portion of the unavoidable collisions with the help of upper layer information. We build a system level simulation platform that merges SUMO and MATLAB to compare the proposed scheme and baseline protocols. The simulation results show that our scheme can optimize the reliable performance for safety related applications. Besides, a lower collision probability leads to fewer retransmissions before each successful transmission, therefore, our proposed scheme can provide low latency performance as is shown by the analysis and simulations.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"203 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":"124548629","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}
{"title":"APRNET: Achieving Privacy-Preserving Real-Name Authentication over Blockchain for Online Services","authors":"Ye Xu, Bin Cao, Rongxing Lu, Qinyu Zhang","doi":"10.1109/WCSP.2019.8928072","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8928072","url":null,"abstract":"With the proliferation of mobile Internet applications, online services become a double-edge sword to our daily life, wherein security and privacy are notable. To ensure data security, service providers may require users to register using real-name data. Thus, verifying the real-name information without privacy leakage is critical. In this paper, we propose a privacy-preserving real-name authentication scheme based on a classic blockchain paradigm, named APRNET. By taking advantages of cloud-enabled trusted authorities and bilinear pairing, APRNET verifies users' data in an encrypted form, which guarantees data security and user privacy. Detailed security and performance analysis validate the effectiveness of APRNET.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"46 2 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":"124666177","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}
{"title":"Repair Bandwidth Cost of Generalized Regenerating Codes for Clustered Distributed Storage","authors":"Ke Li, Shushi Gu, Ye Wang, Qinyu Zhang, W. Xiang","doi":"10.1109/WCSP.2019.8928064","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8928064","url":null,"abstract":"When repairing storage nodes in a clustered distributed storage system (CDSS), it is crucial to distinguish the intra-cluster and inter-cluster bandwidth costs differing sharply. From this perspective, Generalized Regenerating Codes (GRCs) involving two-layer repair processes was proposed previous and proved as reaching a better trade-off between storage overhead and inter-cluster repair bandwidth. However, due to the lack of explicit expression about the GRCs' parameters for any point on the trade-off curve, it is difficult to determine the optimal GRCs' parameter configuration for reducing the total repair bandwidth cost in a practical CDSS. To address this issue, we devise a novel transmission cost model of CDSS, and initially propose two essential concepts - Cost Coefficient (CC) and Global Repair Bandwidth Cost (GRBC) to denote the unit and total transmission costs of repair bandwidths, respectively. Moreover, we parameterize the two extreme points on the optimal storage overhead versus repair bandwidth trade-off curve, termed Minimum Storage Generalized Regenerating Codes (MS-GRCs) and Minimum Inter-cluster Bandwidth Generalized Regenerating Codes (MB-GRCs), and theoretically analyze the relationships between their GRBCs and the number of local helper nodes £ (the helper nodes in the cluster with failure node). Our mathematical results provide a guidance for employing GRCs to achieve the more efficient node repairing method in CDSS.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"20 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":"126794197","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}
{"title":"An IEEE 802.15.6-Based MAC Frame Aggregation Approach for Wireless Body Area Networks","authors":"Xiaoming Yuan, Ziyu Ma, Wenjing Li, Haiyang Wang, Changle Li, Kuan Zhang","doi":"10.1109/WCSP.2019.8928075","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8928075","url":null,"abstract":"Wireless Body Area Networks (WBANs)support low delay and low energy consumption data transmissions for real-time health monitoring. There is a variety of traffic types with different frame lengths in WBANs. However, transmitting short frames brings more overhead such as control frames, which decreases network throughput and transmission efficiency, also increases energy consumption. In this paper, we propose a Medium Access Control (MAC)Frame Aggregation Approach (FAA)based on IEEE 802.15.6 to guarantee Quality of Service (QoS)provision. The proposed FAA MAC protocol classifies different traffic data with similar QoS requirements into one data queue. Then, the FAA aggregates several small MAC Protocol Data Units (MPDU)into one Physical Layer Service Data Unit (PSDU)in each queue in the light of the maximum tolerance delay of different services and the current survival time of different types of traffic data. We also design an aggregation algorithm to perform the aggregation procedure. The simulation results conducted on the Castalia show that our proposed FAA highly improves the network throughput and decreases the average packet delay compared with IEEE 802.15.6.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"82 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":"126823514","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}
{"title":"Trajectory and Beamforming Vector Optimization for Multi-UAV Multicast Network","authors":"Chen Feng, Chao Zhang, Xinmin Luo","doi":"10.1109/WCSP.2019.8927982","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927982","url":null,"abstract":"In this paper, we consider a multiple unmanned aerial vehicles (UAVs)-enabled multicast network, where each UAV is employed to send common messages to its corresponding group users via beamforming technology. Due to the simultaneous information transmission, the users may also receive the interference signals from other UAVs. The objective of this paper is to maximize the sum time-averaged multicast rate by jointly optimizing multiple UAV trajectories and beamforming vectors. The optimization problem is non-convex and too complicated to be solved directly. In light of this, an iteration algorithm is applied, which alternately optimizes variables to decompose the coupling problem. Finally, the optimized UAV trajectory compared with the pre-defined circular trajectory is presented. Numerical results imply that the proposed optimization algorithm gains larger sum-multicast rate than the circular trajectory scheme and static scheme.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"6 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":"116312848","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}
Yifan Zhou, Huilin Zhou, Fuhui Zhou, Shuai Ma, R. Hu
{"title":"Artificial-Noise Aided Precoding Design for MIMO Integrated Radar and Communication Systems","authors":"Yifan Zhou, Huilin Zhou, Fuhui Zhou, Shuai Ma, R. Hu","doi":"10.1109/WCSP.2019.8927951","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927951","url":null,"abstract":"Integrated radar and communication (IRC) systems are promising in the next generation wireless communication networks. However, to realize high level security of information transmission in IRC systems is challenging due to the large transmission power and the open unguided nature of the wireless channels. In this paper, the secure precoding and artificial noise (AN) techniques are investigated to improve the secrecy rate of a multiple-input multiple-output IRC system with multiple eavesdroppers. The formulated secrecy rate maximization problem is non-convex due to the logarithmic of the determinant that exists in the objective function. Instead of using Taylor series approximation of the non-convex elements, we propose to linearize two log-det terms to tackle this challenging problem. After linearization, an alternating optimization algorithm is proposed to solve the primitive problem. Moreover, a first-order approximation is employed to handle the quadratic constraint on radar detection performance. The suboptimal secure precoding and AN scheme can be obtained for maximizing the information security transmission rate of the legitimate receiver while ensuring the performance of radar detection. Simulation results are presented to validate the performance of our proposed design.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"105 26","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113946025","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}
{"title":"Joint Access Control and Resource Allocation for mMTC based on Tagged Preamble","authors":"Zhuang Li, Yichen Wang, Tao Wang, Zhangnan Wang","doi":"10.1109/WCSP.2019.8927925","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927925","url":null,"abstract":"In this paper, we investigate the access control and resource allocation for mMTC based on tagged preamble (PA). Through two detection of tagged PA at base station, MTC device can be further distinguished in RA process. Then, optimization problem concerning joint access class barring parameter and tag number for each area is formulated, which aims as maximizing the throughput of the cell. To solve this optimization problem, we decompose the original problem and deal with it in two steps, first we can obtain a closed expression of the optimal ACB parameters for each area. In the second step, we propose a “class waterfilling” algorithm to optimize the number of tags in each area. Simulation results show that dynamic tag allocation and ACB factor adjustment can increase the access success probability of the random access process and reduce the average access delay.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"40 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114011609","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}
{"title":"Implementation for UAVs Aided Edge Sensing System in Wireless Emergency Communications","authors":"Pengju Xiao, Li Wang, Jianbin Chuan, Xuefu Wang, Jian Kuang, Aiguo Fei","doi":"10.1109/WCSP.2019.8927886","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927886","url":null,"abstract":"Disaster environmental data sensing plays an important role in ensuring the timeliness of emergency rescue. Combining mobile edge caching and mobile edge computing (MEC)function, this paper proposes an unmanned aerial vehicles (UAVs)aided edge sensing system (UESS)in wireless emergency communications, where UAVs with flexibility and mobility work as edge servers for flexible data sensing. This system is developed and implemented involving the UESS server in the cloud, the Message Queuing Telemetry Transport (MQTT)server, and the UAV servers at the edge. Besides, this system implements rapid network deployment of UAVs with three protocols of IEEE 802.11. In the case of natural disasters even when the communication infrastructures are damaged in whole or in part, the proposed UESS can be rapidly deployed to provide network access and expand the coverage of the network. Moreover, this system can also accurately sense disaster scenarios' information data, such as video data and sensor data, as well as the capability data of UAVs in terms of computation, caching, and energy resources. The experimental results show that the UESS system not only can reduce the size of transmission data uploaded to the UESS server, but also can achieve the low transmission latency between UAVs at the edge.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"237 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":"124294252","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}
{"title":"Network Calculus-based Modeling of Time Sensitive Networking Shapers for Industrial Automation Networks","authors":"Xiaoyun Liu, Chi Xu, Haibin Yu","doi":"10.1109/WCSP.2019.8927901","DOIUrl":"https://doi.org/10.1109/WCSP.2019.8927901","url":null,"abstract":"With the interconnection of distributed devices from different industrial automation networks, heterogeneous traffics with different Quality of Service (QoS) requirements increase dramatically. Shapers in Time-Sensitive Networking (TSN) enable the coexistence of different industrial traffics within a single network infrastructure. In this paper, with full consideration of the time-criticality of different industrial traffics and shaping mechanisms, we propose a network calculus-based modeling scheme for the widely-used Credit Based Shaper (CBS) and Time Aware Shaper (TAS). Then, we analyze the QoS of industrial traffics with different real-time characteristics by CBS and TAS, respectively. To evaluate the accuracy of network calculus-based modeling scheme, we compare our theoretical analysis with simulations, wherein a compactness function is defined to describe QoS compactness. Simulation results verify the effectiveness of proposed modeling scheme, by which we further validate both CBS and TAS can satisfy the QoS of traffics for different industrial automation scenarios.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"121 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":"128037678","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}