Routing Verification Research Articles

Design of a System for Verification of Automatic Guided Vehicle Routes Using Computer Emulation

A frequent change in the manufacturing program caused by a change in customer requirements requires a logistics system in the company that can respond flexibly to these changes. In order for business logistics to respond flexibly and optimally to the tasks created, a tool is needed to verify the functionality of the entire process. This article, at its core, deals with the use of emulation in a mixed environment of the real and virtual worlds as a tool for optimising automatic guided vehicle (AGV) routes. The main objective of the article is the design of a system that allows verification of AGV routes using computer emulation. The solution was created and programmed in the Tecnomatix Plant Simulation program, in cooperation with AGV logistics supply tractors, and tested on a logistic test circuit. The results show that the main area of application of such a solution is mainly in the area of the capacity utilisation of the AGVs that are used in internal logistics processes. This solution helps to cut down on the time it takes to design and optimise logistics operations as well as on the time it takes to test logistics systems at full capacity before commencing production.

Assessing the likelihood of secondary crashes on freeways with Adaptive Signal Control System deployed on alternate routes

Introduction: Reducing the likelihood of freeway secondary crashes will provide significant safety, operational and environmental benefits. This paper presents a method for assessing the likelihood of freeway secondary crashes with Adaptive Signal Control Systems (ASCS) deployed on alternate routes that are typically used by diverted freeway traffic to avoid any delay or congestion due to a freeway primary crash. Method: The method includes four steps: (1) identification of secondary crashes, (2) verification of alternate routes, (3) assessment of the likelihood of secondary crashes for freeways with ASCS deployed on alternate routes and non-ASCS (i.e. pre-timed, semi- or fully-actuated) alternate routes, and (4) investigation of unobserved heterogeneity of the likelihood of freeway secondary crashes. Four freeway sections (i.e., two with ASCS deployed on alternate routes and two non-ASCS alternate routes) in South Carolina are considered. Results and Conclusions: Findings from the logistic regression modeling reveal significant reduction in the likelihood of secondary crashes for one freeway section (i.e., Charleston I-26 E) with ASCS deployed on alternate route. Other factors such as rear-end crash, dark or limited light, peak period, and annual average daily traffic contribute to the likelihood of freeway secondary crashes. Furthermore, random-parameter logistic regression model results for Charleston I-26 E reveal that unobserved heterogeneity of ASCS effect exists across the observations and ASCS are associated with the reduction of the likelihood of freeway secondary crashes for 84% of the observations (i.e., primary crashes). Location of the primary crash on the freeway is observed to affect the benefit of ASCS toward freeway secondary crash reduction as the primary crash’s location determines how many upstream freeway vehicles will be able to take the alternate route. Practical Applications: Based on the findings, it is recommended that the South Carolina Department of Transportation (SCDOT) considers deploying ASCS on alternate routes parallel to freeway sections where high percentages of secondary crashes are found.

A novel routing verification approach based on blockchain for inter-domain routing in smart metropolitan area networks

In recent years, with the continuous expansion of metropolitan area networks, the routing security problem has become more and more serious. In particular, promise-violating attack to inter-domain routing protocol is one of the most difficult attacks to defend, which always leads to serious consequences, such as maliciously attracting traffic and disrupting the network. To deal with such attack, current research generally adopts routing verification. However, it can only detect attacks violating a specific routing policy triggered by one malicious node, and no research has yet solved the problem caused by multiple collusion nodes. In this paper, we propose BRVM, a blockchain-based routing verification model, to address the issue that violating the shortest AS Path policy. The main idea of BRVM is to construct a route proof chain to verify whether a route violates the policy with the help of the blockchain technology. The precondition that avoiding the collusion attack is that the proportion of the malicious verification nodes is lower than the fault tolerance rate of the consensus algorithm. Then, we prove the correctness of BRVM in theory, and implement a prototype based on Quagga and Hyperledger Fabric. Some experiments on this prototype show that BRVM can indeed solve the promise-violating problem caused by multiple collusion nodes, and about 15.5% faster in performance compared with SPIDeR.

Enabling Location Privacy Preservation in MANETs Based on Distance, Angle, and Spatial Cloaking

Preserving the location privacy of users in Mobile Ad hoc Networks (MANETs) is a significant challenge for location information. Most of the conventional Location Privacy Preservation (LPP) methods protect the privacy of the user while sacrificing the capability of retrieval on the server-side, that is, legitimate devices except the user itself cannot retrieve the location in most cases. On the other hand, applications such as geographic routing and location verification require the retrievability of locations on the access point, the base station, or a trusted server. Besides, with the development of networking technology such as caching technology, it is expected that more and more distributed location-based services will be deployed, which results in the risk of leaking location information in the wireless channel. Therefore, preserving location privacy in wireless channels without losing the retrievability of the real location is essential. In this paper, by focusing on the wireless channel, we propose a novel LPP enabled by distance (ranging result), angle, and the idea of spatial cloaking (DSC-LPP) to preserve location privacy in MANETs. DSC-LPP runs without the trusted third party nor the traditional cryptography tools in the line-of-sight environment, and it is suitable for MANETs such as the Internet of Things, even when the communication and computation capabilities of users are limited. Qualitative evaluation indicates that DSC-LPP can reduce the communication overhead when compared with k-anonymity, and the computation overhead of DSC-LPP is limited when compared with conventional cryptography. Meanwhile, the retrievability of DSC-LPP is higher than that of k-anonymity and differential privacy. Simulation results show that with the proper design of spatial divisions and parameters, other legitimate devices in a MANET can correctly retrieve the location of users with a high probability when adopting DSC-LPP.

Distributed Blockchain-Based Trusted Multidomain Collaboration for Mobile Edge Computing in 5G and Beyond

Mobile edge computing (MEC) sinks computing power to the edge of networks and integrates mobile access networks and Internet services in 5G and beyond. With the continuous development of services, privacy protection is extremely important in a heterogeneous MEC system for multiserver collaboration. However, most of the existing schemes only consider the privacy of users or services other than the privacy of network topology. For the purpose of topology privacy protection, this article employs blockchain to construct heterogeneous MEC systems and adopts accommodative bloom filter as a carrier for multidomain collaborative routing consensus without exposing topology privacy. Blockchain is used to implement multiplex mutual trust networking and collaborative routing verification through the membership service and consensus mechanism. Experiments are conducted to evaluate the feasibility and performances of our scheme. The results indicate that the proposed scheme can highly improve the credibility and efficiency of MEC collaboration.

Fast routing verification with complexity effect for SOC

Integrated circuit (IC) fabrication technology has improved to 7 nm resulting that IC can accommodate more transistors to implement system-on-a-chip (SOC). SOC generally consists of a great quantity digital circuits with specific functions. Diverse signals not only convey inside but also communicate outside among circuits. For hundreds of thousands interlaced and complicated signals, it is an extreme big challenge to route in shrink channel. In this work, we propose a complexity effect routing algorithm based on the Lee algorithm to achieve fast verification for SOC. The advantages are to gain fast evaluated for various architectures of route, trace path from origin to destination and set diverse complexity to simulate SOC architectures. Experimental results demonstrate the achievements on five complexity sets of routing benchmarks.

Performance Efficiency of SRP over AODV Enforcing Attacks

Objectives: Mobile ad hoc networks (MANETs) is a suitable environment for unknown or unspecified communications. It is an infra-structureless network. Standard protocols like AODV, OLSR and DSR are used in routing packets. In this paper, we compare AODV protocol with SRP protocol enforcing a Black hole, worm hole and Sybil attacks. Group signature is used to authenticate the route requests and to defend the potential active attacks without exposing the node identities. During the transmission, the intermediary nodes does not know the actual destination since onion routing concept along with route verification message is used. Methods/Analysis: Using NS2, first a sample of 50 nodes is generated and is made to move randomly. Dynamic clustering is done within the sample area of 500 x 500 sq.m. Set up 50 nodes as sink nodes and attach a local agent and loss monitor for each node. Position these nodes in the sample area. The nodes 0,20,22,10 were set up as source and nodes 24, 9, 2, 14 were set up as destinations respectively for transmission of packets. Findings: The four performance measures Energy spent, Packet Delivery ratio, delay and throughput or output with 6 attacker nodes (50, 51, 52, 53, 54 and 55) with different simulation time like 2, 4, 6, 8, 10s are taken for comparison. Transmission of packet is tested using AODV and the performance metrics are traced. Similarly the performance metrics are tested with SRP protocol. The values are tabulated and a graph is generated for each metric in Y-axis and time in X-axis. From the results obtained we can observe SRP outperforms AODV in all four parameters. Novelty of the Study: A VMware workstation is installed and tested in Unix environment using tool command language the modules are created in vi editor. They are executed using ns command. This paper compares the performance of SRP with AODV enforcing attacker nodes. Conclusion: During data transmission between nodes in MANETs the SRP protocol outperforms AODV. The result analysis below shows the four performance measures Energy spent, PDR, end-to-end delay and throughput.

Trust Based Authentication and Key Establishment for Secure Routing in WMN

In Wireless Mesh Networks (WMN), an authentication technique can be compromised due to the distributed network architecture, the broadcast nature of the wireless medium and dynamic network topology. Several vulnerabilities exist in different protocols for WMNs. Hence, in this paper, we propose trust based authentication and key establishment for secure routing in WMN. Initially, a trust model is designed based on Ant Colony Optimization (ACO) to exchange the trust information among the nodes. The routing table is utilized to select the destination nodes, for which the link information is updated and the route verification is performed. Based on the trust model, mutual authentication is applied. When a node moves from one operator to another for accessing the router, inter-authentication will be performed. When a node moves within the operator for accessing the router, then intraauthentication will be performed. During authentication, keys are established using identity based cryptography technique. By simulation results, we show that the proposed technique enhances the packet delivery ratio and resilience with reduced drop and overhead.

Routing Regardless of Network Stability

How effective are interdomain routing protocols, such as the border gateway protocol, at routing packets? Theoretical analyses have attempted to answer this question by ignoring the packets and instead focusing upon protocol stability. To study stability, it suffices to model only the control plane (which determines the routing graph)--an approach taken in the stable paths problem. To analyse packet routing requires modelling the interactions between the control plane and the forwarding plane (which determines where packets are forwarded), and our first contribution is to introduce such a model. We then examine the effectiveness of packet routing in this model for the broad class next-hop preferences with filtering. Here each node $$v$$ v has a filtering list $$\mathcal {D}(v)$$ D ( v ) consisting of nodes it does not want its packets to route through. Acceptable paths (those that avoid nodes in the filtering list) are ranked according to the next-hop, that is, the neighbour of $$v$$ v that the path begins with. On the negative side, we present a strong inapproximability result. For filtering lists of cardinality at most one, given a network in which an equilibrium is guaranteed to exist, it is NP-hard to approximate the maximum number of packets that can be routed to within a factor of $$n^{1-\epsilon }$$ n 1 - ∈ , for any constant $$\epsilon >0$$ ∈ > 0 . On the positive side, we give algorithms to show that, in two fundamental cases, there exist activation sequences under which every packet will route. The first case is when each node's filtering list contains only itself, that is, $$\mathcal {D}(v)=\{v\}$$ D ( v ) = { v } ; this is the fundamental case in which a node does not want its packets to cycle. Moreover, every packet will be routed before the control plane reaches an equilibrium. The second case is when all the filtering lists are empty, that is, $$\mathcal {D}(v)=\emptyset $$ D ( v ) = ? . Thus, every packet will route even when the nodes do not care if their packets cycle! Furthermore, under these activation sequences, every packet will route even when the control plane has no equilibrium at all. Our positive results require the periodic application of route verification. To our knowledge, these are the first results to guarantee the possibility that all packets get routed without stability. These positive results are tight--for the general case of filtering lists of cardinality one, it is not possible to ensure that every packet will eventually route.

Automated Formal Verification of Routing in Material Handling Systems

The design of correctly implemented controls in material handling systems (MHS) is time consuming and cumbersome. The developer has to deal with an ever increasing complexity and heterogeneity of MHS on the one hand, but also with short development cycles and high demands to MHS on the other hand. For baggage handling systems (BHS) at airports, the error-free implementation of routing strategies is especially of importance, as these strategies are critical to safety. This paper proposes a compositional approach to the formal verification of routing in MHS. The approach is based on the theory of assume-guarantee reasoning, where proofs of the overall system are derived from proofs of subsystems. Moreover, the approach has been implemented in a tool that automatically carries out the verification. A real-world example is discussed in this paper, showing the benefits and scalability of the presented approach.

A graph theory-based approach to route location in railway interlocking

The location and verification of routes is an important component of railway interlocking logic design. The interlocking routes are typically listed manually by experienced signaling engineers, and this task is both time consuming and expensive. In this paper, an automatic, graph theory-based approach to route location and verification is presented. In this new approach, a component-based model is used to represent the topology of the station layout, and a modified matrix algorithm based on graph theory is used to locate all of the routes in a given station. This algorithm exhibits superior performance in the location and verification of routes and is universally applicable, irrespective of the station layout. When a station is modified, the designers can simply update the topological data for the station, and the new route information can be obtained automatically.

PtII-Mediated Nitrile−Tetramethylguanidine Coupling as a Key Step for a Novel Synthesis of 1,6-Dihydro-1,3,5-triazines

The coupling between tetramethylguanidine, HN=C(NMe2)2, and coordinated organonitriles in the platinum(II) complexes cis/trans-[PtCl2(RCN)2] (R = Me, Et, Ph) proceeds rapidly under mild conditions to afford the diimino compounds containing two N-bound monodentate 1,3-diaza-1,3-diene ligands [PtCl2{NH=C(R)N=C(NMe2)2}2] (R = Et, trans-1; R = Ph, trans-2; R = Me, cis-3; R = Et, cis-4), and this reaction is the first observation of metal-mediated nucleophilic addition of a guanidine to ligated nitrile. Complexes 1-4 were characterized by elemental analyses (C, H, N), X-ray diffraction, FAB mass spectrometry, IR, and 1H and 13C{1H} NMR spectroscopies; assignment of signals from E/Z-forms of 1,3-diaza-1,3-diene ligands and verification of routes for their Z right harpoon over left harpoon E isomerization in solution were performed using 2D 1H,1H-COSY, 1H,13C-HETCOR, and 1D NOE NMR experiments. The newly formed and previously unknown 1,3-diaza-1,3-dienes NH=C(R)N=C(NMe2)2 were liberated from the platinum(II) complexes [PtCl2{NH=C(R)N=C(NMe2)2}2] (1-3) by substitution with 2 equiv of 1,2-bis-(diphenylphosphino)ethane (dppe) to give the uncomplexed HN=C(R)N=C(NMe2)2 species (5-7) in solution and the solid [Pt(dppe)2](Cl)2. The former were utilized in situ, after filtration of the latter, in the reaction with 1,3-di-p-tolylcarbodiimide, (p-tol)N=C=N(tol-p), in CDCl3 to generate (6E)-N,N-dimethyl-1-(4-methylphenyl)-6-[(4-methylphenyl)imino]-1,6-dihydro-1,3,5-triazin-2-amines) (8-10) due to the [4 + 2]-cycloaddition accompanying elimination of HNMe2. The formulation of 8-10 is based on ESI-MS, 1H, 13C{1H} NMR, and X-ray crystal structures determined for 9 and 10. The reaction of 1,3-diaza-1,3-dienes with 1,3-di-p-tolylcarbodiimide, described in this article, constitutes a novel synthetic approach to a useful class of heterocyclic species like 1,6-dihydro-1,3,5-triazines.

TMN-based schedulers for SS7 routing verification tests

TMN-based schedulers for SS7 routing verification tests

TMN-based schedulers for SS7 routing verification tests

Routing verification tests have been specified by the ITU-T as open system interconnection (OSI) systems management-based functions to audit routing tables in live signalling system no. 7 (SS7) networks. They generate a considerable amount of messages and can easily trigger congestion. Circumspection is therefore required when using them, especially when they are used to audit thoroughly and periodically all the routing tables of a network. This paper proposes a centralized and a distributed algorithm for scheduling routing verification tests in SS7 networks. It suggests as well a telecommunications management network (TMN) based implementation of the algorithms.

Electronic Permitting Issuance System for Oversize/Overweight Vehicles

The effort reported here focuses both on improving the efficiency of the special hauling permitting processes of the New York State Department of Transportation (NYSDOT) and on improving the level of service offered to NYSDOT’s customers—truckers, construction companies, and others applying for permits. The electronic system is designed to replace a largely manual system of data checking, route verification, and permit issuance. By linking personal computers at transmission companies (third parties that prepare and submit permit applications for truckers) directly to computers at NYSDOT, and equipping these computers with automated route verification capability using a geographical information system, improved service can be offered at reduced cost to the state.

TMN-based schedulers for SS7 routing verification tests

Routing verification tests have been specified by the ITU-T as open system interconnection (OSI) systems management-based functions to audit routing tables in live signalling system no. 7 (SS7) networks. They generate a considerable amount of messages and can easily trigger congestion. Circumspection is therefore required when using them, especially when they are used to audit thoroughly and periodically all the routing tables of a network. This paper proposes a centralized and a distributed algorithm for scheduling routing verification tests in SS7 networks. It suggests as well a telecommunications management network (TMN) based implementation of the algorithms.

Analytical verification of Muskingum-Cunge routing

A verification of Muskingum-Cunge routing is accomplished by comparing theoretically calculated peak outflow and travel time with those generated using the constant-parameter Muskingum-Cunge method of flood routing. The close agreement between analytical and numerical results underscores the utility of Muskingum-Cunge routing as a viable and accurate method for routine applications in flood hydrology.

Automated Ship Routing

The U.S. Navy's Fleet Numerical Weather Central has developed a numerical model to compute realistic time tracks for transoceanic shipping using short-range dynamic forecasts (40-72 hrs) and extended-range statistical forecasts to destination. This model resides in a computer program that is utilized by watch standers to prepare original routes and underway diversions for about 600 U.S. Navy ships a year. Global minimum time routes (GMTR) are computed twice daily for ships using optimum track ship routing (OTSR) service by this program, which considers navigation, environmental surveillance, environmental constraints, and ship performance curves. Maintenance of environmental surveillance and application of environmental constraints is accomplished through grids that represent the oceanic areas of the world and contain environmental parameters such as significant wave height and direction, frequency, fog, currents, and wind; however, any parameter or combination of parameters which can be represented numerically may be used in determining the GMTR. Comparison of the GMTR and the actual route sailed is possible by the computation of a post voyage verification route using actual environmental data. Ice areas are depicted (through the use of satellite data) and are utilized to constrain the global minimum time route selections. This is a description of the logic and the environmental parameters that produce the automated navigation, route surveillance, original route recommendations, and route verification.