Pub Date : 2023-03-03DOI: 10.1109/RAIT57693.2023.10126943
Ishita Srivastava, Aryaman Raj, Daya Sagar Gupta
The use of Blockchain for consistent storage, management, and sharing of healthcare records has received a lot of recent attention as a more reliable and dependable alternative to cloud-based storage. With the potential of Blockchain technology in the health sector being explored, its practical applications in real-world healthcare scenarios on a large scale are facing challenges like scalability, the authenticity of records, and management of dynamic consent of the patients for data access and sharing of medical records. The paper describes the implementation of a secured and efficient system for the storage of medical records on the Blockchain. The proposed implementation focuses on scalability, the authenticity of medical records, data privacy, and controlled access and uses Proof-of-Authority as a consensus algorithm on a Permissioned-Blockchain and two-factor authentication through a smart card. The paper also introduces a constant-time searching algorithm for faster records retrieval of Electronic Health Records. While the Proof-of-Authority consensus mechanism resolves the scalability issues, the smart card acts as the access control token, that ensures data privacy and makes it convenient for the users to operate.
{"title":"Blockchain-based Secure Storage and Management of Electronic Health Record using a Smart Card","authors":"Ishita Srivastava, Aryaman Raj, Daya Sagar Gupta","doi":"10.1109/RAIT57693.2023.10126943","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10126943","url":null,"abstract":"The use of Blockchain for consistent storage, management, and sharing of healthcare records has received a lot of recent attention as a more reliable and dependable alternative to cloud-based storage. With the potential of Blockchain technology in the health sector being explored, its practical applications in real-world healthcare scenarios on a large scale are facing challenges like scalability, the authenticity of records, and management of dynamic consent of the patients for data access and sharing of medical records. The paper describes the implementation of a secured and efficient system for the storage of medical records on the Blockchain. The proposed implementation focuses on scalability, the authenticity of medical records, data privacy, and controlled access and uses Proof-of-Authority as a consensus algorithm on a Permissioned-Blockchain and two-factor authentication through a smart card. The paper also introduces a constant-time searching algorithm for faster records retrieval of Electronic Health Records. While the Proof-of-Authority consensus mechanism resolves the scalability issues, the smart card acts as the access control token, that ensures data privacy and makes it convenient for the users to operate.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129022626","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10127011
M. V. D. B. Anjaneya, M. Basiri
Digital to Analog Converters (DACs) have a good scope of application due to their easily implementable design structure, higher resolution, and accuracy. They are used in digital signal processing devices, digital power supplies for micro-controllers, digital potentiometers, and digital data acquisition systems. In this paper, we proposed high throughput circuit designs that perform multiple DAC operations in parallel with various resolution using the same hardware. The generated high throughput designs can be configured with the control line to perform four 2-bit, two 4-bit, and one 8-bit DAC operations. The throughput of the resistive ladder type DAC is increased by 95.70%, while that of weighted resistor type DAC is increased by 98% using the proposed hardware designs. All the proposed and existing designs are implemented with 90 nm CMOS library in Cadence Virtuoso.
{"title":"High Throughput Circuit Designs of Digital to Analog Converter","authors":"M. V. D. B. Anjaneya, M. Basiri","doi":"10.1109/RAIT57693.2023.10127011","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10127011","url":null,"abstract":"Digital to Analog Converters (DACs) have a good scope of application due to their easily implementable design structure, higher resolution, and accuracy. They are used in digital signal processing devices, digital power supplies for micro-controllers, digital potentiometers, and digital data acquisition systems. In this paper, we proposed high throughput circuit designs that perform multiple DAC operations in parallel with various resolution using the same hardware. The generated high throughput designs can be configured with the control line to perform four 2-bit, two 4-bit, and one 8-bit DAC operations. The throughput of the resistive ladder type DAC is increased by 95.70%, while that of weighted resistor type DAC is increased by 98% using the proposed hardware designs. All the proposed and existing designs are implemented with 90 nm CMOS library in Cadence Virtuoso.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123834472","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10126982
Amit Kumar Dhar, B. Gorain, Madhuri Mahawar
Time variant coverage, called sweep coverage in wireless sensor networks has got attention from various re-searchers in recent time. In this problem, a set of mobile sensors are collectively monitoring certain area of interest (AoI). In various applications periodic monitoring of the AoI is sufficient. For a given time period, the objective of the sweep coverage problem is to find minimum number of mobile sensors so that the periodic monitoring can be guaranteed. This problem has been studied by various researchers in the context of point, area and barrier coverage problems. The sweep coverage problem on a graph is studied in [11]. In this problem, for a given input graph, minimum number of mobile sensors must be deployed such a way that all nodes of the graph must be visited by at least one mobile sensor. The sweep coverage problem is NP-hard and can not be approximated within a factor of 2 [16]. In this paper, we propose a fault-tolerant sweep coverage algorithm. For a given integer, using our proposed algorithm, the non-faulty sensors adjusted their movement and guarantees sweep coverage of all the nodes of an undirected weighted graph if at most sensors becomes faulty.
{"title":"Sweep Coverage with Faults","authors":"Amit Kumar Dhar, B. Gorain, Madhuri Mahawar","doi":"10.1109/RAIT57693.2023.10126982","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10126982","url":null,"abstract":"Time variant coverage, called sweep coverage in wireless sensor networks has got attention from various re-searchers in recent time. In this problem, a set of mobile sensors are collectively monitoring certain area of interest (AoI). In various applications periodic monitoring of the AoI is sufficient. For a given time period, the objective of the sweep coverage problem is to find minimum number of mobile sensors so that the periodic monitoring can be guaranteed. This problem has been studied by various researchers in the context of point, area and barrier coverage problems. The sweep coverage problem on a graph is studied in [11]. In this problem, for a given input graph, minimum number of mobile sensors must be deployed such a way that all nodes of the graph must be visited by at least one mobile sensor. The sweep coverage problem is NP-hard and can not be approximated within a factor of 2 [16]. In this paper, we propose a fault-tolerant sweep coverage algorithm. For a given integer, using our proposed algorithm, the non-faulty sensors adjusted their movement and guarantees sweep coverage of all the nodes of an undirected weighted graph if at most sensors becomes faulty.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131103580","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10126785
Shivalasya Chinthala, M. Basiri
Analog to Digital Converters (ADCs) have a good scope of application due to their high reliability, speed, band-width, and resolution. They are used in digital signal processing devices, satellite communications, digital storage oscilloscopes, micro-controllers, RADAR processing, and digital multimeters. In this paper, we propose a high throughput circuit design that performs multiple ADC operations in parallel by using the same hardware. The proposed high throughput design can be configured with a control line to perform one 3-bit operation or two 2-bit operations in parallel. The throughput of the 3-bit Flash Type conventional ADC is increased by 10 times using the proposed hardware design. All the proposed and conventional designs are implemented with 90 nm CMOS library in Cadence Virtuoso.
{"title":"High Throughput Circuit Design of Flash Type Analog to Digital Converter","authors":"Shivalasya Chinthala, M. Basiri","doi":"10.1109/RAIT57693.2023.10126785","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10126785","url":null,"abstract":"Analog to Digital Converters (ADCs) have a good scope of application due to their high reliability, speed, band-width, and resolution. They are used in digital signal processing devices, satellite communications, digital storage oscilloscopes, micro-controllers, RADAR processing, and digital multimeters. In this paper, we propose a high throughput circuit design that performs multiple ADC operations in parallel by using the same hardware. The proposed high throughput design can be configured with a control line to perform one 3-bit operation or two 2-bit operations in parallel. The throughput of the 3-bit Flash Type conventional ADC is increased by 10 times using the proposed hardware design. All the proposed and conventional designs are implemented with 90 nm CMOS library in Cadence Virtuoso.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131686442","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10126898
R. Raj, Mohona Ghosh
Internet of Things (IoT)-based applications are making a big impact in various sectors of our daily life, like smart cities, smart healthcare, smart industries, etc. IoT networks usually require a centralized server or certain authorities to manage and control devices scattered over the network. As a result of centralized management, IoT network security is put at risk. By integrating blockchain technology with IoT, we can create a decentralized and secure network. However, traditional blockchain implementation on IoT devices is not the best solution. It requires high computational capacity to achieve consensus over data communicated among devices, which is not feasible for resource constraint IoT devices. Furthermore, the data generated by IoT devices is massive, making it impossible to keep in blockchain after a certain point. Several models have been proposed in the literature to address these challenges. In 2021, Fusion Chain was proposed as a lightweight blockchain framework that was shown to be the lightest of all models. However, this model is not secure. In this paper, we highlight the various security issues within this framework. We then propose a secure version of Fusion chain, termed Fusion Chain-S, that overcomes these security issues and also provides enhanced storage and access policies for every data element. Also, to make it fault-tolerant, we have used COAP (Constrained Application Protocol) as an integrity channel. We provide a comprehensive security analysis of our framework and prove it using BAN logic. To the best of our knowledge, our improved model is the most lightweight and secure among the other peer models.
{"title":"A Lightweight Blockchain Framework for secure transaction in resource constrained IoT devices","authors":"R. Raj, Mohona Ghosh","doi":"10.1109/RAIT57693.2023.10126898","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10126898","url":null,"abstract":"Internet of Things (IoT)-based applications are making a big impact in various sectors of our daily life, like smart cities, smart healthcare, smart industries, etc. IoT networks usually require a centralized server or certain authorities to manage and control devices scattered over the network. As a result of centralized management, IoT network security is put at risk. By integrating blockchain technology with IoT, we can create a decentralized and secure network. However, traditional blockchain implementation on IoT devices is not the best solution. It requires high computational capacity to achieve consensus over data communicated among devices, which is not feasible for resource constraint IoT devices. Furthermore, the data generated by IoT devices is massive, making it impossible to keep in blockchain after a certain point. Several models have been proposed in the literature to address these challenges. In 2021, Fusion Chain was proposed as a lightweight blockchain framework that was shown to be the lightest of all models. However, this model is not secure. In this paper, we highlight the various security issues within this framework. We then propose a secure version of Fusion chain, termed Fusion Chain-S, that overcomes these security issues and also provides enhanced storage and access policies for every data element. Also, to make it fault-tolerant, we have used COAP (Constrained Application Protocol) as an integrity channel. We provide a comprehensive security analysis of our framework and prove it using BAN logic. To the best of our knowledge, our improved model is the most lightweight and secure among the other peer models.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132041117","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10127102
Sayanti Ghosh, A. Bhowmick, Sanjay Dhar Roy, S. Kundu
An unmanned aerial vehicle (UAV) assisted communication is a promising technique for assisting ground users in a non-functional area (NFA) or disaster area. All the base stations (BSs) in the disaster area are partially or fully damaged due to the natural calamity. Device-to-device (D2D) communication can be a good solution for direct connection between users in an NFA. In this paper, we propose a UAV-assisted multi-hop D2D communication for a hybrid power-time switching (PTS). Moreover, a D2D user of a cluster can communicate with another D2D user in a different cluster through UAVs. However, D2D users can harvest energy from their respective ad-hoc energy stations and forward the information to the nearby D2D user following a hybrid PTS-based strategy. We have proposed a time frame for the same and shown a node-based energy harvesting strategy. The expressions of outage probability, and throughput, are developed for the Rician random variable. The impact of parameters such as energy harvesting factor and energy harvesting efficiency on the network performance is also indicated. A simulation model is developed in MATLAB to assess the performance.
{"title":"UAVs-assisted Multi-Hop D2D Communication using Hybrid PTS for disaster management","authors":"Sayanti Ghosh, A. Bhowmick, Sanjay Dhar Roy, S. Kundu","doi":"10.1109/RAIT57693.2023.10127102","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10127102","url":null,"abstract":"An unmanned aerial vehicle (UAV) assisted communication is a promising technique for assisting ground users in a non-functional area (NFA) or disaster area. All the base stations (BSs) in the disaster area are partially or fully damaged due to the natural calamity. Device-to-device (D2D) communication can be a good solution for direct connection between users in an NFA. In this paper, we propose a UAV-assisted multi-hop D2D communication for a hybrid power-time switching (PTS). Moreover, a D2D user of a cluster can communicate with another D2D user in a different cluster through UAVs. However, D2D users can harvest energy from their respective ad-hoc energy stations and forward the information to the nearby D2D user following a hybrid PTS-based strategy. We have proposed a time frame for the same and shown a node-based energy harvesting strategy. The expressions of outage probability, and throughput, are developed for the Rician random variable. The impact of parameters such as energy harvesting factor and energy harvesting efficiency on the network performance is also indicated. A simulation model is developed in MATLAB to assess the performance.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115663664","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10126826
Taniya Saini, Ashok Ajad, M. K. Niranjan
Knee osteoarthritis is a condition in which the knee's articular cartilage, which is a slippery material that normally protects bones from joint friction, degenerates and changes to the underneath of the cartilage. If detected early the degeneration can be slowed down. The severity is relied on for detection on the expertise of Physicians. In this paper, to automatically measure OA severity we discuss the usage of deep CNN as a tool to successively develop a system, that is based on a grading system known as Kallgren-Lawrence (KL-grading). In this approach the OA severity is predicted using the radiographic Images. The method of automatic prediction of knee OA severity comprises three steps. a) Automatic localization of the knee joints. b) Classification of the localized knee joints and c) Create the report summary for identified symptoms The CNN is trained from scratch on the X-ray images. Along with the development of severity prediction through localization and classification, we will be developing the method to automatic report generation that consists of the description of the finding from the radiographs.
{"title":"Deep Ensemble Architecture for Knee Osteoarthritis Severity Prediction and Report Generation*","authors":"Taniya Saini, Ashok Ajad, M. K. Niranjan","doi":"10.1109/RAIT57693.2023.10126826","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10126826","url":null,"abstract":"Knee osteoarthritis is a condition in which the knee's articular cartilage, which is a slippery material that normally protects bones from joint friction, degenerates and changes to the underneath of the cartilage. If detected early the degeneration can be slowed down. The severity is relied on for detection on the expertise of Physicians. In this paper, to automatically measure OA severity we discuss the usage of deep CNN as a tool to successively develop a system, that is based on a grading system known as Kallgren-Lawrence (KL-grading). In this approach the OA severity is predicted using the radiographic Images. The method of automatic prediction of knee OA severity comprises three steps. a) Automatic localization of the knee joints. b) Classification of the localized knee joints and c) Create the report summary for identified symptoms The CNN is trained from scratch on the X-ray images. Along with the development of severity prediction through localization and classification, we will be developing the method to automatic report generation that consists of the description of the finding from the radiographs.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122992781","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10126777
Ashi Agarwal, Seba Susan
The identification of human emotions from facial expressions is intriguing and challenging research given the subtle differences between certain emotions. Face masks are nowadays strongly recommended to minimize infection transmission due to Covid-19. Successful emotion identification from masked faces is challenging since the lower part of the face contributes significant cues for emotion identification. In this work, we investigate transfer learning using deep pre-trained networks for emotion recognition from masked faces. Specifically, we fine-tune the pre-trained models: - EfficientNet-BO, ResNet-50, Inception-v3, Xception and AlexNet, on the benchmark Facial Expression Recognition (FER) 2013 dataset containing seven categories of emotions, namely, angry, disgust, fear, happy, sad, surprise and neutral. The experiments reveal that the Inception-v3 model outperformed all other deep learning models and the machine learning models Support Vector Machine (SVM) and Artificial Neural Network (ANN), for facial emotion recognition from masked faces.
{"title":"Emotion Recognition from Masked Faces using Inception-v3","authors":"Ashi Agarwal, Seba Susan","doi":"10.1109/RAIT57693.2023.10126777","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10126777","url":null,"abstract":"The identification of human emotions from facial expressions is intriguing and challenging research given the subtle differences between certain emotions. Face masks are nowadays strongly recommended to minimize infection transmission due to Covid-19. Successful emotion identification from masked faces is challenging since the lower part of the face contributes significant cues for emotion identification. In this work, we investigate transfer learning using deep pre-trained networks for emotion recognition from masked faces. Specifically, we fine-tune the pre-trained models: - EfficientNet-BO, ResNet-50, Inception-v3, Xception and AlexNet, on the benchmark Facial Expression Recognition (FER) 2013 dataset containing seven categories of emotions, namely, angry, disgust, fear, happy, sad, surprise and neutral. The experiments reveal that the Inception-v3 model outperformed all other deep learning models and the machine learning models Support Vector Machine (SVM) and Artificial Neural Network (ANN), for facial emotion recognition from masked faces.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133478568","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10127014
Bobby Ramesh Addanki, Bhavani S Durga
Many heuristic algorithms have been proposed in the literature to solve the team formation problem. The researchers considered a project as a set of skills selected randomly from the given pool of skills. But this leads to a skewed distribution of skills in the projects with many skills having very few experts, which we term as rare skills. In this work, we create a realistic bench-mark dataset for this problem. In general, any project/task in the industry can be seen to have a good mix of popular as well as rare skills. We first conduct an empirical study of the distribution of popular skills vs rare skills in the well-known DBLP (Digital Bibliography & Library Project) data set. The distribution of popularity of skills is shown to satisfy a power law with a heavy tail, indicating the presence of a large number of skills with very few experts and a small number of highly popular skills. We build a realistic a benchmark dataset using stratified random sampling to form tasks with various distributions of popular and rare skills. The classical team formation algorithms are evaluated using this new benchmark dataset. The evaluation is done with respect to the available communication costs in the literature as well as the execution time incurred by the algorithms. It has been observed from the experiments that all the measures show lower values of communication cost for tasks having higher proportion of popular skills.
{"title":"Realistic Benchmark Datasets for Team Formation Problem in Social Networks","authors":"Bobby Ramesh Addanki, Bhavani S Durga","doi":"10.1109/RAIT57693.2023.10127014","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10127014","url":null,"abstract":"Many heuristic algorithms have been proposed in the literature to solve the team formation problem. The researchers considered a project as a set of skills selected randomly from the given pool of skills. But this leads to a skewed distribution of skills in the projects with many skills having very few experts, which we term as rare skills. In this work, we create a realistic bench-mark dataset for this problem. In general, any project/task in the industry can be seen to have a good mix of popular as well as rare skills. We first conduct an empirical study of the distribution of popular skills vs rare skills in the well-known DBLP (Digital Bibliography & Library Project) data set. The distribution of popularity of skills is shown to satisfy a power law with a heavy tail, indicating the presence of a large number of skills with very few experts and a small number of highly popular skills. We build a realistic a benchmark dataset using stratified random sampling to form tasks with various distributions of popular and rare skills. The classical team formation algorithms are evaluated using this new benchmark dataset. The evaluation is done with respect to the available communication costs in the literature as well as the execution time incurred by the algorithms. It has been observed from the experiments that all the measures show lower values of communication cost for tasks having higher proportion of popular skills.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"11 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114109485","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 : 2023-03-03DOI: 10.1109/RAIT57693.2023.10126578
A. Baranwal, Sanjay Dhar Roy, S. Kundu
In this paper, we evaluate the secrecy outage probability (SOP) of two user cooperative non-orthogonal multiple access (C-NOMA) network in the presence of a passive eavesdropper (E). The near user $(U_{1})$ harvests energy from the superimposed signal transmitted by source (S). The near user $(U_{1})$ acts as a relay and retransmits the message signal to a far user $(U_{2})$. The E eavesdrops the signal for $U_{1}$ and $U_{2}$ transmitted from $mathbf{S}$ and eavesdorp the signal of $U_{2}$ relayed from $U_{1}$. An MRC is applied at E on two copies of signals obtained for $U_{2}$. An analytical framework for evaluating SOP is presented. We obtain an analytical expression for SOP of $U_{1}$, while an analytical expression of SOP of $U_{2}$ at high SNR approximation is obtained. Impact of several netwrok parameters such as target secrecy rate, energy harvesting parameters on SOP is indicated. Our analytical results are supported by monte-carlo simulation carried out in MATLAB.
{"title":"Secrecy Outage Analysis of Energy Harvesting Enabled Two User Cooperative NOMA","authors":"A. Baranwal, Sanjay Dhar Roy, S. Kundu","doi":"10.1109/RAIT57693.2023.10126578","DOIUrl":"https://doi.org/10.1109/RAIT57693.2023.10126578","url":null,"abstract":"In this paper, we evaluate the secrecy outage probability (SOP) of two user cooperative non-orthogonal multiple access (C-NOMA) network in the presence of a passive eavesdropper (E). The near user <tex>$(U_{1})$</tex> harvests energy from the superimposed signal transmitted by source (S). The near user <tex>$(U_{1})$</tex> acts as a relay and retransmits the message signal to a far user <tex>$(U_{2})$</tex>. The E eavesdrops the signal for <tex>$U_{1}$</tex> and <tex>$U_{2}$</tex> transmitted from <tex>$mathbf{S}$</tex> and eavesdorp the signal of <tex>$U_{2}$</tex> relayed from <tex>$U_{1}$</tex>. An MRC is applied at E on two copies of signals obtained for <tex>$U_{2}$</tex>. An analytical framework for evaluating SOP is presented. We obtain an analytical expression for SOP of <tex>$U_{1}$</tex>, while an analytical expression of SOP of <tex>$U_{2}$</tex> at high SNR approximation is obtained. Impact of several netwrok parameters such as target secrecy rate, energy harvesting parameters on SOP is indicated. Our analytical results are supported by monte-carlo simulation carried out in MATLAB.","PeriodicalId":281845,"journal":{"name":"2023 5th International Conference on Recent Advances in Information Technology (RAIT)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121938884","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
扫码关注我们
求助内容：
应助结果提醒方式：