Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710108
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.
{"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}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710081
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.
{"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}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710095
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}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710050
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.
{"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}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710168
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.
{"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}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710121
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.
{"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}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710100
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}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710052
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.
{"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}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710038
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.
{"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}
Pub Date : 2018-12-01DOI: 10.1109/ants.2018.8710085
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：