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

{"title":"Fully Homomorphic Encryption based Privacy-Preserving Data Acquisition and Computation for Contact Tracing","authors":"K. Sinha, P. Majumder, S. K. Ghosh","doi":"10.1109/ANTS50601.2020.9342834","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342834","url":null,"abstract":"For public health surveillance systems, privacy is a major issue in storing and sharing of personal medical data. Often, patients and organizations are unwilling to divulge personal medical data for fear of compromising their privacy because although the data may be encrypted, the encrypted values typically need to be first decrypted to perform any computation on the data. Unfortunately, such a barrier in easy sharing of data can severely hamper the ability to respond in a timely and effective manner to a crisis scenario, as evident in the case of the ongoing COVID-19 pandemic. To overcome this critical obstacle, we propose in this paper a novel privacy-preserving encryption mechanism for storage and computation of sensitive healthcare data. Our scheme is based on the use of a secure fully homomorphic encryption scheme, so that the required computations can be performed directly on the encrypted data values without the need for any decryption. The ability to execute queries or computation directly on encrypted data, without the need for decryption, is not present in any existing public-health surveillance system. We propose a novel computational model and also develop an algorithm for contact tracing with COVID-19 pandemic as a case study. We have simulated our proposed approach using the ElGamal encryption algorithm to check the correctness and effectiveness of our proposed approach. The results show that our proposed solution is effective in providing adequate security while supporting the computational needs for contact-tracing. Besides contact-tracing, our new data-encryption technique can have a much broader impact in the field of healthcare. By executing queries or computations directly on encrypted data, our innovative solution would make the sharing of data in healthcare-related research and industry significantly simpler and faster. The use of such a data encryption scheme to store and transmit sensitive healthcare data over a network can not only allay the fear of compromising sensitive information but also ensure HIPAA-compliance.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126165446","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}

{"title":"Low Complexity Convolutional Neural Networks for Wireless Receiver Chain Optimization","authors":"Marjan Radi, E. Matús, G. Fettweis","doi":"10.1109/ANTS50601.2020.9342807","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342807","url":null,"abstract":"Technologies for 5G and beyond open up new chances for enabling new applications, which leads to an increasing variety of requirements, possible scenarios, and possible engineering decisions for wireless systems. Thus, having dynamic and robust techniques that can adapt to this huge variety has become more important than ever. One of the challenging adaptations is to select the most appropriate receiver architecture i.e. the architecture that gives the required performance with the least possible complexity, while modifying it dynamically based on the effects of having an instantaneous mix of a data sequence, channel effects, noise, and transmitter/receiver chains imperfections and impairments. One of the most innovative techniques is using convolutional neural networks (CNNs) as an initial pre-process that is capable of predicting the best receiver architecture. The technique depends on using offline pre-trained CNNs that can classify every incoming packet dynamically and assign it to the most appropriate receiver architecture. The technique shows high performance and accuracy that leads to higher certainty of the required resources and processing time, and consequently, better scheduling for the processes in the available receiver architectures and processing elements. Despite that, the technique adds an extra complexity due to the added CNNs. Although CNNs operations as multiplications have lower complexity than the operations in the receiver blocks, the added complexity due to using the CNNs is so high that they lead to total higher complexity than just using a higher complexity receiver in many cases.Here we propose a low complexity approach that gives an equivalent performance of the state of the art technique. Our approach here depends on reducing the size of the used CNNs by introducing parts of the incoming packet to the input layers of the CNNs instead of introducing the whole packet as in literature state of art, which reduces the added complexity due to the CNNs while keeping the advantage of the pre-knowledge of the required resources and the corresponding processing time. We show different approaches of how to extract enough information from the packet without the need to use all of it as input for the CNN, and analyzing the performance for every approach; then showing the total complexity reduction due to our new proposal.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115111755","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}

{"title":"Robust Maximum Likelihood Algorithm-based Mitigation technique for impulsive noise in MIMO-OFDM systems","authors":"S. Girija, R. Rao","doi":"10.1109/ANTS50601.2020.9342789","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342789","url":null,"abstract":"Non-Gaussian impulsive noise impacts the equalizers and signal detectors directly in the wireless system. The major problem in the multiple-input multiple-output (MIMO)-related applications is the blind source equalization and separation, where the users transmit multiple digital signals in a linear channel that is received using the array of antennas. The noise in the received signals is impulsive in nature, which is mitigated in the research by implementing the Robust Maximum Likelihood Algorithm (RMLA) for handling the degradation of the performance in the wireless system. The constant modulus cost function formulated using RMLA is used for modeling the equalizer to adaptively suppress the influence of the impulsive noise. The effectiveness of the proposed RMLA based impulse noise mitigation is evaluated based on the evaluation metrics, such as Bit Error Rate (BER), Mean Square Error (MSE), and Symbol Error Rate (SER) corresponding to the Signal-to-Noise Ratio (SNR) and dissimilar antenna array size. The proposed RMLA based BE method provided minimum BER values of 0.0021, 0.0044, 0.0142, and minimum MSE value of 0.0006, 0.0012, and 0.0037 with the Rayleigh channel, minimum BER values of 0.0006, 0.0012, and 0.0013, and minimum MSE value of 0.0003 with the Rician channel.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128655235","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}

{"title":"A CPW-fed Super Wideband Dielectric Resonator Antenna","authors":"Sachin Agrawal","doi":"10.1109/ANTS50601.2020.9342823","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342823","url":null,"abstract":"In this paper, a coplanar waveguide (CPW)-fed super wideband (SWB) dielectric resonator antenna (DRA) is proposed. It consists of a rectangular DR situated at the center of the rectangular slot both excited by a tapered feedline. In addition, a circular stub is added at the top portion of the feed in such a way that it excites the DR efficiently. From simulation results, it is found that the presence of DR in the proposed antenna design improves the impedance matching throughout the band and hence enhances the impedance bandwidth by downshifting the lower cutoff frequency from 3 GHz to 1 GHz. It is observed that the proposed antenna achieved an impedance bandwidth of more than 175% ranging from 1 GHz to 15 GHz with a bandwidth ratio of more than 15:1. Besides, it is investigated that the presence of DR raises the peak gain from -5.6 dBi to 1.24 dBi at 1 GHz. It achieved a maximum gain of 7.2 dBi at 5.1 GHz. Further, the proposed antenna exhibits an almost stable radiation pattern in the entire frequency range.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129081621","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}

{"title":"Cost-efficient Mobile Backhaul Network Design over TWDM-PON","authors":"Md Shahbaz Akhtar, Pramit Biswas, Aneek Adhya, S. Majhi","doi":"10.1109/ANTS50601.2020.9342831","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342831","url":null,"abstract":"In recent times, time and wavelength division multiplexed passive optical networks (TWDM-PONs) are recognized as promising transport network technology for mobile backhaul design. TWDM-PON is a multi-wavelength PON technology that offers high reliability, low maintenance cost, high capacity, and long transmission reach. In this paper, we propose a recursive clustering algorithm (RCA) to design cost-efficient TWDM-PON architecture for providing backhaul connectivity to the macro-cell base stations (BSs). Based on the geographical locations of BSs, RCA explores the optimal number of BS clusters, the size of each cluster, the most suitable location of remote nodes for passive device placement, and the best fiber route from operator’s central office to the BS’s locations. The primary objective is to reduce the total cost by minimizing the total length of deployed fibers. We also employ cable-conduit sharing, where the cable-conduits deployed for existing fiber links are utilized to place a new fiber link. We introduce two-stage cable-conduit sharing to maximize sharing of cable-conduits for last-mile fiber and distribution fiber so as to further tune down the cost. We compare the performance of our proposed RCA scheme with the existing benchmark studies, viz., BS clustering technique and random-cut sectoring approach. The simulation result confirms that our scheme substantially reduces the backhauling cost compared with the existing studies.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129169151","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}

{"title":"Real-time Spatio-Temporal based Outlier Detection Framework for Wireless Body Sensor Networks","authors":"Ali Hassan, Carol Habib, Jad Nassar","doi":"10.1109/ANTS50601.2020.9342827","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342827","url":null,"abstract":"Wireless body sensor networks (WBSNs) are threatened by many issues like anomalies in collected data and failure in their hardware components. An outlier detection approach applied on online monitoring of vital signs can both prevent collection of outlier data and detect emergent health degradation. In this paper, we propose an outlier detection framework for real time sensed data by WBSNs. Our proposed solution is twofold: Robust z score algorithm is executed at first step on the sensor nodes level to detect abnormal values and send them to the coordinator. After that, Isolation Forest is executed at the coordinator to distinguish between a faulty measurement and a critical health state. Correlation among vital signs are exploited to differentiate between an emergent healthy event and an anomaly in the measured data. Experiments conducted on real physiological datasets show that our proposed method is able to achieve a good detection accuracy with a low false alarm rate. Complexity and energy efficiency studies demonstrate the low complexity and lightness of our proposed solution.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":" November","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113946966","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}

{"title":"Two Laser Selection Scheme for FSO Communication","authors":"Pranav Sharda, Anshul Jaiswal, M. Bhatnagar, A. Garg","doi":"10.1109/ANTS50601.2020.9342770","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342770","url":null,"abstract":"In order to send the information bits, a conventional transmit laser selection (CTLS) scheme selects the best transmit aperture. Due to the optimal transmit aperture selection, CTLS offers the best possible error performance in a free-space optical (FSO) communication system. Moreover, this optimal error performance is observed under the perfect feedback link scenario. However, a slight error in the feedback information can cause a significant loss in the diversity order. This deteriorates the error performance. To overcome this problem, we propose and analyze a novel grouping-based TLS scheme, called two TLS (TTLS) scheme. In the proposed TTLS scheme, the transmit apertures are divided into two groups and the best aperture in each group is used for transmission of the data. Furthermore, it is observed by the intensive analysis that the proposed TTLS scheme offers a lesser loss in the diversity order as compared to CTLS under the erroneous/imperfect feedback link. Therefore, a significant amount of performance gain can be achieved by the proposed TTLS scheme as compared to the CTLS scheme under a practical (erroneous feedback) scenario.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127556630","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}

{"title":"Millimeter Wave Wireless System Modeling with Best Channel Selection Policy","authors":"Tooba Mukarram, K. Shrivastava, B. Sainath","doi":"10.1109/ANTS50601.2020.9342836","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342836","url":null,"abstract":"Millimeter-wave (mmWave) technology is one of the most popular enabling technologies in the fifth-generation and beyond wireless systems. MmWave technology provides substantial extra bandwidth to address high data rate requirements for various terrestrial mobile systems. High propagation attenuation and channel fading are the main challenges of mmWave communication. In this paper, we consider mmWave non-cooperative and cooperative system models and propose the best mmWave channel selection policy (BMCSP). For these two systems, we study the performance of the proposed BMCSP. Specifically, we present useful mathematical analysis for the average spectral efficiency (SE) of both non-cooperative and cooperative mmWave systems in the Nakagami fading scenario. To quantify the gains delivered by BMSCP, we compare its average SE performance with that of the randomly selected channel. We find that the proposed policy provides superior performance in terms of average spectral efficiency.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"55 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125970248","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}

{"title":"Interference-Constrained Power Adaptive Decode-and-Forward Relaying Policy: Design and Performance Analysis","authors":"Rahul Sharma, Sainath Bitragunta","doi":"10.1109/ANTS50601.2020.9342802","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342802","url":null,"abstract":"Power adaptation is a feasible and promising solution to avoid interference at the primary, caused by transmissions of secondary underlay cooperative spectrum sharing systems. For it, we propose a novel interference-constrained power adaptive decode-and-forward (IC-PADnF) relaying policy jointly with a simple probabilistic relay selection (PRS) policy. The proposed IC-PADnF relaying policy, apart from acting as a regenerative relay, adaptively sets its transmit power and gain to optimize the underlay cooperative spectrum sharing system’s performance. Further, the relay selection policy is easy to implement due to less channel state information (CSI) requirements. To evaluate the proposed IC-PADnF policy’s performance, we derive analytical expressions for optimal fading averaged spectral efficiency and optimal fading averaged energy efficiency. We also obtain upperbound to these essential performance measures. We perform Monte-Carlo simulations to validate the derived analytical results. Furthermore, we compared the proposed policy with benchmark policies to explicitly show the performance improvements and its applicability for cooperative spectrum sharing systems and networks. Lastly, we find that IC-PADnF relaying policy jointly with PRS policy outperforms the benchmark policies.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131534760","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}

{"title":"PPSE: Privacy Preservation and Security Efficient AKA Protocol for 5G Communication Networks","authors":"Balu L. Parne, Shubham Gupta, Kaneesha J. Gandhi, S. Meena","doi":"10.1109/ANTS50601.2020.9342780","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342780","url":null,"abstract":"The authentication and key agreement (AKA) protocol strengthens the security of mobile communication networks. The 5G-AKA protocol is standardized by the 3rd generation partnership project (3GPP) for future mobile communication networks. However, it is observed that this protocol is vulnerable to numerous security weaknesses. Moreover, the protocol suffers from huge computation and communication overhead. To overcome these issues, several AKA protocols were introduced by the researchers. However, none of the protocols took care of the identity preservation and single key disclosure issue over the communication channel. In this article, we propose the Privacy Preservation and Security Efficient (PPSE-AKA) protocol that preserves the user’s identity and protects the shared secret key. The mutual authentication is formally verified by using the AVISPA tool. The security analysis demonstrates that the protocol fulfills all the privacy requirements and dodges the potential attacks. The performance of the protocol is evaluated for the previously established schemes and observed that the PPSE-AKA protocol exhibits a cutting edge competition to them.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132914240","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}