Pub Date : 2021-12-15DOI: 10.1109/ACTS53447.2021.9708241
Prashanth Kannadaguli
Due to expanded praxis of social media, there is an elevated interest in the Natural Language Processing (NLP) of textual substance. Code swapping is a ubiquitous paradox in multilingual nation and the social communication shows mixing of a low resourced language with a highly resourced language mostly written in non-native script in the same text. It is essential to refine the code swapped text to support distinctive NLP tasks such as Machine Translation, Automated Conversational Systems and Sentiment Analysis (SA). The preeminent objective of SA is to identify and analyze the attitude, opinion, emotion or the sentiment in the dataset. Though there are multiple systems skilled on monodialectal dataset, all of them break down when it comes for code-diverse data because of the heightened intricacy of blending at various standards of text. Nonetheless, there exist a smaller number of assets for modelling such definitive code-mixed data and the Machine Learning or the Deep Learning algorithms enforcing supervised learning approach yield the better results compared to the unsupervised learning. Such datasets are available for Hindi-English, Tamil-English, Malayalam-English, Bengali-English, German-English, Spanish-English, Japanese-English, Arabic-English etc. Though our research is concentrated towards NLP for emotion and sentiment detection of Tulu, a vibrant south Indian language, to start with, we build the first ever platinum standard corpus for NLP applications of code-diverse text in Tulu-English, as there is no such resource in our native language. The performance analysis of our dataset through Krippendorff’s Alpha value of 0.9 indicates that it is a benchmark in development of Automatic Sentiment Analysis system for Tulu.
{"title":"A Code-Diverse Tulu-English Dataset For NLP Based Sentiment Analysis Applications","authors":"Prashanth Kannadaguli","doi":"10.1109/ACTS53447.2021.9708241","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708241","url":null,"abstract":"Due to expanded praxis of social media, there is an elevated interest in the Natural Language Processing (NLP) of textual substance. Code swapping is a ubiquitous paradox in multilingual nation and the social communication shows mixing of a low resourced language with a highly resourced language mostly written in non-native script in the same text. It is essential to refine the code swapped text to support distinctive NLP tasks such as Machine Translation, Automated Conversational Systems and Sentiment Analysis (SA). The preeminent objective of SA is to identify and analyze the attitude, opinion, emotion or the sentiment in the dataset. Though there are multiple systems skilled on monodialectal dataset, all of them break down when it comes for code-diverse data because of the heightened intricacy of blending at various standards of text. Nonetheless, there exist a smaller number of assets for modelling such definitive code-mixed data and the Machine Learning or the Deep Learning algorithms enforcing supervised learning approach yield the better results compared to the unsupervised learning. Such datasets are available for Hindi-English, Tamil-English, Malayalam-English, Bengali-English, German-English, Spanish-English, Japanese-English, Arabic-English etc. Though our research is concentrated towards NLP for emotion and sentiment detection of Tulu, a vibrant south Indian language, to start with, we build the first ever platinum standard corpus for NLP applications of code-diverse text in Tulu-English, as there is no such resource in our native language. The performance analysis of our dataset through Krippendorff’s Alpha value of 0.9 indicates that it is a benchmark in development of Automatic Sentiment Analysis system for Tulu.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115498151","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 : 2021-12-15DOI: 10.1109/ACTS53447.2021.9708221
Bibekananda Panda, Poonam Singh
Non-Orthogonal Multiple Access (NOMA) is an effective innovation for fifth-generation and forthcoming wireless technology. NOMA aims to encounter the challenges of low latency, high accuracy, large availability, and peak performance. In this paper, the performance mechanisms of NOMA are discussed as compared to Orthogonal Multiple Access (OMA), and also for different user (far and near) scenarios. The techniques such as Heterogeneous Network (HetNet), Ultra-Reliable Low-Latency Communication (URLLC), and other 5G evolving technologies are highlighted for improved performance in the NOMA system. The simulation results are carried out to analyze the achievable capacity of OMA and NOMA, BER analysis, and sum-rate analysis of NOMA systems over Rayleigh and Rician fading channels. The simulation results reveal that the Rician fading channels have better performance than Rayleigh fading channels. This article also discusses potential research challenges as well as addressing current and future issues in NOMA.
{"title":"Performance Analysis of NOMA Systems in Rayleigh and Rician Fading Channels","authors":"Bibekananda Panda, Poonam Singh","doi":"10.1109/ACTS53447.2021.9708221","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708221","url":null,"abstract":"Non-Orthogonal Multiple Access (NOMA) is an effective innovation for fifth-generation and forthcoming wireless technology. NOMA aims to encounter the challenges of low latency, high accuracy, large availability, and peak performance. In this paper, the performance mechanisms of NOMA are discussed as compared to Orthogonal Multiple Access (OMA), and also for different user (far and near) scenarios. The techniques such as Heterogeneous Network (HetNet), Ultra-Reliable Low-Latency Communication (URLLC), and other 5G evolving technologies are highlighted for improved performance in the NOMA system. The simulation results are carried out to analyze the achievable capacity of OMA and NOMA, BER analysis, and sum-rate analysis of NOMA systems over Rayleigh and Rician fading channels. The simulation results reveal that the Rician fading channels have better performance than Rayleigh fading channels. This article also discusses potential research challenges as well as addressing current and future issues in NOMA.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121122985","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 : 2021-12-15DOI: 10.1109/ACTS53447.2021.9708330
Abhijit Mishra, U. K. Sahoo, S. Maiti
The increase in demand of detecting obstructions in a wireless medium without attaching any device with the target is well facilitated by the Radio Tomographic Imaging (RTI) system. Even though it is a promising technique it is a cumbersome task to get the exact position and shape of an object due to ill-posed nature of RTI system. Thus vital task is to effectively choose a regularization technique that not only enhances sparsity by reducing noise after detection but also preserves edges of the object with its appropriate shape by using a heuristic weight model. RTI facilitates us with an imaging vector indicating the loss fields created by obstacles in the medium having knowledge of received signal strength(RSS) values and a weight model that assigns weight to the attenuated pixels in a wireless network. This paper addresses the above-mentioned problem by using a fused lasso regularization via ADMM. The second part of the paper extends performance of fused lasso regularization by implementing it incrementally using distributed learning. The performance metrics shows that fused lasso regularization not only reduces the noise level by increasing the sparsity but also retains the sharp features of the object.
{"title":"Sparsity based Radio Tomographic Imaging using Fused Lasso Regularization","authors":"Abhijit Mishra, U. K. Sahoo, S. Maiti","doi":"10.1109/ACTS53447.2021.9708330","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708330","url":null,"abstract":"The increase in demand of detecting obstructions in a wireless medium without attaching any device with the target is well facilitated by the Radio Tomographic Imaging (RTI) system. Even though it is a promising technique it is a cumbersome task to get the exact position and shape of an object due to ill-posed nature of RTI system. Thus vital task is to effectively choose a regularization technique that not only enhances sparsity by reducing noise after detection but also preserves edges of the object with its appropriate shape by using a heuristic weight model. RTI facilitates us with an imaging vector indicating the loss fields created by obstacles in the medium having knowledge of received signal strength(RSS) values and a weight model that assigns weight to the attenuated pixels in a wireless network. This paper addresses the above-mentioned problem by using a fused lasso regularization via ADMM. The second part of the paper extends performance of fused lasso regularization by implementing it incrementally using distributed learning. The performance metrics shows that fused lasso regularization not only reduces the noise level by increasing the sparsity but also retains the sharp features of the object.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121522082","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 : 2021-12-15DOI: 10.1109/ACTS53447.2021.9708380
Abhishek Kumar, D. Upadhyay
This paper proposes compact quint-passband filter (QPF) having a Low passband (LP) and four Bandpass passbands (BPs). The QPF is implemented using four Composite right/left-handed open-end folded stubs (CRLH-OEFS) loaded on the main transmission line. In the LP region, the measured insertion loss is less than 0.56 dB. Four BPs show measured insertion loss less than 0.9 dB, 0.88 dB, 0.93 dB and 1.25 dB. Measured 3 dB cut-off frequency of the LP region is 0.61 GHz. The four BPs with center frequency 1.87, 3.61, 5.3 and 6.5 GHz have 3 dB fractional bandwidth of 44, 10.8, 4.5 and 4.46, respectively. The transmission zeros (TZs) observed at 0.67 GHz, 0.95 GHz, 2.65 GHz, 3.83 GHz, 3.98 GHz, 6.11 GHz and 7.3 GHz have insertion loss of 31 dB, 47 dB, 22 dB, 31 dB, 43 dB, 45 dB and 21 dB, respectively. A parametric analysis of the QPF’s physical parameters and modelling of the filter’s equivalent LC circuit is presented in this paper. The proposed QPF shows a small footprint (0.098 λg × 0.051 λg, where λg is the guided wavelength of the 50 Ω microstrip line at 0.61 GHz), good rejections with insertion loss of 31 dB, 47 dB, 22 dB, 31 dB, 43 dB, 45 dB and 21 dB at respective TZs and a sharp transition due to the creation of seven TZs between LP and BP responses.
{"title":"A Compact Planar Quint-Passband Lowpass-Bandpass Filter Using Open-End Folded Stub CRLH-TLs","authors":"Abhishek Kumar, D. Upadhyay","doi":"10.1109/ACTS53447.2021.9708380","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708380","url":null,"abstract":"This paper proposes compact quint-passband filter (QPF) having a Low passband (LP) and four Bandpass passbands (BPs). The QPF is implemented using four Composite right/left-handed open-end folded stubs (CRLH-OEFS) loaded on the main transmission line. In the LP region, the measured insertion loss is less than 0.56 dB. Four BPs show measured insertion loss less than 0.9 dB, 0.88 dB, 0.93 dB and 1.25 dB. Measured 3 dB cut-off frequency of the LP region is 0.61 GHz. The four BPs with center frequency 1.87, 3.61, 5.3 and 6.5 GHz have 3 dB fractional bandwidth of 44, 10.8, 4.5 and 4.46, respectively. The transmission zeros (TZs) observed at 0.67 GHz, 0.95 GHz, 2.65 GHz, 3.83 GHz, 3.98 GHz, 6.11 GHz and 7.3 GHz have insertion loss of 31 dB, 47 dB, 22 dB, 31 dB, 43 dB, 45 dB and 21 dB, respectively. A parametric analysis of the QPF’s physical parameters and modelling of the filter’s equivalent LC circuit is presented in this paper. The proposed QPF shows a small footprint (0.098 λg × 0.051 λg, where λg is the guided wavelength of the 50 Ω microstrip line at 0.61 GHz), good rejections with insertion loss of 31 dB, 47 dB, 22 dB, 31 dB, 43 dB, 45 dB and 21 dB at respective TZs and a sharp transition due to the creation of seven TZs between LP and BP responses.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124153199","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 : 2021-12-15DOI: 10.1109/ACTS53447.2021.9708301
Aman Sanwal, Shekhar Singh, P. M. Pradhan
The 5G mobile networks aim to accomplish the austere requirements on data rates, reliability, and connectivity. In order to achieve these objectives, heterogeneous radio access technologies are used. In order to use the technology efficiently, massive connectivity of devices has been proposed in 3GPP Release 15. In the stand alone architecture, small base stations are deployed without any dependency on LTE core network. Increase in the number of devices will lead to an increase in signalling overhead consisting of tracking area update and paging overhead. This paper proposes an approach to reduce the signalling cost using clustering algorithm. The base stations form clusters using the proposed algorithm, and act as static cluster heads. The clustering algorithm is used to connect different types of User Equipments (UEs), including the vehicles, machines and various stationary IoT devices. In addition, this paper also deals with a hybrid scenario which represents the unification of both the layers (LTE and NR) for the initial rollout of the 5G to fill the coverage gaps. Simulation results show that the proposed scheme provides better performance in terms of reduced energy consumption by the UEs.
{"title":"Development of an Algorithm for Reducing Signalling Overhead Cost in 5G Networks","authors":"Aman Sanwal, Shekhar Singh, P. M. Pradhan","doi":"10.1109/ACTS53447.2021.9708301","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708301","url":null,"abstract":"The 5G mobile networks aim to accomplish the austere requirements on data rates, reliability, and connectivity. In order to achieve these objectives, heterogeneous radio access technologies are used. In order to use the technology efficiently, massive connectivity of devices has been proposed in 3GPP Release 15. In the stand alone architecture, small base stations are deployed without any dependency on LTE core network. Increase in the number of devices will lead to an increase in signalling overhead consisting of tracking area update and paging overhead. This paper proposes an approach to reduce the signalling cost using clustering algorithm. The base stations form clusters using the proposed algorithm, and act as static cluster heads. The clustering algorithm is used to connect different types of User Equipments (UEs), including the vehicles, machines and various stationary IoT devices. In addition, this paper also deals with a hybrid scenario which represents the unification of both the layers (LTE and NR) for the initial rollout of the 5G to fill the coverage gaps. Simulation results show that the proposed scheme provides better performance in terms of reduced energy consumption by the UEs.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124486328","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 : 2021-12-15DOI: 10.1109/ACTS53447.2021.9708264
Tarun Singhania, W. Arif, D. Sen
Bottleneck Bandwidth and Round-trip time (BBR) congestion control is the first congestion control to claim to operate at Kleinrock’s optimal operating point without filling up queues and high packet loss. Recent research on BBR revealed that inter protocol unfairness was observed in terms of bandwidth share due to the insignificant queue share occupied by loss based Congestion Control Algorithm (CCA) flows when bottleneck buffer size shared by the flows were less than two times the product of bandwidth and delay (BDP) for the bottleneck link. Also, when buffer sizes exceeded twice its BDP, the longer Round Trip Time (RTT) BBR flows dominated over shorter RTT BBR flows by grasping a greater portion of bottleneck link bandwidth (intra protocol unfairness). As inter protocol unfairness can cause other TCP variants to lose throughput and CUBIC is still one of the most widely used CCA’s, it is important to establish fairness. Inter protocol unfairness can currently allow latency cheating which allows individuals to add artificial latency to get a better share of bandwidth. In this paper, we present Bottleneck Bandwidth Buffer and Round-trip propagation time (B3R) which uses a modified BBR Congestion Control Algorithm (CCA) when operating under the above mentioned bottleneck buffer sizes to reduce inter/intra protocol unfairness. The results obtained after testing the algorithm are very encouraging; B3R improved inter protocol fairness by increasing CUBIC flows from 3% of bottleneck link bandwidth up to 31% and ensured complete intra B3R fairness for up to 4x RTT differences. B3R also helped reduce queue formation on the bottleneck by up to 50%
{"title":"Modelling and Analysis of Large Buffer Probe for B3R Congestion Control Algorithm","authors":"Tarun Singhania, W. Arif, D. Sen","doi":"10.1109/ACTS53447.2021.9708264","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708264","url":null,"abstract":"Bottleneck Bandwidth and Round-trip time (BBR) congestion control is the first congestion control to claim to operate at Kleinrock’s optimal operating point without filling up queues and high packet loss. Recent research on BBR revealed that inter protocol unfairness was observed in terms of bandwidth share due to the insignificant queue share occupied by loss based Congestion Control Algorithm (CCA) flows when bottleneck buffer size shared by the flows were less than two times the product of bandwidth and delay (BDP) for the bottleneck link. Also, when buffer sizes exceeded twice its BDP, the longer Round Trip Time (RTT) BBR flows dominated over shorter RTT BBR flows by grasping a greater portion of bottleneck link bandwidth (intra protocol unfairness). As inter protocol unfairness can cause other TCP variants to lose throughput and CUBIC is still one of the most widely used CCA’s, it is important to establish fairness. Inter protocol unfairness can currently allow latency cheating which allows individuals to add artificial latency to get a better share of bandwidth. In this paper, we present Bottleneck Bandwidth Buffer and Round-trip propagation time (B3R) which uses a modified BBR Congestion Control Algorithm (CCA) when operating under the above mentioned bottleneck buffer sizes to reduce inter/intra protocol unfairness. The results obtained after testing the algorithm are very encouraging; B3R improved inter protocol fairness by increasing CUBIC flows from 3% of bottleneck link bandwidth up to 31% and ensured complete intra B3R fairness for up to 4x RTT differences. B3R also helped reduce queue formation on the bottleneck by up to 50%","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130263339","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 : 2021-12-15DOI: 10.1109/ACTS53447.2021.9708099
V. C. S. R. Rayavarapu, A. Mahapatro
One of the foremost complex issues in the application of wireless sensors is locating the sensor. Most standard range-free localization methods ignore the anisotropy factors common in Wireless Sensor Networks (WSNs), resulting in low placement precision. This paper proposes a well-performing Sun Flower Optimization Algorithm (SFO) for implementing the range-free anchor-free localization using Distance Vector-Hop (DV-Hop) in WSN. The localization of unknown nodes in the network is possible using a new objective model under range-free and anchor-free scenarios. The localization accuracy tremendously enhances when differentiated from the conventional methods.
{"title":"A Novel Range-Free Anchor-Free Localization In WSN Using Sun Flower Optimization Algorithm","authors":"V. C. S. R. Rayavarapu, A. Mahapatro","doi":"10.1109/ACTS53447.2021.9708099","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708099","url":null,"abstract":"One of the foremost complex issues in the application of wireless sensors is locating the sensor. Most standard range-free localization methods ignore the anisotropy factors common in Wireless Sensor Networks (WSNs), resulting in low placement precision. This paper proposes a well-performing Sun Flower Optimization Algorithm (SFO) for implementing the range-free anchor-free localization using Distance Vector-Hop (DV-Hop) in WSN. The localization of unknown nodes in the network is possible using a new objective model under range-free and anchor-free scenarios. The localization accuracy tremendously enhances when differentiated from the conventional methods.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"26 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126016884","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 : 2021-12-15DOI: 10.1109/ACTS53447.2021.9707907
Iqra Masroor, J. A. Ansari, Amrees Pandey
In the present work, a compact Square Microstrip Patch Antenna (SMPA) is reconfigured in frequency. The switching element used for antenna reconfiguration is a single PIN diode modeled on High Frequency Structure Simulator (HFSS) software. The ON/OFF switching configurations of the diode make the antenna capable of resonating at three different frequencies in the C-band (4–8 GHz): 5.3 GHz and 7.2 GHz in the OFF state and 6.3 GHz in the ON state. Inclusion of square fractal slots on the ground plane of the SMPA lead to considerable improvement in bandwidth.
{"title":"On the Frequency Reconfigurability of a Square Microstrip Patch Antenna With a Fractal Ground Plane","authors":"Iqra Masroor, J. A. Ansari, Amrees Pandey","doi":"10.1109/ACTS53447.2021.9707907","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9707907","url":null,"abstract":"In the present work, a compact Square Microstrip Patch Antenna (SMPA) is reconfigured in frequency. The switching element used for antenna reconfiguration is a single PIN diode modeled on High Frequency Structure Simulator (HFSS) software. The ON/OFF switching configurations of the diode make the antenna capable of resonating at three different frequencies in the C-band (4–8 GHz): 5.3 GHz and 7.2 GHz in the OFF state and 6.3 GHz in the ON state. Inclusion of square fractal slots on the ground plane of the SMPA lead to considerable improvement in bandwidth.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127364326","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}
Ultra-reliable low latency communication (URLLC) is one of the key services offered by the 5G wireless networks. This service type is characterized by stringent high reliability and low latency criteria, thus require efficient multiple access techniques to facilitate various mission-critical services. Non-orthogonal multiple access (NOMA) effectively enhances spectral efficiency and ensures fairness by exploiting the power allocation at receivers compared to orthogonal multiple access (OMA). Therefore, it becomes suitable for facilitating URLLC service. The addition of the cooperative relaying technique to NOMA can enhance the reliability of the data transmission. This motivated us to analyze the performance of cooperative NOMA (C-NOMA) for short packet URLLC data transmission. Hence, we have proposed a C-NOMA based system using the decode and forward (DF) relaying technique and successive interference cancellation (SIC) at the receiver to minimize the overall error probability for URLLC. The minimization of overall outage probability has been achieved by optimizing power allocation at the receiver considering the decoding error and error due to queuing delay violation while ensuring fair throughput among users. The simulation study has shown that the proposed C-NOMA based short packet transmission improves overall outage probability, energy efficiency, and ensures fair throughput among users in comparison to only NOMA and OMA based techniques.
{"title":"Improved outage performance with power optimization for URLLC using Cooperative NOMA","authors":"Annapurna Pradhan, Susmita Das, Shaktimaan Debendra Pratap","doi":"10.1109/ACTS53447.2021.9708102","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708102","url":null,"abstract":"Ultra-reliable low latency communication (URLLC) is one of the key services offered by the 5G wireless networks. This service type is characterized by stringent high reliability and low latency criteria, thus require efficient multiple access techniques to facilitate various mission-critical services. Non-orthogonal multiple access (NOMA) effectively enhances spectral efficiency and ensures fairness by exploiting the power allocation at receivers compared to orthogonal multiple access (OMA). Therefore, it becomes suitable for facilitating URLLC service. The addition of the cooperative relaying technique to NOMA can enhance the reliability of the data transmission. This motivated us to analyze the performance of cooperative NOMA (C-NOMA) for short packet URLLC data transmission. Hence, we have proposed a C-NOMA based system using the decode and forward (DF) relaying technique and successive interference cancellation (SIC) at the receiver to minimize the overall error probability for URLLC. The minimization of overall outage probability has been achieved by optimizing power allocation at the receiver considering the decoding error and error due to queuing delay violation while ensuring fair throughput among users. The simulation study has shown that the proposed C-NOMA based short packet transmission improves overall outage probability, energy efficiency, and ensures fair throughput among users in comparison to only NOMA and OMA based techniques.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125935838","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 : 2021-12-15DOI: 10.1109/ACTS53447.2021.9708107
Shubham Dwivedi, Tripti Goel, Rahul Sharma, R. Murugan
Alzheimer’s Disease (AD) is a prevalent, irreversible, chronic, and progressive disease leading to structural changes in the brain, causing the cognitive decline of brain function. Early detection of AD before clinical manifestation is crucial for patient care, effective therapeutic measures, and cost-saving. To address the challenge of timely diagnosis, in this paper, we designed a 3D-CNN framework with SVM as a classifier to harness the advantages of both Deep learning (DL) and Machine learning (ML). Experiments on AD neuroimaging initiative (ADNI) dataset yields fair 91.85% accuracy, 95.56% sensitivity, 90% specificity, 82.69% precision, and 88.66% f-score exhibiting the SVM outperformance over other ML classifiers. Thus, the proposed model is effective for the prognosis of AD and can be incorporated in healthcare.
{"title":"Structural MRI based Alzheimer’s Disease prognosis using 3D Convolutional Neural Network and Support Vector Machine","authors":"Shubham Dwivedi, Tripti Goel, Rahul Sharma, R. Murugan","doi":"10.1109/ACTS53447.2021.9708107","DOIUrl":"https://doi.org/10.1109/ACTS53447.2021.9708107","url":null,"abstract":"Alzheimer’s Disease (AD) is a prevalent, irreversible, chronic, and progressive disease leading to structural changes in the brain, causing the cognitive decline of brain function. Early detection of AD before clinical manifestation is crucial for patient care, effective therapeutic measures, and cost-saving. To address the challenge of timely diagnosis, in this paper, we designed a 3D-CNN framework with SVM as a classifier to harness the advantages of both Deep learning (DL) and Machine learning (ML). Experiments on AD neuroimaging initiative (ADNI) dataset yields fair 91.85% accuracy, 95.56% sensitivity, 90% specificity, 82.69% precision, and 88.66% f-score exhibiting the SVM outperformance over other ML classifiers. Thus, the proposed model is effective for the prognosis of AD and can be incorporated in healthcare.","PeriodicalId":201741,"journal":{"name":"2021 Advanced Communication Technologies and Signal Processing (ACTS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124295800","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
扫码关注我们
求助内容：
应助结果提醒方式：