首页 > 最新文献

2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)最新文献

英文 中文
Raptor Code based on punctured LDPC for Secrecy in Massive MiMo 基于穿刺LDPC的大规模MiMo保密Raptor代码
Djedjiga Benzid, M. Kadoch, M. Cheriet
In the future Fifth-Generation networks, the eavesdropping is a critical threat due to their broadcast-based transmission. This problem can be addressed with the cryptographic protocols. However, this method is complex and difficult because of the dynamic topology of wireless networks, which does not allow an efficient management of security keys. As a complement solution, Physical-layer security (PLS) is integrated to enhance secrecy in wireless networks. The PLS exploits the schemes features of this layer, namely the modulation, Massive Multi-Input Multi-Output(m-MiMo) and channel coding. The fountain code is one of those systems where the secrecy is provided when the destination retrieves packets encoded before the intruder. Nevertheless, the secrecy can not be guaranteed when eavesdropper uses large number of the antennas as in the m-MiMo. The feature of m-MiMo should be considered to secure main channel with fountain codes. Therefore, we propose to use Raptor code which is a class of fountain code, aided by an Artificial noise (AN) and the punctuated data to reduce the efficient of intruder channel. This allows the main channel to retrieve the signal before eavesdropper. The numerical results show that using Raptor code in massive MiMo enhances the reliability and the security on the channel of legitimate user, while minimizes the abilities of intruders to spy on data.
在未来的第五代网络中,由于其基于广播传输,窃听是一个严重的威胁。这个问题可以通过加密协议来解决。然而,由于无线网络的动态拓扑结构,这种方法复杂而困难,不能有效地管理安全密钥。作为一种补充解决方案,集成了物理层安全(PLS)来增强无线网络的保密性。PLS利用了这一层的特点,即调制、大规模多输入多输出(m-MiMo)和信道编码。喷泉码是这样一种系统,当目的地检索在入侵者之前编码的数据包时,就提供了保密性。然而,在m-MiMo中,当窃听者使用大量天线时,其保密性无法得到保证。应该考虑m-MiMo的特性,用喷泉码保护主通道。因此,我们提出使用Raptor码作为喷泉码的一种,在人工噪声(an)和标点数据的辅助下降低入侵信道的效率。这允许主信道在窃听者之前检索信号。数值计算结果表明,在大规模MiMo中使用Raptor代码提高了合法用户信道的可靠性和安全性,同时最大限度地降低了入侵者窥探数据的能力。
{"title":"Raptor Code based on punctured LDPC for Secrecy in Massive MiMo","authors":"Djedjiga Benzid, M. Kadoch, M. Cheriet","doi":"10.1109/IWCMC.2019.8766490","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766490","url":null,"abstract":"In the future Fifth-Generation networks, the eavesdropping is a critical threat due to their broadcast-based transmission. This problem can be addressed with the cryptographic protocols. However, this method is complex and difficult because of the dynamic topology of wireless networks, which does not allow an efficient management of security keys. As a complement solution, Physical-layer security (PLS) is integrated to enhance secrecy in wireless networks. The PLS exploits the schemes features of this layer, namely the modulation, Massive Multi-Input Multi-Output(m-MiMo) and channel coding. The fountain code is one of those systems where the secrecy is provided when the destination retrieves packets encoded before the intruder. Nevertheless, the secrecy can not be guaranteed when eavesdropper uses large number of the antennas as in the m-MiMo. The feature of m-MiMo should be considered to secure main channel with fountain codes. Therefore, we propose to use Raptor code which is a class of fountain code, aided by an Artificial noise (AN) and the punctuated data to reduce the efficient of intruder channel. This allows the main channel to retrieve the signal before eavesdropper. The numerical results show that using Raptor code in massive MiMo enhances the reliability and the security on the channel of legitimate user, while minimizes the abilities of intruders to spy on data.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128663328","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}
引用次数: 6
Upper Bound Performance of Uplink Class A LoRa Networks 上行类A LoRa网络性能上限
J. Pacheco, António Furtado, Rodolfo Oliveira
Recently, Low Power Wide Area Networks (LPWANs) have attracted a great interest due to the need of connecting more and more devices to the so-called Internet of Things (IoT). LoRa networks are LPWANs that allow a long-range radio connection of multiple devices operating in non-licensed bands. In this work, we characterize the performance of LoRa’s Uplink communications where both physical layer (PHY) and medium access control (MAC) are taken into account. By admitting a uniform spatial distribution of the devices, we characterize the performance of the PHY-layer through the probability of successful decoding multiple frames that were transmitted with the same spreading factor and at the same time. The MAC performance is evaluated by admitting that the inter-arrival time of the frames generated by each LoRa device is exponentially distributed. A typical LoRaWAN operating scenario is considered, where the transmissions of LoRa Class A devices are affected by path-loss, shadowing and Rayleigh fading. Numerical results obtained with the modeling methodology are compared with simulation results, and the validation of the proposed model is discussed for different levels of traffic load and PHY-layer conditions. Due to the possibility of capturing multiple frames simultaneously, we consider the maximum achievable performance of the PHY/MAC LoRa scheme according to the Signal-to-interference-plus-noise ratio (SINR). The contribution of this work is primarily focused on studying the average number of successfully received LoRa frames, which establishes a performance upper bound due to the optimal capture condition considered in the PHY-layer.
最近,由于需要将越来越多的设备连接到所谓的物联网(IoT),低功耗广域网(lpwan)引起了人们的极大兴趣。LoRa网络是允许在非许可频带中运行的多个设备进行远程无线电连接的lpwan。在这项工作中,我们描述了LoRa上行通信的性能,其中物理层(PHY)和介质访问控制(MAC)都被考虑在内。通过承认设备的均匀空间分布,我们通过成功解码多个帧的概率来表征物理层的性能,这些帧在同一时间以相同的扩展因子传输。通过承认各LoRa设备生成的帧间到达时间呈指数分布来评估MAC性能。考虑典型的LoRaWAN工作场景,其中LoRa A类设备的传输受到路径损耗、阴影和瑞利衰落的影响。将建模方法得到的数值结果与仿真结果进行了比较,并讨论了不同交通负荷水平和物理层条件下所提出模型的有效性。由于同时捕获多个帧的可能性,我们根据信噪比(SINR)考虑PHY/MAC LoRa方案的最大可实现性能。这项工作的贡献主要集中在研究成功接收LoRa帧的平均数量,由于在物理层中考虑了最佳捕获条件,因此建立了性能上限。
{"title":"Upper Bound Performance of Uplink Class A LoRa Networks","authors":"J. Pacheco, António Furtado, Rodolfo Oliveira","doi":"10.1109/IWCMC.2019.8766680","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766680","url":null,"abstract":"Recently, Low Power Wide Area Networks (LPWANs) have attracted a great interest due to the need of connecting more and more devices to the so-called Internet of Things (IoT). LoRa networks are LPWANs that allow a long-range radio connection of multiple devices operating in non-licensed bands. In this work, we characterize the performance of LoRa’s Uplink communications where both physical layer (PHY) and medium access control (MAC) are taken into account. By admitting a uniform spatial distribution of the devices, we characterize the performance of the PHY-layer through the probability of successful decoding multiple frames that were transmitted with the same spreading factor and at the same time. The MAC performance is evaluated by admitting that the inter-arrival time of the frames generated by each LoRa device is exponentially distributed. A typical LoRaWAN operating scenario is considered, where the transmissions of LoRa Class A devices are affected by path-loss, shadowing and Rayleigh fading. Numerical results obtained with the modeling methodology are compared with simulation results, and the validation of the proposed model is discussed for different levels of traffic load and PHY-layer conditions. Due to the possibility of capturing multiple frames simultaneously, we consider the maximum achievable performance of the PHY/MAC LoRa scheme according to the Signal-to-interference-plus-noise ratio (SINR). The contribution of this work is primarily focused on studying the average number of successfully received LoRa frames, which establishes a performance upper bound due to the optimal capture condition considered in the PHY-layer.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124129240","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
Convolutional Neural Networks for blind decoding in Sparse Code Multiple Access 稀疏码多址盲译码的卷积神经网络
I. Abidi, M. Hizem, Iness Ahriz, M. Dakhli, R. Bouallègue
Sparse code multiple access (SCMA) has attracted growing research interests in order to meet the targets of the next generation of wireless communication networks. Since it relies on non-orthogonal multiple access (NOMA) techniques, it is considered as a promising candidate for future systems that can improve the spectral efficiency and solve the problem of massive user connections. In this paper, the basic concept of SCMA is introduced, including SCMA encoding, codebook mapping, and SCMA decoding. The major challenge of SCMA is the very high detection complexity. Then, a novel strategy for blind decoding based on convolutional neural networks is proposed. Through simulations, we showed that our proposed scheme outperforms conventional schemes in terms of both BER and computational complexity, where 0.9 dB improvements can be achieved.
为了满足下一代无线通信网络的目标,稀疏码多址(SCMA)已引起越来越多的研究兴趣。由于它依赖于非正交多址(NOMA)技术,因此被认为是未来系统中提高频谱效率和解决大量用户连接问题的有希望的候选系统。本文介绍了SCMA的基本概念,包括SCMA编码、码本映射和SCMA解码。SCMA的主要挑战是极高的检测复杂度。在此基础上,提出了一种基于卷积神经网络的盲解码策略。通过仿真,我们表明我们提出的方案在误码率和计算复杂度方面都优于传统方案,其中可以实现0.9 dB的改进。
{"title":"Convolutional Neural Networks for blind decoding in Sparse Code Multiple Access","authors":"I. Abidi, M. Hizem, Iness Ahriz, M. Dakhli, R. Bouallègue","doi":"10.1109/IWCMC.2019.8766707","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766707","url":null,"abstract":"Sparse code multiple access (SCMA) has attracted growing research interests in order to meet the targets of the next generation of wireless communication networks. Since it relies on non-orthogonal multiple access (NOMA) techniques, it is considered as a promising candidate for future systems that can improve the spectral efficiency and solve the problem of massive user connections. In this paper, the basic concept of SCMA is introduced, including SCMA encoding, codebook mapping, and SCMA decoding. The major challenge of SCMA is the very high detection complexity. Then, a novel strategy for blind decoding based on convolutional neural networks is proposed. Through simulations, we showed that our proposed scheme outperforms conventional schemes in terms of both BER and computational complexity, where 0.9 dB improvements can be achieved.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123184344","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}
引用次数: 5
Reputation based Intelligent Control Protocol 基于信誉的智能控制协议
Nabila Bermad, Salah Zemmoudj, Mawloud Omar
Intelligent traffic light control systems are proposed to solve the problem of congestion in urban areas. In this context, the connected vehicles are used to gather the real-time traffic data surrounding environment. The involvement of vehicles in the control of traffic can reduce considerably the travel delay and maximize throughput. However, if the reported information is fake, then the result could be catastrophic, such as road accidents. Also, the malicious vehicles can send fake displacement urgency to their supervised traffic light, to reach their destinations as fast as possible. To tackle this problem, we propose a Reputation model based Intelligent COntrol Protocol (RICOP). In this protocol, each traffic light computes the negotiating vehicle’s reputation based on its dynamic behavior, the opinions of located traffic lights, and its historical reputation monitored by nearest roadside unit (RSU). According to the reputation value, the traffic light takes an appropriate decision. RICOP guarantees the integrity and authentication of exchanged messages using digital signature and certificateless cryptography. Also, the privacy of the vehicle and its driver is preserved using a pseudonym. To evaluate the effectiveness of our proposal, we set a series of simulations in a network simulator NS3. The results are satisfactory in terms of delay, accuracy and computational cost.
为了解决城市交通拥堵问题,提出了智能交通灯控制系统。在这种情况下,联网车辆被用来收集周围环境的实时交通数据。车辆参与交通控制可以大大减少交通延误,最大限度地提高吞吐量。然而,如果报告的信息是假的,那么结果可能是灾难性的,比如交通事故。此外,恶意车辆可以向受监管的红绿灯发送虚假的位移紧急情况,以尽快到达目的地。为了解决这个问题,我们提出了一种基于信誉模型的智能控制协议(RICOP)。在该协议中,每个交通灯根据其动态行为、所处交通灯的意见以及由最近路边单元(RSU)监控的其历史声誉计算协商车辆的声誉。根据信誉值,红绿灯做出适当的决策。RICOP使用数字签名和无证书加密技术保证交换消息的完整性和身份验证。此外,车辆及其驾驶员的隐私也使用假名来保护。为了评估我们的建议的有效性,我们在网络模拟器NS3中设置了一系列的模拟。结果在延迟、精度和计算成本方面令人满意。
{"title":"Reputation based Intelligent Control Protocol","authors":"Nabila Bermad, Salah Zemmoudj, Mawloud Omar","doi":"10.1109/IWCMC.2019.8766782","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766782","url":null,"abstract":"Intelligent traffic light control systems are proposed to solve the problem of congestion in urban areas. In this context, the connected vehicles are used to gather the real-time traffic data surrounding environment. The involvement of vehicles in the control of traffic can reduce considerably the travel delay and maximize throughput. However, if the reported information is fake, then the result could be catastrophic, such as road accidents. Also, the malicious vehicles can send fake displacement urgency to their supervised traffic light, to reach their destinations as fast as possible. To tackle this problem, we propose a Reputation model based Intelligent COntrol Protocol (RICOP). In this protocol, each traffic light computes the negotiating vehicle’s reputation based on its dynamic behavior, the opinions of located traffic lights, and its historical reputation monitored by nearest roadside unit (RSU). According to the reputation value, the traffic light takes an appropriate decision. RICOP guarantees the integrity and authentication of exchanged messages using digital signature and certificateless cryptography. Also, the privacy of the vehicle and its driver is preserved using a pseudonym. To evaluate the effectiveness of our proposal, we set a series of simulations in a network simulator NS3. The results are satisfactory in terms of delay, accuracy and computational cost.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"289 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117303765","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
Exploiting Energy Efficient Routing protocols for Void Hole Alleviation in IoT enabled Underwater WSN 利用高能效路由协议缓解物联网水下WSN中的空洞
M. Awais, N. Javaid, Nidal Naseer, M. Imran
In recent times, different routing protocols have been proposed in the Internet of Things enabled Underwater Wireless Sensor Networks (IoT-UWSNs) to explore the underwater environment for different purposes, i.e., scientific and military purposes. However, high Energy Consumption (EC), End to End (E2E) delay, low Packet Delivery Ratio (PDR) and minimum network lifetime make the energy efficient communication a challenging task in Underwater Wireless Sensor Network (UWSN). The high E2E delay, EC and reliable data delivery are the critical issues, which play an important role to enhance the network throughput. So, this paper presents two energy efficient routing protocols namely: Shortest Path-Collision avoidance Based Energy Efficient Routing (SP-CBE2R) protocol and Improved-Collision avoidance Based Energy Efficient Routing (Im-CBE2R) protocol. At this end, both routing protocols minimize the probability of void hole occurrence and in return minimizes the EC and E2E delay. In both routing protocols, courier nodes are positioned at different strategic locations to keep the greedy forwarding continuous. The proposed routing protocols are also analyzed by varying the Packet Size (PS) and Data Rate (DR). Additionally, various simulations have been performed to authenticate the proposed routing protocols. Simulation results show that the proposed routing protocols outperform the baseline routing protocols in counterparts.
近年来,在物联网水下无线传感器网络(IoT-UWSNs)中提出了不同的路由协议,以探索水下环境,用于不同的目的,即科学和军事目的。然而,高能耗(EC)、端到端(E2E)延迟、低分组传输比(PDR)和最小网络生存期使得水下无线传感器网络(UWSN)的高能效通信成为一项具有挑战性的任务。高端到端时延、EC和可靠的数据传输是提高网络吞吐量的关键问题。为此,本文提出了两种节能路由协议,即基于最短路径避免碰撞的节能路由(SP-CBE2R)协议和基于改进的避免碰撞的节能路由(Im-CBE2R)协议。在这一端,两种路由协议都最小化了空穴发生的概率,并反过来最小化了EC和E2E延迟。在这两种路由协议中,快递节点被放置在不同的战略位置,以保持贪婪转发的持续。本文还从分组大小(Packet Size, PS)和数据速率(Data Rate, DR)两个方面对所提出的路由协议进行了分析。此外,还进行了各种模拟以验证所提出的路由协议。仿真结果表明,所提出的路由协议优于同类基准路由协议。
{"title":"Exploiting Energy Efficient Routing protocols for Void Hole Alleviation in IoT enabled Underwater WSN","authors":"M. Awais, N. Javaid, Nidal Naseer, M. Imran","doi":"10.1109/IWCMC.2019.8766551","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766551","url":null,"abstract":"In recent times, different routing protocols have been proposed in the Internet of Things enabled Underwater Wireless Sensor Networks (IoT-UWSNs) to explore the underwater environment for different purposes, i.e., scientific and military purposes. However, high Energy Consumption (EC), End to End (E2E) delay, low Packet Delivery Ratio (PDR) and minimum network lifetime make the energy efficient communication a challenging task in Underwater Wireless Sensor Network (UWSN). The high E2E delay, EC and reliable data delivery are the critical issues, which play an important role to enhance the network throughput. So, this paper presents two energy efficient routing protocols namely: Shortest Path-Collision avoidance Based Energy Efficient Routing (SP-CBE2R) protocol and Improved-Collision avoidance Based Energy Efficient Routing (Im-CBE2R) protocol. At this end, both routing protocols minimize the probability of void hole occurrence and in return minimizes the EC and E2E delay. In both routing protocols, courier nodes are positioned at different strategic locations to keep the greedy forwarding continuous. The proposed routing protocols are also analyzed by varying the Packet Size (PS) and Data Rate (DR). Additionally, various simulations have been performed to authenticate the proposed routing protocols. Simulation results show that the proposed routing protocols outperform the baseline routing protocols in counterparts.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114372811","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}
引用次数: 6
Black-box Adversarial Machine Learning Attack on Network Traffic Classification 网络流量分类的黑盒对抗性机器学习攻击
M. Usama, A. Qayyum, Junaid Qadir, Ala Al-Fuqaha
Deep machine learning techniques have shown promising results in network traffic classification, however, the robustness of these techniques under adversarial threats is still in question. Deep machine learning models are found vulnerable to small carefully crafted adversarial perturbations posing a major question on the performance of deep machine learning techniques. In this paper, we propose a black-box adversarial attack on network traffic classification. The proposed attack successfully evades deep machine learning-based classifiers which highlights the potential security threat of using deep machine learning techniques to realize autonomous networks.
深度机器学习技术在网络流量分类中显示出有希望的结果,然而,这些技术在对抗性威胁下的鲁棒性仍然存在问题。深度机器学习模型容易受到精心设计的小对抗性扰动的影响,这对深度机器学习技术的性能提出了一个主要问题。在本文中,我们提出了一种针对网络流量分类的黑盒对抗攻击。提出的攻击成功地避开了基于深度机器学习的分类器,这突出了使用深度机器学习技术实现自治网络的潜在安全威胁。
{"title":"Black-box Adversarial Machine Learning Attack on Network Traffic Classification","authors":"M. Usama, A. Qayyum, Junaid Qadir, Ala Al-Fuqaha","doi":"10.1109/IWCMC.2019.8766505","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766505","url":null,"abstract":"Deep machine learning techniques have shown promising results in network traffic classification, however, the robustness of these techniques under adversarial threats is still in question. Deep machine learning models are found vulnerable to small carefully crafted adversarial perturbations posing a major question on the performance of deep machine learning techniques. In this paper, we propose a black-box adversarial attack on network traffic classification. The proposed attack successfully evades deep machine learning-based classifiers which highlights the potential security threat of using deep machine learning techniques to realize autonomous networks.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124023608","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}
引用次数: 31
A novel detection and decoding receiver for Polar-Coded SCMA system 一种用于极码SCMA系统的新型检测解码接收机
I. Abidi, M. Hizem, Iness Ahriz, M. Dakhli, R. Bouallègue
Sparse code multiple access (SCMA) and polar codes (PC) are two promising candidates for Future communication systems since they are capable of achieving high system capacity. In this paper, we develop a novel detection and decoding scheme for SCMA systems combined with channel coding candidate polar codes. First, we propose a separate detection and decoding (SDD) receiver for uplink communications. Then, we introduce a joint detection and decoding (JDD) receiver scheme. The investigation of system receiver is decomposed on message passing algorithm (MPA) based SCMA multiuser detection and soft cancellation (SCAN) algorithm based polar codes decoder. The separate and joint schemes are studied over additive white gaussian noise (AWGN) channels. JDD scheme yields a better performance gain. Moreover, the joint scheme has a lower computational complexity compared to the separate one. Numerical results show that when polar code length polarN = 1024 and R = 1/2, under system loading 150%, JDD outperforms the SDD 1.8dB at BER = 10−2 and 3.3dB at BER = 10−6 over AWGN channels.
稀疏码多址(SCMA)和极化码(PC)由于能够实现高系统容量,是未来通信系统的两种有前途的候选方案。在本文中,我们开发了一种结合信道编码候选极码的SCMA系统检测和解码方案。首先,我们提出了一个单独的检测和解码(SDD)接收器用于上行通信。然后,我们介绍了一种联合检测和解码(JDD)接收器方案。系统接收机的研究分为基于消息传递算法(MPA)的SCMA多用户检测和基于软抵消(SCAN)算法的极化码解码器。研究了加性高斯白噪声(AWGN)信道上的分离方案和联合方案。JDD方案产生更好的性能增益。此外,联合方案比单独方案具有更低的计算复杂度。数值结果表明,当极化码长polarN = 1024, R = 1/2,系统负载为150%时,在AWGN信道上,JDD在BER = 10−2时优于SDD 1.8dB, BER = 10−6时优于SDD 3.3dB。
{"title":"A novel detection and decoding receiver for Polar-Coded SCMA system","authors":"I. Abidi, M. Hizem, Iness Ahriz, M. Dakhli, R. Bouallègue","doi":"10.1109/IWCMC.2019.8766773","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766773","url":null,"abstract":"Sparse code multiple access (SCMA) and polar codes (PC) are two promising candidates for Future communication systems since they are capable of achieving high system capacity. In this paper, we develop a novel detection and decoding scheme for SCMA systems combined with channel coding candidate polar codes. First, we propose a separate detection and decoding (SDD) receiver for uplink communications. Then, we introduce a joint detection and decoding (JDD) receiver scheme. The investigation of system receiver is decomposed on message passing algorithm (MPA) based SCMA multiuser detection and soft cancellation (SCAN) algorithm based polar codes decoder. The separate and joint schemes are studied over additive white gaussian noise (AWGN) channels. JDD scheme yields a better performance gain. Moreover, the joint scheme has a lower computational complexity compared to the separate one. Numerical results show that when polar code length polarN = 1024 and R = 1/2, under system loading 150%, JDD outperforms the SDD 1.8dB at BER = 10−2 and 3.3dB at BER = 10−6 over AWGN channels.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"39 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115858667","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
IWCMC 2019 Copyright Page IWCMC 2019版权页面
{"title":"IWCMC 2019 Copyright Page","authors":"","doi":"10.1109/iwcmc.2019.8766613","DOIUrl":"https://doi.org/10.1109/iwcmc.2019.8766613","url":null,"abstract":"","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115003962","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
Solving Security Problems in MEC Systems 解决MEC系统中的安全问题
Xiao Zheng, Mingchu Li, Yuanfang Chen, M. Guizani, Jia Liu, Muhammad Tahir
We propose an algorithm for constructing efficient security strategies in the mobile edge computing (MEC), where the protected targets are nodes connected to the MEC and the mobile users (MUs) are agents capable of preventing undesirable activities on the nodes. The algorithm is designed based on the synthetic principles of a specific set of strategies, and it can quickly construct suboptimal solutions even if the number of targets reaches hundreds of millions.
我们提出了一种在移动边缘计算(MEC)中构建有效安全策略的算法,其中受保护的目标是连接到MEC的节点,移动用户(mu)是能够防止节点上不良活动的代理。该算法基于一组特定策略的综合原理进行设计,即使目标数达到数亿,也能快速构建次优解。
{"title":"Solving Security Problems in MEC Systems","authors":"Xiao Zheng, Mingchu Li, Yuanfang Chen, M. Guizani, Jia Liu, Muhammad Tahir","doi":"10.1109/IWCMC.2019.8766752","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766752","url":null,"abstract":"We propose an algorithm for constructing efficient security strategies in the mobile edge computing (MEC), where the protected targets are nodes connected to the MEC and the mobile users (MUs) are agents capable of preventing undesirable activities on the nodes. The algorithm is designed based on the synthetic principles of a specific set of strategies, and it can quickly construct suboptimal solutions even if the number of targets reaches hundreds of millions.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115424900","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}
引用次数: 3
An MMSE Integrated Equalization for HARQ Chase Combining in OQAM-FBMC systems OQAM-FBMC系统中HARQ追逐组合的MMSE集成均衡
Abla Bedoui, Mohamed Et-tolba, Hamid Nouasria
Offset quadrature amplitude modulation-based filter bank multicarrier (OQAM-FBMC) is a promising waveform for future wireless communication systems. Despite its numerous advantages, OQAM-FBMC suffers from high signal distortions in a doubly selective channel where a simple equalization is not sufficient to deal with this issue. In this paper, we propose a hybrid automatic repeat request (HARQ) scheme with integrated MMSE equalizer to improve the efficiency of OQAM-FBMC technique. In addition, we analyse the impact of the new technique on inter-carrier interference (ICI) using the cumulative distribution function (CDF). Simulation results show that the proposed approach provides a significant gain in terms of block error rate (BLER).
基于偏置正交调幅的滤波器组多载波(OQAM-FBMC)是未来无线通信系统中很有前途的一种波形。尽管有许多优点,OQAM-FBMC在双选择信道中存在高信号失真,在这种情况下,简单的均衡不足以解决这个问题。为了提高OQAM-FBMC技术的效率,本文提出了一种集成MMSE均衡器的混合自动重复请求(HARQ)方案。此外,我们利用累积分布函数(CDF)分析了新技术对载波间干扰(ICI)的影响。仿真结果表明,该方法在块错误率(BLER)方面有显著提高。
{"title":"An MMSE Integrated Equalization for HARQ Chase Combining in OQAM-FBMC systems","authors":"Abla Bedoui, Mohamed Et-tolba, Hamid Nouasria","doi":"10.1109/IWCMC.2019.8766473","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766473","url":null,"abstract":"Offset quadrature amplitude modulation-based filter bank multicarrier (OQAM-FBMC) is a promising waveform for future wireless communication systems. Despite its numerous advantages, OQAM-FBMC suffers from high signal distortions in a doubly selective channel where a simple equalization is not sufficient to deal with this issue. In this paper, we propose a hybrid automatic repeat request (HARQ) scheme with integrated MMSE equalizer to improve the efficiency of OQAM-FBMC technique. In addition, we analyse the impact of the new technique on inter-carrier interference (ICI) using the cumulative distribution function (CDF). Simulation results show that the proposed approach provides a significant gain in terms of block error rate (BLER).","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618392","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}
引用次数: 3
期刊
2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)
全部 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