Efficient Route Management Method for Mobile Nodes in 6TiSCH Network.
Ontology highlight
ABSTRACT:
SUBMITTER: Kim MJ
PROVIDER: S-EPMC8125023 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:This paper proposes a data delivery method based on neighbor nodes' information to achieve reliable communication in a mobile ad hoc network (MANET). In a MANET, it is difficult to deliver data reliably due to instabilities in network topology and wireless network condition which result from node movement. To overcome such unstable communication, opportunistic routing and network coding schemes have lately attracted considerable attention. Although an existing method that employs such schemes, MAC-independent opportunistic routing and encoding (MORE), Chachulski et al. (2007), improves the efficiency of data delivery in an unstable wireless mesh network, it does not address node movement. To efficiently deliver data in a MANET, the method proposed in this paper thus first employs the same opportunistic routing and network coding used in MORE and also uses the location information and transmission probabilities of neighbor nodes to adapt to changeable network topology and wireless network condition. The simulation experiments showed that the proposed method can achieve efficient data delivery with low network load when the movement speed is relatively slow.
| S-EPMC3932211 | biostudies-other
Project description:Network traffic prediction is an important network monitoring method, which is widely used in network resource optimization and anomaly detection. However, with the increasing scale of networks and the rapid development of 5-th generation mobile networks (5G), traditional traffic forecasting methods are no longer applicable. To solve this problem, this paper applies Long Short-Term Memory (LSTM) network, data augmentation, clustering algorithm, model compression, and other technologies, and proposes a Cluster-based Lightweight PREdiction Model (CLPREM), a method for real-time traffic prediction of 5G mobile networks. We have designed unique data processing and classification methods to make CLPREM more robust than traditional neural network models. To demonstrate the effectiveness of the method, we designed and conducted experiments in a variety of settings. Experimental results confirm that CLPREM can obtain higher accuracy than traditional prediction schemes with less time cost. To address the occasional anomaly prediction issue in CLPREM, we propose a preprocessing method that minimally impacts time overhead. This approach not only enhances the accuracy of CLPREM but also effectively resolves the real-time traffic prediction challenge in 5G mobile networks.
| S-EPMC10984461 | biostudies-literature
Project description:Background: The identification of the causal SNPs of complex diseases in large-scale genome-wide association analysis is beneficial to the studies of pathogenesis, prevention, diagnosis and treatment of these diseases. However, existing applicable methods for large-scale data suffer from low accuracy. Developing powerful and accurate methods for detecting SNPs associated with complex diseases is highly desired. Results: We propose a score-based two-stage Bayesian network method to identify causal SNPs of complex diseases for case-control designs. This method combines the ideas of constraint-based methods and score-and-search methods to learn the structure of the disease-centered local Bayesian network. Simulation experiments are conducted to compare this new algorithm with several common methods that can achieve the same function. The results show that our method improves the accuracy and stability compared to several common methods. Our method based on Bayesian network theory results in lower false-positive rates when all correct loci are detected. Besides, real-world data application suggests that our algorithm has good performance when handling genome-wide association data. Conclusion: The proposed method is designed to identify the SNPs related to complex diseases, and is more accurate than other methods which can also be adapted to large-scale genome-wide analysis studies data.
| S-EPMC9520706 | biostudies-literature
Project description:Previous research indicates age-related impairments in learning routes from a start location to a target destination. There is less research on age effects on the ability to reverse a learned path. The method used to learn routes may also influence performance. This study examined how encoding methods influence the ability of younger and older adults to recreate a route in a virtual reality environment in forward and reverse directions. Younger (n = 50) and older (n = 50) adults learned a route either by self-navigation through the virtual environment or through studying a map. At test, participants recreated the route in the forward and reverse directions. Older adults in the map study condition had greater difficulty learning the route in the forward direction compared to younger adults. Older adults who learned the route by self-navigation were less accurate in traversing the route in the reverse compared to forward direction after a delay. In contrast, for older adults who learned via map study there were no significant differences between forward and reverse directions. Results suggest that older adults may not as readily develop and retain a sufficiently flexible representation of the environment during self-navigation to support accurate route reversal. Thus, initially learning a route from a map may be more difficult for older adults, but may ultimately be beneficial in terms of better supporting the ability to return to a start location. (PsycINFO Database Record
| S-EPMC5489070 | biostudies-literature
Project description:Lymph nodes (LNs) filter lymph to mount effective immune responses. Small soluble lymph-borne molecules from the periphery enter the draining LNs via a reticular conduit system. Intact antibodies and other larger molecules, in contrast, are physically unable to enter the conduits, and they are thought to be transported to the LNs only within migratory DCs after proteolytic degradation. Here, we discovered that lymph-borne antibodies and other large biomolecules enter within seconds into the parenchyma of the draining LN in an intact form. Mechanistically, we found that the uptake of large molecules is a receptor-independent, fluid-phase process that takes place by dynamin-dependent vesicular transcytosis through the lymphatic endothelial cells in the subcapsular sinus of the LN. Physiologically, this pathway mediates a very fast transfer of large protein antigens from the periphery to LN-resident DCs and macrophages. We show that exploitation of the transcytosis system allows enhanced whole-organ imaging and spatially controlled lymphocyte activation by s.c. administered antibodies in vivo. Transcytosis through the floor of the subcapsular sinus thus represents what we believe to be a new physiological and targetable mode of lymph filtering.
| S-EPMC6668680 | biostudies-literature
Project description:Biological network data, such as metabolic-, signaling- or physical interaction graphs of proteins are increasingly available in public repositories for important species. Tools for the quantitative analysis of these networks are being developed today. Protein network-based drug target identification methods usually return protein hubs with large degrees in the networks as potentially important targets. Some known, important protein targets, however, are not hubs at all, and perturbing protein hubs in these networks may have several unwanted physiological effects, due to their interaction with numerous partners. Here, we show a novel method applicable in networks with directed edges (such as metabolic networks) that compensates for the low degree (non-hub) vertices in the network, and identifies important nodes, regardless of their hub properties. Our method computes the PageRank for the nodes of the network, and divides the PageRank by the in-degree (i.e., the number of incoming edges) of the node. This quotient is the same in all nodes in an undirected graph (even for large- and low-degree nodes, that is, for hubs and non-hubs as well), but may differ significantly from node to node in directed graphs. We suggest to assign importance to non-hub nodes with large PageRank/in-degree quotient. Consequently, our method gives high scores to nodes with large PageRank, relative to their degrees: therefore non-hub important nodes can easily be identified in large networks. We demonstrate that these relatively high PageRank scores have biological relevance: the method correctly finds numerous already validated drug targets in distinct organisms (Mycobacterium tuberculosis, Plasmodium falciparum and MRSA Staphylococcus aureus), and consequently, it may suggest new possible protein targets as well. Additionally, our scoring method was not chosen arbitrarily: its value for all nodes of all undirected graphs is constant; therefore its high value captures importance in the directed edge structure of the graph.
| S-EPMC3558500 | biostudies-literature
Project description:Functional connectivity (FC) analysis of fMRI data typically rests on prior identification of network nodes from activation profiles. We compared Activation Likelihood Estimate (ALE) and the Experimentally Derived Estimate (EDE) approaches to network node identification and functional inference for both verbal and visual forms of working memory. ALE arrives at canonical activation maxima that are assumed to reliably represent peaks of brain activity underlying a psychological process (e.g., working memory). By comparison, EDEs of activation maxima are typically derived from individual participant data, and are thus sensitive to individual participant activation profiles. Here, nodes were localized by both ALE and EDE methods for each participant, and subsequently extracted time series were compared using connectivity analysis. Two sets of significance tests were performed: (1) correlations computed between nodal time series of each method were compared, and (2) correlations computed between network edges (functional connections) of each network node pair were compared. Large proportions of edge correlations significantly differed between methods. ALE effectively summarizes working memory network node locations across studies and subjects, but the sensitivity to individual functional loci suggest that EDE methods provide individualized estimates of network connectivity. We suggest that a hybrid method incorporating both ALE and EDE is optimal for network inference.
| S-EPMC6865526 | biostudies-literature
Project description:In this paper, we propose a deep convolutional neural network for camera based wildfire detection. We train the neural network via transfer learning and use window based analysis strategy to increase the fire detection rate. To achieve computational efficiency, we calculate frequency response of the kernels in convolutional and dense layers and eliminate those filters with low energy impulse response. Moreover, to reduce the storage for edge devices, we compare the convolutional kernels in Fourier domain and discard similar filters using the cosine similarity measure in the frequency domain. We test the performance of the neural network with a variety of wildfire video clips and the pruned system performs as good as the regular network in daytime wild fire detection, and it also works well on some night wild fire video clips.
| S-EPMC7287837 | biostudies-literature
Project description:Node-Link diagrams make it possible to take a quick glance at how nodes (or actors) in a network are connected by edges (or ties). A conventional network diagram of a "contact tree" maps out a root and branches that represent the structure of nodes and edges, often without further specifying leaves or fruits that would have grown from small branches. By furnishing such a network structure with leaves and fruits, we reveal details about "contacts" in our ContactTrees upon which ties and relationships are constructed. Our elegant design employs a bottom-up approach that resembles a recent attempt to understand subjective well-being by means of a series of emotions. Such a bottom-up approach to social-network studies decomposes each tie into a series of interactions or contacts, which can help deepen our understanding of the complexity embedded in a network structure. Unlike previous network visualizations, ContactTrees highlight how relationships form and change based upon interactions among actors, as well as how relationships and networks vary by contact attributes. Based on a botanical tree metaphor, the design is easy to construct and the resulting tree-like visualization can display many properties at both tie and contact levels, thus recapturing a key ingredient missing from conventional techniques of network visualization. We demonstrate ContactTrees using data sets consisting of up to three waves of 3-month contact diaries over the 2004-2012 period, and discuss how this design can be applied to other types of datasets.
| S-EPMC4718622 | biostudies-literature
Project description:Communication between and within brain regions is essential for information processing within functional networks. The current methods to determine the influence of one region on another are either based on temporal resolution, or require a predefined model for the connectivity direction. However these requirements are not always achieved, especially in fMRI studies, which have poor temporal resolution. We thus propose a new graph theory approach that focuses on the correlation influence between selected brain regions, entitled Dependency Network Analysis (DEPNA). Partial correlations are used to quantify the level of influence of each node during task performance. As a proof of concept, we conducted the DEPNA on simulated datasets and on two empirical motor and working memory fMRI tasks. The simulations revealed that the DEPNA correctly captures the network's hierarchy of influence. Applying DEPNA to the functional tasks reveals the dynamics between specific nodes as would be expected from prior knowledge. To conclude, we demonstrate that DEPNA can capture the most influencing nodes in the network, as they emerge during specific cognitive processes. This ability opens a new horizon for example in delineating critical nodes for specific clinical interventions.
| S-EPMC4895213 | biostudies-literature