An improved PRoPHET routing protocol in delay tolerant network.
Ontology highlight
ABSTRACT:
SUBMITTER: Han SD
PROVIDER: S-EPMC4306380 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:A vehicular network offers diverse beneficial services related to video streaming in different types of setups, including rural and urban. Some of the recent issues in vehicular communication include prospect of leveraging machine learning and blockchain for privacy and security enhancement, and resource allocation for video streaming coupled with integration of 6G networks for high data rate. Considering the extreme mobility and dynamic structure of vehicular networks and the high data rates of video streams, a unitary route may not support the required quality of a video stream. To achieve load balancing, connectivity among vehicles, path diversity, and low delay, the multipath transmission with a delay-tolerant network (DTN) concept based on a node disjoint algorithm is considered. In this proposed study, video frames are categorized in accordance with priority and forwarded via two graded paths. The first path carries the video reference frame, which is the most important frame for video decoding. The second path carries neighboring frames during video transmission. For the efficient selection of an optimal relay vehicle, a communication cost function is introduced into the existing DTN. This communication cost function is based on three key enhancement parameters: link stability rate, accessible bandwidth estimation, and transmission delay. The improvement in this study, is the integration of store-carry-forward strategy to the existing multipath data forwarding strategy. On the basis of the simulation outcomes, the proposed multipath video data communication in a vehicular DTN (MVDTN) scheme can enhance video data delivery in terms of packet loss ratio, end-to-end delay, structural similarity index measure, and peak signal-to-noise ratio. Considering the aforementioned metrics, our proposed schemes outperform the baseline schemes, namely, road-based multi-metrics forwarder selection evaluation for multipath video streaming and quality of service-aware multipath video streaming for an urban vehicular ad hoc network by using ant colony optimization.
| S-EPMC9480984 | biostudies-literature
Project description:The number of Internet-connected devices grows very rapidly, with even fears of running out of available IP addresses. It is clear that the number of sensors follows this trend, thus inducing large sensor networks. It is insightful to make the comparison with the huge number of processors of modern supercomputers. In such large networks, the problem of node faults necessarily arises, with faults often happening in clusters. The tolerance to faults, and especially cluster faults, is thus critical. Furthermore, thanks to its advantageous topological properties, the torus interconnection network has been adopted by the major supercomputer manufacturers of the recent years, thus proving its applicability. Acknowledging and embracing these two technological and industrial aspects, we propose in this paper a node-to-node routing algorithm in an n-dimensional k-ary torus that is tolerant to faults. Not only is this algorithm tolerant to faulty nodes, it also tolerates faulty node clusters. The described algorithm selects a fault-free path of length at most n ( 2 k + ? k / 2 ? - 2 ) with an O ( n 2 k 2 | F | ) worst-case time complexity with F the set of faulty nodes induced by the faulty clusters.
| S-EPMC7309173 | biostudies-literature
Project description:With a more Internet-savvy and sophisticated user base, there are more demands for interactive applications and services. However, it is a challenge for existing radio access networks (e.g. 3G and 4G) to cope with the increasingly demanding requirements such as higher data rates and wider coverage area. One potential solution is the inter-collaborative deployment of multiple radio devices in a 5G setting designed to meet exacting user demands, and facilitate the high data rate requirements in the underlying networks. These heterogeneous 5G networks can readily resolve the data rate and coverage challenges. Networks established using the hybridization of existing networks have diverse military and civilian applications. However, there are inherent limitations in such networks such as irregular breakdown, node failures, and halts during speed transmissions. In recent years, there have been attempts to integrate heterogeneous 5G networks with existing ad hoc networks to provide a robust solution for delay-tolerant transmissions in the form of packet switched networks. However, continuous connectivity is still required in these networks, in order to efficiently regulate the flow to allow the formation of a robust network. Therefore, in this paper, we present a novel network formation consisting of nodes from different network maneuvered by Unmanned Aircraft (UA). The proposed model utilizes the features of a biological aspect of genomes and forms a delay tolerant network with existing network models. This allows us to provide continuous and robust connectivity. We then demonstrate that the proposed network model has an efficient data delivery, lower overheads and lesser delays with high convergence rate in comparison to existing approaches, based on evaluations in both real-time testbed and simulation environment.
| S-EPMC5156398 | biostudies-literature
Project description:In mobile wireless sensor network (MWSN), the lifetime of the network largely depends on energy efficient routing protocol. In the literature, cluster leader (CL) is selected based on remaining energy of mobile sensor nodes to enhance sensor network lifetime. In this study, a novel connectivity-based Low-Energy Adaptive Clustering Hierarchy-Mobile Energy Efficient and Connected (LEACH-MEEC) routing protocol was proposed, where CL is selected based on connectivity among neighboring nodes and the remaining energy of mobile sensor nodes. Consequently, it improves data delivery, network lifetime and balances the energy consumption. We studied various performance metrics including the number of alive nodes (NAN), remaining energy (RE) and packet delivery ratio (PDR). Our proposed LEACH-MEEC outperforms all other algorithms due to the connectivity metric. Moreover, the performance of mobility models was investigated through graphical and statistically tabulated results. The results show that Reference Point Group Mobility model (RPGM) is better than other mobility models.
| S-EPMC6308661 | biostudies-other
Project description:Routing optimization is a relevant problem in many contexts. Solving directly this type of optimization problem is often computationally intractable. Recent studies suggest that one can instead turn this problem into one of solving a dynamical system of equations, which can instead be solved efficiently using numerical methods. This results in enabling the acquisition of optimal network topologies from a variety of routing problems. However, the actual extraction of the solution in terms of a final network topology relies on numerical details which can prevent an accurate investigation of their topological properties. In fact, in this context, theoretical results are fully accessible only to an expert audience and ready-to-use implementations for non-experts are rarely available or insufficiently documented. In particular, in this framework, final graph acquisition is a challenging problem in-and-of-itself. Here we introduce a method to extract network topologies from dynamical equations related to routing optimization under various parameters' settings. Our method is made of three steps: first, it extracts an optimal trajectory by solving a dynamical system, then it pre-extracts a network, and finally, it filters out potential redundancies. Remarkably, we propose a principled model to address the filtering in the last step, and give a quantitative interpretation in terms of a transport-related cost function. This principled filtering can be applied to more general problems such as network extraction from images, thus going beyond the scenarios envisioned in the first step. Overall, this novel algorithm allows practitioners to easily extract optimal network topologies by combining basic tools from numerical methods, optimization and network theory. Thus, we provide an alternative to manual graph extraction which allows a grounded extraction from a large variety of optimal topologies. The analysis of these may open up the possibility to gain new insights into the structure and function of optimal networks. We provide an open source implementation of the code online.
| S-EPMC7704656 | biostudies-literature
Project description:The importance of body area sensor networks (BASNs) is increasing day by day because of their increasing use in Internet of things (IoT)-enabled healthcare application services. They help humans in improving their quality of life by continuously monitoring various vital signs through biosensors strategically placed on the human body. However, BASNs face serious challenges, in terms of the short life span of their batteries and unreliable data transmission, because of the highly unstable and unpredictable channel conditions of tiny biosensors located on the human body. These factors may result in poor data gathering quality in BASNs. Therefore, a more reliable data transmission mechanism is greatly needed in order to gather quality data in BASN-based healthcare applications. Therefore, this study proposes a novel, multiobjective, lion mating optimization inspired routing protocol, called self-organizing multiobjective routing protocol (SARP), for BASN-based IoT healthcare applications. The proposed routing scheme significantly reduces local search problems and finds the best dynamic cluster-based routing solutions between the source and destination in BASNs. Thus, it significantly improves the overall packet delivery rate, residual energy, and throughput with reduced latency and packet error rates in BASNs. Extensive simulation results validate the performance of our proposed SARP scheme against the existing routing protocols in terms of the packet delivery ratio, latency, packet error rate, throughput, and energy efficiency for BASN-based health monitoring applications.
| S-EPMC6928723 | biostudies-literature
Project description:With the development and universal application of satellite technology, an important way to expand the function of satellites is setting up inter-satellite networks to make them work together. Traditional satellite networking methods generally adopt a fixed time slot allocation method, which is not suitable for small satellite groups with low latency and high throughput requirements. In order to solve this problem, it has been proposed to apply the traditional Wifi protocol in satellite networking. As there are differences between satellite networks and terrestrial networks, it's necessary to improve the traditional 802.11 protocol. The Media Access Control (MAC) protocol in 802.11 is improved in this paper, which mainly includes the adaptive algorithm of maximum contention window size and the growth algorithm of Contention Window (CW) size. The maximum contention window is adjusted according to the conflict state of the current network, which makes the network accommodate more satellite nodes. The CW growth algorithm improves the traditional Binary Exponential Back-off (BEB) algorithm, where the CW is designed according to the priority of the data frame or the network load. In this way, high-priority satellite accusation information will have higher reliability or tolerate greater network load.
| S-EPMC6730845 | biostudies-literature
Project description:The first step in biomarkers discovery is to identify the best protocols for their purification and analysis. We have identified an optimal RNA extraction method of microRNAs from human plasma samples. We also report that the addition of low doses of carrier RNA before starting RNA extraction improves microRNA extraction and quantification.
2013-10-18 | GSE51375 | GEO
Project description:The first step in biomarkers discovery is to identify the best protocols for their purification and analysis. We have identified an optimal RNA extraction method of microRNAs from human plasma samples. We also report that the addition of low doses of carrier RNA before starting RNA extraction improves microRNA extraction and quantification. Human plasma and matched biopsies were obtained from healthy donors and patients attended at the Hospital Universitari i Politècnic La Fe (Valencia, Spain). RNA was extracted by different preanalytal conditions and reagents, testing the suitable of carrier addition at differnt doses. The best protocol was followed up by hybridation on Affymetrix microarrays.
2013-10-18 | E-GEOD-51375 | biostudies-arrayexpress
Project description:Network Intrusion Detection Systems (NIDSs) are indispensable defensive tools against various cyberattacks. Lightweight, multipurpose, and anomaly-based detection NIDSs employ several methods to build profiles for normal and malicious behaviors. In this paper, we design, implement, and evaluate the performance of machine-learning-based NIDS in IoT networks. Specifically, we study six supervised learning methods that belong to three different classes: (1) ensemble methods, (2) neural network methods, and (3) kernel methods. To evaluate the developed NIDSs, we use the distilled-Kitsune-2018 and NSL-KDD datasets, both consisting of a contemporary real-world IoT network traffic subjected to different network attacks. Standard performance evaluation metrics from the machine-learning literature are used to evaluate the identification accuracy, error rates, and inference speed. Our empirical analysis indicates that ensemble methods provide better accuracy and lower error rates compared with neural network and kernel methods. On the other hand, neural network methods provide the highest inference speed which proves their suitability for high-bandwidth networks. We also provide a comparison with state-of-the-art solutions and show that our best results are better than any prior art by 1~20%.
| S-EPMC8749547 | biostudies-literature