WorldWideScience

Sample records for dynamic multipath routing

  1. Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Sunil Kumar

    2013-01-01

    Full Text Available Node mobility in mobile ad hoc networks (MANETs causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU, for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI for discovery of reliable routes; (ii a local path update mechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii a keep alive mechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv a packet salvaging scheme to improve packet delivery in the event of a route breakage; and (v low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.

  2. Congestion Aware Multipath Routing: Performance Improvements in Core Networks

    Directory of Open Access Journals (Sweden)

    Matej Kultan

    2015-01-01

    Full Text Available In this paper the improved Congestion Aware Multipath Routing algorithm is analysed in terms of Core network throughput and longer paths contribution. The algorithm discovers unused network resources and dynamically adapts to the actual traffic load and available resources displacement. Several simulation scenarios have been benchmarked in order to verify algorithm in typical Internet Service Provider cases. Simulation scenarios in this paper are focused on verifying functionality in dense core networks. For this purpose, tests were performed on TeraStream based network – the Deutsche Telekom Group design concept. Simulation results have proven better performance and resource utilization of the proposed algorithm than traditional Bellman-Ford based algorithms and equal cost multipath approaches.

  3. Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks. PMID:22368490

  4. Multipath routing in wireless sensor networks: survey and research challenges.

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

  5. Multipath Load Balancing Routing for Internet of Things

    Directory of Open Access Journals (Sweden)

    Chinyang Henry Tseng

    2016-01-01

    Full Text Available In the next-generation technology, Internet of Things (IoT, billions of smart objects will communicate with one another to make human lives more convenient. IoT is based on wireless sensor network (WSN, and Zigbee is one of the most popular WSN protocols. A mature IoT environment involves heavy WSN data transmission causing bottleneck problems. However, Zigbee’s AODV routing stack does not have load balance mechanism to handle bursty traffic. Therefore, we develop Multipath Load Balancing (MLB Routing to substitute Zigbee’s AODV routing. Our proposed MLB consists of two main designs: LAYER_DESIGN and LOAD_BALANCE. LAYER_DESIGN assigns nodes into different layers based on node distance to IoT gateway. Nodes can have multiple next-hops delivering IoT data. All neighboring layer nodes exchange flow information containing current load, used by LOAD_BALANCE to estimate future load of next-hops. With MLB, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balance and avoid bottlenecks. Compared with Zigbee’s AODV and multipath version AODV (AOMDV, experiment results demonstrate that MLB achieves better load balance, lower packet loss rate, and better routing connectivity ratio in both grid and random uniform topologies. MLB provides a more convincing routing solution for IoT applications.

  6. An Energy-Efficient and Robust Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks.

    Science.gov (United States)

    Singh, Kishor; Moh, Sangman

    2017-09-04

    Routing in cognitive radio ad hoc networks (CRAHNs) is a daunting task owing to dynamic topology, intermittent connectivity, spectrum heterogeneity, and energy constraints. Other prominent aspects such as channel stability, path reliability, and route discovery frequency should also be exploited. Several routing protocols have been proposed for CRAHNs in the literature. By stressing on one of the aspects more than any other, however, they do not satisfy all requirements of throughput, energy efficiency, and robustness. In this paper, we propose an energy-efficient and robust multipath routing (ERMR) protocol for CRAHNs by considering all prominent aspects including residual energy and channel stability in design. Even when the current routing path fails, the alternative routing path is immediately utilized. In establishing primary and alternative routing paths, both residual energy and channel stability are exploited simultaneously. Our simulation study shows that the proposed ERMR outperforms the conventional protocol in terms of network throughput, packet delivery ratio, energy consumption, and end-to-end delay.

  7. Multipath Load Balancing Routing for Internet of Things

    OpenAIRE

    Tseng, Chinyang Henry

    2016-01-01

    In the next-generation technology, Internet of Things (IoT), billions of smart objects will communicate with one another to make human lives more convenient. IoT is based on wireless sensor network (WSN), and Zigbee is one of the most popular WSN protocols. A mature IoT environment involves heavy WSN data transmission causing bottleneck problems. However, Zigbee’s AODV routing stack does not have load balance mechanism to handle bursty traffic. Therefore, we develop Multipath Load Balancing (...

  8. Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach

    Directory of Open Access Journals (Sweden)

    Sungwook Kim

    2014-01-01

    Full Text Available Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

  9. Adaptive MANET multipath routing algorithm based on the simulated annealing approach.

    Science.gov (United States)

    Kim, Sungwook

    2014-01-01

    Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

  10. An optimized node-disjoint multipath routing scheme in mobile ad hoc

    Science.gov (United States)

    Yu, Yang; Liang, Mangui; Liu, Zhiyu

    2016-02-01

    In mobile ad hoc networks (MANETs), link failures are caused frequently because of node’s mobility and use of unreliable wireless channels for data transmission. Multipath routing strategy can cope with the problem of the traffic overloads while balancing the network resource consumption. In the paper, an optimized node-disjoint multipath routing (ONMR) protocol based on ad hoc on-demand vector (AODV) is proposed to establish effective multipath to enhance the network reliability and robustness. The scheme combines the characteristics of reverse AODV (R-AODV) strategy and on-demand node-disjoint multipath routing protocol to determine available node-disjoint routes with minimum routing control overhead. Meanwhile, it adds the backup routing strategy to make the process of data salvation more efficient in case of link failure. The results obtained through various simulations show the effectiveness of the proposed scheme in terms of route availability, control overhead and packet delivery ratio.

  11. On Multipath Routing in Multihop Wireless Networks: Security, Performance, and Their Tradeoff

    Directory of Open Access Journals (Sweden)

    Lin Chen

    2009-01-01

    Full Text Available Routing amid malicious attackers in multihop wireless networks with unreliable links is a challenging task. In this paper, we address the fundamental problem of how to choose secure and reliable paths in such environments. We formulate the multipath routing problem as optimization problems and propose algorithms with polynomial complexity to solve them. Game theory is employed to solve and analyze the formulated multipath routing problem. We first propose the multipath routing solution minimizing the worst-case security risk (i.e., the percentage of packets captured by attackers in the worst case. While the obtained solution provides the most security routes, it may perform poorly given the unreliability of wireless links. Hence we then investigate the multipath routing solution maximizing the worst-case packet delivery ratio. As a natural extension, to achieve a tradeoff between the routing security and performance, we derive the multipath routing protocol maximizing the worst-case packet delivery ratio while limiting the worst-case security risk under given threshold. As another contribution, we establish the relationship between the worst-case security risk and packet delivery ratio, which gives the theoretical limit on the security-performance tradeoff of node-disjoint multipath routing in multihop wireless networks.

  12. A Secure Cluster-Based Multipath Routing Protocol for WMSNs

    Directory of Open Access Journals (Sweden)

    Jamal N. Al-Karaki

    2011-04-01

    Full Text Available The new characteristics of Wireless Multimedia Sensor Network (WMSN and its design issues brought by handling different traffic classes of multimedia content (video streams, audio, and still images as well as scalar data over the network, make the proposed routing protocols for typical WSNs not directly applicable for WMSNs. Handling real-time multimedia data requires both energy efficiency and QoS assurance in order to ensure efficient utility of different capabilities of sensor resources and correct delivery of collected information. In this paper, we propose a Secure Cluster-based Multipath Routing protocol for WMSNs, SCMR, to satisfy the requirements of delivering different data types and support high data rate multimedia traffic. SCMR exploits the hierarchical structure of powerful cluster heads and the optimized multiple paths to support timeliness and reliable high data rate multimedia communication with minimum energy dissipation. Also, we present a light-weight distributed security mechanism of key management in order to secure the communication between sensor nodes and protect the network against different types of attacks. Performance evaluation from simulation results demonstrates a significant performance improvement comparing with existing protocols (which do not even provide any kind of security feature in terms of average end-to-end delay, network throughput, packet delivery ratio, and energy consumption.

  13. A secure cluster-based multipath routing protocol for WMSNs.

    Science.gov (United States)

    Almalkawi, Islam T; Zapata, Manel Guerrero; Al-Karaki, Jamal N

    2011-01-01

    The new characteristics of Wireless Multimedia Sensor Network (WMSN) and its design issues brought by handling different traffic classes of multimedia content (video streams, audio, and still images) as well as scalar data over the network, make the proposed routing protocols for typical WSNs not directly applicable for WMSNs. Handling real-time multimedia data requires both energy efficiency and QoS assurance in order to ensure efficient utility of different capabilities of sensor resources and correct delivery of collected information. In this paper, we propose a Secure Cluster-based Multipath Routing protocol for WMSNs, SCMR, to satisfy the requirements of delivering different data types and support high data rate multimedia traffic. SCMR exploits the hierarchical structure of powerful cluster heads and the optimized multiple paths to support timeliness and reliable high data rate multimedia communication with minimum energy dissipation. Also, we present a light-weight distributed security mechanism of key management in order to secure the communication between sensor nodes and protect the network against different types of attacks. Performance evaluation from simulation results demonstrates a significant performance improvement comparing with existing protocols (which do not even provide any kind of security feature) in terms of average end-to-end delay, network throughput, packet delivery ratio, and energy consumption.

  14. Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Y. Harold Robinson

    2015-01-01

    Full Text Available Mobile ad hoc network (MANET is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO that uses continuous time recurrent neural network (CTRNN to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique.

  15. Fault-Aware Resource Allocation for Heterogeneous Data Sources with Multipath Routing

    Directory of Open Access Journals (Sweden)

    Xiaomei Zhang

    2017-01-01

    Full Text Available With the rapid development of cloud computing and big data, diverse types of traffic generated from heterogeneous data sources are delivered throughout communication networks, which consist of various node kinds such as digital sensors and smart actuators, and different applications. Due to the shared medium, communication networks are vulnerable to misbehaving nodes, and it is a crucial aspect to maintain an acceptable level of service degradation. This paper studies the fault-aware resource allocation problem by exploiting multipath routing and dynamic rate assignment for heterogeneous sources. We estimate the impacts of faults and formulate the resource allocation as a lossy network flow optimization problem based on these estimates. The traditional flow optimization solutions focus on homogeneous traffic. In our work, we model the performance of heterogeneous applications as a relaxed utility function and develop an effective utility framework of rate control for heterogeneous sources with multipath routing in presence of misbehaving nodes. We design a distributed algorithm to decide the routing strategy and obtain the rate assignments on the available paths in a lossy utility fair manner. Extensive performance evaluations corroborate the significant performance of our algorithm in effective utility and utility fairness in the presence of misbehaving nodes.

  16. An Energy-Efficient and Robust Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Kishor Singh

    2017-09-01

    Full Text Available Routing in cognitive radio ad hoc networks (CRAHNs is a daunting task owing to dynamic topology, intermittent connectivity, spectrum heterogeneity, and energy constraints. Other prominent aspects such as channel stability, path reliability, and route discovery frequency should also be exploited. Several routing protocols have been proposed for CRAHNs in the literature. By stressing on one of the aspects more than any other, however, they do not satisfy all requirements of throughput, energy efficiency, and robustness. In this paper, we propose an energy-efficient and robust multipath routing (ERMR protocol for CRAHNs by considering all prominent aspects including residual energy and channel stability in design. Even when the current routing path fails, the alternative routing path is immediately utilized. In establishing primary and alternative routing paths, both residual energy and channel stability are exploited simultaneously. Our simulation study shows that the proposed ERMR outperforms the conventional protocol in terms of network throughput, packet delivery ratio, energy consumption, and end-to-end delay.

  17. A Multipath Routing Protocol Based on Bloom Filter for Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Junwei Jin

    2016-01-01

    Full Text Available On-demand multipath routing in a wireless ad hoc network is effective in achieving load balancing over the network and in improving the degree of resilience to mobility. In this paper, the salvage capable opportunistic node-disjoint multipath routing (SNMR protocol is proposed, which forms multiple routes for data transmission and supports packet salvaging with minimum overhead. The proposed mechanism constructs a primary path and a node-disjoint backup path together with alternative paths for the intermediate nodes in the primary path. It can be achieved by considering the reverse route back to the source stored in the route cache and the primary path information compressed by a Bloom filter. Our protocol presents higher capability in packet salvaging and lower overhead in forming multiple routes. Simulation results show that SNMR outperforms the compared protocols in terms of packet delivery ratio, normalized routing load, and throughput.

  18. An Overlay Architecture for Throughput Optimal Multipath Routing

    Science.gov (United States)

    2017-01-14

    v equal network departures minus ( endogenous ) network arrivals at v. Similarly, Eqn. (2) represents flow conservation for exogenous arrivals at...dynamically route exogenous arrivals but not endogenous network arrivals. Eqn. (3) is a path constraint for each commodity c along the shortest-path...as Associate Editor for IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking. He was the Technical Program co-chair for IEEE

  19. A Multipath Routing Protocol Based on Clustering and Ant Colony Optimization for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jing Yang

    2010-05-01

    Full Text Available For monitoring burst events in a kind of reactive wireless sensor networks (WSNs, a multipath routing protocol (MRP based on dynamic clustering and ant colony optimization (ACO is proposed.. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is their limited power supply, and therefore some metrics (such as energy consumption of communication among nodes, residual energy, path length were considered as very important criteria while designing routing in the MRP. Firstly, a cluster head (CH is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in the search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance of energy consumption among nodes and reduce the average energy consumption effectively.

  20. Multipath routing and multiple description coding in ad-hoc networks: A simulation study

    NARCIS (Netherlands)

    Díaz, I.F.; Epema, D.; Jongh, J. de

    2004-01-01

    The nature of wireless multihop ad-hoc networks makes it a challenge to offer connections of an assured quality. In order to improve the performance of such networks, multipath routing in combination with Multiple Description Coding (MDC) has been proposed. By splitting up streams of multimedia

  1. A node-disjoint multi-path routing protocol based on location ...

    African Journals Online (AJOL)

    user

    control message overhead. Keywords: Multi-path Routing Protocol, Mobile Ad hoc Networks, Location Prediction, Node Disjoint, Simulation. 1. Introduction ..... synchronization algorithms (example: Naumov et al., 2006; Sheu et al., 2007) have been proposed for wireless ad hoc networks. The destination node computes and ...

  2. WEAMR-a weighted energy aware multipath reliable routing mechanism for hotline-based WSNs.

    Science.gov (United States)

    Tufail, Ali; Qamar, Arslan; Khan, Adil Mehmood; Baig, Waleed Akram; Kim, Ki-Hyung

    2013-05-13

    Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR), a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs.

  3. Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks.

    Science.gov (United States)

    Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

    2016-01-01

    Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.

  4. Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks.

    Directory of Open Access Journals (Sweden)

    Abdulaziz Al-Nahari

    Full Text Available Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV, which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.

  5. UMDR: Multi-Path Routing Protocol for Underwater Ad Hoc Networks with Directional Antenna

    Science.gov (United States)

    Yang, Jianmin; Liu, Songzuo; Liu, Qipei; Qiao, Gang

    2018-01-01

    This paper presents a new routing scheme for underwater ad hoc networks based on directional antennas. Ad hoc networks with directional antennas have become a hot research topic because of space reuse may increase networks capacity. At present, researchers have applied traditional self-organizing routing protocols (such as DSR, AODV) [1] [2] on this type of networks, and the routing scheme is based on the shortest path metric. However, such routing schemes often suffer from long transmission delays and frequent link fragmentation along the intermediate nodes of the selected route. This is caused by a unique feature of directional transmission, often called as “deafness”. In this paper, we take a different approach to explore the advantages of space reuse through multipath routing. This paper introduces the validity of the conventional routing scheme in underwater ad hoc networks with directional antennas, and presents a special design of multipath routing algorithm for directional transmission. The experimental results show a significant performance improvement in throughput and latency.

  6. Multipath Routing and Wavelength Assignment Technique in Optical WDM Mesh Networks

    Science.gov (United States)

    Kavitha, T.; Shiyamala, S.; Rajamani, V.

    2017-12-01

    A routing and wavelength assignment (RWA) technique for supporting multipath traffic in optical wavelength-division multiplexing (WDM) mesh network is proposed in this paper. The network can be preceded by accomplishing two processes: one is establishing connection node and the second one is identifying the multipath and assigning wavelength. The connection node is selected based on the load and current traffic-carrying capacity of that node. During wavelength allocation mechanism, cost function is considered as the major criterion. Based on the cost involved in every path, the wavelengths are selected such that wavelength with the minimum cost is allocated to that particular path. This technique efficiently allocates the wavelength to the selected multiple paths and the traffic is routed to the destination using multiple paths with wavelength allocation. For simulation, NS2 simulator is used by applying the optical WDM network simulator patch. The proposed multipath RWA technique is compared with the existing RWA technique. We achieved a throughput of 12,625 packets for ten numbers of wavelengths. But the existing approach achieved a throughput of 10,189 packets only for the same numbers of wavelengths. Channel utilization is more, and delay is less compared with the existing technique. Hence, the proposed method is very efficient, since the router effectively routes the traffic within the network.

  7. A Probabilistically Weakly Secure Network Coding Scheme in Multipath Routing for WSNs.

    Science.gov (United States)

    Liu, Xiang; Huang, Jie; Gao, Xiang

    2017-05-16

    In wireless sensor networks, nodes are mostly deployed in unsupervised areas and are vulnerable to a variety of attacks. Therefore, data security is a vital aspect to be considered. However, due to the limited computation capability and memory of sensor nodes, it is difficult to perform the complex encryption algorithm, as well as the key distribution and management algorithm. Toward this end, a low-complexity algorithm for security in wireless sensor networks is of significant importance. In this article, a weakly secure network coding based multipath routing scheme is proposed, which can guarantee the data confidentiality in transmission probabilistically, and can improve the energy efficiency in the meantime. Then the simulations of the probability of transmission being secure are performed. The results show that with the increase of the number of hops k , the probability of transmission being secure suffers from a rapid decrease. On the contrary, with the increase of multicast capacity h it undergoes a slight growth. Therefore, the weak security can be achieved with probability approaching 1 by limiting the number of hops and increasing the multicast capacity. Meanwhile, the simulations of energy consumption are performed and the comparison between the energy consumption of the scheme in this article and the multipath routing scheme without network coding is conducted. The results show that by employing network coding, the scheme in this article can improve the energy efficiency, and the more packets transmitted, the more energy consumption can be reduced.

  8. Location aware event driven multipath routing in Wireless Sensor Networks: Agent based approach

    Directory of Open Access Journals (Sweden)

    A.V. Sutagundar

    2013-03-01

    Full Text Available Wireless Sensor Networks (WSNs demand reliable and energy efficient paths for critical information delivery to sink node from an event occurrence node. Multipath routing facilitates reliable data delivery in case of critical information. This paper proposes an event triggered multipath routing in WSNs by employing a set of static and mobile agents. Every sensor node is assumed to know the location information of the sink node and itself. The proposed scheme works as follows: (1 Event node computes the arbitrary midpoint between an event node and the sink node by using location information. (2 Event node establishes a shortest path from itself to the sink node through the reference axis by using a mobile agent with the help of location information; the mobile agent collects the connectivity information and other parameters of all the nodes on the way and provides the information to the sink node. (3 Event node finds the arbitrary location of the special (middle intermediate nodes (above/below reference axis by using the midpoint location information given in step 1. (4 Mobile agent clones from the event node and the clones carry the event type and discover the path passing through special intermediate nodes; the path above/below reference axis looks like an arc. While migrating from one sensor node to another along the traversed path, each mobile agent gathers the node information (such as node id, location information, residual energy, available bandwidth, and neighbors connectivity and delivers to the sink node. (5 The sink node constructs a partial topology, connecting event and sink node by using the connectivity information delivered by the mobile agents. Using the partial topology information, sink node finds the multipath and path weight factor by using link efficiency, energy ratio, and hop distance. (6 The sink node selects the number of paths among the available paths based upon the criticalness of an event, and (7 if the event is non

  9. A Comprehensive study of a New Multipath Energy Aware Routing Protocol for Mobile Ad-hoc Networks

    OpenAIRE

    Chettibi, Saloua

    2009-01-01

    S. Chettibi, M. Benmohammed, "A comprehensive study of a new multipath energy aware routing protocol for mobile ad-hoc networks"; International Conference on Systems and Information Processing, ICSIP'09, May 02 – 04, 2009, Guelma, Algeria; Maximizing network lifetime is a very challenging issue in routing protocol design for Mobile Ad-hoc NETworks (MANETs), since mobile nodes are powered by limited-capacity batteries. Furthermore, replacing or recharging batteries is often impossible in criti...

  10. Multipath Routing Protocol Using Basic Reconstruction Routing (BRR) Algorithm in Wireless Sensor Network

    OpenAIRE

    K. Rajasekaran; Kannan Balasubramanian

    2015-01-01

    A sensory network consists of multiple detection locations called sensor nodes, each of which is tiny, featherweight and portable. A single path routing protocols in wireless sensor network can lead to holes in the network, since only the nodes present in the single path is used for the data transmission. Apart from the advantages like reduced computation, complexity and resource utilization, there are some drawbacks like throughput, increased traffic load and delay in da...

  11. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks

    Science.gov (United States)

    Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J.; Segarra, Esteve Pallarès; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Gargallo, Emilio Sanvicente

    2015-01-01

    The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic.Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs. PMID:25897496

  12. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Ahmad Mohamad Mezher

    2015-04-01

    Full Text Available The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc. could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs.

  13. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks.

    Science.gov (United States)

    Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J; Pallarès Segarra, Esteve; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Sanvicente Gargallo, Emilio

    2015-04-17

    The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs.

  14. Multipath Activity Based Routing Protocol for Mobile ‎Cognitive Radio Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Shereen Omar

    2017-01-01

    Full Text Available Cognitive radio networks improve spectrum utilization by ‎sharing licensed spectrum with cognitive radio devices. In ‎cognitive radio ad hoc networks the routing protocol is one ‎of the most challenging tasks due to the changes in ‎frequency spectrum and the interrupted connectivity ‎caused by the primary user activity. In this paper, a multi‎path activity based routing protocol for cognitive radio ‎network (MACNRP is proposed. The protocol utilizes ‎channel availability and creates multiple node-disjoint ‎routes between the source and destination nodes. The ‎proposed protocol is compared with D2CARP and FTCRP ‎protocols. The performance evaluation is conducted ‎through mathematical analysis and using OPNET ‎simulation. The performance of the proposed protocol ‎achieves an increase in network throughput; besides it ‎decreases the probability of route failure due to node ‎mobility and primary user activity. We have found that the ‎MACNRP scheme results in 50% to 75% reduction in ‎blocking probability and 33% to 78% improvement in ‎network throughput, with a reasonable additional routing ‎overhead and average packet delay. Due to the successful ‎reduction of collision between primary users and ‎cognitive users, the MACNRP scheme results in decreasing ‎the path failure rate by 50% to 87%.‎

  15. Dynamic Weather Routes Architecture Overview

    Science.gov (United States)

    Eslami, Hassan; Eshow, Michelle

    2014-01-01

    Dynamic Weather Routes Architecture Overview, presents the high level software architecture of DWR, based on the CTAS software framework and the Direct-To automation tool. The document also covers external and internal data flows, required dataset, changes to the Direct-To software for DWR, collection of software statistics, and the code structure.

  16. Classification of Dynamic Vehicle Routing Systems

    DEFF Research Database (Denmark)

    Larsen, Allan; Madsen, Oli B.G.; Solomon, Marius M.

    2007-01-01

    This chapter discusses important characteristics seen within dynamic vehicle routing problems. We discuss the differences between the traditional static vehicle routing problems and its dynamic counterparts. We give an in-depth introduction to the degree of dynamism measure which can be used...... to classify dynamic vehicle routing systems. Methods for evaluation of the performance of algorithms that solve on-line routing problems are discussed and we list some of the most important issues to include in the system objective. Finally, we provide a three-echelon classification of dynamic vehicle routing...... systems based on their degree of dynamism and the system objective....

  17. Cognitive radios for dynamic spectrum access - Polyphase Multipath Radio Circuits for Dynamic Spectrum Access

    NARCIS (Netherlands)

    Klumperink, Eric A.M.; Shrestha, R.; Mensink, E.; Arkesteijn, V.J.; Nauta, Bram

    2007-01-01

    ABSTRACT Dynamic access of unused spectrum via a cognitive radio asks for flexible radio circuits that can work at an arbitrary radio frequency. This article reviews techniques to realize radios without resorting to frequency selective dedicated filters. In particular, a recently proposed polyphase

  18. Inventory routing for dynamic waste collection

    NARCIS (Netherlands)

    Mes, Martijn R.K.; Schutten, Johannes M.J.; Perez Rivera, Arturo Eduardo

    2014-01-01

    We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense

  19. Phone Routing using the Dynamic Memory Model

    DEFF Research Database (Denmark)

    Bendtsen, Claus Nicolaj; Krink, Thiemo

    2002-01-01

    In earlier studies a genetic algorithm (GA) extended with the dynamic memory model has shown remarkable performance on real-world-like problems. In this paper we experiment with routing in communication networks and show that the dynamic memory GA performs remarkable well compared to ant colony...

  20. Automated Flight Routing Using Stochastic Dynamic Programming

    Science.gov (United States)

    Ng, Hok K.; Morando, Alex; Grabbe, Shon

    2010-01-01

    Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

  1. Dynamic Routing of Short Transfer Baggage

    DEFF Research Database (Denmark)

    Clausen, Tommy; Pisinger, David

    We consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags t...... times, the algorithm is suitable for dynamic dispatching. Investigations on the impact of uncertainty and fleet size make it possible to support a trade-off between fleet size and expected service level....

  2. Method and System for Dynamic Automated Corrections to Weather Avoidance Routes for Aircraft in En Route Airspace

    Science.gov (United States)

    McNally, B. David (Inventor); Erzberger, Heinz (Inventor); Sheth, Kapil (Inventor)

    2015-01-01

    A dynamic weather route system automatically analyzes routes for in-flight aircraft flying in convective weather regions and attempts to find more time and fuel efficient reroutes around current and predicted weather cells. The dynamic weather route system continuously analyzes all flights and provides reroute advisories that are dynamically updated in real time while the aircraft are in flight. The dynamic weather route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

  3. Characterization of Static/Dynamic Topological Routing For Grid Networks

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Cuevas, Ruben; Riaz, M. Tahir

    2009-01-01

    Grid or 2D Mesh structures are becoming one of the most attractive network topologies to study. They can be used in many different fields raging from future broadband networks to multiprocessors structures. In addition, the high requirements of future services and applications demand more flexible...... and adaptive networks. Topological routing in grid networks is a simple and efficient alternative to traditional routing techniques, e.g. routing tables, and the paper extends this kind of routing providing a "Dynamic" attribute. This new property attempts to improve the overall network performance for future...

  4. Selection of optimal variant route based on dynamic fuzzy GRA

    Directory of Open Access Journals (Sweden)

    Jalil Heidary Dahooie

    2018-09-01

    Full Text Available Given the high costs of construction and maintenance, an optimum design methodology is one of the most important steps towards the development of transportation infrastructure, especially freeways. However, the effects of different variables on the decision-making process to find an optimal variant have caused the choice to become a very difficult and professional task for decision makers. So, the current paper aims to determine the optimal variant route for Isfahan-Shiraz freeway through MADM approaches. First, evaluation indices for an optimal route variant are derived through literature review and expert panel assessment. Then, a dynamic fuzzy GRA method is used for weightings and optimal route selection. Bases on the results, the road longevity, views of NGOs and route integration are identified as the highest-weighted criteria in route variant prioritization. Further, Route 3 is defined as the priority for the optimal variant for Isfahan–Shiraz freeway, which is the main basis in practice.

  5. An Efficient Route Maintenance Protocol for Dynamic Bluetooth Networks

    Directory of Open Access Journals (Sweden)

    Sabeen Tahir

    2017-10-01

    Full Text Available Bluetooth is a widespread technology for small wireless networks that permits Bluetooth devices to construct a multi-hop network called scatternet. Routing in multi-hop dynamic Bluetooth network, where a number of masters and bridges exist creates technical hitches. It is observed that frequent link disconnections and a new route construction consume extra system resources that degrade the whole network performance. Therefore, in this paper an Efficient Route Maintenance Protocol for Dynamic Bluetooth Networks (ERMP is proposed that repairs the weak routing paths based on the prediction of weak links and weak devices. The ERMP predicts the weak links through the signal strength and weak devices through low energy levels. During the main route construction, routing masters and bridges keep the information of the Fall Back Devices (FBDs for route maintenance. On the prediction of a weak link, the ERMP activates an alternate link, on the other hand, for a weak device it activates the FBD. The proposed ERMP is compared with some existing closely related protocols, and the simulation results show that the proposed ERMP successfully recovers the weak paths and improves the system performance.

  6. Assessment of multipath and shadowing effects on UHF band in ...

    African Journals Online (AJOL)

    In this work, the multi-path and shadowing effects on signal impairment were investigated through the use of empirical and semi-empirical path loss models analysis in built-up environments. Electromagnetic field strength measurements were conducted using four television transmitters at UHF bands along four major routes ...

  7. A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Shifeng Chen

    2017-09-01

    Full Text Available The dynamic vehicle routing problem (DVRP is a variant of the Vehicle Routing Problem (VRP in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a monarch butterfly optimization (MBO algorithm to solve DVRPs, utilizing a greedy strategy. Both migration operation and the butterfly adjusting operator only accept the offspring of butterfly individuals that have better fitness than their parents. To improve performance, a later perturbation procedure is implemented, to maintain a balance between global diversification and local intensification. The computational results indicate that the proposed technique outperforms the existing approaches in the literature for average performance by at least 9.38%. In addition, 12 new best solutions were found. This shows that this proposed technique consistently produces high-quality solutions and outperforms other published heuristics for the DVRP.

  8. Dynamic vehicle routing problems: Three decades and counting

    DEFF Research Database (Denmark)

    Psaraftis, Harilaos N.; Wen, Min; Kontovas, Christos A.

    2016-01-01

    Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing areal explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy...

  9. Dynamic routing problems with fruitful regions: models and evolutionary computation

    NARCIS (Netherlands)

    J.I. van Hemert; J.A. La Poutré (Han)

    2004-01-01

    textabstractWe introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to maximise the number of loads transported, while keeping to capacity and time constraints. Loads arrive while the

  10. Dynamic real-time routing for evacuation response planning and execution.

    Science.gov (United States)

    2011-01-01

    This study addresses the problem of dynamic routing operations in the emergency response context, primarily in terms : of the routing of response vehicles and evacuees. The study focuses on identifying the paths used for routing response : vehicles a...

  11. Congested Link Inference Algorithms in Dynamic Routing IP Network

    Directory of Open Access Journals (Sweden)

    Yu Chen

    2017-01-01

    Full Text Available The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP and Rest Bayesian Network Model (RBNM, we proposed an Improved CLINK (ICLINK algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

  12. Mitigation of GPS code and carrier phase multipath effects using a multi-antenna system

    Science.gov (United States)

    Ray, Jayanta Kumar

    Multipath is a major source of error in GPS code and carrier phase measurements in the differential mode of operation, which can prevent the achievement of the highest levels of accuracy. This is especially prevalent in a static receiver where multipath introduces slow varying errors in the measurements due to satellite dynamics, and which cannot be averaged out. Multipath is spatially correlated within a small area. This relationship can be exploited to mitigate multipath errors. The research aims at reducing the effect of multipath in code and carrier phase measurements in a stationary receiver using a multiple antenna/receiver approach. A method is developed, which uses five or more antennas, spaced about 5--10 cm apart. The response of the GPS receiver code and carrier discriminator functions in the presence of a multipath signal is analyzed, and multipath errors within a small area are related to the antenna-satellite and antenna-reflector geometry using multipath and geometric parameters, such as, the reflection coefficient, multipath delay, multipath phase, as well as multipath signal azimuth and elevation. A Kalman filter is developed to use multipath-corrupted measurements from multiple closely-spaced antennas to estimate the multipath and geometric parameters, from which the multipath errors in the code and carrier measurements at each antenna can be computed. Field tests in a moderate multipath environment show a reduction in multipath errors up to 73% (average 22%) in the code and up to 52% (average 15%) in the carrier residuals. Improvements are also observed in the position domain, whereby the differential position accuracy is improved by up to 51% (average 21%) and up to 37% (average 24%) for the non-smoothed code and carrier cases respectively. A desirable characteristic of this technique is that it is more effective in a high multipath environment. This technique has potential to be used in real time in reference stations generating corrections for

  13. Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

    Directory of Open Access Journals (Sweden)

    Yingcheng Xu

    2013-01-01

    Full Text Available In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.

  14. Characteristics of the BDS Carrier Phase Multipath and Its Mitigation Methods in Relative Positioning.

    Science.gov (United States)

    Dai, Wujiao; Shi, Qiang; Cai, Changsheng

    2017-04-07

    The carrier phase multipath effect is one of the most significant error sources in the precise positioning of BeiDou Navigation Satellite System (BDS). We analyzed the characteristics of BDS multipath, and found the multipath errors of geostationary earth orbit (GEO) satellite signals are systematic, whereas those of inclined geosynchronous orbit (IGSO) or medium earth orbit (MEO) satellites are both systematic and random. The modified multipath mitigation methods, including sidereal filtering algorithm and multipath hemispherical map (MHM) model, were used to improve BDS dynamic deformation monitoring. The results indicate that the sidereal filtering methods can reduce the root mean square (RMS) of positioning errors in the east, north and vertical coordinate directions by 15%, 37%, 25% and 18%, 51%, 27% in the coordinate and observation domains, respectively. By contrast, the MHM method can reduce the RMS by 22%, 52% and 27% on average. In addition, the BDS multipath errors in static baseline solutions are a few centimeters in multipath-rich environments, which is different from that of Global Positioning System (GPS) multipath. Therefore, we add a parameter representing the GEO multipath error in observation equation to the adjustment model to improve the precision of BDS static baseline solutions. And the results show that the modified model can achieve an average precision improvement of 82%, 54% and 68% in the east, north and up coordinate directions, respectively.

  15. The Dynamic Multi-Period Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Wen, Min; Cordeau, Jean-Francois; Laporte, Gilbert

    This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minim......This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives...... are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning horizon. This problem originates from a large distributor operating in Sweden. It is modeled as a mixed integer linear program, and solved by means of a three-phase heuristic that works over a rolling...... planning horizon. The multi-objective aspect of the problem is handled through a scalar technique approach. Computational results show that our solutions improve upon those of the Swedish distributor....

  16. The dynamic multi-period vehicle routing problem

    DEFF Research Database (Denmark)

    Wen, Min; Cordeau, Jean-Francois; Laporte, Gilbert

    2010-01-01

    This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minim......This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives...... are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning horizon. This problem originates from a large distributor operating in Sweden. It is modeled as a mixed integer linear program, and solved by means of a three-phase heuristic that works over a rolling...... planning horizon. The multi-objective aspect of the problem is handled through a scalar technique approach. Computational results show that the proposed approach can yield high quality solutions within reasonable running times....

  17. Performance evaluation of CPPM modulation in multi-path environments

    International Nuclear Information System (INIS)

    Tasev, Zarko; Kocarev, Ljupco

    2003-01-01

    Chaotic pulse position modulation (CPPM) is a novel technique to communicate with chaotic signals based upon pulse trains in which the intervals between two pulses are determined by chaotic dynamics of a pulse generator. Using numerical simulations we show that CPPM offers excellent multi-path performance. We simulated the CPPM radio system, which is designed for a WLAN application and operates in the 2.4 GHz ISM frequency band with IEEE 802.11 compliant channel spacing. In this case, the average performance loss due the multi-path for CPPM is less than 5 dB

  18. UWB radar multipath propagation effects

    Czech Academy of Sciences Publication Activity Database

    Čermák, D.; Schejbal, V.; NĚMEC, Z.; Bezoušek, P.; Fišer, Ondřej

    2005-01-01

    Roč. 11, - (2005), --- ISSN 1211-6610 R&D Projects: GA MPO FT-TA2/030 Institutional research plan: CEZ:AV0Z30420517 Keywords : UWB radar * multipath propagation Subject RIV: JA - Electronics ; Optoelectronics, Electrical Engineering

  19. An improved method for Multipath Hemispherical Map (MHM) based on Trend Surface Analysis

    Science.gov (United States)

    Wang, Zhiren; Chen, Wen; Dong, Danan; Yu, Chao

    2017-04-01

    Among various approaches developed for detecting the multipath effect in high-accuracy GNSS positioning, Only MHM (Multipath Hemispherical Map) and SF (Sidereal Filtering) can be implemented to real-time GNSS data processing. SF is based on the time repeatability of satellites which just suitable for static environment, while the spatiotemporal repeatability-based MHM is applicable not only for static environment but also for dynamic carriers with static multipath environment such as ships and airplanes, and utilizes much smaller number of parameters than ASF. However, the MHM method also has certain defects. Since the MHM take the mean of residuals from the grid as the filter value, it is more suitable when the multipath regime is medium to low frequency. Now existing research data indicate that the newly advanced Sidereal Filtering (ASF) method perform better with high frequency multipath reduction than MHM by contrast. To solve the above problem and improve MHM's performance on high frequency multipath, we combined binary trend surface analysis method with original MHM model to effectively analyze particular spatial distribution and variation trends of multipath effect. We computed trend surfaces of the residuals within a grid by least-square procedures, and chose the best results through the moderate successive test. The enhanced MHM grid was constructed from a set of coefficients of the fitted equation instead of mean value. According to the analysis of the actual observation, the improved MHM model shows positive effect on high frequency multipath reduction, and significantly reduced the root mean square (RMS) value of the carrier residuals. Keywords: Trend Surface Analysis; Multipath Hemispherical Map; high frequency multipath effect

  20. MultiPaths Revisited - A novel approach using OpenFlow-enabled devices

    CERN Document Server

    Al-Shabibi, Ali; Martin, Brian

    2011-06-11

    This thesis presents novel approaches enhancing the performance of computer networks using multipaths. Our enhancements take the form of congestion-aware routing protocols. We present three protocols called MultiRoute, Step-Route, and finally PathRoute. Each of these protocols leverage both local and remote congestion statistics and build different representations (or views) of the network congestion by using an innovative representation of congestion for router-router links. These congestion statistics are then distributed via an aggregation protocol to other routers in the network. For many years, multipath routing protocols have only been used in simple situations, such as Link Aggregation and/or networks where paths of equal cost (and therefore equal delay) exist. But, paths of unequal costs are often discarded to the benefit of shortest path only routing because it is known that paths of unequal length present different delays and therefore cause out of order packets which cause catastrophic network per...

  1. Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Haitao Xu

    2018-01-01

    Full Text Available As we all know, there are a great number of optimization problems in the world. One of the relatively complicated and high-level problems is the vehicle routing problem (VRP. Dynamic vehicle routing problem (DVRP is a major variant of VRP, and it is closer to real logistic scene. In DVRP, the customers’ demands appear with time, and the unserved customers’ points must be updated and rearranged while carrying out the programming paths. Owing to the complexity and significance of the problem, DVRP applications have grabbed the attention of researchers in the past two decades. In this paper, we have two main contributions to solving DVRP. Firstly, DVRP is solved with enhanced Ant Colony Optimization (E-ACO, which is the traditional Ant Colony Optimization (ACO fusing improved K-means and crossover operation. K-means can divide the region with the most reasonable distance, while ACO using crossover is applied to extend search space and avoid falling into local optimum prematurely. Secondly, several new evaluation benchmarks are proposed, which can objectively and comprehensively estimate the proposed method. In the experiment, the results for different scale problems are compared to those of previously published papers. Experimental results show that the algorithm is feasible and efficient.

  2. A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR PROTOCOL IN MOBILE AD-HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    Alaa Azmi Allahham

    2017-02-01

    Full Text Available Mobile Ad-hoc networks (MANETs involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, but in return has caused this random mobility of the nodes many of the challenges, where the routing is considered one of these challenges. There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. The DSR (Dynamic Source Routing routing protocol algorithm is one of these routing protocols which consist of two main stages; route discovery and maintenance, where the route discovery algorithm operates based on blind flooding of request messages. blind flooding is considered as the most well known broadcasting mechanism, it is inefficient in terms of communication and resource utilization, which causing increasing the probability of collisions, repeating send several copies of the same message, as well as increasing the delay. Hence, a new mechanism in route discovery stage and in caching the routes in DSR algorithm according to the node's location in the network and the direction of the broadcast is proposed for better performance especially in terms of delay as well as redundant packets rate. The implementation of proposed algorithms showed positive results in terms of delay, overhead, and improve the performance of MANETs in general.

  3. Threshold based AntNet algorithm for dynamic traffic routing of road networks

    Directory of Open Access Journals (Sweden)

    Ayman M. Ghazy

    2012-07-01

    Full Text Available Dynamic routing algorithms play an important role in road traffic routing to avoid congestion and to direct vehicles to better routes. AntNet routing algorithms have been applied, extensively and successfully, in data communication network. However, its application for dynamic routing on road networks is still considerably limited. This paper presents a modified version of the AntNet routing algorithm, called “Threshold based AntNet”, that has the ability to efficiently utilize a priori information of dynamic traffic routing, especially, for road networks. The modification exploits the practical and pre-known information for most road traffic networks, namely, the good travel times between sources and destinations. The values of those good travel times are manipulated as threshold values. This approach has proven to conserve tracking of good routes. According to the dynamic nature of the problem, the presented approach guards the agility of rediscovering a good route. Attaining the thresholds (good reported travel times, of a given source to destination route, permits for a better utilization of the computational resources, that, leads to better accommodation for the network changes. The presented algorithm introduces a new type of ants called “check ants”. It assists in preserving good routes and, better yet, exposes and discards the degraded ones. The threshold AntNet algorithm presents a new strategy for updating the routing information, supported by the backward ants.

  4. Global Positioning System (GPS) Receiver Design For Multipaths Mitigation

    National Research Council Canada - National Science Library

    Gadallah, El-Sayed

    1998-01-01

    .... This research introduces a new estimator that can detect the presence of multipath, can determine the unknown number of multipath components and can estimate multipath parameters in the GPS receiver...

  5. Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

    Science.gov (United States)

    Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

    2010-03-16

    A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

  6. Trust-Based Route Selection in Dynamic Source Routin

    DEFF Research Database (Denmark)

    Jensen, Christian D.; Connell, Paul O

    2006-01-01

    in the mobile wireless network. However, blindly trusting all other nodes to respect the routing protocol exposes the local node to a wide variety of vulnerabilities. Traditional security mechanisms rely on either the authenticated identity of the requesting principal or some form of credentials that authorise...... the client to perform certain actions. Generally, these mechanisms require some underlying infrastructure, e.g., a public key infrastructure (PKI). However, we cannot assume such infrastructures to be in place in an ad hoc network. In this paper we propose an extension to an existing ad hoc routing protocols......, which selects the route based on a local evaluation of the trustworthiness of all known intermediary nodes (routers) on the route to the destination. We have implemented this mechanism in an existing ad hoc routing protocol, and we show how trust can be built from previous experience and how trust can...

  7. DTN routing in body sensor networks with dynamic postural partitioning.

    Science.gov (United States)

    Quwaider, Muhannad; Biswas, Subir

    2010-11-01

    This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks ( WBAN ) with frequent postural partitioning. A prototype WBAN has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

  8. Multipath Detection Using Boolean Satisfiability Techniques

    Directory of Open Access Journals (Sweden)

    Fadi A. Aloul

    2011-01-01

    Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.

  9. Chaos-based wireless communication resisting multipath effects

    Science.gov (United States)

    Yao, Jun-Liang; Li, Chen; Ren, Hai-Peng; Grebogi, Celso

    2017-09-01

    In additive white Gaussian noise channel, chaos has been shown to be the optimal coherent communication waveform in the sense of using a very simple matched filter to maximize the signal-to-noise ratio. Recently, Lyapunov exponent spectrum of the chaotic signals after being transmitted through a wireless channel has been shown to be unaltered, paving the way for wireless communication using chaos. In wireless communication systems, inter-symbol interference caused by multipath propagation is one of the main obstacles to achieve high bit transmission rate and low bit-error rate (BER). How to resist the multipath effect is a fundamental problem in a chaos-based wireless communication system (CWCS). In this paper, a CWCS is built to transmit chaotic signals generated by a hybrid dynamical system and then to filter the received signals by using the corresponding matched filter to decrease the noise effect and to detect the binary information. We find that the multipath effect can be effectively resisted by regrouping the return map of the received signal and by setting the corresponding threshold based on the available information. We show that the optimal threshold is a function of the channel parameters and of the information symbols. Practically, the channel parameters are time-variant, and the future information symbols are unavailable. In this case, a suboptimal threshold is proposed, and the BER using the suboptimal threshold is derived analytically. Simulation results show that the CWCS achieves a remarkable competitive performance even under inaccurate channel parameters.

  10. Inverse Scattering in a Multipath Environment

    Directory of Open Access Journals (Sweden)

    A. Cuccaro

    2016-09-01

    Full Text Available In this contribution an inverse scattering problem is ad- dressed in a multipath environment. In particular, multipath is created by known ”extra” point-like scatterers (passive elements expressely deployed between the scene under in- vestigation and the source/measurement domains. Through a back-projection imaging scheme, the role of the passive elements on the achievable performance is shown and com- pared to the free-space case.

  11. Selection of optimal variant route based on dynamic fuzzy GRA

    OpenAIRE

    Jalil Heidary Dahooie; Amir Salar Vanaki; Navid Mohammadi; Hamid Reza Firoozfar

    2018-01-01

    Given the high costs of construction and maintenance, an optimum design methodology is one of the most important steps towards the development of transportation infrastructure, especially freeways. However, the effects of different variables on the decision-making process to find an optimal variant have caused the choice to become a very difficult and professional task for decision makers. So, the current paper aims to determine the optimal variant route for Isfahan-Shiraz freeway through MAD...

  12. BOC(n,n) signal multipath mitigation using MEDLL technology

    Science.gov (United States)

    Su, Xuan; Zhang, Yanmei; Su, Lianqing; Guo, Haichao

    2015-11-01

    For satellite navigation and positioning receivers are susceptible to the influence of the multipath, this paper used multipath estimating delay lock loop (MEDLL) technology for BOC (n, n) multipath signal tracking. Through the analysis of multipath signal model, it is concluded that all the multipath signal can be expressed by its amplitude, phase and delay. Then in odor to get the accurate direct signal, this paper applied MEDLL algorithm to estimate the received signal. Finally, the simulation show that this algorithm can realize multipath signal track demodulation and accurate data demodulation under a low signal noise ratio environment (SNR= -20db).

  13. DARAL: A Dynamic and Adaptive Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Francisco José Estévez

    2016-06-01

    Full Text Available The evolution of Smart City projects is pushing researchers and companies to develop more efficient embedded hardware and also more efficient communication technologies. These communication technologies are the focus of this work, presenting a new routing algorithm based on dynamically-allocated sub-networks and node roles. Among these features, our algorithm presents a fast set-up time, a reduced overhead and a hierarchical organization, which allows for the application of complex management techniques. This work presents a routing algorithm based on a dynamically-allocated hierarchical clustering, which uses the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time. The present work based its test scenario and analysis in the density measure, considered as a node degree. The routing algorithm is compared with some of the most well known routing algorithms for different scenario densities.

  14. On a New Route to Chaos in Railway Dynamics

    DEFF Research Database (Denmark)

    True, Hans; Jensen, Carsten Nordstroem

    1997-01-01

    Cooperrider's mathematical model of a railway bogie running on a straight track has been thoroughly investigated due to its interesting nonlinear dynamics (see True [1] for a survey). In this article a detailed numerical investigation is made of the dynamics in a speed range, where many solutions...

  15. A Dynamic Optimization Method of Indoor Fire Evacuation Route Based on Real-time Situation Awareness

    Directory of Open Access Journals (Sweden)

    DING Yulin

    2016-12-01

    Full Text Available How to provide safe and effective evacuation routes is an important safeguard to correctly guide evacuation and reduce the casualties during the fire situation rapidly evolving in complex indoor environment. The traditional static path finding method is difficult to adjust the path adaptively according to the changing fire situation, which lead to the evacuation decision-making blindness and hysteresis. This paper proposes a dynamic method which can dynamically optimize the indoor evacuation routes based on the real-time situation awareness. According to the real-time perception of fire situation parameters and the changing indoor environment information, the evacuation route is optimized dynamically. The integrated representation of multisource indoor fire monitoring sensor observations oriented fire emergency evacuation is presented at first, real-time fire threat situation information inside building is then extracted from the observation data of multi-source sensors, which is used to constrain the dynamical optimization of the topology of the evacuation route. Finally, the simulation experiments prove that this method can improve the accuracy and efficiency of indoor evacuation routing.

  16. Energy Efficiency Analysis for Dynamic Routing in Optical Transport Networks

    DEFF Research Database (Denmark)

    Vizcaíno, Jorge López; Ye, Yabin; Tafur Monroy, Idelfonso

    2012-01-01

    The energy efficiency in telecommunication networks is gaining more relevance as the Internet traffic is growing. The introduction of OFDM and dynamic operation opens new horizons in the operation of optical networks, improving the network flexibility and its efficiency. In this paper, we compare...... the performance in terms of energy efficiency of a flexible-grid OFDM-based solution with a fixed-grid WDM network in a dynamic scenario with time-varying connections. We highlight the benefits that the bandwidth elasticity and the flexibility of selecting different modulation formats can offer compared...

  17. On a New Route to Chaos in Railway Dynamics

    DEFF Research Database (Denmark)

    True, Hans; Jensen, Carsten Nordstroem

    1997-01-01

    incompressible Navier-Stokes equations. The problem investigated by Franceschini is a smooth dynamical system in contrast to the dynamics of the Cooperrider truck model. The forcing in the Cooperrider model includes a component, which has the form of a very stiff linear spring with a dead band simulating...... solution is initially unstable, but it gains stability in a saddle-node bifurcation when the branch turns back toward lower speeds. The chaotic attractor disappears abruptly in what is conjectured to be a blue sky catastrophe, when the speed decreases further....

  18. Genetic Algorithm-based Dynamic Vehicle Route Search using Car-to-Car Communication

    Directory of Open Access Journals (Sweden)

    KIM, J.

    2010-11-01

    Full Text Available Suggesting more efficient driving routes generate benefits not only for individuals by saving commute time, but also for society as a whole by reducing accident rates and social costs by lessening traffic congestion. In this paper, we suggest a new route search algorithm based on a genetic algorithm which is more easily installable into mutually communicating car navigation systems, and validate its usefulness through experiments reflecting real-world situations. The proposed algorithm is capable of searching alternative routes dynamically in unexpected events of system malfunctioning or traffic slow-downs due to accidents. Experimental results demonstrate that our algorithm searches the best route more efficiently and evolves with universal adaptability.

  19. Weighted OFDM for wireless multipath channels

    DEFF Research Database (Denmark)

    Prasad, Ramjee; Nikookar, H.

    2000-01-01

    of simulation and is compared for the above mentioned weighting factors. Results show that by weighting of the OFDM signal the PAPR reduces. Bit error performance of weighted multicarrier transmission over a multipath channel is also investigated. Results indicate that there is a trade off between PAPR...

  20. Energy Efficient Routing Algorithms in Dynamic Optical Core Networks with Dual Energy Sources

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Fagertun, Anna Manolova; Ruepp, Sarah Renée

    2013-01-01

    This paper proposes new energy efficient routing algorithms in optical core networks, with the application of solar energy sources and bundled links. A comprehensive solar energy model is described in the proposed network scenarios. Network performance in energy savings, connection blocking...... probability, resource utilization and bundled link usage are evaluated with dynamic network simulations. Results show that algorithms proposed aiming for reducing the dynamic part of the energy consumption of the network may raise the fixed part of the energy consumption meanwhile....

  1. Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes.

    Science.gov (United States)

    Bai, Cong; Peng, Zhong-Ren; Lu, Qing-Chang; Sun, Jian

    2015-01-01

    Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes.

  2. Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes

    Science.gov (United States)

    Bai, Cong; Peng, Zhong-Ren; Lu, Qing-Chang; Sun, Jian

    2015-01-01

    Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes. PMID:26294903

  3. Dynamic UAV-based traffic monitoring under uncertainty as a stochastic arc-inventory routing policy

    Directory of Open Access Journals (Sweden)

    Joseph Y.J. Chow

    2016-10-01

    Full Text Available Given the rapid advances in unmanned aerial vehicles, or drones, and increasing need to monitor at a city level, one of the current research gaps is how to systematically deploy drones over multiple periods. We propose a real-time data-driven approach: we formulate the first deterministic arc-inventory routing problem and derive its stochastic dynamic policy. The policy is expected to be of greatest value in scenarios where uncertainty is highest and costliest, such as city monitoring during major events. The Bellman equation for an approximation of the proposed inventory routing policy is formulated as a selective vehicle routing problem. We propose an approximate dynamic programming algorithm based on Least Squares Monte Carlo simulation to find that policy. The algorithm has been modified so that the least squares dependent variable is defined to be the “expected stock out cost upon the next replenishment”. The new algorithm is tested on 30 simulated instances of real time trajectories over 5 time periods of the selective vehicle routing problem to evaluate the proposed policy and algorithm. Computational results on the selected instances show that the algorithm on average outperforms the myopic policy by 23–28%, depending on the parametric design. Further tests are conducted on classic benchmark arc routing problem instances. The 11-link instance gdb19 (Golden et al., 1983 is expanded into a sequential 15-period stochastic dynamic example and used to demonstrate why a naïve static multi-period deployment plan would not be effective in real networks.

  4. Long-Range Correlations and Memory in the Dynamics of Internet Interdomain Routing.

    Directory of Open Access Journals (Sweden)

    Maksim Kitsak

    Full Text Available Data transfer is one of the main functions of the Internet. The Internet consists of a large number of interconnected subnetworks or domains, known as Autonomous Systems (ASes. Due to privacy and other reasons the information about what route to use to reach devices within other ASes is not readily available to any given AS. The Border Gateway Protocol (BGP is responsible for discovering and distributing this reachability information to all ASes. Since the topology of the Internet is highly dynamic, all ASes constantly exchange and update this reachability information in small chunks, known as routing control packets or BGP updates. In the view of the quick growth of the Internet there are significant concerns with the scalability of the BGP updates and the efficiency of the BGP routing in general. Motivated by these issues we conduct a systematic time series analysis of BGP update rates. We find that BGP update time series are extremely volatile, exhibit long-term correlations and memory effects, similar to seismic time series, or temperature and stock market price fluctuations. The presented statistical characterization of BGP update dynamics could serve as a basis for validation of existing and developing better models of Internet interdomain routing.

  5. Ultrasonic Flaw Imaging via Multipath Exploitation

    Directory of Open Access Journals (Sweden)

    Yimin D. Zhang

    2012-01-01

    Full Text Available We consider ultrasonic imaging for the visualization of flaws in a material. Ultrasonic imaging is a powerful nondestructive testing (NDT tool which assesses material conditions via the detection, localization, and classification of flaws inside a structure. We utilize reflections of ultrasonic signals which occur when encountering different media and interior boundaries. These reflections can be cast as direct paths to the target corresponding to the virtual sensors appearing on the top and bottom side of the target. Some of these virtual sensors constitute a virtual aperture, whereas in others, the aperture changes with the transmitter position. Exploitations of multipath extended virtual array apertures provide enhanced imaging capability beyond the limitation of traditional multisensor approaches. The waveforms observed at the physical as well as the virtual sensors yield additional measurements corresponding to different aspect angles, thus allowing proper multiview imaging of flaws. We derive the wideband point spread functions for dominant multipaths and show that fusion of physical and virtual sensor data improves the flaw perimeter detection and localization performance. The effectiveness of the proposed multipath exploitation approach is demonstrated using real data.

  6. ACO Agent Based Routing in AOMDV Environment

    Directory of Open Access Journals (Sweden)

    Kaur Amanpreet

    2016-01-01

    Full Text Available Mobile Ad-hoc Network (MANET is a group of moving nodes which can communicate with each other without the help of any central stationary node. All the nodes in the MANET act as router for forwarding data packets. The nodes in the network also move randomly and there exists no fixed infrastructure. So, path breaks are the frequent problem in MANET. The routing protocol faces a lot of problem due these path breaks. Therefore, the routing protocol which is multipath in nature is more reliable than a unipath routing protocol. Ant colony optimization is a relatively new technique which is suitable for the optimization problems. AOMDV is a multipath routing protocol. Thus, if there happens to be path break, the packets can start following the new path which has already been selected. In this paper, we are trying to add ant’s agents into AOMDV behavior. In this way, the new protocol will be benefited by the dual properties i.e. of ant’s nature and multipath nature of AOMDV. The modified concept is simulated and the outcomes are compared with AOMDV, AODV and DSR routing protocols for few performance parameters. Results obtained are encouraging; the new algorithm performs better than traditional unipath and multipath routing protocols.

  7. One Kind of Routing Algorithm Modified in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Wei Ni Ni

    2016-01-01

    Full Text Available The wireless sensor networks are the emerging next generation sensor networks, Routing technology is the wireless sensor network communication layer of the core technology. To build reliable paths in wireless sensor networks, we can consider two ways: providing multiple paths utilizing the redundancy to assure the communication reliability or constructing transmission reliability mechanism to assure the reliability of every hop. Braid multipath algorithm and ReInforM routing algorithm are the realizations of these two mechanisms. After the analysis of these two algorithms, this paper proposes a ReInforM routing algorithm based braid multipath routing algorithm.

  8. Performance Evaluation of Concurrent Multipath Video Streaming in Multihomed Mobile Networks

    Directory of Open Access Journals (Sweden)

    James Nightingale

    2013-01-01

    Full Text Available High-quality real-time video streaming to users in mobile networks is challenging due to the dynamically changing nature of the network paths, particularly the limited bandwidth and varying end-to-end delay. In this paper, we empirically investigate the performance of multipath streaming in the context of multihomed mobile networks. Existing schemes that make use of the aggregated bandwidth of multiple paths can overcome bandwidth limitations on a single path but suffer an efficiency penalty caused by retransmission of lost packets in reliable transport schemes or path switching overheads in unreliable transport schemes. This work focuses on the evaluation of schemes to permit concurrent use of multiple paths to deliver video streams. A comprehensive streaming framework for concurrent multipath video streaming is proposed and experimentally evaluated, using current state-of-the-art H.264 Scalable Video Coding (H.264/SVC and the next generation High Efficiency Video Coding (HEVC standards. It provides a valuable insight into the benefit of using such schemes in conjunction with encoder specific packet prioritisation mechanisms for quality-aware packet scheduling and scalable streaming. The remaining obstacles to deployment of concurrent multipath schemes are identified, and the challenges in realising HEVC based concurrent multipath streaming are highlighted.

  9. Impact of Satellite Aeronautical Channel on Modem Specifications : Phase II. Oceanic Multipath Measurements and Modem Concepts

    Science.gov (United States)

    1975-01-01

    The report completes the analysis initiated in the Phase I report of the effects of oceanic multipath on ranging and data modems for satellite air traffic control systems. The interaction between multipath antenna and apparent measured multipath is d...

  10. Express company’s vehicle routing optimization by multiple-dynamic saving algorithm

    Directory of Open Access Journals (Sweden)

    Junchao Liu

    2014-05-01

    Full Text Available Purpose: According to the disorder in circulation commuting and crossover commuting of SF company which is the China’s largest private express delivery service provider, the study uses the Saving Algorithm to make the vehicle routing and resources optimized, on this basis, proposes innovative improvements with Saving Algorithm and then applies it in every distribution center of SF forming a "multi-dynamic" type of Saving Algorithm to ensure both cost savings and timeliness. This method can be generalized for all express company to get the vehicle routing optimized.Design/methodology/approach: As the special transportation requirements of express companies, this study optimizes the vehicle route based on Saving Algorithm, uses multiple-dynamic Saving Algorithm, and considers the timeliness requirements of the express company to achieve a balance of cost and timeliness.Findings: The main finding is that a new method proposed which there can be a balance improvement for both cost and timeliness to optimize the vehicle route of express company. Calculation example validates the effectiveness of the model established and solving method.Practical implications: It is a widespread practice that by setting up model and parameters for the objectives, express company can maintain the balances between cost and timeliness and achieve the optimized vehicle route.Originality/value: It proposes innovative improvements, takes SF express company as an example, with Saving Algorithm which can be applied in every distribution center of express company to ensure the balance improvement for both cost and timeliness, and has a great practical significance to the transportation network and path optimization of express companies.

  11. Adaptive Multipath Key Reinforcement for Energy Harvesting Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Di Mauro, Alessio; Dragoni, Nicola

    2015-01-01

    Energy Harvesting - Wireless Sensor Networks (EH-WSNs) constitute systems of networked sensing nodes that are capable of extracting energy from the environment and that use the harvested energy to operate in a sustainable state. Sustainability, seen as design goal, has a significant impact...... on the design of the security protocols for such networks, as the nodes have to adapt and optimize their behaviour according to the available energy. Traditional key management schemes do not take energy into account, making them not suitable for EH-WSNs. In this paper we propose a new multipath key...... reinforcement scheme specifically designed for EH-WSNs. The proposed scheme allows each node to take into consideration and adapt to the amount of energy available in the system. In particular, we present two approaches, one static and one fully dynamic, and we discuss some experimental results....

  12. Routes, dynamics, and correlates of cochlear inflammation in terminal and recovering experimental meningitis

    DEFF Research Database (Denmark)

    Cayé-Thomasen, Per; Worsøe, Lise; Brandt, Christian Thomas

    2009-01-01

    OBJECTIVES/HYPOTHESIS: To examine the routes, dynamics and correlates of cochlear inflammation in meningitis to provide information on the pathogenesis of the associated hearing loss and indications for rational pharmacotherapeutical intervention. STUDY DESIGN: A well-established rat model...... of Streptococcus pneumoniae meningitis was employed. METHODS: Eight rats were inoculated intrathecally and not treated, whereas 26 were inoculated and treated with ceftriaxone. Six rats were sham-inoculated, making a total of 40 rats. The rats were sacrificed when reaching terminal illness or after 7 days......, followed by light microscopy. Routes of cochlear inflammatory infiltration were examined. The volume fraction of inflammatory infiltration was estimated and correlated to bacterial and leukocyte counts in cerebrospinal fluid (CSF) and blood. RESULTS: The perilymphatic space was infiltrated...

  13. Spectral encoded optical label detection for dynamic routing of impulse radio ultra-wideband signals in metro-access networks

    DEFF Research Database (Denmark)

    Osadchiy, Alexey Vladimirovich; Yu, Xianbin; Yin, Xiaoli

    2010-01-01

    In this paper we propose and experimentally demonstrate the principle of coherent label detection for dynamic routing of wavelength division multiplexed impulse radio ultra-wideband signals by using four-tone spectral amplitude coded labels.......In this paper we propose and experimentally demonstrate the principle of coherent label detection for dynamic routing of wavelength division multiplexed impulse radio ultra-wideband signals by using four-tone spectral amplitude coded labels....

  14. Multipath transport for virtual private networks

    Science.gov (United States)

    2017-03-01

    Implementation There exist several different methods of implementing a VPN. VPNs are built within the existing 7-Layer Open Systems Interconnection ( OSI ) model and...OpenVPN operates at layer 2 or 3 in the OSI model . This meansMPTCP can affectOpenVPNoperation in unexpectedways. Figure 2.8 is a high-level view on...in Section 2.1.1, different VPNs operate at different layers of the OSI model . Testing the multipath protocols of this thesis with different VPNs may

  15. Static Probabilistic Timing Analysis for Multi-path Programs

    NARCIS (Netherlands)

    Lesage, B.; Griffin, D.; Altmeyer, S.; Davis, R.I.

    2015-01-01

    This paper introduces an effective Static Probabilistic Timing Analysis (SPTA) for multi-path programs. The analysis estimates the temporal contribution of an evict-on-miss, random replacement cache to the probabilistic Worst-Case Execution Time (pWCET) distribution of multi-path programs. The

  16. Self-Adaptive Intelligent Routing in Dynamic WSN using Natural Inspired Computing

    Science.gov (United States)

    Mustary Mr., Nareshkumar R.; Phanikumar, S., Dr.

    2017-08-01

    Mobile Adhoc Networks are designed dynamically without any infrastructure and each node is accountable for routing information amongst them. In MANET’s, the network topology dynamically variations over time to time due to energy preservation or changes in node position. Thus both routing problem turn out to be dynamic optimization problem in MANET’s. Hence it is crucial to design solution for the optimization problem is to quickly adopt to changing environment and produce high quality optimization using Modified Particle Swarm Optimization. The Particle Swarm Optimization is effective in determining optimal solutions in fixed locations, but it suffered from poor performance in locating a changing extreme. It was also necessary to impose a maximum value Vmax to avoiding the particle exploded because of there was no exist a mechanism for controlling the velocity of a particle. PSO searches wide areas effectively, but difficult to search in local precision. Hence, introduced a control parameter called the inertia weight, “w”, to damp the velocities over time, allowing the swarm to converge more accurately and efficiently.

  17. Spatial Characterization of GNSS Multipath Channels

    Directory of Open Access Journals (Sweden)

    Hatef Keshvadi

    2012-01-01

    Full Text Available There is a growing interest in detecting and processing Global Navigation Satellite System (GNSS signals in indoors and urban canyons by handheld devices. To overcome the signal attenuation problem in such adverse fading environments, long coherent integration is normally used. Moving the antenna arbitrarily while collecting signals is generally avoided as it temporally decorrelates the signals and limits the coherent integration gain. This decorrelation is a function of the antenna displacement and geometry of reflectors and angle of arrival of the received signal. Hence, to have an optimum receiver processing strategy it is crucial to characterize the multipath fading channel parameters. Herein, Angle of Arrival (AoA and Angle Spread (AS along with signal spatial correlation coefficient and fading intensity in GNSS multipath indoor channels are defined and quantified theoretically and practically. A synthetic uniform circular array utilizing a right-hand circular polarized (RHCP antenna has been used to measure the spatial characteristics of indoor GNSS fading channels. Furthermore, rotating effect of a circular polarized antenna on the synthetic array processing and AoA estimation has been characterized. The performance of the beamforming technique via array gain is also assessed to explore the advantages and limitations of beamforming in fading conditions.

  18. Dynamic Retransmission Limit Scheme in MAC Layer for Routing in Multihop Ad hoc Networks

    Directory of Open Access Journals (Sweden)

    Rachid El-Azouzi

    2008-05-01

    Full Text Available We consider a wireless ad hoc network with random access channel. We present a model that takes into account topology, routing, random access in MAC layer, and forwarding probability. In this paper, we focus on drawing benefit from the interaction of the MAC (governed by IEEE 802.11 or slotted Aloha and routing by defining a new cross-layer scheme for routing based on the limit number of retransmission. By adjusting dynamically and judiciously this parameter in a saturated network, we have realized that both stability of forwarding queues and average throughput are significantly improved in linear networks with symmetric traffic: a gain of 100% can be reached. While in asymmetric topology network with asymmetric traffic, we achieve a better average delay (resp., throughput for each connection without changing the average throughput (resp., delay. In addition, we show the efficiency of our new scheme in case of multimedia applications with delay constraint. A detailed performance study is presented using analytical and simulation evaluation.

  19. The effect of dynamic scheduling and routing in a solid waste management system

    International Nuclear Information System (INIS)

    Johansson, Ola M.

    2006-01-01

    Solid waste collection and hauling account for the greater part of the total cost in modern solid waste management systems. In a recent initiative, 3300 Swedish recycling containers have been fitted with level sensors and wireless communication equipment, thereby giving waste collection operators access to real-time information on the status of each container. In this study, analytical modeling and discrete-event simulation have been used to evaluate different scheduling and routing policies utilizing the real-time data. In addition to the general models developed, an empirical simulation study has been performed on the downtown recycling station system in Malmoe, Sweden. From the study, it can be concluded that dynamic scheduling and routing policies exist that have lower operating costs, shorter collection and hauling distances, and reduced labor hours compared to the static policy with fixed routes and pre-determined pick-up frequencies employed by many waste collection operators today. The results of the analytical model and the simulation models are coherent, and consistent with experiences of the waste collection operators

  20. A Proposal for IoT Dynamic Routes Selection Based on Contextual Information.

    Science.gov (United States)

    Araújo, Harilton da Silva; Filho, Raimir Holanda; Rodrigues, Joel J P C; Rabelo, Ricardo de A L; Sousa, Natanael de C; Filho, José C C L S; Sobral, José V V

    2018-01-26

    The Internet of Things (IoT) is based on interconnection of intelligent and addressable devices, allowing their autonomy and proactive behavior with Internet connectivity. Data dissemination in IoT usually depends on the application and requires context-aware routing protocols that must include auto-configuration features (which adapt the behavior of the network at runtime, based on context information). This paper proposes an approach for IoT route selection using fuzzy logic in order to attain the requirements of specific applications. In this case, fuzzy logic is used to translate in math terms the imprecise information expressed by a set of linguistic rules. For this purpose, four Objective Functions (OFs) are proposed for the Routing Protocol for Low Power and Loss Networks (RPL); such OFs are dynamically selected based on context information. The aforementioned OFs are generated from the fusion of the following metrics: Expected Transmission Count (ETX), Number of Hops (NH) and Energy Consumed (EC). The experiments performed through simulation, associated with the statistical data analysis, conclude that this proposal provides high reliability by successfully delivering nearly 100% of data packets, low delay for data delivery and increase in QoS. In addition, an 30% improvement is attained in the network life time when using one of proposed objective function, keeping the devices alive for longer duration.

  1. An Evaluation of Controller and Pilot Performance, Workload and Acceptability under a NextGen Concept for Dynamic Weather Adapted Arrival Routing

    Science.gov (United States)

    Johnson, Walter W.; Lachter, Joel; Brandt, Summer; Koteskey, Robert; Dao, Arik-Quang; Kraut, Josh; Ligda, Sarah; Battiste, Vernol

    2012-01-01

    In todays terminal operations, controller workload increases and throughput decreases when fixed standard terminal arrival routes (STARs) are impacted by storms. To circumvent this operational constraint, Prete, Krozel, Mitchell, Kim and Zou (2008) proposed to use automation to dynamically adapt arrival and departure routing based on weather predictions. The present study examined this proposal in the context of a NextGen trajectory-based operation concept, focusing on the acceptability and its effect on the controllers ability to manage traffic flows. Six controllers and twelve transport pilots participated in a human-in-the-loop simulation of arrival operations into Louisville International Airport with interval management requirements. Three types of routing structures were used: Static STARs (similar to current routing, which require the trajectories of individual aircraft to be modified to avoid the weather), Dynamic routing (automated adaptive routing around weather), and Dynamic Adjusted routing (automated adaptive routing around weather with aircraft entry time adjusted to account for differences in route length). Spacing Responsibility, whether responsibility for interval management resided with the controllers (as today), or resided with the pilot (who used a flight deck based automated spacing algorithm), was also manipulated. Dynamic routing as a whole was rated superior to static routing, especially by pilots, both in terms of workload reduction and flight path safety. A downside of using dynamic routing was that the paths flown in the dynamic conditions tended to be somewhat longer than the paths flown in the static condition.

  2. Advanced Multipath Mitigation Techniques for Satellite-Based Positioning Applications

    Directory of Open Access Journals (Sweden)

    Mohammad Zahidul H. Bhuiyan

    2010-01-01

    Full Text Available Multipath remains a dominant source of ranging errors in Global Navigation Satellite Systems (GNSS, such as the Global Positioning System (GPS or the future European satellite navigation system Galileo. Multipath is generally considered undesirable in the context of GNSS, since the reception of multipath can make significant distortion to the shape of the correlation function used for time delay estimation. However, some wireless communications techniques exploit multipath in order to provide signal diversity though in GNSS, the major challenge is to effectively mitigate the multipath, since we are interested only in the satellite-receiver transit time offset of the Line-Of-Sight (LOS signal for the receiver's position estimate. Therefore, the multipath problem has been approached from several directions in order to mitigate the impact of multipath on navigation receivers, including the development of novel signal processing techniques. In this paper, we propose a maximum likelihood-based technique, namely, the Reduced Search Space Maximum Likelihood (RSSML delay estimator, which is capable of mitigating the multipath effects reasonably well at the expense of increased complexity. The proposed RSSML attempts to compensate the multipath error contribution by performing a nonlinear curve fit on the input correlation function, which finds a perfect match from a set of ideal reference correlation functions with certain amplitude(s, phase(s, and delay(s of the multipath signal. It also incorporates a threshold-based peak detection method, which eventually reduces the code-delay search space significantly. However, the downfall of RSSML is the memory requirement which it uses to store the reference correlation functions. The multipath performance of other delay-tracking methods previously studied for Binary Phase Shift Keying-(BPSK- and Sine Binary Offset Carrier- (SinBOC- modulated signals is also analyzed in closed loop model with the new Composite

  3. Airspace Technology Demonstration 3 (ATD-3): Dynamic Weather Routes (DWR) Technology Transfer Document Summary Version 1.0

    Science.gov (United States)

    Sheth, Kapil; Wang, Easter Mayan Chan

    2016-01-01

    Airspace Technology Demonstration #3 (ATD-3) is part of NASA's Airspace Operations and Safety Program (AOSP) - specifically, its Airspace Technology Demonstrations (ATD) Project. ATD-3 is a multiyear research and development effort which proposes to develop and demonstrate automation technologies and operating concepts that enable air navigation service providers and airspace users to continuously assess weather, winds, traffic, and other information to identify, evaluate, and implement workable opportunities for flight plan route corrections that can result in significant flight time and fuel savings in en route airspace. In order to ensure that the products of this tech-transfer are relevant and useful, NASA has created strong partnerships with the FAA and key industry stakeholders. This summary document and accompanying technology artifacts satisfy the first of three Research Transition Products (RTPs) defined in the Applied Traffic Flow Management (ATFM) Research Transition Team (RTT) Plan. This transfer consists of NASA's legacy Dynamic Weather Routes (DWR) work for efficient routing for en-route weather avoidance. DWR is a ground-based trajectory automation system that continuously and automatically analyzes active airborne aircraft in en route airspace to identify opportunities for simple corrections to flight plan routes that can save significant flying time, at least five minutes wind-corrected, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. The key benefit of the DWR concept is to let automation continuously and automatically analyze active flights to find those where simple route corrections can save significant time and fuel. Operators are busy during weather events. It is more effective to let automation find the opportunities for high-value route corrections.

  4. Modeling of Doppler frequency shift in multipath radio channels

    Directory of Open Access Journals (Sweden)

    Penzin M.S.

    2016-06-01

    Full Text Available We discuss the modeling of propagation of a quasi-monochromatic radio signal, represented by a coherent pulse sequence, in a non-stationary multipath radio channel. In such a channel, signal propagation results in the observed frequency shift for each ray (Doppler effect. The modeling is based on the assumption that during propagation of a single pulse a channel can be considered stationary. A phase variation in the channel transfer function is shown to cause the observed frequency shift in the received signal. Thus, instead of measuring the Doppler frequency shift, we can measure the rate of variation in the mean phase of one pulse relative to another. The modeling is carried out within the framework of the method of normal waves. The method enables us to model the dynamics of the electromagnetic field at a given point with the required accuracy. The modeling reveals that a local change in ionospheric conditions more severely affects the rays whose reflection region is in the area where the changes occur.

  5. New route for uranium concentrate production from Caetite ore, Bahia State, Brazil; dynamic leaching - direct precipitation

    Energy Technology Data Exchange (ETDEWEB)

    Morais, Carlos A. [Centro de Desenvolvimento da Tecnologia Nuclear (CDTN/CNEN-MG), Belo Horizonte, MG (Brazil)]. E-mail: cmorais@cdtn.br; Gomiero, Luiz A.; Scassiotti Filho, Walter [Industrias Nucleares do Brasil S.A. (INB), Caetite, BA (Brazil)]. E-mails: gomiero@inb.gov.br; scassiotti@inb.gov.br

    2007-07-01

    The common uranium concentrate production consists of ore leaching, uranium purification/concentration by solvent extraction and uranium precipitation as ammonium diuranate steps. In the present work, a new route of uranium concentrate production from Caetite, BA-Brazil ore was investigated. The following steps were investigated: dynamic leaching of the ground ore with sulfuric acid; sulfuric liquor pre-neutralization until pH 3.7; uranium peroxide precipitation. The study was carried out in bath and continuous circuits. In the dynamic leaching of ground ore in agitated tanks the uranium content in the leached ore may be as low as 100 {mu}g/g U{sub 3}O{sub 8}, depending on grinding size. In the pre-neutralization step, the iron content in the liquor is decreased in 99 wt.%, dropping from 3.62 g/L to 0.030 g/L. The sulfate content in the liquor reduces from 46 g/L to 22 g/L. A calcinated final product assaying 99.7 wt.% U{sub 3}O{sub 8} was obtained. The full process recovery was over 94%. (author)

  6. Dynamic routing control in heterogeneous tactical networks with multiple traffic priorities

    Science.gov (United States)

    Fecko, Mariusz A.; Wong, Larry; Kang, Jaewong; Cichocki, Andrzej; Kaul, Vikram; Samtani, Sunil

    2012-05-01

    To efficiently use alternate paths during periods of congestion, we have devised prioritized Dynamic Routing Control Agent (pDRCA) that (1) selects best links to meet the bandwidth and delay requirements of traffic, (2) provides load-balancing and traffic prioritization when multiple topologies are available, and (3) handles changes in link quality and traffic demand, and link outages. pDRCA provides multiplatform load balancing to maximize SATCOM (both P2P and multi-point) and airborne links utilization. It influences link selection by configuring the cost metrics on a router's interface, which does not require any changes to the routing protocol itself. It supports service differentiation of multiple traffic priorities by providing more network resources to the highest priority flows. pDRCA does so by solving an optimization problem to find optimal links weights that increase throughput and decrease E2E delay; avoid congested, low quality, and long delay links; and exploit path diversity in the network. These optimal link weights are sent to the local agents to be configured on individual routers per traffic priority. The pDRCA optimization algorithm has been proven effective in improving application performance. We created a variety of different test scenarios by varying traffic profile and link behavior (stable links, varying capacity, and link outages). In the scenarios where high priority traffic experienced significant loss without pDRCA, the average loss was reduced from 49.5% to 13% and in some cases dropped to 0%. Currently, pDRCA is integrated with an open-source software router and priority queues on Linux as a component of Open Tactical Router (OTR), which is being developed by ONR DTCN program.

  7. Nonlinear relative-proportion-based route adjustment process for day-to-day traffic dynamics: modeling, equilibrium and stability analysis

    Science.gov (United States)

    Zhu, Wenlong; Ma, Shoufeng; Tian, Junfang; Li, Geng

    2016-11-01

    Travelers' route adjustment behaviors in a congested road traffic network are acknowledged as a dynamic game process between them. Existing Proportional-Switch Adjustment Process (PSAP) models have been extensively investigated to characterize travelers' route choice behaviors; PSAP has concise structure and intuitive behavior rule. Unfortunately most of which have some limitations, i.e., the flow over adjustment problem for the discrete PSAP model, the absolute cost differences route adjustment problem, etc. This paper proposes a relative-Proportion-based Route Adjustment Process (rePRAP) maintains the advantages of PSAP and overcomes these limitations. The rePRAP describes the situation that travelers on higher cost route switch to those with lower cost at the rate that is unilaterally depended on the relative cost differences between higher cost route and its alternatives. It is verified to be consistent with the principle of the rational behavior adjustment process. The equivalence among user equilibrium, stationary path flow pattern and stationary link flow pattern is established, which can be applied to judge whether a given network traffic flow has reached UE or not by detecting the stationary or non-stationary state of link flow pattern. The stability theorem is proved by the Lyapunov function approach. A simple example is tested to demonstrate the effectiveness of the rePRAP model.

  8. Diverse range dynamics and dispersal routes of plants on the Tibetan Plateau during the late Quaternary.

    Directory of Open Access Journals (Sweden)

    Haibin Yu

    Full Text Available Phylogeographical studies have suggested that several plant species on the Tibetan Plateau (TP underwent recolonization during the Quaternary and may have had distinct range dynamics in response to the last glacial. To further test this hypothesis and locate the possible historical dispersal routes, we selected 20 plant species from different parts of the TP and modeled their geographical distributions over four time periods using species distribution models (SDMs. Furthermore, we applied the least-cost path method together with SDMs and shared haplotypes to estimate their historical dispersal corridors. We identified three general scenarios of species distribution change during the late Quaternary: the 'contraction-expansion' scenario for species in the northeastern TP, the 'expansion-contraction' scenario for species in the southeast and the 'stable' scenario for widespread species. During the Quaternary, we identified that these species were likely to recolonize along the low-elevation valleys, huge mountain ranges and flat plateau platform (e.g. the Yarlung Zangbo Valley and the Himalaya. We inferred that Quaternary cyclic glaciations along with the various topographic and climatic conditions of the TP could have resulted in the diverse patterns of range shift and dispersal of Tibetan plant species. Finally, we believe that this study would provide valuable insights for the conservation of alpine species under future climate change.

  9. Dynamic Carpooling in Urban Areas: Design and Experimentation with a Multi-Objective Route Matching Algorith

    Directory of Open Access Journals (Sweden)

    Matteo Mallus

    2017-02-01

    Full Text Available This paper focuses on dynamic carpooling services in urban areas to address the needs of mobility in real-time by proposing a two-fold contribution: a solution with novel features with respect to the current state-of-the-art, which is named CLACSOON and is available on the market; the analysis of the carpooling services performance in the urban area of the city of Cagliari through emulations. Two new features characterize the proposed solution: partial ridesharing, according to which the riders can walk to reach the driver along his/her route when driving to the destination; the possibility to share the ride when the driver has already started the ride by modelling the mobility to reach the driver destination. To analyse which features of the population bring better performance to changing the characteristics of the users, we also conducted emulations. When compared with current solutions, CLACSOON allows for achieving a decrease in the waiting time of around 55% and an increase in the driver and passenger success rates of around 4% and 10%,respectively. Additionally, the proposed features allowed for having an increase in the reduction of the CO2 emission by more than 10% with respect to the traditional carpooling service.

  10. Characterization of Signal Quality Monitoring Techniques for Multipath Detection in GNSS Applications.

    Science.gov (United States)

    Pirsiavash, Ali; Broumandan, Ali; Lachapelle, Gérard

    2017-07-05

    The performance of Signal Quality Monitoring (SQM) techniques under different multipath scenarios is analyzed. First, SQM variation profiles are investigated as critical requirements in evaluating the theoretical performance of SQM metrics. The sensitivity and effectiveness of SQM approaches for multipath detection and mitigation are then defined and analyzed by comparing SQM profiles and multipath error envelopes for different discriminators. Analytical discussions includes two discriminator strategies, namely narrow and high resolution correlator techniques for BPSK(1), and BOC(1,1) signaling schemes. Data analysis is also carried out for static and kinematic scenarios to validate the SQM profiles and examine SQM performance in actual multipath environments. Results show that although SQM is sensitive to medium and long-delay multipath, its effectiveness in mitigating these ranges of multipath errors varies based on tracking strategy and signaling scheme. For short-delay multipath scenarios, the multipath effect on pseudorange measurements remains mostly undetected due to the low sensitivity of SQM metrics.

  11. Target Localization with a Single Antenna via Directional Multipath Exploitation

    Directory of Open Access Journals (Sweden)

    Ali H. Muqaibel

    2015-01-01

    Full Text Available Target localization in urban sensing can benefit from angle dependency of the pulse shape at a radar receiver antenna. We propose a localization approach that utilizes the embedded directivity in ultra-wideband (UWB antennas to estimate target positions. A single radar unit sensing operation of indoor targets surrounded by interior walls is considered, where interior wall multipaths are exploited to provide target cross-range. This exploitation assumes resolvability of the multipath components, which is made possible by the virtue of using UWB radar signals. The proposed approach is most attractive when only few multipaths are detectable due to propagation obstructions or owing to low signal-to-noise ratios. Both simulated and experimental data are used to demonstrate the effectiveness of the proposed approach.

  12. SDN-enabled dynamic WDM networks to address routing information inaccuracy

    CSIR Research Space (South Africa)

    Ravhuanzwo, Lusani

    2016-11-01

    Full Text Available , and topology aggregation contribute to these inaccuracies. The focal point of this paper is on the routing inaccuracy caused by the frequency of link-state advertisements. This paper reviews some of the existing proposed solutions to address the routing...

  13. A Multipath Mitigation Algorithm for vehicle with Smart Antenna

    Science.gov (United States)

    Ji, Jing; Zhang, Jiantong; Chen, Wei; Su, Deliang

    2018-01-01

    In this paper, the antenna array adaptive method is used to eliminate the multipath interference in the environment of GPS L1 frequency. Combined with the power inversion (PI) algorithm and the minimum variance no distortion response (MVDR) algorithm, the anti-Simulation and verification of the antenna array, and the program into the FPGA, the actual test on the CBD road, the theoretical analysis of the LCMV criteria and PI and MVDR algorithm principles and characteristics of MVDR algorithm to verify anti-multipath interference performance is better than PI algorithm, The satellite navigation in the field of vehicle engineering practice has some guidance and reference.

  14. Reduction of CO2 emissions from road transport in cities impact of dynamic route guidance system on greenhouse gas emission

    CERN Document Server

    Markiewicz, Michal

    2017-01-01

    Michal Markiewicz presents the outcomes of his research regarding the influence of dynamic route guidance system on overall emission of carbon dioxide from road transport in rural areas. Sustainable transportation in smart cities is a big challenge of our time, but before electric vehicles replace vehicles that burn fossil fuels we have to think about traffic optimization methods that reduce the amount of greenhouse gas emissions. Contents Comparison of Travel Time Measurements Using Floating Car Data and Intelligent Infrastructure Integration of Cellular Automata Traffic Simulator with CO2 Emission Model Impact of Dynamic Route Guidance System on CO2 Emission Naxos Vehicular Traffic Simulator Target Groups Lecturers and students of computer science, transportation and logistics Traffic engineers The Author Dr. Michal Markiewicz defended his PhD thesis in computer science at the University of Bremen,TZI Technologie-Zentrum Informatik und Informationstechnik, Germany. Currently, he is working on commercializat...

  15. An insight into airline dynamic pricing practices in emerging markets: Effects of low cost carriers' presence on routes from Belgrade 'Nikola Tesla' airport

    Directory of Open Access Journals (Sweden)

    Ivanov Nikola V.

    2016-01-01

    Full Text Available Dynamic pricing and revenue management in airline industry have been the subject of research for more than twenty years now. Building upon that massive body of research, in this paper we investigate actual dynamic pricing patterns in new and emerging markets. We specifically focus on the impact that recent entry of low cost carriers on a number of routes from Belgrade Nikola Tesla Airport might have had on pricing practices of legacy incumbents. Unlike with most of previous contributions in the field, we analyse the market characterised by relatively low frequencies and predominantly short-to-medium haul flights. In this paper, we observe and analyse pricing dynamics on two types of routes: routes where only legacy carriers operate and routes where legacy carriers face competition from low cost carriers. The effects of route competition on offered airline fares are estimated and conclusions derived.

  16. A Polyphase Multipath Technique for Software Defined Radio Transmitters

    NARCIS (Netherlands)

    Shrestha, R.; Klumperink, Eric A.M.; Mensink, E.; Wienk, Gerhardus J.M.; Nauta, Bram

    2006-01-01

    Abstract—Transmitter circuits using large signal swings and hard-switched mixers are power-efficient, but also produce unwante harmonics and sidebands, which are commonly removed using dedicated filters. This paper presents a polyphase multipath technique to relax or eliminate filters by canceling a

  17. EFFECT OF SHADOWING AND MULTIPATH FADING ON THE ...

    African Journals Online (AJOL)

    irrespective of their location. The traditional macro-only network have been proved ineffective when communication signal is required for users located in the cell edge and a certain distance away from the macrocell base station. This is because of excess attenuation of the signal due to fading and shadowing. Multipath ...

  18. Towards suppression of all harmonics in a polyphase multipath transmitter

    NARCIS (Netherlands)

    Subhan, S.; Klumperink, Eric A.M.; Nauta, Bram

    2011-01-01

    This work proposes a direct conversion transmitter architecture intended for cognitive radio applications. The architecture is based on the poly-phase multipath technique, which has been shown to cancel out many of the harmonics, sidebands and nonlinearity contributions of a power up-converter using

  19. The river routing scheme in Organising Carbon and Hydrology in Dynamic Ecosystems (ORCHIDEE) using high resolution data

    Science.gov (United States)

    Nguyen-Quang, Trung; Polcher, Jan; Ducharne, Agnès; Arsouze, Thomas

    2017-04-01

    This study presents an improved version of river routing scheme in the Organising Carbon and Hydrology in Dynamic Ecosystems (ORCHIDEE) land surface model. The routing scheme in ORCHIDEE is designed to be resolution independent. This is achieved by routing water through sub-grid hydrological transfer units. An approach which also allows to use refined residence times in each transfer unit which also depend on the nature of the water to be routed. In the proposed evolution, the Hydrological data and maps based on SHuttle Elevation Derivatives at multiple Scales (HydroSHEDS) is used to enhance both these aspects. As a seamless near-global hydrological data set, HydroSHEDS is a suitable database for improving the water transfer scheme in ORCHIDEE. The approximately 1 km resolution HydroSHEDS data enables the construction of more adequate transfer units in each LSM grid box. In addition, the slope factor of each transfer unit, which is calculated with new averaging algorithm, improves the time constant of the reservoirs. Moreover, the new routing scheme is designed to function on generalized grids to make it applicable in modern regional and global climate models. We will present an analysis of the optimal transfer unit size which ensures that the results of the routing scheme are independent of the grid at which ORCHIDEE operates. It is found that with transfer units of 10km2 the model results are optimal and numerically stable. For the validation of this enhanced version of the routing scheme, 35-year simulations (1979-2013) were carried out forced by three atmospheric datasets on horizontal resolution of 0.5o and 0.25o. These datasets are: the Watch Forcing ERA-Interim dataset with bias-corrected precipitation using the (1) CRU station based product; (2) GPCCv5 satellite based estimates and (3) the higher resolution version E2OFD. Investigating on monthly and daily timescale at 22 stations of 12 rivers which contribute freshwater to Mediterranean sea shows that the

  20. Dynamic Weather Routes: A Weather Avoidance Concept for Trajectory-Based Operations

    Science.gov (United States)

    McNally, B. David; Love, John

    2011-01-01

    The integration of convective weather modeling with trajectory automation for conflict detection, trial planning, direct routing, and auto resolution has uncovered a concept that could help controllers, dispatchers, and pilots identify improved weather routes that result in significant savings in flying time and fuel burn. Trajectory automation continuously and automatically monitors aircraft in flight to find those that could potentially benefit from improved weather reroutes. Controllers, dispatchers, and pilots then evaluate reroute options to assess their suitability given current weather and traffic. In today's operations aircraft fly convective weather avoidance routes that were implemented often hours before aircraft approach the weather and automation does not exist to automatically monitor traffic to find improved weather routes that open up due to changing weather conditions. The automation concept runs in real-time and employs two keysteps. First, a direct routing algorithm automatically identifies flights with large dog legs in their routes and therefore potentially large savings in flying time. These are common - and usually necessary - during convective weather operations and analysis of Fort Worth Center traffic shows many aircraft with short cuts that indicate savings on the order of 10 flying minutes. The second and most critical step is to apply trajectory automation with weather modeling to determine what savings could be achieved by modifying the direct route such that it avoids weather and traffic and is acceptable to controllers and flight crews. Initial analysis of Fort Worth Center traffic suggests a savings of roughly 50% of the direct route savings could be achievable.The core concept is to apply trajectory automation with convective weather modeling in real time to identify a reroute that is free of weather and traffic conflicts and indicates enough time and fuel savings to be considered. The concept is interoperable with today

  1. A Frequency-Domain Multipath Parameter Estimation and Mitigation Method for BOC-Modulated GNSS Signals.

    Science.gov (United States)

    Sun, Chao; Zhao, Hongbo; Feng, Wenquan; Du, Songlin

    2018-02-28

    As multipath is one of the dominating error sources for high accuracy Global Navigation Satellite System (GNSS) applications, multipath mitigation approaches are employed to minimize this hazardous error in receivers. Binary offset carrier modulation (BOC), as a modernized signal structure, is adopted to achieve significant enhancement. However, because of its multi-peak autocorrelation function, conventional multipath mitigation techniques for binary phase shift keying (BPSK) signal would not be optimal. Currently, non-parametric and parametric approaches have been studied specifically aiming at multipath mitigation for BOC signals. Non-parametric techniques, such as Code Correlation Reference Waveforms (CCRW), usually have good feasibility with simple structures, but suffer from low universal applicability for different BOC signals. Parametric approaches can thoroughly eliminate multipath error by estimating multipath parameters. The problems with this category are at the high computation complexity and vulnerability to the noise. To tackle the problem, we present a practical parametric multipath estimation method in the frequency domain for BOC signals. The received signal is transferred to the frequency domain to separate out the multipath channel transfer function for multipath parameter estimation. During this process, we take the operations of segmentation and averaging to reduce both noise effect and computational load. The performance of the proposed method is evaluated and compared with the previous work in three scenarios. Results indicate that the proposed averaging-Fast Fourier Transform (averaging-FFT) method achieves good robustness in severe multipath environments with lower computational load for both low-order and high-order BOC signals.

  2. Multipath TCP for user cooperation in wireless networks

    CERN Document Server

    Zhou, Dizhi

    2014-01-01

    This brief presents several enhancement modules to Multipath Transmission Control Protocol (MPTCP) in order to support stable and efficient multipath transmission with user cooperation in the Long Term Evolution (LTE) network. The text explains how these enhancements provide a stable aggregate throughput to the upper-layer applications; guarantee a steady goodput, which is the real application-layer perceived throughput; and ensure that the local traffic of the relays is not adversely affected when the relays are forwarding data for the destination. The performance of the proposed solutions is extensively evaluated using various scenarios. The simulation results demonstrate that the proposed modules can achieve a stable aggregate throughput and significantly improve the goodput by 1.5 times on average. The brief also shows that these extensions can well respect the local traffic of the relays and motivate the relay users to provide the relaying service.

  3. Two Chaotic Patterns of Dynamic Risk Definition for Solving Hazardous Materials Routing Problem

    Directory of Open Access Journals (Sweden)

    Abbas Mahmoudabadi

    2015-01-01

    Full Text Available In the case of determining routes for hazardous material transportation, risk is considered as a main attribute. Transport risk, which is usually combined with other attributes such as cost or travel time, plays a significant role in determining paths for hazardous materials transportation. Since, risk is chaotically affected by road incidents, decision makers are dealing with selecting a method for defining chaotic risk factors in hazmat transportation. In this paper, transport risk has been defined as a chaotic variable using two different methods of generating chaotic patterns. In an experimental road network, which consists of eighty-nine nodes and one hundred and one two-way links, two different methods of generating chaotic variables have been used for applying the proposed procedure. In addition, results for different amounts of risk and cost have also been analyzed in case study. Results revealed that different cost and risk priorities change the frequencies of selected paths determined for hazmat transportation, but the route convergence of the route to chaos method is better than that of the logistic map equation.

  4. Bioaccumulation dynamics and exposure routes of Cd and Cu among species of aquatic mayflies

    Science.gov (United States)

    Cain, D.; Croteau, M.-N.; Luoma, S.

    2011-01-01

    Consumption of periphyton is a potentially important route of metal exposure to benthic invertebrate grazers. The present study examined the bioaccumulation kinetics of dissolved and dietary Cd and Cu in five species of mayflies (class Insecta). Artificial stream water and benthic diatoms were separately labeled with enriched stable metal isotopes to determine physiological rate constants used by a biokinetic bioaccumulation model. The model was employed to simulate the effects of metal partitioning between water and food, expressed as the bioconcentration factor (BCF), as well as ingestion rate (IR) and metal assimilation efficiency of food (AE), on the relative importance of water and food to metal bioaccumulation. For all test species, the contribution of dietary uptake of Cd and Cu increased with BCF. For a given BCF, the contribution of food to the body burden increased with kuf, the metal uptake rate constant from food that combined variation in IR and AE. To explore the relative importance of water and diet exposure routes under field conditions, we used estimated site-specific aqueous free-ion concentrations to model Cd and Cu accumulation from aqueous exposure, exclusively. The predicted concentrations accounted for less than 5% of the observed concentrations, implying that most bioaccumulated metal was acquired from food. At least for the taxa considered in this study, we conclude that consumption of metal-contaminated periphyton can result in elevated metal body burdens and potentially increase the risk of metal toxicity. ?? 2011 SETAC.

  5. Dynamic Request Routing for Online Video-on-Demand Service: A Markov Decision Process Approach

    Directory of Open Access Journals (Sweden)

    Jianxiong Wan

    2014-01-01

    Full Text Available We investigate the request routing problem in the CDN-based Video-on-Demand system. We model the system as a controlled queueing system including a dispatcher and several edge servers. The system is formulated as a Markov decision process (MDP. Since the MDP formulation suffers from the so-called “the curse of dimensionality” problem, we then develop a greedy heuristic algorithm, which is simple and can be implemented online, to approximately solve the MDP model. However, we do not know how far it deviates from the optimal solution. To address this problem, we further aggregate the state space of the original MDP model and use the bounded-parameter MDP (BMDP to reformulate the system. This allows us to obtain a suboptimal solution with a known performance bound. The effectiveness of two approaches is evaluated in a simulation study.

  6. Dynamic Routing of Aircraft in the Presence of Adverse Weather Using a POMDP Framework

    Science.gov (United States)

    Balaban, Edward; Roychoudhury, Indranil; Spirkovska, Lilly; Sankararaman, Shankar; Kulkarni, Chetan; Arnon, Tomer

    2017-01-01

    Each year weather-related airline delays result in hundreds of millions of dollars in additional fuel burn, maintenance, and lost revenue, not to mention passenger inconvenience. The current approaches for aircraft route planning in the presence of adverse weather still mainly rely on deterministic methods. In contrast, this work aims to deal with the problem using a Partially Observable Markov Decision Processes (POMDPs) framework, which allows for reasoning over uncertainty (including uncertainty in weather evolution over time) and results in solutions that are more robust to disruptions. The POMDP-based decision support system is demonstrated on several scenarios involving convective weather cells and is benchmarked against a deterministic planning system with functionality similar to those currently in use or under development.

  7. Resource selection and allocation in dynamic multi-period formation of virtual cell with consideration of multiple processing routes

    Directory of Open Access Journals (Sweden)

    Wenmin Han

    2017-03-01

    Full Text Available To enhance the production continuity and optimal utilization of the Shipbuilding enterprises during multi-period, a multi-object dynamic mixed integer programming model of virtual cell is proposed to complete the resource selection and batch assignment of routes by minimizing the processing cost, transportation cost, scheduling factors and load balance. The factors including constraints on the processing capacity equipment redundancy and the influences of batch processing and cellular formation on scheduling are considered in the model design. This paper proposed improved multi-object genetic algorithm to obtain optimal pareto solution set and introduced TOPSIS to determine the best resource group. The model and algorithm presented is applied in a job shop of pipe in a shipyard. The robust resource selection strategy during multi-period can greatly balance the working load of all shops, and achieve more superior structure of virtual cell formation.

  8. Multi-path transportation futures study: Results from Phase 1

    Energy Technology Data Exchange (ETDEWEB)

    Patterson, Phil [Department of Energy, Washington, D.C. (United States); Singh, Margaret [Argonne National Lab. (ANL), Argonne, IL (United States); Plotkin, Steve [Argonne National Lab. (ANL), Argonne, IL (United States); Moore, Jim [TAE

    2007-03-09

    This PowerPoint briefing provides documentation and details for Phase 1 of the Multi-Path Transportation Futures Study, which compares alternative ways to make significant reductions in oil use and carbon emissions from U.S. light vehicles to 2050. Phase I, completed in 2006, was a scoping study, aimed at identifying key analytic issues and constructing a study design. The Phase 1 analysis included an evaluation of several pathways and scenarios; however, these analyses were limited in number and scope and were designed to be preliminary.

  9. SAR antenna design for ambiguity and multipath suppression

    DEFF Research Database (Denmark)

    Christensen, Erik Lintz; Dich, Mikael

    1993-01-01

    A high resolution airborne synthetic aperture radar (SAR) has been developed at the Electromagnetics Institute (EMI) for remote sensing applications. The paper considers the radiation of antennas for a SAR system from a systems perspective. The basic specifications of an idealised antenna...... are obtained from the required swath and the azimuth footprint needed for the SAR processing. The radiation from a real antenna causes unwanted signal returns that lead to intensity variations (multipath) and ghost echoes (ambiguity). Additional specifications are deduced by considering these signals...

  10. Intersymbol Decorrelating Detector for Asynchronous CDMA Networks with Multipath

    Directory of Open Access Journals (Sweden)

    Zhang Gaonan

    2005-01-01

    Full Text Available Most reported multiuser detection techniques for CDMA systems need the channel estimation including the delay spread and the parameters of the multipath channel of the desired user. This paper proposes an intersymbol decorrelating detector that makes use of the cross-correlation matrix constructed by the consecutively received symbols. The proposed detector is attractive for its simplicity because no channel estimation is required except for the synchronization of the desired user. Compared with other reported multiuser detectors, simulation results show that the proposed detector provides a good performance when the active users have significant intersymbol interference.

  11. Extraction of multipath parameters from swept measurements on a line-of-sight path

    DEFF Research Database (Denmark)

    Sandberg, Jørgen

    1980-01-01

    A computerized method of obtaining the multipath parameters from swept measurements is described, and some results are discussed. The accuracy of the multipath parameters determined is aboutpm0.3ns in delay andpm0.1in amplitude. The time variation of the propagation medium during the 331-ms sweep...

  12. Mapping GPS Multipath: a Case Study for the Lunar Laser Ranger ...

    African Journals Online (AJOL)

    Cilence Munghemezulu

    Abstract. Accounting for multipath in Global Navigation Satellite Systems (GNSS) is a difficult task and an important one, especially during the pre-investigation phase for the installation of a permanent GNSS station for positioning or timing applications. Sites with a high level of multipath can cause positioning errors or ...

  13. Mapping GPS multipath: a case study for the lunar laser ranger ...

    African Journals Online (AJOL)

    We investigate and attempt to map multipath as part of the site investigation for the installation of the timing antenna for lunar laser ranging applications at the Hartebeesthoek Radio Astronomy Observatory (HartRAO). A high-resolution wavelet power spectrum and a standard deviation parameter are used to map multipath ...

  14. Detection and Identification of Multipath Jamming Method for Polarized Radar Seeker

    Directory of Open Access Journals (Sweden)

    Dai Huanyao

    2016-04-01

    Full Text Available Multipath jamming is an effective self-defense jamming mode used to counter airborne fire-control radar or radar seekers. Multipath jamming has a deceptive jamming effect on the range, velocity, and angle of radar, making it difficult to identify and suppress. In this study, a polarized radar seeker structure is proposed. Based on the mechanism of the multipath jamming effect on radar, orthogonal polarization signal models of jamming and direct arrived signal are established. Next, a method to detect multipath jamming based on statistical property differences of polarization phases is proposed. The physical connotation of this method is clear and easy to realize. This method can be used to determine the presence of a jamming signal and identify the signal pattern and polarization types. The feasibility of this method has been verified via a simulation experiment, thereby demonstrating that the method serves as a useful reference for effectively countering multipath jamming.

  15. Reducing the Amount of Data for Creating Routes in a Dynamic DTN via Wi-Fi on the Basis of Static Data

    Directory of Open Access Journals (Sweden)

    Yulia Shichkina

    2017-01-01

    Full Text Available This article presents the results of research on the acceleration of data processing in the construction routing in dynamic DTN, realized through the devices established in moving objects and connected by means of Wi-Fi. The routes are constructed based on the prehistory of the movement of objects, which is stored in the database in the csv format. This database has a large volume and contains unnecessary and incorrect information. The article shows the possibility of speeding up the process of constructing routes using data precleaning. Reducing data volume is proposed by constructing an enlarged grid on the object movement map. This article also demonstrates the use of fuzzy logic and graph theory for constructing routes.

  16. Performance Evaluation of MBA-OLSR Routing Protocol for MANETs

    Directory of Open Access Journals (Sweden)

    Waheb A. Jabbar

    2014-01-01

    Full Text Available This paper proposes a multipath battery aware routing protocol, namely, MBA-OLSR, based on OLSRv2 and its multipath extension. The proposed approach considers the remaining battery energy of the nodes for calculating the initial cost of the multiple links between source-destination pairs. The MBA-OLSR aims to construct energy efficient routes and extend the network lifetime to avoid network failure due to battery exhaustion. The protocol performance is evaluated in different simulation scenarios of wireless mobile ad hoc networks (MANETs environment. The simulation results demonstrate that our approach can achieve longer network lifetime and lower energy cost per packet. In addition, the results show improvement in terms of packet delivery ratio and end-to-end delay.

  17. Facile Route to Vertically Aligned High-Aspect Ratio Block Copolymer Films via Dynamic Zone Annealing

    Science.gov (United States)

    Singh, Gurpreet; Kulkarni, Manish; Yager, Kevin; Smilgies, Detlef; Bucknall, David; Karim, Alamgir

    2012-02-01

    Directed assembly of block copolymers (BCP) can be used to fabricate a diversity of nanostructures useful for nanotech applications. The ability to vertically orient etchable high aspect ratio (˜30) ordered BCP domains on flexible substrates via continuous processing methods are particularly attractive for nanomanufacturing. We apply sharp dynamic cold zone annealing (CZA-S) to create etchable, and predominantly vertically oriented 30nm cylindrical domains in 1 μm thick poly(styrene-b-methylmethacrylate) films on low thermal conductivity rigid (quartz) and flexible (PDMS & Kapton) substrates. Under similar static conditions, temporally stable vertical cylinders form within a narrow zone above a critical temperature gradient. Primary ordering mechanism of CZA-S involves sweeping this vertically orienting zone created at maximum thermal gradient. An optimal speed is needed since the process competes with preferential surface wetting dynamics that favors parallel orientation. GISAXS of etched BCP films confirms internal morphology.

  18. The excitonic insulator route through a dynamical phase transition induced by an optical pulse

    Energy Technology Data Exchange (ETDEWEB)

    Brazovskii, S., E-mail: brazov@lptms.u-psud.fr [Université Paris-Saclay, LPTMS, CNRS, Univ. Paris-sud (France); Kirova, N. [Université Paris-Saclay, LPS, CNRS, Univ. Paris-sud (France)

    2016-03-15

    We consider a dynamical phase transition induced by a short optical pulse in a system prone to thermodynamical instability. We address the case of pumping to excitons whose density contributes directly to the order parameter. To describe both thermodynamic and dynamic effects on equal footing, we adopt a view of the excitonic insulator for the phase transition and suggest a formation of the Bose condensate for the pumped excitons. The work is motivated by experiments in donor–acceptor organic compounds with a neutral- ionic phase transition coupled to the spontaneous lattice dimerization and to charge transfer excitons. The double nature of the ensemble of excitons leads to an intricate time evolution, in particular, to macroscopic quantum oscillations from the interference between the Bose condensate of excitons and the ground state of the excitonic insulator. The coupling of excitons and the order parameter also leads to self-trapping of their wave function, akin to self-focusing in optics. The locally enhanced density of excitons can surpass a critical value to trigger the phase transformation, even if the mean density is below the required threshold. The system is stratified in domains that evolve through dynamical phase transitions and sequences of merging. The new circumstances in experiments and theory bring to life, once again, some remarkable inventions made by L.V. Keldysh.

  19. The excitonic insulator route through a dynamical phase transition induced by an optical pulse

    Science.gov (United States)

    Brazovskii, S.; Kirova, N.

    2016-03-01

    We consider a dynamical phase transition induced by a short optical pulse in a system prone to thermodynamical instability. We address the case of pumping to excitons whose density contributes directly to the order parameter. To describe both thermodynamic and dynamic effects on equal footing, we adopt a view of the excitonic insulator for the phase transition and suggest a formation of the Bose condensate for the pumped excitons. The work is motivated by experiments in donor-acceptor organic compounds with a neutral- ionic phase transition coupled to the spontaneous lattice dimerization and to charge transfer excitons. The double nature of the ensemble of excitons leads to an intricate time evolution, in particular, to macroscopic quantum oscillations from the interference between the Bose condensate of excitons and the ground state of the excitonic insulator. The coupling of excitons and the order parameter also leads to self-trapping of their wave function, akin to self-focusing in optics. The locally enhanced density of excitons can surpass a critical value to trigger the phase transformation, even if the mean density is below the required threshold. The system is stratified in domains that evolve through dynamical phase transitions and sequences of merging. The new circumstances in experiments and theory bring to life, once again, some remarkable inventions made by L.V. Keldysh.

  20. Surface wave multipath signals in near-field microwave imaging.

    Science.gov (United States)

    Meaney, Paul M; Shubitidze, Fridon; Fanning, Margaret W; Kmiec, Maciej; Epstein, Neil R; Paulsen, Keith D

    2012-01-01

    Microwave imaging techniques are prone to signal corruption from unwanted multipath signals. Near-field systems are especially vulnerable because signals can scatter and reflect from structural objects within or on the boundary of the imaging zone. These issues are further exacerbated when surface waves are generated with the potential of propagating along the transmitting and receiving antenna feed lines and other low-loss paths. In this paper, we analyze the contributions of multi-path signals arising from surface wave effects. Specifically, experiments were conducted with a near-field microwave imaging array positioned at variable heights from the floor of a coupling fluid tank. Antenna arrays with different feed line lengths in the fluid were also evaluated. The results show that surface waves corrupt the received signals over the longest transmission distances across the measurement array. However, the surface wave effects can be eliminated provided the feed line lengths are sufficiently long independently of the distance of the transmitting/receiving antenna tips from the imaging tank floor. Theoretical predictions confirm the experimental observations.

  1. Surface Wave Multipath Signals in Near-Field Microwave Imaging

    Directory of Open Access Journals (Sweden)

    Paul M. Meaney

    2012-01-01

    Full Text Available Microwave imaging techniques are prone to signal corruption from unwanted multipath signals. Near-field systems are especially vulnerable because signals can scatter and reflect from structural objects within or on the boundary of the imaging zone. These issues are further exacerbated when surface waves are generated with the potential of propagating along the transmitting and receiving antenna feed lines and other low-loss paths. In this paper, we analyze the contributions of multi-path signals arising from surface wave effects. Specifically, experiments were conducted with a near-field microwave imaging array positioned at variable heights from the floor of a coupling fluid tank. Antenna arrays with different feed line lengths in the fluid were also evaluated. The results show that surface waves corrupt the received signals over the longest transmission distances across the measurement array. However, the surface wave effects can be eliminated provided the feed line lengths are sufficiently long independently of the distance of the transmitting/receiving antenna tips from the imaging tank floor. Theoretical predictions confirm the experimental observations.

  2. Proposal for automated transformations on single-photon multipath qudits

    Science.gov (United States)

    Baldijão, R. D.; Borges, G. F.; Marques, B.; Solís-Prosser, M. A.; Neves, L.; Pádua, S.

    2017-09-01

    We propose a method for implementing automated state transformations on single-photon multipath qudits encoded in a one-dimensional transverse spatial domain. It relies on transferring the encoding from this domain to the orthogonal one by applying a spatial phase modulation with diffraction gratings, merging all the initial propagation paths by using a stable interferometric network, and filtering out the unwanted diffraction orders. The automation feature is attained by utilizing a programmable phase-only spatial light modulator (SLM) where properly designed diffraction gratings displayed on its screen will implement the desired transformations, including, among others, projections, permutations, and random operations. We discuss the losses in the process which is, in general, inherently nonunitary. Some examples of transformations are presented and, considering a realistic scenario, we analyze how they will be affected by the pixelated structure of the SLM screen. The method proposed here enables one to implement much more general transformations on multipath qudits than is possible with a SLM alone operating in the diagonal basis of which-path states. Therefore, it will extend the range of applicability for this encoding in high-dimensional quantum information and computing protocols as well as fundamental studies in quantum theory.

  3. ITS Multi-path Communications Access Decision Scheme

    Directory of Open Access Journals (Sweden)

    Miroslav Svitek

    2008-02-01

    Full Text Available Intelligent Transport Systems (ITS require widely spread and guarantied quality communications services. Method of ITS decomposition to set of subsystems and quantification of communications subsystems parameters is introduced. Due to typical complexity of the IST solution and mobility as the typical system elements property idea of communications systems with multipath multivendor structures is adopted. Resolution of seamless switching within a set of available wireless access solutions is presented. CALM based system or specifically designed and configured L3/L2 switching can be relevant solution for multi-path access communication system. These systems meet requirements of the seamless secure communications functionality within even extensive cluster of moving objects. Competent decision processes based on precisely quantified system requirements and each performance indicator tolerance range must be implemented to keep service up and running with no influence of continuously changing conditions in time and served space. Method of different paths service quality evaluation and selection of the best possible active communications access path is introduced. Proposed approach is based on Kalman filtering, which separates reasonable part of noise and also allows prediction of the individual parameters near future behavior. Presented classification algorithm applied on filtered measured data combined with deterministic parameters is trained using training data, i.e. combination of parameters vectors line and relevant decisions. Quality of classification is dependent on the size and quality of the training sets. This method is studied within projects e-Ident, DOTEK and SRATVU which are elaborating results of project CAMNA.

  4. The Dynamics of Lateral Gene Transfer in Genus Leishmania - A Route for Adaptation and Species Diversification.

    Science.gov (United States)

    Vikeved, Elisabet; Backlund, Anders; Alsmark, Cecilia

    2016-01-01

    The genome of Leishmania major harbours a comparably high proportion of genes of prokaryote origin, acquired by lateral gene transfer (LGT). Some of these are present in closely related trypanosomatids, while some are detected in Leishmania only. We have evaluated the impact and destiny of LGT in genus Leishmania. To study the dynamics and fate of LGTs we have performed phylogenetic, as well as nucleotide and amino acid composition analyses within orthologous groups of LGTs detected in Leishmania. A set of universal trypanosomatid LGTs was added as a reference group. Both groups of LGTs have, to some extent, ameliorated to resemble the recipient genomes. However, while virtually all of the universal trypanosomatid LGTs are distributed and conserved in the entire genus Leishmania, the LGTs uniquely present in genus Leishmania are more prone to gene loss and display faster rates of evolution. Furthermore, a PCR based approach has been employed to ascertain the presence of a set of twenty LGTs uniquely present in genus Leishmania, and three universal trypanosomatid LGTs, in ten additional strains of Leishmania. Evolutionary rates and predicted expression levels of these LGTs have also been estimated. Ten of the twenty LGTs are distributed and conserved in all species investigated, while the remainder have been subjected to modifications, or undergone pseudogenization, degradation or loss in one or more species. LGTs unique to the genus Leishmania have been acquired after the divergence of Leishmania from the other trypanosomatids, and are evolving faster than their recipient genomes. This implies that LGT in genus Leishmania is a continuous and dynamic process contributing to species differentiation and speciation. This study also highlights the importance of carefully evaluating these dynamic genes, e.g. as LGTs have been suggested as potential drug targets.

  5. Facile route to an all-organic, triply threaded, interlocked structure by templated dynamic clipping.

    Science.gov (United States)

    Pun, Andrew; Hanifi, David A; Kiel, Gavin; O'Brien, Evan; Liu, Yi

    2012-12-21

    Encaged! Three-terminal interlocked molecular species were obtained by dynamic (2+3) assembly of a cagelike macro-bicycle around a trifurcated trispyridinium π guest. The complex is stabilized by π-π interactions and multiple [C-H⋅⋅⋅O] and [C-H⋅⋅⋅N] interactions. Uncomplexed guest molecules cocrystallize alongside the threaded complexes in the solid state, thus giving extended π-stacked columns. Copyright © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  6. Towards transparent all-optical label-swapped networks: 40 Gbit/s ultra-fast dynamic wavelength routing using integrated devices

    DEFF Research Database (Denmark)

    Seoane, Jorge; Holm-Nielsen, Pablo Villanueva; Jeppesen, Palle

    2006-01-01

    All-optical routing of 40 Gbit/s 1.6 ns packets is demonstrated employing integrated devices based on SOA-MZIs. The scheme allows wavelength transparent operation and sub-nanosecond dynamic wavelength selection for future packet/label switched networks....

  7. Contact Graph Routing

    Science.gov (United States)

    Burleigh, Scott C.

    2011-01-01

    Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic

  8. Evolutionary Dynamics of Pandemic Methicillin-Sensitive Staphylococcus aureus ST398 and Its International Spread via Routes of Human Migration.

    Science.gov (United States)

    Uhlemann, Anne-Catrin; McAdam, Paul R; Sullivan, Sean B; Knox, Justin R; Khiabanian, Hossein; Rabadan, Raul; Davies, Peter R; Fitzgerald, J Ross; Lowy, Franklin D

    2017-01-17

    Methicillin-susceptible Staphylococcus aureus (MSSA) accounts for the majority of S. aureus infections globally, and yet surprisingly little is known about its clonal evolution. We applied comparative whole-genome sequencing (WGS) analyses to epidemiologically and geographically diverse ST398-MSSA, a pandemic lineage affecting both humans and livestock. Bayesian phylogenetic analysis predicted divergence of human-associated ST398-MSSA ~40 years ago. Isolates from Midwestern pigs and veterinarians differed substantially from those in New York City (NYC). Pig ST398 strains contained a large region of recombination representing imports from multiple sequence types (STs). Phylogeographic analyses supported the spread of ST398-MSSA along local cultural and migratory links between parts of the Caribbean, North America, and France, respectively. Applying pairwise single-nucleotide polymorphism (SNP) distances as a measure of genetic relatedness between isolates, we observed that ST398 not only clustered in households but also frequently extended across local social networks. Isolates collected from environmental surfaces reflected the full diversity of colonizing individuals, highlighting their potentially critical role as reservoirs for transmission and diversification. Strikingly, we observed high within-host SNP variability compared to our previous studies on the dominant methicillin-resistant Staphylococcus aureus (MRSA) clone USA300. Our data indicate that the dynamics of colonization, persistence, and transmission differ substantially between USA300-MRSA and ST398-MSSA. Taken together, our study reveals local and international routes of transmission for a major MSSA clone, indicating key impacts of recombination and mutation on genetic diversification and highlighting important ecological differences from epidemic USA300. Our study demonstrates extensive local and international routes of transmission for a major MSSA clone despite the lack of substantial

  9. Spatial Dynamics of Indoor Radio Wideband Channels

    Directory of Open Access Journals (Sweden)

    Hayar Aawatif

    2010-01-01

    Full Text Available The multipath components of superwideband (2–17.2 GHz nonline-of-sight channel responses measured inside several buildings are stable along sections that are 27 cm long on average with a standard deviation of 16 cm. The stability regions of multipath components have an approximately log-normal histogram. An analysis of measured channels that explicitly includes finite spatial areas of visibility of the multipath components is superior to the classic analysis that attributes spatial dynamics to interference of the multipath. The spatial stability of measured responses, that is, the size of the typical area of visibility of each multipath component, decreases as the carrier frequency increases but does not depend on bandwidth. The results offer insight into the nature of the diffuse part of the radio channel.

  10. SOLUTION METHOD OF DYNAMIC ROUTING AND WAVE LENGTH ASSIGNMENT PROBLEM FOR WDM NETWORKS WITH TAKING INTO ACCOUNT FOUR-WAVE MIXING EFFECT

    Directory of Open Access Journals (Sweden)

    D. V. Ageyev

    2016-05-01

    Full Text Available The problem of dynamic route selection and wavelengths assignment in WDM networks is solved. This problem is important in WDM network management when requests are serviced for short-term connection installation and excess traffic is transferred. The proposed solution method is heuristic and is an improvement of the previously known method by taking into account the influence of four-wave mixing and using the new metric for finding the routes prospective for application. This makes it possible to reduce the probability of blocking calls during the connections at the average of 13% and the value of Q factor at 0.812.

  11. Multi-Path Transportation Futures Study. Results from Phase 1

    Energy Technology Data Exchange (ETDEWEB)

    Phil Patterson, Phil [U.S. Dept. of Energy, Washington, DC (United States); Singh, Margaret [Argonne National Lab. (ANL), Argonne, IL (United States); Plotkin, Steve [Argonne National Lab. (ANL), Argonne, IL (United States); Moore, Jim [TAE

    2007-03-09

    Presentation reporting Phase 1 results, 3/9/2007. Projecting the future role of advanced drivetrains and fuels in the light vehicle market is inherently difficult, given the uncertainty (and likely volatility) of future oil prices, inadequate understanding of likely consumer response to new technologies, the relative infancy of several important new technologies with inevitable future changes in their performance and costs, and the importance — and uncertainty — of future government marketplace interventions (e.g., new regulatory standards or vehicle purchase incentives). The Multi-Path Transportation Futures (MP) Study has attempted to improve our understanding of this future role by examining several scenarios of vehicle costs, fuel prices, government subsidies, and other key factors. These are projections, not forecasts, in that they try to answer a series of “what if” questions without assigning probabilities to most of the basic assumptions.

  12. BIFOCAL STEREO FOR MULTIPATH PERSON RE-IDENTIFICATION

    Directory of Open Access Journals (Sweden)

    G. Blott

    2017-11-01

    Full Text Available This work presents an approach for the task of person re-identification by exploiting bifocal stereo cameras. Present monocular person re-identification approaches show a decreasing working distance, when increasing the image resolution to obtain a higher reidentification performance. We propose a novel 3D multipath bifocal approach, containing a rectilinear lens with larger focal length for long range distances and a fish eye lens of a smaller focal length for the near range. The person re-identification performance is at least on par with 2D re-identification approaches but the working distance of the approach is increased and on average 10% more re-identification performance can be achieved in the overlapping field of view compared to a single camera. In addition, the 3D information is exploited from the overlapping field of view to solve potential 2D ambiguities.

  13. Electronic route information panels (DRIPs).

    NARCIS (Netherlands)

    2008-01-01

    Also in the Netherlands, the term Dynamic Route Information Panel (DRIP) is used for an electronic route information panel. A DRIP usually indicates whether there are queues on the various routes to a particular destination and how long they are. On certain locations DRIPS also give the estimated

  14. Definition of multipath/RFI experiments for orbital testing with a small applications technology satellite

    Science.gov (United States)

    Birch, J. N.; French, R. H.

    1972-01-01

    An investigation was made to define experiments for collection of RFI and multipath data for application to a synchronous relay satellite/low orbiting satellite configuration. A survey of analytical models of the multipath signal was conducted. Data has been gathered concerning the existing RFI and other noise sources in various bands at VHF and UHF. Additionally, designs are presented for equipment to combat the effects of RFI and multipath: an adaptive delta mod voice system, a forward error control coder/decoder, a PN transmission system, and a wideband FM system. The performance of these systems was then evaluated. Techniques are discussed for measuring multipath and RFI. Finally, recommended data collection experiments are presented. An extensive tabulation is included of theoretical predictions of the amount of signal reflected from a rough, spherical earth.

  15. Analysis of Multipath Mitigation Techniques with Land Mobile Satellite Channel Model

    Directory of Open Access Journals (Sweden)

    M. Z. H. Bhuiyan J. Zhang

    2012-12-01

    Full Text Available Multipath is undesirable for Global Navigation Satellite System (GNSS receivers, since the reception of multipath can create a significant distortion to the shape of the correlation function leading to an error in the receivers’ position estimate. Many multipath mitigation techniques exist in the literature to deal with the multipath propagation problem in the context of GNSS. The multipath studies in the literature are often based on optimistic assumptions, for example, assuming a static two-path channel or a fading channel with a Rayleigh or a Nakagami distribution. But, in reality, there are a lot of channel modeling issues, for example, satellite-to-user geometry, variable number of paths, variable path delays and gains, Non Line-Of-Sight (NLOS path condition, receiver movements, etc. that are kept out of consideration when analyzing the performance of these techniques. Therefore, this is of utmost importance to analyze the performance of different multipath mitigation techniques in some realistic measurement-based channel models, for example, the Land Multipath is undesirable for Global Navigation Satellite System (GNSS receivers, since the reception of multipath can create a significant distortion to the shape of the correlation function leading to an error in the receivers’ position estimate. Many multipath mitigation techniques exist in the literature to deal with the multipath propagation problem in the context of GNSS. The multipath studies in the literature are often based on optimistic assumptions, for example, assuming a static two-path channel or a fading channel with a Rayleigh or a Nakagami distribution. But, in reality, there are a lot of channel modeling issues, for example, satellite-to-user geometry, variable number of paths, variable path delays and gains, Non Line-Of-Sight (NLOS path condition, receiver movements, etc. that are kept out of consideration when analyzing the performance of these techniques. Therefore, this

  16. Validation of GNSS Multipath Model for Space Proximity Operations Using the Hubble Servicing Mission 4 Experiment

    Science.gov (United States)

    Ashman, Ben; Veldman, Jeanette; Axelrad, Penina; Garrison, James; Winternitz, Luke

    2016-01-01

    In the rendezvous and docking of spacecraft, GNSS signals can reflect off the target vehicle and cause prohibitively large errors in the chaser vehicle receiver at ranges below 200 meters. It has been proposed that the additional ray paths, or multipath, be used as a source of information about the state of the target relative to the receiver. With Hubble Servicing Mission 4 as a case study, electromagnetic ray tracing has been used to construct a model of reflected signals from known geometry. Oscillations in the prompt correlator power due to multipath, known as multipath fading, are studied as a means of model validation. Agreement between the measured and simulated multipath fading serves to confirm the presence of signals reflected off the target spacecraft that might be used for relative navigation.

  17. Adaptive Multi-path Telecommunications Solutions for ITS

    Directory of Open Access Journals (Sweden)

    Tomas Zelinka

    2011-02-01

    Full Text Available Intelligent Transport Services (ITS applications require availability of the wireless seamless secure communications solutions with selectable services quality and wide-area coverage. There are available both public as well as private wireless data services, however, dominantly in case of public services no guaranteed data service quality is offered. Principal improvement of the service quality can be reached by dynamical selection of the best possible alternative from the available portfolio of relevant services. Efficient decision processes must be implemented in the appropriate flexible seamless routing/switching structures. Generally recommended solution has been described in series of documents generated by ISO/CEN known as CALM family of standards. In accordance to our understanding CALM architecture represents very complex attitude, however, it is demanding solution for less ambitious implementations. On the other hand CALM decision processes are limited to approach based on the Policy-based Management (PBM principles with limited functionality and adaptability. Authors present L3 alternative solution with adaptive classifications processes applied instead of PBM ones. Such approach can be efficiently implemented specifically if there is available deep understanding of applied technologies. Requirements on the representative system performance indicators and their tolerance range should be so carefully identified. Paper includes results of authors’ laboratory study of three most widely spread data services which can be understood as basis for the “CALM ideas” based system implementations.

  18. High-efficiency dynamic routing architecture for the readout of single photon avalanche diode arrays in time-correlated measurements

    Science.gov (United States)

    Cominelli, A.; Acconcia, G.; Peronio, P.; Rech, I.; Ghioni, M.

    2017-05-01

    transfer rate towards the elaboration unit. We developed a novel readout architecture, starting from a completely different perspective: considering the maximum data rate we can manage with a PC, a limited set of conversion data is selected and transferred to the elaboration unit during each excitation period, in order to take full advantage of the bus bandwidth toward the PC. In particular, we introduce a smart routing logic, able to dynamically connect a large number of SPAD detectors to a limited set of high-performance external acquisition chains, paving the way for a more efficient use of resources and allowing us to effectively break the tradeoff between integration and performance, which affects the solutions proposed so far. The routing electronic features a pixelated architecture, while 3D-stacking techniques are exploited to connect each SPAD to its dedicated electronic, leading to a minimization of the overall number of interconnections crossing the integrated system, which is one of the main issues in high-density arrays.

  19. Multicarrier chaotic communications in multipath fading channels without channel estimation

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Shilian, E-mail: wangsl@nudt.edu.cn; Zhang, Zhili [College of Electrical Science and Engineering, National University of Defense Technology, Changsha, 410073, P R China (China)

    2015-01-15

    A multi-carrier chaotic shift keying(MC-CSK) communication scheme with low probability of interception(LPI) is proposed in this article. We apply chaotic spreading sequences in the frequency domain, mapping a different chip of a chaotic sequence to an individual orthogonal frequency division multiplexing(OFDM) subcarrier. In each block size of $M$ OFDM symbols, we use one pilot OFDM symbol inserted time-spaced in all-frequency to transmit the reference chaotic signal and use the other M-1 OFDM symbols to transmit the information-bearing signals each spreaded by the reference chaotic signal. At the receiver, we construct a differential detector after DFT and recover the information bits from the correlations between the pilot OFDM symbol and the other M-1 OFDM symbols in each block size of M. Performance analysis and computer simulations show that the MC-CSK outperforms differential chaos shift keying(DCSK) in AWGN channels with high bandwidth efficiency for the block size of M=2 and that the MC-CSK exploits effectively the frequent diversity of the multipath channel.

  20. Multicarrier chaotic communications in multipath fading channels without channel estimation

    International Nuclear Information System (INIS)

    Wang, Shilian; Zhang, Zhili

    2015-01-01

    A multi-carrier chaotic shift keying(MC-CSK) communication scheme with low probability of interception(LPI) is proposed in this article. We apply chaotic spreading sequences in the frequency domain, mapping a different chip of a chaotic sequence to an individual orthogonal frequency division multiplexing(OFDM) subcarrier. In each block size of $M$ OFDM symbols, we use one pilot OFDM symbol inserted time-spaced in all-frequency to transmit the reference chaotic signal and use the other M-1 OFDM symbols to transmit the information-bearing signals each spreaded by the reference chaotic signal. At the receiver, we construct a differential detector after DFT and recover the information bits from the correlations between the pilot OFDM symbol and the other M-1 OFDM symbols in each block size of M. Performance analysis and computer simulations show that the MC-CSK outperforms differential chaos shift keying(DCSK) in AWGN channels with high bandwidth efficiency for the block size of M=2 and that the MC-CSK exploits effectively the frequent diversity of the multipath channel

  1. Investigating the Performance of the MPT Multipath Communication Library in IPv4 and IPv6

    Directory of Open Access Journals (Sweden)

    Béla Almási

    2016-01-01

    Full Text Available The currently used mobile devices (laptops, tablets, mobile phones contain many built-in network cards for communication (e.g. Wi-Fi, 3G, Bluetooth, etc.. A natural request could be combining the resources of the different network connection possibilities in order to increase the throughput of the communication. Unfortunately the standard IP communication technology does not support it: the communication is restricted to one IP address (i.e. to one interface. The Multipath TCP (MPTCP specification (appeared in January 2013 offers a Transport layer solution of using more than one interface in a TCP communication session. In this paper we investigate a Network layer solution. The MPT multipath communication library opens the multipath communication possibility in the Network layer. Using the MPT library, applications built on the UDP protocol are also able to perform multipath communication. The MPT library was developed by using a full dual-stack technology, which means the MPT based multipath environment can be used both in IPv4 and IPv6. Protocol version change is also possible: an IPv6 based application is able to run in an IPv4 multipath environment, and an IPv4 application can be used in an IPv6 multipath environment. In this paper we give a short overview on the MPT communication library’s working mechanism and detailed numerical examples will be shown to present how the MPT library aggregates the paths’ throughput in IPv4 and IPv6 environments. The main contribution of the paper is to demonstrate the effective throughput aggregation property of the MPT library in IPv6 and in mixed (i.e. protocol version change environments.

  2. Multipath detection with the combination of SNR measurements - Example from urban environment

    Science.gov (United States)

    Špánik, Peter; Hefty, Ján

    2017-12-01

    Multipath is one of the most severe station-dependent error sources in both static and kinematic positioning. Relatively new and simple detection technique using the Signal-to-Noise (SNR) measurements on three frequencies will be presented based on idea of Strode and Groves. Exploitation of SNR measurements is benefi cial especially for their unambiguous character. Method is based on the fact that SNR values are closely linked with estimation of pseudo-ranges and phase measurements during signal correlation processing. Due to this connection, combination of SNR values can be used to detect anomalous behavior in received signal, however some kind of calibration in low multipath environment has to be done previously. In case of multipath, phase measurements on different frequencies will not be affected in the same manner. Specular multipath, e.g. from building wall introduces additional path delay which is interpreted differently on each of the used carrier, due to different wavelengths. Experimental results of multipath detection in urban environment will be presented. Originally proposed method is designed to work with three different frequencies in each epoch, thus only utilization of GPS Block II-F and Galileo satellites is possible. Simplification of detection statistics to use only two frequencies is made and results using GPS and GLONASS systems are presented along with results obtained using original formula.

  3. Multipath detection with the combination of SNR measurements – Example from urban environment

    Directory of Open Access Journals (Sweden)

    Špánik Peter

    2017-12-01

    Full Text Available Multipath is one of the most severe station-dependent error sources in both static and kinematic positioning. Relatively new and simple detection technique using the Signal-to-Noise (SNR measurements on three frequencies will be presented based on idea of Strode and Groves. Exploitation of SNR measurements is benefi cial especially for their unambiguous character. Method is based on the fact that SNR values are closely linked with estimation of pseudo-ranges and phase measurements during signal correlation processing. Due to this connection, combination of SNR values can be used to detect anomalous behavior in received signal, however some kind of calibration in low multipath environment has to be done previously. In case of multipath, phase measurements on different frequencies will not be affected in the same manner. Specular multipath, e.g. from building wall introduces additional path delay which is interpreted differently on each of the used carrier, due to different wavelengths. Experimental results of multipath detection in urban environment will be presented. Originally proposed method is designed to work with three different frequencies in each epoch, thus only utilization of GPS Block II-F and Galileo satellites is possible. Simplification of detection statistics to use only two frequencies is made and results using GPS and GLONASS systems are presented along with results obtained using original formula.

  4. A Novel Probability Model for Suppressing Multipath Ghosts in GPR and TWI Imaging: A Numerical Study

    Directory of Open Access Journals (Sweden)

    Tan Yun-hua

    2015-10-01

    Full Text Available A novel concept for suppressing the problem of multipath ghosts in Ground Penetrating Radar (GPR and Through-Wall Imaging (TWI is presented. Ghosts (i.e., false targets mainly arise from the use of the Born or single-scattering approximations that lead to linearized imaging algorithms; however, these approximations neglect the effect of multiple scattering (or multipath between the electromagnetic wavefield and the object under investigation. In contrast to existing methods of suppressing multipath ghosts, the proposed method models for the first time the reflectivity of the probed objects as a probability function up to a normalized factor and introduces the concept of random subaperture by randomly picking up measurement locations from the entire aperture. Thus, the final radar image is a joint probability distribution that corresponds to radar images derived from multiple random subapertures. Finally, numerical experiments are used to demonstrate the performance of the proposed methodology in GPR and TWI imaging.

  5. Heterogeneous all-solid multicore fiber based multipath Michelson interferometer for high temperature sensing.

    Science.gov (United States)

    Duan, Li; Zhang, Peng; Tang, Ming; Wang, Ruoxu; Zhao, Zhiyong; Fu, Songnian; Gan, Lin; Zhu, Benpeng; Tong, Weijun; Liu, Deming; Shum, Perry Ping

    2016-09-05

    A compact high temperature sensor utilizing a multipath Michelson interferometer (MI) structure based on weak coupling multicore fiber (MCF) is proposed and experimentally demonstrated. The device is fabricated by program-controlled tapering the spliced region between single mode fiber (SMF) and a segment of MCF. After that, a spherical reflective structure is formed by arc-fusion splicing the end face of MCF. Theoretical analysis has been implemented for this specific multipath MI structure; beam propagation method based simulation and corresponding experiments were performed to investigate the effect of taper and spherical end face on system's performance. Benefiting from the multipath interferences and heterogeneous structure between the center core and surrounding cores of the all-solid MCF, an enhanced temperature sensitivity of 165 pm/°C up to 900°C and a high-quality interference spectrum with 25 dB fringe visibility were achieved.

  6. Experimental Investigation of Some Effects of Multipath Propagation on a Line-of-Sight Path at 14 GHz

    DEFF Research Database (Denmark)

    Stephansen, E.; Mogensen, G.

    1979-01-01

    A microwave line-of-sight propagation experiment is carried out in Denmark at frequencies around 14 GHz. Results from long term measurements of multipath propagation are presented. The multipath fade durations are shown to be log-normally distributed. The level dependence of the probability...

  7. A Forward GPS Multipath Simulator Based on the Vegetation Radiative Transfer Equation Model.

    Science.gov (United States)

    Wu, Xuerui; Jin, Shuanggen; Xia, Junming

    2017-06-05

    Global Navigation Satellite Systems (GNSS) have been widely used in navigation, positioning and timing. Nowadays, the multipath errors may be re-utilized for the remote sensing of geophysical parameters (soil moisture, vegetation and snow depth), i.e., GPS-Multipath Reflectometry (GPS-MR). However, bistatic scattering properties and the relation between GPS observables and geophysical parameters are not clear, e.g., vegetation. In this paper, a new element on bistatic scattering properties of vegetation is incorporated into the traditional GPS-MR model. This new element is the first-order radiative transfer equation model. The new forward GPS multipath simulator is able to explicitly link the vegetation parameters with GPS multipath observables (signal-to-noise-ratio (SNR), code pseudorange and carrier phase observables). The trunk layer and its corresponding scattering mechanisms are ignored since GPS-MR is not suitable for high forest monitoring due to the coherence of direct and reflected signals. Based on this new model, the developed simulator can present how the GPS signals (L1 and L2 carrier frequencies, C/A, P(Y) and L2C modulations) are transmitted (scattered and absorbed) through vegetation medium and received by GPS receivers. Simulation results show that the wheat will decrease the amplitudes of GPS multipath observables (SNR, phase and code), if we increase the vegetation moisture contents or the scatters sizes (stem or leaf). Although the Specular-Ground component dominates the total specular scattering, vegetation covered ground soil moisture has almost no effects on the final multipath signatures. Our simulated results are consistent with previous results for environmental parameter detections by GPS-MR.

  8. Multipath Propagation of UWB Through-Wall Radar and EMC Phenomena

    Directory of Open Access Journals (Sweden)

    O. Fiser

    2006-12-01

    Full Text Available The UWB (ultra wide band radar output signals can be substantially affected due to electromagnetic wave propagation through obstacles (such as walls and multipath effects, too. Multipath effects are analyzed and simulated numerically for various cases with several antenna heights and distances. Delays (due to propagation through walls and various paths of direct and reflected rays and the ringing (similar to UWB propagation through wall can be clearly observed and analyzed. Moreover, frequency spectra analyses can demonstrate both UWB interferences and susceptibility from electromagnetic compatibility (EMC viewpoint.

  9. Multipath Propagation of UWB Through-Wall Radar and EMC Phenomena

    Czech Academy of Sciences Publication Activity Database

    Schejbal, V.; Čermák, D.; NĚMEC, Z.; Pidanič, J.; Konečný, J.; Bezoušek, P.; Fišer, Ondřej

    2006-01-01

    Roč. 15, č. 4 (2006), s. 52-57 ISSN 1210-2512 R&D Projects: GA MPO(CZ) FT-TA2/030 Institutional research plan: CEZ:AV0Z30420517 Keywords : UWB propagation * multipath effects * UWB radars * electromagnetic compatibility (EMC). Subject RIV: JA - Electronics ; Optoelectronics, Electrical Engineering

  10. Field Test of a Remote Multi-Path CLaDS Methane Sensor

    Directory of Open Access Journals (Sweden)

    Genevieve Plant

    2015-08-01

    Full Text Available Existing technologies for quantifying methane emissions are often limited to single point sensors, making large area environmental observations challenging. We demonstrate the operation of a remote, multi-path system using Chirped Laser Dispersion Spectroscopy (CLaDS for quantification of atmospheric methane concentrations over extended areas, a technology that shows potential for monitoring emissions from wetlands.

  11. Throughput Modeling and Validations for MIMO-OTA Testing with Arbitrary Multipath

    DEFF Research Database (Denmark)

    Chen, Xiaoming; Fan, Wei; Hentilä, Lassi

    2018-01-01

    A simple throughput model for multiple-input multiple-output (MIMO) systems has been proposed in the literature. The model takes the MIMO antenna effects into account and shows good agreement with measured throughputs in a reverberation chamber (RC). The RC emulates a multipath environment with i...

  12. D/A Resolution Impact on a Poly-phase Multipath Transmitter

    NARCIS (Netherlands)

    Subhan, S.; Klumperink, Eric A.M.; Nauta, Bram

    2008-01-01

    In recent publications the Poly-phase multipath technique has been shown to produce a clean output spectrum for a power upconverter (PU) architecture. The technique utilizes frequency independent phase shifts before and after a nonlinear element to cancel out the harmonics and sidebands due to the

  13. Broadband Microwave Wireless Power Transfer for Weak-Signal and Multipath Environments

    Science.gov (United States)

    Barton, Richard J.

    2014-01-01

    In this paper, we study the potential benefits of using relatively broadband wireless power transmission WPT strategies in both weak-signal and multipath environments where traditional narrowband strategies can be very inefficient. The paper is primarily a theoretical and analytical treatment of the problem that attempts to derive results that are widely applicable to many different WPT applications, including space solar power SSP.

  14. Direct Position Determination of Unknown Signals in the Presence of Multipath Propagation.

    Science.gov (United States)

    Du, Jianping; Wang, Ding; Yu, Wanting; Yu, Hongyi

    2018-03-17

    A novel geolocation architecture, termed "Multiple Transponders and Multiple Receivers for Multiple Emitters Positioning System (MTRE)" is proposed in this paper. Existing Direct Position Determination (DPD) methods take advantage of a rather simple channel assumption (line of sight channels with complex path attenuations) and a simplified MUltiple SIgnal Classification (MUSIC) algorithm cost function to avoid the high dimension searching. We point out that the simplified assumption and cost function reduce the positioning accuracy because of the singularity of the array manifold in a multi-path environment. We present a DPD model for unknown signals in the presence of Multi-path Propagation (MP-DPD) in this paper. MP-DPD adds non-negative real path attenuation constraints to avoid the mistake caused by the singularity of the array manifold. The Multi-path Propagation MUSIC (MP-MUSIC) method and the Active Set Algorithm (ASA) are designed to reduce the dimension of searching. A Multi-path Propagation Maximum Likelihood (MP-ML) method is proposed in addition to overcome the limitation of MP-MUSIC in the sense of a time-sensitive application. An iterative algorithm and an approach of initial value setting are given to make the MP-ML time consumption acceptable. Numerical results validate the performances improvement of MP-MUSIC and MP-ML. A closed form of the Cramér-Rao Lower Bound (CRLB) is derived as a benchmark to evaluate the performances of MP-MUSIC and MP-ML.

  15. A Multipath Technique for Cancelling Harmonics and Sidebands in a Wideband Power Upconverter

    NARCIS (Netherlands)

    Shrestha, R.; Mensink, E.; Klumperink, Eric A.M.; Wienk, Gerhardus J.M.; Nauta, Bram

    2006-01-01

    Switching mixers are power-efficient but produce unwanted harmonics and sidebands. A multipath technique to clean up the spectrum using digital circuits and mixers, but no filters, is applied to a 0.13µm CMOS power upconverter. The circuit delivers 8mW from dc to 2.4GHz with 11% drain efficiency,

  16. effect of shadowing and multipath fading on the area spectral for cell

    African Journals Online (AJOL)

    user

    base station. This is because of excess attenuation of the signal due to fading and shadowing. Multipath fading and shadowing are major causes of performance degradation in mobile communication systems. This phenomenon which arises as a result of propagation effects (like scattering, diffraction and reflection), renders ...

  17. Multiuser receiver for DS-CDMA signals in multipath channels: an enhanced multisurface method.

    Science.gov (United States)

    Mahendra, Chetan; Puthusserypady, Sadasivan

    2006-11-01

    This paper deals with the problem of multiuser detection in direct-sequence code-division multiple-access (DS-CDMA) systems in multipath environments. The existing multiuser detectors can be divided into two categories: (1) low-complexity poor-performance linear detectors and (2) high-complexity good-performance nonlinear detectors. In particular, in channels where the orthogonality of the code sequences is destroyed by multipath, detectors with linear complexity perform much worse than the nonlinear detectors. In this paper, we propose an enhanced multisurface method (EMSM) for multiuser detection in multipath channels. EMSM is an intermediate piecewise linear detection scheme with a run-time complexity linear in the number of users. Its bit error rate performance is compared with existing linear detectors, a nonlinear radial basis function detector trained by the new support vector learning algorithm, and Verdu's optimal detector. Simulations in multipath channels, for both synchronous and asynchronous cases, indicate that it always outperforms all other linear detectors, performing nearly as well as nonlinear detectors.

  18. A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications

    Directory of Open Access Journals (Sweden)

    Jisheng Zhang

    2015-06-01

    Full Text Available It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs’ route planning for small and medium-scale networks.

  19. A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications.

    Science.gov (United States)

    Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

    2015-06-12

    It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs) start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs' route planning for small and medium-scale networks.

  20. Correction Model of BeiDou Code Systematic Multipath Errors and Its Impacts on Single-frequency PPP

    Directory of Open Access Journals (Sweden)

    WANG Jie

    2017-07-01

    Full Text Available There are systematic multipath errors on BeiDou code measurements, which are range from several decimeters to larger than 1 meter. They can be divided into two categories, which are systematic variances in IGSO/MEO code measurement and in GEO code measurement. In this contribution, a methodology of correcting BeiDou GEO code multipath is proposed base on Kalman filter algorithm. The standard deviation of GEO MP Series decreases about 10%~16% after correction. The weight of code in single-frequency PPP is great, therefore, code systematic multipath errors have impact on single-frequency PPP. Our analysis indicate that about 1 m bias will be caused by these systematic errors. Then, we evaluated the improvement of single-frequency PPP accuracy after code multipath correction. The systematic errors of GEO code measurements are corrected by applying our proposed Kalman filter method. The systematic errors of IGSO and MEO code measurements are corrected by applying elevation-dependent model proposed by Wanninger and Beer. Ten days observations of four MGEX (Multi-GNSS Experiment stations are processed. The results indicate that the single-frequency PPP accuracy can be improved remarkably by applying code multipath correction. The accuracy in up direction can be improved by 65% after IGSO and MEO code multipath correction. By applying GEO code multipath correction, the accuracy in up direction can be further improved by 15%.

  1. Optimizing well intervention routes

    Energy Technology Data Exchange (ETDEWEB)

    Paiva, Ronaldo O. [PETROBRAS S.A., Vitoria, ES (Brazil); Schiozer, Denis J.; Bordalo, Sergio N. [Universidade Estadual de Campinas, SP (Brazil). Faculdade de Engenharia Mecanica. Centro de Estudo do Petroleo (CEPETRO)]. E-mail: denis@dep.fem.unicamp.br; bordalo@dep.fem.unicamp.br

    2000-07-01

    This work presents a method for optimizing the itinerary of work over rigs, i.e., the search for the route of minimum total cost, and demonstrates the importance of the dynamics of reservoir behaviour. The total cost of a route includes the rig expenses (transport, assembly and operation), which are functions of time and distances, plus the losses of revenue in wells waiting for the rig, which are also dependent of time. A reservoir simulator is used to evaluate the monetary influence of the well shutdown on the present value of the production curve. Finally, search algorithms are employed to determine the route of minimal cost. The Simulated Annealing algorithm was also successful in optimizing the distribution of a list of wells among different work over rigs. The rational approach presented here is recommended for management teams as a standard procedure to define the priority of wells scheduled for work over. (author)

  2. Routing strategies in traffic network and phase transition in network ...

    Indian Academy of Sciences (India)

    The dynamics of information traffic over scale-free networks has been investigated systematically. A series of routing strategies of data packets have been proposed, including the local routing strategy, the next-nearest-neighbour routing strategy, and the mixed routing strategy based on local static and dynamic information.

  3. A Novel Dynamic Physical Layer Impairment-Aware Routing and Wavelength Assignment (PLI-RWA) Algorithm for Mixed Line Rate (MLR) Wavelength Division Multiplexed (WDM) Optical Networks

    Science.gov (United States)

    Iyer, Sridhar

    2016-12-01

    The ever-increasing global Internet traffic will inevitably lead to a serious upgrade of the current optical networks' capacity. The legacy infrastructure can be enhanced not only by increasing the capacity but also by adopting advance modulation formats, having increased spectral efficiency at higher data rate. In a transparent mixed-line-rate (MLR) optical network, different line rates, on different wavelengths, can coexist on the same fiber. Migration to data rates higher than 10 Gbps requires the implementation of phase modulation schemes. However, the co-existing on-off keying (OOK) channels cause critical physical layer impairments (PLIs) to the phase modulated channels, mainly due to cross-phase modulation (XPM), which in turn limits the network's performance. In order to mitigate this effect, a more sophisticated PLI-Routing and Wavelength Assignment (PLI-RWA) scheme needs to be adopted. In this paper, we investigate the critical impairment for each data rate and the way it affects the quality of transmission (QoT). In view of the aforementioned, we present a novel dynamic PLI-RWA algorithm for MLR optical networks. The proposed algorithm is compared through simulations with the shortest path and minimum hop routing schemes. The simulation results show that performance of the proposed algorithm is better than the existing schemes.

  4. Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Roy Sohini

    2015-09-01

    Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

  5. Propagation measurements and multipath channel modelling for line-of-sight links at 19.5 GHz

    CSIR Research Space (South Africa)

    Naicker, K

    2006-06-01

    Full Text Available The research aims to characterise the performance of the link by evaluating the effects of multipath propagation under various meteorological conditions. A LOS link was established between the Howard College and Westville campuses of UKZN and passes...

  6. A hybrid particle–field molecular dynamics approach: a route toward efficient coarse-grained models for biomembranes

    International Nuclear Information System (INIS)

    Milano, Giuseppe; De Nicola, Antonio; Kawakatsu, Toshihiro

    2013-01-01

    This paper gives an overview of the coarse-grained models of phospholipids recently developed by the authors in the frame of a hybrid particle–field molecular dynamics technique. This technique employs a special class of coarse-grained models that are gaining popularity because they allow simulations of large scale systems and, at the same time, they provide sufficiently detailed chemistry for the mapping scheme adopted. The comparison of the computational costs of our approach with standard molecular dynamics simulations is a function of the system size and the number of processors employed in the parallel calculations. Due to the low amount of data exchange, the larger the number of processors, the better are the performances of the hybrid particle–field models. This feature makes these models very promising ones in the exploration of several problems in biophysics. (paper)

  7. Seismic constraints on dynamic links between geomorphic processes and routing of sediment in a steep mountain catchment

    Science.gov (United States)

    Burtin, A.; Hovius, N.; McArdell, B. W.; Turowski, J. M.; Vergne, J.

    2014-01-01

    Landscape dynamics are determined by interactions amongst geomorphic processes. These interactions allow the effects of tectonic, climatic and seismic perturbations to propagate across topographic domains, and permit the impacts of geomorphic process events to radiate from their point of origin. Visual remote sensing and in situ observations do not fully resolve the spatiotemporal patterns of surface processes in a landscape. As a result, the mechanisms and scales of geomorphic connectivity are poorly understood. Because many surface processes emit seismic signals, seismology can determine their type, location and timing with a resolution that reveals the operation of integral landscapes. Using seismic records, we show how hillslopes and channels in an Alpine catchment are interconnected to produce evolving, sediment-laden flows. This is done for a convective storm, which triggered a sequence of hillslope processes and debris flows. We observe the evolution of these process events and explore the operation of two-way links between mass wasting and channel processes, which are fundamental to the dynamics of most erosional landscapes. We also track the characteristics and propagation of flows along the debris flow channel, relating changes of observed energy to the deposition/mobilization of sediments, and using the spectral content of debris flow seismic signals to qualitatively infer sediment characteristics and channel abrasion potential. This seismological approach can help to test theoretical concepts of landscape dynamics and yield understanding of the nature and efficiency of links between individual geomorphic processes, which is required to accurately model landscape dynamics under changing tectonic or climatic conditions and to anticipate the natural hazard risk associated with specific meteorological events.

  8. Sparse Variational Bayesian SAGE Algorithm With Application to the Estimation of Multipath Wireless Channels

    DEFF Research Database (Denmark)

    Shutin, Dmitriy; Fleury, Bernard Henri

    2011-01-01

    parametric sparsity priors for the weights of the multipath components. We revisit the Gaussian sparsity priors within the sparse VB-SAGE framework and extend the results by considering Laplace priors. The structure of the VB-SAGE algorithm allows for an analytical stability analysis of the update expression......-invariant channels. The algorithm is also applied to real measurement data in a multiple-input-multiple-output (MIMO) time-invariant context.......In this paper, we develop a sparse variational Bayesian (VB) extension of the space-alternating generalized expectation-maximization (SAGE) algorithm for the high resolution estimation of the parameters of relevant multipath components in the response of frequency and spatially selective wireless...

  9. Quantified, Interactive Simulation of AMCW ToF Camera Including Multipath Effects.

    Science.gov (United States)

    Bulczak, David; Lambers, Martin; Kolb, Andreas

    2017-12-22

    In the last decade, Time-of-Flight (ToF) range cameras have gained increasing popularity in robotics, automotive industry, and home entertainment. Despite technological developments, ToF cameras still suffer from error sources such as multipath interference or motion artifacts. Thus, simulation of ToF cameras, including these artifacts, is important to improve camera and algorithm development. This paper presents a physically-based, interactive simulation technique for amplitude modulated continuous wave (AMCW) ToF cameras, which, among other error sources, includes single bounce indirect multipath interference based on an enhanced image-space approach. The simulation accounts for physical units down to the charge level accumulated in sensor pixels. Furthermore, we present the first quantified comparison for ToF camera simulators. We present bidirectional reference distribution function (BRDF) measurements for selected, purchasable materials in the near-infrared (NIR) range, craft real and synthetic scenes out of these materials and quantitatively compare the range sensor data.

  10. Empirical Analysis and Characterization of Indoor GPS Signal Fading and Multipath Conditions

    DEFF Research Database (Denmark)

    Blunck, Henrik; Kjærgaard, Mikkel Baun; Godsk, Torben

    2009-01-01

    Moving GNSS towards indoor positioning is an important challenge. Increases in receiver sensitivity, the forthcoming increase in number of GNSS satellites and signal design improvements all contribute to addressing this challenge. Another remaining issue for GNSS-based indoor positioning...... is the impact of signal multipath phenomena in indoor environments. The main objective of our paper is to assess the current state of GNSS as a positioning technology for indoor environments. On the basis of an extensive empirical measurement campaign, we furthermore analyze the factors limiting indoor GNSS...... availability and accuracy in dependence of the environment and in-building location of the GNSS receiver. In particular, we evaluate the impact of multipath phenomena on GPS accuracy, as observed in a broad variety of indoor environments using state-of-the-art commercial receiver technology.   Results...

  11. Analytical Approach to Target Detection and Localization at High-Frequency Bands Using Multipath Propagation

    Science.gov (United States)

    2016-04-25

    ElectroMagnetic, Multipath propagation, Reflection -diffraction, SAR signal processing 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT SAR 18... reflections and diffractions. However, this model still validates for indoor propagation. From this field, we can then detect and predict precisely the...sensing through obstacles, i.e. walls and doors, using microwaves is becoming an effective means supporting a wide range of civilian and military

  12. Direct Position Determination of Unknown Signals in the Presence of Multipath Propagation

    Directory of Open Access Journals (Sweden)

    Jianping Du

    2018-03-01

    Full Text Available A novel geolocation architecture, termed “Multiple Transponders and Multiple Receivers for Multiple Emitters Positioning System (MTRE” is proposed in this paper. Existing Direct Position Determination (DPD methods take advantage of a rather simple channel assumption (line of sight channels with complex path attenuations and a simplified MUltiple SIgnal Classification (MUSIC algorithm cost function to avoid the high dimension searching. We point out that the simplified assumption and cost function reduce the positioning accuracy because of the singularity of the array manifold in a multi-path environment. We present a DPD model for unknown signals in the presence of Multi-path Propagation (MP-DPD in this paper. MP-DPD adds non-negative real path attenuation constraints to avoid the mistake caused by the singularity of the array manifold. The Multi-path Propagation MUSIC (MP-MUSIC method and the Active Set Algorithm (ASA are designed to reduce the dimension of searching. A Multi-path Propagation Maximum Likelihood (MP-ML method is proposed in addition to overcome the limitation of MP-MUSIC in the sense of a time-sensitive application. An iterative algorithm and an approach of initial value setting are given to make the MP-ML time consumption acceptable. Numerical results validate the performances improvement of MP-MUSIC and MP-ML. A closed form of the Cramér–Rao Lower Bound (CRLB is derived as a benchmark to evaluate the performances of MP-MUSIC and MP-ML.

  13. Performance Analysis of Iterative Channel Estimation and Multiuser Detection in Multipath DS-CDMA Channels

    OpenAIRE

    Li, Husheng; Betz, Sharon M.; Poor, H. Vincent

    2006-01-01

    This paper examines the performance of decision feedback based iterative channel estimation and multiuser detection in channel coded aperiodic DS-CDMA systems operating over multipath fading channels. First, explicit expressions describing the performance of channel estimation and parallel interference cancellation based multiuser detection are developed. These results are then combined to characterize the evolution of the performance of a system that iterates among channel estimation, multiu...

  14. Period-three route to chaos induced by a cyclic-fold bifurcation in passive dynamic walking of a compass-gait biped robot

    Science.gov (United States)

    Gritli, Hassène; Khraief, Nahla; Belghith, Safya

    2012-11-01

    This paper presents a study of the passive dynamic walking of a compass-gait biped robot as it goes down an inclined plane. This biped robot is a two-degrees-of-freedom mechanical system modeled by an impulsive hybrid nonlinear dynamics with unilateral constraints. It is well-known to possess periodic as well as chaotic gaits and to possess only one stable gait for a given set of parameters. The main contribution of this paper is the finding of a window in the parameters space of the compass-gait model where there is multistability. Using constraints of a grazing bifurcation on the basis of a shooting method and the Davidchack-Lai scheme, we show that, depending on initial conditions, new passive walking patterns can be observed besides those already known. Through bifurcation diagrams and Floquet multipliers, we show that a pair of stable and unstable period-three gait patterns is generated through a cyclic-fold bifurcation. We show also that the stable period-three orbit generates a route to chaos.

  15. Extraction of Weak Scatterer Features Based on Multipath Exploitation in Radar Imagery

    Directory of Open Access Journals (Sweden)

    Muhannad Almutiry

    2017-01-01

    Full Text Available We proposed an improved solution to two problems. The first problem is caused by the sidelobe of the dominant scatterer masking a weak scatterer. The proposed solution is to suppress the dominant scatterer by modeling its electromagnetic effects as a secondary source or “extra dependent transmitter” in the measurement domain. The suppression of the domain scatterer reveals the presence of the weak scatterer based on exploitation of multipath effects. The second problem is linearizing the mathematical forward model in the measurement domain. Improving the quantity of the prediction, including multipath scattering effects (neglected under the Born approximation, allows us to solve the inverse problem. The multiple bounce (multipath scattering effect is the interaction of more than one target in the scene. Modeling reflections from one target towards another as a transmitting dipole will add the multiple scattering effects to the scattering field and permit us to solve a linear inverse problem without sophisticated solutions of a nonlinear matrix in the forward model. Simulation results are presented to validate the concept.

  16. Blind Adaptive Decorrelating RAKE (DRAKE Downlink Receiver for Space-Time Block Coded Multipath CDMA

    Directory of Open Access Journals (Sweden)

    Jayaweera Sudharman K

    2002-01-01

    Full Text Available A downlink receiver is proposed for space-time block coded CDMA systems operating in multipath channels. By combining the powerful RAKE receiver concept for a frequency selective channel with space-time decoding, it is shown that the performance of mobile receivers operating in the presence of channel fading can be improved significantly. The proposed receiver consists of a bank of decorrelating filters designed to suppress the multiple access interference embedded in the received signal before the space-time decoding. The new receiver performs the space-time decoding along each resolvable multipath component and then the outputs are diversity combined to obtain the final decision statistic. The proposed receiver relies on a key constraint imposed on the output of each filter in the bank of decorrelating filters in order to maintain the space-time block code structure embedded in the signal. The proposed receiver can easily be adapted blindly, requiring only the desired user′s signature sequence, which is also attractive in the context of wireless mobile communications. Simulation results are provided to confirm the effectiveness of the proposed receiver in multipath CDMA systems.

  17. Analysis Evacuation Route for KM Zahro Express on Fire Condition using Agent Based Modeling and Fire Dynamics Simulatior

    Directory of Open Access Journals (Sweden)

    Trika Pitana

    2017-09-01

    Full Text Available Safety is the thing that needs to be preferred by users of transport, passengers should also understand about safety procedures and evacuation procedures in the means of transport. There have been many accidents that happen in the world of transport, particularly in the shipping world, from 2010 to 2016 is no more than 50 accidents of ships in accordance with the cause recorded by KNKT (Komisi Nasional Keselamatan Transportasi. On this research was discussed the evacuation time on the ship KM Zahro express that occurred earlier in the year 2017 in the Kepulauan Seribu, DKI Jakarta. Almost all passenger dead caused by fire from power source in engine room. This thesis will explaine about evacuation time and dangers from fire that interfere the process of evacuation. The methods used are Agent Based Modeling and Simulation (ABMS and Fire Dynamics Simulator (FDS for modeling fire simulation. Agent-Based Modeling software (pathfinder and Fire Dynamics Simulator software (pyrosim are used to calculate time evacuation in normal condition and fire condition of KM Zahro Express. Agent-Based Modeling and Simulator (ABMS is a modeling method that aims to model complex problems based on real cases. Agent-Based Modeling and Simulator (ABMS is designed to model a place that has a seat, path, exit door, humans, and others. Pyrosim is a graphical user interface for the Fire Dynamics Simulator (FDS. FDS models can predict smoke, temperature, carbon monoxide, and other substances during fires.  In this case the existing models can be used to plan and prepare an emergency if unwanted things happen. As well as using basic rules which refer to the Safety Of Life At Sea (SOLAS and International Maritime Organization (IMO. Result of Evacuation simulation calculation on emergency conditions (two rear exit doors will be closed that match at actually condition is 29,783 minutes (respon is not taken in this simulation, calculation results obtained from simulation of

  18. Code Tracking Algorithms for Mitigating Multipath Effects in Fading Channels for Satellite-Based Positioning

    Directory of Open Access Journals (Sweden)

    Markku Renfors

    2007-12-01

    Full Text Available The ever-increasing public interest in location and positioning services has originated a demand for higher performance global navigation satellite systems (GNSSs. In order to achieve this incremental performance, the estimation of line-of-sight (LOS delay with high accuracy is a prerequisite for all GNSSs. The delay lock loops (DLLs and their enhanced variants (i.e., feedback code tracking loops are the structures of choice for the commercial GNSS receivers, but their performance in severe multipath scenarios is still rather limited. In addition, the new satellite positioning system proposals specify the use of a new modulation, the binary offset carrier (BOC modulation, which triggers a new challenge in the code tracking stage. Therefore, in order to meet this emerging challenge and to improve the accuracy of the delay estimation in severe multipath scenarios, this paper analyzes feedback as well as feedforward code tracking algorithms and proposes the peak tracking (PT methods, which are combinations of both feedback and feedforward structures and utilize the inherent advantages of both structures. We propose and analyze here two variants of PT algorithm: PT with second-order differentiation (Diff2, and PT with Teager Kaiser (TK operator, which will be denoted herein as PT(Diff2 and PT(TK, respectively. In addition to the proposal of the PT methods, the authors propose also an improved early-late-slope (IELS multipath elimination technique which is shown to provide very good mean-time-to-lose-lock (MTLL performance. An implementation of a noncoherent multipath estimating delay locked loop (MEDLL structure is also presented. We also incorporate here an extensive review of the existing feedback and feedforward delay estimation algorithms for direct sequence code division multiple access (DS-CDMA signals in satellite fading channels, by taking into account the impact of binary phase shift keying (BPSK as well as the newly proposed BOC modulation

  19. Roots and routes

    DEFF Research Database (Denmark)

    Christensen, Ann-Dorte; Jensen, Sune Qvotrup

    2011-01-01

    This article is about transnational migrants, how they construct belonging to ‘new’ places where they have arrived, and how the feelings of belonging to their places of origin change when they go back. The theoretical part of the article outlines the relationship between migration and belonging...... arguing that there is a dynamic interplay between roots and routes in people's lives. The empirical point of departure is narratives about roots and routes by ethnic minorities settled in Aalborg East, an underprivileged neighbourhood in northern Denmark. One of the main findings is a gap between....... A somewhat paradoxical finding is that it appears to be more difficult for transnational migrants to maintain their roots in the country of origin when they go back than it was to establish new roots in the host country...

  20. Nationwide genetic surveillance of Plasmodium vivax in Papua New Guinea reveals heterogeneous transmission dynamics and routes of migration amongst subdivided populations.

    Science.gov (United States)

    Fola, Abebe A; Nate, Elma; Abby Harrison, G L; Barnadas, Céline; Hetzel, Manuel W; Iga, Jonah; Siba, Peter; Mueller, Ivo; Barry, Alyssa E

    2018-03-01

    The Asia Pacific Leaders in Malaria Alliance (APLMA) have committed to eliminate malaria from the region by 2030. Papua New Guinea (PNG) has the highest malaria burden in the Asia-Pacific region but with the intensification of control efforts since 2005, transmission has been dramatically reduced and Plasmodium vivax is now the dominant malaria infection in some parts of the country. To gain a better understanding of the transmission dynamics and migration patterns of P. vivax in PNG, here we investigate population structure in eight geographically and ecologically distinct regions of the country. A total of 219 P. vivax isolates (16-30 per population) were successfully haplotyped using 10 microsatellite markers. A wide range of genetic diversity (H e =0.37-0.87, R s =3.60-7.58) and significant multilocus linkage disequilibrium (LD) was observed in six of the eight populations (I A S =0.08-0.15 p-value<0.05) reflecting a spectrum of transmission intensities across the country. Genetic differentiation between regions was evident (Jost's D=0.07-0.72), with increasing divergence of populations with geographic distance. Overall, P. vivax isolates clustered into three major genetic populations subdividing the Mainland lowland and coastal regions, the Islands and the Highlands. P. vivax gene flow follows major human migration routes, and there was higher gene flow amongst Mainland parasite populations than among Island populations. The Central Province (samples collected in villages close to the capital city, Port Moresby), acts as a sink for imported infections from the three major endemic areas. These insights into P. vivax transmission dynamics and population networks will inform targeted strategies to contain malaria infections and to prevent the spread of drug resistance in PNG. Copyright © 2017 Elsevier B.V. All rights reserved.

  1. The Influence of Immunization Route, Tissue Microenvironment, and Cytokine Cell Milieu on HIV-Specific CD8+ T Cells Measured Using Fluidigm Dynamic Arrays.

    Directory of Open Access Journals (Sweden)

    Shubhanshi Trivedi

    Full Text Available Thirty different genes including cytokines, chemokines, granzymes, perforin and specifically integrins were evaluated in Peyer's patch-KdGag197-205-specific CD8+ T cells (pools of 100 cells using Fluidigm 48.48 Dynamic arrays following three different prime-boost immunization strategies. Data revealed that the route of prime or the booster immunization differentially influenced the integrin expression profile on gut KdGag197-205-specific CD8+ T cells. Specifically, elevated numbers of integrin αE and αD expressing gut KdGag197-205-specific CD8+ T cells were detected following mucosal but not systemic priming. Also, αE/β7 and αD/β2 heterodimerization were more noticeable in an intranasal (i.n./i.n. vaccination setting compared to i.n./intramuscular (i.m or i.m./i.m. vaccinations. Moreover, in all vaccine groups tested α4 appeared to heterodimerize more closely with β7 then β1. Also MIP-1β, RANTES, CCR5, perforin and integrin α4 bio-markers were significantly elevated in i.n./i.m. and i.m./i.m. immunization groups compared to purely mucosal i.n./i.n. delivery. Furthermore, when wild type (WT BALB/c and IL-13 knockout (KO mice were immunized using i.n./i.m. strategy, MIP-1α, MIP-1β, RANTES, integrins α4, β1 and β7 mRNA expression levels were found to be significantly different, in mucosal verses systemic KdGag197-205-specific CD8+ T cells. Interestingly, the numbers of gut KdGag197-205-specific CD8+ T cells expressing gut-homing markers α4β7 and CCR9 protein were also significantly elevated in IL-13 KO compared to WT control. Collectively, our findings further corroborate that the route of vaccine delivery, tissue microenvironment and IL-13 depleted cytokine milieu can significantly alter the antigen-specific CD8+ T cell gene expression profiles and in turn modulate their functional avidities as well as homing capabilities.

  2. A study of land mobile satellite service multipath effects using SATLAB software

    Science.gov (United States)

    Campbell, Richard L.

    1991-01-01

    A software package is proposed that uses the known properties of signals received in multipath environments along with the mathematical relationships between signal characteristics to explore the effects of antenna pattern, vehicle velocity, shadowing of the direct wave, distributions of scatters around the moving vehicle and levels of scattered signals on the received complex envelope, fade rates and fade duration, Doppler spectrum, signal arrival angle spectrum, and spatial correlation. The data base may be either actual measured received signals entered as ASCII flat files or data synthesized using a built in model. An example illustrates the effect of using different antennas to receive signals in the same environment.

  3. GPS/Galileo Multipath Detection and Mitigation Using Closed-Form Solutions

    Directory of Open Access Journals (Sweden)

    Khaled Rouabah

    2009-01-01

    Full Text Available We propose an efficient method for the detection of Line of Sight (LOS and Multipath (MP signals in global navigation satellite systems (GNSSs which is based on the use of virtual MP mitigation (VMM technique. By using the proposed method, the MP signals' delay and coefficient amplitudes can be efficiently estimated. According to the computer simulation results, it is obvious that our proposed method is a solution for obtaining high performance in the estimation and mitigation of MP signals and thus it results in a high accuracy in GNSS positioning.

  4. QoS Routing in Ad-Hoc Networks Using GA and Multi-Objective Optimization

    Directory of Open Access Journals (Sweden)

    Admir Barolli

    2011-01-01

    Full Text Available Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing.

  5. Snow route optimization.

    Science.gov (United States)

    2016-01-01

    Route optimization is a method of creating a set of winter highway treatment routes to meet a range of targets, including : service level improvements, resource reallocation and changes to overriding constraints. These routes will allow the : operato...

  6. Hurricane Evacuation Routes

    Data.gov (United States)

    Department of Homeland Security — Hurricane Evacuation Routes in the United States A hurricane evacuation route is a designated route used to direct traffic inland in case of a hurricane threat. This...

  7. Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamic global mapping of contended links

    Science.gov (United States)

    Archer, Charles Jens [Rochester, MN; Musselman, Roy Glenn [Rochester, MN; Peters, Amanda [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Swartz, Brent Allen [Chippewa Falls, WI; Wallenfelt, Brian Paul [Eden Prairie, MN

    2011-10-04

    A massively parallel nodal computer system periodically collects and broadcasts usage data for an internal communications network. A node sending data over the network makes a global routing determination using the network usage data. Preferably, network usage data comprises an N-bit usage value for each output buffer associated with a network link. An optimum routing is determined by summing the N-bit values associated with each link through which a data packet must pass, and comparing the sums associated with different possible routes.

  8. Installation of dynamic travel time signs and efforts to obtain and test a graphical route information panel (GRIP) sign in Austin.

    Science.gov (United States)

    2016-08-01

    Graphic Route Information Panel (GRIP) signs use a combination of text, colors, and representative maps of : the roadway system to convey real-time roadway congestion location and severity information. The intent of : this project was to facilitate t...

  9. Multipath colourimetric assay for copper(II) ions utilizing MarR functionalized gold nanoparticles

    Science.gov (United States)

    Wang, Yulong; Wang, Limin; Su, Zhenhe; Xue, Juanjuan; Dong, Jinbo; Zhang, Cunzheng; Hua, Xiude; Wang, Minghua; Liu, Fengquan

    2017-02-01

    We use the multiple antibiotic resistance regulator (MarR), as a highly selective biorecognition elements in a multipath colourimetric sensing strategy for the fast detection of Cu2+ in water samples. The colourimetric assay is based on the aggregation of MarR-coated gold nanoparticles in the presence of Cu2+ ions, which induces a red-to-purple colour change of the solution. The colour variation in the gold nanoparticle aggregation process can be used for qualitative and quantitative detection of Cu2+ by the naked eye, and with UV-vis and smartphone-based approaches. The three analysis techniques used in the multipath colourimetric assay complement each other and provide greater flexibility for differing requirements and conditions, making the assay highly applicable for Cu2+ detection. Under optimal conditions, the Cu2+ concentration was quantified in less than 5 min with limits of detection for the naked eye, UV-vis and smartphone-based approaches of 1 μM, 405 nM and 61 nM, respectively. Moreover, the sensing system exhibited excellent selectivity and practical application for Cu2+ detection in real water samples. Thus, our strategy has great potential for application in on-site monitoring of Cu2+, and the unique response of MarR towards copper ions may provide a new approach to Cu2+ sensing.

  10. AUV Positioning Method Based on Tightly Coupled SINS/LBL for Underwater Acoustic Multipath Propagation

    Directory of Open Access Journals (Sweden)

    Tao Zhang

    2016-03-01

    Full Text Available This paper researches an AUV (Autonomous Underwater Vehicle positioning method based on SINS (Strapdown Inertial Navigation System/LBL (Long Base Line tightly coupled algorithm. This algorithm mainly includes SINS-assisted searching method of optimum slant-range of underwater acoustic propagation multipath, SINS/LBL tightly coupled model and multi-sensor information fusion algorithm. Fuzzy correlation peak problem of underwater LBL acoustic propagation multipath could be solved based on SINS positional information, thus improving LBL positional accuracy. Moreover, introduction of SINS-centered LBL locating information could compensate accumulative AUV position error effectively and regularly. Compared to loosely coupled algorithm, this tightly coupled algorithm can still provide accurate location information when there are fewer than four available hydrophones (or within the signal receiving range. Therefore, effective positional calibration area of tightly coupled system based on LBL array is wider and has higher reliability and fault tolerance than loosely coupled. It is more applicable to AUV positioning based on SINS/LBL.

  11. Joint Symbol Timing and CFO Estimation for OFDM/OQAM Systems in Multipath Channels

    Directory of Open Access Journals (Sweden)

    Petrella Angelo

    2010-01-01

    Full Text Available The problem of data-aided synchronization for orthogonal frequency division multiplexing (OFDM systems based on offset quadrature amplitude modulation (OQAM in multipath channels is considered. In particular, the joint maximum-likelihood (ML estimator for carrier-frequency offset (CFO, amplitudes, phases, and delays, exploiting a short known preamble, is derived. The ML estimators for phases and amplitudes are in closed form. Moreover, under the assumption that the CFO is sufficiently small, a closed form approximate ML (AML CFO estimator is obtained. By exploiting the obtained closed form solutions a cost function whose peaks provide an estimate of the delays is derived. In particular, the symbol timing (i.e., the delay of the first multipath component is obtained by considering the smallest estimated delay. The performance of the proposed joint AML estimator is assessed via computer simulations and compared with that achieved by the joint AML estimator designed for AWGN channel and that achieved by a previously derived joint estimator for OFDM systems.

  12. Background Traffic-Based Retransmission Algorithm for Multimedia Streaming Transfer over Concurrent Multipaths

    Directory of Open Access Journals (Sweden)

    Yuanlong Cao

    2012-01-01

    Full Text Available The content-rich multimedia streaming will be the most attractive services in the next-generation networks. With function of distribute data across multipath end-to-end paths based on SCTP's multihoming feature, concurrent multipath transfer SCTP (CMT-SCTP has been regarded as the most promising technology for the efficient multimedia streaming transmission. However, the current researches on CMT-SCTP mainly focus on the algorithms related to the data delivery performance while they seldom consider the background traffic factors. Actually, background traffic of realistic network environments has an important impact on the performance of CMT-SCTP. In this paper, we firstly investigate the effect of background traffic on the performance of CMT-SCTP based on a close realistic simulation topology with reasonable background traffic in NS2, and then based on the localness nature of background flow, a further improved retransmission algorithm, named RTX_CSI, is proposed to reach more benefits in terms of average throughput and achieve high users' experience of quality for multimedia streaming services.

  13. Signal Reception for Space-Time Differentially Encoded Transmissions over FIR Rich Multipath Channels

    Directory of Open Access Journals (Sweden)

    Zhang Zhan

    2004-01-01

    Full Text Available With sophisticated signal and information processing algorithms, air interfaces with space-time (ST coding and multiple reception antennas substantially improve the reliability of wireless links. This paper proposes a new receiver algorithm for differential ST coded transmissions over the finite-impulse-response (FIR rich multipath fading channels. The symbol detection introduced in this paper is a deterministic subspace-based approach in a multiple-input and multiple-output (MIMO system framework. The receiver (i operates in a blind fashion without estimating the channel or its inverse and (ii is able to work with a small number of signal samples and hence can be applied in the quasistatic channels. The proposed scheme employs multiple antennas at both sides of the transceiver and exploits both the antenna diversity and the multiple constant modulus (MCM characteristics of the signaling. The receiver is able to blindly mitigate the intersymbol interference (ISI in a rich multipath propagation environment, and this has been verified through the extensive Monte Carlo simulations.

  14. Quantified, Interactive Simulation of AMCW ToF Camera Including Multipath Effects

    Directory of Open Access Journals (Sweden)

    David Bulczak

    2017-12-01

    Full Text Available In the last decade, Time-of-Flight (ToF range cameras have gained increasing popularity in robotics, automotive industry, and home entertainment. Despite technological developments, ToF cameras still suffer from error sources such as multipath interference or motion artifacts. Thus, simulation of ToF cameras, including these artifacts, is important to improve camera and algorithm development. This paper presents a physically-based, interactive simulation technique for amplitude modulated continuous wave (AMCW ToF cameras, which, among other error sources, includes single bounce indirect multipath interference based on an enhanced image-space approach. The simulation accounts for physical units down to the charge level accumulated in sensor pixels. Furthermore, we present the first quantified comparison for ToF camera simulators. We present bidirectional reference distribution function (BRDF measurements for selected, purchasable materials in the near-infrared (NIR range, craft real and synthetic scenes out of these materials and quantitatively compare the range sensor data.

  15. First prospects in a new approach for structure monitoring from GPS multipath effect and wavelet spectrum

    Science.gov (United States)

    Souza, Eniuce Menezes; Negri, Tamiris Trevisan

    2017-05-01

    Continuous monitoring of large structures is essential to ensure their integrity. Many instruments and methods have been developed to support structure monitoring. Global Positioning System (GPS) plays an important role in such task thanks to the precision and millimeter level accuracy of the provided position information in near real-time. However, installing a GPS receiver can be a really difficult task depending on the structure, mainly when it is under collapse danger. To address this issue, this paper presents a new methodology for structure monitoring, without installing a receiver directly on the structure. Instead, a time-frequency analysis of the multipath effect, caused by GPS signal reflections, is performed. As this effect repeats in consecutive days, a change on its pattern indicates structure movement. This work investigates the feasibility of using wavelet spectra analysis of the multipath signal to monitor structure movement. An experiment simulating a structure movement was carried out and real GPS data were collected. Pseudorange and carrier phase data were evaluated using different wavelet bases. The experimental results have shown that the proposed methodology has great potential for detection of structure movements, especially using the pseudorange signals combined to Symmlets wavelet basis with 10 vanishing moments. From Receiver Operating Characteristic (ROC) analysis, accuracy measure, Spearman and Matthews correlation coefficients, the simulated movement was correctly detected for all signals at a 5% significance level.

  16. Surface Wave Multipathing and its Influence on Phase Velocities Measured by Small Networks

    Science.gov (United States)

    Maupin, V.

    2011-12-01

    Networks of temporary broadband seismological stations are commonly deployed over dedicated targets. Measurement of surface wave phase velocity across the network and its depth-inversion gives us information about the structure below the network which is complementary to the information obtained from body-wave analysis. For small networks, we face however the fundamental problem that the dimensions of the heterogeneities to image are not large compared to the wavelengths of the surface waves used to image them. In addition, multipathing is very common is teleseismic surface waves at moderate frequencies and the complexity of the incoming wavefield has to be taken into account during the tomographic process. We perform a series of numerical simulations of surface wave propagation in 3-D structures using complex incoming wavefields in order to analyse how the nature of the incoming wavefield plays together with the 3-D structure to determine phases and amplitudes at the different stations of a network. We analyse how different tomographic methods cope with the complex wavefield, the consequences on the resolution of the resulting tomographic models and we try to provide recommendations for data selection. The numerical simulations are done using a multiple-scattering mode coupling scheme. The amount of multipathing is taken from a recent study using teleseismic surface waves recorded on a temporary network in Southern Norway. The period range of 20 to 200s and the 450km x 600km dimension of the network is also taken form the same study.

  17. Matter-wave diffraction approaching limits predicted by Feynman path integrals for multipath interference

    Science.gov (United States)

    Barnea, A. Ronny; Cheshnovsky, Ori; Even, Uzi

    2018-02-01

    Interference experiments have been paramount in our understanding of quantum mechanics and are frequently the basis of testing the superposition principle in the framework of quantum theory. In recent years, several studies have challenged the nature of wave-function interference from the perspective of Born's rule—namely, the manifestation of so-called high-order interference terms in a superposition generated by diffraction of the wave functions. Here we present an experimental test of multipath interference in the diffraction of metastable helium atoms, with large-number counting statistics, comparable to photon-based experiments. We use a variation of the original triple-slit experiment and accurate single-event counting techniques to provide a new experimental bound of 2.9 ×10-5 on the statistical deviation from the commonly approximated null third-order interference term in Born's rule for matter waves. Our value is on the order of the maximal contribution predicted for multipath trajectories by Feynman path integrals.

  18. Feedforward Delay Estimators in Adverse Multipath Propagation for Galileo and Modernized GPS Signals

    Directory of Open Access Journals (Sweden)

    Lohan Elena Simona

    2006-01-01

    Full Text Available The estimation with high accuracy of the line-of-sight delay is a prerequisite for all global navigation satellite systems. The delay locked loops and their enhanced variants are the structures of choice for the commercial GNSS receivers, but their performance in severe multipath scenarios is still rather limited. The new satellite positioning system proposals specify higher code-epoch lengths compared to the traditional GPS signal and the use of a new modulation, the binary offset carrier (BOC modulation, which triggers new challenges in the delay tracking stage. We propose and analyze here the use of feedforward delay estimation techniques in order to improve the accuracy of the delay estimation in severe multipath scenarios. First, we give an extensive review of feedforward delay estimation techniques for CDMA signals in fading channels, by taking into account the impact of BOC modulation. Second, we extend the techniques previously proposed by the authors in the context of wideband CDMA delay estimation (e.g., Teager-Kaiser and the projection onto convex sets to the BOC-modulated signals. These techniques are presented as possible alternatives to the feedback tracking loops. A particular attention is on the scenarios with closely spaced paths. We also discuss how these feedforward techniques can be implemented via DSPs.

  19. A Novel Target-Height Estimation Approach Using Radar-Wave Multipath Propagation for Automotive Applications

    Directory of Open Access Journals (Sweden)

    A. Laribi

    2017-09-01

    Full Text Available This paper introduces a novel target height estimation approach using a Frequency Modulation Continuous Wave (FMCW automotive radar. The presented algorithm takes advantage of radar wave multipath propagation to measure the height of objects in the vehicle surroundings. A multipath propagation model is presented first, then a target height is formulated using geometry, based on the presented propagation model. It is then shown from Sensor-Target geometry that height estimation of targets is highly dependent on the radar range resolution, target range and target height. The high resolution algorithm RELAX is discussed and applied to collected raw data to enhance the radar range resolution capability. This enables a more accurate height estimation especially for low targets. Finally, the results of a measurement campaign using corner reflectors at different heights are discussed to show that target heights can be very accurately resolved by the proposed algorithm and that for low targets an average mean height estimation error of 0.03 m has been achieved by the proposed height finding algorithm.

  20. Fine particles and NO{sub 2}. Development and validation of a method for the immission-relevant, dynamic re-routing of traffic; Feinstaub und NO{sub 2}. Entwicklung und Validierung einer Methode zur immissionsabhaengigen dynamischen Verkehrssteuerung

    Energy Technology Data Exchange (ETDEWEB)

    Ludes, G.; Siebers, B. [simuPlan, Dorsten (Germany); Kuhlbusch, T.; Quass, U.; Beyer, M. [Institut fuer Energie- und Umwelttechnik, Duisburg (Germany); Weber, F. [Stadt Hagen (Germany)

    2010-05-15

    Due to the coming into effect of the twenty-second BImSchV comprehensive investigations on the ambient air quality have been carried out in the city of Hagen in recent years by means of measurement and modelling. High concentrations of nitrogen dioxide and respirable dust have been found along the main streets and the roads belonging to the city ring road system. Main cause of the present situation is road traffic, esp. heavy duty vehicles (HDV). Therefore the concept of measures for the implementation of the air monitoring plan and the action plan set up by the project group includes a HDV-routing system and dynamic, immission-relevant re-routing of traffic. Through this research project the practicability and the effects on air quality of the dynamic, immission-relevant re-routing of HDV-traffic will especially be examined within the highly polluted area of the ''Maerkischer Ring''. By making use of the control programme simDRIVE this innovative concept allows temporary closures of the ''Maerkischer Ring'' for HDV-traffic if transgression of critical limit values is prognosticated due to traffic volume and meteorological circumstances. During these closure periods HDV-traffic will be diverted to alternative and previously determined routes by dynamic and static traffic signs in order to guarantee that intended destinations can be reached. With the help of this research project it should be demonstrated in addition (a) if and how this particular method for NO{sub 2} can also be applied on the reduction of respirable dust, (b) how this measure affects the situation of air pollution regarding respirable dust in other parts of Hagen and (c) if the transfer of methods for the use in other cities is possible. (orig.)

  1. Providing Formative Assessment to Students Solving Multipath Engineering Problems with Complex Arrangements of Interacting Parts: An Intelligent Tutor Approach

    Science.gov (United States)

    Steif, Paul S.; Fu, Luoting; Kara, Levent Burak

    2016-01-01

    Problems faced by engineering students involve multiple pathways to solution. Students rarely receive effective formative feedback on handwritten homework. This paper examines the potential for computer-based formative assessment of student solutions to multipath engineering problems. In particular, an intelligent tutor approach is adopted and…

  2. Characteristics of BeiDou Navigation Satellite System Multipath and Its Mitigation Method Based on Kalman Filter and Rauch-Tung-Striebel Smoother.

    Science.gov (United States)

    Zhang, Qiuzhao; Yang, Wei; Zhang, Shubi; Liu, Xin

    2018-01-12

    Global Navigation Satellite System (GNSS) carrier phase measurement for short baseline meets the requirements of deformation monitoring of large structures. However, the carrier phase multipath effect is the main error source with double difference (DD) processing. There are lots of methods to deal with the multipath errors of Global Position System (GPS) carrier phase data. The BeiDou navigation satellite System (BDS) multipath mitigation is still a research hotspot because the unique constellation design of BDS makes it different to mitigate multipath effects compared to GPS. Multipath error periodically repeats for its strong correlation to geometry of satellites, reflective surface and antenna which is also repetitive. We analyzed the characteristics of orbital periods of BDS satellites which are consistent with multipath repeat periods of corresponding satellites. The results show that the orbital periods and multipath periods for BDS geostationary earth orbit (GEO) and inclined geosynchronous orbit (IGSO) satellites are about one day but the periods of MEO satellites are about seven days. The Kalman filter (KF) and Rauch-Tung-Striebel Smoother (RTSS) was introduced to extract the multipath models from single difference (SD) residuals with traditional sidereal filter (SF). Wavelet filter and Empirical mode decomposition (EMD) were also used to mitigate multipath effects. The experimental results show that the three filters methods all have obvious effect on improvement of baseline accuracy and the performance of KT-RTSS method is slightly better than that of wavelet filter and EMD filter. The baseline vector accuracy on east, north and up (E, N, U) components with KF-RTSS method were improved by 62.8%, 63.6%, 62.5% on day of year 280 and 57.3%, 53.4%, 55.9% on day of year 281, respectively.

  3. Characteristics of BeiDou Navigation Satellite System Multipath and Its Mitigation Method Based on Kalman Filter and Rauch-Tung-Striebel Smoother

    Directory of Open Access Journals (Sweden)

    Qiuzhao Zhang

    2018-01-01

    Full Text Available Global Navigation Satellite System (GNSS carrier phase measurement for short baseline meets the requirements of deformation monitoring of large structures. However, the carrier phase multipath effect is the main error source with double difference (DD processing. There are lots of methods to deal with the multipath errors of Global Position System (GPS carrier phase data. The BeiDou navigation satellite System (BDS multipath mitigation is still a research hotspot because the unique constellation design of BDS makes it different to mitigate multipath effects compared to GPS. Multipath error periodically repeats for its strong correlation to geometry of satellites, reflective surface and antenna which is also repetitive. We analyzed the characteristics of orbital periods of BDS satellites which are consistent with multipath repeat periods of corresponding satellites. The results show that the orbital periods and multipath periods for BDS geostationary earth orbit (GEO and inclined geosynchronous orbit (IGSO satellites are about one day but the periods of MEO satellites are about seven days. The Kalman filter (KF and Rauch-Tung-Striebel Smoother (RTSS was introduced to extract the multipath models from single difference (SD residuals with traditional sidereal filter (SF. Wavelet filter and Empirical mode decomposition (EMD were also used to mitigate multipath effects. The experimental results show that the three filters methods all have obvious effect on improvement of baseline accuracy and the performance of KT-RTSS method is slightly better than that of wavelet filter and EMD filter. The baseline vector accuracy on east, north and up (E, N, U components with KF-RTSS method were improved by 62.8%, 63.6%, 62.5% on day of year 280 and 57.3%, 53.4%, 55.9% on day of year 281, respectively.

  4. Routing in opportunistic networks

    CERN Document Server

    Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

    2013-01-01

    This book provides a comprehensive guide to selected topics, both ongoing and emerging, in routing in OppNets. The book is edited by worldwide technical leaders, prolific researchers and outstanding academics, Dr. Isaac Woungang and co-editors, Dr. Sanjay Kumar Dhurandher, Prof. Alagan Anpalagan and Prof. Athanasios Vasilakos. Consisting of contributions from well known and high profile researchers and scientists in their respective specialties, the main topics that are covered in this book include mobility and routing, social-aware routing, context-based routing, energy-aware routing, incentive-aware routing, stochastic routing, modeling of intermittent connectivity, in both infrastructure and infrastructure-less OppNets. Key Features: Discusses existing and emerging techniques for routing in infrastructure and infrastructure-less OppNets. Provides a unified covering of otherwise disperse selected topics on routing in infrastructure and infrastructure-less OppNets.  Includes a set of PowerPoint slides and g...

  5. Advanced Measurements of the Aggregation Capability of the MPT Network Layer Multipath Communication Library

    Directory of Open Access Journals (Sweden)

    Gábor Lencse

    2015-05-01

    Full Text Available The MPT network layer multipath communicationlibrary is a novel solution for several problems including IPv6transition, reliable data transmission using TCP, real-time transmissionusing UDP and also wireless network layer routingproblems. MPT can provide an IPv4 or an IPv6 tunnel overone or more IPv4 or IPv6 communication channels. MPT canalso aggregate the capacity of multiple physical channels. In thispaper, the channel aggregation capability of the MPT libraryis measured up to twelve 100Mbps speed channels. Differentscenarios are used: both IPv4 and IPv6 are used as the underlyingand also as the encapsulated protocols and also both UDP andTCP are used as transport protocols. In addition, measurementsare taken with both 32-bit and 64-bit version of the MPT library.In all cases, the number of the physical channels is increased from1 to 12 and the aggregated throughput is measured.

  6. Further Study on MOE-Based Multiuser Detection in Unknown Multipath

    Directory of Open Access Journals (Sweden)

    Xu Zhengyuan

    2002-01-01

    Full Text Available The minimum output energy (MOE receiver has been developed for multiuser detection when multipath distortion is present. Its performance has been shown to be very close to the minimum mean-square-error (MMSE receiver at high signal to noise ratio. However, due to the additive noise, the constraint vector required to construct the MOE receiver is a biased estimate of the channel vector. Thus, the MOE receiver exhibits degraded performance. To mitigate the noise effect, the constraint cost function is modified to obtain a modified MOE (MMOE receiver in this paper, leading to a significantly improved channel estimate and detection performance. It is also revealed that the MMOE method converges to the well-known subspace method under certain conditions. In addition to the additive noise, imperfect estimation of the output data covariance matrix also causes performance loss and is studied in details based on perturbation theory.

  7. Multi-path transportation futures study : vehicle characterization and scenario analyses.

    Energy Technology Data Exchange (ETDEWEB)

    Plotkin, S. E.; Singh, M. K.; Energy Systems; TA Engineering; ORNL

    2009-12-03

    Projecting the future role of advanced drivetrains and fuels in the light vehicle market is inherently difficult, given the uncertainty (and likely volatility) of future oil prices, inadequate understanding of likely consumer response to new technologies, the relative infancy of several important new technologies with inevitable future changes in their performance and costs, and the importance - and uncertainty - of future government marketplace interventions (e.g., new regulatory standards or vehicle purchase incentives). This Multi-Path Transportation Futures (MP) Study has attempted to improve our understanding of this future role by examining several scenarios of vehicle costs, fuel prices, government subsidies, and other key factors. These are projections, not forecasts, in that they try to answer a series of 'what if' questions without assigning probabilities to most of the basic assumptions.

  8. Noise-assisted concurrent multipath traffic distribution in ad hoc networks.

    Science.gov (United States)

    Asvarujanon, Narun; Leibnitz, Kenji; Wakamiya, Naoki; Murata, Masayuki

    2013-01-01

    The concept of biologically inspired networking has been introduced to tackle unpredictable and unstable situations in computer networks, especially in wireless ad hoc networks where network conditions are continuously changing, resulting in the need of robustness and adaptability of control methods. Unfortunately, existing methods often rely heavily on the detailed knowledge of each network component and the preconfigured, that is, fine-tuned, parameters. In this paper, we utilize a new concept, called attractor perturbation (AP), which enables controlling the network performance using only end-to-end information. Based on AP, we propose a concurrent multipath traffic distribution method, which aims at lowering the average end-to-end delay by only adjusting the transmission rate on each path. We demonstrate through simulations that, by utilizing the attractor perturbation relationship, the proposed method achieves a lower average end-to-end delay compared to other methods which do not take fluctuations into account.

  9. Design of complete software GPS signal simulator with low complexity and precise multipath channel model

    Directory of Open Access Journals (Sweden)

    G. Arul Elango

    2016-09-01

    Full Text Available The need for GPS data simulators have become important due to the tremendous growth in the design of versatile GPS receivers. Commercial hardware and software based GPS simulators are expensive and time consuming. In this work, a low cost simple novel GPS L1 signal simulator is designed for testing and evaluating the performance of software GPS receiver in a laboratory environment. A typical real time paradigm, similar to actual satellite derived GPS signal is created on a computer generated scenario. In this paper, a GPS software simulator is proposed that may offer a lot of analysis and testing flexibility to the researchers and developers as it is totally software based primarily running on a laptop/personal computer without the requirement of any hardware. The proposed GPS simulator allows provision for re-configurability and test repeatability and is developed in VC++ platform to minimize the simulation time. It also incorporates Rayleigh multipath channel fading model under non-line of sight (NLOS conditions. In this work, to efficiently design the simulator, several Rayleigh fading models viz. Inverse Discrete Fourier Transform (IDFT, Filtering White Gaussian Noise (FWFN and modified Sum of Sinusoidal (SOS simulators are tested and compared in terms of accuracy of its first and second order statistical metrics, execution time and the later one is found to be as the best appropriate Rayleigh multipath model suitable for incorporating with GPS simulator. The fading model written in ‘MATLAB’ engine has been linked with software GPS simulator module enable to test GPS receiver’s functionality in different fading environments.

  10. A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

    Science.gov (United States)

    Jara, Nicolás; Vallejos, Reinaldo; Rubino, Gerardo

    2017-11-01

    The design of optical networks decomposes into different tasks, where the engineers must basically organize the way the main system's resources are used, minimizing the design and operation costs and respecting critical performance constraints. More specifically, network operators face the challenge of solving routing and wavelength dimensioning problems while aiming to simultaneously minimize the network cost and to ensure that the network performance meets the level established in the Service Level Agreement (SLA). We call this the Routing and Wavelength Dimensioning (R&WD) problem. Another important problem to be solved is how to deal with failures of links when the network is operating. When at least one link fails, a high rate of data loss may occur. To avoid it, the network must be designed in such a manner that upon one or multiple failures, the affected connections can still communicate using alternative routes, a mechanism known as Fault Tolerance (FT). When the mechanism allows to deal with an arbitrary number of faults, we speak about Multiple Fault Tolerance (MFT). The different tasks before mentioned are usually solved separately, or in some cases by pairs, leading to solutions that are not necessarily close to optimal ones. This paper proposes a novel method to simultaneously solve all of them, that is, the Routing, the Wavelength Dimensioning, and the Multiple Fault Tolerance problems. The method allows to obtain: a) all the primary routes by which each connection normally transmits its information, b) the additional routes, called secondary routes, used to keep each user connected in cases where one or more simultaneous failures occur, and c) the number of wavelengths available at each link of the network, calculated such that the blocking probability of each connection is lower than a pre-determined threshold (which is a network design parameter), despite the occurrence of simultaneous link failures. The solution obtained by the new algorithm is

  11. Hazmat Routes (National)

    Data.gov (United States)

    Department of Transportation — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes (NTAD) were developed using the 2004 First Edition TIGER/Line files. The routes are...

  12. State alternative route designations

    International Nuclear Information System (INIS)

    1989-07-01

    Pursuant to the Hazardous Materials Transportation Act (HMTA), the Department of Transportation (DOT) has promulgated a comprehensive set of regulations regarding the highway transportation of high-level radioactive materials. These regulations, under HM-164 and HM-164A, establish interstate highways as the preferred routes for the transportation of radioactive materials within and through the states. The regulations also provide a methodology by which a state may select alternative routes. First,the state must establish a ''state routing agency,'' defined as an entity authorized to use the state legal process to impose routing requirements on carriers of radioactive material (49 CFR 171.8). Once identified, the state routing agency must select routes in accordance with Large Quantity Shipments of Radioactive Materials or an equivalent routing analysis. Adjoining states and localities should be consulted on the impact of proposed alternative routes as a prerequisite of final route selection. Lastly, the states must provide written notice of DOT of any alternative route designation before the routes are deemed effective

  13. Detailed analysis of routing protocols with different network limitations

    Science.gov (United States)

    Masood, Mohsin; Abuhelala, Mohamed; Glesk, Ivan

    2016-12-01

    In network communication field, routing protocols have got a significant role which are not only used in networks to handle the user data but also to monitor the different network environments. Dynamic routing protocols such as OSPF, EIGRP and RIP are used for forwarding user data to its destination by instantly detecting the dynamic changes across the network. The dynamic changes in the network can be in the form of topological changes, congestions, links failure etc. Therefore, it becomes a challenge to develop and implement dynamic routing protocols that fulfills the network requirements. Hence, each routing protocol has its own characteristics such as convergence activity, routing metric, routing table etc. and will perform differently in various network environments. This paper presents a comprehensive study of static and dynamic routing, along with dynamic routing protocols. Experiments that are conducted under various network limitations are presented using the OPNET tool. The performance of each of dynamic routing protocols are monitored and explained in the form of simulated results using network parameters. The results are analyzed, in order to provide a clear understanding of each protocol performance for the selection of the proper protocol for a given network environment.

  14. Enchanced interference cancellation and telemetry reception in multipath environments with a single paraboic dish antenna using a focal plane array

    Science.gov (United States)

    Mukai, Ryan (Inventor); Vilnrotter, Victor A. (Inventor)

    2011-01-01

    An Advanced Focal Plane Array ("AFPA") for parabolic dish antennas that exploits spatial diversity to achieve better channel equalization performance in the presence of multipath (better than temporal equalization alone), and which is capable of receiving from two or more sources within a field-of-view in the presence of multipath. The AFPA uses a focal plane array of receiving elements plus a spatio-temporal filter that keeps information on the adaptive FIR filter weights, relative amplitudes and phases of the incoming signals, and which employs an Interference Cancelling Constant Modulus Algorithm (IC-CMA) that resolves multiple telemetry streams simultaneously from the respective aero-nautical platforms. This data is sent to an angle estimator to calculate the target's angular position, and then on to Kalman filters FOR smoothing and time series prediction. The resulting velocity and acceleration estimates from the time series data are sent to an antenna control unit (ACU) to be used for pointing control.

  15. Investigations into the performance of a distributed routing protocol for packet switching networks.

    OpenAIRE

    Lengerich, Anthony W.

    1982-01-01

    Approved for public release; distribution is unlimited Packet switching communication networks employ routing protocols to determine the path traversed by each packet as it passes through the network. Routing protocols which are adaptive and can restructure the packet paths in response to localized network congestion ace called "dynamic" routing protocols. Dynamic routing protocols seek to optimize the routing (provide the shortest path) for each packet in the network....

  16. Performance Analysis of a Six-Port Receiver in a WCDMA Communication System including a Multipath Fading Channel

    Directory of Open Access Journals (Sweden)

    A. O. Olopade

    2014-01-01

    Full Text Available Third generation communication systems require receivers with wide bandwidth of operation to support high transmission rates and are also reconfigurable to support various communication standards with different frequency bands. An ideal software defined radio (SDR will be the absolute answer to this requirement but it is not achievable with the current level of technology. This paper proposes the use of a six-port receiver (SPR front-end (FE in a WCDMA communication system. A WCDMA end-to-end physical layer MATLAB demo which includes a multipath channel distortion block is used to determine the viability of the six-port based receiver. The WCDMA signal after passing through a multipath channel is received using a constructed SPR FE. The baseband signal is then calibrated and corrected in MATLAB. The six-port receiver performance is measured in terms of bit error rate (BER. The signal-to-noise ratio (SNR of the transmitted IQ data is varied and the BER profile of the communication system is plotted. The effect of the multipath fading on the receiver performance and the accuracy of the calibration algorithm are obtained by comparing two different measured BER curves for different calibration techniques to the simulated BER curve of an ideal receiver.

  17. Inertial Aided Cycle-slip Detection and Repair for BDS Triple-frequency Signal in Severe Multipath Environment

    Directory of Open Access Journals (Sweden)

    NING Yipeng

    2017-05-01

    Full Text Available Inertial information has been proposed to improve the success rate and repair rate for BDS triple-frequency cycle-slip detection in severe environment with multipath effects.At the same time, a BDS/INS loose coupled model has been developed. An innovative INS aided BDS triple-frequency combination method was developed which based on the traditional method of code-phase combination and geometry-free linear combination. The INS aided cycle-slip detection monitoring value was established and the effect of INS positioning error on cycle-slip capacity was analyzed. The proposed method overcomes the shortcoming of cycle-slip detection capacity influenced by the pseudorange observation precision. It also realizes small cycle-slips detection for BDS in severe multipath effects environment. At last, a field test was analysised with INS/BDS triple-frequency integrated positioning system onboard. The results indicate that the method proposed in this paper shows a high cycle-slip detection success rate and repair rate, when traditional triple-frequency detection model losed efficacy above water surface with multipath effects, and it also can be effective in low frequency sampling data.

  18. Empty Container Management in Cyclic Shipping Routes

    OpenAIRE

    Dong-Ping Song; Jing-Xin Dong

    2008-01-01

    This paper considers the empty container management problem in a cyclic shipping route. The objective is to seek the optimal empty container repositioning policy in a dynamic and stochastic situation by minimising the expected total costs consisting of inventory holding costs, demand lost-sale costs, lifting-on and lifting-off charges, and container transportation costs. A three-phase threshold control policy is developed to reposition empty containers in cyclic routes. The threshold values a...

  19. Ising model for packet routing control

    International Nuclear Information System (INIS)

    Horiguchi, Tsuyoshi; Takahashi, Hideyuki; Hayashi, Keisuke; Yamaguchi, Chiaki

    2004-01-01

    For packet routing control in computer networks, we propose an Ising model which is defined in order to express competition among a queue length and a distance from a node with a packet to its destination node. By introducing a dynamics for a mean-field value of an Ising spin, we show by computer simulations that effective control of packet routing through priority links is possible

  20. Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

    Directory of Open Access Journals (Sweden)

    Meng-Hsun Tsai

    Full Text Available Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP built on top of MultiPath TCP (MPTCP. CBSP enables users to buy bandwidth on demand from neighbors (called Helpers and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC, to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

  1. Upper-mantle structure in southern Norway from beamforming of Rayleigh wave data presenting multipathing

    Science.gov (United States)

    Maupin, Valérie

    2011-05-01

    A model for the upper mantle SV-wave velocity under southern Norway is obtained by depth inversion of the average phase velocity of the Rayleigh wave fundamental mode in the area. The average dispersion curve is obtained in the period range 22-200 s by beamforming of 190 Rayleigh waves recorded by the MAGNUS network, a temporary regional network of 41 broad-band stations. Resolution of the beamforming procedure is increased by deconvolving the original beams from the array response function using the Lucy-Richardson algorithm. In addition to an average phase velocity, beamforming gives us some information concerning the nature of the incoming wavefield. We detect deviations of the wave propagation direction from the great-circle paths which commonly reach 10° at a period of 25 s for the teleseismic events. The amplitude of the deviations decreases with increasing period and with decreasing epicentral distance, as expected. The phase velocity measured by beamforming does not show any correlation with the deviation from great circle path, suggesting that deviation does not bias phase velocity measurements. We detect also significant multipathing with characteristics that vary rapidly with frequency. The obtained SV-wave velocity profile clearly shows that southern Norway is underlain by a low-velocity zone in the upper mantle and does not have shield-like characteristics, despite its location in the Baltic shield. These findings support the hypothesis that the high topography of southern Norway is sustained by anomalous upper-mantle material.

  2. MC-DS-CDMA System based on DWT and STBC in ITU Multipath Fading Channels Model

    Directory of Open Access Journals (Sweden)

    Nader Abdullah Khadam

    2018-03-01

    Full Text Available In this paper, the performance of multicarrier direct sequence code division multiple access (MC-DS-CDMA in fixed MC-DS-CDMA and Mobile MC-DS-CDMA applications have been improved by using the compensations of space time block coding and Discrete Fast Fourier transforms (FFT or Discrete Wavelets transform DWT. These MC-DS-CDMA systems had been simulated using MATLAB 2015a. Through simulation of the proposed system, various parameters can be changed and tested. The Bit Error Rate (BERs of these systems are obtained over wide range of signal to noise ratio. All simulation results had been compared with each other using different subcarrier size of FFT or DWT with STBC for 1,2,3 and 4 antennas in transmitter and under different ITU multipath fading channels and different Doppler frequencies (fd. The proposed structures of STBC-MC-DS-CDMA system based on (DWT batter than based on (FFT in varies Doppler frequencies and subcarrier size. Also, proposed system with STBC based on 4 transmitters better than other systems based on 1 or 2 or 3 transmitters in all Doppler frequencies and subcarrier size in all simulation results.

  3. Finding the multipath propagation of multivariable crude oil prices using a wavelet-based network approach

    Science.gov (United States)

    Jia, Xiaoliang; An, Haizhong; Sun, Xiaoqi; Huang, Xuan; Gao, Xiangyun

    2016-04-01

    The globalization and regionalization of crude oil trade inevitably give rise to the difference of crude oil prices. The understanding of the pattern of the crude oil prices' mutual propagation is essential for analyzing the development of global oil trade. Previous research has focused mainly on the fuzzy long- or short-term one-to-one propagation of bivariate oil prices, generally ignoring various patterns of periodical multivariate propagation. This study presents a wavelet-based network approach to help uncover the multipath propagation of multivariable crude oil prices in a joint time-frequency period. The weekly oil spot prices of the OPEC member states from June 1999 to March 2011 are adopted as the sample data. First, we used wavelet analysis to find different subseries based on an optimal decomposing scale to describe the periodical feature of the original oil price time series. Second, a complex network model was constructed based on an optimal threshold selection to describe the structural feature of multivariable oil prices. Third, Bayesian network analysis (BNA) was conducted to find the probability causal relationship based on periodical structural features to describe the various patterns of periodical multivariable propagation. Finally, the significance of the leading and intermediary oil prices is discussed. These findings are beneficial for the implementation of periodical target-oriented pricing policies and investment strategies.

  4. Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

    Science.gov (United States)

    Tsai, Meng-Hsun; Chou, Chien-Ming; Lan, Kun-Chan

    2016-01-01

    Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP) built on top of MultiPath TCP (MPTCP). CBSP enables users to buy bandwidth on demand from neighbors (called Helpers) and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP) leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC), to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

  5. Adaptive Transmitter Precoding for Time Division Duplex CDMA in Fading Multipath Channels: Strategy and Analysis

    Directory of Open Access Journals (Sweden)

    Daryl Reynolds

    2003-01-01

    Full Text Available The recently developed blind adaptive techniques for multiuser detection in code division multiple access (CDMA systems offer an attractive compromise of performance and complexity. However, the desire to further reduce complexity at the mobile unit has led to the investigation of techniques that move signal processing from the mobile unit to the base station. In this paper, we investigate transmitter precoding for downlink time division duplex (TDD code division multiple access (CDMA communications. In particular, we develop a linear minimum mean square error precoding strategy using blind channel estimation for fading multipath channels that allows for simple matched filtering at the mobile unit and is easy to make adaptive. We also present a performance analysis using tools developed for the analysis of conventional (receiver-based linear blind multiuser detection in unknown channels. We compare the analytical and simulation results to traditional receiver-based blind multiuser detection. It is seen that transmitter precoding offers a reasonable alternative for TDD-mode CDMA when minimizing computational complexity at the mobile unit is a priority.

  6. Route Availabililty Planning Tool -

    Data.gov (United States)

    Department of Transportation — The Route Availability Planning Tool (RAPT) is a weather-assimilated decision support tool (DST) that supports the development and execution of departure management...

  7. A double candidate survivable routing protocol for HAP network

    Science.gov (United States)

    He, Panfeng; Li, Chunyue; Ni, Shuyan

    2016-11-01

    To improve HAP network invulnerability, and at the same time considering the quasi-dynamic topology in HAP network, a simple and reliable routing protocol is proposed in the paper. The protocol firstly uses a double-candidate strategy for the next-node select to provide better robustness. Then during the maintenance stage, short hello packets instead of long routing packets are used only to check link connectivity in the quasi-dynamic HAP network. The route maintenance scheme based on short hello packets can greatly reduce link spending. Simulation results based on OPNET demonstrate the effectiveness of the proposed routing protocol.

  8. Intelligent routing protocol for ad hoc wireless network

    Science.gov (United States)

    Peng, Chaorong; Chen, Chang Wen

    2006-05-01

    A novel routing scheme for mobile ad hoc networks (MANETs), which combines hybrid and multi-inter-routing path properties with a distributed topology discovery route mechanism using control agents is proposed in this paper. In recent years, a variety of hybrid routing protocols for Mobile Ad hoc wireless networks (MANETs) have been developed. Which is proactively maintains routing information for a local neighborhood, while reactively acquiring routes to destinations beyond the global. The hybrid protocol reduces routing discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the other side the hybrid routing protocols in MANETs likes Zone Routing Protocol still need route "re-discover" time when a route between zones link break. Sine the topology update information needs to be broadcast routing request on local zone. Due to this delay, the routing protocol may not be applicable for real-time data and multimedia communication. We utilize the advantages of a clustering organization and multi-routing path in routing protocol to achieve several goals at the same time. Firstly, IRP efficiently saves network bandwidth and reduces route reconstruction time when a routing path fails. The IRP protocol does not require global periodic routing advertisements, local control agents will automatically monitor and repair broke links. Secondly, it efficiently reduces congestion and traffic "bottlenecks" for ClusterHeads in clustering network. Thirdly, it reduces significant overheads associated with maintaining clusters. Fourthly, it improves clusters stability due to dynamic topology changing frequently. In this paper, we present the Intelligent Routing Protocol. First, we discuss the problem of routing in ad hoc networks and the motivation of IRP. We describe the hierarchical architecture of IRP. We describe the routing process and illustrate it with an example. Further, we describe the control manage

  9. Documentation of the dynamic parameter, water-use, stream and lake flow routing, and two summary output modules and updates to surface-depression storage simulation and initial conditions specification options with the Precipitation-Runoff Modeling System (PRMS)

    Science.gov (United States)

    Regan, R. Steve; LaFontaine, Jacob H.

    2017-10-05

    This report documents seven enhancements to the U.S. Geological Survey (USGS) Precipitation-Runoff Modeling System (PRMS) hydrologic simulation code: two time-series input options, two new output options, and three updates of existing capabilities. The enhancements are (1) new dynamic parameter module, (2) new water-use module, (3) new Hydrologic Response Unit (HRU) summary output module, (4) new basin variables summary output module, (5) new stream and lake flow routing module, (6) update to surface-depression storage and flow simulation, and (7) update to the initial-conditions specification. This report relies heavily upon U.S. Geological Survey Techniques and Methods, book 6, chapter B7, which documents PRMS version 4 (PRMS-IV). A brief description of PRMS is included in this report.

  10. Next Generation Network Routing and Control Plane

    DEFF Research Database (Denmark)

    Fu, Rong

    proved, the dominating Border Gateway Protocol (BGP) cannot address all the issues that in inter-domain QoS routing. Thus a new protocol or network architecture has to be developed to be able to carry the inter-domain traffic with the QoS and TE consideration. Moreover, the current network control also...... (RACF) provides the platform that enables cooperation and ubiquitous integration between networks. In this paper, we investigate in the network architecture, protocols and algorithms for inter-domain QoS routing and traffic engineering. The PCE based inter-domain routing architecture is enhanced...... with Domain Path Vector based protocol that compute the domain level path dynamically for the further inter-domain path routing mechanism Backward Recursive Path Computation (BRPC). Furthermore, several algorithms are proposed to compute the domain-level path under more than one constrains (multi...

  11. Blind deconvolution in multipath environments and extensions to remote source localization

    Science.gov (United States)

    Hossein Abadi, Shima

    In the ocean, the acoustic signal from a remote source recorded by an underwater hydrophone array is commonly distorted by multipath propagation. Blind deconvolution is the task of determining the source signal and the impulse response from array-recorded sounds when the source signal and the environment's impulse response are both unknown. Synthetic time reversal (STR) is a passive blind deconvolution technique that relies on generic features (rays or modes) of multipath sound propagation to accomplish two remote sensing tasks. 1) It can be used to estimate the original source signal and the source-to-array impulse responses, and 2) it can be used to localize the remote source when some information is available about the acoustic environment. The performance of STR for both tasks is considered in this thesis. For the first task, simulations and underwater experiments (CAPEx09) have shown STR to be successful for 50 millisecond chirp signals with a bandwidth of 1.5 to 4.0 kHz broadcast to source-array ranges of 100 m to 500 m in 60-m-deep water. Here STR is successful when the signal-to-noise ratio is high enough, and the receiving array has sufficient aperture and element density so that conventional delay-and-sum beamforming can be used to distinguish ray-path-arrival directions. Also, an unconventional beamforming technique (frequency-difference beamforming) that manufactures frequency differences from the recorded signals has been developed. It allows STR to be successful with sparse array measurements where conventional beamforming fails. Broadband simulations and experimental data from the focused acoustic field experiment (FAF06) have been used to determine the performance of STR when combined with frequency-difference beamforming when the array elements are nearly 40 signal-center-frequency wavelengths apart. The results are good; the cross-correlation coefficient between the source-broadcast and STR-reconstructed-signal waveforms for the simulations and

  12. A study of infrasonic anisotropy and multipathing in the atmosphere using seismic networks.

    Science.gov (United States)

    Hedlin, Michael A H; Walker, Kristoffer T

    2013-02-13

    We discuss the use of reverse time migration (RTM) with dense seismic networks for the detection and location of sources of atmospheric infrasound. Seismometers measure the response of the Earth's surface to infrasound through acoustic-to-seismic coupling. RTM has recently been applied to data from the USArray network to create a catalogue of infrasonic sources in the western US. Specifically, several hundred sources were detected in 2007-2008, many of which were not observed by regional infrasonic arrays. The influence of the east-west stratospheric zonal winds is clearly seen in the seismic data with most detections made downwind of the source. We study this large-scale anisotropy of infrasonic propagation, using a winter and summer source in Idaho. The bandpass-filtered (1-5 Hz) seismic waveforms reveal in detail the two-dimensional spread of the infrasonic wavefield across the Earth's surface within approximately 800 km of the source. Using three-dimensional ray tracing, we find that the stratospheric winds above 30 km altitude in the ground-to-space (G2S) atmospheric model explain well the observed anisotropy pattern. We also analyse infrasound from well-constrained explosions in northern Utah with a denser IRIS PASSCAL seismic network. The standard G2S model correctly predicts the anisotropy of the stratospheric duct, but it incorrectly predicts the dimensions of the shadow zones in the downwind direction. We show that the inclusion of finer-scale structure owing to internal gravity waves infills the shadow zones and predicts the observed time durations of the signals. From the success of this method in predicting the observations, we propose that multipathing owing to fine scale, layer-cake structure is the primary mechanism governing propagation for frequencies above approximately 1 Hz and infer that stochastic approaches incorporating internal gravity waves are a useful improvement to the standard G2S model for infrasonic propagation modelling.

  13. Modeling the effects of Multi-path propagation and scintillation on GPS signals

    Science.gov (United States)

    Habash Krause, L.; Wilson, S. J.

    2014-12-01

    GPS signals traveling through the earth's ionosphere are affected by charged particles that often disrupt the signal and the information it carries due to "scintillation", which resembles an extra noise source on the signal. These signals are also affected by weather changes, tropospheric scattering, and absorption from objects due to multi-path propagation of the signal. These obstacles cause distortion within information and fading of the signal, which ultimately results in phase locking errors and noise in messages. In this work, we attempted to replicate the distortion that occurs in GPS signals using a signal processing simulation model. We wanted to be able to create and identify scintillated signals so we could better understand the environment that caused it to become scintillated. Then, under controlled conditions, we simulated the receiver's ability to suppress scintillation in a signal. We developed a code in MATLAB that was programmed to: 1. Create a carrier wave and then plant noise (four different frequencies) on the carrier wave, 2. Compute a Fourier transform on the four different frequencies to find the frequency content of a signal, 3. Use a filter and apply it to the Fourier transform of the four frequencies and then compute a Signal-to-noise ratio to evaluate the power (in Decibels) of the filtered signal, and 4.Plot each of these components into graphs. To test the code's validity, we used user input and data from an AM transmitter. We determined that the amplitude modulated signal or AM signal would be the best type of signal to test the accuracy of the MATLAB code due to its simplicity. This code is basic to give students the ability to change and use it to determine the environment and effects of noise on different AM signals and their carrier waves. Overall, we were able to manipulate a scenario of a noisy signal and interpret its behavior and change due to its noisy components: amplitude, frequency, and phase shift.

  14. Unambiguous Multipath Mitigation Technique for BOC(n,n and MBOC-Modulated GNSS Signals

    Directory of Open Access Journals (Sweden)

    Khaled Rouabah

    2012-01-01

    Full Text Available We propose an efficient scheme for side peaks cancelation and multipath (MP mitigation in binary offset carrier (n,n (BOC(n,n and multiplexed BOC (MBOC modulated signals. The proposed scheme reduces significantly the band of variation of MP errors in global navigation satellite system (GNSS. It consists of two versions. The first one is based on the use of maximum likelihood estimator (MLE of MP signals and reference correlation functions (CFs like that of pseudorandom noise (PRN code without BOC subcarrier. In the second version, the former (MLE is used with the reference BOC(n,n or MBOC CFs. Unlike traditional BOC(n,n and MBOC, that have CFs containing multiple peaks leading to potential tracking ambiguities, our proposed scheme does not contain any side peaks. In addition, all the MP signals with medium and long delays have no effect on the estimation of the pseudorange. On the other hand, all the methods proposed for mitigating MP in no-BOC scheme are practical for our scheme due to its CF which is similar to that of the PRN code. The computer simulation results show that the proposed scheme has superior performances in the reduction of the errors produced in the process of the delay estimation of line of sight (LOS and caused by MP propagation. In fact, the performances of the proposed scheme are better with regard to that of the traditional BOC(n,n and MBOC. Moreover, in the presence of noise, our proposed scheme keeps better performances than the common side peaks cancelation methods.

  15. Dynamics of virus excretion via different routes in pigs experimentally infected with classical swine fever virus strains of high, moderate or low virulence.

    Science.gov (United States)

    Weesendorp, Eefke; Stegeman, Arjan; Loeffen, Willie

    2009-01-01

    Classical swine fever virus (CSFV) is transmitted via secretions and excretions of infected pigs. The efficiency and speed of the transmission depends on a multitude of parameters, like quantities of virus excreted by infected pigs. This study provides quantitative data on excretion of CSFV over time from pigs infected with a highly, moderately or low virulent strain. For each strain, five individually housed pigs were infected. Virus excretion was quantified in oropharyngeal fluid, saliva, nasal fluid, lacrimal fluid, faeces, urine and skin scraping by virus titration and quantitative Real-Time Reverse Transcription Polymerase Chain Reaction (qRRT-PCR). Infectious virus was excreted in all secretions and excretions of pigs infected with the highly and moderately virulent strain, while excretion from pigs infected with the low virulent strain was mostly restricted to the oronasal route. Pigs infected with the highly virulent strain excreted significantly more virus in all their secretions and excretions over the entire infectious period than pigs infected with the moderately or low virulent strains. An exception were the pigs that developed the chronic form of infection after inoculation with the moderately virulent strain. During the entire infectious period, they excreted the largest amounts of virus via most secretions and excretions, as they excreted virus continuously and for a long duration. This study highlights the crucial role chronically infected pigs may play in the transmission of CSFV. Furthermore, it demonstrates the importance of discriminating between strains and the clinical appearance of infection when using excretion data for modelling.

  16. Understanding individual routing behaviour.

    Science.gov (United States)

    Lima, Antonio; Stanojevic, Rade; Papagiannaki, Dina; Rodriguez, Pablo; González, Marta C

    2016-03-01

    Knowing how individuals move between places is fundamental to advance our understanding of human mobility (González et al. 2008 Nature 453, 779-782. (doi:10.1038/nature06958)), improve our urban infrastructure (Prato 2009 J. Choice Model. 2, 65-100. (doi:10.1016/S1755-5345(13)70005-8)) and drive the development of transportation systems. Current route-choice models that are used in transportation planning are based on the widely accepted assumption that people follow the minimum cost path (Wardrop 1952 Proc. Inst. Civ. Eng. 1, 325-362. (doi:10.1680/ipeds.1952.11362)), despite little empirical support. Fine-grained location traces collected by smart devices give us today an unprecedented opportunity to learn how citizens organize their travel plans into a set of routes, and how similar behaviour patterns emerge among distinct individual choices. Here we study 92 419 anonymized GPS trajectories describing the movement of personal cars over an 18-month period. We group user trips by origin-destination and we find that most drivers use a small number of routes for their routine journeys, and tend to have a preferred route for frequent trips. In contrast to the cost minimization assumption, we also find that a significant fraction of drivers' routes are not optimal. We present a spatial probability distribution that bounds the route selection space within an ellipse, having the origin and the destination as focal points, characterized by high eccentricity independent of the scale. While individual routing choices are not captured by path optimization, their spatial bounds are similar, even for trips performed by distinct individuals and at various scales. These basic discoveries can inform realistic route-choice models that are not based on optimization, having an impact on several applications, such as infrastructure planning, routing recommendation systems and new mobility solutions. © 2016 The Author(s).

  17. A Clustering Routing Protocol for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Jinke Huang

    2016-01-01

    Full Text Available The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both. And as an essential technique of hierarchical routing protocol, clustering of nodes provides an efficient method of establishing a hierarchical structure in mobile ad hoc networks. In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks. Each cluster is composed of a cluster head, several cluster gateway nodes, several cluster guest nodes, and other cluster members. The proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. Simulation results show that the proposed clustering algorithm and hierarchical routing protocol provide superior performance with several advantages over existing clustering algorithm and routing protocol, respectively.

  18. Routes and Stations

    Data.gov (United States)

    Department of Homeland Security — he Routes_Stations table is composed of fixed rail transit systems within the Continental United States, Alaska, Hawaii, the District of Columbia, and Puerto Rico....

  19. Class network routing

    Science.gov (United States)

    Bhanot, Gyan [Princeton, NJ; Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Takken, Todd E [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

    2009-09-08

    Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

  20. Analysis on BDS Satellite Internal Multipath and Its Impact on Wide-lane FCB Estimation

    Directory of Open Access Journals (Sweden)

    RUAN Rengui

    2017-08-01

    Full Text Available To the issue of the satellite internal multipath (SIMP of BeiDou satellites, it proposed and emphasized that the SIMP model should be established as a function of the nadir angle with respect to the observed satellite rather than the elevation of the measurement, so that it can be used for receivers at various altitude. BDS data from global distributed stations operated by the International Monitoring and Assessment System (iGMAS and the Multi-GNSS Experiment (MGEX of the International GNSS Service (IGS are collected and a new SIMP model as a piece-wise linear function of the nadir angle is released for the IGSO-and MEO-satellite groups and for B1, B2 and B3 frequency band individually. The SIMP of GEO,IGSO and MEO satellites is further analyzed with B1/B2 dual-frequency data onboard the FengYun-3 C(FY3C satellite at an altitude of~830 km, and it showed that, for nadir angles smaller than 7°, the SIMP values for GEO is quite close to the IGSO's, especially for B2, which may suggest that the SIMP model for IGSO satellites possibly also works for GEO satellites. It also demonstrated that, when the nadir angle is smaller than 12°for the MEO and 7°for the IGSO, the estimated SIMP model with data from FY3C is considerable consistent with that estimated with data collected at ground stations. Experiments are carried out to investigate the impacts of the SIMP on wide-lane fractional cycle bias (FCB estimation for BDS satellites. The result indicates that, with the correction of the estimated SIMP, the repeatability of the FCB series is significantly improved by more than 60% for all satellites. Specifically, for the MEO and IGSO satellites, the repeatability is smaller than 0.05 cycle; the repeatability of 0.023 and 0.068 cycles achieved for GEO satellites C01 and C02 respectively with the estimated SIMP model for IGSO satellites.

  1. Investigation of Range Profiles from a Simplified Ship on Rough Sea Surface and Its Multipath Imaging Mechanisms

    Directory of Open Access Journals (Sweden)

    Siyuan He

    2012-01-01

    Full Text Available The range profiles of a two-dimension (2 D perfect electric conductor (PEC ship on a wind-driven rough sea surface are derived by performing an inverse discrete Fourier transform (IDFT on the wide band backscattered field. The rough sea surface is assuming to be a PEC surface. The back scattered field is computed based on EM numerical simulation when the frequencies are sampled between 100 MHz and 700 MHz. Considering the strong coupling interactions between the ship and sea, the complicated multipath effect to the range profile characteristics is fully analyzed based on the multipath imaging mechanisms. The coupling mechanisms could be explained by means of ray theory prediction and numerical extraction of the coupling currents. The comparison of the range profile locations between ray theory prediction and surface current simulation is implemented and analyzed in this paper. Finally, the influence of different sea states on the radar target signatures has been examined and discussed.

  2. Space-Time Joint Interference Cancellation Using Fuzzy-Inference-Based Adaptive Filtering Techniques in Frequency-Selective Multipath Channels

    Directory of Open Access Journals (Sweden)

    Chen Yu-Fan

    2006-01-01

    Full Text Available An adaptive minimum mean-square error (MMSE array receiver based on the fuzzy-logic recursive least-squares (RLS algorithm is developed for asynchronous DS-CDMA interference suppression in the presence of frequency-selective multipath fading. This receiver employs a fuzzy-logic control mechanism to perform the nonlinear mapping of the squared error and squared error variation, denoted by ( , , into a forgetting factor . For the real-time applicability, a computationally efficient version of the proposed receiver is derived based on the least-mean-square (LMS algorithm using the fuzzy-inference-controlled step-size . This receiver is capable of providing both fast convergence/tracking capability as well as small steady-state misadjustment as compared with conventional LMS- and RLS-based MMSE DS-CDMA receivers. Simulations show that the fuzzy-logic LMS and RLS algorithms outperform, respectively, other variable step-size LMS (VSS-LMS and variable forgetting factor RLS (VFF-RLS algorithms at least 3 dB and 1.5 dB in bit-error-rate (BER for multipath fading channels.

  3. A Robust Sparse Adaptive Filtering Algorithm with a Correntropy Induced Metric Constraint for Broadband Multi-Path Channel Estimation

    Directory of Open Access Journals (Sweden)

    Yingsong Li

    2016-10-01

    Full Text Available A robust sparse least-mean mixture-norm (LMMN algorithm is proposed, and its performance is appraised in the context of estimating a broadband multi-path wireless channel. The proposed algorithm is implemented via integrating a correntropy-induced metric (CIM penalty into the conventional LMMN algorithm to modify the basic cost function, which is denoted as the CIM-based LMMN (CIM-LMMN algorithm. The proposed CIM-LMMN algorithm is derived in detail within the kernel framework. The updating equation of CIM-LMMN can provide a zero attractor to attract the non-dominant channel coefficients to zeros, and it also gives a tradeoff between the sparsity and the estimation misalignment. Moreover, the channel estimation behavior is investigated over a broadband sparse multi-path wireless channel, and the simulation results are compared with the least mean square/fourth (LMS/F, least mean square (LMS, least mean fourth (LMF and the recently-developed sparse channel estimation algorithms. The channel estimation performance obtained from the designated sparse channel estimation demonstrates that the CIM-LMMN algorithm outperforms the recently-developed sparse LMMN algorithms and the relevant sparse channel estimation algorithms. From the results, we can see that our CIM-LMMN algorithm is robust and is superior to these mentioned algorithms in terms of both the convergence speed rate and the channel estimation misalignment for estimating a sparse channel.

  4. Bellman – Ford Method for Solving the Optimal Route Problem

    Directory of Open Access Journals (Sweden)

    Laima Greičiūnė

    2014-12-01

    Full Text Available The article aims to adapt the dynamic programming method for optimal route determination using real-time data on ITS equipment. For this purpose, VBA code has been applied for solving the Bellman - Ford method for an optimal route considering optimality criteria for time, distance and the amount of emissions.

  5. Use of Cold Gas Dynamic Spraying of bi-metallic powder mixtures as alternative to classic powder metallurgy route for producing intermetallic materials

    Directory of Open Access Journals (Sweden)

    Vit Jan

    2016-06-01

    Full Text Available The paper presents cold gas dynamic spraying (or Cold Spray as a novel surface treatment technology capable not only of surface modifications but also being used as bulk creating technology. This is demonstrated on numerous samples where bi-metallic powder feedstock is deposited into bulk, self-standing pieces of material that does not need the support of substrate. Mixtures from the group of Fe, Al, Ti, Ni, Cu were used for the initial bi-metallic mixtures. The deposited samples were then subjected to annealing at temperatures ranging from 300 to 1100°C in protective atmosphere and resulting morphologies and microstructures were analysed. Generally materials with high proportion of intermetallic phase content were obtained. These are discussed as potential scaffolds for metal or polymer matrix composites or as hi temperature resistive supports for catalysts with filter functions.

  6. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence......In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last...... couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company...

  7. Collective network routing

    Science.gov (United States)

    Hoenicke, Dirk

    2014-12-02

    Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

  8. Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy

    Science.gov (United States)

    Jiang, Zhong-Yuan; Ma, Jian-Feng; Jing, Xu

    2015-03-01

    Based on the consideration of easy implementation of new routing strategies on many real complex networks such as the Internet, we propose a hybrid routing mechanism composed of the shortest path routing and the global dynamic routing strategy to improve the network traffic capacity. Under the background of current routing policy and network structure, packets can be sent along the shortest paths or by using source routing information. In this work, a global dynamic source routing strategy is employed as a supplementary routing mechanism to bypass central nodes and increase the delivery capacity utilization of all nodes significantly in the network. The traffic capacity of networked complex systems can be enhanced tens of times at the cost of a little average path lengthening. This hybrid routing method is very useful to network service providers and can be constitutionally supported on several networked complex systems such as the Internet and wireless ad hoc networks.

  9. A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Gaurantees

    Directory of Open Access Journals (Sweden)

    Srinivasan Murali

    2007-01-01

    Full Text Available Networks on Chips (NoCs are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today's NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in the network is reduced significantly, which translates to improved network performance or reduced network bandwidth requirements and power consumption. Multiple paths can also be utilized to achieve spatial redundancy, which helps in achieving tolerance against faults or errors in the NoC. A major problem with multipath routing is that packets can reach the destination in an out-of-order fashion, while many applications require in-order packet delivery. In this work, we present a multipath routing strategy that guarantees in-order packet delivery for NoCs. It is based on the idea of routing packets on partially nonintersecting paths and rebuilding packet order at path reconvergent nodes. We present a design methodology that uses the routing strategy to optimally spread the traffic in the NoC to minimize the network bandwidth needs and power consumption. We also integrate support for tolerance against transient and permanent failures in the NoC links in the methodology by utilizing spatial and temporal redundancy for transporting packets. Our experimental studies show large reduction in network bandwidth requirements (36.86% on average and power consumption (30.51% on average compared to single-path systems. The area overhead of the proposed scheme is small (a modest 5% increase in network area. Hence, it is practical to be used in the on-chip domain.

  10. QoS routing via multiple paths using bandwidth reservation

    Energy Technology Data Exchange (ETDEWEB)

    Rao, N.S.V.; Batsell, S.G.

    1997-11-01

    The authors address the problem of computing a multipath, consisting of possibly overlapping paths, to transmit data from the source node s to the destination node d over a computer network while ensuring deterministic bounds on end-to-end delay or delivery rate. They consider two generic routing problems within the framework wherein bandwidth can be reserved, and guaranteed, once reserved, on various links of the communication network. The first problem requires that a message of finite length be transmitted from s to d within {tau} units of time. The second problem requires that a sequential message of r units be transmitted at a rate of {eta} such that maximum time difference between two units that are received out of order is no more than q. They propose a polynomial-time algorithm to the first problem based on an adaptation of the classical Ford-Fulkerson`s method. They present simulation results to illustrate the applicability of the proposed algorithm. They show the second problem to be NP-complete and propose a polynomial-time approximate solution.

  11. QoS routing via multiple paths using bandwidth reservation

    Energy Technology Data Exchange (ETDEWEB)

    Rao, N.S.V.; Batsell, S.G.

    1998-01-01

    The authors address the problem of computing a multipath, consisting of possibly overlapping paths, to transmit data from the source node s to the destination node d over a computer network while ensuring deterministic bounds on end-to-end delay or delivery rate.They consider two generic routing problems within the framework wherein bandwidth can be reserved, and guaranteed, once reserved, on various links of the communication network. The first problem requires that a message of finite length be transmitted from s to d within {tau} units of time. The second problem requires that a sequential message of r units be transmitted at a rate of {eta} such that maximum time difference between two units that are received out of order is no more than q. They propose a polynomial-time algorithm to the first problem based on an adaptation of the classical Ford-Fulkerson`s method. They present simulation results to illustrate the applicability of the proposed algorithm. They show the second problem to be NP-complete, and propose a polynomial-time approximately solution.

  12. Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mann Raminder P

    2005-01-01

    Full Text Available Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.

  13. COSR: A Reputation-Based Secure Route Protocol in MANET

    Directory of Open Access Journals (Sweden)

    Yang LaurenceT

    2010-01-01

    Full Text Available Now, the route protocols defined in the Mobile Ad Hoc Network (MANET are constructed in a common assumption which all nodes contained in such networks are trustworthy and cooperative. Once malicious or selfish nodes exist, all route paths built by these protocols must be broken immediately. According to the secure problems within MANET, this paper proposes Cooperative On-demand Secure Route (COSR, a novel secure source route protocol, against malicious and selfish behaviors. COSR measures node reputation (NR and route reputation (RR by contribution, Capability of Forwarding (CoF and recommendation upon Dynamic Source Route (DSR and uses RR to balance load to avoid hotpoint. Furthermore, COSR defines path collection algorithm by NR to enhance efficiency of protocol. At last, we verify COSR through GloMoSim. Results show that COSR is secure and stable.

  14. Routing Optimization of Intelligent Vehicle in Automated Warehouse

    Directory of Open Access Journals (Sweden)

    Yan-cong Zhou

    2014-01-01

    Full Text Available Routing optimization is a key technology in the intelligent warehouse logistics. In order to get an optimal route for warehouse intelligent vehicle, routing optimization in complex global dynamic environment is studied. A new evolutionary ant colony algorithm based on RFID and knowledge-refinement is proposed. The new algorithm gets environmental information timely through the RFID technology and updates the environment map at the same time. It adopts elite ant kept, fallback, and pheromones limitation adjustment strategy. The current optimal route in population space is optimized based on experiential knowledge. The experimental results show that the new algorithm has higher convergence speed and can jump out the U-type or V-type obstacle traps easily. It can also find the global optimal route or approximate optimal one with higher probability in the complex dynamic environment. The new algorithm is proved feasible and effective by simulation results.

  15. Whirlpool routing for mobility

    KAUST Repository

    Lee, Jung Woo

    2010-01-01

    We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP\\'s design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP\\'s behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP\\'s packet drop rate is up to 90% lower while sending up to 90% fewer packets.

  16. Reliable Internet Routing

    Science.gov (United States)

    2011-09-01

    subprefixes. We refer to this attack as sub-prefix hijacking. 66 There are other variants of prefix hijacking, such as wormhole [49] attacks. Wormhole attacks...are a countermeasure the adversary can employ against secure routing protocols. Wormhole attacks are not discussed in this chapter because in our

  17. SET-Routes programme

    CERN Multimedia

    Marietta Schupp, EMBL Photolab

    2008-01-01

    Dr Sabine Hentze, specialist in human genetics, giving an Insight Lecture entitled "Human Genetics – Diagnostics, Indications and Ethical Issues" on 23 September 2008 at EMBL Heidelberg. Activities in a achool in Budapest during a visit of Angela Bekesi, Ambassadors for the SET-Routes programme.

  18. A routing protocol based on energy and link quality for Internet of Things applications.

    Science.gov (United States)

    Machado, Kássio; Rosário, Denis; Cerqueira, Eduardo; Loureiro, Antonio A F; Neto, Augusto; Souza, José Neuman de

    2013-02-04

    The Internet of Things (IoT) is attracting considerable attention from the universities, industries, citizens and governments for applications, such as healthcare, environmental monitoring and smart buildings. IoT enables network connectivity between smart devices at all times, everywhere, and about everything. In this context, Wireless Sensor Networks (WSNs) play an important role in increasing the ubiquity of networks with smart devices that are low-cost and easy to deploy. However, sensor nodes are restricted in terms of energy, processing and memory. Additionally, low-power radios are very sensitive to noise, interference and multipath distortions. In this context, this article proposes a routing protocol based on Routing by Energy and Link quality (REL) for IoT applications. To increase reliability and energy-efficiency, REL selects routes on the basis of a proposed end-to-end link quality estimator mechanism, residual energy and hop count. Furthermore, REL proposes an event-driven mechanism to provide load balancing and avoid the premature energy depletion of nodes/networks. Performance evaluations were carried out using simulation and testbed experiments to show the impact and benefits of REL in small and large-scale networks. The results show that REL increases the network lifetime and services availability, as well as the quality of service of IoT applications. It also provides an even distribution of scarce network resources and reduces the packet loss rate, compared with the performance of well-known protocols.

  19. A Routing Protocol Based on Energy and Link Quality for Internet of Things Applications

    Directory of Open Access Journals (Sweden)

    Antonio A. F. Loureiro

    2013-02-01

    Full Text Available The Internet of Things (IoT is attracting considerable attention from the universities, industries, citizens and governments for applications, such as healthcare, environmental monitoring and smart buildings. IoT enables network connectivity between smart devices at all times, everywhere, and about everything. In this context, Wireless Sensor Networks (WSNs play an important role in increasing the ubiquity of networks with smart devices that are low-cost and easy to deploy. However, sensor nodes are restricted in terms of energy, processing and memory. Additionally, low-power radios are very sensitive to noise, interference and multipath distortions. In this context, this article proposes a routing protocol based on Routing by Energy and Link quality (REL for IoT applications. To increase reliability and energy-efficiency, REL selects routes on the basis of a proposed end-to-end link quality estimator mechanism, residual energy and hop count. Furthermore, REL proposes an event-driven mechanism to provide load balancing and avoid the premature energy depletion of nodes/networks. Performance evaluations were carried out using simulation and testbed experiments to show the impact and benefits of REL in small and large-scale networks. The results show that REL increases the network lifetime and services availability, as well as the quality of service of IoT applications. It also provides an even distribution of scarce network resources and reduces the packet loss rate, compared with the performance of well-known protocols.

  20. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath; Saket, Rishi

    2012-01-01

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand inst...

  1. Robustness of airline route networks

    Science.gov (United States)

    Lordan, Oriol; Sallan, Jose M.; Escorihuela, Nuria; Gonzalez-Prieto, David

    2016-03-01

    Airlines shape their route network by defining their routes through supply and demand considerations, paying little attention to network performance indicators, such as network robustness. However, the collapse of an airline network can produce high financial costs for the airline and all its geographical area of influence. The aim of this study is to analyze the topology and robustness of the network route of airlines following Low Cost Carriers (LCCs) and Full Service Carriers (FSCs) business models. Results show that FSC hubs are more central than LCC bases in their route network. As a result, LCC route networks are more robust than FSC networks.

  2. Multi-Path OD-Matrix Estimation (MPME) based on Stochastic User Equilibrium Traffic Assignment

    DEFF Research Database (Denmark)

    Nielsen, Otto Anker

    1997-01-01

    Most conventional methods for estimating trip matrices from traffic counts assume either that the counts are error-free, determin-istic variables or they use a simplified traffic assignment model. Without these assumptions, the methods often demand prohibitive calculation times. The paper presents...... a matrix-estimation method, 'Multiple Path Matrix Estimation' (MPME), that is able to handle traffic counts with inconsistencies and uncertainties. In addition, the matrix reflects the route choice patterns given by traffic assignment models following the Method of Successive Averages (MSA). Actually...... million inhabitants). In all cases, the method gave lower deviations between traffic counts and estimated traffic than other tested methods. The method converged smoothly within calculation times of a few hours....

  3. Research on routing algorithm based on the VANET

    Directory of Open Access Journals (Sweden)

    AN Li

    2016-01-01

    Full Text Available For the characteristics of high speed mobility of nodes, frequent changes of dynamic topology and frequent interrupts of the communication links in the VANET, this paper analyzed the defect of the current mobile ad-hoc network routing protocol, and carried on the simulation analysis on the adaptability of AODV, DSR and DSDV routing protocols in VANET applications in the VANET. Through the above research, this paper obtained the conclusion that the AODV routing protocol is more suitable for vehicular ad hoc network environment

  4. Improving routing efficiency through intermediate target based geographic routing

    Directory of Open Access Journals (Sweden)

    Zongming Fei

    2015-08-01

    Full Text Available The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR to solve the long detour path problem. The basic idea is to use previous experience to determine the destination areas that are shaded by the holes. The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes. We design an efficient method for the source to find out whether a destination node belongs to a shaded area. The source then selects an intermediate node as the tentative target and greedily forwards packets to it, which in turn forwards the packet to the final destination by greedy routing. ITGR can combine multiple shaded areas to improve the efficiency of representation and routing. We perform simulations and demonstrate that ITGR significantly reduces the routing path length, compared with existing geographic routing protocols.

  5. An overview of smart grid routing algorithms

    Science.gov (United States)

    Wang, Junsheng; OU, Qinghai; Shen, Haijuan

    2017-08-01

    This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.

  6. Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

    Science.gov (United States)

    Segui, John S.; Jennings, Esther H.; Clare, Loren P.

    2013-01-01

    Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

  7. A Critical Review of Surveys Emphasizing on Routing in Wireless Sensor Networks-An Anatomization under General Survey Design Framework.

    Science.gov (United States)

    Rehan, Waqas; Fischer, Stefan; Rehan, Maaz

    2017-07-26

    A large number of routing-related surveys are published so far for Wireless Sensor Networks (WSNs) that exhibit either complete or partial emphasis on routing in WSNs. These surveys classify and discuss the relevant routing protocols published mainly in the fields of classical, energy efficient, secure, hierarchical, geographic, intelligent, Quality of Service (QoS)-based and multipath WSNs. However, to the best of our knowledge, no study is presented so far which may clearly categorize the routing-related survey literature for WSNs.To fill this gap, an effort is made in this paper for presenting an in-depth review of already published routing-related survey literature in WSNs. Our review initially proposes a generalized survey design model and afterwards analyzes the routing-related survey literature in the light of the devised General Survey Design Framework (GSDF) . Such an analysis describes the design soundness of the published routing-related surveys. Therefore, our review puts forth an original classification based on the frequency-of-survey-publication and taxonomizes the corresponding routing-related fields into high, medium and low focused areas of survey publication in WSNs. Furthermore, the surveys belonging to each main category are sub-categorized into various sub-classes and briefly discussed according to their design characteristics. On the one hand, this review is useful for beginners who may easily explore the already published routing-related survey literature in WSNs in a single document and investigate it by spending less effort. On the other hand, it is useful for expert researchers who may explore the trends and frequency of writing surveys in different areas of routing in WSNs. The experts may explore those areas of routing which are either neglected or least focused or lack in design soundness as per general survey design framework. In the end, insights and future research directions are outlined and a reasonable conclusion is put forth

  8. Vertex routing models

    International Nuclear Information System (INIS)

    Markovic, D; Gros, C

    2009-01-01

    A class of models describing the flow of information within networks via routing processes is proposed and investigated, concentrating on the effects of memory traces on the global properties. The long-term flow of information is governed by cyclic attractors, allowing to define a measure for the information centrality of a vertex given by the number of attractors passing through this vertex. We find the number of vertices having a nonzero information centrality to be extensive/subextensive for models with/without a memory trace in the thermodynamic limit. We evaluate the distribution of the number of cycles, of the cycle length and of the maximal basins of attraction, finding a complete scaling collapse in the thermodynamic limit for the latter. Possible implications of our results for the information flow in social networks are discussed.

  9. Chloroacetone photodissociation at 193 nm and the subsequent dynamics of the CH3C(O)CH2 radical--an intermediate formed in the OH + allene reaction en route to CH3 + ketene.

    Science.gov (United States)

    Alligood, Bridget W; FitzPatrick, Benjamin L; Szpunar, David E; Butler, Laurie J

    2011-02-07

    We use a combination of crossed laser-molecular beam experiments and velocity map imaging experiments to investigate the primary photofission channels of chloroacetone at 193 nm; we also probe the dissociation dynamics of the nascent CH(3)C(O)CH(2) radicals formed from C-Cl bond fission. In addition to the C-Cl bond fission primary photodissociation channel, the data evidence another photodissociation channel of the precursor, C-C bond fission to produce CH(3)CO and CH(2)Cl. The CH(3)C(O)CH(2) radical formed from C-Cl bond fission is one of the intermediates in the OH + allene reaction en route to CH(3) + ketene. The 193 nm photodissociation laser allows us to produce these CH(3)C(O)CH(2) radicals with enough internal energy to span the dissociation barrier leading to the CH(3) + ketene asymptote. Therefore, some of the vibrationally excited CH(3)C(O)CH(2) radicals undergo subsequent dissociation to CH(3) + ketene products; we are able to measure the velocities of these products using both the imaging and scattering apparatuses. The results rule out the presence of a significant contribution from a C-C bond photofission channel that produces CH(3) and COCH(2)Cl fragments. The CH(3)C(O)CH(2) radicals are formed with a considerable amount of energy partitioned into rotation; we use an impulsive model to explicitly characterize the internal energy distribution. The data are better fit by using the C-Cl bond fission transition state on the S(1) surface of chloroacetone as the geometry at which the impulsive force acts, not the Franck-Condon geometry. Our data suggest that, even under atmospheric conditions, the reaction of OH with allene could produce a small branching to CH(3) + ketene products, rather than solely producing inelastically stabilized adducts. This additional channel offers a different pathway for the OH-initiated oxidation of such unsaturated volatile organic compounds, those containing a C=C=C moiety, than is currently included in atmospheric models.

  10. Performance Analysis of DTN Using Level Signal Priority Epidemic Routing Protocol

    Directory of Open Access Journals (Sweden)

    Ahmad Zainudin

    2016-04-01

    Full Text Available A DTN architecture consists of several nodes that are connected with high dynamic topology. The routing protocol is an important part which determine the DTN performance system. Although DTN is addressed to be tolerant of delay, a routing protocol with better performance will maximizing packet delivery rate and minimizing the delivery latency. This paper evaluate a level signal priority epidemic routing protocol for delay tolerant network architecture. Our system adopts DTN2 framework using classic epidemic and priority epidemic dynamic routing protocols. The performance of both dynamic routing is observed and compared based on throughput and delay of transmitted data. The measurement results show that the classic epidemic use more bandwith due to sending the same messages many times. The delay transmission using a level signal priority epidemic routing is smaller than classic epidemic routing protocol in all hops of the test-bed. Epidemic based on signal level routing could make traffic of network more efficient than classic Epidemic routing because of filtering system in node before sending bundle to neighbor node. Keywords: DTN, dynamic routing, level signal priority

  11. An Adaptive Channel Estimation Algorithm Using Time-Frequency Polynomial Model for OFDM with Fading Multipath Channels

    Directory of Open Access Journals (Sweden)

    Liu KJ Ray

    2002-01-01

    Full Text Available Orthogonal frequency division multiplexing (OFDM is an effective technique for the future 3G communications because of its great immunity to impulse noise and intersymbol interference. The channel estimation is a crucial aspect in the design of OFDM systems. In this work, we propose a channel estimation algorithm based on a time-frequency polynomial model of the fading multipath channels. The algorithm exploits the correlation of the channel responses in both time and frequency domains and hence reduce more noise than the methods using only time or frequency polynomial model. The estimator is also more robust compared to the existing methods based on Fourier transform. The simulation shows that it has more than improvement in terms of mean-squared estimation error under some practical channel conditions. The algorithm needs little prior knowledge about the delay and fading properties of the channel. The algorithm can be implemented recursively and can adjust itself to follow the variation of the channel statistics.

  12. A multi-path gated ring oscillator based time-to-digital converter in 65 nm CMOS technology

    Science.gov (United States)

    Chen, Jiang; Yumei, Huang; Zhiliang, Hong

    2013-03-01

    A gated ring oscillator (GRO) based time-to-digital converter (TDC) is presented. To enhance the resolution of the TDC, a multi-path structure for the GRO is used to achieve a higher oscillation frequency and an input stage is also presented to equivalently amplify the input time difference with a gain of 2. The GRO based TDC circuit is fabricated in TSMC 65 nm CMOS technology and the core area is about 0.02 mm2. According to the measurement results, the effective resolution of this circuit is better than 4.22 ps under a 50 MHz clock frequency. With a 1 ns input range, the maximum clock frequency of this circuit is larger than 200 MHz. Under a 1 V power supply, with a 200-800 ps input time difference, the measured power consumption is 1.24 to 1.72 mW at 50 MHz clock frequency and 1.73 to 2.20 mW at 200 MHz clock frequency.

  13. Fundamental lifetime mechanisms in routing protocols for wireless sensor networks: a survey and open issues.

    Science.gov (United States)

    Eslaminejad, Mohammadreza; Razak, Shukor Abd

    2012-10-09

    Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues.

  14. The future of route survey?

    NARCIS (Netherlands)

    Burger, H.H.; Groot, T. de

    1995-01-01

    Several NATO Navies carry out route survey operations as a peace time operation aimed to improve the MCM efficiency in times of crisis or war. The main result of route survey operations is information about the environmental conditions of an area, and about the mine like contacts present in the

  15. Perception bias in route choice

    NARCIS (Netherlands)

    Vreeswijk, Jacob Dirk; Thomas, Tom; van Berkum, Eric C.; van Arem, Bart

    2014-01-01

    Travel time is probably one of the most studied attributes in route choice. Recently, perception of travel time received more attention as several studies have shown its importance in explaining route choice behavior. In particular, travel time estimates by travelers appear to be biased against non-

  16. Perception bias in route choice

    NARCIS (Netherlands)

    Vreeswijk, Jacob Dirk; Thomas, Tom; van Berkum, Eric C.; van Arem, Bart

    2014-01-01

    Travel time is probably one of the most studied attributes in route choice. Recently, perception of travel time received more attention as several studies have shown its importance in explaining route choice behavior. In particular, travel time estimates by travelers appear to be biased against

  17. On the Performance of the Current MANET Routing Protocols for VoIP, HTTP, and FTP Applications

    Directory of Open Access Journals (Sweden)

    Waheb A. Jabbar

    2014-01-01

    Full Text Available The recent advances of ensemble mobile environment of smart devices with embedded sensors have enabled the MANET to play a key role in the smart cities as well as WSN and WMN. However, these smart devices are still limited in terms of energy, processor, and memory. Moreover, the efficient routing for reliable network connectivity at anytime, anywhere, and about everything is still a challenge in multihop wireless networks. This paper evaluates the QoS and energy efficiency of three active routing protocols: (i OLSRv2, a successor to OLSR, (ii DYMO, a successor to both DSR and AODV, and (iii MP-OLSR multipath extension to OLSRv2. In contrast to the related previous works which focused only on CBR traffic without considering the influence of specific traffic types on the performance of routing protocols, this work focused on this area from a different perspective. It evaluates the performance of three internet-based traffic types that can be used in the smart city applications: VoIP, HTTP, and FTP using different simulation models. The impact of the network density, load traffic, and nodes mobility on the considered protocols was evaluated by considering particular performance metrics for each traffic application. Based on the results, the study concludes by presenting useful recommendations for future work.

  18. Automated linear regression tools improve RSSI WSN localization in multipath indoor environment

    Directory of Open Access Journals (Sweden)

    Laermans Eric

    2011-01-01

    Full Text Available Abstract Received signal strength indication (RSSI-based localization is emerging in wireless sensor networks (WSNs. Localization algorithms need to include the physical and hardware limitations of RSSI measurements in order to give more accurate results in dynamic real-life indoor environments. In this study, we use the Interdisciplinary Institute for Broadband Technology real-life test bed and present an automated method to optimize and calibrate the experimental data before offering them to a positioning engine. In a preprocessing localization step, we introduce a new method to provide bounds for the range, thereby further improving the accuracy of our simple and fast 2D localization algorithm based on corrected distance circles. A maximum likelihood algorithm with a mean square error cost function has a higher position error median than our algorithm. Our experiments further show that the complete proposed algorithm eliminates outliers and avoids any manual calibration procedure.

  19. Route around real time

    International Nuclear Information System (INIS)

    Terrier, Francois

    1996-01-01

    The greater and greater autonomy and complexity asked to the control and command systems lead to work on introducing techniques such as Artificial Intelligence or concurrent object programming in industrial applications. However, while the critical feature of these systems impose to control the dynamics of the proposed solutions, their complexity often imposes a high adaptability to a partially modelled environment. The studies presented start from low level control and command systems to more complex applications at higher levels, such as 'supervision systems'. Techniques such as temporal reasoning and uncertainty management are proposed for the first studies, while the second are tackled with programming techniques based on the real time object paradigm. The outcomes of this itinerary crystallize on the ACCORD project which targets to manage - on the whole life cycle of a real time application - these two problematics, sometimes antagonistic: control of the dynamics and adaptivity. (author) [fr

  20. Congestion control and routing over satellite networks

    Science.gov (United States)

    Cao, Jinhua

    Satellite networks and transmissions find their application in fields of computer communications, telephone communications, television broadcasting, transportation, space situational awareness systems and so on. This thesis mainly focuses on two networking issues affecting satellite networking: network congestion control and network routing optimization. Congestion, which leads to long queueing delays, packet losses or both, is a networking problem that has drawn the attention of many researchers. The goal of congestion control mechanisms is to ensure high bandwidth utilization while avoiding network congestion by regulating the rate at which traffic sources inject packets into a network. In this thesis, we propose a stable congestion controller using data-driven, safe switching control theory to improve the dynamic performance of satellite Transmission Control Protocol/Active Queue Management (TCP/AQM) networks. First, the stable region of the Proportional-Integral (PI) parameters for a nominal model is explored. Then, a PI controller, whose parameters are adaptively tuned by switching among members of a given candidate set, using observed plant data, is presented and compared with some classical AQM policy examples, such as Random Early Detection (RED) and fixed PI control. A new cost detectable switching law with an interval cost function switching algorithm, which improves the performance and also saves the computational cost, is developed and compared with a law commonly used in the switching control literature. Finite-gain stability of the system is proved. A fuzzy logic PI controller is incorporated as a special candidate to achieve good performance at all nominal points with the available set of candidate controllers. Simulations are presented to validate the theory. An effocient routing algorithm plays a key role in optimizing network resources. In this thesis, we briefly analyze Low Earth Orbit (LEO) satellite networks, review the Cross Entropy (CE

  1. Road Routes for Waste Disposal - MDC_RecyclingRoute

    Data.gov (United States)

    NSGIC Local Govt | GIS Inventory — This CURBSIDE RECYCLING ROUTES BOUNDARIES LAYER IS A polygon feature class created for the Miami-Dade Department of Solid Waste Management (DSWM). It contains the...

  2. Pheromone based alternative route planning

    Directory of Open Access Journals (Sweden)

    Liangbing Feng

    2016-08-01

    Full Text Available In this work, we propose an improved alternative route calculation based on alternative figures, which is suitable for practical environments. The improvement is based on the fact that the main traffic route is the road network skeleton in a city. Our approach using nodes may generate a higher possibility of overlapping. We employ a bidirectional Dijkstra algorithm to search the route. To measure the quality of an Alternative Figures (AG, three quotas are proposed. The experiment results indicate that the improved algorithm proposed in this paper is more effective than others.

  3. Port Authority of Allegheny County Transit Routes

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Shapefile of Transit Routes - Please refer to each resource for active dates of the route information. Routes change over time,

  4. Predicting Catastrophic BGP Routing Instabilities

    National Research Council Canada - National Science Library

    Nguyen, Lien

    2004-01-01

    .... Currently, this critical function is performed by the Border Gateway Protocol (BGP) version 4 RF01771. Like all routing protocols, BGP is vulnerable to instabilities that reduce its effectiveness...

  5. Provisioning of adaptability to variable topologies for routing schemes in MANETs

    DEFF Research Database (Denmark)

    Jiang, Shengming; Liu, Yaoda; Jiang, Yuming

    2004-01-01

    Frequent changes in network topologies caused by mobility in. mobile ad hoc networks (MANETs) impose great challenges to designing routing schemes for such networks. Various routing schemes each aiming at particular type of MANET (e.g., flat or clustered. MANETs) with different mobility degrees (e...... in the dynamic source routing protocol to provide the adaptability to variable topologies caused by mobility through computer simulation in NS-2....

  6. New TPG bus route 28

    CERN Multimedia

    2003-01-01

    Geneva's Public Transport services (TPG) have recently inaugurated a new bus line 28, connecting the La Tour Hospital in Meyrin to the international organisations in Geneva, via the airport. All signs associated with this route will be yellow in colour. Timetables and route details can be found at http://www.tpg.ch. Relations with the Host States Service http://www.cern.ch/relations/ Tel. 72848

  7. Day-to-day route choice modeling incorporating inertial behavior

    NARCIS (Netherlands)

    van Essen, Mariska Alice; Rakha, H.; Vreeswijk, Jacob Dirk; Wismans, Luc Johannes Josephus; van Berkum, Eric C.

    2015-01-01

    Accurate route choice modeling is one of the most important aspects when predicting the effects of transport policy and dynamic traffic management. Moreover, the effectiveness of intervention measures to a large extent depends on travelers’ response to the changes these measures cause. As a

  8. Quality-constrained routing in publish/subscribe systems

    NARCIS (Netherlands)

    Zieba, Bogumil; van Sinderen, Marten J.; Wegdam, M.

    2005-01-01

    Routing in publish/subscribe (pub/sub) features a communication model where messages are not given explicit destination addresses, but destinations are determined by matching the subscription declared by subscribers. For a dynamic computing environment with applications that have quality demands,

  9. An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

    Directory of Open Access Journals (Sweden)

    Guilin Zheng

    2011-03-01

    Full Text Available Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.

  10. An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

    Directory of Open Access Journals (Sweden)

    Yuanyuan Zeng

    2010-06-01

    Full Text Available Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.

  11. Dynamics

    CERN Document Server

    Goodman, Lawrence E

    2001-01-01

    Beginning text presents complete theoretical treatment of mechanical model systems and deals with technological applications. Topics include introduction to calculus of vectors, particle motion, dynamics of particle systems and plane rigid bodies, technical applications in plane motions, theory of mechanical vibrations, and more. Exercises and answers appear in each chapter.

  12. Routes to embodiment.

    Science.gov (United States)

    Körner, Anita; Topolinski, Sascha; Strack, Fritz

    2015-01-01

    Research on embodiment is rich in impressive demonstrations but somewhat poor in comprehensive explanations. Although some moderators and driving mechanisms have been identified, a comprehensive conceptual account of how bodily states or dynamics influence behavior is still missing. Here, we attempt to integrate current knowledge by describing three basic psychological mechanisms: direct state induction, which influences how humans feel or process information, unmediated by any other cognitive mechanism; modal priming, which changes the accessibility of concepts associated with a bodily state; sensorimotor simulation, which affects the ease with which congruent and incongruent actions are performed. We argue that the joint impact of these mechanisms can account for most existing embodiment effects. Additionally, we summarize empirical tests for distinguishing these mechanisms and suggest a guideline for future research about the mechanisms underlying embodiment effects.

  13. Antnet: A Robust Routing Algorithm for Data Networks

    Directory of Open Access Journals (Sweden)

    Shariq Haseeb Khairul Azami Sidek Ahmad Faris Ismail, Lai W.K.

    2012-10-01

    Full Text Available Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth.  AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0 has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future.Key Words: mobile agents, swarm intelligence, networks and constant bit rate

  14. Selective epidemic vaccination under the performant routing algorithms

    Science.gov (United States)

    Bamaarouf, O.; Alweimine, A. Ould Baba; Rachadi, A.; EZ-Zahraouy, H.

    2018-04-01

    Despite the extensive research on traffic dynamics and epidemic spreading, the effect of the routing algorithms strategies on the traffic-driven epidemic spreading has not received an adequate attention. It is well known that more performant routing algorithm strategies are used to overcome the congestion problem. However, our main result shows unexpectedly that these algorithms favor the virus spreading more than the case where the shortest path based algorithm is used. In this work, we studied the virus spreading in a complex network using the efficient path and the global dynamic routing algorithms as compared to shortest path strategy. Some previous studies have tried to modify the routing rules to limit the virus spreading, but at the expense of reducing the traffic transport efficiency. This work proposed a solution to overcome this drawback by using a selective vaccination procedure instead of a random vaccination used often in the literature. We found that the selective vaccination succeeded in eradicating the virus better than a pure random intervention for the performant routing algorithm strategies.

  15. Routing strategy including time and carbon dioxide emissions : effects on network performance

    NARCIS (Netherlands)

    Zhang, Fan; Chen, Y.; Goni Ros, B.; GAO, Jian; Knoop, V.L.

    2016-01-01

    Traffic congestion leads to delays and increased carbon dioxide (CO2) emissions. Traffic management measures such as providing information on environmental route costs have been proposed to mitigate congestion. Multi-criteria routing dynamic traffic assignment (MCR-DTA) models are needed to evaluate

  16. Performance Improvements and Congestion Reduction for Routing-based Synthesis for Digital Microfluidic Biochips

    DEFF Research Database (Denmark)

    Windh, Skyler; Phung, Calvin; Grissom, Daniel T.

    2017-01-01

    Routing-based synthesis for digital microfluidic biochips yields faster assay execution times compared to module-based synthesis. We show that routing-based synthesis can lead to deadlocks and livelocks in specific cases, and that dynamically detecting them and adjusting the probabilities...

  17. Statistical multi-path exposure method for assessing the whole-body SAR in a heterogeneous human body model in a realistic environment.

    Science.gov (United States)

    Vermeeren, Günter; Joseph, Wout; Martens, Luc

    2013-04-01

    Assessing the whole-body absorption in a human in a realistic environment requires a statistical approach covering all possible exposure situations. This article describes the development of a statistical multi-path exposure method for heterogeneous realistic human body models. The method is applied for the 6-year-old Virtual Family boy (VFB) exposed to the GSM downlink at 950 MHz. It is shown that the whole-body SAR does not differ significantly over the different environments at an operating frequency of 950 MHz. Furthermore, the whole-body SAR in the VFB for multi-path exposure exceeds the whole-body SAR for worst-case single-incident plane wave exposure by 3.6%. Moreover, the ICNIRP reference levels are not conservative with the basic restrictions in 0.3% of the exposure samples for the VFB at the GSM downlink of 950 MHz. The homogeneous spheroid with the dielectric properties of the head suggested by the IEC underestimates the absorption compared to realistic human body models. Moreover, the variation in the whole-body SAR for realistic human body models is larger than for homogeneous spheroid models. This is mainly due to the heterogeneity of the tissues and the irregular shape of the realistic human body model compared to homogeneous spheroid human body models. Copyright © 2012 Wiley Periodicals, Inc.

  18. Accounting for conformational flexibility and torsional anharmonicity in the H + CH3CH2OH hydrogen abstraction reactions: a multi-path variational transition state theory study.

    Science.gov (United States)

    Meana-Pañeda, Rubén; Fernández-Ramos, Antonio

    2014-05-07

    This work reports a detailed theoretical study of the hydrogen abstraction reactions from ethanol by atomic hydrogen. The calculated thermal rate constants take into account torsional anharmonicity and conformational flexibility, in addition to the variational and tunneling effects. Specifically, the kinetics calculations were performed by using multi-path canonical variational transition state theory with least-action path tunneling corrections, to which we have added the two-dimensional non-separable method to take into account torsional anharmonicity. The multi-path thermal rate constant is expressed as a sum over conformational reaction channels. Each of these channels includes all the transition states that can be reached by internal rotations. The results show that, in the interval of temperatures between 250 and 2500 K, the account for multiple paths leads to higher thermal rate constants with respect to the single path approach, mainly at low and at high temperatures. In addition, torsional anharmonicity enhances the slope of the Arrhenius plot in this range of temperatures. Finally, we show that the incorporation of tunneling into the hydrogen abstraction reactions substantially changes the contribution of each of the transition states to the conformational reaction channel.

  19. Celestial data routing network

    Science.gov (United States)

    Bordetsky, Alex

    2000-11-01

    Imagine that information processing human-machine network is threatened in a particular part of the world. Suppose that an anticipated threat of physical attacks could lead to disruption of telecommunications network management infrastructure and access capabilities for small geographically distributed groups engaged in collaborative operations. Suppose that small group of astronauts are exploring the solar planet and need to quickly configure orbital information network to support their collaborative work and local communications. The critical need in both scenarios would be a set of low-cost means of small team celestial networking. To the geographically distributed mobile collaborating groups such means would allow to maintain collaborative multipoint work, set up orbital local area network, and provide orbital intranet communications. This would be accomplished by dynamically assembling the network enabling infrastructure of the small satellite based router, satellite based Codec, and set of satellite based intelligent management agents. Cooperating single function pico satellites, acting as agents and personal switching devices together would represent self-organizing intelligent orbital network of cooperating mobile management nodes. Cooperative behavior of the pico satellite based agents would be achieved by comprising a small orbital artificial neural network capable of learning and restructing the networking resources in response to the anticipated threat.

  20. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neithe...

  1. Security in MANETs using reputation-adjusted routing

    Science.gov (United States)

    Ondi, Attila; Hoffman, Katherine; Perez, Carlos; Ford, Richard; Carvalho, Marco; Allen, William

    2009-04-01

    Mobile Ad-Hoc Networks enable communication in various dynamic environments, including military combat operations. Their open and shared communication medium enables new forms of attack that are not applicable for traditional wired networks. Traditional security mechanisms and defense techniques are not prepared to cope with the new attacks and the lack of central authorities make identity verifications difficult. This work extends our previous work in the Biologically Inspired Tactical Security Infrastructure to provide a reputation-based weighing mechanism for linkstate routing protocols to protect the network from attackers that are corrupting legitimate network traffic. Our results indicate that the approach is successful in routing network traffic around compromised computers.

  2. Suppressing traffic-driven epidemic spreading by use of the efficient routing protocol

    International Nuclear Information System (INIS)

    Yang, Han-Xin; Wu, Zhi-Xi

    2014-01-01

    Despite extensive work on the interplay between traffic dynamics and epidemic spreading, the control of epidemic spreading by routing strategies has not received adequate attention. In this paper, we study the impact of an efficient routing protocol on epidemic spreading. In the case of infinite node-delivery capacity, where the traffic is free of congestion, we find that that there exist optimal values of routing parameter, leading to the maximal epidemic threshold. This means that epidemic spreading can be effectively controlled by fine tuning the routing scheme. Moreover, we find that an increase in the average network connectivity and the emergence of traffic congestion can suppress the epidemic outbreak. (paper)

  3. Indoor multipath mitigation

    DEFF Research Database (Denmark)

    Dragünas, Kostas; Borre, Kai

    2010-01-01

    There are many applications that require continuous positioning in combined outdoor urban and indoor environments. GNSS has been used for a long time in outdoor environments, while indoor positioning is still a challenging task. One of the major degradations that GNSS receivers experience indoors...

  4. The price of commitment in online stochastic vehicle routing

    Energy Technology Data Exchange (ETDEWEB)

    Bent, Russell W [Los Alamos National Laboratory; Van Hentenryck, Pascal [BROWN UNIV

    2009-01-01

    This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Early work has focused on very flexible routing settings where the decision to assign a vehicle to a customer is delayed until a vehicle is actually deployed to the customer. Motivated by real applications that require stability in the decision making, this paper considers a setting where the decision to assign a customer request to a vehicle must be taken when that request is accepted. Experimental results suggest that this constraint severely degrades the performance of existing algorithms. However, the paper shows how the use of stochastic information for vehicle assignment and request acceptance improves decision quality considerably. Moreover, the use of resource augmentation quantifies precisely the cost of commitment in online vehicle routing.

  5. Overview: Routes to Open Access

    OpenAIRE

    Tullney, Marco; van Wezenbeek, Wilma

    2017-01-01

    Slides of an overview presentation given at a CESAER workshop on Open Access, February 2nd, 2017, in Brussels Cover major routes to more open access as discussed in the Task Force Open Science of CESAER: (national) open access strategies open access mandates open access incentives open access awareness open access publishing open access infrastructure

  6. Roots/Routes: Part I

    Science.gov (United States)

    Swanson, Dalene M.

    2009-01-01

    This narrative and poetic rendering acts as an articulation of a journey of many routes. It is a storying of critical research issues and events as performances of lived experience. It is a metissage of hybrid, but interrelated, themes that find cohesion through fragmentation and coalescence, severance, and regrowth. These themes are invoked by…

  7. Roots/Routes: Part II

    Science.gov (United States)

    Swanson, Dalene M.

    2009-01-01

    This narrative acts as an articulation of a journey of many routes. Following Part I of the same research journey of rootedness/routedness, it debates the nature of transformation and transcendence beyond personal and political paradoxes informed by neoliberalism and related repressive globalizing discourses. Through a more personal, descriptive,…

  8. Cross-Layer Support for Energy Efficient Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    N. Chilamkurti

    2009-01-01

    Full Text Available The Dynamic Source Routing (DSR algorithm computes a new route when packet loss occurs. DSR does not have an in-built mechanism to determine whether the packet loss was the result of congestion or node failure causing DSR to compute a new route. This leads to inefficient energy utilization when DSR is used in wireless sensor networks. In this work, we exploit cross-layer optimization techniques that extend DSR to improve its routing energy efficiency by minimizing the frequency of recomputed routes. Our proposed approach enables DSR to initiate a route discovery only when link failure occurs. We conducted extensive simulations to evaluate the performance of our proposed cross-layer DSR routing protocol. The simulation results obtained with our extended DSR routing protocol show that the frequency with which new routes are recomputed is 50% lower compared with the traditional DSR protocol. This improvement is attributed to the fact that, with our proposed cross-layer DSR, we distinguish between congestion and link failure conditions, and new routes are recalculated only for the latter.

  9. Improved Adaptive Routing Algorithm in Distributed Data Centers

    Directory of Open Access Journals (Sweden)

    Dmitry Perepelkin

    2017-01-01

    Full Text Available Currently, telecom operators use virtualization of network infrastructure based on Data Centers (DCs. But when a company grows to a certain size and one DC is not sufficient, there are questions how to further develop the network infrastructure. There is a need to expand existing DC boundaries or to add new elements in the network structure. In this paper, we propose improved adaptive routing algorithm in distributed networks of DCs with united service providers, which increases the efficiency of adaptive routing process during dynamic adding of nodes or communication links. The mathematical model and enlarged form of algorithm are shown in the work. In the paper, a comparison of the proposed algorithm with known analogies, such as modified Dijkstra's algorithm and paired transitions algorithm, is performed. To validate the correctness of proposed algorithm, we developed software for simulation of adaptive routing processes in networks of distributed DCs. Comparative analysis of adaptive routing algorithms in distributed networks of DCs with united service providers confirms the effectiveness of the proposed approach and reduces the complexity of constructing routing tables to the value O(mN.

  10. Adaptive local routing strategy on a scale-free network

    International Nuclear Information System (INIS)

    Feng, Liu; Han, Zhao; Ming, Li; Yan-Bo, Zhu; Feng-Yuan, Ren

    2010-01-01

    Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies. (general)

  11. An Efficient Framework Model for Optimizing Routing Performance in VANETs

    Science.gov (United States)

    Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala

    2018-01-01

    Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED). PMID:29462884

  12. Highway route controlled quantity shipment routing reports - An overview

    International Nuclear Information System (INIS)

    Cashwell, J.W.; Welles, B.W.; Welch, M.J.

    1989-01-01

    US Department of Transportation (DOT) regulations require a postnotification report from the shipper for all shipments of radioactive materials categorized as a Highway Route Controlled Quantity. These postnotification reports, filed in compliance with 49 CFR 172.203(d), have been compiled by the DOT in a database known as the Radioactive Materials Routing Report (RAMRT) since 1982. The data were sorted by each of its elements to establish historical records and trends of Highway Route Controlled Quantity shipments from 1982 through 1987. Approximately 1520 records in the RAMRT database were compiled for this analysis. Approximately half of the shipments reported for the study period were from the US Department of Energy (DOE) and its contractors, with the others being commercial movements. Two DOE installations, EG and G Idaho and Oak Ridge, accounted for nearly half of the DOE activities. Similarly, almost half of the commercial movements were reported by two vendors, Nuclear Assurance Corporation and Transnuclear, Incorporated. Spent fuel from power and research reactors accounted for approximately half of all shipments

  13. Route Scherrer and Route Einstein closed for construction work

    CERN Multimedia

    2015-01-01

    Please note that Route Scherrer will be inaccessible for two and a half months from the beginning of March and that part of Route Einstein will be closed for two weeks from the end of February.   Figure 1. The part of Route Scherrer between Building 510 and Building 53 (see Figure 1) will be closed from the beginning of March until mid-May for civil engineering works.   The superheated water pipes supplying the buildings in this area date back to 1959 and therefore present a significant risk of leakage. In order to ensure the reliable supply of superheated water, and, by extension, heating, to all premises near the Main Building (i.e. Buildings 500, 501, 503, 60, 62, 63 and 64), a new buried service duct will be installed between the basements of Buildings 53 and 61 to house a new superheated water pipe. Figure 2. The following car parks will, however, remain accessible for the duration of the works: the Cèdres car park, the car park for Buildings 4 and 5, and the ca...

  14. Multi-Path Transportation Futures Study. Vehicle Characterization and Scenario Analyses: Main Text and Appendices A, B, C, D, and F

    Energy Technology Data Exchange (ETDEWEB)

    Plotkin, Steve [Argonne National Lab. (ANL), Argonne, IL (United States); Singh, Margaret [Argonne National Lab. (ANL), Argonne, IL (United States); Patterson, Phil [U.S. Dept. of Energy, Washington, DC (United States); Ward, Jake [U.S. Dept. of Energy, Washington, DC (United States); Wood, Frances [OnLocation Inc., Vienna, VA (United States); Kydes, Niko [OnLocation Inc., Vienna, VA (United States); Holte, John [OnLocation Inc., Vienna, VA (United States); Moore, Jim [TA Engineering, Inc., Catonsville, MD (United States); Miller, Grant [TA Engineering, Inc., Catonsville, MD (United States); Das, Sujit [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Greene, David [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2009-07-22

    This report provides details for Phase 2 of the Multi-Path Transportation Futures Study, which compares alternative ways to make significant reductions in oil use and carbon emissions from U.S. light vehicles to 2050. Phase I, completed in 2009, examined the full range of pathways of interest to EERE, with multiple scenarios aimed at revealing the issues and impacts associated with a national effort to reduce U.S. dependence on oil use in transportation. Phase 2 expanded the scope of the analysis by examining the interactive effects of multiple pathways on each other and on oil and feedstock prices, focusing far more on costs; and substantially increasing the number of metrics used to compare pathways and scenarios.

  15. Thiomersal photo-degradation with visible light mediated by graphene quantum dots: Indirect quantification using optical multipath mercury cold-vapor absorption spectrophotometry

    Science.gov (United States)

    Miranda-Andrades, Jarol R.; Khan, Sarzamin; Toloza, Carlos A. T.; Romani, Eric C.; Freire Júnior, Fernando L.; Aucelio, Ricardo Q.

    2017-12-01

    Thiomersal is employed as preservative in vaccines, cosmetic and pharmaceutical products due to its capacity to inhibit bacterial growth. Thiomersal contains 49.55% of mercury in its composition and its highly toxic ethylmercury degradation product has been linked to neurological disorders. The photo-degradation of thiomersal has been achieved by visible light using graphene quantum dots as catalysts. The generated mercury cold vapor (using adjusted experimental conditions) was detected by multipath atomic absorption spectrometry allowing the quantification of thiomersal at values as low as 20 ng L- 1 even in complex samples as aqueous effluents of pharmaceutical industry and urine. A kinetic study (pseudo-first order with k = 0.11 min- 1) and insights on the photo-degradation process are presented.

  16. Shortest Paths and Vehicle Routing

    DEFF Research Database (Denmark)

    Petersen, Bjørn

    This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle R...... Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown....

  17. Critical Routes: Women Facing Violence

    OpenAIRE

    Stela Nazareth Meneghel; Sandra Regina Martini Vial

    2008-01-01

    This paper presents the Critical Routes International Seminar – Women Facing Violence , which took place in Porto Alegre in 2008. The seminar was promoted by the Graduate Program on Collective Health at Unisinos and by the Public Health School/RS and was supported by outstanding researchers working in the fields of collective health, and social and human sciences. Initially, we discuss some conceptual aspects about gender violence, its dimensions and its consequences for the health and ...

  18. Cultural Routes and Intangible Heritage

    Directory of Open Access Journals (Sweden)

    Enza Zabbini

    2012-08-01

    Full Text Available The theoretical interpretation of thematic routes helps to predict the effects on the territories visited by cultured tourists who want to enrich their cultural and emotional baggage. After the analysis of some interpretations, this paper will examine how the practical implementation of an itinerary approved by the Council of Europe has evolved over the years. And it will also reflect on the practical results in the areas involved in that project. "The Hannibal Pathway ", the main overland walk on the "Phoenician Route - Cultural Route recognized by the Council of Europe" – represents a case of study that allows to reflect over the impact of cultural tourism based on immaterial heritage. In fact, in the areas where the battle of 21 June 217 BC took place, nothing tangible is left, except the landscape that has kept its conformation intact. In these areas, thanks to the foresight of the local governments in the last three decades, the landscape of the plain has been preserved. This makes possible today to propose an historical path precisely based on the landscape and on the new techniques for the valorization of the heritage. In the Tuoro plain it is possible to see the battlefields, thus retracing the various stages of the battle, supported by the Documentation Centre of the Capra Palace and virtual reconstructions of high technical quality.

  19. Routing Data Authentication in Wireless Networks; TOPICAL

    International Nuclear Information System (INIS)

    TORGERSON, MARK D.; VAN LEEUWEN, BRIAN P.

    2001-01-01

    In this paper, we discuss several specific threats directed at the routing data of an ad hoc network. We address security issues that arise from wrapping authentication mechanisms around ad hoc routing data. We show that this bolt-on approach to security may make certain attacks more difficult, but still leaves the network routing data vulnerable. We also show that under a certain adversarial model, most existing routing protocols cannot be secured with the aid of digital signatures

  20. VANET Routing Protocols: Pros and Cons

    OpenAIRE

    Paul, Bijan; Ibrahim, Md.; Bikas, Md. Abu Naser

    2012-01-01

    VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol h...

  1. The pyramidal capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    2010-01-01

    This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal...

  2. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2011-01-01

    We study a location-routing problem in the context of capacitated vehicle routing. The input to k-LocVRP is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so t...

  3. Developing an eco-routing application.

    Science.gov (United States)

    2014-01-01

    The study develops eco-routing algorithms and investigates and quantifies the system-wide impacts of implementing an eco-routing system. Two eco-routing algorithms are developed: one based on vehicle sub-populations (ECO-Subpopulation Feedback Assign...

  4. The Pyramidal Capacitated Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal...

  5. Infiltration route analysis using thermal observation devices (TOD) and optimization techniques in a GIS environment.

    Science.gov (United States)

    Bang, Soonam; Heo, Joon; Han, Soohee; Sohn, Hong-Gyoo

    2010-01-01

    Infiltration-route analysis is a military application of geospatial information system (GIS) technology. In order to find susceptible routes, optimal-path-searching algorithms are applied to minimize the cost function, which is the summed result of detection probability. The cost function was determined according to the thermal observation device (TOD) detection probability, the viewshed analysis results, and two feature layers extracted from the vector product interim terrain data. The detection probability is computed and recorded for an individual cell (50 m × 50 m), and the optimal infiltration routes are determined with A* algorithm by minimizing the summed costs on the routes from a start point to an end point. In the present study, in order to simulate the dynamic nature of a real-world problem, one thousand cost surfaces in the GIS environment were generated with randomly located TODs and randomly selected infiltration start points. Accordingly, one thousand sets of vulnerable routes for infiltration purposes could be found, which could be accumulated and presented as an infiltration vulnerability map. This application can be further utilized for both optimal infiltration routing and surveillance network design. Indeed, dynamic simulation in the GIS environment is considered to be a powerful and practical solution for optimization problems. A similar approach can be applied to the dynamic optimal routing for civil infrastructure, which requires consideration of terrain-related constraints and cost functions.

  6. Infiltration Route Analysis Using Thermal Observation Devices (TOD and Optimization Techniques in a GIS Environment

    Directory of Open Access Journals (Sweden)

    Hong-Gyoo Sohn

    2010-01-01

    Full Text Available Infiltration-route analysis is a military application of geospatial information system (GIS technology. In order to find susceptible routes, optimal-path-searching algorithms are applied to minimize the cost function, which is the summed result of detection probability. The cost function was determined according to the thermal observation device (TOD detection probability, the viewshed analysis results, and two feature layers extracted from the vector product interim terrain data. The detection probability is computed and recorded for an individual cell (50 m × 50 m, and the optimal infiltration routes are determined with A* algorithm by minimizing the summed costs on the routes from a start point to an end point. In the present study, in order to simulate the dynamic nature of a realworld problem, one thousand cost surfaces in the GIS environment were generated with randomly located TODs and randomly selected infiltration start points. Accordingly, one thousand sets of vulnerable routes for infiltration purposes could be found, which could be accumulated and presented as an infiltration vulnerability map. This application can be further utilized for both optimal infiltration routing and surveillance network design. Indeed, dynamic simulation in the GIS environment is considered to be a powerful and practical solution for optimization problems. A similar approach can be applied to the dynamic optimal routing for civil infrastructure, which requires consideration of terrain-related constraints and cost functions.

  7. Performance Analysis of On-Demand Routing Protocols in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Arafatur RAHMAN

    2009-01-01

    Full Text Available Wireless Mesh Networks (WMNs have recently gained a lot of popularity due to their rapid deployment and instant communication capabilities. WMNs are dynamically self-organizing, self-configuring and self-healing with the nodes in the network automatically establishing an adiej hoc network and preserving the mesh connectivity. Designing a routing protocol for WMNs requires several aspects to consider, such as wireless networks, fixed applications, mobile applications, scalability, better performance metrics, efficient routing within infrastructure, load balancing, throughput enhancement, interference, robustness etc. To support communication, various routing protocols are designed for various networks (e.g. ad hoc, sensor, wired etc.. However, all these protocols are not suitable for WMNs, because of the architectural differences among the networks. In this paper, a detailed simulation based performance study and analysis is performed on the reactive routing protocols to verify the suitability of these protocols over such kind of networks. Ad Hoc On-Demand Distance Vector (AODV, Dynamic Source Routing (DSR and Dynamic MANET On-demand (DYMO routing protocol are considered as the representative of reactive routing protocols. The performance differentials are investigated using varying traffic load and number of source. Based on the simulation results, how the performance of each protocol can be improved is also recommended.

  8. B-iTRS: A Bio-Inspired Trusted Routing Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mingchuan Zhang

    2015-01-01

    Full Text Available In WSNs, routing algorithms need to handle dynamical changes of network topology, extra overhead, energy saving, and other requirements. Therefore, routing in WSNs is an extremely interesting and challenging issue. In this paper, we present a novel bio-inspired trusted routing scheme (B-iTRS based on ant colony optimization (ACO and Physarum autonomic optimization (PAO. For trust assessment, B-iTRS monitors neighbors’ behavior in real time, receives feedback from Sink, and then assesses neighbors’ trusts based on the acquired information. For routing scheme, each node finds routes to the Sink based on ACO and PAO. In the process of path finding, B-iTRS senses the load and trust value of each node and then calculates the link load and link trust of the found routes to support the route selection. Moreover, B-iTRS also assesses the route based on PAO to maintain the route table. Simulation results show how B-iTRS can achieve the effective performance compared to existing state-of-the-art algorithms.

  9. Border Collision Route to Quasiperiodicity: Numerical Investigation and Experimental Confirmation

    DEFF Research Database (Denmark)

    Zhusubaliyev, Zhanybai; Mosekilde, Erik; Maity, S.

    2006-01-01

    Numerical studies of higher-dimensional piecewise-smooth systems have recently shown how a torus can arise from a periodic cycle through a special type of border-collision bifurcation. The present article investigates this new route to quasiperiodicity in the two-dimensional piecewise-linear normal...... form map. We have obtained the chart of the dynamical modes for this map and showed that border-collision bifurcations can lead to the birth of a stable closed invariant curve associated with quasiperiodic or periodic dynamics. In the parameter regions leading to the existence of an invariant closed...... to quasiperiodicity through a border-collision bifurcation. ©2006 American Institute of Physics...

  10. A Genetic Algorithm on Inventory Routing Problem

    Directory of Open Access Journals (Sweden)

    Nevin Aydın

    2014-03-01

    Full Text Available Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments. The difference of inventory routing problems from vehicle routing problems is the consideration of the inventory positions of retailers and supplier, and making the decision accordingly. Inventory routing problems are complex in nature and they can be solved either theoretically or using a heuristics method. Metaheuristics is an emerging class of heuristics that can be applied to combinatorial optimization problems. In this paper, we provide the relationship between vendor-managed inventory and inventory routing problem. The proposed genetic for solving vehicle routing problem is described in detail.

  11. Using trust to secure geographic and energy aware routing against multiple attacks.

    Science.gov (United States)

    Zhang, Guanghua; Zhang, Yuqing; Chen, Zhenguo

    2013-01-01

    To address the vulnerability of geographic routing to multiple security threats such as false routing information, selective forwarding and the Sybil attack in wireless sensor networks, this paper proposes a trust-based defending model against above-mentioned multiple attacks. Considering the characteristics of resource-constrained sensor nodes, trust values of neighboring nodes on the routing path can be calculated through the Dirichlet distribution function, which is based on data packets' acknowledgements in a certain period instead of energy-consuming monitoring. Trust is combined with the cost of geographic and energy aware routing for selecting the next hop of routing. At the same time, the initial trust is dynamically determined, service requests are restricted for malicious nodes in accordance with trust values, and the impact of node mobility is weakened by the trust evolution. The simulation results and analysis show that the proposed model under multiple attacks has advantages in packet delivery ratio and network lifetime over the existing models.

  12. On routing strategy with finite-capacity effect on scale-free networks

    International Nuclear Information System (INIS)

    Tang, S.; Jiang, X.; Ma, L.; Zhang, Z.; Zheng, Z.

    2010-01-01

    We propose a class of systems with finite-capacity effect to investigate routing-strategy optimization. The local topology and the variable capacity, two crucial elements for routing, are naturally coupled by considering the interactions among packets. We show how the combination of these two elements controls the normal and efficient functioning of routing in the frame of condensation and coverage, respectively. Specifically, it is shown that the dynamic behaviors of diffusing packets exhibit condensation, for which exact results of the stationary state and phase transition are given. Further, we explore the diffusion coverage of routed packets through simulation. Various alternatives for the strategy parameters are illustrated to apply standard techniques to alleviate condensation and accelerate coverage. Our results provide a practical way for the design of optimal routing strategies in complex networks by the manipulation of a few parameters. (author)

  13. Improved routing strategies for data traffic in scale-free networks

    International Nuclear Information System (INIS)

    Wu, Zhi-Xi; Peng, Gang; Wong, Wing-Ming; Yeung, Kai-Hau

    2008-01-01

    We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets and the critical packet generation rate (above which packet aggregation occurs in the network). We found that the routing strategies which integrate ingredients of both global and local topological information of the underlying networks perform much better than the traditional shortest path routing protocol taking into account the global topological information only. Moreover, by doing comparative studies with some related works, we found that the performance of our proposed method shows universal efficiency characteristic against the amount of traffic

  14. A hop count based heuristic routing protocol for mobile delay tolerant networks.

    Science.gov (United States)

    You, Lei; Li, Jianbo; Wei, Changjiang; Dai, Chenqu; Xu, Jixing; Hu, Lejuan

    2014-01-01

    Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

  15. A Socially Aware Routing Based on Local Contact Information in Delay-Tolerant Networks

    Directory of Open Access Journals (Sweden)

    Chan-Myung Kim

    2014-01-01

    Full Text Available In delay-tolerant networks, network topology changes dynamically and there is no guarantee of continuous connectivity between any two nodes. These features make DTN routing one of important research issues, and the application of social network metrics has led to the design of recent DTN routing schemes. In this paper, we propose an efficient routing scheme by using a node’s local contact history and social network metrics. Each node first chooses a proper relay node based on the closeness to the destination node. A locally computed betweenness centrality is additionally utilized to enhance the routing efficiency. Through intensive simulation, we finally demonstrate that our algorithm performs efficiently compared to the existing epidemic or friendship routing scheme.

  16. A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks

    Directory of Open Access Journals (Sweden)

    Jose Aguilar

    2007-08-01

    Full Text Available In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented. In the proposed algorithm, the solution space of the dynamic combinatorial optimization problem is mapped into the space where the ants will walk, and the transition probability and the pheromone update formula of the Ant System is defined according to the objective function of the communication problem. The general nature of the approach allows for the optimization of the routing function to be applied in different types of networks just changing the performance criteria to be optimized. In fact, we test and compare the performance of our routing algorithm against well-known routing schemes for wired and wireless networks, and show its superior performance in terms throughput, delay and energy efficiency.

  17. GRAdient Cost Establishment (GRACE for an Energy-Aware Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Noor M. Khan

    2009-01-01

    Full Text Available In Wireless Sensor Network (WSN, the nodes have limitations in terms of energy-constraint, unreliable links, and frequent topology change. In this paper we propose an energy-aware routing protocol, that outperforms the existing ones with an enhanced network lifetime and more reliable data delivery. Major issues in the design of a routing strategy in wireless sensor networks are to make efficient use of energy and to increase reliability in data delivery. The proposed approach reduces both energy consumption and communication-bandwidth requirements and prolongs the lifetime of the wireless sensor network. Using both analysis and extensive simulations, we show that the proposed dynamic routing helps achieve the desired system performance under dynamically changing network conditions. The proposed algorithm is compared with one of the best existing routing algorithms, GRAB. Moreover, a modification in GRAB is proposed which not only improves its performance but also prolongs its lifetime.

  18. Evaluation and development the routing protocol of a fully functional simulation environment for VANETs

    Science.gov (United States)

    Ali, Azhar Tareq; Warip, Mohd Nazri Mohd; Yaakob, Naimah; Abduljabbar, Waleed Khalid; Atta, Abdu Mohammed Ali

    2017-11-01

    Vehicular Ad-hoc Networks (VANETs) is an area of wireless technologies that is attracting a great deal of interest. There are still several areas of VANETS, such as security and routing protocols, medium access control, that lack large amounts of research. There is also a lack of freely available simulators that can quickly and accurately simulate VANETs. The main goal of this paper is to develop a freely available VANETS simulator and to evaluate popular mobile ad-hoc network routing protocols in several VANETS scenarios. The VANETS simulator consisted of a network simulator, traffic (mobility simulator) and used a client-server application to keep the two simulators in sync. The VANETS simulator also models buildings to create a more realistic wireless network environment. Ad-Hoc Distance Vector routing (AODV), Dynamic Source Routing (DSR) and Dynamic MANET On-demand (DYMO) were initially simulated in a city, country, and highway environment to provide an overall evaluation.

  19. Routing strategies for underwater gliders

    Science.gov (United States)

    Davis, Russ E.; Leonard, Naomi E.; Fratantoni, David M.

    2009-02-01

    Gliders are autonomous underwater vehicles that achieve long operating range by moving at speeds comparable to those of, or slower than, typical ocean currents. This paper addresses routing gliders to rapidly reach a specified waypoint or to maximize the ability to map a measured field, both in the presence of significant currents. For rapid transit in a frozen velocity field, direct minimization of travel time provides a trajectory "ray" equation. A simpler routing algorithm that requires less information is also discussed. Two approaches are developed to maximize the mapping ability, as measured by objective mapping error, of arrays of vehicles. In order to produce data sets that are readily interpretable, both approaches focus sampling near predetermined "ideal tracks" by measuring mapping skill only on those tracks, which are laid out with overall mapping skill in mind. One approach directly selects each vehicle's headings to maximize instantaneous mapping skill integrated over the entire array. Because mapping skill decreases when measurements are clustered, this method automatically coordinates glider arrays to maintain spacing. A simpler method that relies on manual control for array coordination employs a first-order control loop to balance staying close to the ideal track and maintaining vehicle speed to maximize mapping skill. While the various techniques discussed help in dealing with the slow speed of gliders, nothing can keep performance from being degraded when current speeds are comparable to vehicle speed. This suggests that glider utility could be greatly enhanced by the ability to operate high speeds for short periods when currents are strong.

  20. Novel routes to nanodispersed semiconductors

    International Nuclear Information System (INIS)

    Green, M.A.

    1999-01-01

    Novel synthetic routes to nanodispersed compound semiconductors using organometallic precursors have been developed. The quantum dots have been studied by optical absorption spectroscopy, photoluminescence spectroscopy, transmission electron microscopy, high resolution transmission electron microscopy, infra red spectroscopy and nuclear magnetic resonance. Polar Lewis base solvents such as tri-n-octylphosphine oxide and 4-ethylpyridine were utilized as both passivating agent and dispersing medium. In the the search for new solvent systems and passivating agents, and investigation was also made into the use of dimethyl sulfoxide as a reaction solvent and capping agent in the preparation of nanocrystalline CdS. Existing routes using metal alkyls and silylated precursors in hot TOPO were improved by substituting the metal alkyl with an metal alkyl adduct. Cadmium monothiocarbamate and a related precursor, cadmium thioacetate were investigated as possible single source precursors to nanometer sized CdS. The thermolysis of diorganophosphides in the Lewis bases coordinating solvent (4-ethylpridine) has been investigated, including studies of decompositon mechanisms, and quantum dots of Cd 3 P 2 , Zn 3 P 2 , Inp and GaP have been prepared. The synthesis of InAs using the metal chloride and an aminoarsenide precursor in 4-ethylpridine has also been developed. A simple method for the organization of III-V materials into glass like aggregates has been described. (author)

  1. A Group Vehicular Mobility Model for Routing Protocol Analysis in Mobile Ad Hoc Network

    OpenAIRE

    Kulkarni, Shrirang Ambaji; Rao, G Raghavendra

    2010-01-01

    Performance of routing protocols in mobile ad-hoc networks is greatly affected by the dynamic nature of nodes, route failures, wireless channels with variable bandwidth and scalability issues. A mobility model imitates the real world movement of mobile nodes and is central component to simulation based studies. In this paper we consider mobility nodes which mimic the vehicular motion of nodes like Manhattan mobility model and City Section mobility model. We also propose a new Group Vehicular ...

  2. Label-based routing for a family of scale-free, modular, planar and unclustered graphs

    International Nuclear Information System (INIS)

    Comellas, Francesc; Miralles, Alicia

    2011-01-01

    We give an optimal labeling and routing algorithm for a family of scale-free, modular and planar graphs with zero clustering. The relevant properties of this family match those of some networks associated with technological and biological systems with a low clustering, including some electronic circuits and protein networks. The existence of an efficient routing protocol for this graph model should help when designing communication algorithms in real networks and also in the understanding of their dynamic processes.

  3. Isomorphic routing on a toroidal mesh

    Science.gov (United States)

    Mao, Weizhen; Nicol, David M.

    1993-01-01

    We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.

  4. Zone routing in a torus network

    Science.gov (United States)

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

    A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

  5. Selecting Bicycle Commuting Routes Using GIS

    OpenAIRE

    Huang, Yuanlin; Ye, Gordon

    1995-01-01

    This study develops a procedure for using a geographic information system (GIS) to select bicycle routes in a city. The procedure includes: developing the required database, finding the most desirable route between each origin­ destination pair, and identifying the best bicycle routes in a city. The study shows that GIS is a powerful tool for developing a database from various readily available sources; that it can conveniently integrate quantitative analysis, data manipulation, and visualiza...

  6. Multi-Objective Weather Routing of Sailing Vessels

    Directory of Open Access Journals (Sweden)

    Życzkowski Marcin

    2017-12-01

    Full Text Available The paper presents a multi-objective deterministic method of weather routing for sailing vessels. Depending on a particular purpose of sailboat weather routing, the presented method makes it possible to customize the criteria and constraints so as to fit a particular user’s needs. Apart from a typical shortest time criterion, safety and comfort can also be taken into account. Additionally, the method supports dynamic weather data: in its present version short-term, mid-term and long-term term weather forecasts are used during optimization process. In the paper the multi-objective optimization problem is first defined and analysed. Following this, the proposed method solving this problem is described in detail. The method has been implemented as an online SailAssistance application. Some representative examples solutions are presented, emphasizing the effects of applying different criteria or different values of customized parameters.

  7. A Scope for MANET Routing and Security Threats

    Directory of Open Access Journals (Sweden)

    Lathies Bhasker T

    2013-12-01

    Full Text Available The mobile Ad-hoc networks (MANET are wireless networks which utilize mobile nodes for communicating among them and in the external transmission range. The vulnerable nature of the network causes various security threats which upset its growth. In this survey, initially the existing security attacks in MANET are analyzed. The attacks categories fall under two stages that include internal and external attacks. The former attack is due to the malicious nodes within the network and later attack is caused by the nodes which do not belong to the network. Then the secure, efficient dynamic routing techniques which are main issues concerned with ad hoc networks are surveyed. Overall, our survey mainly concentrates the existing security attacks and possible routing solution in MANET.

  8. A Machine Learning Concept for DTN Routing

    Science.gov (United States)

    Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

    2017-01-01

    This paper discusses the concept and architecture of a machine learning based router for delay tolerant space networks. The techniques of reinforcement learning and Bayesian learning are used to supplement the routing decisions of the popular Contact Graph Routing algorithm. An introduction to the concepts of Contact Graph Routing, Q-routing and Naive Bayes classification are given. The development of an architecture for a cross-layer feedback framework for DTN (Delay-Tolerant Networking) protocols is discussed. Finally, initial simulation setup and results are given.

  9. Biocatalytic Route to Surface Active Lipid

    DEFF Research Database (Denmark)

    Cheong, Ling-Zhi; Xu, Xuebing

    Lipid can be structurally modified in order to attain improved functional properties. This work look into the possibilities of developing surface active lipids with improved functional properties through biocatalytic route. Biocatalytic route to surface active lipid are usually complex involving ...... distinct self assembling property and find useful application in surfactant industry.......Lipid can be structurally modified in order to attain improved functional properties. This work look into the possibilities of developing surface active lipids with improved functional properties through biocatalytic route. Biocatalytic route to surface active lipid are usually complex involving...

  10. New Hybrid Route to Biomimetic Synthesis

    National Research Council Canada - National Science Library

    Morse, Daniel

    2003-01-01

    To develop economical low-temperature routes to biomimetic synthesis of high-performance composite materials, with control of composition and structure based on the molecular mechanisms controlling...

  11. Transportation Routing Analysis Geographic Information System -- TRAGIS, progress on improving a routing tool

    International Nuclear Information System (INIS)

    Johnson, P.E.; Lester, P.B.

    1998-05-01

    The Transportation Routing Analysis Geographic Information System (TRAGIS) model provides a useful tool to calculate and analyze transportation routes for radioactive materials within the continental US. This paper outlines some of the features available in this model

  12. US Hazardous Materials Routes, Geographic WGS84, BTS (2006) [hazardous_material_routes_BTS_2006

    Data.gov (United States)

    Louisiana Geographic Information Center — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes were developed using the 2004 First Edition TIGER/Line files. The routes are...

  13. Underwater acoustic sensor networks: Medium access control, routing and reliable transfer

    Science.gov (United States)

    Xie, Peng

    been rarely investigated simultaneously in the same network context. We design the first routing protocol, called Vector-Based Forwarding (VBF), for M-UWSNs. VBF is shown to be energy efficient, and at the same time can handle node mobility effectively. We improve the performance of VBF by proposing a hop-by-hop approach, called Hop-by-Hop Vector-Based Forwarding (HH-VBF). Our simulation results show that HH-VBF is more robust in sparse networks. Further, to solve the challenging routing void problem in M-UWSNs, we design a smart void avoidance algorithm, called Vector-Based Void Avoidance (VBVA). VBVA can effectively bypass different types of voids such as convex voids, concave voids and mobile voids. VBVA is the first algorithm to address 3-dimensional voids and mobile voids in mobile sensor networks. Our simulation results show that VBVA can achieve almost the same success delivery ratio as flooding, while it saves much more energy. (3) Reliable data transfer: In M-UWSNs, the long propagation delays, the low communication bandwidth and the high channel error rates all pose grand challenges to the reliable data transfer. We first tackle this problem by proposing a novel hop-by-hop erasure coding approach. Our results indicate its significant performance improvement upon the most advanced approaches explored in underwater acoustic networks. We also develop a mathematical model for the erasure coding scheme, providing useful guidelines to handle node mobility in the network. The second approach we explore is a network coding scheme, in which we carefully couple network coding with multi-path routing for efficient error recovery. We evaluate the performance of this scheme using simulations. And the results show that our network coding scheme is efficient; in both error recovery and energy consumption. In this dissertation, we present these three strands of research work for M-UWSNs in detail, and at the end we point out some potential directions worth future

  14. A Privacy-Preserving Prediction Method for Human Travel Routes

    Directory of Open Access Journals (Sweden)

    Wen-Chen Hu

    2014-12-01

    Full Text Available This paper proposes a kind of location-based research, human travel route prediction, which is to predict the track of a subject's future movements. The proposed method works as follows. The mobile user sends his/her current route along with several dummy routes to the server by using a 3D route matrix, which encodes a set of routes. The server restores the routes from the 3D matrix and matches the restored routes to the saved routes. The predicted route is found as the trunk of the tree, which is built by superimposing the matching results. The server then sends the predicted routes back to the user, who will apply the predicted route to a real-world problem such as traffic control and planning. Preliminary experimental results show the proposed method successfully predicts human travel routes based on current and previous routes. User privacy is also rigorously protected by using a simple method of dummy routes.

  15. A Novel Electric Vehicle Powertrain System Supporting Multi-Path Power Flows: Its Architecture, Parameter Determination and System Simulation

    OpenAIRE

    Yujun Shi; Jin Wei; Zhengxing Deng; Linni Jian

    2017-01-01

    In this paper, a novel electric vehicle powertrain system is proposed. In the system, a coaxial magnetic gear (CMG), an electromagnetic clutch, a lock, and two electric machines (EMs) are adopted to achieve the power-split by controlling the states of the clutch and the lock, which enables electric vehicles (EVs) to work in four operation modes. The configuration, power flow paths and operation modes are depicted in detail. A dynamic model is established to help determine the parameters and b...

  16. Routing of railway carriages: A case study

    NARCIS (Netherlands)

    Brucker, P.; Hurink, Johann L.; Rolfes, T.

    1999-01-01

    In the context of organizing timetables for railway companies the following railway carriage routing problem occurs. Given a timetable containing rail links with departure and destination times/stations and the composition of the trains, find a routing of railway carriages such that the required

  17. Layout and Routing Methods for Warehouses

    NARCIS (Netherlands)

    K.J. Roodbergen (Kees-Jan)

    2001-01-01

    textabstractLayout and Routing Methods for Warehouses discusses aspects of order picking in warehouses. Order picking is the process by which products are retrieved from storage to meet customer demand. Various new routing methods are introduced to determine efficient sequences in which products

  18. Optimizing Departure Times in Vehicle Routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

    2011-01-01

    Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not

  19. Green-Aware Routing in GMPLS Networks

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Ruepp, Sarah Renée; Fagertun, Anna Manolova

    2012-01-01

    -TE) protocol and a greenaware routing and wavelength assignment (RWA) algorithm for minimizing the GHG emissions by routing connection requests through green network elements (NE). The network behavior and the performance of the algorithm are analyzed through simulations under different scenarios, and results......-aware OSPF protocol....

  20. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; Jansen, P.G.; Hop, Laurens

    This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless ¿real-time¿ home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

  1. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; Jansen, P.G.; Hop, Laurens

    This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless real-time home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

  2. Environmental factors along the Northern Sea Route

    International Nuclear Information System (INIS)

    Fjeld, P.E.

    1993-01-01

    The Northern Sea Route runs ca 5,600 nautical miles across the top of Russia from Murmansk to Vladivostok, and includes half of the Arctic basin. An environmental impact assessment is needed for this route because of the potential for commercial shipping to disturb the vulnerable Arctic environment along the route. For example, Russian development of oil and gas resources in the area served by the route is expected to rise dramatically in the near future. Drilling in the route area offshore has already begun, and potential blowouts or tanker spills are of concern. A pilot study on the environment along this route was conducted in 1990/91, focusing on a study of the literature and communications with Russian scientists working on Arctic ecology. Existing data seem to be insufficient and generally only cover the westernmost and easternmost parts of the route. A five-year research plan is proposed to provide an inventory of Arctic species in the route area and levels of contaminants present, to assess the environmental sensitivity of the area, and analyze impacts that increased shipping might have on the environment. Protection measures will also be suggested. 1 fig

  3. 7 CFR 1000.3 - Route disposition.

    Science.gov (United States)

    2010-01-01

    ... Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements and Orders; Milk), DEPARTMENT OF AGRICULTURE GENERAL PROVISIONS OF FEDERAL MILK MARKETING ORDERS Definitions § 1000.3 Route disposition. Route disposition means a delivery to a retail or wholesale outlet...

  4. Routing in Optical and Stochastic Networks

    NARCIS (Netherlands)

    Yang, S.

    2015-01-01

    In most types of networks (e.g., optical or transportation networks), finding one or more best paths from a source to a destination, is one of the biggest concerns of network users and providers. This process is known as routing. The routing problems differ accordingly depending on different

  5. Highway and interline transportation routing models

    International Nuclear Information System (INIS)

    Joy, D.S.; Johnson, P.E.

    1994-01-01

    The potential impacts associated with the transportation of hazardous materials are important issues to shippers, carriers, and the general public. Since transportation routes are a central characteristic in most of these issues, the prediction of likely routes is the first step toward the resolution of these issues. In addition, US Department of Transportation requirements (HM-164) mandate specific routes for shipments of highway controlled quantities of radioactive materials. In response to these needs, two routing models have been developed at Oak Ridge National Laboratory under the sponsorship of the U.S. Department of Energy (DOE). These models have been designated by DOE's Office of Environmental Restoration and Waste Management, Transportation Management Division (DOE/EM) as the official DOE routing models. Both models, HIGHWAY and INTERLINE, are described

  6. Routing protocols in wireless sensor networks.

    Science.gov (United States)

    Villalba, Luis Javier García; Orozco, Ana Lucila Sandoval; Cabrera, Alicia Triviño; Abbas, Cláudia Jacy Barenco

    2009-01-01

    The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks.

  7. User habits and multimodal route planning

    Directory of Open Access Journals (Sweden)

    Géza Katona

    2017-10-01

    Full Text Available The results of route planning researches are monitored by logistic and automotive industries. The economic aspects of the cost saving are in the focus of the attention. An optimal route could cause time or fuel savings. An effective driving or an optimal route is a good basis to achieve an economical aim. Moreover the spread of new automotive solutions especially in case of electric cars the optimisation has particular significance regarding the limited battery storage. Additionally the autonomous car development could not be neglected. As a result the society could expect safer roads, better space usage and effective resource management. Nevertheless the requirements of users are extremely diverse, which is not negligible. Supporting these aims, in this paper the connection between the multimodal route planning and the user requirements are investigated. The examination is focused to a sensitivity analysis and a survey to evaluate the data and support the settings of a user habit effect to the final route.

  8. Syngas route to adipic acid

    Energy Technology Data Exchange (ETDEWEB)

    Kealing, H.S.

    1986-03-01

    In an era of escalating hydrocarbon prices, the development of new technology to synthesize large volume chemical intermediates from the least expensive sources of carbon and hydrogen has been a research area of increasing intensity. Adipic acid is prepared commercially by oxidative processes using either benzene or phenol as the raw material base. Since both benzene and phenol prices track with the price of crude oil, future adipic acid price will increase as the oil reserve decreases. Thus, there is a need for a new process to produce adipic acid from cheap, and readily available, raw materials such as butadiene obtained as a by-product from world scale olefin plants. One such process that capitalizes on the use of butadiene as a raw material is BASF's two-step carbonylation route to adipic acid. The butadiene in the C/sub 4/ cut from a steam cracker is transformed by a two-stage carbonylation with carbon monoxide and methanol into adipic acid dimethyl ester. Hydrolysis converts the ester into adipic acid. BASF is now engineering a 130 mm pound per year commercial plant based on this technology.

  9. Critical Routes: Women Facing Violence

    Directory of Open Access Journals (Sweden)

    Stela Nazareth Meneghel

    2008-11-01

    Full Text Available This paper presents the Critical Routes International Seminar – Women Facing Violence , which took place in Porto Alegre in 2008. The seminar was promoted by the Graduate Program on Collective Health at Unisinos and by the Public Health School/RS and was supported by outstanding researchers working in the fields of collective health, and social and human sciences. Initially, we discuss some conceptual aspects about gender violence, its dimensions and its consequences for the health and the life quality of the affected women. Our understanding is that violence is one of the most effective methods of controlling women in societies scarred with gender hierarchies. The structure of the seminar focused on three main discussion themes: breaking up with the violence, mechanisms for working with gender and hearing the services. These themes were chosen aiming at looking for ways to help the women and to explore efficient mechanisms to combat, reduce and, if possible, eliminate the violence perpetrated against women. At the end of the seminar, we reiterate the political commitment on the accomplishment of the public policies to face violence and the fight against all inequality, discrimination and violence forms based on gender.

  10. A rational route to randomness

    NARCIS (Netherlands)

    Brock, W.A.; Hommes, C.H.; Barkley Rosser Jr., J.

    2004-01-01

    Complex dynamics in economics arise from nonlinear systems that do not converge to a fixed point, a limit cycle, or explode or implode exponentially due to endogenous factors. They arise from cybernetics, catastrophe theory, chaos theory, or the varieties of modern complexity theory, including

  11. The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic.

    Science.gov (United States)

    Li, Ning; Martínez, José-Fernán; Hernández Díaz, Vicente

    2015-08-10

    Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters' dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively.

  12. Energy Efficiency Performance Improvements for Ant-Based Routing Algorithm in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Adamu Murtala Zungeru

    2013-01-01

    Full Text Available The main problem for event gathering in wireless sensor networks (WSNs is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR algorithm, based on the ant colony optimization (ACO metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1 a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2 intelligent update of routing tables in case of a node or link failure, and (3 reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC and Beesensor.

  13. A Novel Electric Vehicle Powertrain System Supporting Multi-Path Power Flows: Its Architecture, Parameter Determination and System Simulation

    Directory of Open Access Journals (Sweden)

    Yujun Shi

    2017-02-01

    Full Text Available In this paper, a novel electric vehicle powertrain system is proposed. In the system, a coaxial magnetic gear (CMG, an electromagnetic clutch, a lock, and two electric machines (EMs are adopted to achieve the power-split by controlling the states of the clutch and the lock, which enables electric vehicles (EVs to work in four operation modes. The configuration, power flow paths and operation modes are depicted in detail. A dynamic model is established to help determine the parameters and build simulation models. The simple control strategy is adopted to achieve flexible power-splits. How to determine the relevant parameters to meet the drive requirements in the powertrain system is also elaborated. A dynamic simulation using MATLAB/Simulink is performed to take into account the control strategy and New European Drive Cycle. Finally, the simulation results demonstrate, in theory, the rationality of the determined parameters and the feasibility of the operation modes as well as the control strategy.

  14. FFT Bifurcation Analysis of Routes to Chaos via Quasiperiodic Solutions

    Directory of Open Access Journals (Sweden)

    L. Borkowski

    2015-01-01

    Full Text Available The dynamics of a ring of seven unidirectionally coupled nonlinear Duffing oscillators is studied. We show that the FFT analysis presented in form of a bifurcation graph, that is, frequency distribution versus a control parameter, can provide a valuable and helpful complement to the corresponding typical bifurcation diagram and the course of Lyapunov exponents, especially in context of detailed identification of the observed attractors. As an example, bifurcation analysis of routes to chaos via 2-frequency and 3-frequency quasiperiodicity is demonstrated.

  15. Computer-aided design for routing of in-core instrumentation guide tubes

    Energy Technology Data Exchange (ETDEWEB)

    Park, Sung Ho; Sohn, Yong Soo; Yoon, Ki Seok; Cho, Duk Sang; Sung, Ki Kwang [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1993-07-01

    This study presents a computer design program for in-core instrumentation (ICI) guide tube routing and locations on support system, and checking the interference between ICI guide tubes in the reactor coolant system of typical pressurized water reactor. The simulation program called ICITRIC(in-core instrumentation tube routing and interference check), has been developed for routing of ICI guide tubes, locations on support system, and checking the interference between ICI guide tubes. The program, ICITRIC, has been written in FORTRAN 77 language which is available under UNIX environment. Results of this program are compared with those of the commercial code, PATRAN, and both results are almost same. Also the results may provide input data for ICI system static and dynamic analysis performed by the commercial code, SUPERPIPE. Through a process of iteration, the designer can apply initial conditions, and modify the routing until satisfied with the overall system performance. (Author) 15 refs., 10 figs., 10 tabs.

  16. Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches

    Directory of Open Access Journals (Sweden)

    Omar M. Zakaria

    2016-01-01

    Full Text Available Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.

  17. Assessing Routing Strategies for Cognitive Radio Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kashif Saleem

    2013-09-01

    Full Text Available Interest in the cognitive radio sensor network (CRSN paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs, cognitive radio ad-hoc networks (CRAHNs and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area.

  18. Assessing routing strategies for cognitive radio sensor networks.

    Science.gov (United States)

    Zubair, Suleiman; Fisal, Norsheila; Baguda, Yakubu S; Saleem, Kashif

    2013-09-26

    Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area.

  19. RECONFIGURABLE PRODUCT ROUTING AND CONTROL FOR MASS CUSTOMISATION MANUFACTURING

    Directory of Open Access Journals (Sweden)

    A. J. Walker

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT:Reconfigurable control of flexible manufacturing systems can allow for the efficient and responsive production of customised product instances. This can aid in providing make-to-order business models for various small- to medium-sized enterprises in South Africa, and provide competitive advantage in a dynamic global marketplace. Reconfigurable control application requires an understanding of the modes of production variability in mass customisation manufacturing. Temporally uncorrelated workflow routings are considered as one of these production variability modes. In this light, this paper addresses the flexible material payload routing problem, and presents a mobile robot platform that has been developed to research and design reconfigurable routing systems.

    AFRIKAANSE OPSOMMING:Verstelbare beheer van aanpasbare vervaardigingstelsels kan die doeltreffende en reaktiewe produksie van doelgemaakte produkeksemplare toelaat. Hierdie beheer kan assisteer in die voorsiening van vervaardig-na-bestellingbesigheidsmodelle aan ’n aantal klein- tot medium-grootte ondernemings in Suid-Afrika, en aan hulle ’n kompeterende voorsprong bied in ’n dinamiese globale mark. Die instelling van verstelbare beheer vereis dat die modi van produkveranderlikheid in massa verbruikersaanpassingsvervaardiging verstaan word. Hierdie artikel spreek die probleem van aanpasbare roetebepaling van materiaalvragte in massa verbruikersaanpassingsvervaardiging aan. ’n Mobiele robot-platform, ontwikkel vir navorsing in verstelbare roetebepalingstelsels, word ook voorgelê.

  20. Porcelain tiles by the dry route

    International Nuclear Information System (INIS)

    Melchiades, F. G.; Daros, M. T.; Boschi, A. O.

    2010-01-01

    In Brazil, the second largest tile producer of the world, at present, 70% of the tiles are produced by the dry route. One of the main reasons that lead to this development is the fact that the dry route uses approximately 30% less thermal energy them the traditional wet route. The increasing world concern with the environment and the recognition of the central role played by the water also has pointed towards privileging dry processes. In this context the objective of the present work is to study the feasibility of producing high quality porcelain tiles by the dry route. A brief comparison of the dry and wet route, in standard conditions industrially used today to produce tiles that are not porcelain tiles, shows that there are two major differences: the particle sizes obtained by the wet route are usually considerably finer and the capability of mixing the different minerals, the intimacy of the mixture, is also usually better in the wet route. The present work studied the relative importance of these differences and looked for raw materials and operational conditions that would result in better performance and glazed porcelain tiles of good quality. (Author) 7 refs.

  1. Porcelain tiles by the dry route

    Energy Technology Data Exchange (ETDEWEB)

    Melchiades, F. G.; Daros, M. T.; Boschi, A. O.

    2010-07-01

    In Brazil, the second largest tile producer of the world, at present, 70% of the tiles are produced by the dry route. One of the main reasons that lead to this development is the fact that the dry route uses approximately 30% less thermal energy them the traditional wet route. The increasing world concern with the environment and the recognition of the central role played by the water also has pointed towards privileging dry processes. In this context the objective of the present work is to study the feasibility of producing high quality porcelain tiles by the dry route. A brief comparison of the dry and wet route, in standard conditions industrially used today to produce tiles that are not porcelain tiles, shows that there are two major differences: the particle sizes obtained by the wet route are usually considerably finer and the capability of mixing the different minerals, the intimacy of the mixture, is also usually better in the wet route. The present work studied the relative importance of these differences and looked for raw materials and operational conditions that would result in better performance and glazed porcelain tiles of good quality. (Author) 7 refs.

  2. Is Entrepreneurship a Route Out of Deprivation?

    DEFF Research Database (Denmark)

    Frankish, Julian S.; Roberts, Richard G.; Coad, Alexander Jean-Luc

    2014-01-01

    Frankish J. S., Roberts R. G., Coad A. and Storey D. J. Is entrepreneurship a route out of deprivation?, Regional Studies. This paper investigates whether entrepreneurship constitutes a route out of deprivation for those living in deprived areas. The measure of income/wealth used is based...... on an analysis of improvements in an individual's residential address. The data consist of information on over 800 000 individuals, and come from the customer records of a major UK bank. Comparing business owners with non-owners, the results suggest that the benefits of business ownership are found across...... the wealth distribution. Hence, entrepreneurship can be a route out of deprivation....

  3. A Graphical Method for Great Circle Routes

    Directory of Open Access Journals (Sweden)

    Hsu Tien-Pen

    2017-03-01

    Full Text Available A great circle route (GCR is the shortest route on a spherical earth model. Do we have a visual diagram to handle the shortest route? In this paper, a graphical method (GM is proposed to solve the GCR problems based on the celestial meridian diagram (CMD in celestial navigation. Unlike developed algebraic methods, the GM is a geometric method. Appling computer software to graph, the GM does not use any equations but is as accurate as using algebraic methods. In addition, the GM, which emphasizes the rotational surface, can depict a GCR and judge its benefit.

  4. Optimization for routing vehicles of seafood product transportation

    Science.gov (United States)

    Soenandi, I. A.; Juan, Y.; Budi, M.

    2017-12-01

    Recently, increasing usage of marine products is creating new challenges for businesses of marine products in terms of transportation that used to carry the marine products like seafood to the main warehouse. This can be a problem if the carrier fleet is limited, and there are time constraints in terms of the freshness of the marine product. There are many ways to solve this problem, including the optimization of routing vehicles. In this study, this strategy is to implement in the marine product business in Indonesia with such an expected arrangement of the company to optimize routing problem in transportation with time and capacity windows. Until now, the company has not used the scientific method to manage the routing of their vehicle from warehouse to the location of marine products source. This study will solve a stochastic Vehicle Routing Problems (VRP) with time and capacity windows by using the comparison of six methods and looking the best results for the optimization, in this situation the company could choose the best method, in accordance with the existing condition. In this research, we compared the optimization with another method such as branch and bound, dynamic programming and Ant Colony Optimization (ACO). Finally, we get the best result after running ACO algorithm with existing travel time data. With ACO algorithm was able to reduce vehicle travel time by 3189.65 minutes, which is about 23% less than existing and based on consideration of the constraints of time within 2 days (including rest time for the driver) using 28 tons capacity of truck and the companies need two units of vehicles for transportation.

  5. Wide-Area Landslide Deformation Mapping with Multi-Path ALOS PALSAR Data Stacks: A Case Study of Three Gorges Area, China

    Directory of Open Access Journals (Sweden)

    Xuguo Shi

    2016-02-01

    Full Text Available In recent years, satellite synthetic aperture radar interferometry (InSAR has been adopted as a spaceborne geodetic tool to successfully measure surface deformation of a few well-known landslides in the Three Gorges area. In consideration of the fact that most events of slope failure happened at places other than those famous landslides since the reservoir impoundment in 2003, focusing on a limited number of slopes is insufficient to meet the requirements of regional-scale landslide disaster prevention and early warning. As a result, it has become a vital task to evaluate the overall stability of slopes across the vast area of Three Gorges using wide-coverage InSAR datasets. In this study, we explored the approach of carrying out joint analysis of multi-path InSAR data stacks for wide-area landslide deformation mapping. As an example, three ALOS (Advanced Land Observing Satellite PALSAR (Phased Array type L-band Synthetic Aperture Radar data stacks of neighboring ascending paths covering the area along the Yangtze River from Fengjie to Zigui were analyzed. A key problem to be solved is the separation of the tropospheric signal from the interferometric phase, for which we employed a hybrid description model of the atmospheric phase screen (APS to improve APS estimation from time series interferograms. The estimated atmospheric phase was largely correlated with the seasonal rainfall in the temporal dimension. The experimental results show that about 30 slopes covering total areas of 48 km2 were identified to be landslides in active deformation and should be kept under routine surveillance. Analyses of time series displacement measurements revealed that most landslides in the mountainous area far away from Yangtze River suffered from linear deformation, whereas landslides located on the river bank were destabilized predominantly by the influences of reservoir water level fluctuation and rainfall.

  6. Children's route choice during active transportation to school: difference between shortest and actual route.

    Science.gov (United States)

    Dessing, Dirk; de Vries, Sanne I; Hegeman, Geertje; Verhagen, Evert; van Mechelen, Willem; Pierik, Frank H

    2016-04-12

    The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible route to school. Children (n = 184; 86 boys, 98 girls; age range: 8-12 years) from seven schools in suburban municipalities in the Netherlands participated in the study. Actual walking and cycling routes to school were measured with a GPS-device that children wore during an entire school week. Measurements were conducted in the period April-June 2014. Route characteristics for both actual and shortest routes between home and school were determined for a buffer of 25 m from the routes and divided into four categories: Land use (residential, commercial, recreational, traffic areas), Aesthetics (presence of greenery/natural water ways along route), Traffic (safety measures such as traffic lights, zebra crossings, speed bumps) and Type of street (pedestrian, cycling, residential streets, arterial roads). Comparison of characteristics of shortest and actual routes was performed with conditional logistic regression models. Median distance of the actual walking routes was 390.1 m, whereas median distance of actual cycling routes was 673.9 m. Actual walking and cycling routes were not significantly longer than the shortest possible routes. Children mainly traveled through residential areas on their way to school (>80% of the route). Traffic lights were found to be positively associated with route choice during ATS. Zebra crossings were less often present along the actual routes (walking: OR = 0.17, 95% CI = 0.05-0.58; cycling: OR = 0.31, 95% CI = 0.14-0.67), and streets with a high occurrence of accidents were less often used during cycling to school (OR = 0.57, 95% CI = 0.43-0.76). Moreover, percentage of visible surface water along the actual route was higher

  7. Dynamic Routing and Coordination in Multi-Agent Networks

    Science.gov (United States)

    2016-06-10

    Cyberphysical Systems, University of New Mexico , Jan 2014 Plenary Speaker: 16th Latin American Congress of Automatic Control, Cancún, México, Oct 2014...Pasqualetti, R. Carli, and F. Bullo. Simultaneous boundary partitioning and cameras synchronization for optimal video surveillance. In IFAC Workshop on...convex programming. In Int. Conf. on Network Games , Control and Optimization (NetGCooP), pages 1–7, Paris, France, October 2011 8

  8. The dynamics of user perception, decision making and route choice

    NARCIS (Netherlands)

    Vreeswijk, Jacob Dirk

    2015-01-01

    Travellers’ response to performance changes in the traffic system is a decisive factor in the effectiveness of traffic management measures. This thesis provides an empirical and quantitative assessment of choice behaviour and the effects of perception error on choice outcomes. It considers users’

  9. Are GIS-modelled routes a useful proxy for the actual routes followed by commuters?

    Science.gov (United States)

    Dalton, Alice M; Jones, Andrew P; Panter, Jenna; Ogilvie, David

    2015-06-01

    Active commuting offers the potential to increase physical activity among adults by being built into daily routines. Characteristics of the route to work may influence propensity to walk or cycle. Geographic information system (GIS) software is often used to explore this by modelling routes between home and work. However, if the validity of modelled routes depends on the mode of travel used, studies of environmental determinants of travel may be biased. We aimed to understand how well modelled routes reflect those actually taken, and what characteristics explain these differences. We compared modelled GIS shortest path routes with actual routes measured using QStarz BT-Q1000X Global Positioning System (GPS) devices in a free-living sample of adults working in Cambridge and using varying travel modes. Predictors of differences, according to length and percentage overlap, between the two route sets were assessed using multilevel regression models and concordance coefficients. The 276 trips, made by 51 participants, were on average 27% further than modelled routes, with an average geographical overlap of 39%. However, predictability of the route depended on travel mode. For route length, there was moderate-to-substantial agreement for journeys made on foot and by bicycle. Route overlap was lowest for trips made by car plus walk (22%). The magnitude of difference depended on other journey characteristics, including travelling via intermediate destinations, distance, and use of busy roads. In conclusion, GIS routes may be acceptable for distance estimation and to explore potential routes, particularly active commuting. However, GPS should be used to obtain accurate estimates of environmental contexts in which commuting behaviour actually occurs. Public health researchers should bear these considerations in mind when studying the geographical determinants and health implications of commuting behaviour, and when recommending policy changes to encourage active travel.

  10. Epidemic metapopulation model with traffic routing in scale-free networks

    International Nuclear Information System (INIS)

    Huang, Wei; Chen, Shengyong

    2011-01-01

    In this paper, we propose a model incorporating both the traffic routing dynamics and the virus prevalence dynamics. In this model, each packet may be isolated from the network on its transporting path, which means that the packet cannot be successfully delivered to its destination. In contrast, a successful transport means that a packet can be delivered from source to destination without being isolated. The effects of model parameters on the delivery success rate and the delivery failure rate are intensively studied and analyzed. Several routing strategies are performed for our model. Results show that the shortest path routing strategy is the most effective for enhancing the delivery success rate, especially when each packet is only allowed to be delivered to the neighbor with the lowest degree along the shortest path. We also find that, by minimizing the sum of the nodes' degree along the transporting path, we can also obtain a satisfactory delivery success rate

  11. An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

    change dynamically. In this paper, the authors put forward an Evolutionary Mobility aware multi-objective hybrid Routing Protocol for heterogeneous wireless sensor networks (EMRP). EMRP uses two-level hierarchical clustering. EMRP selects the optimal path from source to sink using multiple metrics...... such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The authors study the influence of energy heterogeneity and mobility of sensor nodes on the performance of EMRP. The Performance of EMRP compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing......Researchers have faced numerous challenges while designing WSNs and protocols in many applications such as object tracking in military, detection of disastrous events, environment and health monitoring etc. Amongst all sustaining connectivity and capitalizing on the network lifetime is a serious...

  12. Quantum chemistry-assisted synthesis route development

    International Nuclear Information System (INIS)

    Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

    2015-01-01

    We have been investigating “quantum chemistry-assisted synthesis route development” using in silico screenings and applied the method to several targets. Another example was conducted to develop synthesis routes for a urea derivative, namely 1-(4-(trifluoromethyl)-2-oxo-2H-chromen-7-yl)urea. While five synthesis routes were examined, only three routes passed the second in silico screening. Among them, the reaction of 7-amino-4-(trifluoromethyl)-2H-chromen-2-one and O-methyl carbamate with BF 3 as an additive was ranked as the first choice for synthetic work. We were able to experimentally obtain the target compound even though its yield was as low as 21 %. The theoretical result was thus consistent with that observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings

  13. Pharmacokinetics of Alternative Administration Routes of Melatonin

    DEFF Research Database (Denmark)

    Zetner, D.; Andersen, L. P.H.; Rosenberg, J.

    2016-01-01

    Background: Melatonin is traditionally administered orally but has a poor and variable bioavailability. This study aims to present an overview of studies investigating the pharmacokinetics of alternative administration routes of melatonin. Methods: A systematic literature search was performed...... and included experimental or clinical studies, investigating pharmacokinetics of alternative administration routes of melatonin in vivo. Alternative administration routes were defined as all administration routes except oral and intravenous. Results: 10 studies were included in the review. Intranasal...... administration exhibited a quick absorption rate and high bioavailability. Transdermal administration displayed a variable absorption rate and possible deposition of melatonin in the skin. Oral transmucosal administration of melatonin exhibited a high plasma concentration compared to oral administration...

  14. Quantum chemistry-assisted synthesis route development

    Energy Technology Data Exchange (ETDEWEB)

    Hori, Kenji; Sumimoto, Michinori [Graduate School of Science and Engineering, Yamaguchi University, Tokiwadai, Ube, Yamaguchi 755-8611 (Japan); Murafuji, Toshihiro [Graduate School of Medicine, Yamaguchi University, Yamaguchi, Yamaguchi 753-8512 (Japan)

    2015-12-31

    We have been investigating “quantum chemistry-assisted synthesis route development” using in silico screenings and applied the method to several targets. Another example was conducted to develop synthesis routes for a urea derivative, namely 1-(4-(trifluoromethyl)-2-oxo-2H-chromen-7-yl)urea. While five synthesis routes were examined, only three routes passed the second in silico screening. Among them, the reaction of 7-amino-4-(trifluoromethyl)-2H-chromen-2-one and O-methyl carbamate with BF{sub 3} as an additive was ranked as the first choice for synthetic work. We were able to experimentally obtain the target compound even though its yield was as low as 21 %. The theoretical result was thus consistent with that observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings.

  15. Integrating routing decisions in public transportation problems

    CERN Document Server

    Schmidt, Marie E

    2014-01-01

    This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously. This work is technically deep, with insightful findings regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs ...

  16. Human BDCM Mulit-Route PBPK Model

    Data.gov (United States)

    U.S. Environmental Protection Agency — This data set contains the code for the BDCM human multi-route model written in the programming language acsl. The final published manuscript is provided since it...

  17. Coordinated Platoon Routing in a Metropolitan Network

    Energy Technology Data Exchange (ETDEWEB)

    Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

    2016-10-10

    Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing the platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.

  18. Commercial vehicle route tracking using video detection.

    Science.gov (United States)

    2010-10-31

    Interstate commercial vehicle traffic is a major factor in the life of any road surface. The ability to track : these vehicles and their routes through the state can provide valuable information to planning : activities. We propose a method using vid...

  19. Dams and Obstructions along Iowa's Canoe Routes

    Data.gov (United States)

    Iowa State University GIS Support and Research Facility — This dataset represents obstruction to canoe and boat users of the canoe routes of Iowa. This may represent actual dams, rock dams (natural or man made), large...

  20. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2016-01-01

    depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0.......We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...

  1. Learning Points and Routes to Recommend Trajectories

    OpenAIRE

    Chen, Dawei; Ong, Cheng Soon; Xie, Lexing

    2016-01-01

    The problem of recommending tours to travellers is an important and broadly studied area. Suggested solutions include various approaches of points-of-interest (POI) recommendation and route planning. We consider the task of recommending a sequence of POIs, that simultaneously uses information about POIs and routes. Our approach unifies the treatment of various sources of information by representing them as features in machine learning algorithms, enabling us to learn from past behaviour. Info...

  2. Latent variables and route choice behavior

    DEFF Research Database (Denmark)

    Prato, Carlo Giacomo; Bekhor, Shlomo; Pronello, Cristina

    2012-01-01

    In the last decade, a broad array of disciplines has shown a general interest in enhancing discrete choice models by considering the incorporation of psychological factors affecting decision making. This paper provides insight into the comprehension of the determinants of route choice behavior by...... results illustrate that considering latent variables (i.e., memory, habit, familiarity, spatial ability, time saving skills) alongside traditional variables (e.g., travel time, distance, congestion level) enriches the comprehension of route choice behavior....

  3. On the Lorentzian route to Relativity

    OpenAIRE

    Gürel, Atilla; Gürel, Zeynep

    2011-01-01

    We discuss pedagogical problems associated with the conventional approach in teaching relativity and the potential value of "Lorentzian route to relativity" for addressing these pedagogical problems. We think that Lorentzian approach may be valuable part of an introduction to relativity but the historical route should be followed up to its end. It must namely include Einstein's application of Occam's razor in reinterpreting Lorentz transformations kinematically and the discussion of the centr...

  4. Energy Efficient Routing in Nomadic Networks

    DEFF Research Database (Denmark)

    Kristensen, Mads Darø; Bouvin, Niels Olof

    2007-01-01

    We present an evaluation of a novel energy-efficient routing protocol for mobile ad-hoc networks. We combine two techniques for optimizing energy levels with a well-known routing protocol. We examine the behavior of this combination in a nomadic network setting, where some nodes are stationary...... and have a steady power supply. Protocol optimizations for the nomadic scenario are presented and validated through simulations...

  5. Energy efficient motion control of the electric bus on route

    Science.gov (United States)

    Kotiev, G. O.; Butarovich, D. O.; Kositsyn, B. B.

    2018-02-01

    At present, the urgent problem is the reduction of energy costs of urban motor transport. The article proposes a method of solving this problem by developing an energy-efficient law governing the movement of an electric bus along a city route. To solve this problem, an algorithm is developed based on the dynamic programming method. The proposed method allows you to take into account the constraints imposed on the phase coordinates, control action, as well as on the time of the route. In the course of solving the problem, the model of rectilinear motion of an electric bus on a horizontal reference surface is considered, taking into account the assumptions that allow it to be adapted for the implementation of the method. For the formation of a control action in the equations of motion dynamics, an algorithm for changing the traction / braking torque on the wheels of an electric bus is considered, depending on the magnitude of the control parameter and the speed of motion. An optimal phase trajectory was obtained on a selected section of the road for the prototype of an electric bus. The article presents the comparison of simulation results obtained with the optimal energy efficient control law with the results obtained by a test driver. The comparison proved feasibility of the energy efficient control law for the automobile city electric transport.

  6. Minimum Cost Multicast Routing Using Ant Colony Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Xiao-Min Hu

    2013-01-01

    Full Text Available Multicast routing (MR is a technology for delivering network data from some source node(s to a group of destination nodes. The objective of the minimum cost MR (MCMR problem is to find an optimal multicast tree with the minimum cost for MR. This problem is NP complete. In order to tackle the problem, this paper proposes a novel algorithm termed the minimum cost multicast routing ant colony optimization (MCMRACO. Based on the ant colony optimization (ACO framework, the artificial ants in the proposed algorithm use a probabilistic greedy realization of Prim’s algorithm to construct multicast trees. Moving in a cost complete graph (CCG of the network topology, the ants build solutions according to the heuristic and pheromone information. The heuristic information represents problem-specific knowledge for the ants to construct solutions. The pheromone update mechanisms coordinate the ants’ activities by modulating the pheromones. The algorithm can quickly respond to the changes of multicast nodes in a dynamic MR environment. The performance of the proposed algorithm has been compared with published results available in the literature. Results show that the proposed algorithm performs well in both static and dynamic MCMR problems.

  7. Route selection issues for NWPA shipments

    International Nuclear Information System (INIS)

    Hill, C.V.; Harrison, I.G.

    1993-01-01

    Questions surrounding the designation of routes for the movement of spent nuclear fuel (SNF) and high-level radioactive waste (HLW) by the Office of Civilian Radioactive Waste Management (OCRWM) have broad implications. Federal regulations prescribe rules to be applied in the selection of highway routes. In most cases, these rules will lead to a clear selection of one route between an origin and destination point. However, in other cases, strict application of the regulations does not result in a clear choice of a preferred route. The regulations also provide discretion to State governments and carriers to select alternative routes to enhance the safety of the shipment. Railroad shipments of radioactive materials are not subject to Federal routing regulations. Since the railroads operate on private property, it has been assumed that they know the best way to move freight on their system. This discretion, while desirable for addressing unique local safety concerns or for responding to temporary safety concerns such as road problems, weather conditions, or construction areas, leads to significant opportunity for misunderstandings and uneasiness on the part of local residents

  8. The Route Analysis Based On Flight Plan

    Science.gov (United States)

    Feriyanto, Nur; Saleh, Chairul; Fauzi, Achmad; Rachman Dzakiyullah, Nur; Riza Iwaputra, Kahfi

    2016-02-01

    Economic development effects use of air transportation since the business process in every aspect was increased. Many people these days was prefer using airplane because it can save time and money. This situation also effects flight routes, many airlines offer new routes to deal with competition. Managing flight routes is one of the problems that must be faced in order to find the efficient and effective routes. This paper investigates the best routes based on flight performance by determining the amount of block fuel for the Jakarta-Denpasar flight route. Moreover, in this work compares a two kinds of aircraft and tracks by calculating flight distance, flight time and block fuel. The result shows Jakarta-Denpasar in the Track II has effective and efficient block fuel that can be performed by Airbus 320-200 aircraft. This study can contribute to practice in making an effective decision, especially helping executive management of company due to selecting appropriate aircraft and the track in the flight plan based on the block fuel consumption for business operation.

  9. Opportunity costs calculation in agent-based vehicle routing and scheduling

    NARCIS (Netherlands)

    Mes, Martijn R.K.; van der Heijden, Matthijs C.; Schuur, Peter

    2006-01-01

    In this paper we consider a real-time, dynamic pickup and delivery problem with timewindows where orders should be assigned to one of a set of competing transportation companies. Our approach decomposes the problem into a multi-agent structure where vehicle agents are responsible for the routing and

  10. Quality of Service Issues for Reinforcement Learning Based Routing Algorithm for Ad-Hoc Networks

    OpenAIRE

    Kulkarni, Shrirang Ambaji; Rao, G. Raghavendra

    2012-01-01

    Mobile ad-hoc networks are dynamic networks which are decentralized and autonomous in nature. Many routing algorithms have been proposed for these dynamic networks. It is an important problem to model Quality of Service requirements on these types of algorithms which traditionally have certain limitations. To model this scenario we have considered a reinforcement learning algorithm SAMPLE. SAMPLE promises to deal effectively with congestion and under high traffic load. As it is natural for ad...

  11. Transportation routing analysis geographic information system -- TRAGIS, a multimodal transportation routing tool

    International Nuclear Information System (INIS)

    Johnson, P.E.

    1995-01-01

    Over 15 years ago, Oak Ridge National Laboratory (ORNL) developed two transportation routing models: HIGHWAY, which predicts truck transportation routes, and INTERLINE, which predicts rail transportation routes. Subsequent modifications have been made to enhance each of these models. Some of these changes include population density information for routes, HM-164 routing regulations for highway route controlled quantities of radioactive materials (RAM) truck shipments, and inclusion of waterway routing into INTERLINE. The AIRPORT model, developed 2 years after the HIGHWAY and INTERLINE models, serves as an emergency response tool. This model identifies the nearest airports from a designated location. Currently, the AIRPORT model is inactive. The Transportation Management Division of the US Department of Energy held a Baseline Requirements Assessment Session on the HIGHWAY, INTERLINE, and AIRPORT models in April 1994 to bring together many users of these models and other experts in the transportation routing field to discuss these models and to decide on the capabilities that needed to be added. Of the many needs discussed, the primary one was to have the network databases within a geographic information system (GIS). As a result of the Baseline Requirements Session, the development of a new GIS model has been initiated. This paper will discuss the development of the new Transportation Routing Analysis GIS (TRAGIS) model at ORNL

  12. COMPARISON AODV AND DSDV ROUTING PROTOCOLS WITH USING FUZZY LOGIC IN THE MANET

    Directory of Open Access Journals (Sweden)

    Hamed Jelodar

    2014-06-01

    Full Text Available Mobile ad hoc networks have consisted of the nodes which are freely displaced. In other words, this network has dynamic topology. Routing protocols find route of forwarding data packets from the source node to the destination node. A routing protocol plays important role in finding the shortest time and the route path. In this paper, considering significance of the subject, attempt has been made to present a model using fuzzy logic approach to evaluate and compare two routing protocols i.e. AODV DSDV using effective factor of the number of nodes based on 2 outputs of delay and throughput rate (totally fuzzy system with four outputs in order to select one of these two routing protocols properly under different conditions and based on need and goal. To show efficiency and truth of fuzzy system, two protocols have been evaluated completely equally using NS-2 simulator and attempt has been made to prove efficiency of the designed fuzzy system by comparing results of simulation of fuzzy system and NS-2 software.

  13. An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization.

    Science.gov (United States)

    Jiang, Ailian; Zheng, Lihong

    2018-03-29

    Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

  14. A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Lesiba Morries Kola

    2017-12-01

    Full Text Available The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources. We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV and the weighted cumulative expected transmission time (WCETT routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

  15. Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model

    Directory of Open Access Journals (Sweden)

    Yi Yang

    2014-01-01

    Full Text Available This paper mainly focuses on routing in two-dimensional mesh networks. We propose a novel faulty block model, which is cracky rectangular block, for fault-tolerant adaptive routing. All the faulty nodes and faulty links are surrounded in this type of block, which is a convex structure, in order to avoid routing livelock. Additionally, the model constructs the interior spanning forest for each block in order to keep in touch with the nodes inside of each block. The procedure for block construction is dynamically and totally distributed. The construction algorithm is simple and ease of implementation. And this is a fully adaptive block which will dynamically adjust its scale in accordance with the situation of networks, either the fault emergence or the fault recovery, without shutdown of the system. Based on this model, we also develop a distributed fault-tolerant routing algorithm. Then we give the formal proof for this algorithm to guarantee that messages will always reach their destinations if and only if the destination nodes keep connecting with these mesh networks. So the new model and routing algorithm maximize the availability of the nodes in networks. This is a noticeable overall improvement of fault tolerability of the system.

  16. Remotely Sensed Based Lake/Reservoir Routing in Congo River Basin

    Science.gov (United States)

    Raoufi, R.; Beighley, E.; Lee, H.

    2017-12-01

    Lake and reservoir dynamics can influence local to regional water cycles but are often not well represented in hydrologic models. One challenge that limits their inclusion in models is the need for detailed storage-discharge behavior that can be further complicated in reservoirs where specific operation rules are employed. Here, the Hillslope River Routing (HRR) model is combined with a remotely sensed based Reservoir Routing (RR) method and applied to the Congo River Basin. Given that topographic data are often continuous over the entire terrestrial surface (i.e., does not differentiate between land and open water), the HRR-RR model integrates topographic derived river networks and catchment boundaries (e.g., HydroSHEDs) with water boundary extents (e.g., Global Lakes and Wetlands Database) to develop the computational framework. The catchments bordering lakes and reservoirs are partitioned into water and land portions, where representative flowpath characteristics are determined and vertical water balance and lateral routings is performed separately on each partition based on applicable process models (e.g., open water evaporation vs. evapotranspiration). To enable reservoir routing, remotely sensed water surface elevations and extents are combined to determine the storage change time series. Based on the available time series, representative storage change patterns are determined. Lake/reservoir routing is performed by combining inflows from the HRR-RR model and the representative storage change patterns to determine outflows. In this study, a suite of storage change patterns derived from remotely sensed measurements are determined representative patterns for wet, dry and average conditions. The HRR-RR model dynamically selects and uses the optimal storage change pattern for the routing process based on these hydrologic conditions. The HRR-RR model results are presented to highlight the importance of lake attenuation/routing in the Congo Basin.

  17. Modelling the role of multi-transmission routes in the epidemiology of bovine tuberculosis in cattle and buffalo populations.

    Science.gov (United States)

    Phepa, Patrick B; Chirove, Faraimunashe; Govinder, Keshlan S

    2016-07-01

    A mathematical model that describes the transmission dynamics of bovine tuberculosis (BTB) in both buffalo and cattle populations is proposed. The model incorporates cross-infection and contaminated environment transmission routes. A full analysis of the model is undertaken. The reproduction number of the entire model is comprised of cross-infection and contaminated parameters. This underscores the importance of including both cross-infection and contaminated environment transmission routes. Crucially our simulations suggest that the disease has a more devastating effect on cattle populations than on buffalo populations when all transmission routes are involved. This has important implications for agriculture and tourism. Copyright © 2016 Elsevier Inc. All rights reserved.

  18. Individuality in bird migration: routes and timing.

    Science.gov (United States)

    Vardanis, Yannis; Klaassen, Raymond H G; Strandberg, Roine; Alerstam, Thomas

    2011-08-23

    The exploration of animal migration has entered a new era with individual-based tracking during multiple years. Here, we investigated repeated migratory journeys of a long-distance migrating bird, the marsh harrier Circus aeruginosus, in order to analyse the variation within and between individuals with respect to routes and timing. We found that there was a stronger individual repeatability in time than in space. Thus, the annual timing of migration varied much less between repeated journeys of the same individual than between different individuals, while there was considerable variation in the routes of the same individual on repeated journeys. The overall contrast in repeatability between time and space was unexpected and may be owing to strong endogenous control of timing, while short-term variation in environmental conditions (weather and habitat) might promote route flexibility. The individual variation in migration routes indicates that the birds navigate mainly by other means than detailed route recapitulation based on landmark recognition. This journal is © 2011 The Royal Society

  19. Low Carbon Footprint Routes for Bird Watching

    Directory of Open Access Journals (Sweden)

    Wei-Ta Fang

    2015-03-01

    Full Text Available Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic information systems to detect the shortest path, thereby solving the problems associated with time-consuming transport. Based on the results of road network analyses, optimal travel-route planning can be determined. These methods include simulated annealing (SA and genetic algorithms (GA. We applied two algorithms in our simulation research to detect which one is an appropriate algorithm for running carbon-routing algorithms at the regional scale. SA, which is superior to GA, is considered an excellent approach to search for the optimal path to reduce carbon dioxide and high gasoline fees, thereby controlling travel time by using the shortest travel routes.

  20. An Indirect Route for Ethanol Production

    Energy Technology Data Exchange (ETDEWEB)

    Eggeman, T.; Verser, D.; Weber, E.

    2005-04-29

    The ZeaChem indirect method is a radically new approach to producing fuel ethanol from renewable resources. Sugar and syngas processing platforms are combined in a novel way that allows all fractions of biomass feedstocks (e.g. carbohydrates, lignins, etc.) to contribute their energy directly into the ethanol product via fermentation and hydrogen based chemical process technologies. The goals of this project were: (1) Collect engineering data necessary for scale-up of the indirect route for ethanol production, and (2) Produce process and economic models to guide the development effort. Both goals were successfully accomplished. The projected economics of the Base Case developed in this work are comparable to today's corn based ethanol technology. Sensitivity analysis shows that significant improvements in economics for the indirect route would result if a biomass feedstock rather that starch hydrolyzate were used as the carbohydrate source. The energy ratio, defined as the ratio of green energy produced divided by the amount of fossil energy consumed, is projected to be 3.11 to 12.32 for the indirect route depending upon the details of implementation. Conventional technology has an energy ratio of 1.34, thus the indirect route will have a significant environmental advantage over today's technology. Energy savings of 7.48 trillion Btu/yr will result when 100 MMgal/yr (neat) of ethanol capacity via the indirect route is placed on-line by the year 2010.

  1. Routing algorithms in networks-on-chip

    CERN Document Server

    Daneshtalab, Masoud

    2014-01-01

    This book provides a single-source reference to routing algorithms for Networks-on-Chip (NoCs), as well as in-depth discussions of advanced solutions applied to current and next generation, many core NoC-based Systems-on-Chip (SoCs). After a basic introduction to the NoC design paradigm and architectures, routing algorithms for NoC architectures are presented and discussed at all abstraction levels, from the algorithmic level to actual implementation.  Coverage emphasizes the role played by the routing algorithm and is organized around key problems affecting current and next generation, many-core SoCs. A selection of routing algorithms is included, specifically designed to address key issues faced by designers in the ultra-deep sub-micron (UDSM) era, including performance improvement, power, energy, and thermal issues, fault tolerance and reliability.   ·         Provides a comprehensive overview of routing algorithms for Networks-on-Chip and NoC-based, manycore systems; ·         Describe...

  2. Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

    OpenAIRE

    Schurgot, Mary R.; Comaniciu, Cristina; Jaffrès-Runser, Katia

    2011-01-01

    This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance tradeoffs from a multi-objective perspective is highlighted.

  3. Route choices of transport bicyclists: a comparison of actually used and shortest routes.

    Science.gov (United States)

    Krenn, Patricia Jasmin; Oja, Pekka; Titze, Sylvia

    2014-03-06

    Despite evidence that environmental features are related to physical activity, the association between the built environment and bicycling for transportation remains a poorly investigated subject. The aim of the study was to improve our understanding of the environmental determinants of bicycling as a means of transportation in urban European settings by comparing the spatial differences between the routes actually used by bicyclists and the shortest possible routes. In the present study we examined differences in the currently used and the shortest possible bicycling routes, with respect to distance, type of street, and environmental characteristics, in the city of Graz, Austria. The objective measurement methods of a Global Positioning System (GPS) and a Geographic Information System (GIS) were used. Bicycling routes actually used were significantly longer than the shortest possible routes. Furthermore, the following attributes were also significantly different between the used route compared to the shortest possible route: Bicyclists often used bicycle lanes and pathways, flat and green areas, and they rarely used main roads and crossings. The results of the study support our hypothesis that bicyclists prefer bicycle pathways and lanes instead of the shortest possible routes. This underlines the importance of a well-developed bicycling infrastructure in urban communities.

  4. Children's route choice during active transportation to school: Difference between shortest and actual route

    NARCIS (Netherlands)

    Dessing, D.; Vries, S.I. de; Hegeman, G.; Verhagen, E.; Mechelen, W. van; Pierik, F.H.

    2016-01-01

    Background: The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible

  5. Children's route choice during active transportation to school : difference between shortest and actual route

    NARCIS (Netherlands)

    F.H. Pierik; G. Hegeman; D. Dessing; S.I. (Sanne) de Vries; W. van Mechelen

    2016-01-01

    Background: The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible

  6. Advances in dynamic network modeling in complex transportation systems

    CERN Document Server

    Ukkusuri, Satish V

    2013-01-01

    This book focuses on the latest in dynamic network modeling, including route guidance and traffic control in transportation systems and other complex infrastructure networks. Covers dynamic traffic assignment, flow modeling, mobile sensor deployment and more.

  7. Dynamic traffic assignment on parallel computers

    Energy Technology Data Exchange (ETDEWEB)

    Nagel, K.; Frye, R.; Jakob, R.; Rickert, M.; Stretz, P.

    1998-12-01

    The authors describe part of the current framework of the TRANSIMS traffic research project at the Los Alamos National Laboratory. It includes parallel implementations of a route planner and a microscopic traffic simulation model. They present performance figures and results of an offline load-balancing scheme used in one of the iterative re-planning runs required for dynamic route assignment.

  8. Dynamic cellular manufacturing system design considering ...

    Indian Academy of Sciences (India)

    Kamal Deep

    tradeoff in a dynamic cellular manufacturing system is proposed in consideration with multiple part process route. This paper puts emphasize on the .... limited number of distinct paths considering resource capacity. The best routing is ..... all the other methods considered such as bond energy algorithm, direct clustering ...

  9. Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks

    International Nuclear Information System (INIS)

    Comellas, Francesc; Miralles, Alicia

    2009-01-01

    This paper introduces a labeling and optimal routing algorithm for a family of modular, self-similar, small-world graphs with clustering zero. Many properties of this family are comparable to those of networks associated with technological and biological systems with low clustering, such as the power grid, some electronic circuits and protein networks. For these systems, the existence of models with an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization) and also to understand the underlying mechanisms that have shaped their particular structure.

  10. Compact OXC architecture, design and prototype development for flexible waveband routing optical networks.

    Science.gov (United States)

    Ishikawa, Tomohiro; Mori, Yojiro; Hasegawa, Hiroshi; Subramaniam, Suresh; Sato, Ken-Ichi; Moriwaki, Osamu

    2017-07-10

    A novel compact OXC node architecture that combines WSSs and arrays of small scale optical delivery-coupling type switches ("DCSWs") is proposed. Unlike conventional OXC nodes, the WSSs are only responsible for dynamic path bundling ("flexible waveband") while the small scale optical switches route bundled path groups. A network design algorithm that is aware of the routing scheme is also proposed, and numerical experiments elucidate that the necessary number of WSSs and amplifiers can be significantly reduced. A prototype of the proposed OXC is also developed using monolithic arrayed DCSWs. Transmission experiments on the prototype verify the proposal's technical feasibility.

  11. A Set Packing Inspired Method for Real-Time Junction Train Routing

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

    Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily...... basis at major railway junctions where disruptions to rail traffi c make the planned schedule/routing infeasible and rolling stock planners are forced to reschedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly...

  12. A set packing inspired method for real-time junction train routing

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

    2013-01-01

    Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily...... basis at major railway junctions where disruptions to rail traffic make the planned schedule/routing infeasible and rolling stock planners are forced to re-schedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly...

  13. Evolution Strategies in the Multipoint Connections Routing

    Directory of Open Access Journals (Sweden)

    L. Krulikovska

    2010-09-01

    Full Text Available Routing of multipoint connections plays an important role in final cost and quality of a found connection. New algorithms with better results are still searched. In this paper, a possibility of using the evolution strategies (ES for routing is presented. Quality of found connection is evaluated from the view of final cost and time spent on a searching procedure. First, parametrical analysis of results of the ES are discussed and compared with the Prim’s algorithm, which was chosen as a representative of the deterministic routing algorithms. Second, ways for improving the ES are suggested and implemented. The obtained results are reviewed. The main improvements are specified and discussed in conclusion.

  14. Enabling Routes as Context in Mobile Services

    DEFF Research Database (Denmark)

    Brilingaite, Agne; Jensen, Christian Søndergaard; Zokaite, Nora

    2004-01-01

    With the continuing advances in wireless communications, geo-positioning, and portable electronics, an infrastructure is emerging that enables the delivery of on-line, location-enabled services to very large numbers of mobile users. A typical usage situation for mobile services is one characterized...... by a small screen and no keyboard, and by the service being only a secondary focus of the user. It is therefore particularly important to deliver the "right" information and service at the right time, with as little user interaction as possible. This may be achieved by making services context aware.......Mobile users frequently follow the same route to a destination as they did during previous trips to the destination, and the route and destination are important aspects of the context for a range of services. This paper presents key concepts underlying a software component that discovers the routes of a user...

  15. Hazardous materials routing - risk management of mismanagement

    International Nuclear Information System (INIS)

    Glickman, T.S.

    1988-01-01

    Along with emergency planning and preparedness, the placement of restrictions on routing has become an increasingly popular device for managing the highway and rail risks of hazardous materials transportation. Federal studies conducted in 1985 indicate that at that time there were 513 different state and local restrictions on the routing of hazardous materials for these two modes of transportation, and that there were 136 state and local notification requirements, that is, restrictions that take the form of a statute or ordinance requiring advance warning or periodic reporting about hazardous materials shipments. Routing restrictions also take the form of prohibiting the use of road, a tunnel, or a bridge for a specified set of hazardous materials

  16. Generalized routing protocols for multihop relay networks

    KAUST Repository

    Khan, Fahd Ahmed

    2011-07-01

    Performance of multihop cooperative networks depends on the routing protocols employed. In this paper we propose the last-n-hop selection protocol, the dual path protocol, the forward-backward last-n-hop selection protocol and the forward-backward dual path protocol for the routing of data through multihop relay networks. The average symbol error probability performance of the schemes is analysed by simulations. It is shown that close to optimal performance can be achieved by using the last-n-hop selection protocol and its forward-backward variant. Furthermore we also compute the complexity of the protocols in terms of number of channel state information required and the number of comparisons required for routing the signal through the network. © 2011 IEEE.

  17. Waste Collection Vehicle Routing Problem: Literature Review

    Directory of Open Access Journals (Sweden)

    Hui Han

    2015-08-01

    Full Text Available Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP in literature. Based on a classification of waste collection (residential, commercial and industrial, firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

  18. The Geomorphological Effects of Old Routes

    Science.gov (United States)

    Martinek, Jan; Bíl, Michal

    2017-04-01

    The communication network in rural areas in the historical Czech Lands predominantly consisted of unpaved routes prior to the eighteenth century. Certain parts of the network were transformed gradually into the current roads and are now being used by motor traffic. The majority of the old routes form, however, an abandoned network the remnants of which (abandoned during the Middle Ages or even earlier) are currently being discovered. Certain segments of used unpaved routes were, over the course of time, transformed into holloways (sunken lanes) and consequently also abandoned. The degree of incision of the holloway into the soil was determined by local geological conditions. Routes, which were abandoned due to more difficult transport in holloways, have distinct linear forms and can often be found as a grouping of parallel holloways. This indicates that these routes were frequently used or localized on low-resistant ground. Analyses of the precise digital elevation models, derived from LIDAR data, can reveal the distinct pattern of an old route network quite often interacting with other geomorphological phenomena (e.g., landslides, streams) or old human constructions (e.g., fortified settlements). We will present several cases where old paths interacted with landslides. These facts can consequently be used for dating the purposes of both the landslides and the old path sections. General erosion impacts, the degree of incision of the old transportation lines, can also be quantified through analyses of digital elevation models taking into consideration the former and new, incised, surface. We will demonstrate the methodology used for these analyses and the preliminary results.

  19. The MRSD web server for metabolic route search and design

    OpenAIRE

    sprotocols

    2015-01-01

    Authors: yong cao, Deguo Xia & Haoran Zheng ### Abstract The Metabolic Route Search and Design (MRSD) server is an integrated platform for metabolic route search (MRS) and metabolic route design (MRD) based on the data from KEGG. MRS computes metabolic routes between the source metabolite and the product metabolite on the weighted compound transforming graph. Each graph represents a metabolic network. The output from a typical server run contains graphic illustrating metabolic routes ...

  20. Intelligent emission-sensitive routing for plugin hybrid electric vehicles.

    Science.gov (United States)

    Sun, Zhonghao; Zhou, Xingshe

    2016-01-01

    The existing transportation sector creates heavily environmental impacts and is a prime cause for the current climate change. The need to reduce emissions from this sector has stimulated efforts to speed up the application of electric vehicles (EVs). A subset of EVs, called plug-in hybrid electric vehicles (PHEVs), backup batteries with combustion engine, which makes PHEVs have a comparable driving range to conventional vehicles. However, this hybridization comes at a cost of higher emissions than all-electric vehicles. This paper studies the routing problem for PHEVs to minimize emissions. The existing shortest-path based algorithms cannot be applied to solving this problem, because of the several new challenges: (1) an optimal route may contain circles caused by detour for recharging; (2) emissions of PHEVs not only depend on the driving distance, but also depend on the terrain and the state of charge (SOC) of batteries; (3) batteries can harvest energy by regenerative braking, which makes some road segments have negative energy consumption. To address these challenges, this paper proposes a green navigation algorithm (GNA) which finds the optimal strategies: where to go and where to recharge. GNA discretizes the SOC, then makes the PHEV routing problem to satisfy the principle of optimality. Finally, GNA adopts dynamic programming to solve the problem. We evaluate GNA using synthetic maps generated by the delaunay triangulation. The results show that GNA can save more than 10 % energy and reduce 10 % emissions when compared to the shortest path algorithm. We also observe that PHEVs with the battery capacity of 10-15 KWh detour most and nearly no detour when larger than 30 KWh. This observation gives some insights when developing PHEVs.

  1. Applied Multiprotocol Routing in IP Telephony

    Directory of Open Access Journals (Sweden)

    Miroslav Voznak

    2010-01-01

    Full Text Available The aim of the project was to create a multi-protocol system using SIP, H.323 and MGCP standards, which would ensure routing to various types of VoIP networks. The priority was to provide multi-protocol support to SIP and H.323 signalling and the support of the routing using the ENUM standard which has recently passed from the trial phase into full operation in the Czech Republic. The document describes the system's architecture and the components used. It also briefly describes ENUM.

  2. Reconfigurable Robust Routing for Mobile Outreach Network

    Science.gov (United States)

    Lin, Ching-Fang

    2010-01-01

    The Reconfigurable Robust Routing for Mobile Outreach Network (R3MOO N) provides advanced communications networking technologies suitable for the lunar surface environment and applications. The R3MOON techn ology is based on a detailed concept of operations tailored for luna r surface networks, and includes intelligent routing algorithms and wireless mesh network implementation on AGNC's Coremicro Robots. The product's features include an integrated communication solution inco rporating energy efficiency and disruption-tolerance in a mobile ad h oc network, and a real-time control module to provide researchers an d engineers a convenient tool for reconfiguration, investigation, an d management.

  3. Vessels Route Planning Problem with Uncertain Data

    Directory of Open Access Journals (Sweden)

    Tomasz Neumann

    2016-09-01

    Full Text Available The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.

  4. Effective Privacy-Preserving Online Route Planning

    DEFF Research Database (Denmark)

    Ruiz Vicente, Carmen; Assent, Ira; Jensen, Christian Søndergaard

    2011-01-01

    An online Route Planning Service (RPS) computes a route from one location to another. Current RPSs such as Google Maps require the use of precise locations. However, some users may not want to disclose their source and destination locations due to privacy concerns. An approach that supplies fake...... privacy. The solution re-uses a standard online RPS rather than replicate this functionality, and it needs no trusted third party. The solution is able to compute the exact results without leaking of the exact locations to the RPS or un-trusted parties. In addition, we provide heuristics that reduce...

  5. Enabling Routes as Context in Mobile Services

    DEFF Research Database (Denmark)

    Brilingaite, Agne; Jensen, Christian Søndergaard; Zokaite, Nora

    With the continuing advances in wireless communications, geo-positioning, and portable electronics, an infrastructure is emerging that enables the delivery of on-line, location-enabled services to very large numbers of mobile users. A typical usage situation for mobile services is one characterized...... aware. Mobile users frequently follow the same route to a destination as they did during previous trips to the destination, and the route and destination constitute important aspects of the context for a range of services. This paper presents key concepts underlying a software component that identifies...

  6. Mathematical Aspects of Network Routing Optimization

    CERN Document Server

    Oliveira, Carlos AS

    2011-01-01

    Before the appearance of broadband links and wireless systems, networks have been used to connect people in new ways. Now, the modern world is connected through large-scale, computational networked systems such as the Internet. Because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area. "Mathematical Aspects of Network Routing Optimization" focuses on computational issues arising from the process of optimizing network routes, such as quality of the resulting links and their reli

  7. Urban Freight Truck Routing under Stochastic Congestion and Emission Considerations

    Directory of Open Access Journals (Sweden)

    Taesung Hwang

    2015-05-01

    Full Text Available Freight trucks are known to be a major source of air pollutants as well as greenhouse gas emissions in U.S. metropolitan areas, and they have significant effects on air quality and global climate change. Emissions from freight trucks during their deliveries should be considered by the trucking service sector when they make routing decisions. This study proposes a model that incorporates total delivery time, various emissions including CO2, VOC, NOX, and PM from freight truck activities, and a penalty for late or early arrival into the total cost objective of a stochastic shortest path problem. We focus on urban transportation networks in which random congestion states on each link follows an independent probability distribution. Our model finds the best truck routing on a given network so as to minimize the expected total cost. This problem is formulated into a mathematical model, and two solution algorithms including a dynamic programming approach and a deterministic shortest path heuristic are proposed. Numerical examples show that the proposed approach performs very well even for the large-size U.S. urban networks.

  8. Mental simulation of routes during navigation involves adaptive temporal compression.

    Science.gov (United States)

    Arnold, Aiden E G F; Iaria, Giuseppe; Ekstrom, Arne D

    2016-12-01

    Mental simulation is a hallmark feature of human cognition, allowing features from memories to be flexibly used during prospection. While past studies demonstrate the preservation of real-world features such as size and distance during mental simulation, their temporal dynamics remains unknown. Here, we compare mental simulations to navigation of routes in a large-scale spatial environment to test the hypothesis that such simulations are temporally compressed in an adaptive manner. Our results show that simulations occurred at 2.39× the speed it took to navigate a route, increasing in compression (3.57×) for slower movement speeds. Participant self-reports of vividness and spatial coherence of simulations also correlated strongly with simulation duration, providing an important link between subjective experiences of simulated events and how spatial representations are combined during prospection. These findings suggest that simulation of spatial events involve adaptive temporal mechanisms, mediated partly by the fidelity of memories used to generate the simulation. Copyright © 2016 Elsevier B.V. All rights reserved.

  9. Advances in IP Micromobility Management Using a Mobility-Aware Routing Protocol

    Directory of Open Access Journals (Sweden)

    Michael Georgiades

    2007-01-01

    Full Text Available Several micromobility schemes have been proposed to augment Mobile IP and provide a faster and smoother handoff than what is achievable by Mobile IP alone, the majority of which can be categorized into either “network prefix-based” or “host-specific forwarding” mobility management protocols, depending on the routing method used. This letter proposes a mobility-aware routing protocol (MARP which makes use of both of these routing methods using dynamic IP address allocation. Its performance is evaluated and compared against hierarchical Mobile IP (HMIP and Cellular IP based on handoff performance, end-to-end delivery delay, and scalability. The results demonstrate that MARP is a more robust, flexible, and scalable micromobility protocol, minimizes session disruption, and offers improvements in handoff performance.

  10. Adaptive Reliable Routing Based on Cluster Hierarchy for Wireless Multimedia Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chen Min

    2010-01-01

    Full Text Available As a multimedia information acquisition and processing method, wireless multimedia sensor network(WMSN has great application potential in military and civilian areas. Compared with traditional wireless sensor network, the routing design of WMSN should obtain more attention on the quality of transmission. This paper proposes an adaptive reliable routing based on clustering hierarchy named ARCH, which includes energy prediction and power allocation mechanism. To obtain a better performance, the cluster structure is formed based on cellular topology. The introduced prediction mechanism makes the sensor nodes predict the remaining energy of other nodes, which dramatically reduces the overall information needed for energy balancing. ARCH can dynamically balance the energy consumption of nodes based on the predicted results provided by power allocation. The simulation results prove the efficiency of the proposed ARCH routing.

  11. An adaptive density-based routing protocol for flying Ad Hoc networks

    Science.gov (United States)

    Zheng, Xueli; Qi, Qian; Wang, Qingwen; Li, Yongqiang

    2017-10-01

    An Adaptive Density-based Routing Protocol (ADRP) for Flying Ad Hoc Networks (FANETs) is proposed in this paper. The main objective is to calculate forwarding probability adaptively in order to increase the efficiency of forwarding in FANETs. ADRP dynamically fine-tunes the rebroadcasting probability of a node for routing request packets according to the number of neighbour nodes. Indeed, it is more interesting to privilege the retransmission by nodes with little neighbour nodes. We describe the protocol, implement it and evaluate its performance using NS-2 network simulator. Simulation results reveal that ADRP achieves better performance in terms of the packet delivery fraction, average end-to-end delay, normalized routing load, normalized MAC load and throughput, which is respectively compared with AODV.

  12. A Stable TORA Based for Routing in Mobile Ad Ηoc Networks

    Directory of Open Access Journals (Sweden)

    S. Jahanbakhsh Gudakahriz

    2018-02-01

    Full Text Available A mobile ad hoc network (MANET is defined as a set of mobile nodes which communicate through wireless links with no central infrastructure. In these networks nodes are always moving and could enter to or exit from the network at any time. Therefore, network topology is completely dynamic. Another characteristic of these networks is the low node energy level, resulting from inherent node limitations. Stable routing is one method to face routing challenges in mobile ad hoc networks. The objective of this study is to stabilize TORA protocol which is a distributed routing protocol, with high adaptation, efficiency, and suitability for large and dense mobile ad hoc networks and thus to provide a new high efficiency protocol. The proposed protocol introduced as Stable-TORA has been compared with base protocol TORA in different scenarios via NS-2 simulator environment and its efficiency is evaluated.

  13. Label-based routing for a family of small-world Farey graphs.

    Science.gov (United States)

    Zhai, Yinhu; Wang, Yinhe

    2016-05-11

    We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product of two Fibonacci numbers, are determined only by their labels, and the time complexity of the algorithm is O(n). It is the first algorithm to figure out all the shortest paths between any pair of vertices in a kind of deterministic graphs. For Farey networks, the existence of an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization and structural controllability) and also to understand the underlying mechanisms that have shaped their particular structure.

  14. INTEGRATION Framework for Modeling Eco-routing Strategies: Logic and Preliminary Results

    Directory of Open Access Journals (Sweden)

    Hesham A. Rakha

    2012-09-01

    Full Text Available The paper presents the INTEGRATION microscopic traffic assignment and simulation framework for modeling eco-routing strategies. Two eco-routing algorithms are developed: one based on vehicle sub-populations (ECO-Subpopulation Feedback Assignment or ECO-SFA and another based on individual agents (ECO-Agent Feedback Assignment or ECO-AFA. Both approaches initially assign vehicles based on fuel consumption levels for travel at the facility free-flow speed. Subsequently, fuel consumption estimates are refined based on experiences of other vehicles within the same class. The proposed framework is intended to evaluate the network-wide impacts of eco-routing strategies. This stochastic, multi-class, dynamic traffic assignment framework was demonstrated to work for two scenarios. Savings in fuel consumption levels in the range of 15 percent were observed and potential implementation challenges were identified.

  15. A Decentralized Approach to Formation Flight Routing

    NARCIS (Netherlands)

    Visser, H.G.; Lopes dos Santos, Bruno F.; Verhagen, C.M.A.

    2016-01-01

    This paper describes the development of an optimization-based cooperative planning system for the efficient routing and scheduling of flight formations. This study considers the use of formation flight as a means to reduce the overall fuel consumption of civil aviation in long-haul operations. It

  16. How Effective is Routing for Wireless Networking

    Science.gov (United States)

    2016-03-05

    generation (loadng),” draft-clausen-lln-loadng-12 (work in progress), 2014. [12] T. Winter, “Rpl: Ipv6 routing protocol for low-power and lossy networks...Neighbor discovery optimization for ipv6 over low-power wire- less personal area networks (6lowpans),” IETF RFC 6775, 2012. [18] J. Hui and R. Kelsey

  17. Stellenbosch Wine Route wineries: Management's perspective on ...

    African Journals Online (AJOL)

    Kirstam

    10Key words: wineries, wine tourism, Stellenbosch Wine Route, key success factors, advantages and ... advantages and disadvantages presented by wine tourism and (b) the wine tourism facilities and services that ... Events shaping the current South African wine industry commenced as early as the. 1600s, with the first ...

  18. Scenemash: multimodal route summarization for city exploration

    NARCIS (Netherlands)

    Berg, J. van den; Rudinac, S.; Worring, M.

    2016-01-01

    The potential of mining tourist information from social multimedia data gives rise to new applications offering much richer impressions of the city. In this paper we propose Scenemash, a system that generates multimodal summaries of multiple alternative routes between locations in a city. To get

  19. Soft chemical routes to semiconductor nanostructures

    Indian Academy of Sciences (India)

    Soft chemistry has emerged as an important means of generating nanocrystals, nanowires and other nanostructures of semiconducting materials. We describe the synthesis of CdS and other metal chalcogenide nanocrystals by a solvothermal route. We also describe the synthesis of nanocrystals of AlN, GaN and InN by the ...

  20. A Geographical Heuristic Routing Protocol for VANETs

    Science.gov (United States)

    Urquiza-Aguiar, Luis; Tripp-Barba, Carolina; Aguilar Igartua, Mónica

    2016-01-01

    Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation). PMID:27669254

  1. SITE SUITABILITY ANALYSIS AND ROUTE OPTIMIZATION FOR ...

    African Journals Online (AJOL)

    Fimba

    hence the application of GIS and Remote Sensing to waste disposal Site Suitability analysis and route optimization for solid waste in Yola town. Different factors or criteria were considered in relation to solid waste disposal sites. In order to achieve the aim of this paper, the Boolean logic was used, where suitable areas were ...

  2. Graphical route information on variable message signs

    NARCIS (Netherlands)

    Alkim, T.P.; Mede, P.H.J. van der; Janssen, W.H.

    2002-01-01

    Reports on experiments in the Netherlands on the use of graphical route information panels (GRIP) as part of variable message systems (VMS) providing information to drivers. GRIP appear to be as safe as regular VMS. Digestion of the information presented is initially quicker for regular VMS, but

  3. Routing in Networks with Random Topologies

    Science.gov (United States)

    Bambos, Nicholas

    1997-01-01

    We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

  4. A Geographical Heuristic Routing Protocol for VANETs.

    Science.gov (United States)

    Urquiza-Aguiar, Luis; Tripp-Barba, Carolina; Aguilar Igartua, Mónica

    2016-09-23

    Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation).

  5. SUPPLEMENTARY INFORMATION Green synthetic route for ...

    Indian Academy of Sciences (India)

    GDY13

    Green synthetic route for perfumery compound (2-methoxyethyl) benzene using. Li/MgO catalyst. POOJA R TAMBE and ... A mixture containing fuel and oxidizer was taken in a silica crucible and heated to form highly .... Fogler H 1995 Elements of Chemical Reaction Engineering 2nd edn. Prentice-Hall,. New Delhi, India. (3).

  6. Soft chemical routes to semiconductor nanostructures

    Indian Academy of Sciences (India)

    Soft chemical routes to semiconductor nanostructures. UJJAL K GAUTAM1,2, KRIPASINDHU SARDAR1,2, F L DEEPAK1 and C N R RAO1,2,∗. 1Chemistry and Physics of Materials Unit and CSIR Centre of Excellence in Chemistry,. Jawaharlal Nehru Centre for Advanced Scientific Research, Jakkur P.O.,. Bangalore 560 ...

  7. Traffic disruption route Einstein near building 170

    CERN Multimedia

    A Lopez - TS/CE

    2005-01-01

    The TS/CE Group informs you that, for the duration of the work at Building 170, there may be some disruption to traffic on route Einstein in the vicinity of Building 170. The work is due to take place from the 14th to 18th February. For more information, please contact 165029. A. Lopez TS/CE

  8. A Geographical Heuristic Routing Protocol for VANETs

    Directory of Open Access Journals (Sweden)

    Luis Urquiza-Aguiar

    2016-09-01

    Full Text Available Vehicular ad hoc networks (VANETs leverage the communication system of Intelligent Transportation Systems (ITS. Recently, Delay-Tolerant Network (DTN routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation.

  9. Variable-speed, portable routing skate

    Science.gov (United States)

    Pesch, W. A.

    1967-01-01

    Lightweight, portable, variable-speed routing skate is used on heavy metal subassemblies which are impractical to move to a stationary machine. The assembly, consisting of the housing with rollers, router, and driving mechanism with transmission, weighs about forty pounds. Both speed and depth of cut are adjustable.

  10. Empirically Determined Passenger Ferry Navigable Routes within ...

    African Journals Online (AJOL)

    OLUWASOGO

    modelling of hydrographic information is important to control waterways boat services with existing roadway ... channel accretion. KEYWORDS: Navigable routes, hydrographic information, empirical analysis, under-keel clearance, river bed, topography. [Received May 04 2017; .... on features that may affect safe navigation.

  11. Experimental Comparison of Routing Protocols for Wireless Sensors Networks: Routing Overhead and Asymmetric Links

    OpenAIRE

    Audéoud , Henry-Joseph; Heusse , Martin

    2017-01-01

    International audience; RPL (the IETF Routing Protocol for Low-Power and Lossy Networks) and LRP (Lightweight Routing Protocol) have in common to build a collection tree (or, more precisely, a DODAG) and “downward” host routes in the wireless sensor network. Additionally, the objective of LRP is to keep control overhead as low as possible. To substantiate this claim, we compare RPL and LRP using 40 nodes of the IoT-LAB testbed — and the results are telling.We then introduce asymmetric links, ...

  12. Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

    A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize pro_t by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a _xed route network and itinerary as liner ships. Marine fuel...... is referred to as bunker fuel or simply bunker and bunker costs constitute a signi_cant part of the daily operating costs. There can be great variations in bunker prices across bunker ports so it is important to carefully plan bunkering for each ship. As ships operate 24 hours a day, they must refuel during...... and bunker consumption. We devise a solution method based on column generation with a dynamic programming algorithm to generate columns. The method is heuristic mainly due to a discretization of the continuous bunker purchase variables. We show that the integrated planning approach can increase pro...

  13. A Routing Mechanism for Cloud Outsourcing of Medical Imaging Repositories.

    Science.gov (United States)

    Godinho, Tiago Marques; Viana-Ferreira, Carlos; Bastião Silva, Luís A; Costa, Carlos

    2016-01-01

    Web-based technologies have been increasingly used in picture archive and communication systems (PACS), in services related to storage, distribution, and visualization of medical images. Nowadays, many healthcare institutions are outsourcing their repositories to the cloud. However, managing communications between multiple geo-distributed locations is still challenging due to the complexity of dealing with huge volumes of data and bandwidth requirements. Moreover, standard methodologies still do not take full advantage of outsourced archives, namely because their integration with other in-house solutions is troublesome. In order to improve the performance of distributed medical imaging networks, a smart routing mechanism was developed. This includes an innovative cache system based on splitting and dynamic management of digital imaging and communications in medicine objects. The proposed solution was successfully deployed in a regional PACS archive. The results obtained proved that it is better than conventional approaches, as it reduces remote access latency and also the required cache storage space.

  14. Using trust to secure geographic and energy aware routing against multiple attacks.

    Directory of Open Access Journals (Sweden)

    Guanghua Zhang

    Full Text Available To address the vulnerability of geographic routing to multiple security threats such as false routing information, selective forwarding and the Sybil attack in wireless sensor networks, this paper proposes a trust-based defending model against above-mentioned multiple attacks. Considering the characteristics of resource-constrained sensor nodes, trust values of neighboring nodes on the routing path can be calculated through the Dirichlet distribution function, which is based on data packets' acknowledgements in a certain period instead of energy-consuming monitoring. Trust is combined with the cost of geographic and energy aware routing for selecting the next hop of routing. At the same time, the initial trust is dynamically determined, service requests are restricted for malicious nodes in accordance with trust values, and the impact of node mobility is weakened by the trust evolution. The simulation results and analysis show that the proposed model under multiple attacks has advantages in packet delivery ratio and network lifetime over the existing models.

  15. Analysis of greedy decision making for geographic routing for networks of randomly moving objects

    International Nuclear Information System (INIS)

    Israr, A.; Asif, M.

    2015-01-01

    Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm) for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing) protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network. (author)

  16. Minimum expected delay-based routing protocol (MEDR) for Delay Tolerant Mobile Sensor Networks.

    Science.gov (United States)

    Feng, Yong; Liu, Ming; Wang, Xiaomin; Gong, Haigang

    2010-01-01

    It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing performance by finding and using the connected paths formed dynamically by mobile sensors. In MEDR, each sensor maintains two important parameters: Minimum Expected Delay (MED) and its expiration time. According to MED, messages will be delivered to the sensor that has at least a connected path with their hosting nodes, and has the shortest expected delay to communication directly with the sink node. Because of the changing network topology, the path is fragile and volatile, so we use the expiration time of MED to indicate the valid time of the path, and avoid wrong transmissions. Simulation results show that the proposed MEDR achieves a higher message delivery ratio with lower transmission overhead and data delivery delay than other DTMSN routing approaches.

  17. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

    Science.gov (United States)

    Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A.; Al-Muhtadi, Jalal; Rodrigues, Joel J. P. C.; Khalil, Mohammed Sayim; Ali Ahmed, Adel

    2016-01-01

    The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks. PMID:27043572

  18. Optimal Routing and Scheduling of Charge for Electric Vehicles: A Case Study

    Directory of Open Access Journals (Sweden)

    J. Barco

    2017-01-01

    Full Text Available There are increasing interests in improving public transportation systems. One of the proposed strategies for this improvement is the use of Battery Electric Vehicles (BEVs. This approach leads to a new challenge as the BEVs’ routing is exposed to the traditional routing problems of conventional vehicles, as well as the particular requirements of the electrical technologies of BEVs. Examples of BEVs’ routing problems include the autonomy, battery degradation, and charge process. This work presents a differential evolution algorithm for solving an electric vehicle routing problem (EVRP. The formulation of the EVRP to be solved is based on a scheme to coordinate the BEVs’ routing and recharge scheduling, considering operation and battery degradation costs. A model based on the longitudinal dynamics equation of motion estimates the energy consumption of each BEV. A case study, consisting of an airport shuttle service scenario, is used to illustrate the proposed methodology. For this transport service, the BEV energy consumption is estimated based on experimentally measured driving patterns.

  19. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks.

    Science.gov (United States)

    Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A; Al-Muhtadi, Jalal; Rodrigues, Joel J P C; Khalil, Mohammed Sayim; Ali Ahmed, Adel

    2016-03-31

    The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

  20. Route assessment using comparative risk factors integrated through a GIS

    International Nuclear Information System (INIS)

    Toth, D.M.; O'Connell, W.J.

    1996-01-01

    The assessment of potential alternative routes for the shipment of spent nuclear fuel was simplified through the use of comparative risk factors evaluated using detailed route and environmental attributes. The route characteristics, integrated into risk measures, vary strongly with location and were developed from national, state, and local sources. The route data and evaluation were managed using a geographic information system (GIS). An assessment of four real North Florida routes was performed and an interstate highway route exhibited the lowest risk based on the application of the risk factors