首页 > 最新文献

2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)最新文献

英文 中文
Measurement of IEEE 802.11p Performance for Basic Safety Messages in Vehicular Communications 车辆通信中基本安全信息的IEEE 802.11p性能测量
Nitin Singh Rajput
This paper present: (i) an experimental study for performance evaluation of IEEE 802.11p vehicular communications and (ii) creation of dataset for IEEE 802.11p vehicular communications, while transmitting Basic Safety Messages. Two relevant metrics Latency and Received Signal Strength Indicator have been used for both performance evaluation and creation of dataset. However, the dataset also contains other information like position of the vehicle, packet receiving time, transmitting power etc., while transmitting each such packet. The physical experiments were performed using IEEE 802.11p compliant communication devices. The conducted experiments disclosed many important insights related to the performance of IEEE 802.11p. To the best of knowledge, the data set created and the measurements taken for considered parameters presented in this paper are first of their kinds. These results and dataset would be helpful in future research works in the relevant area.
本文提出:(i) IEEE 802.11p车载通信性能评估的实验研究;(ii)在传输基本安全消息的情况下,创建IEEE 802.11p车载通信数据集。两个相关的指标延迟和接收信号强度指标被用于性能评估和数据集的创建。但是,在传输每个数据包时,数据集还包含其他信息,如车辆位置、数据包接收时间、发送功率等。物理实验采用IEEE 802.11p标准通信设备进行。所进行的实验揭示了许多与IEEE 802.11p性能相关的重要见解。据我所知,本文中所创建的数据集和对所考虑的参数所采取的测量是同类中第一次。这些结果和数据集将有助于今后相关领域的研究工作。
{"title":"Measurement of IEEE 802.11p Performance for Basic Safety Messages in Vehicular Communications","authors":"Nitin Singh Rajput","doi":"10.1109/ANTS.2018.8710108","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710108","url":null,"abstract":"This paper present: (i) an experimental study for performance evaluation of IEEE 802.11p vehicular communications and (ii) creation of dataset for IEEE 802.11p vehicular communications, while transmitting Basic Safety Messages. Two relevant metrics Latency and Received Signal Strength Indicator have been used for both performance evaluation and creation of dataset. However, the dataset also contains other information like position of the vehicle, packet receiving time, transmitting power etc., while transmitting each such packet. The physical experiments were performed using IEEE 802.11p compliant communication devices. The conducted experiments disclosed many important insights related to the performance of IEEE 802.11p. To the best of knowledge, the data set created and the measurements taken for considered parameters presented in this paper are first of their kinds. These results and dataset would be helpful in future research works in the relevant area.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126862117","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}
引用次数: 12
ACTM: API Call Transition Matrix-based Malware Detection Method 基于API调用转换矩阵的恶意软件检测方法
V. M. Sruthi, B. Thanudas, S. Sreelal, Abhishek Chakraborty, B. S. Manoj
Traditional malware detection techniques, such as signature-based detection and traditional antivirus software, are not beneficial for detecting many recent malware threats. In this paper, we propose a novel malware detection technique, API call transition matrix-based malware detection (ACTM), that efficiently detects malware based on their runtime behavior. We find that the ACTM technique performs better and detects malware with approximately 95.23% accuracy. ACTM can find applications in designing real-time malware detection when an enterprise network security system is concerned.
传统的恶意软件检测技术,如基于签名的检测和传统的杀毒软件,已经无法检测到许多最新的恶意软件威胁。本文提出了一种新的恶意软件检测技术——基于API调用转移矩阵的恶意软件检测(ACTM),该技术可以根据恶意软件的运行时行为有效地检测恶意软件。我们发现ACTM技术性能更好,检测恶意软件的准确率约为95.23%。ACTM可以应用于企业网络安全系统的实时恶意软件检测设计。
{"title":"ACTM: API Call Transition Matrix-based Malware Detection Method","authors":"V. M. Sruthi, B. Thanudas, S. Sreelal, Abhishek Chakraborty, B. S. Manoj","doi":"10.1109/ANTS.2018.8710081","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710081","url":null,"abstract":"Traditional malware detection techniques, such as signature-based detection and traditional antivirus software, are not beneficial for detecting many recent malware threats. In this paper, we propose a novel malware detection technique, API call transition matrix-based malware detection (ACTM), that efficiently detects malware based on their runtime behavior. We find that the ACTM technique performs better and detects malware with approximately 95.23% accuracy. ACTM can find applications in designing real-time malware detection when an enterprise network security system is concerned.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129844959","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
Tracing Jammed Area in Wireless Ad-hoc Network using Boundary Node Detection 基于边界节点检测的无线自组网干扰区跟踪
S. Saurabh, Rishabh Rustogi
Ad-hoc Networks, which are based on wireless medium, are susceptible to various kinds of security threats. One such threat is the jamming attack where the attacker jams the wireless medium using high energy signals. This leads to the disruption in communication. This attack falls under the category of Denial of Service (DoS) attack. For military and disaster management services, where continuous and reliable communication is of utmost importance, this attack poses a serious threat. A potential solution to this problem is to use the automated jammed area mapping schemes, which can identify the jammed region and report it to the concerned authorities for taking required action. There exists a few jammed area mapping protocols, however they suffer from hurdles like extensive flooding, wasted bandwidth and low accuracy-rate. These schemes are based on receiving replies from the nodes located in the jammed region where the probability of sending and receiving messages is quite low. In this paper, we propose an algorithm which can locate the the jammed region without needing to rely on receiving messages from any jammed node. Our algorithm traces the boundary nodes with high accuracy in less amount of time. We performed the simulation of our algorithms using NS3 and observed an accuracy of around 95%, false-positive rate of 4.6% and zero false-negative in identifying the boundary nodes.
基于无线介质的自组织网络容易受到各种安全威胁。其中一种威胁是干扰攻击,攻击者使用高能信号阻塞无线媒体。这就导致了沟通的中断。这种攻击属于DoS (Denial of Service)攻击。对于军事和灾害管理服务来说,持续可靠的通信是至关重要的,这种攻击构成了严重威胁。这个问题的一个潜在解决方案是使用自动阻塞区域制图方案,它可以识别阻塞区域并将其报告给有关当局,以便采取所需的行动。目前存在一些拥堵区域测绘协议,但它们都面临着诸如广泛的洪水、带宽浪费和低准确率等障碍。这些方案是基于接收来自位于阻塞区域的节点的应答,该区域发送和接收消息的概率很低。在本文中,我们提出了一种不依赖于接收来自任何阻塞节点的消息来定位阻塞区域的算法。该算法在较短的时间内以较高的精度跟踪边界节点。我们使用NS3对我们的算法进行了仿真,在识别边界节点时,准确率约为95%,假阳性率为4.6%,假阴性为零。
{"title":"Tracing Jammed Area in Wireless Ad-hoc Network using Boundary Node Detection","authors":"S. Saurabh, Rishabh Rustogi","doi":"10.1109/ANTS.2018.8710095","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710095","url":null,"abstract":"Ad-hoc Networks, which are based on wireless medium, are susceptible to various kinds of security threats. One such threat is the jamming attack where the attacker jams the wireless medium using high energy signals. This leads to the disruption in communication. This attack falls under the category of Denial of Service (DoS) attack. For military and disaster management services, where continuous and reliable communication is of utmost importance, this attack poses a serious threat. A potential solution to this problem is to use the automated jammed area mapping schemes, which can identify the jammed region and report it to the concerned authorities for taking required action. There exists a few jammed area mapping protocols, however they suffer from hurdles like extensive flooding, wasted bandwidth and low accuracy-rate. These schemes are based on receiving replies from the nodes located in the jammed region where the probability of sending and receiving messages is quite low. In this paper, we propose an algorithm which can locate the the jammed region without needing to rely on receiving messages from any jammed node. Our algorithm traces the boundary nodes with high accuracy in less amount of time. We performed the simulation of our algorithms using NS3 and observed an accuracy of around 95%, false-positive rate of 4.6% and zero false-negative in identifying the boundary nodes.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128507797","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
Secure Hierarchical VANETs 安全分级vanet
Saumya Bhadauria, A. Bohra
Routing in Vehicular Ad-hoc Networks (VANETs) is a complex task due to high mobility. In such cases, short lived routes need to be established, without any prior knowledge about the network topology. Approaching routing for the unpredictable traffic conditions of unplanned cities requires quick node discovery and validation. Moreover, geographic routing gives faster relay selection. The proposed approach includes these two features along with a circular search ensuring wider coverage. Proper radio propagation model with more than two rays need to be implemented for an irregular terrain and to limit the losses due to different elevation of roads. Data redundancy plays a vital role in reducing the losses that might be caused due to misbehaving nodes or failure of a node.
由于车辆自组织网络(VANETs)的高移动性,路由是一项复杂的任务。在这种情况下,需要在不了解网络拓扑的情况下建立短生存路由。在未规划的城市中,针对不可预测的交通状况逼近路由需要快速发现和验证节点。此外,地理路由提供了更快的中继选择。建议的方法包括这两个特征以及循环搜索,以确保更广泛的覆盖范围。对于不规则地形,需要采用合适的两条以上射线的无线电传播模型,以限制由于道路海拔不同而造成的损失。数据冗余在减少由于节点行为不当或节点故障造成的损失方面起着至关重要的作用。
{"title":"Secure Hierarchical VANETs","authors":"Saumya Bhadauria, A. Bohra","doi":"10.1109/ANTS.2018.8710050","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710050","url":null,"abstract":"Routing in Vehicular Ad-hoc Networks (VANETs) is a complex task due to high mobility. In such cases, short lived routes need to be established, without any prior knowledge about the network topology. Approaching routing for the unpredictable traffic conditions of unplanned cities requires quick node discovery and validation. Moreover, geographic routing gives faster relay selection. The proposed approach includes these two features along with a circular search ensuring wider coverage. Proper radio propagation model with more than two rays need to be implemented for an irregular terrain and to limit the losses due to different elevation of roads. Data redundancy plays a vital role in reducing the losses that might be caused due to misbehaving nodes or failure of a node.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128757629","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 Supervised Approach-based Job Scheduling Technique for Distributed Real-Time Systems 基于监督方法的分布式实时系统作业调度技术
Manu Agrawal, Kartik Manchanda, Akshita Agarwal, Surbhi Saraswat, Ashish Gupta, Hari Prabhat Gupta, Tanima Dutta
Distributed real time systems have end-to-end jobs which are scheduled on multiple processors. These jobs are composed of several sub-jobs which do not have individual end-to-end constraints. To efficiently schedule these sub-jobs, their local deadline requirements are needed to be known. The local deadline assignment problem has been recognized as a crucial problem in distributed real-time system research. In this paper, we present a supervised machine learning based job scheduling technique for a distributed Real-Time System (RTS). We use linear regression, support vector machine, and artificial neural network machine learning techniques for predicting the local deadline of upcoming workload with a given release time and deadline of executed sub-jobs. We also develop a technique for labeled dataset creation in a distributed RTS. We demonstrate that the supervised machine learning based job scheduling technique reduces the job dropping rate and thereby enhances the utility of the distributed RTS.
分布式实时系统具有在多个处理器上调度的端到端作业。这些作业由几个子作业组成,这些子作业没有单独的端到端约束。为了有效地安排这些子作业,需要知道它们的本地截止日期要求。局部截止时间分配问题是分布式实时系统研究中的一个关键问题。本文提出了一种基于监督机器学习的分布式实时系统(RTS)作业调度技术。我们使用线性回归、支持向量机和人工神经网络机器学习技术来预测具有给定发布时间和执行子作业截止日期的即将到来的工作负载的本地截止日期。我们还开发了一种在分布式RTS中创建标记数据集的技术。我们证明了基于监督机器学习的作业调度技术降低了作业丢失率,从而提高了分布式RTS的效用。
{"title":"A Supervised Approach-based Job Scheduling Technique for Distributed Real-Time Systems","authors":"Manu Agrawal, Kartik Manchanda, Akshita Agarwal, Surbhi Saraswat, Ashish Gupta, Hari Prabhat Gupta, Tanima Dutta","doi":"10.1109/ANTS.2018.8710168","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710168","url":null,"abstract":"Distributed real time systems have end-to-end jobs which are scheduled on multiple processors. These jobs are composed of several sub-jobs which do not have individual end-to-end constraints. To efficiently schedule these sub-jobs, their local deadline requirements are needed to be known. The local deadline assignment problem has been recognized as a crucial problem in distributed real-time system research. In this paper, we present a supervised machine learning based job scheduling technique for a distributed Real-Time System (RTS). We use linear regression, support vector machine, and artificial neural network machine learning techniques for predicting the local deadline of upcoming workload with a given release time and deadline of executed sub-jobs. We also develop a technique for labeled dataset creation in a distributed RTS. We demonstrate that the supervised machine learning based job scheduling technique reduces the job dropping rate and thereby enhances the utility of the distributed RTS.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126011970","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
Development of a Minimum Interference Leakage based Interference Aligned Network in Presence of Jammers 干扰机存在下基于最小干扰泄漏的干扰对准网络的研制
Nikhil Kumar, P. M. Pradhan
Interference alignment (IA) is a potential solution to combat interference in a wireless network. It can also be extended to mitigate the harmful effects of adversarial jamming. Anti-jamming opportunistic IA (OIA) strategy jointly optimizes the transmission power and harvested energy of the adversarial IA wireless network in the presence of jammers. In anti-jamming OIA network, selected users transmit information at a given time slot while unselected users perform energy harvesting (EH). Selected users may also be allowed to perform EH whilst they are performing information transfer, using simultaneous information and power transfer technique. The total radio frequency energy received at the selected users is split into two parts based on the power splitting coefficient, one for information decoding and the other for energy harvesting. The total transmitted power of the network and power splitting coefficient are then jointly optimised by adopting a sub-optimal algorithm. This paper proposes the use of minimum interference leakage (MinIL) algorithm for formulation of anti-jamming OIA network and subsequent joint optimisation of power splitting and transmit power of the users in the network. The simulation results show that usage of MinIL algorithm reduces the total transmit power of the entire network for low jamming power levels.
干扰对准(IA)是无线网络中对抗干扰的一种潜在解决方案。它还可以扩展以减轻对抗性干扰的有害影响。抗干扰机会型IA (OIA)策略是在干扰器存在的情况下,共同优化对抗性IA无线网络的传输功率和收集能量。在抗干扰OIA网络中,选定的用户在给定时隙传输信息,而未选定的用户进行能量收集(EH)。选定的用户也可以在执行信息传输时执行EH,使用同步信息和功率传输技术。在所选用户处接收到的总射频能量根据功率分裂系数分为两部分,一部分用于信息解码,另一部分用于能量收集。然后采用次优算法对网络总传输功率和功率分割系数进行联合优化。本文提出将最小干扰泄漏(MinIL)算法用于抗干扰OIA网络的构建,并对网络中用户的功率分配和发射功率进行联合优化。仿真结果表明,在低干扰功率水平下,使用MinIL算法可以降低整个网络的总发射功率。
{"title":"Development of a Minimum Interference Leakage based Interference Aligned Network in Presence of Jammers","authors":"Nikhil Kumar, P. M. Pradhan","doi":"10.1109/ANTS.2018.8710121","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710121","url":null,"abstract":"Interference alignment (IA) is a potential solution to combat interference in a wireless network. It can also be extended to mitigate the harmful effects of adversarial jamming. Anti-jamming opportunistic IA (OIA) strategy jointly optimizes the transmission power and harvested energy of the adversarial IA wireless network in the presence of jammers. In anti-jamming OIA network, selected users transmit information at a given time slot while unselected users perform energy harvesting (EH). Selected users may also be allowed to perform EH whilst they are performing information transfer, using simultaneous information and power transfer technique. The total radio frequency energy received at the selected users is split into two parts based on the power splitting coefficient, one for information decoding and the other for energy harvesting. The total transmitted power of the network and power splitting coefficient are then jointly optimised by adopting a sub-optimal algorithm. This paper proposes the use of minimum interference leakage (MinIL) algorithm for formulation of anti-jamming OIA network and subsequent joint optimisation of power splitting and transmit power of the users in the network. The simulation results show that usage of MinIL algorithm reduces the total transmit power of the entire network for low jamming power levels.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125422808","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 Power efficient DST-based multicarrier and multiple access systems for VLC 一种高效的基于dst的多载波多址VLC系统
Suseela Vappangi, V. V. Mani
Visible Light Communication (VLC) exploits cost-effective light emitting diodes (LEDs) to render ‘illumination’ and ‘communication’ contemporaneously and is envisioned to meet the unprecedented growth in mobile data traffic. However, the slow transient response of white phosphorescent LEDs limits the modulation bandwidth. Consequently, orthogonal frequency division multiplexing (OFDM) is utilized to impart high data rate communication at the expense of emergence of high peak to average power ratio (PAPR). Furthermore, the limited dynamic range of LEDs makes this issue more pronounced as it leads to the emergence of detrimental non-linear distortions. This paper proposes discrete sine transform (DST)-based spreading for DC biased optical OFDM (DST-S-DCO-OFDM) to reduce PAPR. Unlike discrete Fourier transform (DFT)-based DCO-OFDM, DST-based DCO-OFDM doesn’t require Hermitian symmetry criteria to attain a real signal transmission. Accordingly, there is a reduction in computational complexity as well as increase in spectral efficiency. In addition, single carrier frequency division multiple access (SC-FDMA) is expedited for reducing PAPR. Therefore, this work derives the analytical expressions for DST-based optical interleaved multiple access (DST-OFDMA) and optical localized frequency division multiple access (DST-OLFDMA). The simulation results evidences that PAPR is decreased drastically by enforcing spreading technique when compared with conventional DST-based DCO-OFDM system. Furthermore, as depicted by the simulation results, the reduction in PAPR is more significant in DST-OFDMA than DST-OLFDMA. However, DST-OFDMA and DST-OLFDMA outperforms DST-based optical orthogonal frequency division multiple access (DST-OOFDMA).
可见光通信(VLC)利用具有成本效益的发光二极管(led)同时提供“照明”和“通信”,并被设想为满足前所未有的移动数据流量增长。然而,白光磷光led缓慢的瞬态响应限制了调制带宽。因此,利用正交频分复用(OFDM)来实现高数据速率通信,但代价是出现高峰值平均功率比(PAPR)。此外,led有限的动态范围使得这个问题更加明显,因为它会导致有害的非线性失真的出现。针对直流偏置OFDM (DST- s - dco -OFDM),提出了一种基于离散正弦变换(DST)的扩频算法来降低PAPR。与基于离散傅里叶变换(DFT)的DCO-OFDM不同,基于dst的DCO-OFDM不需要厄米对称准则来实现真实的信号传输。因此,计算复杂度降低,频谱效率提高。此外,还加快了单载波频分多址(SC-FDMA)的速度以降低PAPR。因此,本文推导了基于dst的光交错多址(DST-OFDMA)和光局部频分多址(DST-OLFDMA)的解析表达式。仿真结果表明,与传统的基于dst的DCO-OFDM系统相比,采用扩频技术可以显著降低PAPR。此外,仿真结果表明,与DST-OLFDMA相比,DST-OFDMA对PAPR的降低更为显著。然而,DST-OFDMA和DST-OLFDMA优于基于dst的光正交频分多址(DST-OOFDMA)。
{"title":"A Power efficient DST-based multicarrier and multiple access systems for VLC","authors":"Suseela Vappangi, V. V. Mani","doi":"10.1109/ANTS.2018.8710100","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710100","url":null,"abstract":"Visible Light Communication (VLC) exploits cost-effective light emitting diodes (LEDs) to render ‘illumination’ and ‘communication’ contemporaneously and is envisioned to meet the unprecedented growth in mobile data traffic. However, the slow transient response of white phosphorescent LEDs limits the modulation bandwidth. Consequently, orthogonal frequency division multiplexing (OFDM) is utilized to impart high data rate communication at the expense of emergence of high peak to average power ratio (PAPR). Furthermore, the limited dynamic range of LEDs makes this issue more pronounced as it leads to the emergence of detrimental non-linear distortions. This paper proposes discrete sine transform (DST)-based spreading for DC biased optical OFDM (DST-S-DCO-OFDM) to reduce PAPR. Unlike discrete Fourier transform (DFT)-based DCO-OFDM, DST-based DCO-OFDM doesn’t require Hermitian symmetry criteria to attain a real signal transmission. Accordingly, there is a reduction in computational complexity as well as increase in spectral efficiency. In addition, single carrier frequency division multiple access (SC-FDMA) is expedited for reducing PAPR. Therefore, this work derives the analytical expressions for DST-based optical interleaved multiple access (DST-OFDMA) and optical localized frequency division multiple access (DST-OLFDMA). The simulation results evidences that PAPR is decreased drastically by enforcing spreading technique when compared with conventional DST-based DCO-OFDM system. Furthermore, as depicted by the simulation results, the reduction in PAPR is more significant in DST-OFDMA than DST-OLFDMA. However, DST-OFDMA and DST-OLFDMA outperforms DST-based optical orthogonal frequency division multiple access (DST-OOFDMA).","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122054382","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
BER Analysis of BCH Codes in Slow Fading Channel with L-PPM and DPPM Scheme 慢衰落信道中L-PPM和DPPM码的误码率分析
Sonali, N. Gupta, A. Dixit, V. Jain
In this research paper, we have analyzed free space optical (FSO) link performance for intensity modulated/direct detection (IMDD) system utilizing L-ary pulse position modulation (L-PPM) and differential pulse position modulation (DPPM) schemes. Generally, FSO link performance is impaired by atmospheric turbulence. Error correcting codes (ECCs) is one of the mitigation techniques to reduce the impact of atmospheric turbulence. For this work, we have employed Bose-Chaudhuri-Hocquenghem (BCH) code under a slow fading channel condition with and without an interleaver. We have made the performance comparison in terms of bit error rate under different turbulence regimes viz., low, moderate and high regime for L-PPM (L=4,8 and 32) and differential PPM (DPPM) schemes. We conclude that BCH code with an interleaver for 32-PPM scheme provides a maximum coding gain of 25 dB in a high turbulence regime whereas BCH code without an interleaver degrades the BER performance in a slow fading channel. Also, with the DPPM scheme, neither coding nor interleaving can improve its performance. Therefore, the DPPM scheme will not be useful from this perspective.
在本研究中,我们分析了利用L-ary脉冲位置调制(L-PPM)和差分脉冲位置调制(DPPM)方案的强度调制/直接检测(IMDD)系统的自由空间光(FSO)链路性能。一般来说,FSO链路的性能会受到大气湍流的影响。纠错码(ECCs)是减少大气湍流影响的缓解技术之一。在这项工作中,我们在有或没有交织器的慢衰落信道条件下使用了Bose-Chaudhuri-Hocquenghem (BCH)码。我们对不同湍流状态下的误码率进行了性能比较,即L-PPM (L=4,8和32)和差分PPM (DPPM)方案的低、中、高状态。我们得出结论,在高湍流状态下,带有32 ppm交织器的BCH码提供了25 dB的最大编码增益,而没有交织器的BCH码在慢衰落信道中会降低误码率性能。此外,对于DPPM方案,无论是编码还是交错都不能提高其性能。因此,从这个角度来看,DPPM方案不会有用。
{"title":"BER Analysis of BCH Codes in Slow Fading Channel with L-PPM and DPPM Scheme","authors":"Sonali, N. Gupta, A. Dixit, V. Jain","doi":"10.1109/ANTS.2018.8710052","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710052","url":null,"abstract":"In this research paper, we have analyzed free space optical (FSO) link performance for intensity modulated/direct detection (IMDD) system utilizing L-ary pulse position modulation (L-PPM) and differential pulse position modulation (DPPM) schemes. Generally, FSO link performance is impaired by atmospheric turbulence. Error correcting codes (ECCs) is one of the mitigation techniques to reduce the impact of atmospheric turbulence. For this work, we have employed Bose-Chaudhuri-Hocquenghem (BCH) code under a slow fading channel condition with and without an interleaver. We have made the performance comparison in terms of bit error rate under different turbulence regimes viz., low, moderate and high regime for L-PPM (L=4,8 and 32) and differential PPM (DPPM) schemes. We conclude that BCH code with an interleaver for 32-PPM scheme provides a maximum coding gain of 25 dB in a high turbulence regime whereas BCH code without an interleaver degrades the BER performance in a slow fading channel. Also, with the DPPM scheme, neither coding nor interleaving can improve its performance. Therefore, the DPPM scheme will not be useful from this perspective.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"408 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122732670","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}
引用次数: 4
Fast algorithm for Blind Deinterleaving of a Block Interleaver using binary and non-binary Block codes in a telecommunication system 电信系统中使用二进制和非二进制块码的块交织器盲去交织的快速算法
Rahul Gogia, Brejesh Lall, S. Joshi
Interleavers were made a part of the digital communication to tackle the presence of burst errors due to a noisy channel or incorrect viterbi decoding by performing a rearrangement of the bits by using an interleaving array of size $N_{r} times N_{c}$ where $N_{r}$ is the number of rows, also called interleaver depth and $N_{c}$ is the number of columns of the array. A typical audio and video broadcasting system consisting of a Linear Block code (LBC) and a block interleaver is presented and a method to deinterleave the received sequence without any knowledge of the blocks used on the transmitter side i.e. in a blind setting is discussed. There is hardly any existing literature that solves this problem completely. The proposed algorithm calculates $N_{r}$ and codeword length by using rank deficiency while $N_{c}$ is calculated by using cyclic convolution to complete the analysis that is conducted on different LBCs with varying frame structure formats.
交织器是数字通信的一部分,通过使用大小为$N_{r} 乘以N_{c}$的交织数组来执行位的重排,从而解决由于噪声信道或不正确的viterbi解码而导致的突发错误,其中$N_{r}$是行数,也称为交织器深度,$N_{c}$是数组的列数。提出了一种典型的由线性块码(LBC)和块交织器组成的音频和视频广播系统,并讨论了在不知道发射端使用的块(即在盲设置下)的情况下对接收序列进行去交织的方法。几乎没有任何现有的文献能完全解决这个问题。该算法利用秩亏计算$N_{r}$和码字长度,利用循环卷积计算$N_{c}$,完成对不同帧结构格式的lbc的分析。
{"title":"Fast algorithm for Blind Deinterleaving of a Block Interleaver using binary and non-binary Block codes in a telecommunication system","authors":"Rahul Gogia, Brejesh Lall, S. Joshi","doi":"10.1109/ANTS.2018.8710038","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710038","url":null,"abstract":"Interleavers were made a part of the digital communication to tackle the presence of burst errors due to a noisy channel or incorrect viterbi decoding by performing a rearrangement of the bits by using an interleaving array of size $N_{r} times N_{c}$ where $N_{r}$ is the number of rows, also called interleaver depth and $N_{c}$ is the number of columns of the array. A typical audio and video broadcasting system consisting of a Linear Block code (LBC) and a block interleaver is presented and a method to deinterleave the received sequence without any knowledge of the blocks used on the transmitter side i.e. in a blind setting is discussed. There is hardly any existing literature that solves this problem completely. The proposed algorithm calculates $N_{r}$ and codeword length by using rank deficiency while $N_{c}$ is calculated by using cyclic convolution to complete the analysis that is conducted on different LBCs with varying frame structure formats.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115151448","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
ANTS 2018 Message from TCP Co-Chairs TCP联合主席2018年ant致辞
{"title":"ANTS 2018 Message from TCP Co-Chairs","authors":"","doi":"10.1109/ants.2018.8710085","DOIUrl":"https://doi.org/10.1109/ants.2018.8710085","url":null,"abstract":"","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129308124","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
期刊
2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)
全部 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