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

筛选
英文 中文
A Novel Server Selection Strategy for Multi-access Edge Computing 一种新的多访问边缘计算服务器选择策略
Gayan Dilanka, Lakshan Viranga, Rajitha Pamudith, Tharindu D. Gamage, Pasika Sashmal Ranaweera, Indika A. M. Balapuwaduge, Madhusanka Liyanage
{"title":"A Novel Server Selection Strategy for Multi-access Edge Computing","authors":"Gayan Dilanka, Lakshan Viranga, Rajitha Pamudith, Tharindu D. Gamage, Pasika Sashmal Ranaweera, Indika A. M. Balapuwaduge, Madhusanka Liyanage","doi":"10.1109/ANTS52808.2021.9936916","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9936916","url":null,"abstract":"To realize the 5G mobile technology evolution, Multi-access Edge Computing is quite essential. Bringing cloud services towards the edge of the mobile network produces ultra-low latency and higher bandwidths to the end-users in the IoT domain. As a result, IoT devices can achieve the dynamic requirements of the running services. Virtualization enhances edge computing by reducing the number of physical resources required. With this knowledge, automated infrastructure of 5G deployments becomes more cost-effective. Virtualization technologies should be used in the IoT space to fulfill the edge computing paradigms' goal of creating computing infrastructure at the network's edge. With virtualization, 5G server platforms will be fast and affordably accessible for gNodeBs. Virtualized edge computing server platforms are managed and controlled via orchestrators. Even though cloud-based orchestration platforms exist, the optimum MEC server selection is not reached with maximum infrastructure utilization and autonomous infrastructure scaling. This paper proposes a mobile edge MEC server selection strategy, dependent on the MEC server's resources and wireless link parameters. The performance of the proposed strategy was simulated and analyzed in terms of blocking probability and algorithm complexity via simulations.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124830285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Performance of an Adaptive Cooperative NOMA Scheme with Transmit Antenna Selection 一种具有发射天线选择的自适应协同NOMA方案的性能
Amrita Mukherjee, Pratik Chakraborty, S. Prakriya, A. K. Mal
{"title":"Performance of an Adaptive Cooperative NOMA Scheme with Transmit Antenna Selection","authors":"Amrita Mukherjee, Pratik Chakraborty, S. Prakriya, A. K. Mal","doi":"10.1109/ANTS52808.2021.9936992","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9936992","url":null,"abstract":"In this paper, we investigate the performance of hybrid cooperative non-orthogonal multiple access (CNOMA) underlaid in a primary network. The CNOMA setup consists of a secondary near user (NU), provisioned to act as a full-duplex (FD) relay for a secondary far user (FU). We propose a novel mode switching mechanism, where the NU can choose to operate in either of the following two modes: 1) The Cooperative Mode (CM) and 2) The Non-Cooperative Mode (NCM). It is only when the NU achieves a desired performance of its own, it chooses to operate in CM, while it switches to NCM otherwise. Through this intelligent switching between modes, the NU retains the same performance as in a network without the FU. We employ a maximum received-power based transmit antenna selection (MRP-TAS) strategy and derive analytical expressions for the outage probability at the NU and FU under peak transmit power and peak interference power constraints. The interference temperature limit (ITL) imposed by the primary network is carefully apportioned between the secondary transmitter and the NU with an ITL apportioning parameter (ITLAP). An optimum choice of both ITLAP and NOMA power allocation parameter (NPAP) is proposed in closed-form, that results in minimum outage performance. The analytical results are validated by extensive simulation studies, and superiority of the proposed scheme over conventional NOMA and OMA schemes is established.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"318 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123234519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Future Backbone Optical Networks: Fiber Densification Versus Network Densification 未来骨干光网络:光纤致密化与网络致密化
A. Agrawal, V. Bhatia
{"title":"Future Backbone Optical Networks: Fiber Densification Versus Network Densification","authors":"A. Agrawal, V. Bhatia","doi":"10.1109/ANTS52808.2021.9936986","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9936986","url":null,"abstract":"The increasing amount of traffic being aggregated to the terrestrial backbone optical networks (BONs) from the metro/access communication networks has caused capacity crunch in the BONs. Increasing coverage with rural and remote connectivity, wireless network densification, data hungry 5G applications, and increasing datacenters (DCs) are among the major factors that necessitated the deployment of huge amount of optical fibers around the world to connect cell sites, to interconnect DCs, to provide fiber to the home (FTTH) services, among others. Due to massive fiberization in the metro/access networks and hence to handle the increased traffic being aggregated to BONs through them, efforts are being made to increase the capacity of BONs via novel devices, fiber designs, and spectral/spatial flexibility and expansion along with the additional deployment of fibers (referred to as fiber densification) in BONs. In this paper, we focus on the topological aspect of BON and present BON densification as an approach to enable the realization of several advanced optical network technologies in BONs. We analyze the advantages of BON densification considering multicore fibers (MCFs) for which low transmission reach has been the main hindrance towards its deployment in BONs. Simulations indicate that through BON densification, MCF networks can achieve significantly low blocking, and high resiliency against multi-link failures. Furthermore, we highlight several other aspects of future communication networks which indicate that BON densification is a promising approach as compared to the conventional fiber densification.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130354162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Enabling Fog Computing based Dynamic Security Service Function Chaining for 5G IoT 实现基于雾计算的5G物联网动态安全业务功能链
Vashish N. Imrith, Pasika Sashmal Ranaweera, Sneha Damree, Madhusanka Liyanage
{"title":"Enabling Fog Computing based Dynamic Security Service Function Chaining for 5G IoT","authors":"Vashish N. Imrith, Pasika Sashmal Ranaweera, Sneha Damree, Madhusanka Liyanage","doi":"10.1109/ANTS52808.2021.9936997","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9936997","url":null,"abstract":"Fog computing is an edge computing strategy which fuels adaptation of Internet of Things (IoT) in many domains. The decentralized and dynamically deployable features of the fog nodes are useful to satisfy the service requisites of IoT nodes. However, security is a prime concern for both fog, and IoT deployments; where their inhibited limited resources are expanding the threat landscape for the malicious adversaries towards resource exhaustive attempts. Despite the available security servicing tools being effective, a singular service is not adequate to address all the intricacies of the contrived threat landscape. Hence, the requirement of multiple security services to operate in a cooperative domain is an obvious fact. However, integrating multiple security services in a resource constrained fog node is a challenge. Thus, in this research, we are leveraging Service Function Chaining (SFC) concept as a method to deploy multiple security services/ tools in a resource constrained edge node (i.e. Raspberry Pi), while evaluating its adaptability in a developed experimental virtual platform. The implemented SFC strategy on the fog node is compared with a resourceful virtual machine to understand the performance issues.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124227232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximal Ratio Sparse Vector Coding for Short Packet Transmission 短包传输的最大比稀疏矢量编码
Astha Awasthi, Mithun Kumar, S. K. Bandari, V. V. Mani
{"title":"Maximal Ratio Sparse Vector Coding for Short Packet Transmission","authors":"Astha Awasthi, Mithun Kumar, S. K. Bandari, V. V. Mani","doi":"10.1109/ANTS52808.2021.9936988","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9936988","url":null,"abstract":"With the proliferation of automated services in recent years, the demand for reliable communication among the devices and machine-human interactions has increased like never before. In general, the amount of information that is exchanged for mission-critical applications is tiny for service categories such as ultra reliable and low latency communication (URLLC) and massive machine-type communications (mMTC). To handle short packet transmission, sparse vector coding (SVC) was recently proposed where the packet information is embedded into the positions of the sparse vector. In this paper, to further improve the performance of SVC in terms of reliability, maximal ratio transmission (MRT) is employed. The distinctive feature of the proposed scheme to that of conventional SVC is that the composite of weighted MRT coefficients with sparse vector is transmitted over the channel. Simulated results under realistic international telecommunication union (ITU) channel models suggest that by exploiting spatial diversity at the transmitter side, the block error rate (BLER) can be reduced with the increased number of antennas. In brief, MRT-aided SVC transmission can be a key enabler for reliable communication and a practical choice for beyond 5G (B5G) communication systems.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131135241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Hybrid-Combine-and-Forward Relaying Scheme for Network Coded Cooperative Systems 网络编码合作系统的混合组合转发中继方案
Sagnik Bhattacharyya, Pankaj Kumar, Sachin Sharma, S. Darshi, Akram A. Almohammedi
{"title":"A Hybrid-Combine-and-Forward Relaying Scheme for Network Coded Cooperative Systems","authors":"Sagnik Bhattacharyya, Pankaj Kumar, Sachin Sharma, S. Darshi, Akram A. Almohammedi","doi":"10.1109/ANTS52808.2021.9936936","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9936936","url":null,"abstract":"Network Coded Cooperation (NCC) proved itself worthy to meet the ever increasing demands of the next generation wireless users. In the prevalent relaying schemes, the relay either uses Amplify-and-Forward (AF) or Decode-and-Forward (DF) rigidly over all the signals received. However, some networks use Adaptive Decode-Forward (ADF) where relay only forwards the decoded data which causes resource wastage as the sources need to re-transmit the data which were not sent by the relay. This paper proposes a Hybrid-Combine-and-Forward (HCF) relaying scheme for a multi-user scenario to improve the Quality-of-Support (QoS) in a cost effective manner. With the HCF scheme, the relay dynamically performs AF on some of the received signals while DF on the rest, and stores them within a communication cycle. This decision is taken by the relay based on the Instantaneous Signal-to-Noise Ratio (SNRi) of the signal received from the respective sources. Finally, it combines all the stored signals received and transmits a hybrid superposed data to the destinations which is required to extract the second copy of the desired data. Extensive simulations provide results showing the superiority of the proposed HCF scheme over the widely used AF and DF schemes. Such a scheme can be used in a Device-to-Device (D2D) communication/ Vehicle-to-Everything (V2X) networks or in scenarios like disaster management where sources aided by a drone/relay require reliable data at a low operational cost of the relay.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128482029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Prediction-based Online Cost Optimization Algorithm for 5G Vertical 基于预测的5G垂直在线成本优化算法
Jyotindra Tiwari, Shashwat Kumar, A. Franklin
{"title":"A Prediction-based Online Cost Optimization Algorithm for 5G Vertical","authors":"Jyotindra Tiwari, Shashwat Kumar, A. Franklin","doi":"10.1109/ANTS52808.2021.9937033","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9937033","url":null,"abstract":"End-to-end network slicing in 5G enables new business models and use cases across all industry verticals. Network slicing is an efficient solution that fulfills the diverse business requirements, characterized by a Service Level Agreement (SLA). 5G service providers offer the network slices through various plans differing in leasing period, allocated resources, and price. With uncertain future demand, it is challenging for businesses to select a cost-effective plan that supports the traffic. In this work, we propose a prediction-based online algorithm that minimizes the cost through plan selection for different applications in industry verticals. First, the future traffic demand is predicted using the Recurrent Neural Network (RNN)-based Long Short-Term Memory (LSTM) model, which continuously learns and adapts to the dynamic requirements with higher prediction accuracy. The traffic prediction model estimates the future demand, and the proposed algorithm leverages it for plan selection. The problem is formulated as an Integer Linear Program (ILP), which provides an offline optimal solution of the problem. Results from extensive simulations, with real-world datasets, illustrate that the proposed algorithm reduces the best worst-case expected Competitive Ratio (CR) by 20% over randomized ski-rental algorithm and 37% over deterministic algorithm.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129966551","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Welcome message from WIE 卫理公会欢迎辞
{"title":"Welcome message from WIE","authors":"","doi":"10.1109/ants52808.2021.9936980","DOIUrl":"https://doi.org/10.1109/ants52808.2021.9936980","url":null,"abstract":"","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126488041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards simulating dynamic routing and wavelength assignment using GNPy and SIMON 利用 GNPy 和 SIMON 模拟动态路由和波长分配
Boyang Hu, B. Ramamurthy
{"title":"Towards simulating dynamic routing and wavelength assignment using GNPy and SIMON","authors":"Boyang Hu, B. Ramamurthy","doi":"10.1109/ANTS52808.2021.9936914","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9936914","url":null,"abstract":"In this article, we enhanced the capability of SIMON (Simulator for Optical Networks) by considering the nonlinear effect of the optical network components and different industry network devices. This is achieved by using an optical route planning library called GNPy (Gaussian Noise model in python) as the calculation model within SIMON. SIMON is implemented in C++ and has mainly been used as an optical network learning tool for studying the performance of wavelength-routed optical networks. It measures the network blocking probability by taking into consideration the optical device characteristics. SIMON can capture the most significant impairments when estimating the Bit-Error Rate (BER) but does not consider fiber dispersion and non-linearities. These impairments can be significant when simulating a large-scale network. GNPy, on the other hand, considers those physical impairments and can give a more accurate signal-to-noise ratio (SNR) estimation validated by real-world measurements. By integrating GNPy with SIMON, we are able to set a minimum SNR threshold, which must be satisfied by any call set up in the network. The integration of SIMON and GNPy makes the resulting simulator not only suitable for academic learning but also valuable for real-world network planning, evaluation, and deployment of optical networks.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"17 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126579949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Inviolable e-Question paper via QR code Watermarking and Visual Cryptography 通过QR码水印和视觉加密的不可侵犯的电子问题纸
Aniket Agrawal, Kamalakanta Sethi, P. Bera
{"title":"Inviolable e-Question paper via QR code Watermarking and Visual Cryptography","authors":"Aniket Agrawal, Kamalakanta Sethi, P. Bera","doi":"10.1109/ANTS52808.2021.9936948","DOIUrl":"https://doi.org/10.1109/ANTS52808.2021.9936948","url":null,"abstract":"Recurrent allegations of electronic question paper (e-QP) leakage and examination malpractices in educational institutions can be handled by the course faculty (F) securely transferring the e-QP data to a trustworthy collector (C). In this case, the data is a mix of run length encoding (RLE) for the binarized diagrams and tamper-resistant e-QP question text encrypted with a data modification technique. QR codes are being utilised to encode this combination for the two halves of the secret e-QP data. Digital watermarking is being used to embed the QR code for 1 e-QP chunk in the same for the second. Its n secret image shares are generated by F through deterministic XOR based (n, n)-Visual Cryptography (VC). These are submitted to n non-trusted parties which deliver their respective portions to C before the examination. C performs all the necessary operations to get back the full e-QP data in its raw form. The resulting image RLE in plaintext format is utilised to decompress the binarized pictures in e-QP. This paper, therefore, suggests and explores the usage of QR code watermarking and VC in the construction of a secure examination cryptosystem that is robust towards ordinary watermarking and other attacks.","PeriodicalId":349576,"journal":{"name":"2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133908572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书