Search

With the rapid development of wireless technology and Mobile communication technology worldwide, Mobile Learning represents a new learning trend in the field of higher education, and has gradually become the development trend and research hotspot of independent learning and lifelong learning. Based on modern wireless network mobile communication terminal technology, this paper proposes a Granott model-driven mobile learning system. Firstly, the Granott model is studied and analyzed, and the ubiquitous computing with physical integration and spontaneous interoperation is used to control the Android mobile terminal, which greatly improves the interactivity of M-Learning. Then JSON is selected to optimize the data transmission format in Ajax, and j Query is used to parse JSON data. Ajax + JSON + j Query can shield the complexity of DOM parsing XML files, greatly shorten the data transmission time and improve the efficiency of Granott model. Finally, the Fast kernel density estimation (Fast KDE) algorithm is introduced to compress the data transmitted by Ajax + JSON + j Query, so as to obtain a reasonable number of training samples. Through experiments and relevant data analysis, the proposed mobile learning system based on modern wireless network mobile communication terminal technology, optimized by JSON and Fast KDE algorithm, driven by Granott model, can efficiently complete the learning task, and improve the ubiquity, interactivity, timeliness of mobile learning. [ABSTRACT FROM AUTHOR]

When traditional EEG signals are collected based on the Nyquist theorem, long-time recordings of EEG signals will produce a large amount of data. At the same time, limited bandwidth, end-to-end delay, and memory space will bring great pressure on the effective transmission of data. The birth of compressed sensing alleviates this transmission pressure. However, using an iterative compressed sensing reconstruction algorithm for EEG signal reconstruction faces complex calculation problems and slow data processing speed, limiting the application of compressed sensing in EEG signal rapid monitoring systems. As such, this paper presents a non-iterative and fast algorithm for reconstructing EEG signals using compressed sensing and deep learning techniques. This algorithm uses the improved residual network model, extracts the feature information of the EEG signal by one-dimensional dilated convolution, directly learns the nonlinear mapping relationship between the measured value and the original signal, and can quickly and accurately reconstruct the EEG signal. The method proposed in this paper has been verified by simulation on the open BCI contest dataset. Overall, it is proved that the proposed method has higher reconstruction accuracy and faster reconstruction speed than the traditional CS reconstruction algorithm and the existing deep learning reconstruction algorithm. In addition, it can realize the rapid reconstruction of EEG signals. [ABSTRACT FROM AUTHOR]

Abstract-Achieving high solution efficiency on conventional sequential computation architecture is a challenging task due to penetration of multiple renewable energy sources (RESs). This challenge has become the bottleneck for the application in real-time grid operation, grid planning and analysis of the large-scale and complicated modern power system. Therefore, this paper proposes a parallel multi-GPU and multi-process Fast Decoupled (FD) method to accelerate the power flow calculation, reducing the system responsive time and guaranteeing real-time performance on a large-scale modern power system. In this paper, two hierarchy architecture, task parallelism and data parallelism, are designed to optimize the FD solver parallelization. Moreover, the GPUDirect technology is employed to enhance efficiency of data transmission and drastically reduce copy overhead. The proposed method in this paper achieves a speedup of 9 × ∼ 33 × , compared to the single GPU on a sample large-scale power system. [ABSTRACT FROM AUTHOR]

This paper investigates the integration of relay-assisted Internet of Things (IoT) systems, focusing on the use of multiple relays to enhance the system performance. The central metric of interest in this study is system outage probability, evaluated in terms of latency. Our research provides a comprehensive analysis of system outage probability, considering different relay selection criteria to optimize the system's transmission performance. Three relay selection strategies are employed to enhance the system transmission performance. Specifically, the first strategy, optimal relay selection, aims to identify the relay that minimizes the latency and maximizes the data transmission reliability. The second approach, partial relay selection, focuses on selecting a subset of relays strategically to balance the system resources and achieve the latency reduction. The third strategy, random relay selection, explores the potential of opportunistic relay selection without prior knowledge. Through a rigorous investigation, our paper evaluates the impact of these relay selection criteria on the performance of relay-assisted edge computing systems. By assessing the system outage probability in relation to latency, we provide valuable insights into the trade-offs and advantages associated with each selection strategy. Our findings contribute to the design and optimization of reliable and efficient edge computing systems, with implications for various applications, including the IoT and intelligent data processing. [ABSTRACT FROM AUTHOR]

Cloud computing has data leakage from all parties, security protection of private data, and existing solutions do not provide a trade-off between security and overhead. With distributed data communication due to data barriers, information interaction security and data computation security have become challenges for secure computing. Combining cloud computing with secure multiparty computation can provide a higher level of data protection while maintaining the benefits of cloud computing. In this case, data can be stored in the cloud and computed through SMPC protocols, thus protecting the privacy and security of the data. However, multiple rounds of information interaction are often required, increasing the communication overhead, and the security strength is limited by the hardness assumption. In this paper, we work to achieve an optimal setting of the number of rounds in secure multi-party computation on the cloud to achieve a sublinear communication overhead and improve the security concept. A 2-round SMPC protocol is constructed in the framework of Universally Composable (UC). A 2-round SMPC protocol is constructed that uses multilinear maps based on the Learning from Errors (LWE) assumption. The participant encodes the input and sends it via broadcast to reduce the interaction, homomorphic computational encoding information for secure access to computational data and secure the SMPC protocol through UC security. This paper extends the participants to multiple parties, reduces the communication rounds to 2, the protocol achieves sublinear communication overhead in poly polynomial time, smaller setup size to poly(k), and static security is achieved. [ABSTRACT FROM AUTHOR]

In this paper, a design model for resource allocation is formulated beyond 5G networks for effective data allocations in each network nodes. In all networks, data is transmitted only after allocating all resources, and an unrestrained approach is established because the examination of resources is not carried out in the usual manner. However, if data transmission needs to occur, some essential resources can be added to the network. Moreover, these resources can be shared using a parallel optimization approach, as outlined in the projected model. Further the designed model is tested and verified with four case studies by using resource allocator toolbox with parallax where the resources for power and end users are limited within the ranges of 1.4% and 6%. Furthermore, in the other two case studies, which involve coefficient determination and blockage factors, the outcomes of the proposed approach fall within the marginal error constraint of approximately 31% and 87%, respectively. [ABSTRACT FROM AUTHOR]

Ultra-Reliable Low Latency Communication (URLLC) is mostly used for core services in the fifth generation (5G) and beyond cellular networks. Due to the conflicting demands of low latency and extremely high reliability, the ongoing research on this subject remains in its nascent phase. The utilization of Device-to-Device (D2D) communication shows great potential in facilitating URLLC. The implementation of URLLC and its Quality of Service (QoS) requirements may encounter high power consumption in dynamic wireless channels, potentially conflicting with the system's power limitations. In this paper, a packet delivery mechanism is introduced, aiming to achieve energy efficiency by incorporating a Power-Aware QoS-centric Preemptive Dropping mechanism to minimize latency while ensuring the successful transmission of URLLC data. The method aims to optimize bandwidth and channel assignment to effectively reduce overall power consumption. The optimization problem is formulated which is non-convex, posing challenges in selecting an optimal solution. To address this problem, we have undertaken the task of transforming the original problem into two subproblems: bandwidth allocation and subchannel assignment. To achieve optimal resource allocation for the formulated problem, we propose the Optimal Bandwidth Allocation (OBA) and Optimal Sub-channel Assignment (OSA) algorithms. The simulation results validate the proposed method outperforms the benchmark schemes, demonstrating higher energy efficiency ranging from 6.96 to 31.6%, as well as a reduction in latency ranging from 5.7 to 25.67%. The proposed method exhibits broad applicability in various domains, including remote healthcare and Industrial Internet of Things (IIoT) applications. [ABSTRACT FROM AUTHOR]

Fog computing and the Internet of Things (IoT) have revolutionized healthcare monitoring systems, enabling real-time health data collection and transmission while overcoming cloud computing limitations. However, efficiently selecting fog nodes for application modules with varying deadline requirements and ensuring adherence to quality of service (QoS) criteria pose significant challenges due to resource constraints and device limitations. In this paper, we present a novel two-layered hierarchical design for fog devices, leveraging cluster aggregation to optimize the selection of fog nodes for healthcare applications. We introduce three efficient algorithms to minimize system latency and reduce energy consumption in fog computing environments. Our proposed model is rigorously evaluated using the iFogSim toolkit and compared with cloud-based and latency-aware model [Mahmud R, Ramamohanarao K, Buyya R in ACM Transactions on Internet Technology.19, 2018, 10.1145/3186592]. In four distinct network topologies, our model exhibits an average latency reduction of at least 87% and energy consumption reduction of at least 76% when compared to the Cloud-based model. Similarly, when compared to the Latency-aware model proposed in [Mahmud R, Ramamohanarao K, Buyya R in ACM Transactions on Internet Technology. 19, 2018, 10.1145/3186592], our model showcases a minimum reduction of 43% in average latency and 27% in energy consumption. Our contribution lies in addressing the complexity of selecting fog nodes for application modules with diverse deadline requirements, while ensuring QoS. This work advances the field of real-time healthcare monitoring systems, promising substantial improvements in efficiency and effectiveness. [ABSTRACT FROM AUTHOR]

Vehicular Ad Hoc Networks (VANETs) play a critical role in ensuring safety and welfare applications for drivers and passengers amidst the escalating vehicular population in urban environments. The efficient functioning of VANETs hinges on addressing the challenge of load balancing among Road Side Units (RSUs). This paper introduces a groundbreaking approach aimed at enhancing real-time data transmission services within VANETs. The key contribution lies in the development of a multicast routing algorithm utilizing a geo-targeting protocol, facilitating simultaneous delivery of source data packets to multiple destinations. This innovative strategy aims to alleviate RSU congestion, thereby significantly enhancing the quality of real-time data transmission services. Moreover, this study presents advancements in the Statistical Match and Queuing algorithm, refining it over time to substantially mitigate network congestion and redundancy. Additionally, a Multi-Protocol Label Switching based algorithm is implemented to elevate service quality parameters, including end-to-end latency, packet loss, and overall network efficiency within in-vehicle networks. Importantly, this approach remains adaptable across various Layer two technologies, ensuring compatibility and scalability. Simulation results validate the efficacy of the proposed methodology, showcasing its superiority over existing methods. The findings underscore the innovative algorithms' prowess in addressing load balancing challenges across diverse scenarios, affirming their potential to significantly enhance VANET service quality. [ABSTRACT FROM AUTHOR]

With the vigorous development of cloud computing, most organizations have shifted their data and applications to the cloud environment for storage, computation, and sharing purposes. During storage and data sharing across the participating entities, a malicious agent may gain access to outsourced data from the cloud environment. A malicious agent is an entity that deliberately breaches the data. This information accessed might be misused or revealed to unauthorized parties. Therefore, data protection and prediction of malicious agents have become a demanding task that needs to be addressed appropriately. To deal with this crucial and challenging issue, this paper presents a Malicious Agent Identification-based Data Security (MAIDS) Model which utilizes XGBoost machine learning classification algorithm for securing data allocation and communication among different participating entities in the cloud system. The proposed model explores and computes intended multiple security parameters associated with online data communication or transactions. Correspondingly, a security-focused knowledge database is produced for developing the XGBoost Classifier-based Malicious Agent Prediction (XC-MAP) unit. Unlike the existing approaches, which only identify malicious agents after data leaks, MAIDS proactively identifies malicious agents by examining their eligibility for respective data access. In this way, the model provides a comprehensive solution to safeguard crucial data from both intentional and non-intentional breaches, by granting data to authorized agents only by evaluating the agent's behavior and predicting the malicious agent before granting data. The performance of the proposed model is thoroughly evaluated by accomplishing extensive experiments, and the results signify that the MAIDS model predicts the malicious agents with high accuracy, precision, recall, and F1-scores up to 95.55%, 95.30%, 95.50%, and 95.20%, respectively. This enormously enhances the system's security in terms of authorized data access accuracy up to 55.49%, precision up to 43.15%, recall up to 55.49%, and F1-score up to 39.96%, respectively, as compared to state-of-the-art work. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach to optical communication systems by introducing a hybrid MGDM–FSO (Mode Group Diversity Multiplexing—Free Space Optical) system. The primary objective of this innovative system is to address the limitations of traditional communication systems, particularly in challenging environmental conditions. By combining the advantages of MGDM, which enhances transmission capacity in optical fibers, with the flexibility and high data rates offered by FSO technology, the hybrid MGDM–FSO system aims to overcome obstacles encountered during data transmission. In this study, we provide a detailed analysis of the proposed system's architecture and performance characteristics under various operating conditions. Specifically, we investigate both single-input single-output (SISO) and multiple-input multiple-output (MIMO) configurations of the MGDM–FSO system. Performance metrics such as received power levels, bit error rate (BER), and quality factor (Q-factor) are evaluated to assess the system's efficiency across different weather conditions. Numerical simulations are conducted to analyze the system's performance under a range of scenarios. Our findings indicate that under clear weather conditions, both SISO and MIMO configurations exhibit optimal performance, characterized by high Q-factor and low BER. However, as weather conditions deteriorate to heavy rain and heavy fog, the Q-factor of the received signal decreases, highlighting the impact of environmental factors on system performance. This study contributes valuable insights into the behavior of hybrid MGDM–FSO systems and emphasizes the importance of robust communication techniques to mitigate environmental challenges. The findings presented here have implications for the design and implementation of optical communication systems in real-world scenarios. [ABSTRACT FROM AUTHOR]

One of the networking technologies is called a wireless sensor network, and what it does is link sensor nodes by using wireless communication as the channel of connection. A haphazard and random distribution of nodes is carried out throughout the deployment process within the network area. As a result, the distances between the nodes do not remain constant. The nodes have a high sensing capacity, but their range of perception and battery life are also severely limited. The wireless data may be sensed by all of the nodes inside their respective sensing regions. Consequently, there are a variety of new applications that make use of WSN applications, particularly in surveillance monitoring applications such as those used in hospitals, buildings, forests, and airspace monitoring. The transmission of the data to the appropriate server or data centre that is linked with the cloud or the internet is experiencing greater difficulties as a result of the growing amount of monitoring data. This indicates that a significant quantity of data is lost as a result of the fact that wireless transmission is affected by environmental factors such as precipitation, humidity, and wind storms. It is vital to create and execute an innovative routing protocol to deliver greater throughput and raise the overall Quality of Service of the WSN applications in order to solve the difficulties that have been outlined above. This study paper presents a metaheuristic algorithm based optimal routing protocol for WSN application, which boosts the overall quality of service of any surveillance monitoring applications. To achieve this goal, the protocol was designed for wireless sensor networks. It does so in an effective manner, resulting in decreased delay and energy consumption as well as enhanced throughput and PDR. Based on the findings of the experiments, it has been hypothesised that the proposed metaheuristic algorithm-based routing protocol is capable of performing better routing for any type of surveillance monitoring and remote monitoring, as well as successfully transmitting any type of data, including numerical, video, and image data. [ABSTRACT FROM AUTHOR]

The agriculture Internet of Things (IoT) has been widely applied in assisting pear farmers with pest and disease prediction, as well as precise crop management, by providing real-time monitoring and alerting capabilities. To enhance the effectiveness of agriculture IoT monitoring applications, clustering protocols are utilized in the data transmission of agricultural wireless sensor networks (AWSNs). However, the selection of cluster heads is a NP-hard problem, which cannot be solved effectively by conventional algorithms. Based on this, This paper proposes a novel AWSNs clustering model that comprehensively considers multiple factors, including node energy, node degree, average distance and delay. Furthermore, a novel high-performance cluster protocol based on Gaussian mutation and sine cosine firefly algorithm (GSHFA-HCP) is proposed to meet the practical requirements of different scenarios. The innovative Gaussian mutation strategy and sine–cosine hybrid strategy are introduced to optimize the clustering scheme effectively. Additionally, an efficient inter-cluster data transmission mechanism is designed based on distance between nodes, residual energy, and load. The experimental results show that compared with other four popular schemes, the proposed GSHFA-HCP protocol has significant performance improvement in reducing network energy consumption, extending network life and reducing transmission delay. In comparison with other protocols, GSHFA-HCP achieves optimization rates of 63.69%, 17.2%, 19.56%, and 35.78% for network lifespan, throughput, transmission delay, and packet loss rate, respectively. [ABSTRACT FROM AUTHOR]

A large number of interconnected smart devices or objects interact with the physical environment known as the Internet of Things (IoT). These networks efficiently perform complex tasks with a high level of intelligence without human intervention and require run-time processing and computation. Edge computing is introduced where devices are placed at the edge between the data source and the cloud. These devices can provide more powerful computational and storage capabilities to IoT users. With various benefits, one of the significant requirements is secure and trustworthy data communication. Various trust management schemes are introduced to guarantee the trustworthiness and isolation of the malicious nodes and give preference to the most trustworthy ones. The existing schemes selected trustworthy nodes again and again from the path without considering the load factor which leads them to be more vulnerable for the Denial of Services (DoS) attacks. In this paper, we propose a Link-based Penalized Trust Management scheme to provide trust management and consider load factors for the selection of most trustworthy nodes and provide a preemptive measure to secure the network from DoS attacks based on its link's association. Simulation results indicate the better performance of the proposed scheme as compared with existing schemes. [ABSTRACT FROM AUTHOR]

In 5G, users can easily enjoy services by accessing the edge devices (EDs) deployed around the base stations. Generally, due to the uneven distribution and mobility of users, one ED is required to serve multiple users simultaneously, that results in the ED overload, seriously affecting the quality of experience (QoE) of the users. By responding to users' requests, service migration realizes the cross edge device migrations, that dynamically provides services for mobile users, which effectively improves the resource utilization rate of edge servers and the QoE of users. However, during the service migrations, malicious users may deploy pseudo base stations, gateways and other devices to illegally eavesdrop or tamper with user service data, that causes user information loss or disclosure. To prevent these security issues, a fountain-coding based cooperative jamming strategy is proposed in this paper. Specifically, the fountain coding technology is introduced to construct a three-node transmission model, including an original node, a target node and a malicious node, to realize the secure data transmission process in service migration. Besides, a group of relay nodes are employed to carry out cooperative jamming, that deteriorate the illegal eavesdropping quality of malicious nodes on service data. Then secrecy rate and outage probability are utilized to evaluate the security and reliability of the whole service migration. Finally, the theoretical analysis is shown by simulation results. [ABSTRACT FROM AUTHOR]

Safety helmet wearing detection based on video surveillance is an important means of safety monitoring in many industrial scenes. The training of safety helmet wearing detection models requires large and well-labeled dataset. However, the incidence of security violations is relatively low, which results in insufficient samples for training deep detection models. Safety helmet wearing detection is a common requirement in many scenarios such as construction sites, substations, and factory workshops. Aggregating data from multiple companies for model training would improve the performance of the detection model. Traditional centralized training methods are not feasible because aggregating data in centralized locations (such as the cloud) can raise concerns about data privacy and the high cost of data communication and storage. This paper proposes FedSH, a novel cloud-edge-based federated learning framework, which learns a shared global safety helmet wearing detection model in the cloud from multiple companies at the network edges and achieves data privacy protection by keeping company data locally. In addition, this paper designs reweighting mechanisms and applies transfer learning to address class imbalance and non-IID problems in the training data, so as to obtain an accurate and personalized detection model. Extensive experiments have been conducted on real surveillance video datasets. The experimental results demonstrate that FedSH outperforms the existing widely used federated learning methods with an accuracy improvement of at least 3.4%; the reduction in accuracy is within the range of 5% compared with centralized learning methods. FedSH effectively achieves a good balance between model performance, privacy protection, and communication efficiency. [ABSTRACT FROM AUTHOR]

Internet of vehicles (IoV) technology connects various types of vehicles through the Internet of Things to achieve mutual communication and data sharing, thereby promoting the development of intelligent transportation systems. Present data sharing in IoV mainly relies on complicated centralized certificate management and modern public-key cryptosystems, which are insecure and inefficient because the rapid development of quantum computing has put the security of modern public-key cryptosystems under serious threat. Considering the potential quantum adversaries, this paper proposes a quantum blockchain-based data sharing scheme called quantum blockchain for IoV (QBIoV) to realize secure and efficient data sharing in IoV. Specifically, QBIoV discards vulnerable modern cryptographic components, such as classical hash functions, public key signatures, and voting protocols, and innovatively introduces quantum replacement items, such as a quantum hash function (QHF), a quantum public key signature, and a quantum binary voting (QBV) protocol, to eliminate potential quantum cyberspace attack hazards. Furthermore, QBIoV improves the conventional proof of authority (PoA) consensus algorithm and introduces a more secure and fair consensus mechanism called quantum proof of authority (QPoA). QPoA enhances the efficiency of the blockchain system, enabling the secure and efficient sharing of data in IoV. Additionally, a security analysis of QBIoV is conducted, demonstrating that QBIoV is secure against both classic and quantum adversaries, with performance comparisons proving that QBIoV outperforms peer work regarding resource efficiency. In conclusion, this paper provides an effective solution for enhancing data security protection in IoV, assisting in designing blockchain systems in the post-quantum era. [ABSTRACT FROM AUTHOR]

This paper examines a nonlinear Networked Control System (NCS) incorporating Takagi–Sugeno (T–S) fuzzy models to address the output tracking control problem in the presence of input state delay. The paper introduces a strategy based on an event-triggered scheme to reduce bandwidth utilization in the NCS by leveraging inherent constraints, including communication time delays and data transmission limitations. The presence of communication time delay leads to an asynchronous interaction between the designed control algorithm for T–S fuzzy systems, which utilizes novel LMI–based conditions, and the proposed T–S fuzzy controller. Additionally, this paper proposes a model of operation based on synchronous behaviour, enabling the design of a linear controller that is more easily implementable. In comparison to recent literature results, these results are obtained by using an associate Lyapunov Krasovskii Function (LKF) with fuzzy properties, in addition to different forms of integral inequalities as alternatives. A fuzzy model for NCSs is illustrated through an example of tracking control for output response. [ABSTRACT FROM AUTHOR]

A small set of pilots in underwater acoustics OFDM (UWA-OFDM) systems tends to be insufficient for recovering the channel impulse response (CIR). This may result from the fast changes in the propagation environment and the requirement for high transmission data rates. A previous work, namely PE, considered the received subcarriers whose distances to their closest constellation points below the predetermined threshold T as potential pilots. However, extracting these pilots at the same time gives no chance to use some of them to facilitate searching for others. Fixing threshold T is also another limitation for searching pilot candidates. This paper proposes a reliable pilot search (RPS) method that consists of a multi-iterations pilot searching process with an adaptive threshold T a to improve the estimator in UWA-OFDM. The pilot search process gradually extracts reliable pilots at each iteration based on the threshold T a and evaluates them by performing channel estimation. Our method is compared to the MMSE and PE estimators on a wide range of settings, including the number of channel taps, pilot spacing, and various modulation schemes (i.e., MPSK and MQAM). The experimental results show that the RPS method often outperforms the MMSE and PE methods in terms of bit error rate (BER). [ABSTRACT FROM AUTHOR]

Healthcare (HC) is among the most promising sectors for assessing Internet of things (IoT) based technological advances, as patients can use wearable or injected medical sensors to monitor medical parameters any place and at any time. The data gathered by IoT devices can be sent to medical professionals, and doctors have real-time access to their patient's data. Nevertheless, the IoT devices within the network have limited resources and minimal computing capability, causing energy conservation issues. Even though clustering saves energy in network nodes, existing clustering methods could be more effective because of the higher Energy Consumption (EC), poorly balanced network load, and enhanced end-to-end delays. Furthermore, the integrity and security of medical information have become significant issues for HC applications. This paper proposes a secure and energy-efficient data transmission (DT) framework for IoT-based HC (IoT-HC) systems using enhanced mayfly clustering-based Q learner routing (EMCQLR) and exponential key-based elliptical curve cryptography (EKECC) techniques. The proposed work consists of the following steps. Double hash biometric-based authentication (DHABA) is initially used for IoT user authorization that prevents the HC network from unauthorized data access. The cluster head (CH) is then selected using the enhanced mayfly optimization algorithm (EMOA) to build clusters of IoT medical sensors and collect data from the nodes. Data is routed to the sink node by checking for data duplication. The path-weighted Q reinforcement learning (PWQRL) model can perform data routing. Finally, the EKECC algorithm encrypts the data packets received from the body sensors, providing security to the patient's data when DT is performed over an unsecured wireless channel. The performance of the suggested system is evaluated using the energy, loss ratio, throughput, success rate, and delay. The simulation outcomes show that the proposed method outperforms existing methods. Furthermore, false data elimination check and reliability metrics show that our proposed scheme ensures information privacy, message authenticity, and integrity while requiring minimal communication overhead and computation. [ABSTRACT FROM AUTHOR]

With the development of mobile Internet, more and more readers search for book information through mobile phones and other devices, so how to optimize the efficiency and accuracy of book information search has become an important issue of intelligent library system management. This paper presents a book information search algorithm based on cellular network, which can effectively improve the efficiency and accuracy of book information search. Based on the existing problems of book information search in the intelligent library system, this paper proposes a book information search algorithm based on cellular network. By assigning the book information to multiple search nodes, the algorithm makes use of the advantages of cellular network to realize efficient search and transmission. At the same time, the improved text similarity algorithm is introduced, which can improve the search efficiency and accuracy by analyzing and processing the keywords searched by users, and can match the readers' search requests and book information records more accurately. The experimental results show that this scheme can improve the search efficiency and data transmission rate of intelligent library system, and provide a new idea and method for the management optimization of intelligent library system. [ABSTRACT FROM AUTHOR]

In recent years, experimental economics has seen a rise in the collection and analysis of choice-process data, such as team communication transcripts. The main purpose of this paper is to understand whether the collection of team communication data influences how individuals reason and behave as they enter the team deliberation process, i.e. before any communication exchange. Such an influence would imply that team setups have limited validity to speak to individual reasoning processes. Our treatment manipulations allow us to isolate the effects of (1) belonging to a team, (2) actively suggesting an action to the team partner, and (3) justifying the suggestion in a written text to the team partner. Across three different tasks, we find no systematic evidence of changed suggestions and altered individual sophistication due to changes in aspects (1)–(3) of our experimental design. We thus find no threat to said validity of team setups. In addition to investigating how the team setup affects individual behavior before communication, we also investigate the sophistication of decisions after the communication. We find that sophisticated strategies are more persuasive than unsophisticated strategies, especially when communication includes written justifications, thereby explaining why teams are more sophisticated and proving rich communication to be fruitful. [ABSTRACT FROM AUTHOR]

Multivariate time series forecasting is essential in various fields, including healthcare and traffic management, but it is a challenging task due to the strong dynamics in both intra-channel relations (temporal patterns within individual variables) and inter-channel relations (the relationships between variables), which can evolve over time with abrupt changes. This paper proposes ERAN (Evolving Relational Attention Network), a framework for multivariate time series forecasting, that is capable to capture such dynamics of these relations. On the one hand, ERAN represents inter-channel relations with a graph which evolves over time, modeled using a recurrent neural network. On the other hand, ERAN represents the intra-channel relations using a temporal attentional convolution, which captures the local temporal dependencies adaptively with the input data. The elvoving graph structure and the temporal attentional convolution are intergrated in a unified model to capture both types of relations. The model is experimented on a large number of real-life datasets including traffic flows, energy consumption, and COVID-19 transmission data. The experimental results show a significant improvement over the state-of-the-art methods in multivariate time series forecasting particularly for non-stationary data. [ABSTRACT FROM AUTHOR]

The dynamic characteristics of vehicular ad hoc networks (VANETs) demand reliable and secure communication over wireless media. However, there are significant contradictions in autonomous vehicular systems related to security and privacy. Furthermore, VANETs require seamless data transmission to exchange time-critical data about accidents and traffic. Therefore, VANETs require secure seamless data transmission mechanisms to provide secure reliable communication without communication interruption to exchange time-critical data between vehicles. This paper proposes an Enhanced Location-Aided Ant colony Routing (ELAACR) for VANETs to achieve seamless secure data transmission. The proposed ELAACR is a two-fold scheme in which Phase 1 implements Location-Aided Key Management (LAKM) and Phase 2 implements Ant Colony Routing (ACR). An ACR combined with an LAKM pattern for offering secure and reliable communication. The LAKM scheme works based on the group signature concept to construct a secure network, and an ACR is used to find an efficient secure shortest path for seamless data transmission. The proposed work is simulated in Network Simulator (NS 2.35). By using an efficient and secure shortest path with secure seamless data transmission, the proposed ELAACR achieves an average throughput (T) of 640 Kbps, packet loss rate (PLR) of 0.018%, packet delivery ratio (PDR) of 98.5%, overhead (OH) of 0.157%, and 0.16 s end-to-end delay (EED) compared to Enhanced Hybrid Ant Colony Optimization Routing Protocol (EHACORP) and Fuzzy Based Ant Colony Optimization (F-ANT). The simulation results show that the proposed ELAACR registers better performance in all aspects compared to the existing EHACORP and F-ANT. [ABSTRACT FROM AUTHOR]

Medical data are increasing drastically due to the vast development of medical sciences. The security of this immense data is also a challenge of the present era. Image watermarking is a technique to secure medical data from alteration. Authentication of patients records is also necessary in case of medical data transmission. In this paper, an optimized electroencephalogram watermarking technique are proposed with dual authentication using Advanced encryption standards (AES) and speeded-up robust features is proposed. Scaling factor plays an important role to balance the properties of watermarking algorithm. The cuckoo search optimization is used to get the optimized scaling factor. The Henon encryption (HE) is used to enhance the security of sub-band obtained from identity of the patient image used as the watermark. The diagonalized Hessenberg decomposition (HD) is used for embedding watermark while secured hash algorithm (SHA-256) is used to protect watermark against malicious attacks. For the proposed technique, detailed security analysis has been performed for AES encryption technique. Various performance metrics are computed for the proposed technique to estimate the effectiveness of the watermarking system. [ABSTRACT FROM AUTHOR]

Due to the limited transmission capabilities of terrestrial intelligent devices within the Internet of Remote Things (IoRT), this paper proposes an optimization scheme aimed at enhancing data transmission rate while ensuring communication reliability. This scheme focuses on multi-unmanned aerial vehicle (UAV)-assisted IoRT data communication within the satellite–aerial–terrestrial integrated network (SATIN), which is one of the key technologies for the sixth generation (6G) networks. To optimize the system's data transmission rate, we introduce a multi-dimensional coverage and power optimization (CPO) algorithm, rooted in the block coordinate descent (BCD) method. This algorithm concurrently optimizes various parameters, including the number and deployment of UAVs, the correlation between IoRT devices and UAVs, and the transmission power of both devices and UAVs. To ensure comprehensive coverage of a large-scale randomly distributed array of terrestrial devices, combined with machine learning algorithm, we present the Dynamic Deployment based on K-means (DDK) algorithm. Additionally, we address the non-convexity challenge in resource allocation for transmission power through variable substitution and the successive convex approximation technique (SCA). Simulation results substantiate the remarkable efficacy of our CPO algorithm, showcasing a maximum 240% improvement in the uplink transmission rate of IoRT data compared to conventional methods. [ABSTRACT FROM AUTHOR]

The paper proposes a methodology for mathematical modeling of the phased development of nodes and transport routes in a hierarchical network with multicommodity discrete flows of correspondences based on solving the problems of optimizing its structure and distribution of flows. As a rule, such networks consist of a decentralized mainline network and networks in the internal service areas of mainline nodes. In a multicommodity network, each node can exchange correspondence (products, goods, cargo, messages) with the other nodes. Correspondence is characterized by a source node, a sink node, and a quantity, which for data transmission networks is given by the number of bytes, kilobytes, etc., and for transport networks by the number of cargo units in a package of uniform size. In the mainline network, all correspondences are transmitted via communication channels or transported by vehicles in transport units of a given size (capacity, volume). The authors considered the main postulates of generating a mathematical model of the perspective development of mainline network. They presented a method of mathematical modeling of the phased development of nodes and transport routes, which includes, for each stage of development, the forecasting of data and network parameters, solving the problem of packing correspondence and choosing the structure of the network, and solving the problem of distribution and routing of transport unit flows. [ABSTRACT FROM AUTHOR]

In path-constrained multi-hop sensor networks (M-WSNs), maximizing data collection with minimal energy consumption is critical, especially for delay-sensitive applications. Because a mobile element (ME) moving at a constant speed along a constrained-path must receive data from sensor nodes (SNs) within a given time bound. This issue can be addressed by efficiently scheduling the SNs' data transmission. The shortest path data transmission (SPT) or its variations are a simple and energy-efficient technique for scheduling data transmission from SNs. Although this method considerably minimizes total energy spent, it does not enhance data collection efficiency due to uneven data forwarding load. To solve this issue, this paper proposes a novel efficient heuristic method. The proposed method first computes a set of discrete sub-paths on a given path based on the start and end distance points of nearby SNs, the speed of ME, and the given time delay. Then, for each sub-path and SN-communication model, a network flow graph is used to schedule and optimize SN data transmission to ME. Finally, a sub-path is chosen among those which return maximum data with minimum energy consumption. The network flow graphs are created by considering two distinct SN-communication models: (1) energy-unrestricted SN-model and (2) energy-restricted SN-model. Finally, the simulation reports demonstrate the proposed method's efficacy over baseline schemes in terms of data collected, energy usage efficiency, and success-delivery ratio. [ABSTRACT FROM AUTHOR]

Vehicular ad-hoc network (VANET) plays a vital role in emerging Intelligent Transportation System (ITS). VANET's deal with the group of network that are designed in ad-hoc model in which various moving devices and other stationary linking objects that are connected over a wireless manner which interchange effective data to each other. Since, the communication between the VANET and other communication devices take place in open channel, there exist many threats caused by the intruder. Moreover, most of the existing authentication schemes suffer from computational and communicational overhead. In order to provide efficient lightweight authentication with enhanced privacy. In this paper, a novel lightweight authentication protocol named as Lightweight Authentication Protocol with Enhanced Privacy (LAPEP) has been proposed to provide efficient end to end security in VANET. The proposed protocol employs Elliptic Curve Cryptography (ECC) along with Bilinear pairing for efficient generation of keys and provides secured multiparty key exchange. Moreover, the security analysis of the proposed scheme is carried out by Burrows Abadi Needham (BAN) logic. The advantages of the proposed system are reduction of computation overhead and provide resistance to various security attacks during data transmission. Moreover, the proposed system enhances the Quality of Service (QoS) namely latency, overhead, delivery ratio, loss ratio and delay rate. The implementation of the proposed protocol is carried out in NS3 simulator. The simulation result proves that the proposed protocol improves the computational cost by 42.85%, communication cost by 35.82%, message end to end delay by 30.65%, signing time by 25.45% and verification time by 32.45%. [ABSTRACT FROM AUTHOR]

Vocal learning has found its proliferation in recent years due to the advancement in wireless networking. Vocal art encompasses profound cultural values and aesthetic preferences, making wireless platforms, e.g. Wi-Fi and ZigBee, essential for the enhancement of online vocal learning. ZigBee, as a wireless platform, has more recently been used quite frequently for online vocal learning and music. This paper aims to design an efficient wireless-enabled platform by using the lightweight features of ZigBee to support online vocal learning and expressions. The platform enables data transmission, storage, analysis, and playback of vocal learning sounds through the ZigBee network. It is built on a cloud platform, utilizing Docker virtualization technology to deploy a Hadoop distributed cluster, effectively simulating a distributed environment. The platform incorporates a model for recognizing musical sound and noise signals, empowering the online learning control platform to detect various characteristics of vocal music tones. Vocal music learning is enhanced by extracting endpoint fusion spectrum features and employing a tone adjustment and dynamic detection model. The proposed method improves anti-interference capability, online learning control, vocal tone recognition, and emotional expression accuracy. Simulation results demonstrate its effectiveness in vocal music, online learning control, and tone recognition, leading to more precise vocal music pronunciation and intonation registration. [ABSTRACT FROM AUTHOR]

Considering that one of the goals of the future network generations is to provide ubiquitous communication in the most diverse scenarios to achieve high connection coverage, it is foreseen that the use of unmanned aerial vehicles as flying base stations (UAV-BSs) can potentially extend the network and communication range. UAVs as flying base station can bring the potential to assist user devices and vehicles by carrying communication resources that can accommodate clients that were not previously planned by the ground infrastructure design due to flash crowd events, sudden natural disasters, or any other event that let to an overloaded environment. Allocating UAVs as flying base station still poses significant challenges in their deployment and the effectiveness of information transmission through UAVs as flying base station in the context of wireless communication since it is necessary to deal with both wireless communication capability and interference in the presence of terrestrial infrastructures already present. Besides, it is essential to understand how communication resources affect network performance. This paper studies the feasibility of using UAVs as flying base station in the assistance of wireless communication in a scenario where there is a sudden demand for data transmission due to possible congestion of local infrastructure. We show how the number of communication resources provided by the UAV-BS, the interference caused by the presence of multiple next generation node Bs (gNBs), and the UAV as flying base station positioning affect the network performance. We also highlight the need for a better next generation node B (gNB) and UAVs placement criteria since the received signal power prevents the user equipments (UEs) from using most of the available resources. [ABSTRACT FROM AUTHOR]

In the Internet of Vehicles (IoV), vehicle data exchange for cooperative assessment can enhance the experience of driving along with service quality. Nevertheless, concerns with security, bandwidth, and privacy prevent service providers from actively participating in the knowledge exchange procedure. This paper proposes energy-efficient routing and secured data transmission through a deep learning model. In the initial stage, this work adopts the Bidirectional Long Short Term Memory- Modified Attention Layer (Bi-LSTM-MAL) approach for energy prediction of each node. The optimal cluster head selection is the crucial step, for which this work proposes the Combined Beluga with Black Widow Optimization (CBBWO) algorithm by considering distinct constraints like energy, risk, distance and delay. This ensures precise routing, which is optimally done by taking account of constraints including trust, mobility and link quality. Also, this work concerns secure data transmission by protecting the data with a security standard, Fusion Key induced in Elliptic Curve Cryptography (FK-ECC) that aids the model to transmit the data securely between source and destination. Finally, the work evaluates its performance in optimal routing and secured data transmission over conventional models. The CBBWO recorded the minimized cost value of 1.4850 at the final (25th) iteration while existing methods such as BWO, BWOA, BMO, MFO, SBO, ROAONC and SDO-BM obtained maximum cost rates respectively. [ABSTRACT FROM AUTHOR]

Reducing network energy consumption and balancing workload are two key optimization goals for data transmission in edge computing field. However, these two goals are likely to be conflicting in some cases and fail to achieve the optimum simultaneously. In this paper, we design a new data transmission optimization algorithm using multi-objective reinforcement learning. We design the vector of rewards for the two objectives, and update Pareto approximate set by multiple state steps to approach the optimal solution. In every step, we classify the candidate links into four different levels for path selection. We aggregate network traffic to construct minimum topology subset, minimizing the number of occupied device to reduce energy consumption. We optimize the load distribution on those selected links, minimizing maximum congestion factor to balance workload. For action selection, we leverage roulette-based Chebyshev scalarization function to solve the weight selection problem for multi-objectives and enforce exploration to avoid falling into local optimum. To improve the convergence rate, we design heuristic factor to control the search of solution space and enhance the guiding effect of the existing optimal solution. Simulation result shows that the proposed algorithm achieves good performance in energy-saving and load balance at the same time. [ABSTRACT FROM AUTHOR]

Hash algorithms are among the most crucial algorithms in cryptography. The SM3 algorithm is a hash cryptographic standard of China. Because of the strong collision resistance and irreversibility of hash algorithms, they are widely used as a basic function in various fields such as digital signatures and random number generation. With the increasing real-time applications of automation in the fields of finance and office, the network puts forward higher demands for the implementing efficiency of the SM3 algorithm. We present a CUDA-based parallel optimized method for SM3 algorithm by four different ways: They are Single data stream with Single thread (SS), Multiple data streams with Single thread (MS), Single data stream with Multi-thread (SM), and Multiple data streams with Multi-thread (MM). The experimental result shows MM is the best of the four. When considering the data transmission between CPU and GPU, the proposed optimized algorithm achieves a peak performance of 166.42 Gb/s, which is 1.96 times of the best-known implementation of the SM3 algorithm on GPU platforms. Without transmission time counting, the peak performance is near 8500 Gb/s. Compared with other SM3 GPU algorithms, the algorithm proposed in this paper significantly enhances the efficiency of digest generation. Furthermore, the results show a new conclusion that the optimization of logical operations in the SM3 algorithm has reached a very high extent and the data transmission of PCIE becomes the bottleneck in the CPU+GPU data processing mode. Therefore, future work on the optimization of the SM3 algorithm should pay more attention to the PCIE data transfer efficiency. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is rapidly permeating critical domains, enabling the interconnection and utilization of diverse devices on a large scale while streaming vast volumes of data. In domains like telehealth, intelligent transportation, and autonomous agriculture, ensuring the confidentiality, integrity, and authenticity of collected and exchanged data is paramount. However, the resource limitations and heterogeneous nature of IoT devices often render traditional cryptography-based techniques ineffective or even infeasible for secure data transmission. Consequently, there is an urgent need to develop and implement lightweight, secure, and scalable schemes for data transmission. In this paper, we propose a novel Lightweight Secure and Scalable Scheme (LS3) for data transmission in IoT environments. LS3 is comprised of three phases and utilizes an efficient combination of symmetric keys and Elliptic Curve Menezes–Qu–Vanstone asymmetric key agreement protocol. Through a comprehensive analysis, we demonstrate that LS3 excels in terms of security and scalability and outperforms other existing schemes in terms of computation and communication costs. [ABSTRACT FROM AUTHOR]

In the present paper, we mainly consider the direct solution of cyclic tridiagonal linear systems. By using the specific low-rank and Toeplitz-like structure, we derive a structure-preserving factorization of the coefficient matrix. Based on the combination of such matrix factorization and Sherman–Morrison–Woodbury formula, we then propose a cost-efficient algorithm for numerically solving cyclic tridiagonal linear systems, which requires less memory storage and data transmission. Furthermore, we show that the structure-preserving matrix factorization can provide us with an explicit formula for n-th order cyclic tridiagonal determinants. Numerical examples are given to demonstrate the performance and efficiency of our algorithm. All of the experiments are performed on a computer with the aid of programs written in MATLAB. [ABSTRACT FROM AUTHOR]

Big Data (BD) is a concept that deals with enormous amounts of data storage, processing, and analysis. With the exponential advancement in the evolution of cloud computing domains in healthcare (HC), the security and confidentiality of medical records have evolved into a primary consideration for HC services and applications. There needs to be more than the present-day cryptosystems to address these troubles. Therefore, this paper introduces a novel Three-Factor Authentication (3FA) and optimal Map-Reduce (MR) framework for secure BD transmission over the cloud with Secure Hashing Authentication XOR-ed Elliptical Curve Cryptography (SHAXECC). The authentication procedure is initially carried out with the SHA-512 algorithm, which protects the network from unauthorized access. Next, data deduplication is done using the SHA-512 algorithm to eliminate duplicate files. After that, an optimal MR design is introduced to handle a large amount of BD. In an optimal MR, the mapper uses the Modified Fuzzy C-means (MFCM) clustering approach to initially form the BD clusters. Then, the reducer uses the Levy Flight and Scoring Mutation-based Chimp Optimization Algorithm (LSCOA) to form final BD clusters. Finally, the SHAXECC is used to transmit the data securely. Experiments are performed to compare the superiority of the proposed technique with the existing techniques in terms of some performance measures. The proposed approach outperformed other existing models concerning clustering and security measures. So, the proposed model is the best for data protection and privacy in cloud-enabled HC data. [ABSTRACT FROM AUTHOR]

The demand for wireless connectivity has grown tremendously over the last few decades. A new perspective of wireless communication will soon be positioned worldwide. In the years beyond, the millimeter-wave spectrum for the mobile communication infrastructure has improved spectral efficiency. The problem of the technical challenges may be detected, identified, and resolved in different designs as traditional solutions involve the software tricks that prevent the modes of operation that trigger the trouble. In this research, we carry out the proposed Millimetre assisted wave technologies using 6G federated learning and high-performance computing for 6G assisted wireless communication systems for voice data optimization. Millimeter-wave technology is a specific part of the radio frequency spectrum, between 24 and 100 GHz. The outcome of this proposed technique will be voice data optimization in the 6G cellular networks for next-generation networks to improve the 6G assisted networks federated learning from existing cellular network technology generation, established on the tool of Flight stack or Autopilot. The observational results express to assess the performance of the device, we acquire theMillimetre assisted wave technologies and federated learning and high-performance computing at various data transmission rates and modulations, including real-time data transfer up to 96 Gbit/s at 420 GHz, with a low bit error rate and good signal-to-noise ratio. With 18 dBm emitted power at 0.4 THz, this method creates and transmits a signal with a 160 Gbits per second net rate across a 15 m distance. This monolithic dual-DFB PIC-based THz generating technique represents an important advancement toward completely integrated, economically viable, and energy-efficient THz transmitters. [ABSTRACT FROM AUTHOR]

Seamless handoff is crucial for wireless body area network (WBAN) data's transmission, it may avoid the death resulted from sudden diseases, especially for the elder people who suffer from chronic diseases. Therefore, a vertical handoff algorithm that conforms to the characteristics of body area network is urgent. Different from the traditional service types in telecommunications, service types in wireless body area network have their own characteristics. How to reasonably divide these service types according to their requirement of the internet is very important. In addition, we need to study the rationality of different weighting and network selection algorithms for body area network users. In view of the lack of vertical handoff algorithms to meet the characteristics of wireless body area networks, this paper first analyzes the service types in body area network, and reasonably divides the service types in body area network into four types. For these four services types, we comprehensively and systematically analyze the weight determination and network selection algorithms suitable for them. In addition, in wireless body area network environment, there may be situations when multiple users need to transmit information at the same time. For these situations, we propose a broadcast mechanism to prevent network congestion caused by group switching. The simulation results show that the combination of using Analytic hierarchy process to determine the weight and using Technique for Order Preference by Similarity to Ideal Solution as the network selection method is most suitable for vertical handoff in WBAN. The proposed broadcast mechanism can solve the network congestion problem caused by group handoff. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSN) are omnipresent in the military, health care and defence sectors. In WSN, the data transmission is highly based on energy utilization, which is done by batteries. In conventional approaches, network delay and traffic rate are not mentioned during the energy aware routing process. Hence, multi-objective energy efficient Multi-objective May-Badger (M2B) optimized routing is proposed in this paper. In this proposed work, sensor nodes (SNs) are clustered, and the Cluster Head (CH) for all clusters is examined using the world cup optimization algorithm (WCO). After selecting the CH, the hybrid M2B optimization algorithm is used for the optimum routing of packets. The proposed M2B combines mayfly and honey badger optimization algorithms. The suggested protocol ensures energy efficient routing by considering several factors, such as distance between nodes, distance from the base station, node delay, and traffic rate. The proposed M2B protocol is implemented on the Network Simulation version 2 (NS2) platform, and the results are taken in terms of different performance measures. The performance measures are compared with existing approaches, and the comparative analysis demonstrates that the proposed method outperforms existing approaches in two different cases. The energy consumed by 100 nodes in the network for the proposed method is 0.09mJ. The proposed method has a higher Packet Delivery Ratio (PDR) of 96% for 1000 nodes, which expands the network lifespan. [ABSTRACT FROM AUTHOR]

A wireless body area network (WBAN) is a type of wireless sensor network that plays a crucial role in monitoring patient healthcare. In this network, sensor nodes are typically placed inside or outside the patient's body. These nodes are capable of transmitting data to the sink node when any functional changes in the patient are detected. The routing and energy efficiency of the network nodes are challenging tasks in WBAN, as each sensor node operates on a battery. Therefore, in multi-hop routing designing a robust routing protocol has a significant impact on reducing energy consumption during the selection of the next hop. In this paper, a simple novel routing protocol named simple energy-aware and reliable (SEAR) routing protocol is proposed to transmit reliable data packets in a WBAN. The proposed routing scheme considers the remaining energy of sensor nodes, priority data, and hop count to the sink node as significant metrics for dynamically selecting the best forwarder node. Furthermore, the proposed protocol utilizes the route reliability factor (RRF) to select the optimal route among all possible routes between the source sensor node and the sink node. RRF selects the route with the maximum route residual energy and minimum hop count. As a result, SEAR has the ability to provide effective single-hop and multi-hop routing data transmission to improve the reliability of data transmission, decrease the energy consumption of the sensor nodes, and prolong the lifetime of the network. The simulation results show that the performance of the SEAR routing protocol outperforms the existing routing protocols for the metrics: packet loss ratio, throughput, end-to-end delay, normalized routing load, energy consumption, and network lifetime. The results indicate that the proposed protocol improves total energy consumption by 18.76% and 10.89% when compared to EERR-RLFL and AMCRP respectively. Meanwhile, SEAR reduces the average end-to-end delay by 17% and 9%, packet loss ratio by 29.48% and 17.69%, and normalized routing load by 31.17% and 20.91%. Additionally, SEAR achieves up to 16% and 9.71% higher throughput compared to EERR-RLFL and AMCRP routing protocols respectively. Overall, the results obtained indicate that the proposed SEAR routing scheme significantly enhances the overall performance of the network. [ABSTRACT FROM AUTHOR]

Software-defined vehicular networks (SDVN) is a promising technology for wireless data transmissions between vehicles. SDVN inherits software-defined networking principles and aims to improve the typical performance of safety and non-safety applications of vehicular adhoc networks. Consequently, enhancing the performance of Intelligent Transportation System (ITS). However, the performance of these ITS applications largely depends on the computational capability of the controller node, which involves creating or destroying a data path from the source vehicle to the destination vehicle and generating flow rules for the requests coming from the data plane elements. As a result, SDVN often suffers from the problems of overburdening the controller node with route requests under heavy traffic generation at vehicles and single-point controller failure. To counter these problems, solutions based on multiple controllers are proposed. In fact, the load-balancing problem remains an important issue. So, routing of data with multiple controllers and load-balancing, both topics in SDVN, go hand in hand. In this paper, we survey this state-of-the-art that discusses the above-mentioned challenges, starting with the SDVN preliminaries. We scrutinize the existing routing methodologies and also discuss load-balancing techniques. Furthermore, we provide real-time applications and services of SDVN, discuss trending research, potential future research directions, and the real-life applicability of SDVN that have not been addressed previously. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive analysis of free space optical (FSO) communication that incorporates the orthogonal frequency division modulation (OFDM) system with differential quadrature phase shift keying (DQPSK) modulation scheme. FSO has become a significant area of research in the optical communication field due to efficient communication systems with higher data transmission rates and lower energy requirements. While transmitting signals through free space, the efficiency of the system is constantly compromised by atmospheric turbulence. In this research, the Gamma-Gamma fading model is considered to incorporate atmospheric turbulence which offers better protection against signal fading and scintillation. Convolutional coding is introduced as the forward error correction (FEC) code with the OFDM technique to ensure better and easier encoding of the signal. The system performance is evaluated in terms of bit error rate (BER). All complex calculations and final result are computed with the help of a hyper-geometrical function, Meijer G. Final results are obtained in graphical form with the help of MATLAB software. System performance is analyzed in terms of BER by varying different system's parameters including the number of OFDM sub-carrier and link distance. Significant amount of coding gain almost 32 dB was found at a BER of 10–9, when the system link length is 2000 m and the refractive index structure parameter is 10–14 m−2/3. [ABSTRACT FROM AUTHOR]

This paper dedicates to study the optical soliton solutions for the time-fractional perturbed Fokas-Lenells equation using the novel modified Sardar sub-equation approach. Several novel optical solutions include a class of categories, comprising mixed dark-bright, bell-shape, singular, and wave optical solutions are constructed. Further, the magnitude of the time-fractional perturbed Fokas-Lenells model by investigating the impact of the conformable fractional parameter and the effect of the time parameter on the novel optical solutions is analyzed. The current type of Sardar sub-equation approach is a general form of several approachs, such as the tanh-function extension approach, the modified Kudryashov approach, the improved Sardar sub-equation method, and others. It can be claimed that the current optical soliton solutions are novel and have not existed in the literature. The results of this study are expected to shed light on the field of soliton theory in nonlinear optics. Time-fractional perturbed Fokas–Lenells soliton solutions could be applied to model and understand the behavior of signals in optical communication systems and potentially improving data transmission. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) is the collection of physical objects which consists of integrated technologies to sense, interact and collaborate with other smart objects to collect the data from the deployed environment and send it to the base station. Data dissemination is a network management service which is provided to devices of IoT, by the base station to monitor and manage the device related configuration parameter in the network. In data dissemination, it is very much essential to identify the legitimate nodes which are required for reprogramming and reconfiguring for device configuration during data transmission in order to ensure the security and reliability of the network. Since a greater number of devices are being reprogrammed to exchange data and commands autonomously in IoT, providing security to the disseminated configuration parameters is very essential. Therefore, efficient security authentication mechanism is required to prevent the various types of attacks which occurs during data dissemination. In this paper, an energy efficient Swan Intelligent based Clustering Technique (SICT) has been proposed to provide efficient clustering of nodes in the network. Moreover, trust based secured lightweight authentication protocol is proposed to provide better authentication and secure data dissemination to the devices of IoT. Additionally, the proposed protocol employs fuzzy logic to discover optimal route by selecting only trusted nodes during routing process. The advantages of the proposed system are it improves the security during data dissemination and optimizes the energy by identifying the relevant devices which are required for configuration parameters during data dissemination. The proposed system is implemented in NS3 simulation with realistic simulation parameters namely energy efficiency, network lifetime, throughput, computational cost, communication cost, average signing time, average verification time, packet delivery ratio and network delay. The simulation results justifies that the proposed protocol improves average energy consumption by 34%, computational cost by 41.85%, communication cost by 36.83%, network delay by 31.66%, signing time by 26.25% and verification time by 33.46%. Moreover, the proposed system improves packet delivery ratio by 30% and provides efficient authentication to mitigate various types of attacks during data dissemination when it is compared with other existing protocols in IoT environment. [ABSTRACT FROM AUTHOR]

Metal oxide arrester (MOA) is an electric power equipment used to limit overvoltage and cooperate insulation between generator substation and direct current converter station. In the actual operation of MOA, due to the abnormal leakage current will produce various faults, the significant increasing of its resistive component will cause thermal effect, and even explosion, so as to lose the protection for the MOA. Particularly, in the transition from preventive maintenance to state maintenance, the importance of its safe operation or fault diagnosis is undoubted. Since the 1990s, fault diagnosis of MOA in operation has been very popular, and it is still popular today. After decades of unremitting efforts, we have accumulated rich experience in fault diagnosis of MOA, and also explored some new fault diagnosis methods and means. With the rise of wireless network technology, its network construction, maintenance, and other aspects have incomparable advantages of wired. Therefore, adopting wireless online monitoring to track MOA status can greatly improve the flexibility, real-time, and accuracy of fault diagnosis, and reduce the error and cost of wired data transmission. In this study, the monitoring module can realize the real-time transmission of MOA operation characteristics to the control terminal through wireless networks, judge the running status and insulation performance of the MOA by the change of the basic component of the resistance current, and then diagnose the fault of the MOA by the proposed weighted k-nearest neighbors algorithm. The simulation results show that the proposed method has very high precision and accuracy in fault diagnosis of MOA, as well as high recall and F1. [ABSTRACT FROM AUTHOR]

Nowadays, wireless sensor networks (WSNs) are utilised in military-based applications like border surveillance. However, existing border surveillance methods have difficulties with energy efficiency, latency, security, connectivity, optimal path selection and coverage. In this paper, a Voronoi Modified Red Fox (VMRF) algorithm is proposed as a solution to these problems. Initially, secure cluster head (CH) selection and clustering is performed using Secure Spatial Intelligence-Enhanced Voronoi Clustering (SIEVC) to boost energy efficiency, security, and extend network coverage and connectivity. The SIEVC algorithm dynamically selects CHs based on past and present trust, identity trust, and energy trust to identify malicious nodes and form optimal clusters for improved network coverage and connectivity. It also employs dynamic cluster size adjustment to maintain proximity between CHs and cluster members and utilizes node alternation to ensure equitable cluster sizes. This approach minimizes energy depletion, enhances network longevity, and improves load balancing. The algorithm introduces a node alternation mechanism to balance cluster sizes and prevent energy holes. This approach ensures secure and efficient CH selection and promotes even energy distribution. Then the proposed modified red fox (MRF) optimization method, based on the fitness metric, computes the energy-efficient and safe path for data transmission. Trust, energy, distance, link quality and traffic intensity are the factors that the fitness function takes into account. Finally, the data is transmitted to the base station (BS) through CH along the path with the highest fitness value. Then the proposed VMRF algorithm is evaluated using the NS-2 platform, and the outcomes are compared with existing protocols. Based on the evaluations, the VMRF algorithm performs better than existing ones in terms of delay, energy consumption, throughput, packet delivery ratio (PDR), malicious node detection ratio, and residual energy. [ABSTRACT FROM AUTHOR]

With the continuous development of remote sensing technology, the data volume of remote sensing images has increased exponentially, resulting in many difficulties in the storage, management, transmission, calculation, and other processes of remote sensing images. In order to solve the above problems, this paper studies the use of the Hadoop Distributed File System (HDFS) and related technologies to design and implement a browser/server (B/S) architecture for a massive, multisource, remote sensing images distributed storage management system. The image data are stored in the HDFS, and the image metadata are stored in a MySQL database. The distributed parallel construction of the image pyramid is completed based on the Spark computing engine, and the Akka framework is used to construct WMTS (Web Map Tile Service) to realize the release of remote sensing images. Finally, the rapid visual display of remote sensing images is carried out using Leaflet. The system also supports image data management, image target detection, user management, and other functions. After testing, this system can support the storage and management of multisource remote sensing image data, and can solve perfectly the problems of insufficient storage space and insufficient computing power of a single server. It is found that the upload and download speeds of a large amount of remote sensing images can be close to the maximum speed of a gigabit local area network (LAN). In the gigabit LAN environment, the average upload speed of a single remote sensing image is 97.74 MB/s, and the average download speed is 87.62 MB/s. In terms of image pyramid construction, the speed of a multi-node parallel construction based on Spark is two times higher than that of a single-node construction. Additionally, compared to similar systems, this system has better data transmission and retrieval speed, better data computing ability, and higher concurrency processing ability. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) have recently been viewed as the foundation infrastructure that has paved the way for the emergence of the Internet of Things (IoT). However, there is a challenge when integrating WSNs into the IoT due to high-energy consumption in their nodes and poor network lifespan. As a result, the fundamental issues in WSN are sensor node energy scarcity, sensor data exchange, and routing protocols. To address the aforementioned shortcomings, this paper proposes an optimized energy-efficient path-planning approach that increases network lifetime and connectivity. These applications employ large amounts of data and need a data that are more effective sensing and data transfer method. This study presents Improvised DSHR (Dual Step Hybrid Routing) - a methodology for cluster-based routing efficiency. It consists of a two-phase method designed to identify the best route taking clustering into account. In addition, it consists of cluster head selection, optimum route building, node integration with the cluster head, and sensing range optimization. Furthermore, an efficient data transmission. Improvised DSHR is evaluated considering network lifetime, communication overhead, no active nodes, and Route Length evaluated, and then the model is compared to the current Leach protocol to demonstrate its efficiency. [ABSTRACT FROM AUTHOR]

Over the preceding decade, there has been a discernible surge in the prominence of artificial intelligence, marked by the development of various methodologies, among which deep learning emerges as a particularly auspicious technique. The captivating attribute of deep learning, characterised by its capacity to glean intricate feature representations from data, has served as a catalyst for pioneering approaches and methodologies spanning a multitude of domains. In the face of the burgeoning exponential growth in digital medical image data, the exigency for adept image compression methodologies has become increasingly pronounced. These methodologies are designed to preserve bandwidth and storage resources, thereby ensuring the seamless and efficient transmission of data within medical applications. The critical nature of medical image compression accentuates the imperative to confront the challenges precipitated by the escalating deluge of medical image data. This review paper undertakes a comprehensive examination of medical image compression, with a predominant focus on sophisticated, research-driven deep learning techniques. It delves into a spectrum of approaches, encompassing the amalgamation of deep learning with conventional compression algorithms and the application of deep learning to enhance compression quality. Additionally, the review endeavours to explicate these fundamental concepts, elucidating their inherent characteristics, merits, and limitations. [ABSTRACT FROM AUTHOR]