Reliable Data Collection Model and Transmission Framework in Large-Scale Wireless Medical Sensor Networks

Large-scale wireless sensor networks(WSNs)play a critical role in monitoring dangerous scenarios and responding to medical emergencies.However,the inherent instability and error-prone nature of wireless links present significant challenges,necessitating efficient data collection and reliable transmission services.This paper addresses the limitations of existing data transmission and recovery protocols by proposing a systematic end-to-end design tailored for medical event-driven cluster-based large-scale WSNs.The primary goal is to enhance the reliability of data collection and transmission services,ensuring a comprehensive and practical approach.Our approach focuses on refining the hop-count-based routing scheme to achieve fairness in forwarding reliability.Additionally,it emphasizes reliable data collection within clusters and establishes robust data transmission over multiple hops.These systematic improvements are designed to optimize the overall performance of the WSN in real-world scenarios.Simulation results of the proposed protocol validate its exceptional performance compared to other prominent data transmission schemes.The evaluation spans varying sensor densities,wireless channel conditions,and packet transmission rates,showcasing the protocol’s superiority in ensuring reliable and efficient data transfer.Our systematic end-to-end design successfully addresses the challenges posed by the instability of wireless links in large-scaleWSNs.By prioritizing fairness,reliability,and efficiency,the proposed protocol demonstrates its efficacy in enhancing data collection and transmission services,thereby offering a valuable contribution to the field of medical event-drivenWSNs.

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure,designers have addressed scal-ing concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain.In tactical Mobile Ad-hoc Network(MANET),hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out,self-mending and self-administration.Clustering in the routing process is one of the key aspects to increase MANET performance by coordinat-ing the pathways using multiple criteria and analytics.We present a Group Adaptive Hybrid Routing Algorithm(GAHRA)for gathering portability,which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations.Based on this aspect,the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach,with the objectives of enhancing the out-put of MANET routing computation in each hub.Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.

A geographic routing protocol based on trunk line in VANETs

A Trunk Line Based Geographic Routing(TLBGR)protocol in Vehicular Ad-hoc Networks(VANETs)is proposed in this paper to solve the problem of data acquisition in the traditional trunk coordinated control system.Because of the characteristics of short communication time and high packet loss among vehicles,the vehicles entering the trunk lines can not transmit their information to the trunk coordinated control system stably.To resolve this problem,the proposed protocol uses the trunk lines’traffic flow and the surrounding road network to provide a real-time data transmission routing scheme.It takes into account the data congestion problem caused by the large traffic flow of the main roads,which leads to the corresponding increase of the information flow of the section and the package loss,and the link partition problem caused by the insufficient traffic flow,which makes the vehicles have to carry and relay information thus increasing the transmission delay.The proposed TLBGR protocol can be divided into two stages:the next-intersection selection,and the next-hop selection in the chosen path between the current and next intersections.Simulation results show that,compared with other IoT routing protocols including Greedy Perimeter Stateless Routing(GPSR),Ad-hoc On Demand Vector(AODV),and Q-AODV,the TLBGR protocol has better performance in aspects of end-to-end delay,delivery rate,and routing cost under the scenario of urban traffic trunk lines.The TLBGR protocol can effectively avoid data congestion and local optimum problems,increase the delivery rate of data packets,and is therefore suitable for the routing requirements in this application scenario.

APPLICATION OF ID-BASED AGGREGATE SIGNATURE IN MANETS

Aggregate signatures are a useful primitive which allows aggregating many signatures on different messages computed by different users into a single and constant-length signature and adapts to Mobile Ad hoc NETwork (MANETs) very much. Jumin Song, et al. presented an ID-based aggregate signature, applied it to MANETs and proposed a secure routing scheme. In this work, we analyze Jumin Song, et al.’s aggregate signature scheme and find some limitations on its batch verification. In addition, in this work, we apply Craig Gentry, et al.’s ID-based aggregate signature to on-demand routing pro-tocol to present a secure routing scheme. Our scheme not only provides sound authentication and a secure routing protocol in ad hoc networks, but also meets the nature of MANETs.

A compass time-space model-based virtual IP routing scheme for NTSN satellite constellations

Recently,Non-Terrestrial Satellite Networks(NTSTs)have gained more and more attentions due to global coverage,low latency,and high-speed communications.The routing scheme is one of the primary challenges for NTSNs,due to the mega scale of an NTSN constellation and the dynamic topology feature.To solve many pressing problems,a Compass time-space Model-based Virtual IP(CMVIP)routing scheme is proposed in this paper.In order to compensate for discontinuities in existing topology models,a compass-shaped time-space model is proposed.It can be adapted with Inter-Satellite-Link(ISL)and Ground-Satellite-Link(GSL)transmissions.A distributed algorithm with multiple optimization objectives and multiple constraints is applied for routing path discovery.To more realistically verify the specific scheme,a traffic model that supports two different services is proposed.Access and bearer services are the two main applications of an NTSN.Experimental results demonstrate that the proposed scheme achieves superior Qualityof-Service(QoS)performance.In addition,comparison results demonstrate that the CMVIP routing scheme is superior to the Virtual-Topology-based Shortest Path(VT-SP)routing algorithm.

A Fault-Tolerant Routing Scheme in Dynamic Networks

In dynamic networks, links and nodes will be deleted or added regularly. It is very essential for the routing scheme to have the ability of fault-tolerance. The method to achieve such a goal is to generate more than one path for a given set of source and destination. In this paper, the idea of interval routing is used to construct a new scheme (Multi-Node Label Interval Routing scheme, or MNLIR scheme) to realize fault-tolerance. Interval routing is a space-efficient routing method for networks, but the method is static and determinative, and it cannot realize faulttolerance. In MNLIR scheme some nodes will have more than one label, thus some pairs of destination and source will have more than one path; the pairs of nodes, which have inheritance relation, will have the shortest path. Using this character, MNLIR scheme has better overall routing performance than the former interval routing scheme, which can be proven by simulations. The common problem concerning the insertion and deletion of nodes and links is considered in this paper. So if the networks have some changes in topology, MNLIR scheme may find alternative path for certain pairs of nodes. In this way, fault-tolerance can be realized with only a little space added to store the multi-node labels.

Valiant load-balancing and regionalized routing scheme

Valiant load-balancing （VLB） routing scheme has drawbacks of logical full mesh, intermediate nodes （networks） and single application of topology. To address these, the authors propose a novel routing scheme called regionalized VLB （R-VLB）. Based on ideas of VLB and regionalizing, R-VLB divides the nodes of backbone network into several regions whose topological structure is logical full mesh, and combines shortest-path routing scheme and VLB routing scheme. R-VLB also achieves logical local interconnection, non-central nodes （networks） and a wide range of application of topology. The relevant theoretical analysis and simulation results show that R-VLB achieve good throughput and failure performance close to that of VLB, and it even has better delay performance. R-VLB provides an idea for the application of VLB routing scheme.