End Nodes Research Articles

ACORN+: Adaptive Compression-Reconstruction for Device-Cloud Collaboration Video Services

With the improvement of edge-based autonomous systems such as mobile Industrial IoT(IIoT) networks, edge devices can capture and upload videos with increasing bitrates. Massive edge-computing end nodes are eager for adequate multimedia data to satisfy the requirements of real-time video services. However, existing encoding standards for video services in Web 2.0 are specifically designed for something other than IoT video streaming. We have improved our Adaptive Compression-Reconstruction framework ACORN to obtain ACORN+, based on compressed sensing and recent advances in deep learning. At end nodes, we compress multiple sequential video frames into a single frame to reduce video volume. Given that multiple kinds of intelligent tasks are expected to be finished on the device side, we also designed a device-cloud collaboration scheme where deep learning-based algorithms can be executed on both the device and server sides. Experiments reveal that video analytics can be conducted on compressed frames. Taking action recognition as a device-cloud collaboration use case, we find ACORN+ obtains more than 3x speedup on compressed frames. The reconstruction algorithm in ACORN+ is with 1- 4 dB improvements. Moreover, the encoding time cost and the encoded video volume are reduced by more than 4x under the ACORN+ framework. 1

Multi-hop Quantum Teleportation Based on HSES via GHZ-like States

Abstract Implementing quantum wireless multi-hop network communication is essential to improve the global quantum network system. In this paper, we employ eight-level GHZ states as quantum channels to realize multi-hop quantum communication, and utilize the logical relationship between the measurements of each node to derive the unitary operation performed by the end node. The Hierarchical Simultaneous Entanglement Switching (HSES) method is adopted, resulting in a significant reduction in the consumption of classical information compared to the multi-hop quantum teleportation (QT) based on general Simultaneous Entanglement Switching (SES). In addition, the proposed protocol is simulated on the IBM Quantum Experiment Platform (IBM QE). Then, the data obtained from the experiment is analyzed using quantum state tomography, which verifies the protocol's good fidelity and accuracy. Finally, by calculating fidelity, we analyze the impact of four different types of noise (phase-damping, amplitude-damping, phase-flip, and bit-flip noise) in this protocol.

Preparing remote states for genuine quantum networks

Quantum networks typically comprise quantum channels, repeaters, and end nodes. Remote state preparation (RSP) allows one end node to prepare the states of the other end nodes remotely. While quantum discord has recently been recognized as necessary for RSP, it does not guarantee the practical implementation of RSP in quantum networks surpasses any classical method. Herein, we theoretically introduce and experimentally study a quantum resource that we call the RSP capability. This resource validates all the static and dynamic elements required to enable genuine quantum networks where the RSP’s implementation can outperform any classical emulation of entanglement- and qubit-unitaries-free strategies, including the static resources of Einstein-Podolsky-Rosen pairs and the dynamic resources of quantum channels and repeaters. Our experiment measures the RSP capability to demonstrate the transition between classical and nonclassical RSP depending on the photon-pair qualities. It shows that quantum discord does not confirm a nonclassical RSP, but the RSP capability does. These results help reveal the quantum advantages that emerge when networking RSP is in play.

Collision Avoidance Adaptive Data Rate Algorithm for LoRaWAN

Long-Range Wide-Area Network (LoRaWAN) technology offers efficient connectivity for numerous end devices over a wide coverage area in the Internet of Things (IoT) network, enabling the exchange of data over the Internet between even the most minor Internet-connected devices and systems. One of LoRaWAN’s hallmark features is the Adaptive Data Rate (ADR) algorithm. ADR is a resource allocation function which dynamically adjusts the network’s data rate, airtime, and energy dissipation to optimise its performance. The allocation of spreading factors plays a critical function in defining the throughput of the end device and its robustness to interference. However, in practical deployments, LoRaWAN networks experience considerable interference, severely affecting the packet delivery ratio, energy utilisation, and general network performance. To address this, we present a novel ADR framework, SSFIR-ADR, which utilises randomised spreading factor allocation to minimise energy consumption and packet collisions while maintaining optimal network performance. We implement a LoRa network composed of a single gateway that connects loads of end nodes to a network server. In terms of energy use, packet delivery rate, and interference rate (IR), our simulation implementation does better than LoRaWAN’s legacy ADR scheme for a range of application data intervals.

A network of transient domains for breaking symmetry during anterior-posterior axis formation in the porcine embryo.

Breaking radial symmetry for anterior-posterior axis formation is one of the key developmental steps of vertebrate gastrulation and is established through a succession of transient domains defined by morphology or gene expression. Three such domains were interpreted recently in the rabbit to be part of a "three-anchor-point model" for axis formation. To answer the question as to whether the model is generally applicable to mammals, the dynamic expression patterns of four marker genes were analyzed in the pig, where gastrulating epiblast forms from half the inner cell mass: EOMES and PKDCC transcripts display decreasing expression intensities in the anterior hypoblast and-together with WNT3-increasing intensity in the anterior streak domain and the node; TBX6 expression changes from an initial central expression to exclusive expression in the posterior extremity of the primitive streak. The anterior streak domain has thus a molecular footprint similar to the one in the rabbit, the end node shares TBX6 between the species, while the anterior hypoblast-mirroring specific porcine epiblast derivation and fate-is marked by PKDCC instead of WNT3. The molecular similarities in transient domains point to conserved mechanisms for establishing the mammalian anterior-posterior axis and, possibly, breaking radial symmetry.

Spatial interpolation of global DEM using federated deep learning

The digital elevation model (DEM) provides important data support for 3D terrain modeling. However, due to the complex and changeable terrain in the real world and the high cost of field measurement, it is extremely difficult to obtain continuous and high-density elevation data directly. Therefore, it is necessary to rely on spatial interpolation technology to restore the DEM overall picture in the original sampling area. The traditional spatial interpolation method usually has the characteristics of low model complexity and high computational cost, which leads to low real-time performance and low precision of the interpolation process. The interpolation operation based on DEM data can be considered as a special image generation process where the input is a DEM image with missing values and the output is a complete DEM image. At present, a large number of studies have proved that deep learning methods are very effective in image generation tasks. However, the training of deep learning models requires the support of a large number of high-quality data sets. DEM data in various countries, especially in key regions, are usually restricted by privacy protection regulations and cannot be disclosed. The emergence of Federated Learning (FL) provides a new solution, which supports local training on multiple end nodes, without sending local data to a remote center server for centralized training, effectively protecting data privacy. In this study, we propose a DEM interpolation model based on FL and multiScale U-Net. The experimental results show that compared with the traditional method, this model has faster processing speed and lower interpolation precision. At the same time, this research result provides a new way for efficient and secure use of terrain information, especially in those application scenarios that have strict requirements for DEM data privacy and security.

Optimized design of horseshoe-and-spur filterless networks leveraging point-to-multipoint coherent pluggable transceivers

Cutting-edge network architectures and solutions are needed to empower operators to address capacity demands in metro and access networks efficiently. The horseshoe topology, along with similar topologies, is commonly employed in metro-aggregation segments due to its compatibility with the hub-and-spoke traffic pattern present in these networks and the survivability that they can provide. A filterless architecture can enhance cost-effectiveness by replacing active elements with passive components. Moreover, supporting coherent-based point-to-multipoint transceivers—enabled by digital subcarrier multiplexing (DSCM)—can yield additional cost savings. It is noteworthy that telecommunication network topologies often evolve to accommodate more end (leaf) nodes, extending the original horseshoe with spurs or small and short trees. This paper targets these types of networks and proposes combining the utilization of coherent pluggable transceivers leveraging DSCM to guarantee transparent communication between the hub and leaf nodes while adopting different filterless node architectures with selective amplifier deployment. Moreover, it discusses the potential advantages of the architecture using an exact optimization framework tailored to various network sizes and scenarios, which accounts for the amplifiers’ placement and the available types of power splitters/combiners/couplers. The results demonstrate that strategically deploying add/drop and express amplifiers, along with optimizing coupler ratios, can effectively meet design requirements while minimizing the number of optical amplifiers required.

Rapid and Resilient LoRa Leap: A Novel Multi-Hop Architecture for Decentralised Earthquake Early Warning Systems.

We introduce a novel LoRa-based multi-hop communication architecture as an alternative to the public internet for earthquake early warning (EEW). We examine its effectiveness in generating a meaningful warning window for the New Zealand-based decentralised EEW sensor network implemented by the CRISiSLab operating with the adapted Propagation of Local Undamped Motion (PLUM)-based earthquake detection and node-level data processing. LoRa, popular for low-power, long-range applications, has the disadvantage of long transmission time for time-critical tasks like EEW. Our network overcomes this limitation by broadcasting EEWs via multiple short hops with a low spreading factor (SF). The network includes end nodes that generate warnings and relay nodes that broadcast them. Benchmarking with simulations against CRISiSLab's EEW system performance with internet connectivity shows that an SF of 8 can disseminate warnings across all the sensors in a 30 km urban area within 2.4 s. This approach is also resilient, with the availability of multiple routes for a message to travel. Our LoRa-based system achieves a 1-6 s warning window, slightly behind the 1.5-6.75 s of the internet-based performance of CRISiSLab's system. Nevertheless, our novel network is effective for timely mental preparation, simple protective actions, and automation. Experiments with Lilygo LoRa32 prototype devices are presented as a practical demonstration.

A putative scenario of how de novo protein-coding genes originate in the Saccharomyces cerevisiae lineage

BackgroundNovel protein-coding genes were considered to be born by re-organization of pre-existing genes, such as gene duplication and gene fusion. However, recent progress of genome research revealed that more protein-coding genes than expected were born de novo, that is, gene origination by accumulating mutations in non-genic DNA sequences. Nonetheless, the in-depth process (scenario) for de novo origination is not well understood.ResultsWe have conceived bioinformatic analysis for sketching a scenario for de novo origination of protein-coding genes. For each de novo protein-coding gene, we firstly identified an edge of a given phylogenetic tree where the gene was born based on parsimony. Then, from a multiple sequence alignment of the de novo gene and its orthologous regions, we constructed ancestral DNA sequences of the gene corresponding to both end nodes of the edge. We finally revealed statistical features observed in evolution between the two ancestral sequences. In the analysis of the Saccharomyces cerevisiae lineage, we have successfully sketched a putative scenario for de novo origination of protein-coding genes. (1) In the beginning was GC-rich genome regions. (2) Neutral mutations were accumulated in the regions. (3) ORFs were extended/combined, and then (4) translation signature (Kozak consensus sequence) was recruited. Interestingly, as the scenario progresses from (2) to (4), the specificity of mutations increases.ConclusionTo the best of our knowledge, this is the first report outlining a scenario of de novo origination of protein-coding genes. Our bioinformatic analysis can capture events that occur during a short evolutionary time by directly observing the evolution of the ancestral sequences from non-genic to genic. This property is suitable for the analysis of fast evolving de novo genes.

Machine learning-based DDOS attack detection and mitigation in SDNs for IoT environments

Software-defined network (SDN) platforms play a key role in providing security against today's Internet attacks. SDNs decouple the control plane from the data plane to maximize network performance. A DDOS attack is one of several in cloud-based networks. SDNs play a crucial role in controlling DDoS attacks and protecting end nodes like IoT nodes, as well as other computing devices, in large-scale cloud networks. This paper provides an efficient approach to DDoS attack detection and prevention using machine learning algorithms. The paper analyses the performance of SDNs in IoT systems, incorporating a huge set of computing devices that use multi-controllers. It also proposes an effective method to handle DDoS attacks. DDoS attacks are generated from IoT end devices in the infrastructure layer, which targets resources via an SDN-controlled testbed. The proposed ML method outperforms existing methods in terms of accurately and effectively detecting and mitigating flooding DDoS attacks with 99.99% accuracy. The proposed work's results are also compared to the results of other articles to prove the effectiveness of the results.

Combining hierarchies for spatial reasoning of hierarchical relations among places in different contexts

Spatial reasoning of hierarchical relations is an important research topic in geographic information science. Existing literature focuses mainly on hierarchical relations according to ordered containment of point sets based on the 9-Intersection Model (9IM). However, in natural language descriptions, hierarchical relations expressed by prepositions such as in can have spatial configurations conflicting with those hierarchical relations based on 9IM. This paper proposes an algorithm employing combined hierarchies to infer hierarchical relations among places in different contexts. Two graph databases containing combined hierarchies conforming to administrative reach and geometric enclosure are established with places represented by polygons with misaligned boundaries on prototypical and real data. The 13170 pairs of conflicting hierarchical relations with the same start nodes but different end nodes detected in the combined hierarchies on real data validate the proposed algorithm for spatial reasoning of hierarchical relations in different contexts. This research facilitates consistent spatial reasoning of hierarchical relations in different contexts for spatial information retrieval and question answering.

Reduced Element for Adaptive Finite Element Analysis of First-Order IVP with Built-in Error Estimator in Maximum Norm

This paper proposes a novel yet simple approach to the adaptive finite element (FE) analysis of the first-order Initial Value Problems (IVPs) in the maximum norm by introducing the reduced element technique. In the present approach, the FE solution uh of the conventional Galerkin element of degree m + 1 is decomposed into two parts: a reduced solution uRh from the reduced element of degree m obtained by ignoring the highest degree term of uh, and a built-in point-wise error estimator εRh directly given by the ignored term. Since the end node solutions of the reduced element are inherited from the full order element, it gains O(h2m+2) accuracy and achieves a nodal/element accuracy ratio as high as two, which greatly enhances its adaptive capability regarding solving IVPs on long time domains. The related error analysis is addressed and a complete adaptivity algorithm is given. Typical numerical examples of both linear and nonlinear IVPs of both single and systems of equations are presented to show the validity and effectiveness of the proposed approach.

Scalable determination of multipartite entanglement in quantum networks

Quantum networks comprised of entangled end nodes serve stronger than the classical correlation for unparalleled quantum internet applications. However, practical quantum networking is affected by noise, which at its worst, causes end nodes to be described by pre-existing classical data. In such untrusted networks, determining quantum network fidelity and genuine multi-node entanglement becomes crucial. Here, we show that determining quantum network fidelity and genuine N-node entanglement in an untrusted star network requires only N + 1 measurement settings. This method establishes a semi-trusted framework, allowing some nodes to relax their assumptions. Our network determination method is enabled by detecting genuine N-node Einstein-Podolsky-Rosen steerability. Experimentally, using spontaneous parametric down-conversion entanglement sources, we demonstrate the determinations of genuine 3-photon and 4-photon quantum networks and the false positives of the widely used entanglement witness, the fidelity criterion of 1/2. Our results provide a scalable method for the determination of multipartite entanglement in realistic quantum networks.

Adaptive context-aware access control for IoT environments leveraging fog computing

The increasing use of the Internet of Things (IoT) has driven the demand for enhanced and robust access control methods to protect resources from unauthorized access. A cloud-based access control approach brings significant challenges in terms of communication overhead, high latency, and complete reliance. In this paper, we propose a Fog-Based Adaptive Context-Aware Access Control (FB-ACAAC) framework for IoT devices, dynamically adjusting access policies based on contextual information to prevent unauthorised resource access. The main purpose of FB-ACAAC is to provide adaptability to changing access behaviors and context by bringing decision-making and information about policies closer to the end nodes of the network. FB-ACAAC improves the availability of resources and reduces the amount of time for information to be processed. FB-ACAAC extends the widely used eXtensible Access Control Markup Language (XACML) to manage access control decisions. Traditional XACML-based methods do not take into account changing environments, different contexts, and changing access behaviors and are vulnerable to certain types of attacks. To address these issues, FB-ACAAC proposes an adaptive context-aware XACML scheme for heterogeneous distributed IoT environments using fog computing and is designed to be context-aware, adaptable, and secure in the face of unauthorised access. The effectiveness of this new scheme is verified through experiments, and it has a low processing time overhead while providing extra features and improved security.

BPNN‐based flow classification and admission control for software defined IIoT

AbstractFlow admission control (FAC) aims to efficiently manage the service requests while maximizing the network utilization. With multiple connection requests, access delay or even service interruption may occur. This paper proposes a novel FAC approach to reduce the contention between the end nodes and ensure high utilization of the networking resources for software defined IIoT. First, incoming flows are classified into different priorities using back propagation neural network based on selected features representing the current network status. Second, with the designed flow admission policies, bandwidth and buffer size are estimated with stochastic network calculus model. Finally, the thresholds of the proposed FAC scheme are dynamically decided based on the above two parameters. Various flows are admitted or rejected via the proposed FAC to maintain real time processing. Unlike traditional FAC schemes rely on static priority systems, the proposed scheme leverages machine learning technique for dynamic flow prioritization and the stochastic network calculus model for precise estimation. Computer simulation reveals that the proposed scheme accurately classifies the flows, and substantially decreases the transmission delay and improves the network utilization compared to the existing FAC schemes. This highlights the superiority of the proposed scheme meeting the demands of software defined IIoT.

Hamiltonian Laceability of Hypercubes with Prescribed Linear Forest and/or Faulty Edges

A node in the n -dimensional hypercube Q n is called an odd node (resp. an even node) if the sum of all digits of the node is odd (resp. even). Let F ⊂ E ( Q n ) and let L be a linear forest in Q n − F such that | E ( L ) | + | F | ≤ n − 2 for n ≥ 2 . Let x be an odd node and y an even node in Q n such that none of the paths in L has x or y as internal node or both of them as end nodes. In this note, we prove that there is a Hamiltonian path between x and y passing through L in Q n − F . The upper bound n − 2 on | E ( L ) | + | F | is sharp.

Machine learning deployment for energy monitoring of Internet of Things nodes in smart agriculture

SummaryLow‐Power Wide‐Area Network technologies, such as LoRa, are gaining popularity in the agricultural sector for field deployment. The crucial factors in these devices are their range and power efficiency. The energy consumption of a LoRa wireless sensor network is predominantly affected by transmission parameters like carrier frequency, bandwidth, transmit power, spreading factor, and coding rate. Incorrect chosen transmission parameters can lead to a reduction in the battery life of end nodes, requiring frequent battery replacements—a situation undesirable for field deployment. This study introduces a machine learning deployment in the form of a web application designed to monitor the energy consumption of end nodes in LoRa wireless sensor networks. The research initially employs 12 regression models, including Linear, Random Forest, K‐Nearest Neighbours, Decision Tree, Support Vector, Lasso, Ridge, AdaBoost, Gradient Boost, XGBoost, CatBoost, and LightGBM models. The findings of the study reveal that the LightGBM model surpasses other models in accurately predicting the energy consumption of Internet of Things (IoT) nodes, leading to its selection for the web application. This machine learning web application can be implemented in a programmable Long Range Wide Area Network (LoRaWAN) gateway to effectively monitor the energy consumption of IoT end nodes in the agricultural sector.

Optimal multi-objective sizing of renewable energy sources and battery energy storage systems for formation of a multi-microgrid system considering diverse load patterns

Optimal microgrid design is pivotal in planning active distribution networks (ADNs) with intermittent renewable energy sources (RESs) and battery energy storage systems (BESSs). This paper introduces an innovative approach to clustering existing ADN systems, incorporating RESs and BESSs into a set of microgrids (MGs) termed a multi-microgrid (MMG). The approach accommodates diverse load patterns, considering the dynamic nature of residential, commercial, and industrial loads. The proposed methodology employs an innovative k-means algorithm that utilizes end node characteristics based on the graph partitioning method and the Silhouette technique, transforming the existing system into an MMG framework. Furthermore, an iterative pareto-fuzzy (IPF) method is suggested to determine optimal RES and BESS sizes, considering reliability, total cost, and the unutilized surplus power function. The framework integrates total line losses into the generation adequacy assessment of energy management strategy (EMS) for each MG within the MMG system. The design and performance analysis of the proposed multi-objective optimization algorithm is tested on the IEEE 33-bus distribution system. The implementation of the independent operation index (IOI) and round-trip efficiency (RTE) metrics demonstrates the effectiveness of the proposed approach in constructing an MMG, with achieved values exceeding 90 percent for IOI and 77 percent for RTE.

IoT-based Machine Learning Comparative Models of Stream Water Parameters Forecasting for Freshwater Lobster

Water quality parameters such as dissolved oxygen, pH, and mineral content are important factors for aquaculture. Predictive analytics can predict water conditions in aquaculture and significantly reduce the mortality probability of aquaculture products. This paper applied stream predictive analytics to the freshwater lobster farming dataset where its real-time data supplied by End Node Unit (ENU) which integrated with dissolved oxygen (DO), potential hydrogen (pH), electrical conductivity (EC), and total dissolved solids (TDS). The real-time data of ENU in Structured Query Language (SQL) is normally displayed for remote monitoring and the analytics will only be done after in different processing platform called batch analytics. Instead of batch, this paper demonstrates capability of stream analytics where the real-time data query from ENU streaming through Structured Query Language (SQL) right into R Studio and Autoregressive Integrated Moving Average (ARIMA) predictions executed on the query table simultaneously on the same processing platform. Previously, ARIMA, Neural Network Autoregressive (NNETAR), and Naïve Bayes, were run and evaluated in R Studio to identify the best algorithm for stream analytics. Prediction procedure in R studio start with importing real-time data stored in SQL database and stream into R Studio using command of “dbGetQuery(con,sql)”. These three models evaluated the performance of freshwater lobster water conditions, dissolved oxygen (DO), potential hydrogen (pH), electrical conductivity (EC), and total dissolved solids (TDS). The data was collected for six months, and 70% was used as training data and 30% as test data. Compared to NNETAR and Naïve Bayes, ARIMA fits the entire data set well for 7 days; the ARIMA model exhibited lower absolute errors for pH and electrical conductivity, with errors ranging from 0.04 to 1.7 across days, while the NNETAR model had generally lower errors for TDS, with errors ranging from 0.3 to 0.7; however, the Naïve Bayes model's performance varied, with the lowest error for DO on day (5) 0.15 but higher errors for other parameters and days, including the highest error for electrical conductivity on day (6) 6.2. In conclusion, the average absolute errors for DO, pH, EC, and TDS are 0.163, 0.064, 0.705, and 0.498, respectively. Our findings underscore the efficacy of ARIMA for comprehensive water quality via stream prediction while highlighting the nuanced strengths and weaknesses of each model in forecasting specific parameters. This study contributes to the aquaculture literature by providing a nuanced comparative analysis of predictive models tailored to freshwater lobster farming, emphasizing the imperative role of stream predictive modelling. It enables real-time monitoring of water quality parameters, ensuring prompt interventions to maintain optimal conditions, thereby minimizing risks, enhancing aquaculture productivity, and ultimately contributing to sustainable and efficient freshwater lobster farming practices.

Learning Graph Representations Through Learning and Propagating Edge Features.

Graph convolutional networks have achieved considerable success in various graph domain tasks. Recently, numerous types of graph convolutional networks have been developed. A typical rule for learning a node's feature in these graph convolutional networks is to aggregate node features from the node's local neighborhood. However, in these models, the interrelation information between adjacent nodes is not well-considered. This information could be helpful to learn improved node embeddings. In this article, we present a graph representation learning framework that generates node embeddings through learning and propagating edge features. Instead of aggregating node features from a local neighborhood, we learn a feature for each edge and update a node's representation by aggregating local edge features. The edge feature is learned from the concatenation of the edge's starting node feature, the input edge feature, and the edge's end node feature. Unlike node feature propagation-based graph networks, our model propagates different features from a node to its neighbors. In addition, we learn an attention vector for each edge in aggregation, enabling the model to focus on important information in each feature dimension. By learning and aggregating edge features, the interrelation between a node and its neighboring nodes is integrated in the aggregated feature, which helps learn improved node embeddings in graph representation learning. Our model is evaluated on graph classification, node classification, graph regression, and multitask binary graph classification on eight popular datasets. The experimental results demonstrate that our model achieves improved performance compared with a wide variety of baseline models.