Transactions on Emerging Telecommunications Technologies最新文献

{"title":"Sensitive data identification for multi-category and multi-scenario data","authors":"Yuning Cui,&nbsp;Yonghui Huang,&nbsp;Yongbing Bai,&nbsp;Yuchen Wang,&nbsp;Chao Wang","doi":"10.1002/ett.4983","DOIUrl":"https://doi.org/10.1002/ett.4983","url":null,"abstract":"<p>Sensitive data identification is the prerequisite for protecting critical user and business data. Traditional methods usually only target a certain type of application scenario or a certain type of data, thus making it difficult to meet the needs of enterprise-level data protection. This paper proposes an introduction to the end-to-end sensitive data identification system of Beike Inc. The system consists of the data identification &amp; annotation platform, dataset management platform, and sensitive data identification model, which propose different governance methods for batch data and streaming data respectively. Specifically, we propose a sliding window-based identification method for long text to improve the identification of streaming data. Evaluation results show that this method can improve the effect of identifying long text sensitive data without losing the ability on short text, for the open source test dataset, the value can be up to 94.15, so it is applicable in diverse scenarios.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 5","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140648161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An advancing method for web service reliability and scalability using ResNet convolution neural network optimized with Zebra Optimization Algorithm","authors":"D. Gokulakrishan,&nbsp;R. Ramakrishnan,&nbsp;G. Saritha,&nbsp;B. Sreedevi","doi":"10.1002/ett.4968","DOIUrl":"https://doi.org/10.1002/ett.4968","url":null,"abstract":"<p>Web service reliability and scalability is an important mission that keeps web services running normally. Within web service, the web services invoked by users not only depend on the service itself, but also on web load condition. Due to the features of web dynamics, traditional reliability and scalability methods have become inappropriate; at the same time, the web condition parameter sparsity problem will cause inaccurate reliability prediction. To address these challenges, Web Service Reliability and Scalability Determination Using ResNet Convolutional Neural Network optimized with Zero Optimization Algorithm (WRS-ResNetCNN-ZOA) is proposed in this manuscript. Initially, the input data is collected from WSRec dataset. The ResNet convolutional neural network (ResNetCNN) with Business Process Execution Language (BPEL) specification is introduced to forecast the reliability and scalability of web service. The results are categorized as right and wrong based on ResNetCNN. The weight parameters of the ResNetCNN is optimized by Zebra Optimization Algorithm to improve accuracy of the prediction. The performance of the proposed method is examined under some performance metrics, like <i>F</i>-measure, reliability, scalability, accuracy, sensitivity, specificity, and precision. The proposed technique attains 15.36%, 35.39%, 23.87%, 20.67% better reliability, 42.39%, 11.39%, 34.16%, 25.78% better accuracy when analyzed to the existing methods, like Web Reliability based on K-clustering, (WRS-KClustering), Web Reliability prediction based on AdaBoostM1 and J48 (WRS-AdaM1-J48), Web Reliability prediction based on Online service Reliability (WRS-OPUN), and Web Reliability prediction based on Dynamic Bayesian Network (WRS-DBNS), respectively.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 5","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140641765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A greedy randomized adaptive search procedure for scheduling IoT tasks in virtualized fog–cloud computing","authors":"Rezvan Salimi,&nbsp;Sadoon Azizi,&nbsp;Jemal Abawajy","doi":"10.1002/ett.4980","DOIUrl":"https://doi.org/10.1002/ett.4980","url":null,"abstract":"<p>Virtualized fog–cloud computing (VFCC) has emerged as an optimal platform for processing the increasing number of emerging Internet of Things (IoT) applications. VFCC resources are provisioned to IoT applications in the form of virtual machines (VMs). Effectively utilizing VMs for diverse IoT tasks with varying requirements poses a significant challenge due to their heterogeneity in processing power, communication delay, and energy consumption. In addressing this challenge, in this article, we propose a system model for scheduling IoT tasks in VFCCs, considering not only individual task deadlines but also the system's overall energy consumption. Subsequently, we employ a greedy randomized adaptive search procedure (GRASP) to determine the optimal assignment of IoT tasks among VMs. GRASP, a metaheuristic-based technique, offers appealing characteristics, including simplicity, ease of implementation, a limited number of tuning parameters, and the potential for parallel implementation. Our comprehensive experiments evaluate the effectiveness of the proposed method, comparing its performance with the most advanced algorithms. The results demonstrate that the proposed approach outperforms the existing methods in terms of deadline satisfaction ratio, average response time, energy consumption, and makespan.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 5","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140641767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A secure routing protocol using trust-based clustering and bionic intelligence algorithm for UAV-assisted vehicular ad hoc networks","authors":"Divya Babu,&nbsp;Terli Sankara Rao","doi":"10.1002/ett.4977","DOIUrl":"https://doi.org/10.1002/ett.4977","url":null,"abstract":"<p>Vehicular ad hoc networks (VANET) are one of the advanced technologies for distributing dynamic vehicular information across the globe. The VANET is extensively used in many applications, especially road safety applications and intelligent transport systems (ITS). However, direct communication causes high bandwidth (BW) requirement and power consumption. Hence, this article introduces a clustering-based mechanism to communicate vehicles with infrastructures. The cluster head (CH) is formed based on certain rules, and nodes or vehicles are combined. But, maintaining stability remains challenging for the traditional clustering mechanism. Moreover, the developed technique must examine the malicious and reduce the risk of fake information sharing. This research emphasizes a trust-based clustering mechanism to select the CH based on a vehicle's knowledge, reputation, and experience. In addition to this, the backup head is also analyzed to promote trust in each vehicle. After clustering, secure routing is undertaken. For this, a bionic remora optimization algorithm (BROA) is proposed, and it considers the hop Count Field as well as the transmission range of vehicles to select the best routes. The performance measures such as end-to-end delay ratio, packet delivery ratio (PDR), throughput, trust values, energy consumption are analyzed and compared with existing techniques. In an experimental scenario, the proposed technique has an end-to-end delay of 3.8 ms, PDR of 98%, trust value of .4 and .06 for wormhole and Sybil attack, energy of and throughput of 78.7 kbps are attained. The outcome results prove the efficacy of a proposed method.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 5","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140641766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Correction to “Multi-objective metaheuristic optimization-based clustering with network slicing technique for internet of things-enabled wireless sensor networks in 5G systems”","authors":"","doi":"10.1002/ett.4982","DOIUrl":"https://doi.org/10.1002/ett.4982","url":null,"abstract":"<p>Sheena BG, Snehalatha N. Multi-objective metaheuristic optimization-based clustering with network slicing technique for internet of things-enabled wireless sensor networks in 5G systems. <i>Trans Emerg Telecommun Technol</i>. 2022;1:e4626.</p><p>The institution location name “KATTANKULATHUR” was missing in the correspondence section.</p><p>The correct correspondence address is below.</p><p>B. Gracelin Sheena, Department of Computational Intelligence, SRM Institute of Science and Technology, Kattankulathur-603203, Chennai, Tamil Nadu, India. Email: <span>[email protected]</span>, Email: <span>[email protected]</span></p><p>We apologize for this error.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 5","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/ett.4982","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140639536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Crossover Boosted Grey Wolf Optimizer-based framework for leader election and resource allocation in Intrusion Detection Systems for MANETs","authors":"Saravanan Selvaraj,&nbsp;Manikandan Nanjappan,&nbsp;Mythili Nagalingam,&nbsp;Uma Maheswari Balasubramanian","doi":"10.1002/ett.4974","DOIUrl":"https://doi.org/10.1002/ett.4974","url":null,"abstract":"<p>Mobile Ad hoc Networks (MANETs) is a self-organizing networks without having a fixed infrastructure for making them susceptible to security threats. Intrusion Detection Systems (IDS) promotes security in MANETs by identifying malicious activities. Leader election is a fundamental aspect of IDS deployment, impacting resource allocation and system efficiency. This article presents a novel approach, the Crossover Boosted Grey Wolf Optimizer (CBGWO), for leader election and resource allocation in MANET-based IDS. The proposed CBGWO algorithm integrates the Grey Wolf Optimizer (GWO) with innovative crossover operators that have an ability to enhance the capabilities of exploration and exploitation in the optimization process. The leader election problem is solved through applying multi-objective optimization by considering energy consumption, reputation, and communication overhead. Objective functions are defined to maximize energy efficiency while maintaining a balanced distribution of leadership roles. Extensive simulations are conducted, varying network densities and the percentage of selfish nodes. Results demonstrate the effectiveness of the CBGWO-based model in balancing energy consumption, prolonging network lifespan, and enhancing intrusion detection by comparing different state-of-the-art models such as PCA-FELM, CTAA-MPSO, FLS-RE, LEACH, DCAIDS, WOA-GA, and VOELA. The proposed model achieved an energy consumption of 4.31 J, network lifetime of 560.482 ms, and average intrusion detection latency of 0.12 s, respectively. The proposed model outperforms than existing random and connectivity-based leader election methods that is evaluated by taking main consideration of energy efficiency and network survivability. This research contributes to the field by introducing a robust algorithm for leader election in MANET-based IDS, addressing challenges posed by network dynamics and resource constraints. The CBGWO-based approach showcases its potential to achieve effective leader election and efficient resource allocation, thereby enhancing the security and sustainability of MANETs.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 5","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140633840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An anonymous and efficient certificateless signature scheme based on blockchain in NDN-IoT environments","authors":"Cong Wang,&nbsp;Xu Deng,&nbsp;Maode Ma,&nbsp;Qiang Li,&nbsp;Hongpeng Bai,&nbsp;Yanan Zhang","doi":"10.1002/ett.4979","DOIUrl":"https://doi.org/10.1002/ett.4979","url":null,"abstract":"<p>The Named Data Networking (NDN) architecture, known for its caching strategies and name-based routing, is an exemplary paradigm for content distribution across Internet of Things (IoT) devices. In the environment of NDN-IoT, there is an urgent demand for a lightweight signature authentication scheme suitable for terminal devices to ensure the integrity of Data packets and the legitimacy of their sources. Many researchers opt for employing certificateless public key cryptography measures to enhance the security of communication among terminal devices in NDN-IoT. However, among the array of proposed solutions, issues such as lack of resistance against signer identity exposure, susceptibility to man-in-the-middle attacks, and replay attacks persist. Some researchers advocate for partitioning the devices in NDN-IoT into different zones, yet there remains a deficiency in the design of packet exchange mechanisms across distinct zones. To address these issues, this paper proposes a novel blockchain-based certificate-less signature scheme in the NDN-IoT environment that integrates key features such as distributed legitimate producer management, inter-domain interaction mechanisms, anonymous identity protection, and blockchain storage optimization. The overarching goal is to provide robust security services for resource-constrained devices within the NDN infrastructure while ensuring authenticity and integrity of data packets while alleviating the burden of certificate management on end devices. Compared to similar existing solutions, our proposed method incurs only 34% of the computational overhead required for Data packet signature verification, while maintaining equivalent cache occupancy and achieving higher security performance.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 4","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140619731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An energy-aware software fault detection system based on hierarchical rule approach for enhancing quality of service in internet of things-enabled wireless sensor network","authors":"Lavina Balraj,&nbsp;Aruchamy Prasanth","doi":"10.1002/ett.4971","DOIUrl":"https://doi.org/10.1002/ett.4971","url":null,"abstract":"<p>Of late, the Internet of Things (IoT) has progressed in its pervasiveness across the globe for diverse applications. Wireless Sensor Network (WSN) is one of the prominent technologies employed in IoT environments where multiple tiny sensor nodes are distributed to sense real-time observations about unforeseeable areas for control and managerial purposes. Owing to the presence of sensors in inaccessible regions and their battery restrictions, different types of software faults occur in IoT-enabled WSNs (IWSNs). These faults create uncertainty in data reading which causes serious damage to the sensor network. Hence, the IWSN necessitates an effective fault-detection methodology to continue optimal activity despite the existence of software faults. This work proposes a novel Energy-Aware Hierarchical Rule-based Software Fault Detection (HRSFD) model to identify various software faults with minimum energy depletion in the IWSN environment. Primarily, the proposed model extracts antecedent attributes from the characteristics of the sensed data. Its abnormal values can be identified based on the obtained antecedent attributes. Subsequently, the category of the software fault is determined by applying a hierarchical rule strategy. Finally, from the simulation results, it is apparent that the fault detection accuracy rate of the proposed HRSFD model attains 99.12% for dense networks. The lifetime of the network is also prolonged by 18% as compared to the existing state-of-the-art models.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 4","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140559524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Generalized index and mode modulated OFDM with improved spectral and energy efficiency","authors":"Ipsita Sengupta,&nbsp;Shounak Dasgupta,&nbsp;Abhirup Das Barman","doi":"10.1002/ett.4973","DOIUrl":"https://doi.org/10.1002/ett.4973","url":null,"abstract":"<p>Recently developed trends in wireless communication encounter extremely high surge in data traffic, which makes it inevitable to employ energy efficient techniques to reduce detrimental consequence of carbon emission over society. This concern has motivated us to upgrade our previous work on index and mode modulated orthogonal frequency division multiplexing (IMM-OFDM) for achieving dual benefits in terms of spectral and energy efficiency. In this paper, we have proposed a generalized index and mode modulated OFDM scheme with variable number of subcarrier activation. Novelty of this generalized scheme is its capability to act as a unified model for classic OFDM and three other benchmark index modulated OFDM schemes along with our previously proposed IMM-OFDM scheme. This new scheme outperforms those five descendent schemes in terms of energy efficiency and error performance as indicated by simulation results. Spectral efficiency improvement in this scheme is achieved through optimum sets of active subcarrier number, which are determined to gain most optimized trade-off between spectral and energy efficiency with least detector complexity. This generalized parent scheme can replace individual models of its five descendent schemes and consequently can be considered to be one of the most promising candidates for next generation mobile communication system.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 4","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140553074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Intelligent load balancing in data center software-defined networks","authors":"Ezekia Gilliard,&nbsp;Jinshuo Liu,&nbsp;Ahmed Abubakar Aliyu,&nbsp;Deng Juan,&nbsp;Huang Jing,&nbsp;Meng Wang","doi":"10.1002/ett.4967","DOIUrl":"https://doi.org/10.1002/ett.4967","url":null,"abstract":"<p>In response to the increasing demand for efficient resource utilization in data center networks (DCNs), the development of intelligent load-balancing algorithms has become crucial. This article introduces the dual double deep Q network (DDQN) algorithm, designed for software-defined networking (SDN) environments within data centers. By leveraging deep reinforcement learning, DDQN addresses the challenges posed by dynamic traffic patterns, diverse flow requirements, and the coexistence of elephant and mice flows. Our algorithm adopts a comprehensive SDN approach, evaluating the network's status by analyzing switch load and bandwidth utilization. Using convolutional neural networks for elephant and mice flows in DCN, our algorithm enables adaptive learning and training tailored to the specific demands of elephant flows. Employing a double deep Q network architecture (DDQN), DDQN optimizes paths for both elephant and mice flows independently. Real-time adaptation mechanisms make routing decisions based on the robust learning capabilities of DDQN, enhancing network utilization and reducing packet loss by generating optimal forwarding paths according to the current network state and traffic patterns. Simulations conducted in a Mininet environment with RYU as the controller, utilizing a fat-tree data center topology, validate the efficacy of DDQN. The results demonstrate its effectiveness in achieving higher throughput, lower latency, and superior load balancing compared to traditional algorithms like equal-cost multipath and Hedera.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 4","pages":""},"PeriodicalIF":3.6,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140553148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}