Science.gov

Sample records for multipath routing protocol

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

    PubMed Central

    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. PMID:22163854

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

    PubMed

    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. PMID:27258013

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

    PubMed Central

    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. PMID:27258013

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

    PubMed

    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.

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

    PubMed Central

    Yang, Jing; Xu, Mai; Zhao, Wei; Xu, Baoguo

    2010-01-01

    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. PMID:22399890

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

    PubMed

    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.

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

    PubMed Central

    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

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

    PubMed Central

    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

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

    PubMed

    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-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

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

    PubMed

    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.

  11. WEAMR — A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs

    PubMed Central

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

    2013-01-01

    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. PMID:23669714

  12. Performance Analysis of Node-Disjoint Paths in Multipath Routing for Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Murthy, G. Shiva; D'Souza, R. J.; Varaprasad, G.

    2011-12-01

    Routing in the resource constrained network is still a challenge. To increase the operational lifetme of the wireless senor networks is the major objective of energy efficeint routing protocols. Multipath routing protocols increases the QoS, network reliability, and lifetime. This work analyses the node-dsijoint paths which contribute in realising the objectives of mutlipath routing. This work proposes the three different criteria to select the node-disjoint paths between the source and sink node. They are (i) minimum hop (ii) maximum residual energy and (iii) maximum path cost. End to end delay, residual energy and throughput are the metrics considered to evaluate the performance of three different criteria to select node-disjoint paths between source and destination.

  13. LBMR: Load-Balanced Multipath Routing for Wireless Data-Intensive Transmission in Real-Time Medical Monitoring.

    PubMed

    Tseng, Chinyang Henry

    2016-01-01

    In wireless networks, low-power Zigbee is an excellent network solution for wireless medical monitoring systems. Medical monitoring generally involves transmission of a large amount of data and easily causes bottleneck problems. Although Zigbee's AODV mesh routing provides extensible multi-hop data transmission to extend network coverage, it originally does not, and needs to support some form of load balancing mechanism to avoid bottlenecks. To guarantee a more reliable multi-hop data transmission for life-critical medical applications, we have developed a multipath solution, called Load-Balanced Multipath Routing (LBMR) to replace Zigbee's routing mechanism. LBMR consists of three main parts: Layer Routing Construction (LRC), a Load Estimation Algorithm (LEA), and a Route Maintenance (RM) mechanism. LRC assigns nodes into different layers based on the node's distance to the medical data gateway. Nodes can have multiple next-hops delivering medical data toward the gateway. All neighboring layer-nodes exchange flow information containing current load, which is the used by the LEA to estimate future load of next-hops to the gateway. With LBMR, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balancing and avoid bottlenecks. Furthermore, RM can detect route failures in real-time and perform route redirection to ensure routing robustness. Since LRC and LEA prevent bottlenecks while RM ensures routing fault tolerance, LBMR provides a highly reliable routing service for medical monitoring. To evaluate these accomplishments, we compare LBMR with Zigbee's AODV and another multipath protocol, AOMDV. The simulation results demonstrate LBMR achieves better load balancing, less unreachable nodes, and better packet delivery ratio than either AODV or AOMDV. PMID:27258297

  14. LBMR: Load-Balanced Multipath Routing for Wireless Data-Intensive Transmission in Real-Time Medical Monitoring

    PubMed Central

    Tseng, Chinyang Henry

    2016-01-01

    In wireless networks, low-power Zigbee is an excellent network solution for wireless medical monitoring systems. Medical monitoring generally involves transmission of a large amount of data and easily causes bottleneck problems. Although Zigbee’s AODV mesh routing provides extensible multi-hop data transmission to extend network coverage, it originally does not, and needs to support some form of load balancing mechanism to avoid bottlenecks. To guarantee a more reliable multi-hop data transmission for life-critical medical applications, we have developed a multipath solution, called Load-Balanced Multipath Routing (LBMR) to replace Zigbee’s routing mechanism. LBMR consists of three main parts: Layer Routing Construction (LRC), a Load Estimation Algorithm (LEA), and a Route Maintenance (RM) mechanism. LRC assigns nodes into different layers based on the node’s distance to the medical data gateway. Nodes can have multiple next-hops delivering medical data toward the gateway. All neighboring layer-nodes exchange flow information containing current load, which is the used by the LEA to estimate future load of next-hops to the gateway. With LBMR, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balancing and avoid bottlenecks. Furthermore, RM can detect route failures in real-time and perform route redirection to ensure routing robustness. Since LRC and LEA prevent bottlenecks while RM ensures routing fault tolerance, LBMR provides a highly reliable routing service for medical monitoring. To evaluate these accomplishments, we compare LBMR with Zigbee’s AODV and another multipath protocol, AOMDV. The simulation results demonstrate LBMR achieves better load balancing, less unreachable nodes, and better packet delivery ratio than either AODV or AOMDV. PMID:27258297

  15. A Distant Multipath Routing Method for Reliable Wireless Multi-Hop Data Transmission

    NASA Astrophysics Data System (ADS)

    Terai, Kento; Anzai, Daisuke; Lee, Kyesan; Yanagihara, Kentaro; Hara, Shinsuke

    In a wireless multi-hop network between a source node (S) and a destination node (D), multipath routing in which S redundantly sends the same packets to D through multiple routes at the same time is effective for enhancing the reliability of the wireless data transmission by means of route diversity. However, when applying the multipath routing to a factory where huge robots are moving around, if closer multiple routes are selected, the probability that they are blocked by the robots at the same time becomes higher, so the reliability in terms of packet loss rate cannot be enhanced. In this paper, we propose a multipath routing method which can select physically distant multiple routes without any knowledge on the locations of nodes. We introduce a single metric composed of “the distance between routes” and “the route quality” by means of scalarization in multi-objective maximization problem and apply a genetic algorithm (GA) for searching for adequate routes which maximize the metric. Computer simulation results show that the proposed method can adaptively control the topologies of selected routes between S and D, and effectively reduce the packet loss rates.

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

    PubMed

    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.

  17. New Routing Metrics for ADHOC Network Routing Protocols

    NASA Astrophysics Data System (ADS)

    Reddy, P. C.

    2014-12-01

    The performance and reliability of Internet is measured using different quantities. When the quantities measured are essential and have wide range of acceptance then they are called metrics. Performance metrics enable comparison and selection among the alternatives. In computer networks, metrics are used to evaluate an application, protocol etc. Routing in adhoc networks is nontrivial. Routing protocols for adhoc networks are still evolving and there is need for continuous evaluation of them. In the literature existing, several routing protocols are evaluated using standard metrics under different conditions. This paper proposes new metrics for evaluation of routing protocols and uses them to evaluate the adhoc network routing protocols AODV, DSR, DSDV and TORA. Simulation environment is created using NS-2 simulator. Typical range of speeds, pause times and data rates are used. The results provide new insights in to the working of the routing protocols.

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

    PubMed

    Robinson, Y Harold; Rajaram, M

    2015-01-01

    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. PMID:26819966

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

    PubMed Central

    Robinson, Y. Harold; Rajaram, M.

    2015-01-01

    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. PMID:26819966

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

    PubMed

    Robinson, Y Harold; Rajaram, M

    2015-01-01

    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.

  1. Routing protocols in wireless sensor networks.

    PubMed

    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. PMID:22291515

  2. Routing Protocols in Wireless Sensor Networks

    PubMed Central

    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. PMID:22291515

  3. A Geographical Heuristic Routing Protocol for VANETs.

    PubMed

    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

  4. A Geographical Heuristic Routing Protocol for VANETs.

    PubMed

    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. A Survey on Underwater Acoustic Sensor Network Routing Protocols.

    PubMed

    Li, Ning; Martínez, José-Fernán; Meneses Chaus, Juan Manuel; Eckert, Martina

    2016-03-22

    Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research.

  6. A Survey on Underwater Acoustic Sensor Network Routing Protocols

    PubMed Central

    Li, Ning; Martínez, José-Fernán; Meneses Chaus, Juan Manuel; Eckert, Martina

    2016-01-01

    Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research. PMID:27011193

  7. A Survey on Underwater Acoustic Sensor Network Routing Protocols.

    PubMed

    Li, Ning; Martínez, José-Fernán; Meneses Chaus, Juan Manuel; Eckert, Martina

    2016-01-01

    Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research. PMID:27011193

  8. Fair resource allocation and stability for communication networks with multipath routing

    NASA Astrophysics Data System (ADS)

    Li, Shiyong; Sun, Wei; Hua, Changchun

    2014-11-01

    Multipath networks allow that each source-destination pair can have several different paths for data transmission, thus they improve the performance of increasingly bandwidth-hungry applications and well cater for traffic load balancing and bandwidth usage efficiency. This paper investigates fair resource allocation for users in multipath networks and formulates it as a multipath network utility maximisation problem with several fairness concepts. By applying the Lagrangian method, sub-problems for users and paths are derived from the resource allocation model and interpreted from an economic point of view. In order to solve the model, a novel rate-based flow control algorithm is proposed for achieving optimal resource allocation, which depends only on local information. In the presence of round-trip delays, sufficient conditions are obtained for local stability of the delayed algorithm. As for the end-to-end implementation in Internet, a window-based flow control mechanism is presented since it is more convenient to implement than rate-based flow control.

  9. Intelligent routing protocol for ad hoc wireless network

    NASA Astrophysics Data System (ADS)

    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

  10. A Survey on Clustering Routing Protocols in Wireless Sensor Networks

    PubMed Central

    Liu, Xuxun

    2012-01-01

    The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions. PMID:23112649

  11. Analyzing the effect of routing protocols on media access control protocols in radio networks

    SciTech Connect

    Barrett, C. L.; Drozda, M.; Marathe, A.; Marathe, M. V.

    2002-01-01

    We study the effect of routing protocols on the performance of media access control (MAC) protocols in wireless radio networks. Three well known MAC protocols: 802.11, CSMA, and MACA are considered. Similarly three recently proposed routing protocols: AODV, DSR and LAR scheme 1 are considered. The experimental analysis was carried out using GloMoSim: a tool for simulating wireless networks. The main focus of our experiments was to study how the routing protocols affect the performance of the MAC protocols when the underlying network and traffic parameters are varied. The performance of the protocols was measured w.r.t. five important parameters: (i) number of received packets, (ii) average latency of each packet, (iii) throughput (iv) long term fairness and (v) number of control packets at the MAC layer level. Our results show that combinations of routing and MAC protocols yield varying performance under varying network topology and traffic situations. The result has an important implication; no combination of routing protocol and MAC protocol is the best over all situations. Also, the performance analysis of protocols at a given level in the protocol stack needs to be studied not locally in isolation but as a part of the complete protocol stack. A novel aspect of our work is the use of statistical technique, ANOVA (Analysis of Variance) to characterize the effect of routing protocols on MAC protocols. This technique is of independent interest and can be utilized in several other simulation and empirical studies.

  12. A Survey of Routing Protocols in Wireless Body Sensor Networks

    PubMed Central

    Bangash, Javed Iqbal; Abdullah, Abdul Hanan; Anisi, Mohammad Hossein; Khan, Abdul Waheed

    2014-01-01

    Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses. PMID:24419163

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

    PubMed

    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.

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

    PubMed

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

    2013-01-01

    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. PMID:23385410

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

    PubMed Central

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

    2013-01-01

    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. PMID:23385410

  16. Fundamental Lifetime Mechanisms in Routing Protocols for Wireless Sensor Networks: A Survey and Open Issues

    PubMed Central

    Eslaminejad, Mohammadreza; Razak, Shukor Abd

    2012-01-01

    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. PMID:23202008

  17. A novel wavelength availability advertisement based ASON routing protocol implementation

    NASA Astrophysics Data System (ADS)

    Li, Jian; Liu, Juan; Zhang, Jie; Gu, Wanyi

    2005-11-01

    A novel wavelength availability advertisement based ASON routing protocol implementation is proposed in this paper which is derived from Open Shortest Path First protocol (OSPF) version 2. It can be applied to ASON network with a single control domain and can be easily extended to support routing in the multi-domain scenarios. Two new types of link state advertisement (LSA) are suggested for disseminating wavelength availability and network topology information. The OSPF mechanisms are inherited to ensure that the routing messages are delivered more reliably and converged more quickly while with fewer overheads. The topology auto discovery is realized through LSA flooding interacting with auto neighbor discovery using Link Management Protocol. The new LSA formats are given and how the link state database (LSD) is comprised is described. The new data structures proposed include topology resource list, adjacency list and route table. Then we analyze the differences of ASON in link state exchange, routing information flooding procedure, flushing procedure and new resources participating, i.e. new links or nodes join in an existing ASON. The link or node failure and recovery effect and how to deal with them are settled as well. In order to adopt different Routing and Wavelength Assignment (RWA) algorithms, a standard and efficient interface is designed. After extensive simulation we give the numerical analysis and come to the following conclusions: wavelength availability information flooding Convergence Time is about 30 milliseconds and it is not affected by RWA algorithms and the call traffic load; routing Protocol Average Overhead rises linearly with the increase of traffic load; Average Connection Setup Time decreases with the increase of traffic load because of the decrease of Average Routing Distance of the successfully lightpaths; Wavelength availability advertisement can greatly promote the blocking performance of ASON in relatively low traffic load; ASON

  18. A Network Coding Based Routing Protocol for Underwater Sensor Networks

    PubMed Central

    Wu, Huayang; Chen, Min; Guan, Xin

    2012-01-01

    Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime. PMID:22666045

  19. A Security Analysis of the 802.11s Wireless Mesh Network Routing Protocol and Its Secure Routing Protocols

    PubMed Central

    Tan, Whye Kit; Lee, Sang-Gon; Lam, Jun Huy; Yoo, Seong-Moo

    2013-01-01

    Wireless mesh networks (WMNs) can act as a scalable backbone by connecting separate sensor networks and even by connecting WMNs to a wired network. The Hybrid Wireless Mesh Protocol (HWMP) is the default routing protocol for the 802.11s WMN. The routing protocol is one of the most important parts of the network, and it requires protection, especially in the wireless environment. The existing security protocols, such as the Broadcast Integrity Protocol (BIP), Counter with cipher block chaining message authentication code protocol (CCMP), Secure Hybrid Wireless Mesh Protocol (SHWMP), Identity Based Cryptography HWMP (IBC-HWMP), Elliptic Curve Digital Signature Algorithm HWMP (ECDSA-HWMP), and Watchdog-HWMP aim to protect the HWMP frames. In this paper, we have analyzed the vulnerabilities of the HWMP and developed security requirements to protect these identified vulnerabilities. We applied the security requirements to analyze the existing secure schemes for HWMP. The results of our analysis indicate that none of these protocols is able to satisfy all of the security requirements. We also present a quantitative complexity comparison among the protocols and an example of a security scheme for HWMP to demonstrate how the result of our research can be utilized. Our research results thus provide a tool for designing secure schemes for the HWMP. PMID:24002231

  20. A security analysis of the 802.11s wireless mesh network routing protocol and its secure routing protocols.

    PubMed

    Tan, Whye Kit; Lee, Sang-Gon; Lam, Jun Huy; Yoo, Seong-Moo

    2013-09-02

    Wireless mesh networks (WMNs) can act as a scalable backbone by connecting separate sensor networks and even by connecting WMNs to a wired network. The Hybrid Wireless Mesh Protocol (HWMP) is the default routing protocol for the 802.11s WMN. The routing protocol is one of the most important parts of the network, and it requires protection, especially in the wireless environment. The existing security protocols, such as the Broadcast Integrity Protocol (BIP), Counter with cipher block chaining message authentication code protocol (CCMP), Secure Hybrid Wireless Mesh Protocol (SHWMP), Identity Based Cryptography HWMP (IBC-HWMP), Elliptic Curve Digital Signature Algorithm HWMP (ECDSA-HWMP), and Watchdog-HWMP aim to protect the HWMP frames. In this paper, we have analyzed the vulnerabilities of the HWMP and developed security requirements to protect these identified vulnerabilities. We applied the security requirements to analyze the existing secure schemes for HWMP. The results of our analysis indicate that none of these protocols is able to satisfy all of the security requirements. We also present a quantitative complexity comparison among the protocols and an example of a security scheme for HWMP to demonstrate how the result of our research can be utilized. Our research results thus provide a tool for designing secure schemes for the HWMP.

  1. VANET Clustering Based Routing Protocol Suitable for Deserts

    PubMed Central

    Mohammed Nasr, Mohammed Mohsen; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

    2016-01-01

    In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms. PMID:27058539

  2. VANET Clustering Based Routing Protocol Suitable for Deserts.

    PubMed

    Nasr, Mohammed Mohsen Mohammed; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

    2016-01-01

    In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms. PMID:27058539

  3. VANET Clustering Based Routing Protocol Suitable for Deserts.

    PubMed

    Nasr, Mohammed Mohsen Mohammed; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

    2016-04-06

    In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms.

  4. A comparative study of routing protocols of heterogeneous wireless sensor networks.

    PubMed

    Han, Guangjie; Jiang, Xu; Qian, Aihua; Rodrigues, Joel J P C; Cheng, Long

    2014-01-01

    Recently, heterogeneous wireless sensor network (HWSN) routing protocols have drawn more and more attention. Various HWSN routing protocols have been proposed to improve the performance of HWSNs. Among these protocols, hierarchical HWSN routing protocols can improve the performance of the network significantly. In this paper, we will evaluate three hierarchical HWSN protocols proposed recently--EDFCM, MCR, and EEPCA--together with two previous classical routing protocols--LEACH and SEP. We mainly focus on the round of the first node dies (also called the stable period) and the number of packets sent to sink, which is an important aspect to evaluate the monitoring ability of a protocol. We conduct a lot of experiments and simulations on Matlab to analyze the performance of the five routing protocols. PMID:25050393

  5. A two-hop based adaptive routing protocol for real-time wireless sensor networks.

    PubMed

    Rachamalla, Sandhya; Kancherla, Anitha Sheela

    2016-01-01

    One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay. PMID:27478727

  6. Multipath Spanners

    NASA Astrophysics Data System (ADS)

    Gavoille, Cyril; Godfroy, Quentin; Viennot, Laurent

    This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for a graph G is a spanning subgraph such that the distance in H between any two vertices is at most s times the distance in G. We study in this paper spanners that approximate short cycles, and more generally p edge-disjoint paths with p > 1, between any pair of vertices.

  7. Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis.

    PubMed

    Alanazi, Adwan; Elleithy, Khaled

    2015-09-02

    Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.

  8. Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis

    PubMed Central

    Alanazi, Adwan; Elleithy, Khaled

    2015-01-01

    Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol. PMID:26364639

  9. Analysis of a distributed algorithm to determine multiple routes with path diversity in ad hoc networks.

    SciTech Connect

    Ghosal, Dipak; Mueller, Stephen Ng

    2005-04-01

    With multipath routing in mobile ad hoc networks (MANETs), a source can establish multiple routes to a destination for routing data. In MANETs, mulitpath routing can be used to provide route resilience, smaller end-to-end delay, and better load balancing. However, when the multiple paths are close together, transmissions of different paths may interfere with each other, causing degradation in performance. Besides interference, the physical diversity of paths also improves fault tolerance. We present a purely distributed multipath protocol based on the AODV-Multipath (AODVM) protocol called AODVM with Path Diversity (AODVM/PD) that finds multiple paths with a desired degree of correlation between paths specified as an input parameter to the algorithm. We demonstrate through detailed simulation analysis that multiple paths with low degree of correlation determined by AODVM/PD provides both smaller end-to-end delay than AODVM in networks with low mobility and better route resilience in the presence of correlated node failures.

  10. A Neural Networks-Based Hybrid Routing Protocol for Wireless Mesh Networks

    PubMed Central

    Kojić, Nenad; Reljin, Irini; Reljin, Branimir

    2012-01-01

    The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic—i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance. PMID:22969360

  11. A neural networks-based hybrid routing protocol for wireless mesh networks.

    PubMed

    Kojić, Nenad; Reljin, Irini; Reljin, Branimir

    2012-01-01

    The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic-i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance. PMID:22969360

  12. A novel Smart Routing Protocol for remote health monitoring in Medical Wireless Networks.

    PubMed

    Sundararajan, T V P; Sumithra, M G; Maheswar, R

    2014-01-01

    In a Medical Wireless Network (MWN), sensors constantly monitor patient's physiological condition and movement. Inter-MWN communications are set up between the Patient Server and one or more Centralized Coordinators. However, MWNs require protocols with little energy consumption and the self-organizing attribute perceived in ad-hoc networks. The proposed Smart Routing Protocol (SRP) selects only the nodes with a higher residual energy and lower traffic density for routing. This approach enhances cooperation among the nodes of a Mobile Ad Hoc Network. Consequently, SRP produces better results than the existing protocols, namely Conditional Min-Max Battery Cost Routing, Min-Max Battery Cost Routing and AdHoc On-demand Distance Vector in terms of network parameters. The performance of the erstwhile schemes for routing protocols is evaluated using the network simulator Qualnet v 4.5.

  13. Intelligent QoS routing algorithm based on improved AODV protocol for Ad Hoc networks

    NASA Astrophysics Data System (ADS)

    Huibin, Liu; Jun, Zhang

    2016-04-01

    Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.

  14. A robust cross-layer metric for routing protocol in mobile wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Mucchi, Lorenzo; Chisci, Luigi; Fabbrini, Luca; Giovannetti, Giulio

    2012-12-01

    In a mobile ad-hoc network (MANET) where Mobile Nodes (MNs) self-organize to ensure the communication over radio links, routing protocols clearly play a significant role. In future MANETs, protocols should provide routing under full mobility, power constraints, fast time-varying channels, and nodes subject to high loading. In this article, a novel robust routing protocol, named distributed X-layer fastest path (DXFP), is proposed. The protocol is based on a cross-layer metric which is robust against the time-variations of the network as far as topology (mobility), congestion of the nodes and channel quality (fading, power constraints) are concerned. All these features are integrated in a single physical cost, i.e., the network crossing time, which has to be minimized. Furthermore, several routes from source to destination are stored for a given data flow to efficiently face the disconnections which frequently occur in MANETs. It is shown that the DXFP protocol, though locally operating in a fully distributed way within the MNs, provides, for each data flow, the optimum routes according to the considered metric. The DXFP protocol has been compared with two of the most commonly used routing protocols for MANETs, i.e., dynamic source routing and ad hoc on-demand distance vector, showing significant improvements in performance and robustness.

  15. A Comparative Study of Wireless Sensor Networks and Their Routing Protocols

    PubMed Central

    Bhattacharyya, Debnath; Kim, Tai-hoon; Pal, Subhajit

    2010-01-01

    Recent developments in the area of micro-sensor devices have accelerated advances in the sensor networks field leading to many new protocols specifically designed for wireless sensor networks (WSNs). Wireless sensor networks with hundreds to thousands of sensor nodes can gather information from an unattended location and transmit the gathered data to a particular user, depending on the application. These sensor nodes have some constraints due to their limited energy, storage capacity and computing power. Data are routed from one node to other using different routing protocols. There are a number of routing protocols for wireless sensor networks. In this review article, we discuss the architecture of wireless sensor networks. Further, we categorize the routing protocols according to some key factors and summarize their mode of operation. Finally, we provide a comparative study on these various protocols. PMID:22163483

  16. Performance evaluation of reactive and proactive routing protocol in IEEE 802.11 ad hoc network

    NASA Astrophysics Data System (ADS)

    Hamma, Salima; Cizeron, Eddy; Issaka, Hafiz; Guédon, Jean-Pierre

    2006-10-01

    Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show

  17. The research of a new adaptive on-demand routing protocol in WSN

    NASA Astrophysics Data System (ADS)

    Zhu, Dongjie; Cui, Gang; Huang, Junheng; Zhang, Zhaoxing

    2013-03-01

    As an important part of the Internet of Things, WSN also has routing strategies which plays a critical role as well as it does in Ad hoc. After the introduction of some distinct traits of WSN, a detailed analysis is performed for a typical ondemand routing protocol in Ad hoc AODV, which then is transplanted into WSN. Furthermore, a transition method of adaptive clustering routing is proposed, based on which, a new adaptive hierarchical routing transition protocol (BCRP) is put forward. Finally, simulations and comparisons of BCRP are performed which lead to a conclusion that BCRP has been greatly improved concerning adaptability and extensibility.

  18. A survey on routing protocols for large-scale wireless sensor networks.

    PubMed

    Li, Changle; Zhang, Hanxiao; Hao, Binbin; Li, Jiandong

    2011-01-01

    With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. "Large-scale" means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and

  19. A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks

    PubMed Central

    Li, Changle; Zhang, Hanxiao; Hao, Binbin; Li, Jiandong

    2011-01-01

    With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner

  20. A Secure Routing Protocol for Wireless Sensor Networks Considering Secure Data Aggregation

    PubMed Central

    Rahayu, Triana Mugia; Lee, Sang-Gon; Lee, Hoon-Jae

    2015-01-01

    The commonly unattended and hostile deployments of WSNs and their resource-constrained sensor devices have led to an increasing demand for secure energy-efficient protocols. Routing and data aggregation receive the most attention since they are among the daily network routines. With the awareness of such demand, we found that so far there has been no work that lays out a secure routing protocol as the foundation for a secure data aggregation protocol. We argue that the secure routing role would be rendered useless if the data aggregation scheme built on it is not secure. Conversely, the secure data aggregation protocol needs a secure underlying routing protocol as its foundation in order to be effectively optimal. As an attempt for the solution, we devise an energy-aware protocol based on LEACH and ESPDA that combines secure routing protocol and secure data aggregation protocol. We then evaluate its security effectiveness and its energy-efficiency aspects, knowing that there are always trade-off between both. PMID:26131669

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

    PubMed

    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.

  2. Characterizing the Interaction Between Routing and MAC Protocols in Ad-Hoc Networks

    SciTech Connect

    Barrett, C. L.; Drozda, M.; Marathe, A.; Marathe, M. V.

    2002-01-01

    We empirically study the effect of mobility on the performance of protocols designed for wireless ad-hoc networks. An important objective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols is measured in terms of (i) latency, (ii) throughput, (iii) number of packets received, (iv) long term fairness and (v) number of control packets at the MAC and routing layer level. Three different commonly studied routing protocols are used: AODV, DSR and LAR1. Similarly three well known MAC protocols are used: MACA, 802.1 1 and CSMA. Our main contribution is simulation based experiments coupled with rigorous statistical analysis to characterize the interaction of MAC layer protocols with routing layer protocols in ad-hoc networks. From the results, we can conclude the following: e No single MAC or Routing protocol dominated the other protocols in their class. Probably more interestingly, no MAURouting protocol combination was better than other combinations over all scenarios and response variables. 0 In general, it is not meaningful to speak about a MAC or a routing protocol in isolation. Presence of interaction leads to trade-offs between the amount of control packets generated by each layer. The results raise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. Thus in order to improve the performanceof a communication network, it is important to study the entire protocol stack as a single algorithmic construct; optimizing individual layers in the seven layer OS1 stack will not yield performance improvements beyond a point. A methodological contribution of this paper is the use of statistical methods such as analysis of variance (ANOVA), to characterize the interaction between the protocols

  3. Data-Centric Multiobjective QoS-Aware Routing Protocol for Body Sensor Networks

    PubMed Central

    Razzaque, Md. Abdur; Hong, Choong Seon; Lee, Sungwon

    2011-01-01

    In this paper, we address Quality-of-Service (QoS)-aware routing issue for Body Sensor Networks (BSNs) in delay and reliability domains. We propose a data-centric multiobjective QoS-Aware routing protocol, called DMQoS, which facilitates the system to achieve customized QoS services for each traffic category differentiated according to the generated data types. It uses modular design architecture wherein different units operate in coordination to provide multiple QoS services. Their operation exploits geographic locations and QoS performance of the neighbor nodes and implements a localized hop-by-hop routing. Moreover, the protocol ensures (almost) a homogeneous energy dissipation rate for all routing nodes in the network through a multiobjective Lexicographic Optimization-based geographic forwarding. We have performed extensive simulations of the proposed protocol, and the results show that DMQoS has significant performance improvements over several state-of-the-art approaches. PMID:22346611

  4. A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

    PubMed Central

    Parasuraman, Ganesh Kumar

    2014-01-01

    The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET. PMID:25136697

  5. A secure 3-way routing protocols for intermittently connected mobile ad hoc networks.

    PubMed

    Sekaran, Ramesh; Parasuraman, Ganesh Kumar

    2014-01-01

    The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

  6. A secure 3-way routing protocols for intermittently connected mobile ad hoc networks.

    PubMed

    Sekaran, Ramesh; Parasuraman, Ganesh Kumar

    2014-01-01

    The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET. PMID:25136697

  7. An efficient and reliable geographic routing protocol based on partial network coding for underwater sensor networks.

    PubMed

    Hao, Kun; Jin, Zhigang; Shen, Haifeng; Wang, Ying

    2015-01-01

    Efficient routing protocols for data packet delivery are crucial to underwater sensor networks (UWSNs). However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. Network coding is a promising technique for efficient data packet delivery thanks to the broadcast nature of acoustic channels and the relatively high computation capabilities of the sensor nodes. In this work, we present GPNC, a novel geographic routing protocol for UWSNs that incorporates partial network coding to encode data packets and uses sensor nodes' location information to greedily forward data packets to sink nodes. GPNC can effectively reduce network delays and retransmissions of redundant packets causing additional network energy consumption. Simulation results show that GPNC can significantly improve network throughput and packet delivery ratio, while reducing energy consumption and network latency when compared with other routing protocols.

  8. An Efficient and Reliable Geographic Routing Protocol Based on Partial Network Coding for Underwater Sensor Networks

    PubMed Central

    Hao, Kun; Jin, Zhigang; Shen, Haifeng; Wang, Ying

    2015-01-01

    Efficient routing protocols for data packet delivery are crucial to underwater sensor networks (UWSNs). However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. Network coding is a promising technique for efficient data packet delivery thanks to the broadcast nature of acoustic channels and the relatively high computation capabilities of the sensor nodes. In this work, we present GPNC, a novel geographic routing protocol for UWSNs that incorporates partial network coding to encode data packets and uses sensor nodes’ location information to greedily forward data packets to sink nodes. GPNC can effectively reduce network delays and retransmissions of redundant packets causing additional network energy consumption. Simulation results show that GPNC can significantly improve network throughput and packet delivery ratio, while reducing energy consumption and network latency when compared with other routing protocols. PMID:26029955

  9. Relay-based routing protocol for space networks with predictable mobility

    NASA Astrophysics Data System (ADS)

    Zhang, Zhi; Dai, Guanzhong; Li, Lixin; Zhao, Yuting

    2005-11-01

    Future space scientific missions are envisioned to incorporate a large number of satellites and spacecrafts deployed in different orbits to network together into Space Networks. These networks have some unique characteristics such as limited resource of nodes, large latency and intermittent connectivity, which pose challenges to routing. In this paper, we propose a Relay-based Routing Protocol for Space Networks (RRPSN), which exploits the predictability of nodes motion to help deliver packets. Nodes use the link state and trajectory information received from other nodes to construct the routing tables where the next hop node is selected from the current as well as the future neighbors. Three key components of the protocol, including dissemination link information, modified Dijkstra's algorithm and packet processing are described in this paper. The computation complexity and overhead of the protocol is analyzed.

  10. Application of Game Theory Approaches in Routing Protocols for Wireless Networks

    NASA Astrophysics Data System (ADS)

    Javidi, Mohammad M.; Aliahmadipour, Laya

    2011-09-01

    An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that applied game theory approaches for various wireless networks such as ad hoc networks, mobile ad hoc networks and sensor networks that all of them lead to improve the network performance.

  11. A survey on the taxonomy of cluster-based routing protocols for homogeneous wireless sensor networks.

    PubMed

    Naeimi, Soroush; Ghafghazi, Hamidreza; Chow, Chee-Onn; Ishii, Hiroshi

    2012-01-01

    The past few years have witnessed increased interest among researchers in cluster-based protocols for homogeneous networks because of their better scalability and higher energy efficiency than other routing protocols. Given the limited capabilities of sensor nodes in terms of energy resources, processing and communication range, the cluster-based protocols should be compatible with these constraints in either the setup state or steady data transmission state. With focus on these constraints, we classify routing protocols according to their objectives and methods towards addressing the shortcomings of clustering process on each stage of cluster head selection, cluster formation, data aggregation and data communication. We summarize the techniques and methods used in these categories, while the weakness and strength of each protocol is pointed out in details. Furthermore, taxonomy of the protocols in each phase is given to provide a deeper understanding of current clustering approaches. Ultimately based on the existing research, a summary of the issues and solutions of the attributes and characteristics of clustering approaches and some open research areas in cluster-based routing protocols that can be further pursued are provided. PMID:22969350

  12. A Survey on the Taxonomy of Cluster-Based Routing Protocols for Homogeneous Wireless Sensor Networks

    PubMed Central

    Naeimi, Soroush; Ghafghazi, Hamidreza; Chow, Chee-Onn; Ishii, Hiroshi

    2012-01-01

    The past few years have witnessed increased interest among researchers in cluster-based protocols for homogeneous networks because of their better scalability and higher energy efficiency than other routing protocols. Given the limited capabilities of sensor nodes in terms of energy resources, processing and communication range, the cluster-based protocols should be compatible with these constraints in either the setup state or steady data transmission state. With focus on these constraints, we classify routing protocols according to their objectives and methods towards addressing the shortcomings of clustering process on each stage of cluster head selection, cluster formation, data aggregation and data communication. We summarize the techniques and methods used in these categories, while the weakness and strength of each protocol is pointed out in details. Furthermore, taxonomy of the protocols in each phase is given to provide a deeper understanding of current clustering approaches. Ultimately based on the existing research, a summary of the issues and solutions of the attributes and characteristics of clustering approaches and some open research areas in cluster-based routing protocols that can be further pursued are provided. PMID:22969350

  13. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks.

    PubMed

    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

  14. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

    PubMed Central

    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

  15. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks.

    PubMed

    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.

  16. Routing Protocol Based on Link Reliability for WSN

    NASA Astrophysics Data System (ADS)

    Weipeng, Jing; Yaqiu, Liu

    In this paper, defining link reliability strategy constructed by remain energy, and communication cost of nodes as topology weight to synthetically reflect the energy efficiency of dominator, an Energy-radio and communication cost route (ECCR) is proposed to solve the problem that the average energy consumption in cluster and minimum communication cost. We take node residual energy and distance between sink and node to compete cluster head, at the same time, in order to reduce the cluster head energy costs, link reliability and hop is used to establish topology. The experimental results show that the algorithm not only has the energy saved characters, but also ensures the reliability of topology links and extends the network life-cycle efficiently.

  17. SEAODV: A Security Enhanced AODV Routing Protocol for Wireless Mesh Networks

    NASA Astrophysics Data System (ADS)

    Li, Celia; Wang, Zhuang; Yang, Cungang

    In this paper, we propose a Security Enhanced AODV routing protocol (SEAODV) for wireless mesh networks (WMN). SEAODV employs Blom's key pre-distribution scheme to compute the pairwise transient key (PTK) through the flooding of enhanced HELLO message and subsequently uses the established PTK to distribute the group transient key (GTK). PTK and GTK authenticate unicast and broadcast routing messages respectively. In WMN, a unique PTK is shared by each pair of nodes, while GTK is shared secretly between the node and all its one-hop neighbours. A message authentication code (MAC) is attached as the extension to the original AODV routing message to guarantee the message's authenticity and integrity in a hop-by-hop fashion. Security analysis and performance evaluation show that SEAODV is more effective in preventing identified routing attacks and outperforms ARAN and SAODV in terms of computation cost and route acquisition latency.

  18. Management of Energy Consumption on Cluster Based Routing Protocol for MANET

    NASA Astrophysics Data System (ADS)

    Hosseini-Seno, Seyed-Amin; Wan, Tat-Chee; Budiarto, Rahmat; Yamada, Masashi

    The usage of light-weight mobile devices is increasing rapidly, leading to demand for more telecommunication services. Consequently, mobile ad hoc networks and their applications have become feasible with the proliferation of light-weight mobile devices. Many protocols have been developed to handle service discovery and routing in ad hoc networks. However, the majority of them did not consider one critical aspect of this type of network, which is the limited of available energy in each node. Cluster Based Routing Protocol (CBRP) is a robust/scalable routing protocol for Mobile Ad hoc Networks (MANETs) and superior to existing protocols such as Ad hoc On-demand Distance Vector (AODV) in terms of throughput and overhead. Therefore, based on this strength, methods to increase the efficiency of energy usage are incorporated into CBRP in this work. In order to increase the stability (in term of life-time) of the network and to decrease the energy consumption of inter-cluster gateway nodes, an Enhanced Gateway Cluster Based Routing Protocol (EGCBRP) is proposed. Three methods have been introduced by EGCBRP as enhancements to the CBRP: improving the election of cluster Heads (CHs) in CBRP which is based on the maximum available energy level, implementing load balancing for inter-cluster traffic using multiple gateways, and implementing sleep state for gateway nodes to further save the energy. Furthermore, we propose an Energy Efficient Cluster Based Routing Protocol (EECBRP) which extends the EGCBRP sleep state concept into all idle member nodes, excluding the active nodes in all clusters. The experiment results show that the EGCBRP decreases the overall energy consumption of the gateway nodes up to 10% and the EECBRP reduces the energy consumption of the member nodes up to 60%, both of which in turn contribute to stabilizing the network.

  19. Analysis of energy efficient routing protocols for implementation of a ubiquitous health system

    NASA Astrophysics Data System (ADS)

    Kwon, Jongwon; Park, Yongman; Koo, Sangjun; Ayurzana, Odgeral; Kim, Hiesik

    2007-12-01

    The innovative Ubiquitous-Health was born through convergence of medical service, with development of up to date information technologies and ubiquitous IT. The U-Health can be applied to a variety of special situations for managing functions of each medical center efficiently. This paper focuses on estimation of various routing protocols for implementation of U-health monitoring system. In order to facilitate wireless communication over the network, a routing protocol on the network layer is used to establish precise and efficient route between sensor nodes so that information acquired from sensors may be delivered in a timely manner. A route establishment should be considered to minimize overhead, data loss and power consumption because wireless networks for U-health are organized by a large number of sensor nodes which are small in size and have limited processing power, memory and battery life. In this paper a overview of wireless sensor network technologies commonly known is described as well as evaluation of three multi hop routing protocols which are flooding, gossiping and modified low energy adaptive clustering hierarchy(LEACH) for use with these networks using TOSSIM simulator. As a result of evaluation the integrated wireless sensor board was developed in particular. The board is embedded device based on AVR128 porting TinyOS. Also it employs bio sensor measures blood pressure, pulse frequency and ZigBee module for wireless communication. This paper accelerates the digital convergence age through continual research and development of technologies related the U-Health.

  20. On the routing protocol influence on the resilience of wireless sensor networks to jamming attacks.

    PubMed

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Monroy, Raul; Nolazco-Flores, Juan Arturo

    2015-03-27

    In this work, we compare a recently proposed routing protocol, the multi-parent hierarchical (MPH) protocol, with two well-known protocols, the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR). For this purpose, we have developed a simulator, which faithfully reifies the workings of a given protocol, considering a fixed, reconfigurable ad hoc network given by the number and location of participants, and general network conditions. We consider a scenario that can be found in a large number of wireless sensor network applications, a single sink node that collects all of the information generated by the sensors. The metrics used to compare the protocols were the number of packet retransmissions, carrier sense multiple access (CSMA) inner loop retries, the number of nodes answering the queries from the coordinator (sink) node and the energy consumption. We tested the network under ordinary (without attacks) conditions (and combinations thereof) and when it is subject to different types of jamming attacks (in particular, random and reactive jamming attacks), considering several positions for the jammer. Our results report that MPH has a greater ability to tolerate such attacks than DSR and AODV, since it minimizes and encapsulates the network segment under attack. The self-configuring capabilities of MPH derived from a combination of a proactive routes update, on a periodic-time basis, and a reactive behavior provide higher resilience while offering a better performance (overhead and energy consumption) than AODV and DSR, as shown in our simulation results.

  1. Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks

    PubMed Central

    Lee, JeongCheol; Park, HoSung; Kang, SeokYoon; Kim, Ki-Il

    2015-01-01

    Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols. PMID:26057037

  2. On the Routing Protocol Influence on the Resilience of Wireless Sensor Networks to Jamming Attacks

    PubMed Central

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Monroy, Raul; Nolazco-Flores, Juan Arturo

    2015-01-01

    In this work, we compare a recently proposed routing protocol, the multi-parent hierarchical (MPH) protocol, with two well-known protocols, the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR). For this purpose, we have developed a simulator, which faithfully reifies the workings of a given protocol, considering a fixed, reconfigurable ad hoc network given by the number and location of participants, and general network conditions. We consider a scenario that can be found in a large number of wireless sensor network applications, a single sink node that collects all of the information generated by the sensors. The metrics used to compare the protocols were the number of packet retransmissions, carrier sense multiple access (CSMA) inner loop retries, the number of nodes answering the queries from the coordinator (sink) node and the energy consumption. We tested the network under ordinary (without attacks) conditions (and combinations thereof) and when it is subject to different types of jamming attacks (in particular, random and reactive jamming attacks), considering several positions for the jammer. Our results report that MPH has a greater ability to tolerate such attacks than DSR and AODV, since it minimizes and encapsulates the network segment under attack. The self-configuring capabilities of MPH derived from a combination of a proactive routes update, on a periodic-time basis, and a reactive behavior provide higher resilience while offering a better performance (overhead and energy consumption) than AODV and DSR, as shown in our simulation results. PMID:25825979

  3. Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks.

    PubMed

    Lee, JeongCheol; Park, HoSung; Kang, SeokYoon; Kim, Ki-Il

    2015-01-01

    Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols.

  4. Privacy Preserved and Secured Reliable Routing Protocol for Wireless Mesh Networks

    PubMed Central

    Thandava Meganathan, Navamani; Palanichamy, Yogesh

    2015-01-01

    Privacy preservation and security provision against internal attacks in wireless mesh networks (WMNs) are more demanding than in wired networks due to the open nature and mobility of certain nodes in the network. Several schemes have been proposed to preserve privacy and provide security in WMNs. To provide complete privacy protection in WMNs, the properties of unobservability, unlinkability, and anonymity are to be ensured during route discovery. These properties can be achieved by implementing group signature and ID-based encryption schemes during route discovery. Due to the characteristics of WMNs, it is more vulnerable to many network layer attacks. Hence, a strong protection is needed to avoid these attacks and this can be achieved by introducing a new Cross-Layer and Subject Logic based Dynamic Reputation (CLSL-DR) mechanism during route discovery. In this paper, we propose a new Privacy preserved and Secured Reliable Routing (PSRR) protocol for WMNs. This protocol incorporates group signature, ID-based encryption schemes, and CLSL-DR mechanism to ensure strong privacy, security, and reliability in WMNs. Simulation results prove this by showing better performance in terms of most of the chosen parameters than the existing protocols. PMID:26484361

  5. Analysis of GMPLS OSPF-TE protocol and its enhancement for routing in optical networks

    NASA Astrophysics Data System (ADS)

    Liu, Hang; Bouillet, E.; Pendarakis, Dimitrios; Komaee, Nooshin; Labourdette, J.; Chaudhuri, Sid

    2004-10-01

    For distributed control, network topology and link resource information is required at the ingress nodes to compute and route optical paths. It is the responsibility of routing protocols to disseminate this information. Generalized MPLS has extended traditional IP routing protocols such as OSPF for explicit path computation and traffic engineering (TE) in optical transport networks. However it is noted that the current version of GMPLS-extended OSPF-TE does not carry sufficient link state information to compute shared mesh restored paths. This paper describes the new extensions to the GMPLS OSPF-TE protocol to support the path computation for shared mesh restoration in optical networks. The efficient methods for aggregation and dissemination of link resource availability and sharing information are proposed. Especially these new extensions support both Shared Risk Link Group (SRLG) disjoint and node disjoint restoration paths, which provides more flexibility to the network operators. The network operators can choose to guarantee recovery from a SRLG failure or from a node/SRLG failure based upon the applications and the service level agreements with their customers. Furthermore, the paper presents an analytical model to estimate the performance of the GMPLS OSPF-TE protocol and the proposed extensions, including control bandwidth and memory requirements.

  6. IJS: An Intelligent Junction Selection Based Routing Protocol for VANET to Support ITS Services

    PubMed Central

    Khilar, Pabitra Mohan

    2014-01-01

    Selecting junctions intelligently for data transmission provides better intelligent transportation system (ITS) services. The main problem in vehicular communication is high disturbances of link connectivity due to mobility and less density of vehicles. If link conditions are predicted earlier, then there is a less chance of performance degradation. In this paper, an intelligent junction selection based routing protocol (IJS) is proposed to transmit the data in a quickest path, in which the vehicles are mostly connected and have less link connectivity problem. In this protocol, a helping vehicle is set at every junction to control the communication by predicting link failures or network gaps in a route. Helping vehicle at the junction produces a score for every neighboring junction to forward the data to the destination by considering the current traffic information and selects that junction which has minimum score. IJS protocol is implemented and compared with GyTAR, A-STAR, and GSR routing protocols. Simulation results show that IJS performs better in terms of average end-to-end delay, network gap encounter, and number of hops. PMID:27433485

  7. A multimetric, map-aware routing protocol for VANETs in urban areas.

    PubMed

    Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Aguilar Igartua, Mónica; Rebollo-Monedero, David; de la Cruz Llopis, Luis J; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

    2014-01-01

    In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery. PMID:24476683

  8. A Multimetric, Map-Aware Routing Protocol for VANETs in Urban Areas

    PubMed Central

    Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Igartua, Mónica Aguilar; Rebollo-Monedero, David; de la Cruz Llopis, Luis J.; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

    2014-01-01

    In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery. PMID:24476683

  9. A comprehensive survey of energy-aware routing protocols in wireless body area sensor networks.

    PubMed

    Effatparvar, Mehdi; Dehghan, Mehdi; Rahmani, Amir Masoud

    2016-09-01

    Wireless body area sensor network is a special purpose wireless sensor network that, employing wireless sensor nodes in, on, or around the human body, makes it possible to measure biological parameters of a person for specific applications. One of the most fundamental concerns in wireless body sensor networks is accurate routing in order to send data promptly and properly, and therefore overcome some of the challenges. Routing protocols for such networks are affected by a large number of factors including energy, topology, temperature, posture, the radio range of sensors, and appropriate quality of service in sensor nodes. Since energy is highly important in wireless body area sensor networks, and increasing the network lifetime results in benefiting greatly from sensor capabilities, improving routing performance with reduced energy consumption presents a major challenge. This paper aims to study wireless body area sensor networks and the related routing methods. It also presents a thorough, comprehensive review of routing methods in wireless body area sensor networks from the perspective of energy. Furthermore, different routing methods affecting the parameter of energy will be classified and compared according to their advantages and disadvantages. In this paper, fundamental concepts of wireless body area sensor networks are provided, and then the advantages and disadvantages of these networks are investigated. Since one of the most fundamental issues in wireless body sensor networks is to perform routing so as to transmit data precisely and promptly, we discuss the same issue. As a result, we propose a classification of the available relevant literature with respect to the key challenge of energy in the routing process. With this end in view, all important papers published between 2000 and 2015 are classified under eight categories including 'Mobility-Aware', 'Thermal-Aware', 'Restriction of Location and Number of Relays', 'Link-aware', 'Cluster- and Tree

  10. The Deployment of Routing Protocols in Distributed Control Plane of SDN

    PubMed Central

    Jingjing, Zhou; Di, Cheng; Weiming, Wang; Rong, Jin; Xiaochun, Wu

    2014-01-01

    Software defined network (SDN) provides a programmable network through decoupling the data plane, control plane, and application plane from the original closed system, thus revolutionizing the existing network architecture to improve the performance and scalability. In this paper, we learned about the distributed characteristics of Kandoo architecture and, meanwhile, improved and optimized Kandoo's two levels of controllers based on ideological inspiration of RCP (routing control platform). Finally, we analyzed the deployment strategies of BGP and OSPF protocol in a distributed control plane of SDN. The simulation results show that our deployment strategies are superior to the traditional routing strategies. PMID:25250395

  11. A comprehensive survey of energy-aware routing protocols in wireless body area sensor networks.

    PubMed

    Effatparvar, Mehdi; Dehghan, Mehdi; Rahmani, Amir Masoud

    2016-09-01

    Wireless body area sensor network is a special purpose wireless sensor network that, employing wireless sensor nodes in, on, or around the human body, makes it possible to measure biological parameters of a person for specific applications. One of the most fundamental concerns in wireless body sensor networks is accurate routing in order to send data promptly and properly, and therefore overcome some of the challenges. Routing protocols for such networks are affected by a large number of factors including energy, topology, temperature, posture, the radio range of sensors, and appropriate quality of service in sensor nodes. Since energy is highly important in wireless body area sensor networks, and increasing the network lifetime results in benefiting greatly from sensor capabilities, improving routing performance with reduced energy consumption presents a major challenge. This paper aims to study wireless body area sensor networks and the related routing methods. It also presents a thorough, comprehensive review of routing methods in wireless body area sensor networks from the perspective of energy. Furthermore, different routing methods affecting the parameter of energy will be classified and compared according to their advantages and disadvantages. In this paper, fundamental concepts of wireless body area sensor networks are provided, and then the advantages and disadvantages of these networks are investigated. Since one of the most fundamental issues in wireless body sensor networks is to perform routing so as to transmit data precisely and promptly, we discuss the same issue. As a result, we propose a classification of the available relevant literature with respect to the key challenge of energy in the routing process. With this end in view, all important papers published between 2000 and 2015 are classified under eight categories including 'Mobility-Aware', 'Thermal-Aware', 'Restriction of Location and Number of Relays', 'Link-aware', 'Cluster- and Tree

  12. Performance Analysis of AODV Routing Protocol for Wireless Sensor Network based Smart Metering

    NASA Astrophysics Data System (ADS)

    >Hasan Farooq, Low Tang Jung,

    2013-06-01

    Today no one can deny the need for Smart Grid and it is being considered as of utmost importance to upgrade outdated electric infrastructure to cope with the ever increasing electric load demand. Wireless Sensor Network (WSN) is considered a promising candidate for internetworking of smart meters with the gateway using mesh topology. This paper investigates the performance of AODV routing protocol for WSN based smart metering deployment. Three case studies are presented to analyze its performance based on four metrics of (i) Packet Delivery Ratio, (ii) Average Energy Consumption of Nodes (iii) Average End-End Delay and (iv) Normalized Routing Load.

  13. Adaptive Reliable Routing Protocol Using Combined Link Stability Estimation for Mobile Ad hoc Networks

    NASA Astrophysics Data System (ADS)

    Vadivel, R.; Bhaskaran, V. Murali

    2010-10-01

    The main reason for packet loss in ad hoc networks is the link failure or node failure. In order to increase the path stability, it is essential to distinguish and moderate the failures. By knowing individual link stability along a path, path stability can be identified. In this paper, we develop an adaptive reliable routing protocol using combined link stability estimation for mobile ad hoc networks. The main objective of this protocol is to determine a Quality of Service (QoS) path along with prolonging the network life time and to reduce the packet loss. We calculate a combined metric for a path based on the parameters Link Expiration Time, Node Remaining Energy and Node Velocity and received signal strength to predict the link stability or lifetime. Then, a bypass route is established to retransmit the lost data, when a link failure occurs. By simulation results, we show that the proposed reliable routing protocol achieves high delivery ratio with reduced delay and packet drop.

  14. An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks

    PubMed Central

    Javaid, Nadeem; Ilyas, Naveed; Ahmad, Ashfaq; Alrajeh, Nabil; Qasim, Umar; Khan, Zahoor Ali; Liaqat, Tayyaba; Khan, Majid Iqbal

    2015-01-01

    Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics. PMID:26593924

  15. Novel distributed control protocol in dynamic wavelength-routed optical networks

    NASA Astrophysics Data System (ADS)

    Ho, Pin-Han; Mouftah, Hussein T.

    2002-07-01

    This paper solves the problem of path selection for WDM mesh networks with a special focus on the implementation in middle-sized networks, such as metropolitan-area networks (MANs). A novel routing and signaling protocol, called Asynchronous Criticality Avoidance (ACA), is proposed to improve the network performance. With the ACA protocol, a specific set of wavelength channels are defined as critical links between a node pair according to dynamic link-state. Criticality information is defined as the critical links and the associated information, which is coordinated and disseminated by each source node to every other source node as an inter-arrival planning. Routing and wavelength assignment is performed along with the criticality avoidance mechanism, in which path selection process is devised to take the criticality information into consideration. Simulation is conducted in 22- and 30-node networks to examine the proposed approach. The simulation results show that the ACA protocol significantly outperforms the Fixed-Path Least-Congested (FPLC) scheme under the Fixed Alternate Routing architecture with various patterns of alternate paths assigned to each source-destination pair in the networks.

  16. An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks.

    PubMed

    Javaid, Nadeem; Ilyas, Naveed; Ahmad, Ashfaq; Alrajeh, Nabil; Qasim, Umar; Khan, Zahoor Ali; Liaqat, Tayyaba; Khan, Majid Iqbal

    2015-01-01

    Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics. PMID:26593924

  17. An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks.

    PubMed

    Javaid, Nadeem; Ilyas, Naveed; Ahmad, Ashfaq; Alrajeh, Nabil; Qasim, Umar; Khan, Zahoor Ali; Liaqat, Tayyaba; Khan, Majid Iqbal

    2015-11-17

    Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.

  18. A game theory-based obstacle avoidance routing protocol for wireless sensor networks.

    PubMed

    Guan, Xin; Wu, Huayang; Bi, Shujun

    2011-01-01

    The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

  19. Performance Analysis of Ad Hoc Routing Protocols in City Scenario for VANET

    NASA Astrophysics Data System (ADS)

    Das, Sanjoy; Raw, Ram Shringar; Das, Indrani

    2011-12-01

    In this paper, performance analysis of Location Aided Routing (LAR), AODV and DSR protocol in city scenarios has been done. The mobility model considered is Manhattan model. This mobility model used to emulate the movement pattern of nodes i.e., vehicles on streets defined by maps. Our objective is to provide a comparative analysis among LAR, AODV and DSR protocol in city scenarios in Vehicular Ad hoc Networks. The simulation work has been conducted using the Glomosim 2.03 simulator. The results show that LAR1 protocol achieves maximum packet delivery ratio is 100% in the sparsely populated network. The delay is maximum in AODV 121.88 ms when the number of node is 10 in the network. The results show that LAR1 outperform DSR and AODV in term of packet delivery ratio and end to end delay.

  20. VehiHealth: An Emergency Routing Protocol for Vehicular Ad Hoc Network to Support Healthcare System.

    PubMed

    Bhoi, S K; Khilar, P M

    2016-03-01

    Survival of a patient depends on effective data communication in healthcare system. In this paper, an emergency routing protocol for Vehicular Ad hoc Network (VANET) is proposed to quickly forward the current patient status information from the ambulance to the hospital to provide pre-medical treatment. As the ambulance takes time to reach the hospital, ambulance doctor can provide sudden treatment to the patient in emergency by sending patient status information to the hospital through the vehicles using vehicular communication. Secondly, the experienced doctors respond to the information by quickly sending a treatment information to the ambulance. In this protocol, data is forwarded through that path which has less link breakage problem between the vehicles. This is done by calculating an intersection value I v a l u e for the neighboring intersections by using the current traffic information. Then the data is forwarded through that intersection which has minimum I v a l u e . Simulation results show VehiHealth performs better than P-GEDIR, GyTAR, A-STAR and GSR routing protocols in terms of average end-to-end delay, number of link breakage, path length, and average response time.

  1. Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks

    PubMed Central

    Perumal, Madhumathy; Dhandapani, Sivakumar

    2015-01-01

    Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a “splitting tree” technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the “Biased Random Walk” model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols. PMID:26495426

  2. Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks.

    PubMed

    Perumal, Madhumathy; Dhandapani, Sivakumar

    2015-01-01

    Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a "splitting tree" technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the "Biased Random Walk" model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols. PMID:26495426

  3. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks

    PubMed Central

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

  4. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

    PubMed

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

  5. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

    PubMed

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

  6. A Time-Slotted On-Demand Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems

    SciTech Connect

    Hope Forsmann; Robert Hiromoto; John Svoboda

    2007-04-01

    The popularity of UAVs has increased dramatically because of their successful deployment in military operations, their ability to preserve human life, and the continual improvements in wireless communication that serves to increase their capabilities. We believe the usefulness of UAVs would be dramatically increased if formation flight were added to the list of capabilities. Currently, sustained formation flight with a cluster of UAVs has only been achieved with two nodes by the Multi-UAV Testbed at the Massachusetts Institute of Technology. (Park, 2004) Formation flight is a complex operation requiring the ability to adjust the flight patterns on the fly and correct for wind gusts, terrain, and differences in node equipment. All of which increases the amount of inner node communication. Since one of the problems with MANET communication is network congestion, we believe a first step towards formation flight can be made through improved inner node communication. We have investigated current communication routing protocols and developed an altered hybrid routing protocol in order to provide communication with less network congestion.

  7. CENTERA: A Centralized Trust-Based Efficient Routing Protocol with Authentication for Wireless Sensor Networks †

    PubMed Central

    Tajeddine, Ayman; Kayssi, Ayman; Chehab, Ali; Elhajj, Imad; Itani, Wassim

    2015-01-01

    In this paper, we present CENTERA, a CENtralized Trust-based Efficient Routing protocol with an appropriate authentication scheme for wireless sensor networks (WSN). CENTERA utilizes the more powerful base station (BS) to gather minimal neighbor trust information from nodes and calculate the best routes after isolating different types of “bad” nodes. By periodically accumulating these simple local observations and approximating the nodes' battery lives, the BS draws a global view of the network, calculates three quality metrics—maliciousness, cooperation, and compatibility—and evaluates the Data Trust and Forwarding Trust values of each node. Based on these metrics, the BS isolates “bad”, “misbehaving” or malicious nodes for a certain period, and put some nodes on probation. CENTERA increases the node's bad/probation level with repeated “bad” behavior, and decreases it otherwise. Then it uses a very efficient method to distribute the routing information to “good” nodes. Based on its target environment, and if required, CENTERA uses an authentication scheme suitable for severely constrained nodes, ranging from the symmetric RC5 for safe environments under close administration, to pairing-based cryptography (PBC) for hostile environments with a strong attacker model. We simulate CENTERA using TOSSIM and verify its correctness and show some energy calculations. PMID:25648712

  8. CENTERA: a centralized trust-based efficient routing protocol with authentication for wireless sensor networks.

    PubMed

    Tajeddine, Ayman; Kayssi, Ayman; Chehab, Ali; Elhajj, Imad; Itani, Wassim

    2015-01-01

    In this paper, we present CENTERA, a CENtralized Trust-based Efficient Routing protocol with an appropriate authentication scheme for wireless sensor networks (WSN). CENTERA utilizes the more powerful base station (BS) to gather minimal neighbor trust information from nodes and calculate the best routes after isolating different types of "bad" nodes. By periodically accumulating these simple local observations and approximating the nodes' battery lives, the BS draws a global view of the network, calculates three quality metrics-maliciousness, cooperation, and compatibility-and evaluates the Data Trust and Forwarding Trust values of each node. Based on these metrics, the BS isolates "bad", "misbehaving" or malicious nodes for a certain period, and put some nodes on probation. CENTERA increases the node's bad/probation level with repeated "bad" behavior, and decreases it otherwise. Then it uses a very efficient method to distribute the routing information to "good" nodes. Based on its target environment, and if required, CENTERA uses an authentication scheme suitable for severely constrained nodes, ranging from the symmetric RC5 for safe environments under close administration, to pairing-based cryptography (PBC) for hostile environments with a strong attacker model. We simulate CENTERA using TOSSIM and verify its correctness and show some energy calculations. PMID:25648712

  9. T2AR: trust-aware ad-hoc routing protocol for MANET.

    PubMed

    Dhananjayan, Gayathri; Subbiah, Janakiraman

    2016-01-01

    Secure data transfer against the malicious attacks is an important issue in an infrastructure-less independent network called mobile ad-hoc network (MANET). Trust assurance between MANET nodes is the key parameter in the high-security provision under dynamic topology variations and open wireless constraints. But, the malicious behavior of nodes reduces the trust level of the nodes that leads to an insecure data delivery. The increase in malicious attacks causes the excessive energy consumption that leads to a reduction of network lifetime. The lack of positional information update of the nodes in ad-hoc on-demand vector (AODV) protocol during the connection establishment offers less trust level between the nodes. Hence, the trust rate computation using energy and mobility models and its update are the essential tasks for secure data delivery. This paper proposes a trust-aware ad-hoc routing (T2AR) protocol to improve the trust level between the nodes in MANET. The proposed method modifies the traditional AODV routing protocol with the constraints of trust rate, energy, mobility based malicious behavior prediction. The packet sequence ID matching from the log reports of neighbor nodes determine the trust rate that avoids the malicious report generation. Besides, the direct and indirect trust observation schemes utilization increases the trust level. Besides, the received signal strength indicator utilization determines the trusted node is within the communication range or not. The comparative analysis between the proposed T2AR with the existing methods such as TRUNCMAN, RBT, GR, FBR and DICOTIDS regarding the average end-to-end delay, throughput, false positives, packet delivery ratio shows the effectiveness of T2AR in the secure MANET environment design. PMID:27441127

  10. T2AR: trust-aware ad-hoc routing protocol for MANET.

    PubMed

    Dhananjayan, Gayathri; Subbiah, Janakiraman

    2016-01-01

    Secure data transfer against the malicious attacks is an important issue in an infrastructure-less independent network called mobile ad-hoc network (MANET). Trust assurance between MANET nodes is the key parameter in the high-security provision under dynamic topology variations and open wireless constraints. But, the malicious behavior of nodes reduces the trust level of the nodes that leads to an insecure data delivery. The increase in malicious attacks causes the excessive energy consumption that leads to a reduction of network lifetime. The lack of positional information update of the nodes in ad-hoc on-demand vector (AODV) protocol during the connection establishment offers less trust level between the nodes. Hence, the trust rate computation using energy and mobility models and its update are the essential tasks for secure data delivery. This paper proposes a trust-aware ad-hoc routing (T2AR) protocol to improve the trust level between the nodes in MANET. The proposed method modifies the traditional AODV routing protocol with the constraints of trust rate, energy, mobility based malicious behavior prediction. The packet sequence ID matching from the log reports of neighbor nodes determine the trust rate that avoids the malicious report generation. Besides, the direct and indirect trust observation schemes utilization increases the trust level. Besides, the received signal strength indicator utilization determines the trusted node is within the communication range or not. The comparative analysis between the proposed T2AR with the existing methods such as TRUNCMAN, RBT, GR, FBR and DICOTIDS regarding the average end-to-end delay, throughput, false positives, packet delivery ratio shows the effectiveness of T2AR in the secure MANET environment design.

  11. On the MAC/network/energy performance evaluation of Wireless Sensor Networks: Contrasting MPH, AODV, DSR and ZTR routing protocols.

    PubMed

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Orozco-Lugo, Aldo; Lara, Mauricio; Galván-Tejada, Giselle M; Olmedo, Oscar

    2014-01-01

    Wireless Sensor Networks deliver valuable information for long periods, then it is desirable to have optimum performance, reduced delays, low overhead, and reliable delivery of information. In this work, proposed metrics that influence energy consumption are used for a performance comparison among our proposed routing protocol, called Multi-Parent Hierarchical (MPH), the well-known protocols for sensor networks, Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Zigbee Tree Routing (ZTR), all of them working with the IEEE 802.15.4 MAC layer. Results show how some communication metrics affect performance, throughput, reliability and energy consumption. It can be concluded that MPH is an efficient protocol since it reaches the best performance against the other three protocols under evaluation, such as 19.3% reduction of packet retransmissions, 26.9% decrease of overhead, and 41.2% improvement on the capacity of the protocol for recovering the topology from failures with respect to AODV protocol. We implemented and tested MPH in a real network of 99 nodes during ten days and analyzed parameters as number of hops, connectivity and delay, in order to validate our Sensors 2014, 14 22812 simulator and obtain reliable results. Moreover, an energy model of CC2530 chip is proposed and used for simulations of the four aforementioned protocols, showing that MPH has 15.9% reduction of energy consumption with respect to AODV, 13.7% versus DSR, and 5% against ZTR. PMID:25474377

  12. On the MAC/Network/Energy Performance Evaluation of Wireless Sensor Networks: Contrasting MPH, AODV, DSR and ZTR Routing Protocols

    PubMed Central

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Orozco-Lugo, Aldo; Lara, Mauricio; Galván-Tejada, Giselle M.; Olmedo, Oscar

    2014-01-01

    Wireless Sensor Networks deliver valuable information for long periods, then it is desirable to have optimum performance, reduced delays, low overhead, and reliable delivery of information. In this work, proposed metrics that influence energy consumption are used for a performance comparison among our proposed routing protocol, called Multi-Parent Hierarchical (MPH), the well-known protocols for sensor networks, Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Zigbee Tree Routing (ZTR), all of them working with the IEEE 802.15.4 MAC layer. Results show how some communication metrics affect performance, throughput, reliability and energy consumption. It can be concluded that MPH is an efficient protocol since it reaches the best performance against the other three protocols under evaluation, such as 19.3% reduction of packet retransmissions, 26.9% decrease of overhead, and 41.2% improvement on the capacity of the protocol for recovering the topology from failures with respect to AODV protocol. We implemented and tested MPH in a real network of 99 nodes during ten days and analyzed parameters as number of hops, connectivity and delay, in order to validate our simulator and obtain reliable results. Moreover, an energy model of CC2530 chip is proposed and used for simulations of the four aforementioned protocols, showing that MPH has 15.9% reduction of energy consumption with respect to AODV, 13.7% versus DSR, and 5% against ZTR. PMID:25474377

  13. Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks

    PubMed Central

    Mitton, Nathalie; Razafindralambo, Tahiry; Simplot-Ryl, David; Stojmenovic, Ivan

    2012-01-01

    This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm. PMID:23443398

  14. AURP: an AUV-aided underwater routing protocol for underwater acoustic sensor networks.

    PubMed

    Yoon, Seokhoon; Azad, Abul K; Oh, Hoon; Kim, Sunghwan

    2012-01-01

    Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved. PMID:22438740

  15. AURP: An AUV-Aided Underwater Routing Protocol for Underwater Acoustic Sensor Networks

    PubMed Central

    Yoon, Seokhoon; Azad, Abul K.; Oh, Hoon; Kim, Sunghwan

    2012-01-01

    Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved. PMID:22438740

  16. AURP: an AUV-aided underwater routing protocol for underwater acoustic sensor networks.

    PubMed

    Yoon, Seokhoon; Azad, Abul K; Oh, Hoon; Kim, Sunghwan

    2012-01-01

    Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved.

  17. Multipath analysis diffraction calculations

    NASA Technical Reports Server (NTRS)

    Statham, Richard B.

    1996-01-01

    This report describes extensions of the Kirchhoff diffraction equation to higher edge terms and discusses their suitability to model diffraction multipath effects of a small satellite structure. When receiving signals, at a satellite, from the Global Positioning System (GPS), reflected signals from the satellite structure result in multipath errors in the determination of the satellite position. Multipath error can be caused by diffraction of the reflected signals and a method of calculating this diffraction is required when using a facet model of the satellite. Several aspects of the Kirchhoff equation are discussed and numerical examples, in the near and far fields, are shown. The vector form of the extended Kirchhoff equation, by adding the Larmor-Tedone and Kottler edge terms, is given as a mathematical model in an appendix. The Kirchhoff equation was investigated as being easily implemented and of good accuracy in the basic form, especially in phase determination. The basic Kirchhoff can be extended for higher accuracy if desired. A brief discussion of the method of moments and the geometric theory of diffraction is included, but seems to offer no clear advantage in implementation over the Kirchhoff for facet models.

  18. An Empirical Evaluation of Lightweight Random Walk Based Routing Protocol in Duty Cycle Aware Wireless Sensor Networks

    PubMed Central

    Fatima, Mehwish

    2014-01-01

    Energy efficiency is an important design paradigm in Wireless Sensor Networks (WSNs) and its consumption in dynamic environment is even more critical. Duty cycling of sensor nodes is used to address the energy consumption problem. However, along with advantages, duty cycle aware networks introduce some complexities like synchronization and latency. Due to their inherent characteristics, many traditional routing protocols show low performance in densely deployed WSNs with duty cycle awareness, when sensor nodes are supposed to have high mobility. In this paper we first present a three messages exchange Lightweight Random Walk Routing (LRWR) protocol and then evaluate its performance in WSNs for routing low data rate packets. Through NS-2 based simulations, we examine the LRWR protocol by comparing it with DYMO, a widely used WSN protocol, in both static and dynamic environments with varying duty cycles, assuming the standard IEEE 802.15.4 in lower layers. Results for the three metrics, that is, reliability, end-to-end delay, and energy consumption, show that LRWR protocol outperforms DYMO in scalability, mobility, and robustness, showing this protocol as a suitable choice in low duty cycle and dense WSNs. PMID:24696667

  19. On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

    2016-05-01

    A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

  20. Multipath calibration in GPS pseudorange measurements

    NASA Technical Reports Server (NTRS)

    Kee, Changdon (Inventor); Parkinson, Bradford W. (Inventor)

    1998-01-01

    Novel techniques are disclosed for eliminating multipath errors, including mean bias errors, in pseudorange measurements made by conventional global positioning system receivers. By correlating the multipath signals of different satellites at their cross-over points in the sky, multipath mean bias errors are effectively eliminated. By then taking advantage of the geometrical dependence of multipath, a linear combination of spherical harmonics are fit to the satellite multipath data to create a hemispherical model of the multipath. This calibration model can then be used to compensate for multipath in subsequent measurements and thereby obtain GPS positioning to centimeter accuracy.

  1. A Scalable Context-Aware Objective Function (SCAOF) of Routing Protocol for Agricultural Low-Power and Lossy Networks (RPAL).

    PubMed

    Chen, Yibo; Chanet, Jean-Pierre; Hou, Kun-Mean; Shi, Hongling; de Sousa, Gil

    2015-01-01

    In recent years, IoT (Internet of Things) technologies have seen great advances, particularly, the IPv6 Routing Protocol for Low-power and Lossy Networks (RPL), which provides a powerful and flexible routing framework that can be applied in a variety of application scenarios. In this context, as an important role of IoT, Wireless Sensor Networks (WSNs) can utilize RPL to design efficient routing protocols for a specific application to increase the ubiquity of networks with resource-constrained WSN nodes that are low-cost and easy to deploy. In this article, our work starts with the description of Agricultural Low-power and Lossy Networks (A-LLNs) complying with the LLN framework, and to clarify the requirements of this application-oriented routing solution. After a brief review of existing optimization techniques for RPL, our contribution is dedicated to a Scalable Context-Aware Objective Function (SCAOF) that can adapt RPL to the environmental monitoring of A-LLNs, through combining energy-aware, reliability-aware, robustness-aware and resource-aware contexts according to the composite routing metrics approach. The correct behavior of this enhanced RPL version (RPAL) was verified by performance evaluations on both simulation and field tests. The obtained experimental results confirm that SCAOF can deliver the desired advantages on network lifetime extension, and high reliability and efficiency in different simulation scenarios and hardware testbeds. PMID:26266411

  2. A Scalable Context-Aware Objective Function (SCAOF) of Routing Protocol for Agricultural Low-Power and Lossy Networks (RPAL)

    PubMed Central

    Chen, Yibo; Chanet, Jean-Pierre; Hou, Kun-Mean; Shi, Hongling; de Sousa, Gil

    2015-01-01

    In recent years, IoT (Internet of Things) technologies have seen great advances, particularly, the IPv6 Routing Protocol for Low-power and Lossy Networks (RPL), which provides a powerful and flexible routing framework that can be applied in a variety of application scenarios. In this context, as an important role of IoT, Wireless Sensor Networks (WSNs) can utilize RPL to design efficient routing protocols for a specific application to increase the ubiquity of networks with resource-constrained WSN nodes that are low-cost and easy to deploy. In this article, our work starts with the description of Agricultural Low-power and Lossy Networks (A-LLNs) complying with the LLN framework, and to clarify the requirements of this application-oriented routing solution. After a brief review of existing optimization techniques for RPL, our contribution is dedicated to a Scalable Context-Aware Objective Function (SCAOF) that can adapt RPL to the environmental monitoring of A-LLNs, through combining energy-aware, reliability-aware, robustness-aware and resource-aware contexts according to the composite routing metrics approach. The correct behavior of this enhanced RPL version (RPAL) was verified by performance evaluations on both simulation and field tests. The obtained experimental results confirm that SCAOF can deliver the desired advantages on network lifetime extension, and high reliability and efficiency in different simulation scenarios and hardware testbeds. PMID:26266411

  3. A Scalable Context-Aware Objective Function (SCAOF) of Routing Protocol for Agricultural Low-Power and Lossy Networks (RPAL).

    PubMed

    Chen, Yibo; Chanet, Jean-Pierre; Hou, Kun-Mean; Shi, Hongling; de Sousa, Gil

    2015-08-10

    In recent years, IoT (Internet of Things) technologies have seen great advances, particularly, the IPv6 Routing Protocol for Low-power and Lossy Networks (RPL), which provides a powerful and flexible routing framework that can be applied in a variety of application scenarios. In this context, as an important role of IoT, Wireless Sensor Networks (WSNs) can utilize RPL to design efficient routing protocols for a specific application to increase the ubiquity of networks with resource-constrained WSN nodes that are low-cost and easy to deploy. In this article, our work starts with the description of Agricultural Low-power and Lossy Networks (A-LLNs) complying with the LLN framework, and to clarify the requirements of this application-oriented routing solution. After a brief review of existing optimization techniques for RPL, our contribution is dedicated to a Scalable Context-Aware Objective Function (SCAOF) that can adapt RPL to the environmental monitoring of A-LLNs, through combining energy-aware, reliability-aware, robustness-aware and resource-aware contexts according to the composite routing metrics approach. The correct behavior of this enhanced RPL version (RPAL) was verified by performance evaluations on both simulation and field tests. The obtained experimental results confirm that SCAOF can deliver the desired advantages on network lifetime extension, and high reliability and efficiency in different simulation scenarios and hardware testbeds.

  4. Direction based Hazard Routing Protocol (DHRP) for disseminating road hazard information using road side infrastructures in VANETs.

    PubMed

    Berlin, M A; Anand, Sheila

    2014-01-01

    This paper presents Direction based Hazard Routing Protocol (DHRP) for disseminating information about fixed road hazards such as road blocks, tree fall, boulders on road, snow pile up, landslide, road maintenance work and other obstacles to the vehicles approaching the hazardous location. The proposed work focuses on dissemination of hazard messages on highways with sparse traffic. The vehicle coming across the hazard would report the presence of the hazard. It is proposed to use Road Side fixed infrastructure Units for reliable and timely delivery of hazard messages to vehicles. The vehicles can then take appropriate safety action to avoid the hazardous location. The proposed protocol has been implemented and tested using SUMO simulator to generate road traffic and NS 2.33 network simulator to analyze the performance of DHRP. The performance of the proposed protocol was also compared with simple flooding protocol and the results are presented.

  5. Direction based Hazard Routing Protocol (DHRP) for disseminating road hazard information using road side infrastructures in VANETs.

    PubMed

    Berlin, M A; Anand, Sheila

    2014-01-01

    This paper presents Direction based Hazard Routing Protocol (DHRP) for disseminating information about fixed road hazards such as road blocks, tree fall, boulders on road, snow pile up, landslide, road maintenance work and other obstacles to the vehicles approaching the hazardous location. The proposed work focuses on dissemination of hazard messages on highways with sparse traffic. The vehicle coming across the hazard would report the presence of the hazard. It is proposed to use Road Side fixed infrastructure Units for reliable and timely delivery of hazard messages to vehicles. The vehicles can then take appropriate safety action to avoid the hazardous location. The proposed protocol has been implemented and tested using SUMO simulator to generate road traffic and NS 2.33 network simulator to analyze the performance of DHRP. The performance of the proposed protocol was also compared with simple flooding protocol and the results are presented. PMID:24834371

  6. GPS Multipath in Urban Environments

    NASA Astrophysics Data System (ADS)

    Bilich, A.; Sella, G.

    2008-12-01

    Multipath, where a GNSS signal arrives by more than one path, is considered one of the last unmodeled errors remaining in GNSS. Multipath is of great concern because the additional path length traveled by the incoming signal biases the satellite-receiver range and therefore determination of position. Siting a GNSS station in an urban area, in the immediate vicinity of large reflecting objects such as rooftops, buildings, asphalt and concrete parking lots, grassy fields, and chainlink fences, is both a multipath nightmare and a necessary evil. We note that continuously-operating GNSS stations are becoming increasingly common in urban areas, which makes sense as these stations are often installed in support of civil infrastructure (e.g. departments of transportation, strong motion monitoring of buildings in earthquake-prone areas, surveying networks). Urban stations are well represented in geodetic networks such as the CORS (United States) and GeoNet (Japan) networks, with more stations likely to be installed in the coming years. What sources and types of urban multipath are the most detrimental to geodetic GPS positioning? Which reflecting objects are assumed to be a major source of multipath error, but the GPS data show otherwise? Are certain reflecting environments worse for specific applications, i.e. kinematic vs. static positioning? If forced to install a GNSS station in a highly reflective environment, is it possible to rank objects for their multipath severity? To answer these questions, we provide multipath examples taken from continuously- operating GNSS stations sited in urban environments. We concentrate on some of the most common obstacles and reflecting objects for urban sites - rooftops, parking lots, and fences. We analyze the multipath signature of these objects as manifested in the GPS phase, pseudorange, and signal-to-noise ratio (SNR) observables, and also examine multipath impacts on the precision and accuracy of GPS-derived positions.

  7. Multipath modeling for aeronautical communications.

    NASA Technical Reports Server (NTRS)

    Painter, J. H.; Gupta, S. C.; Wilson, L. R.

    1973-01-01

    One of the fundamental technical problems in aeronautical digital communications is that of multipath propagation between aircraft and ground terminal. This paper examines in detail a model of the received multipath signal that is useful for application of modern detection and estimation theories. The model treats arbitrary modulation and covers the selective and nonselective cases. The necessarily nonstationary statistics of the received signal are determined from the link geometry and the surface roughness parameters via a Kirchhoff solution.

  8. Performance analysis of multi-radio routing protocol in cognitive radio ad hoc networks under different path failure rate

    NASA Astrophysics Data System (ADS)

    Che-Aron, Z.; Abdalla, A. H.; Abdullah, K.; Hassan, W. H.

    2013-12-01

    In recent years, Cognitive Radio (CR) technology has largely attracted significant studies and research. Cognitive Radio Ad Hoc Network (CRAHN) is an emerging self-organized, multi-hop, wireless network which allows unlicensed users to opportunistically access available licensed spectrum bands for data communication under an intelligent and cautious manner. However, in CRAHNs, a lot of failures can easily occur during data transmission caused by PU (Primary User) activity, topology change, node fault, or link degradation. In this paper, an attempt has been made to evaluate the performance of the Multi-Radio Link-Quality Source Routing (MR-LQSR) protocol in CRAHNs under different path failure rate. In the MR-LQSR protocol, the Weighted Cumulative Expected Transmission Time (WCETT) is used as the routing metric. The simulations are carried out using the NS-2 simulator. The protocol performance is evaluated with respect to performance metrics like average throughput, packet loss, average end-to-end delay and average jitter. From the simulation results, it is observed that the number of path failures depends on the PUs number and mobility rate of SUs (Secondary Users). Moreover, the protocol performance is greatly affected when the path failure rate is high, leading to major service outages.

  9. Children's Pedestrian Route Selection: Efficacy of a Video and Internet Training Protocol

    PubMed Central

    Schwebel, David C.; McClure, Leslie A.

    2014-01-01

    Objective This randomized controlled trial examined one aspect of child pedestrian behavior, route selection across intersections, to evaluate whether a combination of widely-available videos and websites effectively train children in safe pedestrian route selection compared to active pedestrian safety control training and a no-contact control group. Methods A sample of 231 seven- and eight-year-olds were randomly assigned to one of four groups: training with videos and internet websites, active control groups of individualized streetside training or training within a virtual pedestrian environment, or a no-contact control group. All training groups received six 30-minute training sessions. Pedestrian route selection was assessed using two strategies, vignettes accompanied by illustrations and tabletop models of intersections, on three occasions: prior to intervention group assignment, immediately post-training, and six months after training. Results Although there were differences in route selection over time, no time by condition interaction effects were significant (ps > .05), suggesting children in the video/internet training group did not learn pedestrian route selection skills at a rate different from those in the other training groups or those in the no-contact control group. Conclusion Safe route selection is a critical component of pedestrian safety. Our results suggest children may not learn route selection from widely-available videos or websites. Explanations for the null finding and implications for both research and future practice are discussed. PMID:25170289

  10. Highly Scalable, UDP-Based Network Transport Protocols for Lambda Grids and 10 GE Routed Networks

    SciTech Connect

    PI: Robert Grossman Co-PI: Stephen Eick

    2009-08-04

    Summary of Report In work prior to this grant, NCDM developed a high performance data transport protocol called SABUL. During this grant, we refined SABUL’s functionality, and then extended both the capabilities and functionality and incorporated them into a new protocol called UDP-based Data transport Protocol, or UDT. We also began preliminary work on Composable UDT, a version of UDT that allows the user to choose among different congestion control algorithms and implement the algorithm of his choice at the time he compiles the code. Specifically, we: · Investigated the theoretical foundations of protocols similar to SABUL and UDT. · Performed design and development work of UDT, a protocol that uses UDP in both the data and control channels. · Began design and development work of Composable UDT, a protocol that supports the use of different congestion control algorithms by simply including the appropriate library when compiling the code. · Performed experimental studies using UDT and Composable UDT using real world applications such as the Sloan Digital Sky Survey (SDSS) astronomical data sets. · Released several versions of UDT and Composable, the most recent being v3.1.

  11. A decentralized fuzzy C-means-based energy-efficient routing protocol for wireless sensor networks.

    PubMed

    Alia, Osama Moh'd

    2014-01-01

    Energy conservation in wireless sensor networks (WSNs) is a vital consideration when designing wireless networking protocols. In this paper, we propose a Decentralized Fuzzy Clustering Protocol, named DCFP, which minimizes total network energy dissipation to promote maximum network lifetime. The process of constructing the infrastructure for a given WSN is performed only once at the beginning of the protocol at a base station, which remains unchanged throughout the network's lifetime. In this initial construction step, a fuzzy C-means algorithm is adopted to allocate sensor nodes into their most appropriate clusters. Subsequently, the protocol runs its rounds where each round is divided into a CH-Election phase and a Data Transmission phase. In the CH-Election phase, the election of new cluster heads is done locally in each cluster where a new multicriteria objective function is proposed to enhance the quality of elected cluster heads. In the Data Transmission phase, the sensing and data transmission from each sensor node to their respective cluster head is performed and cluster heads in turn aggregate and send the sensed data to the base station. Simulation results demonstrate that the proposed protocol improves network lifetime, data delivery, and energy consumption compared to other well-known energy-efficient protocols. PMID:25162060

  12. Routing Protocols for Next-Generation Networks Inspired by Collective Behaviors of Insect Societies: An Overview

    NASA Astrophysics Data System (ADS)

    Farooq, Muddassar; di Caro, Gianni A.

    In this chapter we discuss the properties and review the main instances of network routing algorithms whose bottom-up design has been inspired by collective behaviors of social insects such as ants and bees. This class of bio-inspired routing algorithms includes a relatively large number of algorithms mostly developed during the last ten years. The characteristics inherited by the biological systems of inspiration almost naturally empower these algorithms with characteristics such as autonomy, self-organization, adaptivity, robustness, and scalability, which are all desirable if not necessary properties to deal with the challenges of current and next-generation networks. In the chapter we consider different classes of wired and wireless networks, and for each class we briefly discuss the characteristics of the main ant- and bee-colony-inspired algorithms which can be found in literature. We point out their distinctive features and discuss their general pros and cons in relationship to the state of the art.

  13. Multipath noise reduction spread spectrum signals

    NASA Technical Reports Server (NTRS)

    Meehan, Thomas K. (Inventor)

    1994-01-01

    The concepts of early-prompt delay tracking, multipath correction of early-prompt delay tracking from correlation shape, and carrier phase multipath correction are addressed. In early-prompt delay tracking, since multipath is always delayed with respect to the direct signals, the system derives phase and pseudorange observables from earlier correlation lags. In multipath correction of early-prompt delay tracking from correlation shape, the system looks for relative variations of amplitude across the code correlation function that do not match the predicted multipath-free code cross-correlation shape. The system then uses deviations from the multipath-free shape to infer the magnitude of multipath, and to generate corrections pseudorange observables. In carrier phase multipath correction, the system looks for variations of phase among plural early and prompt lags. The system uses the measured phase variations, along with the general principle that the multipath errors are larger for later lags, to infer the presence of multipath, and to generate corrections for carrier-phase observables.

  14. Fuzzy Multiple Metrics Link Assessment for Routing in Mobile Ad-Hoc Network

    NASA Astrophysics Data System (ADS)

    Soo, Ai Luang; Tan, Chong Eng; Tay, Kai Meng

    2011-06-01

    In this work, we investigate on the use of Sugeno fuzzy inference system (FIS) in route selection for mobile Ad-Hoc networks (MANETs). Sugeno FIS is introduced into Ad-Hoc On Demand Multipath Distance Vector (AOMDV) routing protocol, which is derived from its predecessor, Ad-Hoc On Demand Distance Vector (AODV). Instead of using the conventional way that considering only a single metric to choose the best route, our proposed fuzzy decision making model considers up to three metrics. In the model, the crisp inputs of the three parameters are fed into an FIS and being processed in stages, i.e., fuzzification, inference, and defuzzification. Finally, after experiencing all the stages, a single value score is generated from the combination metrics, which will be used to measure all the discovered routes credibility. Results obtained from simulations show a promising improvement as compared to AOMDV and AODV.

  15. Enhanced Protein-Energy Provision via the Enteral Route in Critically Ill Patients (PEP uP Protocol): A Review of Evidence.

    PubMed

    Lee, Zheng Yii; Barakatun-Nisak, Mohd Yusof; Noor Airini, Ibrahim; Heyland, Daren K

    2016-02-01

    Nutrition support is an integral part of care among critically ill patients. However, critically ill patients are commonly underfed, leading to consequences such as increased length of hospital and intensive care unit stay, time on mechanical ventilation, infectious complications, and mortality. Nevertheless, the prevalence of underfeeding has not resolved since the first description of this problem more than 15 years ago. This may be due to the traditional conservative feeding approaches. A novel feeding protocol (the Enhanced Protein-Energy Provision via the Enteral Route Feeding Protocol in Critically Ill Patients [PEP uP] protocol) was proposed and proven to improve feeding adequacy significantly. However, some of the components in the protocol are controversial and subject to debate. This article is a review of the supporting evidences and some of the controversy associated with each component of the PEP uP protocol.

  16. Space-Data Routers: Advanced data routing protocols for enhancing data exploitation for space weather applications

    NASA Astrophysics Data System (ADS)

    Anastasiadis, Anastasios; Daglis, Ioannis A.; Balasis, George; Papadimitriou, Constantinos; Tsaoussidis, Vassilios; Diamantopoulos, Sotirios

    2014-05-01

    Data sharing and access are major issues in space sciences, as they influence the degree of data exploitation. The availability of multi-spacecraft distributed observation methods and adaptive mission architectures require computationally intensive analysis methods. Moreover, accurate space weather forecasting and future space exploration far from Earth will be in need of real-time data distribution and assimilation technologies. The FP7-Space collaborative research project "Space-Data Routers" (SDR) relies on space internetworking and in particular on Delay Tolerant Networking (DTN), which marks the new era in space communications. SDR unifies space and earth communication infrastructures and delivers a set of tools and protocols for space-data exploitation. The main goal is to allow space agencies, academic institutes and research centers to share space-data generated by single or multiple missions, in an efficient, secure and automated manner. Here we are presenting the architecture and basic functionality of a DTN-based application specifically designed in the framework of the SDR project, for data query, retrieval and administration that will enable addressing outstanding science questions related to space weather, through the provision of simultaneous real-time data sampling at multiple points in space. The work leading to this paper has received funding from the European Union's Seventh Framework Programme (FP7-SPACE-2010-1) under grant agreement no. 263330 for the SDR (Space-Data Routers for Exploiting Space Data) collaborative research project. This paper reflects only the authors' views and the Union is not liable for any use that may be made of the information contained therein.

  17. LMSS drive simulator for multipath propagation

    NASA Technical Reports Server (NTRS)

    Vishakantaiah, Praveen; Vogel, Wolfhard J.

    1989-01-01

    A three-dimensional drive simulator for the prediction of Land Mobile Satellite Service (LMSS) multipath propagation was developed. It is based on simple physical and geometrical rules and can be used to evaluate effects of scatterer numbers and positions, receiving antenna pattern, and satellite frequency and position. It is shown that scatterers close to the receiver have the most effect and that directive antennas suppress multipath interference.

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

    NASA Astrophysics Data System (ADS)

    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).

  19. Simulation of the TDRS multipath environment

    NASA Technical Reports Server (NTRS)

    Baghdady, E. J.; Ghais, A. F.; Wachsman, R. H.

    1970-01-01

    Design principles and implementation methods are discussed for simulating the propagation path between a tracking and data relay satellite and a mission spacecraft. The emphasis is on multipath and Doppler simulation but additive disturbances are also considered. The recommended form of the simulator is fed separately with the unmodulated carrier, the unmodulated subcarriers (or spread-spectrum components) and the data signals. The perturbations are also introduced separately; then successive modulation operations are performed. The simulator is segmented into elements that perform the various functions of direct and specular multipath, diffuse fading, Doppler shift and delay spread. Delay spreads are realized by discrete delays operating on baseband signals. Doppler simulation and ionospheric or diffuse multipath fading are applied to individual paths before or after modulation of the carrier by delayed baseband signals. Block diagrams are presented on how the different elements are combined to create a complete channel simulator.

  20. Multipath correlations in underwater acoustic communication channels.

    PubMed

    Huang, S H; Yang, T C; Huang, Chen-Fen

    2013-04-01

    Uncorrelated scattering (US), which assumes that multipath arrivals undergo uncorrelated scattering and are thus uncorrelated, has been the standard model for digital communications including underwater acoustic communications. This paper examines the cross-correlation of multipath arrivals based on at-sea data with different temporal coherence time, assuming quasi-stationary statistics. It is found that multipath arrivals are highly cross-correlated when the channel is temporally coherent, and are uncorrelated when the channel is temporally incoherent. A theoretical model based on the path phase rates and relative-phase fluctuations is used to explain experimentally observed phenomena, assuming the path amplitudes vary slowly compared with the phases. The implications of correlated scattering for underwater acoustic communication channel tracking are discussed.

  1. Optimization of MLS receivers for multipath environments

    NASA Technical Reports Server (NTRS)

    Mcalpine, G. A.; Highfill, J. H., III

    1976-01-01

    The design of a microwave landing system (MLS) aircraft receiver, capable of optimal performance in multipath environments found in air terminal areas, is reported. Special attention was given to the angle tracking problem of the receiver and includes tracking system design considerations, study and application of locally optimum estimation involving multipath adaptive reception and then envelope processing, and microcomputer system design. Results show processing is competitive in this application with i-f signal processing performance-wise and is much more simple and cheaper. A summary of the signal model is given.

  2. Multipath protection for data center services in OpenFlow-based software defined elastic optical networks

    NASA Astrophysics Data System (ADS)

    Yang, Hui; Cheng, Lei; Yuan, Jian; Zhang, Jie; Zhao, Yongli; Lee, Young

    2015-06-01

    With the rapid growth of data center services, the elastic optical network is a very promising networking architecture to interconnect data centers because it can elastically allocate spectrum tailored for various bandwidth requirements. In case of a link failure, to ensure a high-level quality of service (QoS) for user request after the failure becomes a research focus. In light of it, in this paper, we propose and experimentally demonstrate multipath protection for data center services in OpenFlow-based software defined elastic optical network testbed aiming at improving network reliability. We first propose an OpenFlow-based software defined elastic optical network architecture for data center service protection. Then, based on the proposed architecture, multipath protection scheme is figured based on the importance level of the service. To implement the proposed scheme in the architecture, OpenFlow protocol is extended to support multipath protection in elastic optical network. The performance of our proposed multipath protection scheme is evaluated by means of experiment on our OpenFlow-based testbed. The feasibility of our proposed scheme is also demonstrated in software defined elastic optical networks.

  3. An Adaptive Multipath Mitigation Filter for GNSS Applications

    NASA Astrophysics Data System (ADS)

    Chang, Chung-Liang; Juang, Jyh-Ching

    2008-12-01

    Global navigation satellite system (GNSS) is designed to serve both civilian and military applications. However, the GNSS performance suffers from several errors, such as ionosphere delay, troposphere delay, ephemeris error, and receiver noise and multipath. Among these errors, the multipath is one of the most unpredictable error sources in high-accuracy navigation. This paper applies a modified adaptive filter to reduce code and carrier multipath errors in GPS. The filter employs a tap-delay line with an Adaline network to estimate the direction and the delayed-signal parameters. Then, the multipath effect is mitigated by subtracting the estimated multipath effects from the processed correlation function. The hardware complexity of the method is also compared with other existing methods. Simulation results show that the proposed method using field data has a significant reduction in multipath error especially in short-delay multipath scenarios.

  4. Optimization of MLS receivers for multipath environments

    NASA Technical Reports Server (NTRS)

    Mcalpine, G. A.; Highfill, J. H., III; Irwin, S. H.; Padgett, J. E.

    1975-01-01

    A receiver is designed for aircraft (A/C), which, as a component of the proposed Microwave Landing System (MLS), is capable of optimal performance in the multipath environments found in air terminal areas. Topics discussed include: the angle-tracking problem of the MLS receiver; signal modeling; preliminary approaches to optimal design; suboptimal design; and simulation study.

  5. Raypath parameters in tropospheric multipath propagation

    NASA Astrophysics Data System (ADS)

    Webster, A. R.

    1982-07-01

    An analytic approach to the modeling of refractivity profiles, together with ray-tracing considerations, is discussed with a view to providing relevant information regarding path parameters in a multipath situation. Some points arising from rays launched from within an elevated duct are raised and discussed.

  6. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks.

    PubMed

    Monowar, Muhammad Mostafa; Bajaber, Fuad

    2015-01-01

    In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches. PMID:26083228

  7. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks

    PubMed Central

    Monowar, Muhammad Mostafa; Bajaber, Fuad

    2015-01-01

    In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches. PMID:26083228

  8. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks.

    PubMed

    Monowar, Muhammad Mostafa; Bajaber, Fuad

    2015-06-15

    In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches.

  9. A novel end-to-end fault detection and localization protocol for wavelength-routed WDM networks

    NASA Astrophysics Data System (ADS)

    Zeng, Hongqing; Vukovic, Alex; Huang, Changcheng

    2005-09-01

    Recently the wavelength division multiplexing (WDM) networks are becoming prevalent for telecommunication networks. However, even a very short disruption of service caused by network faults may lead to high data loss in such networks due to the high date rates, increased wavelength numbers and density. Therefore, the network survivability is critical and has been intensively studied, where fault detection and localization is the vital part but has received disproportional attentions. In this paper we describe and analyze an end-to-end lightpath fault detection scheme in data plane with the fault notification in control plane. The endeavor is focused on reducing the fault detection time. In this protocol, the source node of each lightpath keeps sending hello packets to the destination node exactly following the path for data traffic. The destination node generates an alarm once a certain number of consecutive hello packets are missed within a given time period. Then the network management unit collects all alarms and locates the faulty source based on the network topology, as well as sends fault notification messages via control plane to either the source node or all upstream nodes along the lightpath. The performance evaluation shows such a protocol can achieve fast fault detection, and at the same time, the overhead brought to the user data by hello packets is negligible.

  10. Nutritional route in oesophageal resection trial II (NUTRIENT II): study protocol for a multicentre open-label randomised controlled trial

    PubMed Central

    Berkelmans, Gijs H K; Wilts, Bas J W; Kouwenhoven, Ewout A; Kumagai, Koshi; Nilsson, Magnus; Weijs, Teus J; Nieuwenhuijzen, Grard A P; van Det, Marc J; Luyer, Misha D P

    2016-01-01

    Introduction Early start of an oral diet is safe and beneficial in most types of gastrointestinal surgery and is a crucial part of fast track or enhanced recovery protocols. However, the feasibility and safety of oral intake directly following oesophagectomy remain unclear. The aim of this study is to investigate the effects of early versus delayed start of oral intake on postoperative recovery following oesophagectomy. Methods and analysis This is an open-label multicentre randomised controlled trial. Patients undergoing elective minimally invasive or hybrid oesophagectomy for cancer are eligible. Further inclusion criteria are intrathoracic anastomosis, written informed consent and age 18 years or older. Inability for oral intake, inability to place a feeding jejunostomy, inability to provide written consent, swallowing disorder, achalasia, Karnofsky Performance Status <80 and malnutrition are exclusion criteria. Patients will be randomised using online randomisation software. The intervention group (direct oral feeding) will receive a liquid oral diet for 2 weeks with gradually expanding daily maximums. The control group (delayed oral feeding) will receive enteral feeding via a jejunostomy during 5 days and then start the same liquid oral diet. The primary outcome measure is functional recovery. Secondary outcome measures are 30-day surgical complications; nutritional status; need for artificial nutrition; need for additional interventions; health-related quality of life. We aim to recruit 148 patients. Statistical analysis will be performed according to an intention to treat principle. Results are presented as risk ratios with corresponding 95% CIs. A two-tailed p<0.05 is considered statistically significant. Ethics and dissemination Our study protocol has received ethical approval from the Medical research Ethics Committees United (MEC-U). This study is conducted according to the principles of Good Clinical Practice. Verbal and written informed consent is

  11. Processing In A GPS Receiver To Reduce Multipath Errors

    NASA Technical Reports Server (NTRS)

    Meehan, Thomas K.

    1994-01-01

    Four techniques of ancillary real-time digital processing of signals in Global Positioning System, GPS, receiver introduced reducing effects of multipath propagation of signals on position estimates produced by receiver. Multipath range errors halved. Applied in addition to other signal-processing techniques and to other techniques designing as receiving antenna to make it insensitive to reflections of GPS signals from nearby objects.

  12. Analysis of Multipath Pixels in SAR Images

    NASA Astrophysics Data System (ADS)

    Zhao, J. W.; Wu, J. C.; Ding, X. L.; Zhang, L.; Hu, F. M.

    2016-06-01

    As the received radar signal is the sum of signal contributions overlaid in one single pixel regardless of the travel path, the multipath effect should be seriously tackled as the multiple bounce returns are added to direct scatter echoes which leads to ghost scatters. Most of the existing solution towards the multipath is to recover the signal propagation path. To facilitate the signal propagation simulation process, plenty of aspects such as sensor parameters, the geometry of the objects (shape, location, orientation, mutual position between adjacent buildings) and the physical parameters of the surface (roughness, correlation length, permittivity)which determine the strength of radar signal backscattered to the SAR sensor should be given in previous. However, it's not practical to obtain the highly detailed object model in unfamiliar area by field survey as it's a laborious work and time-consuming. In this paper, SAR imaging simulation based on RaySAR is conducted at first aiming at basic understanding of multipath effects and for further comparison. Besides of the pre-imaging simulation, the product of the after-imaging, which refers to radar images is also taken into consideration. Both Cosmo-SkyMed ascending and descending SAR images of Lupu Bridge in Shanghai are used for the experiment. As a result, the reflectivity map and signal distribution map of different bounce level are simulated and validated by 3D real model. The statistic indexes such as the phase stability, mean amplitude, amplitude dispersion, coherence and mean-sigma ratio in case of layover are analyzed with combination of the RaySAR output.

  13. Optimization of MLS receivers for multipath environments

    NASA Technical Reports Server (NTRS)

    Mcalpine, G. A.; Highfill, J. H., III

    1979-01-01

    The angle tracking problems in microwave landing system receivers along with a receiver design capable of optimal performance in the multipath environments found in air terminal areas were studied. Included were various theoretical and evaluative studies like: (1) signal model development; (2) derivation of optimal receiver structures; and (3) development and use of computer simulations for receiver algorithm evaluation. The development of an experimental receiver for flight testing is presented. An overview of the work and summary of principal results and conclusions are reported.

  14. Mitigation of multipath in DGPS ground reference stations

    NASA Technical Reports Server (NTRS)

    Braasch, Michael S.; Van Graas, Frank

    1992-01-01

    Multipath represents one of the most serious threats to accuracy in Differential GPS (DGPS). The theoretical foundations of multipath are presented and several multipath mitigation techniques are reviewed. Special emphasis is placed on signal diffraction methods. Reflections enter peaks and nulls in the distorted antenna pattern in a random manner. This, coupled with the oscillations in relative phase (with respect to the direct signal), results in a multipath error signature which is noise-like. Since it is noise-like, it may be significantly reduced by averaging the code phase measurements against the more stable carrier-phase measurements. Exploitation of this effect to reduce multipath error represents a significant increase in accuracy for real time DGPS. Experiments have been performed which verify these conclusions.

  15. GPS multipath errors in the precision landing environment

    NASA Technical Reports Server (NTRS)

    Waid, James D.

    1993-01-01

    Aircraft guidance and positioning during the final approach and landing phases of flight requires a high degree of accuracy. The Global Positioning System operating in differential mode (DGPS) is being considered for this application. Prior to implementation, all sources of error must be considered. Multipath has been shown to be the dominant source of error for DGPS. Theoretical studies have verified the severity of multipath within the final approach and landing regions. This paper presents a study of GPS multipath errors during these critical phases of flight. A discussion of GPS multipath error characteristics will be presented along with actual multipath data. The data was collected using P-code and C/A-code receiver architectures. Data was collected onboard a dual-engine fixed-wing research aircraft. Aircraft dynamics are considered in the data analysis.

  16. Visualizing Internet routing changes.

    PubMed

    Lad, Mohit; Massey, Dan; Zhang, Lixia

    2006-01-01

    Today's Internet provides a global data delivery service to millions of end users and routing protocols play a critical role in this service. It is important to be able to identify and diagnose any problems occurring in Internet routing. However, the Internet's sheer size makes this task difficult. One cannot easily extract out the most important or relevant routing information from the large amounts of data collected from multiple routers. To tackle this problem, we have developed Link-Rank, a tool to visualize Internet routing changes at the global scale. Link-Rank weighs links in a topological graph by the number of routes carried over each link and visually captures changes in link weights in the form of a topological graph with adjustable size. Using Link-Rank, network operators can easily observe important routing changes from massive amounts of routing data, discover otherwise unnoticed routing problems, understand the impact of topological events, and infer root causes of observed routing changes.

  17. Measurement of multipath delay profile in land mobile satellite channels

    NASA Technical Reports Server (NTRS)

    Ikegami, Tetsushi; Arakaki, Yoshiya; Wakana, Hiromitsu; Suzuki, Ryutaro

    1993-01-01

    Mobile satellite communication channel has been evaluated mainly with fading statistics of signal. When bandwidth of transmitting signal becomes wider, frequency selectivity of fading becomes a significant factor of the channel. Channel characteristics, not only signal variation but multipath delay spread should be evaluated. A multipath measurement system is proposed and developed for mobile satellite applications. With this system and ETS-V satellite, multipath delay profiles are measured in various environments including Tokyo metropolis and Sapporo city at 1.5 GHz. Results show that the maximum excess delay is within 1 microsec and the maximum delay spread is 0.2 microsecs at elevation angles of 40 to 47 degrees. In wideband signal transmission of about 1 MHz and more, designers should consider the effect of selective fading due to the multipath of land mobile satellite channel.

  18. Limitations on Ku-band communications due to multipath

    NASA Technical Reports Server (NTRS)

    Lindsey, J. F.; Rudnicki, J. F.

    1977-01-01

    The earth and orbiter body reflections involving the Tracking Data Relay Satellite (TDRS)/orbiter communications link are evaluated. Recommendations address operational conditions in order to avoid critical multipath impacts, modulation preferences during acquisition, and preferred scan limit implementation.

  19. On the technology of aerospace communication in multipath.

    NASA Technical Reports Server (NTRS)

    Painter, J. H.; Gupta, S. C.; Wilson, L. R.

    1972-01-01

    The mechanism, effects, and modelling of multipath propagation, caused by rough earth reflection, are examined for aerospace communication. Emphasis is on binary digital signalling for aircraft and hybrid vehicles, such as Shuttle. The cases of direct Air-Ground and satellite relay (Aerosat) are treated. The recursive, adaptive, coherent Bayes detector for binary phase-shift-keying in nonselective multipath is presented. The derivation for the frequency-shift-keying detector is indicated.

  20. Methods and Apparatus for Reducing Multipath Signal Error Using Deconvolution

    NASA Technical Reports Server (NTRS)

    Kumar, Rajendra (Inventor); Lau, Kenneth H. (Inventor)

    1999-01-01

    A deconvolution approach to adaptive signal processing has been applied to the elimination of signal multipath errors as embodied in one preferred embodiment in a global positioning system receiver. The method and receiver of the present invention estimates then compensates for multipath effects in a comprehensive manner. Application of deconvolution, along with other adaptive identification and estimation techniques, results in completely novel GPS (Global Positioning System) receiver architecture.

  1. Aircraft landing response in a discrete multipath environment

    NASA Technical Reports Server (NTRS)

    Guarino, C. R.

    1975-01-01

    This paper considers the problem of discrete multipath reflections upon an aircraft in the landing phase. A model is developed for the communication channel for a typical receiver. Simulation studies are presented showing the effects of discrete multipath upon the aircraft's ability to follow a specified flight path. A development is presented for the analytical determination of the probability density function of the angular errors.

  2. Estimating Effects of Multipath Propagation on GPS Signals

    NASA Technical Reports Server (NTRS)

    Byun, Sung; Hajj, George; Young, Lawrence

    2005-01-01

    Multipath Simulator Taking into Account Reflection and Diffraction (MUSTARD) is a computer program that simulates effects of multipath propagation on received Global Positioning System (GPS) signals. MUSTARD is a very efficient means of estimating multipath-induced position and phase errors as functions of time, given the positions and orientations of GPS satellites, the GPS receiver, and any structures near the receiver as functions of time. MUSTARD traces each signal from a GPS satellite to the receiver, accounting for all possible paths the signal can take, including all paths that include reflection and/or diffraction from surfaces of structures near the receiver and on the satellite. Reflection and diffraction are modeled by use of the geometrical theory of diffraction. The multipath signals are added to the direct signal after accounting for the gain of the receiving antenna. Then, in a simulation of a delay-lock tracking loop in the receiver, the multipath-induced range and phase errors as measured by the receiver are estimated. All of these computations are performed for both right circular polarization and left circular polarization of both the L1 (1.57542-GHz) and L2 (1.2276-GHz) GPS signals.

  3. Glistening-region model for multipath studies

    NASA Astrophysics Data System (ADS)

    Groves, Gordon W.; Chow, Winston C.

    1998-07-01

    The goal is to achieve a model of radar sea reflection with improved fidelity that is amenable to practical implementation. The geometry of reflection from a wavy surface is formulated. The sea surface is divided into two components: the smooth `chop' consisting of the longer wavelengths, and the `roughness' of the short wavelengths. Ordinary geometric reflection from the chop surface is broadened by the roughness. This same representation serves both for forward scatter and backscatter (sea clutter). The `Road-to-Happiness' approximation, in which the mean sea surface is assumed cylindrical, simplifies the reflection geometry for low-elevation targets. The effect of surface roughness is assumed to make the sea reflection coefficient depending on the `Deviation Angle' between the specular and the scattering directions. The `specular' direction is that into which energy would be reflected by a perfectly smooth facet. Assuming that the ocean waves are linear and random allows use of Gaussian statistics, greatly simplifying the formulation by allowing representation of the sea chop by three parameters. An approximation of `low waves' and retention of the sea-chop slope components only through second order provides further simplification. The simplifying assumptions make it possible to take the predicted 2D ocean wave spectrum into account in the calculation of sea-surface radar reflectivity, to provide algorithms for support of an operational system for dealing with target tracking in the presence of multipath. The product will be of use in simulated studies to evaluate different trade-offs in alternative tracking schemes, and will form the basis of a tactical system for ship defense against low flyers.

  4. Plasma sheath multipath analysis and its effect on GNSS navigation

    NASA Astrophysics Data System (ADS)

    Du, Yongxing; Xi, Xiaoli; Song, Zhongguo; Liu, Jiangfan

    2015-11-01

    When hypersonic vehicle reenters the Earth's atmosphere, the plasma sheath will be generated by its collision with ambient air that would affect global navigation satellite system (GNSS). In order to understand such effects, the transmission coefficient of the plasma sheath has been investigated using the numerical method before. But this is found to be insufficient, for besides the attenuation on the signal energy, the multipath effect between the plasma sheath and the vehicle surface is also a serious factor, which may result in errors in pseudorange measurement and carrier phase measurement of GNSS receiver and finally affect the positioning accuracy. The multipath of the plasma sheath is analyzed by finite-difference time-domain method combined with further signal processing, and a simulation platform is established to verify this effects on positioning performance. Simulation results indicate the degradation of positioning performance when these multipath signals were present, causing position error with several meters to tens of meters.

  5. Multipath exploitation in through-wall radar imaging via point spread functions.

    PubMed

    Setlur, Pawan; Alli, Giovanni; Nuzzo, Luigia

    2013-12-01

    Due to several sources of multipath in through-wall radar sensing, such as walls, floors, and ceilings, there could exist multipath ghosts associated with a few genuine targets in the synthetic aperture beamformed image. The multipath ghosts are false positives and therefore confusable with genuine targets. Here, we develop a multipath exploitation technique using point spread functions, which associate and map back the multipath ghosts to their genuine targets, thereby increasing the effective signal-to-clutter ratio (SCR) at the genuine target locations. To do so, we first develop a multipath model advocating the Householder transformation, which permits modeling multiple reflections at multiple walls, and also allows for unconventional room/building geometries. Second, closed-form solutions of the multipath ghost locations assuming free space propagation are derived. Third, a nonlinear least squares optimization is formulated and initialized with these free space solutions to localize the multipath ghosts in through-wall radar sensing. The exploitation approach is general and does not require a priori assumptions on the number of targets. The free space multipath ghost locations and exploitation technique derived here may be used as is for multipath exploitation in urban canyons via synthetic aperture radar. Analytical expressions quantifying the SCR gain after multipath exploitation are derived. The analysis is validated with experimental EM results using finite-difference time-domain simulations.

  6. A design study on complexity reduced multipath mitigation

    NASA Astrophysics Data System (ADS)

    Wasenmüller, U.; Brack, T.; Groh, I.; Staudinger, E.; Sand, S.; Wehn, N.

    2012-09-01

    Global navigation satellite systems, e.g. the current GPS and the future European Galileo system, are frequently used in car navigation systems or smart phones to determine the position of a user. The calculation of the mobile position is based on the signal propagation times between the satellites and the mobile terminal. At least four time of arrival (TOA) measurements from four different satellites are required to resolve the position uniquely. Further, the satellites need to be line-of-sight to the receiver for exact position calculation. However, in an urban area, the direct path may be blocked and the resulting multipath propagation causes errors in the order of tens of meters for each measurement. and in the case of non-line-of-sight (NLOS), positive errors in the order of hundreds of meters. In this paper an advanced algorithm for multipath mitigation known as CRMM is presented. CRMM features reduced algorithmic complexity and superior performance in comparison with other state of the art multipath mitigation algorithms. Simulation results demonstrate the significant improvements in position calculation in environments with severe multipath propagation. Nevertheless, in relation to traditional algorithms an increased effort is required for real-time signal processing due to the large amount of data, which has to be processed in parallel. Based on CRMM, we performed a comprehensive design study including a design space exploration for the tracking unit hardware part, and prototype implementation for hardware complexity estimation.

  7. A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs

    PubMed Central

    Sivakumar, B.; Bhalaji, N.; Sivakumar, D.

    2014-01-01

    In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing. PMID:24790546

  8. A survey on investigating the need for intelligent power-aware load balanced routing protocols for handling critical links in MANETs.

    PubMed

    Sivakumar, B; Bhalaji, N; Sivakumar, D

    2014-01-01

    In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing.

  9. Contact Graph Routing

    NASA Technical Reports Server (NTRS)

    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

  10. Real life experience with multipath ultrasonic gas flow meters

    SciTech Connect

    Sakariassen, R.

    1996-12-31

    Multipath ultrasonic gas flow meters are to be considered as newcomers among flow meters for large, high pressure gas flows. Although the advantages of this type of meters are many and obvious, the metering community is still hesitating to go for it mainly because of lack of experience. The objective of this paper is to present the experience of Statoil after more than six years experience with multipath ultrasonic gas flow meters. Their experience includes laboratory testing and operation in the field for a variety of designs and dimensions. This paper presents the accuracy achieved by such meters including comparison between ultrasonic meters and orifice metering systems in operation, the unique possibilities that this type of meter offers for on-line verification of performance and installation effects. Of particular interest should be noted that in the vicinity of low-noise control valves, such meters could stop functioning completely if no precautions are taken.

  11. Multipath Effects on Phase Measurements with Continuous Terahertz Waves

    NASA Astrophysics Data System (ADS)

    Cordes, A. H.; Albarracin, M. G.; Thomas, D. H.; von der Weid, J. P.

    2016-05-01

    We evaluate the effect of multipath waves on terahertz phase measurements due to multiple reflections between the transmitter antenna and the sample. We show that the phase shift introduced by the sample will be biased by a value which depends on the sample position in the terahertz path. We show how to remove the bias and use the technique in the measurement of the index of refraction of Mylar at 194.4 GHz.

  12. Wide-band packet radio for multipath environments

    NASA Astrophysics Data System (ADS)

    Fischer, Jeffrey H.; Cafarella, John H.; Bouman, Charles A.; Flynn, Gerard T.; Dolat, Victor S.

    1988-05-01

    A direct-sequence spread-spectrum packet radio is described that has versatile signal-processing and local-control capabilities designed to support the functions required of a robust mobile communications network. Noteworthy capabilities include eleven selectable data rates with accurate range measurements in a fading multipath channel. The radio uses a hybrid analog/digital signal processor and nonrepeating spreading codes for suppression of intersymbol interference and jamming. It incorporates two sets of monolithic surface-acoustic-wave convolvers as programmable matched filters with time-bandwidth products of 64 and 2000. The analog matched filters are coupled with binary postprocessing for the functions of detection, RAKE demodulation, and ranging measurements over a wide multipath spread. The data rate can be varied in response to channel conditions from 1.45 Mb/s down to 44 b/s with an almost ideal tradeoff in signal-processing gain from 18 dB up to 61 dB prior to multipath combining.

  13. Computing Path Tables for Quickest Multipaths In Computer Networks

    SciTech Connect

    Grimmell, W.C.

    2004-12-21

    We consider the transmission of a message from a source node to a terminal node in a network with n nodes and m links where the message is divided into parts and each part is transmitted over a different path in a set of paths from the source node to the terminal node. Here each link is characterized by a bandwidth and delay. The set of paths together with their transmission rates used for the message is referred to as a multipath. We present two algorithms that produce a minimum-end-to-end message delay multipath path table that, for every message length, specifies a multipath that will achieve the minimum end-to-end delay. The algorithms also generate a function that maps the minimum end-to-end message delay to the message length. The time complexities of the algorithms are O(n{sup 2}((n{sup 2}/logn) + m)min(D{sub max}, C{sub max})) and O(nm(C{sub max} + nmin(D{sub max}, C{sub max}))) when the link delays and bandwidths are non-negative integers. Here D{sub max} and C{sub max} are respectively the maximum link delay and maximum link bandwidth and C{sub max} and D{sub max} are greater than zero.

  14. Evaluating Pseudorange Multipath at CGPS Stations Spanning Mexico

    NASA Astrophysics Data System (ADS)

    Vazquez, G.; Bennett, R. A.; Spinler, J. C.

    2013-12-01

    A research study was conducted in order to quantify and analyze the amount of pseudorange multipath at continuous Global Positioning System (CGPS) stations spanning Mexico. These CGPS stations are administered by a variety of organizations, including government agencies and public universities, and thus serve a wide range of positioning needs. Despite the diversity of the networks and their intended audiences, a core function of all of the networks is to provide a stable framework for high-precision positioning in support of diverse commercial and scientific applications. CGPS data from a large number of publicly available networks located in Mexico were studied. These include the RGNA (National Active Geodetic Network) administered by INEGI (National Institute of Statistics and Geography), the PBO network (Plate Boundary Observatory) funded by the National Science Foundation (NSF) and operated by UNAVCO (University NAVstar Consortium), the Southern California Integrated GPS Network (SCIGN), which is a collaboration effort of the United States Geological Survey (USGS), Scripps Institution of Oceanography and the Jet Propulsion Laboratory (JPL), the UNAM network, operated by the National Seismological System (SSN) and the Institute of Geophysics of the National Autonomous University of Mexico (UNAM), the Suominet Geodetic Network (SNG) and the CORS (Continuously Operating Reference Station) network, operated by the Federal Aviation Administration (FAA). A total of 54 CGPS stations were evaluated, where dual-frequency geodetic-grade receivers collected GPS data continuously during the period from 1994 to 2013. It is usually assumed that despite carefully selected locations, all CGPS stations are to some extent, affected by the presence of signal multipath. In addition, the geographic distribution of stations provides a nation-wide access to the International Terrestrial Reference Frame (ITRF). For real-time kinematic (RTK) and rapid static applications that depend on

  15. Computer Routing.

    ERIC Educational Resources Information Center

    Malone, Roger

    1991-01-01

    Computerized bus-routing systems plot the most efficient routes, cut the time it takes to draw routes, and generate reports quickly and accurately. However, school districts often underestimate the amount of work necessary to get information into the computer database. (MLF)

  16. Satellite Communications Using Commercial Protocols

    NASA Technical Reports Server (NTRS)

    Ivancic, William D.; Griner, James H.; Dimond, Robert; Frantz, Brian D.; Kachmar, Brian; Shell, Dan

    2000-01-01

    NASA Glenn Research Center has been working with industry, academia, and other government agencies in assessing commercial communications protocols for satellite and space-based applications. In addition, NASA Glenn has been developing and advocating new satellite-friendly modifications to existing communications protocol standards. This paper summarizes recent research into the applicability of various commercial standard protocols for use over satellite and space- based communications networks as well as expectations for future protocol development. It serves as a reference point from which the detailed work can be readily accessed. Areas that will be addressed include asynchronous-transfer-mode quality of service; completed and ongoing work of the Internet Engineering Task Force; data-link-layer protocol development for unidirectional link routing; and protocols for aeronautical applications, including mobile Internet protocol routing for wireless/mobile hosts and the aeronautical telecommunications network protocol.

  17. Multi-Path Relay Selection Algorithm Based on the Broadcast TV

    NASA Astrophysics Data System (ADS)

    Zhang, Chaoyi; Luan, Linlin; Wu, Muqing

    This paper presents a relay selection method for Broadcast TV services. This method get through the node's time-delay and power information, obtain the value of the system interrupt as to be a decision threshold, then chose the relay node. At the same time this paper proposes an optimal relay selection strategy which can minimize the system interrupt probability combination with power distribution--Multi-Path Relay Routing Protocol. This protocol can dynamically change the appropriate route according to the shifty network. Simulation results show that the protocol can extend the coverage area, reducing time-delay and increase system throughput, improve system spectral efficiency, and enhance the Qos of the Broadcast TV service.

  18. New Time and Multipath Augmentations for the Global Positioning System

    NASA Astrophysics Data System (ADS)

    Pratt, John A.

    Although developed with a narrow focus in mind, use of GPS has expanded into dozens of fields in industry, science, and military applications. The purpose of the research detailed in this dissertation is an increase in the utility of GPS by improving primary applications of the constellation and expand the practicality of some secondary applications. The first portion of this disseration focuses on the development of clock estimation algorithms for a GPS aiding system called iGPS which has been designed to improve the performance of the system in challenging environments. Central to the functioning of iGPS are the Iridium communication satellites. This dissertation describes a Kalman filter for estimating Iridium satellite clock biases from GPS-like measurements at an interval of 10 s. Typical results show the current filter to be accurate to within 200 ns while always meeting the initial system specification of half a microsecond. The following chapter examines the expediency of increasing the number of terms used to represent the clock bias in the broadcast message and it is shown that the current broadcast message is sufficient. The second half of the dissertation deals with the use of GPS multipath as an environmental measurement. It is shown that reflections of GPS signals from the ground can be used to estimate several important phenological indicators relative to the vegetation surrounding the GPS antenna. Methods are developed for refining the reflected signal and preparing it for use as a vegetation index. Finally, the effect of temperature and multipath supression algorithms on the GPS multipath data is examined relative to its viability for use as previously described. It is shown that these effects are minor in the majority of the GPS sites used in this study and that the data can be adjusted to avoid temperature difficulties.

  19. A Gossip-based Energy Efficient Protocol for Robust In-network Aggregation in Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Fauji, Shantanu

    We consider the problem of energy efficient and fault tolerant in--network aggregation for wireless sensor networks (WSNs). In-network aggregation is the process of aggregation while collecting data from sensors to the base station. This process should be energy efficient due to the limited energy at the sensors and tolerant to the high failure rates common in sensor networks. Tree based in--network aggregation protocols, although energy efficient, are not robust to network failures. Multipath routing protocols are robust to failures to a certain degree but are not energy efficient due to the overhead in the maintenance of multiple paths. We propose a new protocol for in-network aggregation in WSNs, which is energy efficient, achieves high lifetime, and is robust to the changes in the network topology. Our protocol, gossip--based protocol for in-network aggregation (GPIA) is based on the spreading of information via gossip. GPIA is not only adaptive to failures and changes in the network topology, but is also energy efficient. Energy efficiency of GPIA comes from all the nodes being capable of selective message reception and detecting convergence of the aggregation early. We experimentally show that GPIA provides significant improvement over some other competitors like the Ridesharing, Synopsis Diffusion and the pure version of gossip. GPIA shows ten fold, five fold and two fold improvement over the pure gossip, the synopsis diffusion and Ridesharing protocols in terms of network lifetime, respectively. Further, GPIA retains gossip's robustness to failures and improves upon the accuracy of synopsis diffusion and Ridesharing.

  20. Multipath effects in a Global Positioning Satellite system receiver

    NASA Technical Reports Server (NTRS)

    Mcdonald, Malcolm W.

    1992-01-01

    This study, as a part of a large continuing investigation being conducted by the Communications Systems Branch of the Information and Electronic Systems Laboratory at the Marshall Space Flight Center, was undertaken to explore the multipath response characteristics of a particular Global Positioning Satellite (GPS) receiver which was available in the laboratory at the beginning and throughout the entirety of the study, and to develop a suitable regime of experimental procedure which can be applied to other state-of-the-art GPS receivers in the larger investigation.

  1. Forward and Inverse Modeling of GPS Multipath for Snow Monitoring

    NASA Astrophysics Data System (ADS)

    Nievinski, Felipe Geremia

    Snowpacks provide reservoirs of freshwater, storing solid precipitation and delaying runoff to be released later in the spring and summer when it is most needed. The goal of this dissertation is to develop the technique of GPS multipath reflectometry (GPS-MR) for ground-based measurement of snow depth. The phenomenon of multipath in GPS constitutes the reception of reflected signals in conjunction with the direct signal from a satellite. As these coherent direct and reflected signals go in and out of phase, signal-to-noise ratio (SNR) exhibits peaks and troughs that can be related to land surface characteristics. In contrast to other GPS reflectometry modes, in GPS-MR the poorly separated composite signal is collected utilizing a single antenna and correlated against a single replica. SNR observations derived from the newer L2-frequency civilian GPS signal (L2C) are used, as recorded by commercial off-the-shelf receivers and geodetic-quality antennas in existing GPS sites. I developed a forward/inverse approach for modeling GPS multipath present in SNR observations. The model here is unique in that it capitalizes on known information about the antenna response and the physics of surface scattering to aid in retrieving the unknown snow conditions in the antenna surroundings. This physically-based forward model is utilized to simulate the surface and antenna coupling. The statistically-rigorous inverse model is considered in two parts. Part I (theory) explains how the snow characteristics are parameterized; the observation/parameter sensitivity; inversion errors; and parameter uncertainty, which serves to indicate the sensing footprint where the reflection originates. Part II (practice) applies the multipath model to SNR observations and validates the resulting GPS retrievals against independent in situ measurements during a 1-3 year period in three different environments---grasslands, alpine, and forested. The assessment yields a correlation of 0.98 and an RMS error

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

    SciTech Connect

    Patterson, Phil; Singh, Margaret; Plotkin, Steve; Moore, Jim

    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.

  3. Multipath Estimation in Urban Environments from Joint GNSS Receivers and LiDAR Sensors

    PubMed Central

    Ali, Khurram; Chen, Xin; Dovis, Fabio; De Castro, David; Fernández, Antonio J.

    2012-01-01

    In this paper, multipath error on Global Navigation Satellite System (GNSS) signals in urban environments is characterized with the help of Light Detection and Ranging (LiDAR) measurements. For this purpose, LiDAR equipment and Global Positioning System (GPS) receiver implementing a multipath estimating architecture were used to collect data in an urban environment. This paper demonstrates how GPS and LiDAR measurements can be jointly used to model the environment and obtain robust receivers. Multipath amplitude and delay are estimated by means of LiDAR feature extraction and multipath mitigation architecture. The results show the feasibility of integrating the information provided by LiDAR sensors and GNSS receivers for multipath mitigation. PMID:23202177

  4. Multipath estimation in urban environments from joint GNSS receivers and LiDAR sensors.

    PubMed

    Ali, Khurram; Chen, Xin; Dovis, Fabio; De Castro, David; Fernández, Antonio J

    2012-10-30

    In this paper, multipath error on Global Navigation Satellite System (GNSS) signals in urban environments is characterized with the help of Light Detection and Ranging (LiDAR) measurements. For this purpose, LiDAR equipment and Global Positioning System (GPS) receiver implementing a multipath estimating architecture were used to collect data in an urban environment. This paper demonstrates how GPS and LiDAR measurements can be jointly used to model the environment and obtain robust receivers. Multipath amplitude and delay are estimated by means of LiDAR feature extraction and multipath mitigation architecture. The results show the feasibility of integrating the information provided by LiDAR sensors and GNSS receivers for multipath mitigation.

  5. Analysis of the Bias on the Beidou GEO Multipath Combinations.

    PubMed

    Ning, Yafei; Yuan, Yunbin; Chai, Yanju; Huang, Yong

    2016-08-08

    The Beidou navigation satellite system is a very important sensor for positioning in the Asia-Pacific region. The Beidou inclined geosynchronous orbit (IGSO) and medium Earth orbit (MEO) satellites have been analysed in some studies previously conducted by other researchers; this paper seeks to gain more insight regarding the geostationary earth orbit (GEO) satellites. Employing correlation analysis, Fourier transformation and wavelet decomposition, we validate whether there is a systematic bias in their multipath combinations. These biases can be observed clearly in satellites C01, C02 and C04 and have a great correlation with time series instead of elevation, being significantly different from those of the Beidou IGSO and MEO satellites. We propose a correction model to mitigate this bias based on its daily periodicity characteristic. After the model has been applied, the performance of the positioning estimations of the eight stations distributed in the Asia-Pacific region is evaluated and compared. The results show that residuals of multipath series behaves random noise; for the single point positioning (SPP) and precise point positioning (PPP) approaches, the positioning accuracy in the upward direction can be improved by 8 cm and 6 mm, respectively, and by 2 cm and 4 mm, respectively, for the horizontal component.

  6. Target time smearing with short transmissions and multipath propagation.

    PubMed

    Harrison, Chris H

    2011-09-01

    In active sonar the target echo level is often estimated with a propagation model that adds all multipath arrivals. If the (post-correlator) transmitted pulse is short compared to the multipath time spread then there is effectively an extra loss (which may be substantial) since only a few of the paths contribute to the target echo at any one instant. This well known "time-smearing" loss is treated in a self-consistent manner with previous calculations of reverberation [Harrison, J. Acoust. Soc. Am. 114, 2744-2756 (2003)] to estimate the target response and the signal-to-reverberation-ratio. Again isovelocity water, Lambert's law, and reflection loss proportional to angle are assumed. In this important short pulse regime the target response becomes independent of boundary reflection properties but proportional to transmitted pulse length. Thus the signal-to-reverberation-ratio becomes independent of pulse length. The effect on signal-to-ambient-noise is also investigated and the resulting formulas presented in a table. PMID:21895070

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

    PubMed Central

    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. PMID:22566992

  8. QAM multi-path characterization due to ocean scattering

    SciTech Connect

    Petersen, T. L.; Bracht, R. R.; Pasquale, R. V.; Dimsdle, J.; Swanson, R.

    2002-01-01

    A series of RF channel flight characterization tests are to be run, in early March, to benchmark high speed, 16QAM multi-path performance over the ocean surface. The modulation format being tested is a 16 differential phase, absolute amplitude, two level polar quadrature amplitude modulation. The bit rate is 100 Megabits per second. This transmitted signal will be generated in a burst mode, being on for 40 microseconds once every 40 milliseconds. An aircraft will radiate the RF test signal at 5 different altitudes. The aircraft will make two inward flights at each altitude with vertical and horizontal polarization respectively. Receivers are to be placed in two different locations using circular antenna polarization. One receiver will be placed at an altitude of 230 feet above the ocean surface, and the other on a boat with the antenna placed just up off of the ocean surface. Data is to be collected over multiple wavelength changes in the difference between the line of sight and the reflected multi-path ray. The real time signal strength variation is to be recorded as well. Analysis of the resulting data will show flat fading and frequency selective fading effects. The test is run over two different days to provide for some variation in sea state conditions. This resulting information will help quantify the effectiveness of this novel modulation scheme for missile telemetry end event data applications.

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

    PubMed

    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.

  10. Target time smearing with short transmissions and multipath propagation.

    PubMed

    Harrison, Chris H

    2011-09-01

    In active sonar the target echo level is often estimated with a propagation model that adds all multipath arrivals. If the (post-correlator) transmitted pulse is short compared to the multipath time spread then there is effectively an extra loss (which may be substantial) since only a few of the paths contribute to the target echo at any one instant. This well known "time-smearing" loss is treated in a self-consistent manner with previous calculations of reverberation [Harrison, J. Acoust. Soc. Am. 114, 2744-2756 (2003)] to estimate the target response and the signal-to-reverberation-ratio. Again isovelocity water, Lambert's law, and reflection loss proportional to angle are assumed. In this important short pulse regime the target response becomes independent of boundary reflection properties but proportional to transmitted pulse length. Thus the signal-to-reverberation-ratio becomes independent of pulse length. The effect on signal-to-ambient-noise is also investigated and the resulting formulas presented in a table.

  11. Multipath pulse shapes in shallow water: theory and simulation.

    PubMed

    Harrison, Chris H; Nielsen, Peter L

    2007-03-01

    In shallow water propagation the steeper ray angles are weakened most by boundary losses. Regarding the sound intensity as a continuous function of angle it can be converted into a function of travel time to reveal the multipath pulse shape received from a remote source (one-way path) or a target (two-way path). The closed-form isovelocity pulse shape is extended here to the case of upward or downward refraction. The envelope of the earliest arrivals is roughly trapezoidal with a delayed peak corresponding to the slowest, near horizontal refracted paths. The tail of the pulse falls off exponentially (linearly in decibels) with a decay constant that depends only on the bottom reflection properties and water depth, irrespective of travel time, a useful property for geoacoustic inversion and for sonar design. The nontrivial analytical problem of inverting explicit functions of angle into explicit functions of time is solved by numerical interpolation. Thus exact solutions can be calculated numerically. Explicit closed-form approximations are given for one-way paths. Two-way paths are calculated by numerical convolution. Using the wave model C-SNAP in several broadband cases of interest it is demonstrated that these solutions correspond roughly to a depth average of multipath arrivals.

  12. Analysis of the Bias on the Beidou GEO Multipath Combinations

    PubMed Central

    Ning, Yafei; Yuan, Yunbin; Chai, Yanju; Huang, Yong

    2016-01-01

    The Beidou navigation satellite system is a very important sensor for positioning in the Asia-Pacific region. The Beidou inclined geosynchronous orbit (IGSO) and medium Earth orbit (MEO) satellites have been analysed in some studies previously conducted by other researchers; this paper seeks to gain more insight regarding the geostationary earth orbit (GEO) satellites. Employing correlation analysis, Fourier transformation and wavelet decomposition, we validate whether there is a systematic bias in their multipath combinations. These biases can be observed clearly in satellites C01, C02 and C04 and have a great correlation with time series instead of elevation, being significantly different from those of the Beidou IGSO and MEO satellites. We propose a correction model to mitigate this bias based on its daily periodicity characteristic. After the model has been applied, the performance of the positioning estimations of the eight stations distributed in the Asia-Pacific region is evaluated and compared. The results show that residuals of multipath series behaves random noise; for the single point positioning (SPP) and precise point positioning (PPP) approaches, the positioning accuracy in the upward direction can be improved by 8 cm and 6 mm, respectively, and by 2 cm and 4 mm, respectively, for the horizontal component. PMID:27509503

  13. Analysis of the Bias on the Beidou GEO Multipath Combinations.

    PubMed

    Ning, Yafei; Yuan, Yunbin; Chai, Yanju; Huang, Yong

    2016-01-01

    The Beidou navigation satellite system is a very important sensor for positioning in the Asia-Pacific region. The Beidou inclined geosynchronous orbit (IGSO) and medium Earth orbit (MEO) satellites have been analysed in some studies previously conducted by other researchers; this paper seeks to gain more insight regarding the geostationary earth orbit (GEO) satellites. Employing correlation analysis, Fourier transformation and wavelet decomposition, we validate whether there is a systematic bias in their multipath combinations. These biases can be observed clearly in satellites C01, C02 and C04 and have a great correlation with time series instead of elevation, being significantly different from those of the Beidou IGSO and MEO satellites. We propose a correction model to mitigate this bias based on its daily periodicity characteristic. After the model has been applied, the performance of the positioning estimations of the eight stations distributed in the Asia-Pacific region is evaluated and compared. The results show that residuals of multipath series behaves random noise; for the single point positioning (SPP) and precise point positioning (PPP) approaches, the positioning accuracy in the upward direction can be improved by 8 cm and 6 mm, respectively, and by 2 cm and 4 mm, respectively, for the horizontal component. PMID:27509503

  14. Route Flap Damping Made Usable

    NASA Astrophysics Data System (ADS)

    Pelsser, Cristel; Maennel, Olaf; Mohapatra, Pradosh; Bush, Randy; Patel, Keyur

    The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is known to be noisy. The protocol has two main mechanisms to ameliorate this, MinRouteAdvertisementInterval (MRAI), and Route Flap Damping (RFD). MRAI deals with very short bursts on the order of a few to 30 seconds. RFD deals with longer bursts, minutes to hours. Unfortunately, RFD was found to severely penalize sites for being well-connected because topological richness amplifies the number of update messages exchanged. So most operators have disabled it. Through measurement, this paper explores the avenue of absolutely minimal change to code, and shows that a few RFD algorithmic constants and limits can be trivially modified, with the result being damping a non-trivial amount of long term churn without penalizing well-behaved prefixes' normal convergence process.

  15. Multipath Routing of Fragmented Data Transfer in a Smart Grid Environment

    NASA Astrophysics Data System (ADS)

    Borgohain, Tuhin; Borgohain, Amardeep; Borgohain, Rajdeep; Sanyal, Sugata

    2015-02-01

    The purpose of this paper is to do a general survey on the existing communication modes inside a smart grid, the existing security loopholes and their countermeasures. Then we suggest a detailed countermeasure, building upon the Jigsaw based secure data transfer [8] for enhanced security of the data flow inside the communication system of a smart grid. The paper has been written without the consideration of any factor of inoperability between the various security techniques inside a smart grid

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

    PubMed Central

    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. PMID:27529783

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

    PubMed

    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. PMID:27529783

  18. Optimization of OSPF Routing in IP Networks

    NASA Astrophysics Data System (ADS)

    Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

    The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing

  19. Multi-path planning algorithm based on fitness sharing and species evolution

    NASA Astrophysics Data System (ADS)

    Zhang, Jing-Juan; Li, Xue-Lian; Hao, Yan-Ling

    2003-06-01

    A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of the solution path, and decrease the operating time because of the independent evolution of each subpopulation. The multi-path planning algorithm is demonstrated by a number of two-dimensional path planning problems. The results show that the multi-path planning algorithm has the following characteristics: high searching capability, rapid convergence and high reliability.

  20. Codeless GPS Applications to Multi-Path: CGAMP

    NASA Technical Reports Server (NTRS)

    Macdoran, P. F.; Miller, R. B.; Jenkins, D.; Lemmon, J.; Gold, K.; Schreiner, W.; Snyder, G.

    1990-01-01

    Cordless Global Positioning System (GPS) Applications to Multi-Path (CGAMP) is meeting the challenge of exploiting the L-band signals from the Global Positioning System (GPS) satellites for the measurement of the impulse response of radio transmission channels over space-Earth paths. This approach was originally suggested by E. K. Smith and has been pursued by J. Lemmon, without an affordable implementation being identifiable. In addition to the high cost of a suitable P code correlating GPS receiver, there is also the major impediment of the often announced Department of Defense policy of selective availability/anti-spoof (SA/AS) that clouds reliable access to the wideband (20 MHz) P channel of the GPS signals without cryptographic access. A technique proposed by MacDoran utilizes codeless methods for exploiting the P channel signals implemented by the use of a pair of antennas and cross correlation signal detection.

  1. Simulation results for an innovative anti-multipath digital receiver

    NASA Technical Reports Server (NTRS)

    Painter, J. H.; Wilson, L. R.

    1973-01-01

    Simulation results are presented for the error rate performance of the recursive digital MAP detector for known M-ary signals in multiplicative and additive Gaussian noise. Plots of detection error rate versus additive signal to noise ratio are given, with multipath interference strength as a parameter. For comparison, the error rates of conventional coherent and noncoherent digital MAP detectors are simultaneously simulated and graphed. It is shown that with nonzero multiplicative noise, the error rates of the conventional detectors saturate at an irreducible level as additive signal to noise ratio increases. The error rate for the innovative detector continues to decrease rapidly with increasing additive signal to noise ratio. In the absence of multiplicative interference, the conventional coherent detector and the innovative detector are shown to exhibit identical performance.-

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

    SciTech Connect

    Phil Patterson, Phil; Singh, Margaret; Plotkin, Steve; Moore, Jim

    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.

  3. EM-Based Multiuser Detection in Fast Fading Multipath Environments

    NASA Astrophysics Data System (ADS)

    Borran, Mohammad Jaber; Aazhang, Behnaam

    2002-12-01

    We address the problem of multiuser detection in fast fading multipath environments for DS-CDMA systems. In fast fading scenarios, temporal variations of the channel cause significant performance degradation even with the Rake receiver. We use a previously introduced time-frequency (TF) Rake receiver based on a canonical formulation of the channel and signals to simultaneously combat fading and multipath effects. This receiver uses the Doppler spread caused by rapid time-varying channel as another means of diversity. In dealing with multiaccess interference and as an attempt to avoid the prohibitive computational complexity of the optimum maximum-likelihood (ML) detector, we use the expectation maximization (EM) algorithm to derive an approximate ML detector. The new detector turns out to have an iterative structure very similar to the well-known multistage detector with some extra parameters. At the two extreme values of these parameters, the EM detector reduces to either one-shot TF Rake or generalized multistage detector. For the intermediate values of the parameters, it combines the two estimates to obtain a better decision for the bits of the users. Because of using the EM algorithm, this detector has better convergence properties than the multistage detector; the bit estimates always converge, and if an appropriate initial vector is used, they converge to the global maximizer of the likelihood function. As a result, the new detector provides significantly improved performance while maintaining the low complexity of the multistage detector. Our simulation results confirm the expected performance improvements compared to the base case of the TF Rake as well as the multistage detector used with the TF Rake.

  4. "Recalculating Route".

    PubMed

    Baum, Neil

    2015-01-01

    Can you imagine going to a doctor who uses a paper chart, sends you a bill on a ledger card, and handwrites a prescription? You wouldn't have a great deal of confidence that the clinical skills of the doctor were up to date. This would be an example of a doctor who did not "recalculate his or her route." This article provides 10 examples of adjustments that have been made in medicine where the route has been recalculated. PMID:26399043

  5. Navigation Signal Disturbances by Multipath Propagation - Scaled Measurements with a Universal Channel Sounder Architecture

    NASA Astrophysics Data System (ADS)

    Geise, Robert; Neubauer, Bjoern; Zimmer, Georg

    2015-11-01

    The performance of navigation systems is always reduced by unwanted multipath propagation. This is especially of practical importance for airborne navigation systems like the instrument landing system (ILS) or the VHF omni directional radio range (VOR). Nevertheless, the quantitative analysis of corresponding, potentially harmful multipath propagation disturbances is very difficult due to the large parameter space. Experimentally difficulties arise due to very expensive, real scale measurement campaigns and numerical simulation techniques still have shortcomings which are briefly discussed. In this contribution a new universal approach is introduced on how to measure very flexibly multipath propagation effects for arbitrary navigation systems using a channel sounder architecture in a scaled measurement environment. Two relevant scenarios of multipath propagation and the impact on navigation signals are presented. The first describes disturbances of the ILS due to large taxiing aircraft. The other example shows the influence of rotating wind turbines on the VOR.

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

    NASA Technical Reports Server (NTRS)

    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.

  7. The multipath and SNR Quality in civil code L2

    NASA Astrophysics Data System (ADS)

    Polezel, W. G.; Souza, E. M.; Monico, J. F.

    2007-12-01

    The new generation of GPS satellites, with the addition of the new L2C civil code, may provide to the users better positioning capabilities. The new code in the L2 may increase the signal robustness, improve resistance to interference, reduce tracking noise and consequently, improve accuracy and provide better positioning inside buildings and in wooded areas. The second civil frequency code will eliminate the need of using fragile semi- codeless tracking techniques currently used in connection with L2. The L2C has a different structure that allows civil and military share the same code. L2C owns two codes of different length: moderate code (CM) and long code (CL). The CM was chosen to have 10.230 chips repeated to every 20 millisecond. The CL was chosen to have 767250 chips with period of 1.5 second. The main reasons for these choices were due to excellent correlation properties. Furthermore, L2C enhances performance by having no data modulation on CL code, which improves, among others, the threshold tracking performance. Comparing the L2C acquisition with the C/A, the CM code is ten times longer than the C/A and the two components have half the total power. This is an important feature for many low-power applications. Although this signal has several advantages, some investigations about its performance are necessary, mainly about the provided accuracy under some effects, for example, multipath. Thus, this paper aims to analyze the L2C signal, as well as its quality using some parameters, such as Signal to Noise Ratio (SNR) and multipath level (MP). The experiment was realized at Sao Paulo State University UNESP in Presidente Prudente, Brazil. The data were collected by two receivers of different brands, both able to collect the L2C signal, and connected to the same antenna, thought the use of a splitter. The results showed that the MP and SNR values were better for the modernized satellites. Furthermore, the SNR values of the two receivers were similar while the

  8. Ultrasonic Multipath and Beamforming Clutter Reduction: A Chirp Model Approach

    PubMed Central

    Byram, Brett; Jakovljevic, Marko

    2014-01-01

    In vivo ultrasonic imaging with transducer arrays suffers from image degradation due to beamforming limitations, which includes diffraction limited beamforming as well as beamforming degradation due to tissue inhomogeneity. Additionally, based on recent studies, multipath scattering also causes significant image degradation. To reduce degradation from both sources, we propose a model-based, signal decomposition scheme. The proposed algorithm identifies spatial frequency signatures to decompose received wavefronts into their most significant scattering sources. Scattering sources originating from a region of interest are used to reconstruct decluttered wavefronts, which are beamformed into decluttered radio frequency (RF) scan lines or A-lines. To test the algorithm, ultrasound system channel data were acquired during liver scans from 8 patients. Multiple data sets were acquired from each patient, with 55 total data sets, 43 of which had identifiable hypoechoic regions on normal B-mode images. The data sets with identifiable hypoechoic regions were analyzed. The results show the decluttered B-mode images have an average improvement in contrast over normal images of 7.3±4.6 dB. The CNR changed little on average between normal and decluttered B-mode, −0.4±5.9 dB. The in vivo speckle SNR decreased; the change was −0.65±0.28. Phantom speckle SNR also decreased but only by −0.40±0.03. PMID:24569248

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

    SciTech Connect

    Wang, Shilian Zhang, Zhili

    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.

  10. A study of satellite motion-induced multipath phenomena

    NASA Technical Reports Server (NTRS)

    Allnutt, R. M.; Dissanayake, A.; Zaks, C.; Lin, K. T.

    1993-01-01

    Experiments have been undertaken at COMSAT Laboratories to determine some of the propagation effects likely to be encountered by handheld satellite communications devices. L-band pilot tones aboard geosynchronous satellites at 15 and 40 deg. elevations were used to examine diurnal signal variations measured by using a hemispherical antenna. It was found that the receiver with a hemispherical antenna suffered daily peak-to-peak signal level variations of up to 12 dB compared to only 2 to 3 dB for a receiver equipped with a directional antenna. These results were highly repeatable, and extensive tests were conducted to confirm the accuracy of the data. The results suggest that the diurnal variations were due to multipath effects caused by the motion of the satellite with respect to the receiver antenna. Noting that the orbit inclinations of the satellites used in the experiment were only on the order of 2 to 3 deg., the results also suggest a potentially serious signal variation problem for low-gain antenna-based communications systems using low earth orbit satellites, since the satellite elevation angles relative to earth change far more rapidly.

  11. Modeling of Doppler frequency shift in multipath radiochannels

    NASA Astrophysics Data System (ADS)

    Penzin, Maksim; Iyin, Nikolay

    2016-06-01

    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 change 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 change 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.

  12. Effective bandwidth guaranteed routing schemes for MPLS traffic engineering

    NASA Astrophysics Data System (ADS)

    Wang, Bin; Jain, Nidhi

    2001-07-01

    In this work, we present online algorithms for dynamic routing bandwidth guaranteed label switched paths (LSPs) where LSP set-up requests (in terms of a pair of ingress and egress routers as well as its bandwidth requirement) arrive one by one and there is no a priori knowledge regarding future LSP set-up requests. In addition, we consider rerouting of LSPs in this work. Rerouting of LSPs has not been well studied in previous work on LSP routing. The need of LSP rerouting arises in a number of ways: occurrence of faults (link and/or node failures), re-optimization of existing LSPs' routes to accommodate traffic fluctuation, requests with higher priorities, and so on. We formulate the bandwidth guaranteed LSP routing with rerouting capability as a multi-commodity flow problem. The solution to this problem is used as the benchmark for comparing other computationally less costly algorithms studied in this paper. Furthermore, to more efficiently utilize the network resources, we propose online routing algorithms which route bandwidth demands over multiple paths at the ingress router to satisfy the customer requests while providing better service survivability. Traffic splitting and distribution over the multiple paths are carefully handled using table-based hashing schemes while the order of packets within a flow is preserved. Preliminary simulations are conducted to show the performance of different design choices and the effectiveness of the rerouting and multi-path routing algorithms in terms of LSP set-up request rejection probability and bandwidth blocking probability.

  13. A Modified Efficient Traffic Scheduling Algorithm for Routing in Optical WDM Mesh Networks

    NASA Astrophysics Data System (ADS)

    Kavitha, T.; Rajamani, V.

    2013-09-01

    This paper is proposing an efficient traffic scheduling for routing in optical networks supported by Wavelength Division Multiplexing (WDM). Normally the traffic is routed through the primary path or back-up path towards the destination. In order to meet the transmission of higher data rates, the path of the WDM should be capable of carrying the traffic without any failure. Whenever the transmission through primary or backup path fails due to excessive overhead or network failure or congestion or excessive load, existing router mechanisms are not scheduling the traffic in an effective manner. This paper deals with an efficient traffic scheduling algorithm which effectively routes the traffic using multipath technique that satisfies the optical constraints. The whole procedure of routing algorithm is separated into two phases: the connection node establishment phase and multipath transmission from the connection node to destination phase. The connection node is selected on the basis of load and current traffic carrying capacity of that node. Then the traffic is routed to the destination using multiple paths. The proposed method tries to minimize the blocking probability of 70% compared to the existing Resource Efficiency Factor (REF) algorithm and also increase the throughput of 30% and better channel utilization of 23% based on data rate and 20% based on traffic time interval. Hence, the proposed algorithm is effectively routes the traffic within the network.

  14. Global Navigation Satellite System Multipath Mitigation Using a Wave-Absorbing Shield.

    PubMed

    Yang, Haiyan; Yang, Xuhai; Sun, Baoqi; Su, Hang

    2016-01-01

    Code multipath is an unmanaged error source in precise global navigation satellite system (GNSS) observation processing that limits GNSS positioning accuracy. A new technique for mitigating multipath by installing a wave-absorbing shield is presented in this paper. The wave-absorbing shield was designed according to a GNSS requirement of received signals and collected measurements to achieve good performance. The wave-absorbing shield was installed at the KUN1 and SHA1 sites of the international GNSS Monitoring and Assessment System (iGMAS). Code and carrier phase measurements of three constellations were collected on the dates of the respective installations plus and minus one week. Experiments were performed in which the multipath of the measurements obtained at different elevations was mitigated to different extents after applying the wave-absorbing shield. The results of an analysis and comparison show that the multipath was mitigated by approximately 17%-36% on all available frequencies of BeiDou Navigation Satellite System (BDS), Global Positioning System (GPS), and Global Navigation Satellite System (GLONASS) satellites. The three-dimensional accuracies of BDS, GPS, and GLONASS single-point positioning (SPP) were, respectively, improved by 1.07, 0.63 and 0.49 m for the KUN1 site, and by 0.72, 0.79 and 0.73 m for the SHA1 site. Results indicate that the multipath of the original observations was mitigated by using the wave-absorbing shield. PMID:27556466

  15. Global Navigation Satellite System Multipath Mitigation Using a Wave-Absorbing Shield.

    PubMed

    Yang, Haiyan; Yang, Xuhai; Sun, Baoqi; Su, Hang

    2016-08-22

    Code multipath is an unmanaged error source in precise global navigation satellite system (GNSS) observation processing that limits GNSS positioning accuracy. A new technique for mitigating multipath by installing a wave-absorbing shield is presented in this paper. The wave-absorbing shield was designed according to a GNSS requirement of received signals and collected measurements to achieve good performance. The wave-absorbing shield was installed at the KUN1 and SHA1 sites of the international GNSS Monitoring and Assessment System (iGMAS). Code and carrier phase measurements of three constellations were collected on the dates of the respective installations plus and minus one week. Experiments were performed in which the multipath of the measurements obtained at different elevations was mitigated to different extents after applying the wave-absorbing shield. The results of an analysis and comparison show that the multipath was mitigated by approximately 17%-36% on all available frequencies of BeiDou Navigation Satellite System (BDS), Global Positioning System (GPS), and Global Navigation Satellite System (GLONASS) satellites. The three-dimensional accuracies of BDS, GPS, and GLONASS single-point positioning (SPP) were, respectively, improved by 1.07, 0.63 and 0.49 m for the KUN1 site, and by 0.72, 0.79 and 0.73 m for the SHA1 site. Results indicate that the multipath of the original observations was mitigated by using the wave-absorbing shield.

  16. BDS relative static positioning over long baseline improved by GEO multipath mitigation

    NASA Astrophysics Data System (ADS)

    Wang, Min; Chai, Hongzhou; Liu, Jun; Zeng, Anmin

    2016-02-01

    Due to the satellite and constellation deployment design, the variation pattern of multipath effect in BeiDou Navigation Satellite System (BDS) code observation is different from GPS. The amplitude of systematic multipath variation (SMV) exists in multipath combination series may exceed 0.5 m for some geostationary earth orbit (GEO) satellites, which is larger than the normal noise level of GPS code observation. After characterization of the variation pattern of BDS multipath series for BDS GEO satellites, we propose to improve the performance of relative positioning over long baseline by mitigating the SMV effect of GEO satellite. The proposed method uses the SMV extracted from multipath (MP) combination series with adaptive wavelet transform as correction for current day observation in post-processing use or as following day correction in real-time use. In addition, the Double Station Observation Processing (DSOP) method that directly uses undifferenced observation is applied for relative static positioning. Experiment results show improvement in convergence speed for both BDS only and BDS/GPS combined solution.

  17. Sweep-spread carrier for underwater communication over acoustic channels with strong multipath propagation.

    PubMed

    Kebkal, Konstantin G; Bannasch, Rudolf

    2002-11-01

    Multipath propagation causes the transmitted signal to take numerous, time-varying different-length paths to the receiver. Exploitation of conventional frequency-constant carrier signals for communication over underwater acoustic channels typically shows that intricate mutual time variations of multipath arrivals create an extremely hard problem for equalizers to compensate for nonstable intersymbol interactions. Communication over such channels can be, however, substantially improved by using a new method based on the implementation of a sweep-spread carrier (S2C). Such a carrier consists of a succession of sweeps, which cause permanent rapid fluctuation of signal frequency. Apart from some additional useful effects such as providing multiuser access and reducing influence of narrow-band noise, the method provides significant processing improvement enabling clear separation of multipath arrivals by converting their time delays into their frequency reallocations--the steeper the sweeps, the better the multipath resolution that can be achieved. When converting the signal into constant intermediate frequencies, the best suitable multipath arrival can be separated not as traditionally in time domains, applying complex equalizers, but in frequency domains by means of usual band-pass filters. High transmission stability of this approach was confirmed in both computer simulations as well as in validation experiments carried out since summer 1999.

  18. Global Navigation Satellite System Multipath Mitigation Using a Wave-Absorbing Shield

    PubMed Central

    Yang, Haiyan; Yang, Xuhai; Sun, Baoqi; Su, Hang

    2016-01-01

    Code multipath is an unmanaged error source in precise global navigation satellite system (GNSS) observation processing that limits GNSS positioning accuracy. A new technique for mitigating multipath by installing a wave-absorbing shield is presented in this paper. The wave-absorbing shield was designed according to a GNSS requirement of received signals and collected measurements to achieve good performance. The wave-absorbing shield was installed at the KUN1 and SHA1 sites of the international GNSS Monitoring and Assessment System (iGMAS). Code and carrier phase measurements of three constellations were collected on the dates of the respective installations plus and minus one week. Experiments were performed in which the multipath of the measurements obtained at different elevations was mitigated to different extents after applying the wave-absorbing shield. The results of an analysis and comparison show that the multipath was mitigated by approximately 17%–36% on all available frequencies of BeiDou Navigation Satellite System (BDS), Global Positioning System (GPS), and Global Navigation Satellite System (GLONASS) satellites. The three-dimensional accuracies of BDS, GPS, and GLONASS single-point positioning (SPP) were, respectively, improved by 1.07, 0.63 and 0.49 m for the KUN1 site, and by 0.72, 0.79 and 0.73 m for the SHA1 site. Results indicate that the multipath of the original observations was mitigated by using the wave-absorbing shield. PMID:27556466

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

    PubMed

    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-01

    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. PMID:27607628

  20. Analysis and exploitation of multipath ghosts in radar target image classification.

    PubMed

    Smith, Graeme E; Mobasseri, Bijan G

    2014-04-01

    An analysis of the relationship between multipath ghosts and the direct target image for radar imaging is presented. A multipath point spread function (PSF) is defined that allows for specular reflections in the local environment and can allow the ghost images to be localized. Analysis of the multipath PSF shows that certain ghosts can only be focused for the far field synthetic aperture radar case and not the full array case. Importantly, the ghosts are shown to be equivalent to direct target images taken from different observation angles. This equivalence suggests that exploiting the ghosts would improve target classification performance, and this improvement is demonstrated using experimental data and a naïve Bayesian classifer. The maximum performance gain achieved is 32%.

  1. NIST cooperative laboratory for OSI routing technology

    SciTech Connect

    Montgomery, D.

    1994-05-23

    This document is one of two reports on the Integrated ISIS protocol. Required by the IAB/IESG in order for an Internet routing protocol to advance to Draft Standard Status. Integrated ISIS is an Interior Gateway Protocol and is designed to carry both IP and ISO CLNP routing information. Integrated ISIS is currently designated as a Proposed Standard. The protocol was first published in RFC 1195. Internet Draft was published subsequently to RFC 1195 and documents the current version of the protocol. This report documents experience with Integrated ISIS. This includes reports on interoperability testing, field experience and the current state of Integrated ISIS implementations. It also presents a summary of the Integrated ISIS Management Information Base (MIB), and a summary of the Integrated ISIS authentication mechanism.

  2. Evaluation of Two Computational Techniques of Calculating Multipath Using Global Positioning System Carrier Phase Measurements

    NASA Technical Reports Server (NTRS)

    Gomez, Susan F.; Hood, Laura; Panneton, Robert J.; Saunders, Penny E.; Adkins, Antha; Hwu, Shian U.; Lu, Ba P.

    1996-01-01

    Two computational techniques are used to calculate differential phase errors on Global Positioning System (GPS) carrier war phase measurements due to certain multipath-producing objects. The two computational techniques are a rigorous computati electromagnetics technique called Geometric Theory of Diffraction (GTD) and the other is a simple ray tracing method. The GTD technique has been used successfully to predict microwave propagation characteristics by taking into account the dominant multipath components due to reflections and diffractions from scattering structures. The ray tracing technique only solves for reflected signals. The results from the two techniques are compared to GPS differential carrier phase ns taken on the ground using a GPS receiver in the presence of typical International Space Station (ISS) interference structures. The calculations produced using the GTD code compared to the measured results better than the ray tracing technique. The agreement was good, demonstrating that the phase errors due to multipath can be modeled and characterized using the GTD technique and characterized to a lesser fidelity using the DECAT technique. However, some discrepancies were observed. Most of the discrepancies occurred at lower devations and were either due to phase center deviations of the antenna, the background multipath environment, or the receiver itself. Selected measured and predicted differential carrier phase error results are presented and compared. Results indicate that reflections and diffractions caused by the multipath producers, located near the GPS antennas, can produce phase shifts of greater than 10 mm, and as high as 95 mm. It should be noted tl the field test configuration was meant to simulate typical ISS structures, but the two environments are not identical. The GZ and DECAT techniques have been used to calculate phase errors due to multipath o the ISS configuration to quantify the expected attitude determination errors.

  3. Reduction of multipath effect through a critical scattering zone in microcell environments

    NASA Astrophysics Data System (ADS)

    Miranda, C. A. L.; Rosales, D. H. C.

    2005-12-01

    In this work, we investigate a critical region (CR) in microcell elliptical environments, an area between the mobile and the base station (BS) containing multipaths whose angles and times of arrival possess the acceptable angle and delay spreads of the channel. The focus of the paper is to estimate the theoretical rates of multipath reduction expected from the CR. These rates illustrate the convenience of adjusting or not the antenna's beamwidth (aperture) according to the angle spread. Also, to confirm the model's results; the angle and time of arrival statistics deduced from the elliptical model are validated through simulation. Results closely agree with theoretical values expected from the model.

  4. Microwave photonics for space-time compression of ultrabroadband signals through multipath wireless channels.

    PubMed

    Dezfooliyan, Amir; Weiner, Andrew M

    2013-12-01

    We employed photonic radio frequency (RF) arbitrary waveform generation to demonstrate space-time compression of ultrabroadband wireless signals through highly scattering multipath channels. To the best of our knowledge, this is the first experimental report that explores an RF-photonic transmitter to both characterize channel dispersions in real wireless environments and generate predistorted waveforms to achieve focusing through the multipath channels. Our experiments span a three octave frequency range of 2-18 GHz, nearly an order of magnitude beyond the ~2 GHz instantaneous bandwidth reported in previous spatiotemporal focusing experiments relying on electronic waveform generators.

  5. Modeling "wiggling" as a multi-path interference problem in AMCW ToF imaging.

    PubMed

    Feigin, Micha; Whyte, Refael; Bhandari, Ayush; Dorington, Adrian; Raskar, Ramesh

    2015-07-27

    Amplitude modulated continuous wave time-of-flight range cameras suffer from an inherent depth measurement error due to aliasing of the emitted signal vs reference signal correlation function. This is due to higher harmonics present in both signals which are not accounted for in the model or measurements. This "wiggling" error is generally corrected by employing a correction function based on frequency and depth dependent calibration data. This problem is shown to be equivalent to a multi-path interference problem. Casting the problem into the multi-path interference domain and utilizing multiple modulation frequencies provides tools for dealing with the depth error without calibration in a frequency independent way.

  6. A framework for adaptive routing in multicomputer networks

    SciTech Connect

    Ngai, J.Y.K.

    1989-01-01

    Message-passing concurrent computers, also known as multicomputers, such as the Caltech Cosmic Cube and its commercial descendants, consist of many computing nodes that interact with each other by sending and receiving messages over communication channels between the nodes. The communication networks of the second-generation machines, such as the Symult Series 2010 and the Intel iPSC2, employ an oblivious wormhole-routing technique that guarantees deadlock freedom. The network performance of this highly evolved oblivious technique has reached a limit of being capable of delivering, under random traffic, a stable maximum sustained throughput of {approx}45 to 50% of the limit set by the network bisection bandwidth, while maintaining acceptable network latency. This thesis examines the possibility of performing adaptive routing as an approach to further improving upon the performance and reliability of these networks. In an adaptive multipath routing scheme, message trajectories are no longer deterministic, but are continuously perturbed by local message loading. Message packets will tend to follow their shortest-distance routes to destinations in normal traffic loading, but can be detoured to longer but less-loaded routes as local congestion occurs. Our study of the proposed adaptive routing framework is organized around four major areas of interest: establishing the theoretical feasibility, investigating the performance behavior, exploring the potential reliability enhancement, and examining the major implementation issues.

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

    NASA Technical Reports Server (NTRS)

    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.

  8. Multipath study for a low altitude satellite utilizing a data relay satellite system

    NASA Technical Reports Server (NTRS)

    Eggert, D.

    1970-01-01

    Technical considerations associated with a low altitude satellite operating in conjuction with a data relay satellite system are reported. Emphasis was placed on the quantitative characterization of multipath phenomenon and determination of power received via both the direct and earth reflection paths. Attempts were made to develop a means for estimating the magnitude and nature of the reflected power.

  9. Design of a robust underwater acoustic communication system over multipath fading channels

    NASA Astrophysics Data System (ADS)

    Kim, Jangeun; Shim, Taebo

    2012-11-01

    Due to the surface and bottom constraints of the underwater acoustic channel (UAC) in shallow waters, multipath fading occurs and causes degradation of the signal for the UAC system. To overcome these problems, a robust underwater acoustic communication system was designed over multipath fading channels by employing both decision feedback equalization with the RLS algorithm and convolutional coding with interleaving+shuffling block data sequence. The dual use of these two methods simultaneously can reduce the intersymbol interference (ISI) and the adjacent bit and burst errors. The system will retransmit the same signal if the system fails to estimate the channel due to severe multipath fading. To verify the performance of the system, the transmission of an image was tested using a 524,288bit gray-scaled image through the multipath fading channel. The test results showed that the number of bit errors was reduced from 86,824 to 5,106 when the reference SNR was 12 dB.

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

    PubMed

    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.

  11. Detection of multipath effect using a self-pumped optical phase-conjugate filter.

    PubMed

    Li, Y; Ha, B; Eichmann, G; Kanterakis, E G; Caviris, N P

    1991-05-15

    A new optical Fourier domain filtering scheme that combines the conventional optical space-invariant linear filtering with a self-pumped nonlinear-optical phase-conjugation technique is proposed. The new method is used for a real-time detection and channel evaluation of the multipath information needed in radar, sonar, and communication signal-processing applications. Preliminary experimental demonstrations are included.

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

    PubMed Central

    Plant, Genevieve; Nikodem, Michal; Mulhall, Phil; Varner, Ruth K.; Sonnenfroh, David; Wysocki, Gerard

    2015-01-01

    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. PMID:26343670

  13. Communications protocol

    NASA Technical Reports Server (NTRS)

    Zhou, Xiaoming (Inventor); Baras, John S. (Inventor)

    2010-01-01

    The present invention relates to an improved communications protocol which increases the efficiency of transmission in return channels on a multi-channel slotted Alohas system by incorporating advanced error correction algorithms, selective retransmission protocols and the use of reserved channels to satisfy the retransmission requests.

  14. Control of communication networks: welfare maximization and multipath transfers.

    PubMed

    Key, Peter B; Massoulié, Laurent

    2008-06-13

    We discuss control strategies for communication networks such as the Internet. We advocate the goal of welfare maximization as a paradigm for network resource allocation. We explore the application of this paradigm to the case of parallel network paths. We show that welfare maximization requires active balancing across paths by data sources, and potentially requires implementation of novel transport protocols. However, the only requirement from the underlying 'network layer' is to expose the marginal congestion cost of network paths to the 'transport layer'. We further illustrate the versatility of the corresponding layered architecture by describing transport protocols with the following properties: they welfare maximization, each communication may use an arbitrary collection of paths, where paths may be from an overlay, and paths may be combined in series and parallel. We conclude by commenting on incentives, pricing and open problems. PMID:18325871

  15. Routing architecture and security for airborne networks

    NASA Astrophysics Data System (ADS)

    Deng, Hongmei; Xie, Peng; Li, Jason; Xu, Roger; Levy, Renato

    2009-05-01

    Airborne networks are envisioned to provide interconnectivity for terrestial and space networks by interconnecting highly mobile airborne platforms. A number of military applications are expected to be used by the operator, and all these applications require proper routing security support to establish correct route between communicating platforms in a timely manner. As airborne networks somewhat different from traditional wired and wireless networks (e.g., Internet, LAN, WLAN, MANET, etc), security aspects valid in these networks are not fully applicable to airborne networks. Designing an efficient security scheme to protect airborne networks is confronted with new requirements. In this paper, we first identify a candidate routing architecture, which works as an underlying structure for our proposed security scheme. And then we investigate the vulnerabilities and attack models against routing protocols in airborne networks. Based on these studies, we propose an integrated security solution to address routing security issues in airborne networks.

  16. Multipath propagation of low-frequency radio waves inferred from high-resolution array analysis

    NASA Astrophysics Data System (ADS)

    Füllekrug, Martin; Smith, Nathan; Mezentsev, Andrew; Watson, Robert; Astin, Ivan; Gaffet, Stéphane; Evans, Adrian; Rycroft, Michael

    2015-11-01

    The low-frequency radio sky shows the locations of electromagnetic radio sources with a characteristic dilution of precision. Here we report a thorough high-resolution analysis of radio waves from low-frequency (˜20-150 kHz) radio communication transmitters which are recorded with a small aperture array of radio receivers during the day. It is found that the observed dilution of precision results from the array geometry of the radio receivers, a birefringent wave propagation, and the correlated multipath propagation of low-frequency radio waves. The influence of the array geometry on the dilution of precision is reduced by taking into account the impulse response of the array. This procedure reveals for the very first time the splitting of one single radio source into two distinct source locations separated by ˜0.2°-1.9° which result from a birefringent wave propagation. The two locations are yet more clearly identified by using the polarity of the modulated wave number vectors of the radio waves. This polarity is also used to quantify the dilution of precision arising from correlated multipath propagation which is discriminated against wave number fluctuations arising from the timing accuracy of the radio receivers. It is found that ˜69% of the wave number variability is of natural origin and ˜31% originates from the timing accuracy of the receivers. The wave number variability from correlated multipath propagation results in a standard deviation ˜2-8% relative to the source location. This compact measurement of correlated multipath propagation is used to characterize the uncertainty of source locations in the radio sky. The identification of correlated multipath propagation strongly suggests the existence of very fast processes acting on time scales <1 ms in the D region ionosphere with physically meaningful effects on low-frequency radio wave propagation. This important result has implications for practical applications in that the observed multipath

  17. Optical Circuit Switched Protocol

    NASA Technical Reports Server (NTRS)

    Monacos, Steve P. (Inventor)

    2000-01-01

    The present invention is a system and method embodied in an optical circuit switched protocol for the transmission of data through a network. The optical circuit switched protocol is an all-optical circuit switched network and includes novel optical switching nodes for transmitting optical data packets within a network. Each optical switching node comprises a detector for receiving the header, header detection logic for translating the header into routing information and eliminating the header, and a controller for receiving the routing information and configuring an all optical path within the node. The all optical path located within the node is solely an optical path without having electronic storage of the data and without having optical delay of the data. Since electronic storage of the header is not necessary and the initial header is eliminated by the first detector of the first switching node. multiple identical headers are sent throughout the network so that subsequent switching nodes can receive and read the header for setting up an optical data path.

  18. Robust message routing for mobile (wireless) ad hoc networks.

    SciTech Connect

    Goldsby, Michael E.; Johnson, Michael M.; Kilman, Dominique Marie; Bierbaum, Neal Robert; Chen, Helen Y.; Ammerlahn, Heidi R.; Tsang, Rose P.; Nicol, David M.

    2004-01-01

    This report describes the results of research targeting improvements in the robustness of message transport in wireless ad hoc networks. The first section of the report provides an analysis of throughput and latency in the wireless medium access control (MAC) layer and relates the analysis to the commonly used 802.11 protocol. The second section describes enhancements made to several existing models of wireless MAC and ad hoc routing protocols; the models were used in support of the work described in the following section. The third section of the report presents a lightweight transport layer protocol that is superior to TCP for use in wireless networks. In addition, it introduces techniques that improve the performance of any ad hoc source routing protocol. The fourth section presents a novel, highly scalable ad hoc routing protocol that is based on geographic principles but requires no localization hardware.

  19. Genetic algorithms for route discovery.

    PubMed

    Gelenbe, Erol; Liu, Peixiang; Lainé, Jeremy

    2006-12-01

    Packet routing in networks requires knowledge about available paths, which can be either acquired dynamically while the traffic is being forwarded, or statically (in advance) based on prior information of a network's topology. This paper describes an experimental investigation of path discovery using genetic algorithms (GAs). We start with the quality-of-service (QoS)-driven routing protocol called "cognitive packet network" (CPN), which uses smart packets (SPs) to dynamically select routes in a distributed autonomic manner based on a user's QoS requirements. We extend it by introducing a GA at the source routers, which modifies and filters the paths discovered by the CPN. The GA can combine the paths that were previously discovered to create new untested but valid source-to-destination paths, which are then selected on the basis of their "fitness." We present an implementation of this approach, where the GA runs in background mode so as not to overload the ingress routers. Measurements conducted on a network test bed indicate that when the background-traffic load of the network is light to medium, the GA can result in improved QoS. When the background-traffic load is high, it appears that the use of the GA may be detrimental to the QoS experienced by users as compared to CPN routing because the GA uses less timely state information in its decision making.

  20. Genetic algorithms for route discovery.

    PubMed

    Gelenbe, Erol; Liu, Peixiang; Lainé, Jeremy

    2006-12-01

    Packet routing in networks requires knowledge about available paths, which can be either acquired dynamically while the traffic is being forwarded, or statically (in advance) based on prior information of a network's topology. This paper describes an experimental investigation of path discovery using genetic algorithms (GAs). We start with the quality-of-service (QoS)-driven routing protocol called "cognitive packet network" (CPN), which uses smart packets (SPs) to dynamically select routes in a distributed autonomic manner based on a user's QoS requirements. We extend it by introducing a GA at the source routers, which modifies and filters the paths discovered by the CPN. The GA can combine the paths that were previously discovered to create new untested but valid source-to-destination paths, which are then selected on the basis of their "fitness." We present an implementation of this approach, where the GA runs in background mode so as not to overload the ingress routers. Measurements conducted on a network test bed indicate that when the background-traffic load of the network is light to medium, the GA can result in improved QoS. When the background-traffic load is high, it appears that the use of the GA may be detrimental to the QoS experienced by users as compared to CPN routing because the GA uses less timely state information in its decision making. PMID:17186801

  1. Measurements of wideband multipath propagation at 531 MHz and 1.265 GHz

    NASA Astrophysics Data System (ADS)

    Bell, C. P.; Brightwell, P. J.; Misson, N. J.; Rudd, R. F.; Williams, W. F.

    Multipath propagation measurements and their analyses are described. The work was carried out by the BBC over the period 1988-1990 as a contribution to the Eureka 147 Project, with the aim of providing statistical data required in the configuration of a Digital Audio Broadcast system. Two different areas were chosen for the tests, one considered as representative of a generally built-up area with varying degrees of urbanization, the other on the fringe of a relatively hilly area. In the first area two widely separated frequencies in the UHF band were used to enable estimates to be made of frequency dependence. The results are compared with those of other similar measurement programs in both Europe and the USA available prior to 1991. In general a somewhat lower incidence of long-delay multipath was observed in the BBC results, especially in the case of the hilly area.

  2. Effects of multipath fading on low data-rate space communications.

    NASA Technical Reports Server (NTRS)

    Chen, C. H.

    1972-01-01

    Studies have shown that there is a severe signal fading at the turbulent atmosphere of a distant planet such as Venus. The data may be lost during deep fade. It is the objective of this paper to examine the effects of multipath fading on the performance of the noncoherent coded system which is used for the low data-rate space communications especially with the small probes. An exact error probability of the wideband noncoherent MFSK receiver is derived from using the 'Rician' channel model. While the error performance of the receiver is worse than that of the ideal MFSK receiver, as expected, it is interesting to note that the performance degradation due to the multipath fading diminishes as the product of bit duration and IF filter bandwidth becomes large.

  3. A study of GPS measurement errors due to noise and multipath interference for CGADS

    NASA Technical Reports Server (NTRS)

    Axelrad, Penina; MacDoran, Peter F.; Comp, Christopher J.

    1996-01-01

    This report describes a study performed by the Colorado Center for Astrodynamics Research (CCAR) on GPS measurement errors in the Codeless GPS Attitude Determination System (CGADS) due to noise and multipath interference. Preliminary simulation models fo the CGADS receiver and orbital multipath are described. The standard FFT algorithms for processing the codeless data is described and two alternative algorithms - an auto-regressive/least squares (AR-LS) method, and a combined adaptive notch filter/least squares (ANF-ALS) method, are also presented. Effects of system noise, quantization, baseband frequency selection, and Doppler rates on the accuracy of phase estimates with each of the processing methods are shown. Typical electrical phase errors for the AR-LS method are 0.2 degrees, compared to 0.3 and 0.5 degrees for the FFT and ANF-ALS algorithms, respectively. Doppler rate was found to have the largest effect on the performance.

  4. Instantaneous altitude estimation of maneuvering target in over-the-horizon radar exploiting multipath Doppler signatures

    NASA Astrophysics Data System (ADS)

    Zhang, Yimin D.; Zhang, Jun Jason; Amin, Moeness G.; Himed, Braham

    2013-12-01

    Over-the-horizon radar systems are capable of localizing targets in range and azimuth but are unable to achieve reliable altitude estimation. Past work has shown that the time-varying Doppler signatures of micro-multipath signals provide rich information for reliable estimation of altitude changes. In this paper, we develop a new technique for the estimation of instantaneous altitude of maneuvering targets by exploiting the estimated multicomponent Doppler signatures. A key contribution of this paper is to apply effective non-stationary signal analysis techniques for estimating the time-varying Doppler signature of each individual multipath. This enables reliable target altitude estimation in an extended Kalman filter setup. The maximum a-posteriori criterion is used for the estimation of initial target states.

  5. Time delay and Doppler estimation for wideband acoustic signals in multipath environments.

    PubMed

    Jiang, Xue; Zeng, Wen-Jun; Li, Xi-Lin

    2011-08-01

    Estimation of the parameters of a multipath underwater acoustic channel is of great interest for a variety of applications. This paper proposes a high-resolution method for jointly estimating the multipath time delays, Doppler scales, and attenuation amplitudes of a time-varying acoustical channel. The proposed method formulates the estimation of channel parameters into a sparse representation problem. With the [script-l](1)-norm as the measure of sparsity, the proposed method makes use of the basis pursuit (BP) criterion to find the sparse solution. The ill-conditioning can be effectively reduced by the [script-l](1)-norm regularization. Unlike many existing methods that are only applicable to narrowband signals, the proposed method can handle both narrowband and wideband signals. Simulation results are provided to verify the performance and effectiveness of the proposed algorithm, indicating that it has a super-resolution in both delay and Doppler domain, and it is robust to noise.

  6. Acoustic multipath arrivals in the horizontal plane due to approaching nonlinear internal waves.

    PubMed

    Badiey, Mohsen; Katsnelson, Boris G; Lin, Ying-Tsong; Lynch, James F

    2011-04-01

    Simultaneous measurements of acoustic wave transmissions and a nonlinear internal wave packet approaching an along-shelf acoustic path during the Shallow Water 2006 experiment are reported. The incoming internal wave packet acts as a moving frontal layer reflecting (or refracting) sound in the horizontal plane. Received acoustic signals are filtered into acoustic normal mode arrivals. It is shown that a horizontal multipath interference is produced. This has previously been called a horizontal Lloyd's mirror. The interference between the direct path and the refracted path depends on the mode number and frequency of the acoustic signal. A mechanism for the multipath interference is shown. Preliminary modeling results of this dynamic interaction using vertical modes and horizontal parabolic equation models are in good agreement with the observed data.

  7. A Model of Onion Routing with Provable Anonymity

    NASA Astrophysics Data System (ADS)

    Feigenbaum, Joan; Johnson, Aaron; Syverson, Paul

    Onion routing is a scheme for anonymous communication that is designed for practical use. Until now, however, it has had no formal model and therefore no rigorous analysis of its anonymity guarantees. We give an IO-automata model of an onion-routing protocol and, under possibilistic definitions, characterize the situations in which anonymity and unlinkability are guaranteed.

  8. Trust Based Routing in Ad Hoc Network

    NASA Astrophysics Data System (ADS)

    Talati, Mikita V.; Valiveti, Sharada; Kotecha, K.

    Ad Hoc network often termed as an infrastructure-less, self- organized or spontaneous network.The execution and survival of an ad-hoc network is solely dependent upon the cooperative and trusting nature of its nodes. However, this naive dependency on intermediate nodes makes the ad-hoc network vulnerable to passive and active attacks by malicious nodes and cause inflict severe damage. A number of protocols have been developed to secure ad-hoc networks using cryptographic schemes, but all rely on the presence of trust authority. Due to mobility of nodes and limitation of resources in wireless network one interesting research area in MANET is routing. This paper offers various trust models and trust based routing protocols to improve the trustworthiness of the neighborhood.Thus it helps in selecting the most secure and trustworthy route from the available ones for the data transfer.

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

    NASA Astrophysics Data System (ADS)

    Jayaweera, Sudharman K.; Poor, H. Vincent

    2003-12-01

    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.

  10. Antifade sonar employs acoustic field diversity to recover signals from multipath fading

    SciTech Connect

    Lubman, D.

    1996-04-01

    Co-located pressure and particle motion (PM) hydrophones together with four-channel diversity combiners may be used to recover signals from multipath fading. Multipath fading is important in both shallow and deep water propagation and can be an important source of signal loss. The acoustic field diversity concept arises from the notion of conservation of signal energy and the observation that in rooms at least, the total acoustic energy density is the sum of potential energy (scalar field-sound pressure) and kinetic energy (vector field-sound PM) portions. One pressure hydrophone determines acoustic potential energy density at a point. In principle, three PM sensors (displacement, velocity, or acceleration) directed along orthogonal axes describe the kinetic energy density at a point. For a single plane wave, the time-averaged potential and kinetic field energies are identical everywhere. In multipath interference, however, potential and kinetic field energies at a point are partitioned unequally, depending mainly on relative signal phases. Thus, when pressure signals are in deep fade, abundant kinetic field signal energy may be available at that location. Performance benefits require a degree of uncorrelated fading between channels. The expectation of nearly uncorrelated fading is motivated from room theory. Performance benefits for sonar limited by independent Rayleigh fading are suggested by analogy to antifade radio. Average SNR can be improved by several decibels, holding time on target is multiplied manifold, and the bit error rate for data communication is reduced substantially. {copyright} {ital 1996 American Institute of Physics.}

  11. Frequency-selective fading statistics of shallow-water acoustic communication channel with a few multipaths

    NASA Astrophysics Data System (ADS)

    Bae, Minja; Park, Jihyun; Kim, Jongju; Xue, Dandan; Park, Kyu-Chil; Yoon, Jong Rak

    2016-07-01

    The bit error rate of an underwater acoustic communication system is related to multipath fading statistics, which determine the signal-to-noise ratio. The amplitude and delay of each path depend on sea surface roughness, propagation medium properties, and source-to-receiver range as a function of frequency. Therefore, received signals will show frequency-dependent fading. A shallow-water acoustic communication channel generally shows a few strong multipaths that interfere with each other and the resulting interference affects the fading statistics model. In this study, frequency-selective fading statistics are modeled on the basis of the phasor representation of the complex path amplitude. The fading statistics distribution is parameterized by the frequency-dependent constructive or destructive interference of multipaths. At a 16 m depth with a muddy bottom, a wave height of 0.2 m, and source-to-receiver ranges of 100 and 400 m, fading statistics tend to show a Rayleigh distribution at a destructive interference frequency, but a Rice distribution at a constructive interference frequency. The theoretical fading statistics well matched the experimental ones.

  12. Multipath Effects in Millimetre-Wave Wireless Communication using Orbital Angular Momentum Multiplexing

    PubMed Central

    Yan, Yan; Li, Long; Xie, Guodong; Bao, Changjing; Liao, Peicheng; Huang, Hao; Ren, Yongxiong; Ahmed, Nisar; Zhao, Zhe; Wang, Zhe; Ashrafi, Nima; Ashrafi, Solyman; Talwar, Shilpa; Sajuyigbe, Soji; Tur, Moshe; Molisch, Andreas F.; Willner, Alan E.

    2016-01-01

    Electromagnetic waves carrying orbital angular momentum (OAM) have been used for mode division multiplexing in free-space communication systems to increase both the capacity and the spectral efficiency. In the case of conventional wireless communication links using non-OAM beams, multipath effects caused by beam spreading and reflection from the surrounding objects affect the system performance. This paper presents the results of analysis, simulations, and measurements of multipath effects in a millimetre-wave communication link using OAM multiplexing at 28 GHz. Multipath-induced intra- and inter-channel crosstalk, which are caused by specular reflection from a plane parallel to the propagation path, are analysed and measured. Both the simulation and the experimental results show that an OAM channel with a high OAM number ℓ tends to suffer from both strong intra-channel crosstalk and strong inter-channel crosstalk with other OAM channels. Results of the analysis show that this observation can be explained on the basis of both the properties of OAM beam divergence and the filtering effect at the receiver, which is associated with the spiral wavefront of OAM beams. PMID:27658443

  13. A novel multi-path combination matching Michelson interferometer for straindeformation sensing

    NASA Astrophysics Data System (ADS)

    Jiang, Haili; Yuan, Yonggui; Yang, Jun; Yuan, Libo

    2010-11-01

    Based on low-coherence white light interferometric technology, a novel multi-path combination matching Michelson interferometer system has been proposed and demonstrated. The multi-path combination Michelson interferometer is configured by a series 2x2 fiber optic coupler connected each other. One end of the coupler array is connected with SLD light source in one port, the other port is linked with a photodiode detector. The other end of the 3dB fiber coupler array is with a coated reflective mirror in one port, the other port is terminated with a fiber collimator, and a reflective scanning mirror mounted on a translation stage and perpendicular to the fiber collimator. The scanning mirror is moving back and forth to match each optical path of the combination Michelson interferometer. In this multi-path combination Michelson interferometer, each fiber arm could be used as strain or deformation sensor. By using optical path tracking and recording technique, the quasi-distributed strain of each fiber arm can be calculated. The sensing system can be used to measure distribution strain or temperature. It has the potential in the applications of large scale smart structures health monitoring.

  14. Tree-based shortest-path routing algorithm

    NASA Astrophysics Data System (ADS)

    Long, Y. H.; Ho, T. K.; Rad, A. B.; Lam, S. P. S.

    1998-12-01

    A tree-based shortest path routing algorithm is introduced in this paper. With this algorithm, every network node can maintain a shortest path routing tree topology of the network with itself as the root. In this algorithm, every node constructs its own routing tree based upon its neighbors' routing trees. Initially, the routing tree at each node has the root only, the node itself. As information exchanges, every node's routing tree will evolve until a complete tree is obtained. This algorithm is a trade-off between distance vector algorithm and link state algorithm. Loops are automatically deleted, so there is no count-to- infinity effect. A simple routing tree information storage approach and a protocol data until format to transmit the tree information are given. Some special issues, such as adaptation to topology change, implementation of the algorithm on LAN, convergence and computation overhead etc., are also discussed in the paper.

  15. Performance Improvement in Geographic Routing for Vehicular Ad Hoc Networks

    PubMed Central

    Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D. K.; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

    2014-01-01

    Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed. PMID:25429415

  16. Performance improvement in geographic routing for Vehicular Ad Hoc Networks.

    PubMed

    Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D K; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

    2014-01-01

    Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed. PMID:25429415

  17. Performance improvement in geographic routing for Vehicular Ad Hoc Networks.

    PubMed

    Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D K; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

    2014-01-01

    Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed.

  18. Rational Protocols

    NASA Astrophysics Data System (ADS)

    Cachin, Christian

    Security research continues to provide a plethora of new protocols and mechanisms; these solutions patch either existing vulnerabilities found in practical systems or solve hypothetical security problems in the sense that the problem is often conceived at the same time when the first solution is proposed. Yet only a very small fraction of this research is relevant to ordinary users in the sense that they are willing to actually deploy the technology.

  19. Using Sphinx to Improve Onion Routing Circuit Construction

    NASA Astrophysics Data System (ADS)

    Kate, Aniket; Goldberg, Ian

    This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed Diffie-Hellman values, pairing-based onion routing, and certificateless onion routing. Our new circuit constructions are also secure in the universal composability framework, a property that was missing from the original constructions. Further, we compare the performance of our schemes with their older counterparts as well as with each other.

  20. State alternative route designations

    SciTech Connect

    Not Available

    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.

  1. State alternative route designations

    SciTech Connect

    Not Available

    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.

  2. PARALIND-based blind joint angle and delay estimation for multipath signals with uniform linear array

    NASA Astrophysics Data System (ADS)

    Liu, Xu; Guang, Liang; Yang, Longxiang; Zhu, Hongbo

    2012-12-01

    A novel joint angle and delay estimation (JADE) algorithm for multipath signals, based on the PARAllel profiles with LINear Dependencies (PARALIND) model, is proposed. Capitalizing on the structure property of Vandermonde matrices, PARALIND model is proved to be unique. Angle and delay of multiple rays of sources can be estimated by PARALIND decomposition and an ESPRIT-like shift-invariance technique. Simulation results show that the proposed algorithm outperforms the traditional JADE algorithm. It can automatically distinguish the estimated parameters between sources, and still be available when the number of rays is larger than the number of receiving antennae.

  3. Discrete estimation of continuous angle-modulated signals over multipath channels for aeronautical communication

    NASA Technical Reports Server (NTRS)

    Takhar, G. S.; Gupta, S. C.

    1976-01-01

    The multipath channel for communication between an aerospace vehicle and a ground terminal is modeled by a multiplicative first-order Markov process. The multiplicative process is treated as a component of the message model and the discrete-time demodulation algorithms using the extended Kalman nonlinear estimation technique are developed for continuous-time angle-modulated signals. The equivalent baseband form of the demodulator structure is derived. Two examples of the message process are discussed for an FM system. The simulation results are presented for various values of the bandwidth expansion ratio and the additive SNR. The performance of the baseband algorithms is discussed.

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

    NASA Technical Reports Server (NTRS)

    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.

  5. Multipath-enabled super-resolution for rf and microwave communication using phase-conjugate arrays.

    PubMed

    Henty, Benjamin E; Stancil, Daniel D

    2004-12-10

    We demonstrate experimentally that phase-conjugate techniques can be used to achieve super-resolution focusing of electromagnetic waves in a multipath indoor environment at 2.45 GHz. The focusing phenomena was used to direct independent signals to two locations separated by approximately one-half wavelength, thereby creating two simultaneous channels at the same frequency. An increase in channel capacity is shown to be achievable by an experimental transmission of a 1 Mbps signal over two channels created using a four element phase-conjugate array.

  6. Support vector machine multiuser receiver for DS-CDMA signals in multipath channels.

    PubMed

    Chen, S; Samingan, A K; Hanzo, L

    2001-01-01

    The problem of constructing an adaptive multiuser detector (MUD) is considered for direct sequence code division multiple access (DS-CDMA) signals transmitted through multipath channels. The emerging learning technique, called support vector machines (SVM), is proposed as a method of obtaining a nonlinear MUD from a relatively small training data block. Computer simulation is used to study this SVM MUD, and the results show that it can closely match the performance of the optimal Bayesian one-shot detector. Comparisons with an adaptive radial basis function (RBF) MUD trained by an unsupervised clustering algorithm are discussed.

  7. Network-wide BGP route prediction for traffic engineering

    NASA Astrophysics Data System (ADS)

    Feamster, Nick; Rexford, Jennifer

    2002-07-01

    The Internet consists of about 13,000 Autonomous Systems (AS's) that exchange routing information using the Border Gateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS's. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers. Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS's. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT&T's commercial IP network. Our route prediction techniques help support the operation of large IP backbone networks, where interdomain routing is an important aspect of traffic engineering.

  8. 40 CFR 792.120 - Protocol.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ...) Justification for selection of the test system. (6) Where applicable, the number, body weight, sex, source of... than established by the specifications. (10) The route of administration and the reason for its choice... changes in or revisions of an approved protocol and the reasons therefor shall be documented, signed...

  9. 40 CFR 160.120 - Protocol.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... selection of the test system. (6) Where applicable, the number, body weight range, sex, source of supply... specifications. (10) The route of administration and the reason for its choice. (11) Each dosage level, expressed... of an approved protocol and the reasons therefore shall be documented, signed by the study...

  10. 40 CFR 160.120 - Protocol.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... selection of the test system. (6) Where applicable, the number, body weight range, sex, source of supply... specifications. (10) The route of administration and the reason for its choice. (11) Each dosage level, expressed... of an approved protocol and the reasons therefore shall be documented, signed by the study...

  11. 40 CFR 160.120 - Protocol.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... selection of the test system. (6) Where applicable, the number, body weight range, sex, source of supply... specifications. (10) The route of administration and the reason for its choice. (11) Each dosage level, expressed... of an approved protocol and the reasons therefore shall be documented, signed by the study...

  12. CSR: Constrained Selfish Routing in Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    Bassem, Christine; Bestavros, Azer

    Routing protocols for ad-hoc networks assume that the nodes forming the network are either under a single authority, or else that they would be altruistically forwarding data for other nodes with no expectation of a return. These assumptions are unrealistic since in ad-hoc networks, nodes are likely to be autonomous and rational (selfish), and thus unwilling to help unless they have an incentive to do so. Providing such incentives is an important aspect that should be considered when designing ad-hoc routing protocols. In this paper, we propose a dynamic, decentralized routing protocol for ad-hoc networks that provides incentives in the form of payments to intermediate nodes used to forward data for others. In our Constrained Selfish Routing (CSR) protocol, game-theoretic approaches are used to calculate payments (incentives) that ensure both the truthfulness of participating nodes and the fairness of the CSR protocol. We show through simulations that CSR is an energy efficient protocol and that it provides lower communication overhead in the best and average cases compared to existing approaches.

  13. Advanced Launch System Multi-Path Redundant Avionics Architecture Analysis and Characterization

    NASA Technical Reports Server (NTRS)

    Baker, Robert L.

    1993-01-01

    The objective of the Multi-Path Redundant Avionics Suite (MPRAS) program is the development of a set of avionic architectural modules which will be applicable to the family of launch vehicles required to support the Advanced Launch System (ALS). To enable ALS cost/performance requirements to be met, the MPRAS must support autonomy, maintenance, and testability capabilities which exceed those present in conventional launch vehicles. The multi-path redundant or fault tolerance characteristics of the MPRAS are necessary to offset a reduction in avionics reliability due to the increased complexity needed to support these new cost reduction and performance capabilities and to meet avionics reliability requirements which will provide cost-effective reductions in overall ALS recurring costs. A complex, real-time distributed computing system is needed to meet the ALS avionics system requirements. General Dynamics, Boeing Aerospace, and C.S. Draper Laboratory have proposed system architectures as candidates for the ALS MPRAS. The purpose of this document is to report the results of independent performance and reliability characterization and assessment analyses of each proposed candidate architecture and qualitative assessments of testability, maintainability, and fault tolerance mechanisms. These independent analyses were conducted as part of the MPRAS Part 2 program and were carried under NASA Langley Research Contract NAS1-17964, Task Assignment 28.

  14. Multipath Separation-Direction of Arrival (MS-DOA) with Genetic Search Algorithm for HF channels

    NASA Astrophysics Data System (ADS)

    Arikan, Feza; Koroglu, Ozan; Fidan, Serdar; Arikan, Orhan; Guldogan, Mehmet B.

    2009-09-01

    Direction-of-Arrival (DOA) defines the estimation of arrival angles of an electromagnetic wave impinging on a set of sensors. For dispersive and time-varying HF channels, where the propagating wave also suffers from the multipath phenomena, estimation of DOA is a very challenging problem. Multipath Separation-Direction of Arrival (MS-DOA), that is developed to estimate both the arrival angles in elevation and azimuth and the incoming signals at the output of the reference antenna with very high accuracy, proves itself as a strong alternative in DOA estimation for HF channels. In MS-DOA, a linear system of equations is formed using the coefficients of the basis vector for the array output vector, the incoming signal vector and the array manifold. The angles of arrival in elevation and azimuth are obtained as the maximizers of the sum of the magnitude squares of the projection of the signal coefficients on the column space of the array manifold. In this study, alternative Genetic Search Algorithms (GA) for the maximizers of the projection sum are investigated using simulated and experimental ionospheric channel data. It is observed that GA combined with MS-DOA is a powerful alternative in online DOA estimation and can be further developed according to the channel characteristics of a specific HF link.

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

    PubMed Central

    Zhang, Tao; Shi, Hongfei; Chen, Liping; Li, Yao; Tong, Jinwu

    2016-01-01

    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. PMID:26978361

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

    PubMed

    Zhang, Tao; Shi, Hongfei; Chen, Liping; Li, Yao; Tong, Jinwu

    2016-03-11

    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.

  17. Multipath Effects on High-Frequency Coherent Acoustic Communications in Shallow Water

    NASA Astrophysics Data System (ADS)

    Son, Su-Uk; Kim, Hyeonsu; Joo, Jongmin; Choi, Jee Woong

    2013-07-01

    Shallow-water acoustic communication channel, referred to as a multipath-limited channel, produces inter-symbol interference that poses a significant obstacle to reliable communication. Accordingly, signal-to-multipath ratio (SMR), rather than signal-to-noise ratio (SNR), becomes an important factor affecting communication performance. However, it is difficult to estimate SMR from measured communication data, especially at higher frequency (>10 kHz) because many arrivals scattered from rough ocean boundaries produce a significant intrapath time spreading, which acts as random noise in communication. In this paper, the energy fraction of the channel impulse response existing in one symbol duration is proposed as a parameter for estimating the quality of shallow-water communication channels. This parameter is compared with the bit-error-rate performance for data acquired in shallow water off the south coast of Korea, where the water depth is 45 m and the bottom consists of sandy clay sediment. The results imply that the energy fraction in one symbol duration may be used as a parameter for describing shallow-water communication channels and applied to the quick decision of a symbol or bit rate in a shallow-water field for reliable underwater communication.

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

    PubMed

    Zhang, Tao; Shi, Hongfei; Chen, Liping; Li, Yao; Tong, Jinwu

    2016-01-01

    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. PMID:26978361

  19. Blind, high-resolution, space-time separation of multipaths in an ionospheric propagation

    NASA Astrophysics Data System (ADS)

    Chenu-Tournier, M.; Larzabal, P.; Barbot, J. P.; Grouffaud, J.; Ferreol, A.

    2000-01-01

    The ionospheric radio electrical transmissions have multiple paths due to the inhomogeneity of the propagation medium, that is, the ionospheric layers. Tactical applications such as radiolocation and radiocommunications systems need blind, high-resolution identification of multipath channels. This work concerns the separation of the ionospheric paths and is based on recent work done on blind deconvolution which can estimate the impulse responses of a propagation channel. In this way, on the basis of a parametric model of the paths, we propose a blind, spatiotemporal identification of the propagation channel. The parameters that characterize the propagation model are the directions of arrivals (DOA) θ, time delays τ, and complex gains α (also called fading). We propose an algorithm that can both estimate the multipath parameters and test them on real life data. This new method needs fewer snapshots than other methods recently proposed, and thus can monitor more quickly varying channels. Moreover, compared to recent work we have relaxed the problem of making successive estimates of the impulse responses. The proposed method can also identify more paths than the number of sensors. An extension of the algorithm will be presented by including polarization diversity and thus increases the resolution. The proposed methods are illustrated on experimental data.

  20. Multi-GNSS and Multi-frequency SNR Multipath Reflectometry of Snow Depth

    NASA Astrophysics Data System (ADS)

    Tabibi, S.; Geremia-Nievinski, F.; van Dam, T. M.

    2015-12-01

    Global Navigation Satellite System multipath reflectometry (GNSS-MR) uses ground-based signals of opportunity to retrieve snow depth at an intermediate space scale. This technique is based on the signal-to-noise ratio (SNR) of the simultaneously received direct (line-of-sight) and coherently ground reflected signals. In this contribution, forward and inverse modeling of SNR observations is presented for GLONASS-MR, extending GPS-MR to multiple GNSS. The coupling of the surface and antenna responses from short-delay near-grazing incidence multipath from CDMA and FDMA satellite navigation systems are simulated using an electromagnetic forward model. The inverse model is used to estimate parameter corrections responsible for observation residuals to estimate snow depth. The correlation between snow depth retrievals using GPS L2C signal and GLONASS R2-C/A signal is excellent, with r2 value of 0.990. In a related approach, dual-frequency SNR-based GNSS-MR, which is based on linear combination of SNR observables, is used to estimate snow depth. This ionospheric delay free method synthesizes longer carrier wavelengths ("widelaning" or delta-k) to isolate the direct power contribution in environmental retrievals.

  1. Characterization of global positioning system earth surface multipath and cross correlation for aircraft precision approach operations using software radio technology

    NASA Astrophysics Data System (ADS)

    Zhu, Zhen

    A GPS Software Defined Radio (SDR) is designed for the analysis of GPS error sources, and is applied to evaluate earth-surface multipath errors and self-interference errors due to C/A code cross correlation for aircraft precision approach operations. The pseudorange error caused by earth-surface multipath is characterized for airborne GPS receivers. A detection algorithm that can estimate the strength of earth-surface multipath from the received signals is developed and implemented in the GPS SDR. The response to earth-surface multipath from different GPS receiver architectures is studied, from which it is determined that the pseudorange errors could be bounded to within a few decimeters with a careful selection of tracking algorithms. GPS self-interference caused by C/A code cross correlation is evaluated in the operational environment. The induced errors on pseudorange and Carrier to Noise Ratio estimation are characterized, and bounds are determined for relative signal strength, Doppler frequency, and Doppler change rate to limit the pseudorange errors to 0.2 m.

  2. Multi-Hop Routing Mechanism for Reliable Sensor Computing

    PubMed Central

    Chen, Jiann-Liang; Ma, Yi-Wei; Lai, Chia-Ping; Hu, Chia-Cheng; Huang, Yueh-Min

    2009-01-01

    Current research on routing in wireless sensor computing concentrates on increasing the service lifetime, enabling scalability for large number of sensors and supporting fault tolerance for battery exhaustion and broken nodes. A sensor node is naturally exposed to various sources of unreliable communication channels and node failures. Sensor nodes have many failure modes, and each failure degrades the network performance. This work develops a novel mechanism, called Reliable Routing Mechanism (RRM), based on a hybrid cluster-based routing protocol to specify the best reliable routing path for sensor computing. Table-driven intra-cluster routing and on-demand inter-cluster routing are combined by changing the relationship between clusters for sensor computing. Applying a reliable routing mechanism in sensor computing can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption. Simulation results indicate that the reliability of the proposed RRM mechanism is around 25% higher than that of the Dynamic Source Routing (DSR) and ad hoc On-demand Distance Vector routing (AODV) mechanisms. PMID:22303165

  3. Automatic routing module

    NASA Technical Reports Server (NTRS)

    Malin, Janice A.

    1987-01-01

    Automatic Routing Module (ARM) is a tool to partially automate Air Launched Cruise Missile (ALCM) routing. For any accessible launch point or target pair, ARM creates flyable routes that, within the fidelity of the models, are optimal in terms of threat avoidance, clobber avoidance, and adherence to vehicle and planning constraints. Although highly algorithmic, ARM is an expert system. Because of the heuristics applied, ARM generated routes closely resemble manually generated routes in routine cases. In more complex cases, ARM's ability to accumulate and assess threat danger in three dimensions and trade that danger off with the probability of ground clobber results in the safest path around or through difficult areas. The tools available prior to ARM did not provide the planner with enough information or present it in such a way that ensured he would select the safest path.

  4. Surface wave propagation in central Asia: Observations of scattering and multipathing with the Kyrgyzstan broadband array

    NASA Astrophysics Data System (ADS)

    Pavlis, Gary L.; Mahdi, Hanan

    1996-04-01

    We studied the propagation of Rayleigh waves at regional distances in central Asia using a combination of array processing techniques and surface wave analysis. We present results from the detailed analysis of three representative events recorded by a 10-station, broadband network that has been running in the central Asian country of Kyrgyzstan since 1991: an Ms = 5.1 event near Ashkhabad, Turkmenistan; an Ms = 5.8 event in south central Tibet; and the October 7, 1994, nuclear explosion at Lop Nor. We find there is a remarkable difference in the propagation characteristics of surface waves along these three paths. The path from the event in Turkmenistan is simple and is well approximated by propagation through a laterally homogeneous medium. Array processing shows the entire Rayleigh wave train stacks coherently and arrives from an azimuth close to that predicted by a great circle path. Furthermore, estimates of dispersion curves and fundamental mode signals determined for individual stations show little variation across the array. The Tibet and Lop Nor paths are completely different. We find strong evidence for complicated multipathing and scattering effects along both of these paths. We observe a three-stage pattern in the Tibet case: (1) the early, lowest-frequency part of the Rayleigh wave packet arrives as a coherent signal from close to the great circle path azimuth; (2) this is overpowered in the period range around 20 s by a strong multipath signal that propagates across the array from a much more southerly azimuth; and (3) periods below 20 s rapidly become incoherent, and the signal does not have a well-defined direction of propagation. The Lop Nor path shows similar complexity. On this path there is little dispersion for measurable periods greater than 10 s, so the low-frequency energy arrives in an Airy phase. The Airy phase stacks somewhat coherently (it stacks, but significant power is lost in the best beam), and slowness analysis shows it arrives from

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

    NASA Technical Reports Server (NTRS)

    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.

  6. An adaptive routing scheme in scale-free networks

    NASA Astrophysics Data System (ADS)

    Ben Haddou, Nora; Ez-Zahraouy, Hamid; Benyoussef, Abdelilah

    2015-05-01

    We suggest an optimal form of traffic awareness already introduced as a routing protocol which combines structural and local dynamic properties of the network to determine the followed path between source and destination of the packet. Instead of using the shortest path, we incorporate the "efficient path" in the protocol and we propose a new parameter α that controls the contribution of the queue in the routing process. Compared to the original model, the capacity of the network can be improved more than twice when using the optimal conditions of our model. Moreover, the adjustment of the proposed parameter allows the minimization of the travel time.

  7. Neighboring and connectivity-aware routing in VANETs.

    PubMed

    Ghafoor, Huma; Koo, Insoo; Gohar, Nasir-ud-Din

    2014-01-01

    A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR) for vehicular ad hoc networks (VANETs) is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate) node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments), and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

  8. Summary of the EPA (Environmental Protection Agency) workshop on carcinogenesis bioassay via the dermal route. Final technical report

    SciTech Connect

    Not Available

    1987-04-29

    Traditionally, the oral route has been the most common route of administration in bioassays which tested the potential carcinogenicity of chemicals. Regulatory agencies, however, prefer to have test chemicals applied by the same route as expected human exposure, whenever possible. Since human exposure to industrial chemicals is frequently via the dermal route, this has become a route of choice for animal testing of certain chemicals. However, protocol design for dermal bioassays presents many unique problems which must be addressed before guidelines for bioassays by the dermal route can be formulated. Furthermore, it may be feasible to develop a limited dermal protocol to screen certain classes of chemicals such as acrylates/methacrylates. Recognizing the need for this workshop, it was designed in two distinct parts; to address the problems inherent in the development of a generic protocol for dermal bioassays and, a specific limited dermal bioassay protocol for acrylates/methacrylates.

  9. Miniature interferometer terminals for earth surveying /MITES/ - Geodetic results and multipath effects

    NASA Astrophysics Data System (ADS)

    Counselman, C. C., III

    Experiments which confirm theoretical predictions regarding the use of MITES terminals for measuring baseline vectors on the ground using interferometric observations of earth-orbiting satellites are presented. A set of five global positioning satellites (GPS) were observed by MITES antennas at 1.3 hour time intervals on each of two days, and it is found that this distribution facilitates the correct resolution of interferometer fringe ambiguities. In addition, experiments show that multipath interference does not pose significant problems at the centimeter level. MITES is still being developed using baseline lengths of up to 4,000 km, and a new system should demonstrate improved geodetic accuracy, and will probably require one hour observation intervals.

  10. Male sperm whale acoustic behavior observed from multipaths at a single hydrophone

    NASA Astrophysics Data System (ADS)

    Laplanche, Christophe; Adam, Olivier; Lopatka, Maciej; Motsch, Jean-François

    2005-10-01

    Sperm whales generate transient sounds (clicks) when foraging. These clicks have been described as echolocation sounds, a result of having measured the source level and the directionality of these signals and having extrapolated results from biosonar tests made on some small odontocetes. The authors propose a passive acoustic technique requiring only one hydrophone to investigate the acoustic behavior of free-ranging sperm whales. They estimate whale pitch angles from the multipath distribution of click energy. They emphasize the close bond between the sperm whale's physical and acoustic activity, leading to the hypothesis that sperm whales might, like some small odontocetes, control click level and rhythm. An echolocation model estimating the range of the sperm whale's targets from the interclick interval is computed and tested during different stages of the whale's dive. Such a hypothesis on the echolocation process would indicate that sperm whales echolocate their prey layer when initiating their dives and follow a methodic technique when foraging.

  11. Joint ionospheric and target state estimation for multipath OTHR track fusion

    NASA Astrophysics Data System (ADS)

    Rutten, Mark G.; Percival, D. John

    2001-11-01

    Over-the-horizon Radar (OTHR) uses the ionosphere as a propagation medium to detect targets beyond the line-of-sight horizon. The layered structure of the ionosphere can support several signal propagation paths between the radar site and detected targets, often giving rise to multiple radar tracks for a single target. A multi-hypothesis multipath track fusion (MPTF) algorithm for OTHR has been developed and reported in earlier publications. In this paper, the MPTF formalism is developed from first principles to explicitly explore sources of track dependence which arise in OTHR track fusion. In particular, a solution is proposed which accounts for track-to-track dependencies arising from common target ionospheric dynamic processes. The algorithm is applied to the simplest nontrivial case, where the ionosphere is modeled as two spherically-symmetric reflecting layers, and two radar tracks are observed.

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

    SciTech Connect

    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.

  13. Noise-Assisted Concurrent Multipath Traffic Distribution in Ad Hoc Networks

    PubMed Central

    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. PMID:24319375

  14. An Improved Proportionate Normalized Least-Mean-Square Algorithm for Broadband Multipath Channel Estimation

    PubMed Central

    2014-01-01

    To make use of the sparsity property of broadband multipath wireless communication channels, we mathematically propose an lp-norm-constrained proportionate normalized least-mean-square (LP-PNLMS) sparse channel estimation algorithm. A general lp-norm is weighted by the gain matrix and is incorporated into the cost function of the proportionate normalized least-mean-square (PNLMS) algorithm. This integration is equivalent to adding a zero attractor to the iterations, by which the convergence speed and steady-state performance of the inactive taps are significantly improved. Our simulation results demonstrate that the proposed algorithm can effectively improve the estimation performance of the PNLMS-based algorithm for sparse channel estimation applications. PMID:24782663

  15. An improved proportionate normalized least-mean-square algorithm for broadband multipath channel estimation.

    PubMed

    Li, Yingsong; Hamamura, Masanori

    2014-01-01

    To make use of the sparsity property of broadband multipath wireless communication channels, we mathematically propose an l p -norm-constrained proportionate normalized least-mean-square (LP-PNLMS) sparse channel estimation algorithm. A general l p -norm is weighted by the gain matrix and is incorporated into the cost function of the proportionate normalized least-mean-square (PNLMS) algorithm. This integration is equivalent to adding a zero attractor to the iterations, by which the convergence speed and steady-state performance of the inactive taps are significantly improved. Our simulation results demonstrate that the proposed algorithm can effectively improve the estimation performance of the PNLMS-based algorithm for sparse channel estimation applications.

  16. A Low-Complexity Transceiver Design in Sparse Multipath Massive MIMO Channels

    NASA Astrophysics Data System (ADS)

    Yu, Yuehua; Wang, Peng; Chen, He; Li, Yonghui; Vucetic, Branka

    2016-10-01

    In this letter, we develop a low-complexity transceiver design, referred to as semi-random beam pairing (SRBP), for sparse multipath massive MIMO channels. By exploring a sparse representation of the MIMO channel in the virtual angular domain, we generate a set of transmit-receive beam pairs in a semi-random way to support the simultaneous transmission of multiple data streams. These data streams can be easily separated at the receiver via a successive interference cancelation (SIC) technique, and the power allocation among them are optimized based on the classical waterfilling principle. The achieved degree of freedom (DoF) and capacity of the proposed approach are analyzed. Simulation results show that, compared to the conventional singular value decomposition (SVD)-based method, the proposed transceiver design can achieve near-optimal DoF and capacity with a significantly lower computational complexity.

  17. Sparse-representation algorithms for blind estimation of acoustic-multipath channels.

    PubMed

    Zeng, Wen-Jun; Jiang, Xue; So, Hing Cheung

    2013-04-01

    Acoustic channel estimation is an important problem in various applications. Unlike many existing channel estimation techniques that need known probe or training signals, this paper develops a blind multipath channel identification algorithm. The proposed approach is based on the single-input multiple-output model and exploits the sparse multichannel structure. Three sparse representation algorithms, namely, matching pursuit, orthogonal matching pursuit, and basis pursuit, are applied to the blind sparse identification problem. Compared with the classical least squares approach to blind multichannel estimation, the proposed scheme does not require that the channel order be exactly determined and it is robust to channel order selection. Moreover, the ill-conditioning induced by the large delay spread is overcome by the sparse constraint. Simulation results for deconvolution of both underwater and room acoustic channels confirm the effectiveness of the proposed approach.

  18. Experimental assessment of different receiver structures for underwater acoustic communications over multipath channels.

    PubMed

    Zhang, Guosong; Hovem, Jens M; Dong, Hefeng

    2012-01-01

    Underwater communication channels are often complicated, and in particular multipath propagation may cause intersymbol interference (ISI). This paper addresses how to remove ISI, and evaluates the performance of three different receiver structures and their implementations. Using real data collected in a high-frequency (10-14 kHz) field experiment, the receiver structures are evaluated by off-line data processing. The three structures are multichannel decision feedback equalizer (DFE), passive time reversal receiver (passive-phase conjugation (PPC) with a single channel DFE), and the joint PPC with multichannel DFE. In sparse channels, dominant arrivals represent the channel information, and the matching pursuit (MP) algorithm which exploits the channel sparseness has been investigated for PPC processing. In the assessment, it is found that: (1) it is advantageous to obtain spatial gain using the adaptive multichannel combining scheme; and (2) the MP algorithm improves the performance of communications using PPC processing.

  19. Experimental Assessment of Different Receiver Structures for Underwater Acoustic Communications over Multipath Channels

    PubMed Central

    Zhang, Guosong; Hovem, Jens M.; Dong, Hefeng

    2012-01-01

    Underwater communication channels are often complicated, and in particular multipath propagation may cause intersymbol interference (ISI). This paper addresses how to remove ISI, and evaluates the performance of three different receiver structures and their implementations. Using real data collected in a high-frequency (10–14 kHz) field experiment, the receiver structures are evaluated by off-line data processing. The three structures are multichannel decision feedback equalizer (DFE), passive time reversal receiver (passive-phase conjugation (PPC) with a single channel DFE), and the joint PPC with multichannel DFE. In sparse channels, dominant arrivals represent the channel information, and the matching pursuit (MP) algorithm which exploits the channel sparseness has been investigated for PPC processing. In the assessment, it is found that: (1) it is advantageous to obtain spatial gain using the adaptive multichannel combining scheme; and (2) the MP algorithm improves the performance of communications using PPC processing. PMID:22438755

  20. A relation between multipath group velocity, mode number, and ray cycle distance.

    PubMed

    Harrison, Chris H

    2012-07-01

    Weston's ray invariant or "characteristic time" in a range-dependent environment is exactly equivalent to the Wentzel-Kramers-Brillouin phase integral for ducted normal modes. By considering a ray element it is shown that the ray invariant can also be written in terms of ray cycle distance and cycle time. This leads to a useful formula for group velocity in terms of cycle distance and mode number. Drawing a distinction between the ray and wave interpretation, the Airy phase (i.e., the existence of a group velocity minimum) can be included in this approach. Favorable comparisons are made with group velocities derived from a normal mode model. The relationship is valid for variable sound speed and variable bathymetry, and this is demonstrated numerically. The formula is applicable to active sonar, multipath pulse shape, target signatures, reverberation, tomography, and underwater communications. PMID:22779454

  1. The relation between the waveguide invariant, multipath impulse response, and ray cycles.

    PubMed

    Harrison, Chris H

    2011-05-01

    The waveguide invariant, β, that manifests itself as interference fringes or "striations" in a plot of frequency vs source-receiver separation, is usually thought of as a modal phenomenon. This paper shows that striations can be explained simply through the variation of the eigenray arrival times with range, in short, the variation of the multipath impulse response. It is possible to calculate β for a number of sound speed profiles analytically and to find what β depends on, why it switches from one value to another, how it depends on source-receiver depth, how it depends on variable bathymetry, and how smooth the sound speed profile needs to be for clear fringes. The analytical findings are confirmed by calculating striation patterns numerically starting from eigenray travel times in various stratified environments. Most importantly the approach throws some light on what can be deduced from β alone and the likelihood and utility of striations in reverberation. PMID:21568390

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

    PubMed

    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.

  3. DOA Estimation under Unknown Mutual Coupling and Multipath with Improved Effective Array Aperture

    PubMed Central

    Wang, Yuexian; Trinkle, Matthew; Ng, Brian W.-H.

    2015-01-01

    Subspace-based high-resolution direction of arrival (DOA) estimation significantly deteriorates under array manifold perturbation and rank deficiency of the covariance matrix due to mutual coupling and multipath propagation, respectively. In this correspondence, the unknown mutual coupling can be circumvented by the proposed method without any passive or active calibration process, and the DOA of the coherent signals can be accurately estimated accordingly. With a newly constructed matrix, the deficient rank can be restored, and the effective array aperture can be extended compared with conventional spatial smoothing. The proposed method achieves a good robustness and DOA estimation accuracy with unknown mutual coupling. The simulation results demonstrate the validity and efficiency of the proposed method. PMID:26670235

  4. A relation between multipath group velocity, mode number, and ray cycle distance.

    PubMed

    Harrison, Chris H

    2012-07-01

    Weston's ray invariant or "characteristic time" in a range-dependent environment is exactly equivalent to the Wentzel-Kramers-Brillouin phase integral for ducted normal modes. By considering a ray element it is shown that the ray invariant can also be written in terms of ray cycle distance and cycle time. This leads to a useful formula for group velocity in terms of cycle distance and mode number. Drawing a distinction between the ray and wave interpretation, the Airy phase (i.e., the existence of a group velocity minimum) can be included in this approach. Favorable comparisons are made with group velocities derived from a normal mode model. The relationship is valid for variable sound speed and variable bathymetry, and this is demonstrated numerically. The formula is applicable to active sonar, multipath pulse shape, target signatures, reverberation, tomography, and underwater communications.

  5. An Investigation of Multipath Effects on the GPS System During Auto-Rendezvous and Capture

    NASA Technical Reports Server (NTRS)

    Richie, James E.; Forest, Francis W.

    1995-01-01

    The proposed use of a Cargo Transport Vehicle (CTV) to carry hardware to the Space Station Freedom (SSF) during the construction phase of the SSF project requires remote maneuvering of the CTV. The CTV is not a manned vehicle. Obtaining the relative positions of the CTV and SSF for remote auto-rendezvous and capture (AR&C) scenarios will rely heavily on the Global Positioning System (GPS). The GPS system is expected to guide the CTV up to a distance of 100 to 300 meters from the SSF. At some point within this range, an optical docking system will take over the remote guidance for capture. During any remote guidance by GPS it is possible that significant multipath signals may be caused by large objects in the vicinity of the module being remotely guided. This could alter the position obtained by the GPS system from the actual position. Due to the nature of the GPS signals, it has been estimated that if the difference in distance between the Line of Sight (LOS) path and the multipath is greater than 300 meters, the GPS system is capable of discriminating between the direct signal and the reflected (or multipath) signal. However, if the path difference is less than 300 meters, one must be concerned. This report details the work accomplished by the Electromagnetic Simulations Laboratory at Marquette University over the period December 1993 to May 1995. This work is an investigation of the strength and phase of a multipath signal arriving at the CTV relative to the direct or line of sight (LOS) signal. The signal originates at a GPS satellite in half geo-stationary orbit and takes two paths to the CTV: (1) the direct or LOS path from the GPS satellite to the CTV; and (2) a scattered path from the GPS satellite to the SSF module and then to the CTV. The scattering from a cylinder has been computed using the physical optics approximation for the current. No other approximations or assumptions have been made including no assumptions regarding the far field or Fresnel field

  6. Gaussian mixture probability hypothesis density filter for multipath multitarget tracking in over-the-horizon radar

    NASA Astrophysics Data System (ADS)

    Qin, Yong; Ma, Hong; Chen, Jinfeng; Cheng, Li

    2015-12-01

    Conventional multitarget tracking systems presume that each target can produce at most one measurement per scan. Due to the multiple ionospheric propagation paths in over-the-horizon radar (OTHR), this assumption is not valid. To solve this problem, this paper proposes a novel tracking algorithm based on the theory of finite set statistics (FISST) called the multipath probability hypothesis density (MP-PHD) filter in cluttered environments. First, the FISST is used to derive the update equation, and then Gaussian mixture (GM) is introduced to derive the closed-form solution of the MP-PHD filter. Moreover, the extended Kalman filter (EKF) is presented to deal with the nonlinear problem of the measurement model in OTHR. Eventually, the simulation results are provided to demonstrate the effectiveness of the proposed filter.

  7. Estimation of multipath transmission parameters for quantitative ultrasound measurements of bone.

    PubMed

    Dencks, Stefanie; Schmitz, Georg

    2013-09-01

    When applying quantitative ultrasound (QUS) measurements to bone for predicting osteoporotic fracture risk, the multipath transmission of sound waves frequently occurs. In the last 10 years, the interest in separating multipath QUS signals for their analysis awoke, and led to the introduction of several approaches. Here, we compare the performances of the two fastest algorithms proposed for QUS measurements of bone: the modified least-squares Prony method (MLSP), and the space alternating generalized expectation maximization algorithm (SAGE) applied in the frequency domain. In both approaches, the parameters of the transfer functions of the sound propagation paths are estimated. To provide an objective measure, we also analytically derive the Cramér-Rao lower bound of variances for any estimator and arbitrary transmit signals. In comparison with results of Monte Carlo simulations, this measure is used to evaluate both approaches regarding their accuracy and precision. Additionally, with simulations using typical QUS measurement settings, we illustrate the limitations of separating two superimposed waves for varying parameters with focus on their temporal separation. It is shown that for good SNRs around 100 dB, MLSP yields better results when two waves are very close. Additionally, the parameters of the smaller wave are more reliably estimated. If the SNR decreases, the parameter estimation with MLSP becomes biased and inefficient. Then, the robustness to noise of the SAGE clearly prevails. Because a clear influence of the interrelation between the wavelength of the ultrasound signals and their temporal separation is observable on the results, these findings can be transferred to QUS measurements at other sites. The choice of the suitable algorithm thus depends on the measurement conditions.

  8. Multipath sparse coding for scene classification in very high resolution satellite imagery

    NASA Astrophysics Data System (ADS)

    Fan, Jiayuan; Tan, Hui Li; Lu, Shijian

    2015-10-01

    With the rapid development of various satellite sensors, automatic and advanced scene classification technique is urgently needed to process a huge amount of satellite image data. Recently, a few of research works start to implant the sparse coding for feature learning in aerial scene classification. However, these previous research works use the single-layer sparse coding in their system and their performances are highly related with multiple low-level features, such as scale-invariant feature transform (SIFT) and saliency. Motivated by the importance of feature learning through multiple layers, we propose a new unsupervised feature learning approach for scene classification on very high resolution satellite imagery. The proposed unsupervised feature learning utilizes multipath sparse coding architecture in order to capture multiple aspects of discriminative structures within complex satellite scene images. In addition, the dense low-level features are extracted from the raw satellite data by using different image patches with varying size at different layers, and this approach is not limited to a particularly designed feature descriptors compared with the other related works. The proposed technique has been evaluated on two challenging high-resolution datasets, including the UC Merced dataset containing 21 different aerial scene categories with a 1 foot resolution and the Singapore dataset containing 5 land-use categories with a 0.5m spatial resolution. Experimental results show that it outperforms the state-of-the-art that uses the single-layer sparse coding. The major contributions of this proposed technique include (1) a new unsupervised feature learning approach to generate feature representation for very high-resolution satellite imagery, (2) the first multipath sparse coding that is used for scene classification in very high-resolution satellite imagery, (3) a simple low-level feature descriptor instead of many particularly designed low-level descriptor

  9. Understanding individual routing behaviour.

    PubMed

    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. PMID:26962031

  10. Understanding individual routing behaviour.

    PubMed

    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.

  11. Routing Vehicles with Ants

    NASA Astrophysics Data System (ADS)

    Tan, Wen Fang; Lee, Lai Soon; Majid, Zanariah Abdul; Seow, Hsin Vonn

    Routing vehicles involve the design of an optimal set of routes for a fleet of vehicles to serve a number of customers with known demands. This research develops an Ant Colony Optimization for the vehicle routing with one central depot and identical vehicles. The procedure simulates the behavior of real ants that always find the shortest path between their nest and a food source through a form of communication, pheromone trail. Finally, preliminary results on the learning of the algorithm testing on benchmark data set will be presented in this paper.

  12. Improved efficient routing strategy on two-layer complex networks

    NASA Astrophysics Data System (ADS)

    Ma, Jinlong; Han, Weizhan; Guo, Qing; Zhang, Shuai; Wang, Junfang; Wang, Zhihao

    2016-10-01

    The traffic dynamics of multi-layer networks has become a hot research topic since many networks are comprised of two or more layers of subnetworks. Due to its low traffic capacity, the traditional shortest path routing (SPR) protocol is susceptible to congestion on two-layer complex networks. In this paper, we propose an efficient routing strategy named improved global awareness routing (IGAR) strategy which is based on the betweenness centrality of nodes in the two layers. With the proposed strategy, the routing paths can bypass hub nodes of both layers to enhance the transport efficiency. Simulation results show that the IGAR strategy can bring much better traffic capacity than the SPR and the global awareness routing (GAR) strategies. Because of the significantly improved traffic performance, this study is helpful to alleviate congestion of the two-layer complex networks.

  13. Licklider Transmission Protocol Implementation

    NASA Technical Reports Server (NTRS)

    Burleigh, Scott C.; Krupiarz, Chris

    2011-01-01

    This software is an implementation of the Licklider Transmission Protocol (LTP), a communications protocol intended to support the Bundle Protocol in Delay-Tolerant Network (DTN) operations. LTP is designed to provide retransmission-based reliability over links characterized by extremely long message round-trip times and/or frequent interruptions in connectivity. Communication in interplanetary space is the most prominent example of this sort of environment, and LTP is principally aimed at supporting long-haul reliable transmission over deep-space RF links. Like any reliable transport service employing ARQ (Automatic Repeat re-Quests), LTP is stateful. In order to assure the reception of a block of data it has sent, LTP must retain for possible retransmission all portions of that block which might not have been received yet. In order to do so, it must keep track of which portions of the block are known to have been received so far, and which are not, together with any additional information needed for purposes of retransmitting part, or all, of the block. Long round-trip times mean substantial delay between the transmission of a block of data and the reception of an acknowledgement from the block s destination, signaling arrival of the block. If LTP postponed transmission of additional blocks of data until it received acknowledgement of the arrival of all prior blocks, valuable opportunities to use what little deep space transmission bandwidth is available would be forever lost. For this reason, LTP is based in part on a notion of massive state retention. Any number of requested transmission conversations (sessions) may be concurrently in flight at various displacements along the link between two LTP engines, and the LTP engines must necessarily retain transmission status and retransmission resources for all of them. Moreover, if any of the data of a given block are lost en route, it will be necessary to retain the state of that transmission during an additional

  14. Class network routing

    DOEpatents

    Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    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.

  15. Railroad Routing Model

    1995-01-05

    INTERLINE/PC is an interactive program designed to simulate the routing practices of the United States rail system. The rail industry is divided into a large number of independent competing companies. The INTERLINE data base represents these rail companies as 94 separate subnetworks. An additional two subnetworks represent navigable inland/intracoastal and deep draft marine routes. Interchange points between individual rail systems and waterway systems are also identified.

  16. Route Award Considerations

    NASA Technical Reports Server (NTRS)

    Rogers, W. D., Jr.

    1972-01-01

    The organization, responsibilities, and functions of the Civil Aeronautics Board are discussed. Several examples of decisions made by the Civil Aeronautics Board on the award of specific air routes to competing air lines are presented. The manner in which route proceedings are initiated and examined is explained. Recommendations are made concerning actions which can be taken to improve the services provided to the flying public.

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

    PubMed Central

    Zeng, Yuanyuan; Sreenan, Cormac J.; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin

    2011-01-01

    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. PMID:22163774

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

    PubMed Central

    Zeng, Yuanyuan; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin

    2010-01-01

    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. PMID:22219706

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

    NASA Technical Reports Server (NTRS)

    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.

  20. Contact Graph Routing Enhancements Developed in ION for DTN

    NASA Technical Reports Server (NTRS)

    Segui, John S.; Burleigh, Scott

    2013-01-01

    The Interplanetary Overlay Network (ION) software suite is an open-source, flight-ready implementation of networking protocols including the Delay/Disruption Tolerant Networking (DTN) Bundle Protocol (BP), the CCSDS (Consultative Committee for Space Data Systems) File Delivery Protocol (CFDP), and many others including the Contact Graph Routing (CGR) DTN routing system. While DTN offers the capability to tolerate disruption and long signal propagation delays in transmission, without an appropriate routing protocol, no data can be delivered. CGR was built for space exploration networks with scheduled communication opportunities (typically based on trajectories and orbits), represented as a contact graph. Since CGR uses knowledge of future connectivity, the contact graph can grow rather large, and so efficient processing is desired. These enhancements allow CGR to scale to predicted NASA space network complexities and beyond. This software improves upon CGR by adopting an earliest-arrival-time cost metric and using the Dijkstra path selection algorithm. Moving to Dijkstra path selection also enables construction of an earliest- arrival-time tree for multicast routing. The enhancements have been rolled into ION 3.0 available on sourceforge.net.

  1. Effective route maintenance and restoration schemes in mobile ad hoc networks.

    PubMed

    Kang, Byung-Seok; Ko, In-Young

    2010-01-01

    This study proposes a location-based hybrid routing protocol to improve data packet delivery and to reduce control message overhead in mobile ad hoc networks. In mobile environments, where nodes move continuously at a high speed, it is generally difficult to maintain and restore route paths. Therefore, this study suggests a new flooding mechanism to control route paths. The essence of the proposed scheme is its effective tracking of the destination's location based on the beacon messages of the main route nodes. Through experiments based on an NS-2 simulator, the proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as AODV, LAR, ZRP and AODV-DFR.

  2. Effective Route Maintenance and Restoration Schemes in Mobile Ad Hoc Networks

    PubMed Central

    Kang, Byung-Seok; Ko, In-Young

    2010-01-01

    This study proposes a location-based hybrid routing protocol to improve data packet delivery and to reduce control message overhead in mobile ad hoc networks. In mobile environments, where nodes move continuously at a high speed, it is generally difficult to maintain and restore route paths. Therefore, this study suggests a new flooding mechanism to control route paths. The essence of the proposed scheme is its effective tracking of the destination’s location based on the beacon messages of the main route nodes. Through experiments based on an NS-2 simulator, the proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as AODV, LAR, ZRP and AODV-DFR. PMID:22315570

  3. Moments Of Microdiversity EGC Receivers And Macrodiversity SC Receiver Output Signal Over Gamma Shadowed Nakagami-m Multipath Fading Channel

    NASA Astrophysics Data System (ADS)

    Djordjević, Nebojša; Jaksić, Branimir S.; Matović, Ana; Matović, Marija; Smilić, Marko

    2015-11-01

    A system with macrodiversity selection combining (SC) receiver and for microdiversity equal gain combining (EGC) receivers is considered. Received signal is subjected, simultaneously to multipath fading and shadowing, resulting in signal envelope and signal power variation. Closed form expressions for moments of macrodiversity SC receiver output signal envelope are calculated. Numerical expressions are plotted to present the influences of Gamma shadowing severity and Nakagami-m severity on moments of proposed system output signal.

  4. A geometry-free and ionosphere-free multipath mitigation method for BDS three-frequency ambiguity resolution

    NASA Astrophysics Data System (ADS)

    Chen, Dezhong; Ye, Shirong; Xia, Jingchao; Liu, Yanyan; Xia, Pengfei

    2016-08-01

    Because of the unknown systematic errors and special satellite constellations in the Beidou system (BDS), it is difficult to quickly and reliably determine the ambiguity over long-range baselines in continuously operating reference station (CORS) network. This study seeks to improve the effectiveness and reliability of BDS ambiguity resolution (AR) by combining the geometry-free and ionosphere-free (GFIF) combination and multipath mitigation algorithm. The GFIF combination composed with three-frequency signals is free of distance-dependent errors and can be used to determine the narrow lane ambiguity. The presence of multipath errors means that not all ambiguities can be correctly achieved by rounding the averaged GFIF ambiguity series. A multipath model of the single-differenced (SD) GFIF combination from the previous period is established for each individual satellite. This model is subtracted from the SD GFIF combination for the current day to remove the effects of multipath errors. Using three triangle networks with lengths of approximately 120, 80 and 50 km, we demonstrate that the proposed method improves the AR performance. The ambiguity averaged first fixing time is typically less than 1801 s for inclined geosynchronous orbit (IGSO) and medium earth orbit (MEO) satellites and less than 2007 s for the ˜ 42° elevation geostationary earth orbit (GEO) C02 satellite. However, it is more time consuming for the low-elevation GEO satellites C04 (˜ 18°) and C05 (˜ 28°). Kalman filtering is used to estimate the troposphere delays and two unfixed ambiguities by employing the ionosphere-free observations of all ambiguity-fixed/unfixed satellites. The experimental results show that only tens of seconds are required for AR in around 90 km baselines.

  5. The multipath propagation effect in gunshot acoustics and its impact on the design of sniper positioning systems

    NASA Astrophysics Data System (ADS)

    Ramos, António L. L.; Holm, Sverre; Gudvangen, Sigmund; Otterlei, Ragnvald

    2013-06-01

    Counter sniper systems rely on the detection and parameter estimation of the shockwave and the muzzle blast in order to determine the sniper location. In real-world situations, these acoustical signals can be disturbed by natural phenomena like weather and climate conditions, multipath propagation effect, and background noise. While some of these issues have received some attention in recent publications with application to gunshot acoustics, the multipath propagation phenomenon whose effect can not be neglected, specially in urban environments, has not yet been discussed in details in the technical literature in the same context. Propagating sound waves can be reflected at the boundaries in the vicinity of sound sources or receivers, whenever there is a difference in acoustical impedance between the reflective material and the air. Therefore, the received signal can be composed of a direct-path signal plus N scaled delayed copies of that signal. This paper presents a discussion on the multipath propagation effect and its impact on the performance and reliability of sniper positioning systems. In our formulation, propagation models for both the shockwave and the muzzle blast are considered and analyzed. Conclusions following the theoretical analysis of the problem are fully supported by actual gunshots acoustical signatures.

  6. Towards Internet QoS Provisioning Based on Generic Distributed QoS Adaptive Routing Engine

    PubMed Central

    Haikal, Amira Y.; Badawy, M.; Ali, Hesham A.

    2014-01-01

    Increasing efficiency and quality demands of modern Internet technologies drive today's network engineers to seek to provide quality of service (QoS). Internet QoS provisioning gives rise to several challenging issues. This paper introduces a generic distributed QoS adaptive routing engine (DQARE) architecture based on OSPFxQoS. The innovation of the proposed work in this paper is its undependability on the used QoS architectures and, moreover, splitting of the control strategy from data forwarding mechanisms, so we guarantee a set of absolute stable mechanisms on top of which Internet QoS can be built. DQARE architecture is furnished with three relevant traffic control schemes, namely, service differentiation, QoS routing, and traffic engineering. The main objective of this paper is to (i) provide a general configuration guideline for service differentiation, (ii) formalize the theoretical properties of different QoS routing algorithms and then introduce a QoS routing algorithm (QOPRA) based on dynamic programming technique, and (iii) propose QoS multipath forwarding (QMPF) model for paths diversity exploitation. NS2-based simulations proved the DQARE superiority in terms of delay, packet delivery ratio, throughput, and control overhead. Moreover, extensive simulations are used to compare the proposed QOPRA algorithm and QMPF model with their counterparts in the literature. PMID:25309955

  7. Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

    PubMed

    Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

    2015-01-01

    In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

  8. Trusted Routing Based on Dynamic Trust Mechanism in Mobile Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    Peng, Sancheng; Jia, Weijia; Wang, Guojun; Wu, Jie; Guo, Minyi

    Due to the distributed nature, mobile ad-hoc networks (MANETs) are vulnerable to various attacks, resulting in distrusted communications. To achieve trusted communications, it is important to build trusted routes in routing algorithms in a self-organizing and decentralized fashion. This paper proposes a trusted routing to locate and to preserve trusted routes in MANETs. Instead of using a hard security mechanism, we employ a new dynamic trust mechanism based on multiple constraints and collaborative filtering. The dynamic trust mechanism can effectively evaluate the trust and obtain the precise trust value among nodes, and can also be integrated into existing routing protocols for MANETs, such as ad hoc on-demand distance vector routing (AODV) and dynamic source routing (DSR). As an example, we present a trusted routing protocol, based on dynamic trust mechanism, by extending DSR, in which a node makes a routing decision based on the trust values on its neighboring nodes, and finally, establish a trusted route through the trust values of the nodes along the route in MANETs. The effectiveness of our approach is validated through extensive simulations.

  9. Collective network routing

    SciTech Connect

    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.

  10. Scalability-performance tradeoffs in MPLS and IP routing

    NASA Astrophysics Data System (ADS)

    Yilmaz, Selma; Matta, Ibrahim

    2002-07-01

    MPLS (Multi-Protocol Label Switching) has recently emerged to facilitate the engineering of network traffic. This can be achieved by directing packet flows over paths that satisfy multiple requirements. MPLS has been regarded as an enhancement to traditional IP routing, which has the following problems: (1) all packets with the same IP destination address have to follow the same path through the network; and (2) paths have often been computed based on static and single link metrics. These problems may cause traffic concentration, and thus degradation in quality of service. In this paper, we investigate by simulations a range of routing solutions and examine the tradeoff between scalability and performance. At one extreme, IP packet routing using dynamic link metrics provides a stateless solution but may lead to routing oscillations. At the other extreme, we consider a recently proposed Profile-based Routing (PBR), which uses knowledge of potential ingress-egress pairs as well as the traffic profile among them. Minimum Interference Routing (MIRA) is another recently proposed MPLS-based scheme, which only exploits knowledge of potential ingress-egress pairs but not their traffic profile. MIRA and the more conventional widest-shortest path (WSP) routing represent alternative MPLS-based approaches on the spectrum of routing solutions. We compare these solutions in terms of utility, bandwidth acceptance ratio as well as their scalability (routing state and computational overhead) and load balancing capability. While the simplest of the per-flow algorithms we consider, the performance of WSP is close to dynamic per-packet routing, without the potential instabilities of dynamic routing.

  11. An Adaptive Jitter Mechanism for Reactive Route Discovery in Sensor Networks

    PubMed Central

    Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas

    2014-01-01

    This paper analyses the impact of jitter when applied to route discovery in reactive (on-demand) routing protocols. In multi-hop non-synchronized wireless networks, jitter—a small, random variation in the timing of message emission—is commonly employed, as a means to avoid collisions of simultaneous transmissions by adjacent routers over the same channel. In a reactive routing protocol for sensor and ad hoc networks, jitter is recommended during the route discovery process, specifically, during the network-wide flooding of route request messages, in order to avoid collisions. Commonly, a simple uniform jitter is recommended. Alas, this is not without drawbacks: when applying uniform jitter to the route discovery process, an effect called delay inversion is observed. This paper, first, studies and quantifies this delay inversion effect. Second, this paper proposes an adaptive jitter mechanism, designed to alleviate the delay inversion effect and thereby to reduce the route discovery overhead and (ultimately) allow the routing protocol to find more optimal paths, as compared to uniform jitter. This paper presents both analytical and simulation studies, showing that the proposed adaptive jitter can effectively decrease the cost of route discovery and increase the path quality. PMID:25111238

  12. Congestion control and routing over satellite networks

    NASA Astrophysics Data System (ADS)

    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

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

    NASA Astrophysics Data System (ADS)

    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.

  14. Indoor positioning system using WLAN multipath signals as fingerprints for mobile devices

    NASA Astrophysics Data System (ADS)

    Saha, Anirban; Akopian, David

    2014-02-01

    The Global Positioning System (GPS) has eventually become a common positioning technology. While GPS enabled many applications, satellite signals have yet to overcome many obstacles to enable indoor positioning. Meanwhile, due to the wide deployment of Wireless Local Area Networks (WLAN) in recent years, WLAN positioning algorithms have become popular for mobile device positioning in indoor environments. The most accurate WLAN positioning algorithms exploit the so-called fingerprinting concept which consists of two stages. In the offline stage (training), the Received Signal Strength Indicator (RSSI) from a set of available Access Points (AP) is measured for a number of reference locations and stored in a database. Due to the availability of many APs and the complex structure of indoor environments, this information is distinctive for each reference location and thus is called a position fingerprint. In the online stage (testing), a mobile device receives RSSIs from the APs and their fingerprint is compared to the fingerprints that are stored in the database for a best possible match. WLAN fingerprinting can provide high accuracy in indoor environments when there are many APs which ensure fingerprint uniqueness. This paper provides a novel approach to use WLAN multipath signals as possible fingerprints for positioning algorithms for applications with lower number of access points. The paper provides an initial study.

  15. Testing the foundations of quantum mechanics with multi-path interferometers

    NASA Astrophysics Data System (ADS)

    Keil, Robert; Kauten, Thomas; Kaufmann, Thomas; Pressl, Benedikt; Heilmann, Rene; Szameit, Alexander; Weihs, Gregor

    2015-05-01

    Born's rule is one of the fundamental axioms of quantum mechanics and states that the probability density equates the squared magnitude of the wavefunction. Axioms in physics can't be theoretically proven, but only tested against experiments. Born's rule dictates the absence of higher order interference. Therefore, it can be tested by measuring the output signal of a multi-path interferometer with individually blockable paths. In this contribution, we present our latest results in this respect, improving previous experiments by two orders of magnitude in accuracy and precision. To this end, we implemented a five-path Mach-Zehnder interferometer in free space with improved power and phase stabilisation and increased photon flux. After compensating for the systematic effect of detector nonlinearities, we could bound the relative magnitude of higher order interferences to better than 10-4. In order to reduce this bound further, we have started working towards optically integrated interferometers, which promise reduced footprint and superior stability. Our first attempt in this direction is a semi-integrated solution. In this Michelson-configuration, external micromirrors are individually moved to modulate the effective transmission of each interferometer arm. We present our preliminary results obtained from this waveguide interferometer, discuss its current limitations and indicate ways to overcome them.

  16. Wideband signal detection using a Nyquist folding analog-to-information receiver in multipath fading environment

    NASA Astrophysics Data System (ADS)

    Odejide, Olusegun; Annamalai, Annamalai; Akujuobi, Cajetan

    2010-04-01

    The need to efficiently and effectively monitor the frequency spectrum for identification of unoccupied bands is essential in communication systems such as Cognitive Radio (CR), battlefield communications, etc. The Nyquist Folding Analog-to-Information Receiver (NYFR) which is based on the theory of Compressed Sensing has been proposed recently to address this problem in a sparse environment. Although, typical CS techniques, involve random projections followed by a computationally intensive signal reconstruction process, the methods used in NYFR does not requires the laborious l1 minimization algorithm. The NYFR performs analog compression via a non-uniform sampling process that induces a chirp-like modulation on each received signal. Signal parameters can simply be determined by using timefrequency analysis techniques without full signal reconstruction. This paper revisits the detection problem of using NYFR for information recovery for appropriate frequency detection when the original signal in the presence of both the additive white Gaussian noise and Rice multipath fading. An automatic detection algorithm was also developed to determine the detected frequency parameters without looking at the FFT spectrogram plot.

  17. Dual-pilot tone calibration technique. [to reduce multipath fading effects at mobile satellite link receiver

    NASA Technical Reports Server (NTRS)

    Simon, Marvin K.

    1986-01-01

    Pilot-based calibration techniques are used to reduce the effects of multipath fading in mobile satellite receivers. One of the more recent of these techniques, namely the tone calibration technique (TCT), suggests transmitting double sideband modulation with the pilot tone located at the center of its spectrum where the amplitude and phase characteristics of the channel are most stable. To 'make room' for the pilot in the presence of the Doppler shift, the equivalent low-pass data sidebands must be shaped so as to have zero response in the neighborhood of dc. Other techniques such as transparent tone-in-band (TTIB) similarly 'notch out' a hole in the center of the data spectrum for location of the pilot. An alternate possibility which is at the same time much more bandwidth efficient than TCT is a dual-pilot tone calibration technique (DPTCT) that symmetrically locates a pair of pilots outside the data spectrum near the band edges of the channel. The operation and performance of DPTCT are analyzed, and its effectiveness is compared to that of the single tone TCT technique.

  18. Multimodal function optimization using minimal representation size clustering and its application to planning multipaths.

    PubMed

    Hocaoğlu, C; Sanderson, A C

    1997-01-01

    A novel genetic algorithm (GA) using minimal representation size cluster (MRSC) analysis is designed and implemented for solving multimodal function optimization problems. The problem of multimodal function optimization is framed within a hypothesize-and-test paradigm using minimal representation size (minimal complexity) for species formation and a GA. A multiple-population GA is developed to identify different species. The number of populations, thus the number of different species, is determined by the minimal representation size criterion. Therefore, the proposed algorithm reveals the unknown structure of the multimodal function when a priori knowledge about the function is unknown. The effectiveness of the algorithm is demonstrated on a number of multimodal test functions. The proposed scheme results in a highly parallel algorithm for finding multiple local minima. In this paper, a path-planning algorithm is also developed based on the MRSC_GA algorithm. The algorithm utilizes MRSC_GA for planning paths for mobile robots, piano-mover problems, and N-link manipulators. The MRSC_GA is used for generating multipaths to provide alternative solutions to the path-planning problem. The generation of alternative solutions is especially important for planning paths in dynamic environments. A novel iterative multiresolution path representation is used as a basis for the GA coding. The effectiveness of the algorithm is demonstrated on a number of two-dimensional path-planning problems.

  19. Hydrologic Flood Routing.

    ERIC Educational Resources Information Center

    Heggen, Richard J.

    1982-01-01

    Discusses a short classroom-based BASIC program which routes stream flow through a system of channels and reservoirs. The program is suitable for analyses of open channel conveyance systems, flood detention reservoirs, and combinations of the two. (Author/JN)

  20. Submarine cable route survey

    SciTech Connect

    Herrouin, G.; Scuiller, T.

    1995-12-31

    The growth of telecommunication market is very significant. From the beginning of the nineties, more and more the use of optical fiber submarine cables is privileged to that of satellites. These submarine telecommunication highways require accurate surveys in order to select the optimum route and determine the cable characteristics. Advanced technology tools used for these surveys are presented along with their implementation.

  1. QoS routing via multiple paths using bandwidth reservation

    SciTech Connect

    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.

  2. QoS routing via multiple paths using bandwidth reservation

    SciTech Connect

    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.

  3. The extended TRIP supporting VoIP routing reservation with distributed QoS

    NASA Astrophysics Data System (ADS)

    Wang, Furong; Wu, Ye

    2004-04-01

    In this paper, an existing protocol, i.e. TRIP (Telephony Routing over IP) is developed to provide distributed QoS when making resource reservations for VoIP services such as H.323, SIP. Enhanced LSs (location servers) are deployed in ITADs (IP Telephony Administrative Domains) to take in charge of intra-domain routing policy because of small propagation price. It is an easy way to find an IP telephone route for intra-domain VoIP media association and simultaneously possess intra-domain load balancing features. For those routing reservations bridging domains, inter-domain routing policy is responsible for finding the shortest inter-domain route with enough resources. I propose the routing preference policy based on QoS price when the session traffic is shaped by a token bucket, related QoS messages, and message cooperation.

  4. IP- -: A Reduced Internet Protocol for Optical Packet Networking

    NASA Astrophysics Data System (ADS)

    Ohta, Masataka; Fujikawa, Kenji

    IP- - is proposed as an Internet Protocol suitable for optical packet networking. As optical routers require much faster control than electric ones and lack of optical buffers other than those by fiber delay lines requires fixed time control, Internet Protocols must be at least as simple as IPv4 and much simpler than IPv6. IP- - also addresses issues of IP address space exhaustion and IP routing table explosion.

  5. A Differential Evolution-Based Routing Algorithm for Environmental Monitoring Wireless Sensor Networks

    PubMed Central

    Li, Xiaofang; Xu, Lizhong; Wang, Huibin; Song, Jie; Yang, Simon X.

    2010-01-01

    The traditional Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol is a clustering-based protocol. The uneven selection of cluster heads results in premature death of cluster heads and premature blind nodes inside the clusters, thus reducing the overall lifetime of the network. With a full consideration of information on energy and distance distribution of neighboring nodes inside the clusters, this paper proposes a new routing algorithm based on differential evolution (DE) to improve the LEACH routing protocol. To meet the requirements of monitoring applications in outdoor environments such as the meteorological, hydrological and wetland ecological environments, the proposed algorithm uses the simple and fast search features of DE to optimize the multi-objective selection of cluster heads and prevent blind nodes for improved energy efficiency and system stability. Simulation results show that the proposed new LEACH routing algorithm has better performance, effectively extends the working lifetime of the system, and improves the quality of the wireless sensor networks. PMID:22219670

  6. Weather routing in long-distance Mediterranean routes

    NASA Astrophysics Data System (ADS)

    Delitala, A. M. S.; Gallino, S.; Villa, L.; Lagouvardos, K.; Drago, A.

    2010-10-01

    The selection of ship routes based on modern weather forecasting is a mean of computing optimum shipping routes thereby increasing safety and comfort at sea, cutting down on transit time, and reducing fuel consumption. Further empirical research in the effectiveness of modern weather routing applications is required especially in applications concerning shorter routes in enclosed seas of limited geographical extent such as the Mediterranean Sea. The present study used two climatological simulations to test this state-of-the-art approach to ship routing. Simulations represented two theoretical routes: (1) a route between Italy and Greece and (2) a route between Cyprus and Italy. Both routes were analyzed across varying simulated climatic conditions and the results were compared with those of control routes. Furthermore, results were analyzed in terms of passenger and crew comfort, bunker consumption by ships, and time of crossing. The first simulation showed that weather routing would improve ship performance on 37% of days while the second simulation revealed that weather routing would support ship captains virtually all the time.

  7. Masked Proportional Routing

    NASA Technical Reports Server (NTRS)

    Wolpert, David

    2004-01-01

    Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an

  8. A Passive Testing Approach for Protocols in Wireless Sensor Networks

    PubMed Central

    Che, Xiaoping; Maag, Stephane; Tan, Hwee-Xian; Tan, Hwee-Pink; Zhou, Zhangbing

    2015-01-01

    Smart systems are today increasingly developed with the number of wireless sensor devices drastically increasing. They are implemented within several contexts throughout our environment. Thus, sensed data transported in ubiquitous systems are important, and the way to carry them must be efficient and reliable. For that purpose, several routing protocols have been proposed for wireless sensor networks (WSN). However, one stage that is often neglected before their deployment is the conformance testing process, a crucial and challenging step. Compared to active testing techniques commonly used in wired networks, passive approaches are more suitable to the WSN environment. While some works propose to specify the protocol with state models or to analyze them with simulators and emulators, we here propose a logic-based approach for formally specifying some functional requirements of a novel WSN routing protocol. We provide an algorithm to evaluate these properties on collected protocol execution traces. Further, we demonstrate the efficiency and suitability of our approach by its application into common WSN functional properties, as well as specific ones designed from our own routing protocol. We provide relevant testing verdicts through a real indoor testbed and the implementation of our protocol. Furthermore, the flexibility, genericity and practicability of our approach have been proven by the experimental results. PMID:26610495

  9. A Passive Testing Approach for Protocols in Wireless Sensor Networks.

    PubMed

    Che, Xiaoping; Maag, Stephane; Tan, Hwee-Xian; Tan, Hwee-Pink; Zhou, Zhangbing

    2015-01-01

    Smart systems are today increasingly developed with the number of wireless sensor devices drastically increasing. They are implemented within several contexts throughout our environment. Thus, sensed data transported in ubiquitous systems are important, and the way to carry them must be efficient and reliable. For that purpose, several routing protocols have been proposed for wireless sensor networks (WSN). However, one stage that is often neglected before their deployment is the conformance testing process, a crucial and challenging step. Compared to active testing techniques commonly used in wired networks, passive approaches are more suitable to the WSN environment. While some works propose to specify the protocol with state models or to analyze them with simulators and emulators, we here propose a logic-based approach for formally specifying some functional requirements of a novel WSN routing protocol. We provide an algorithm to evaluate these properties on collected protocol execution traces. Further, we demonstrate the efficiency and suitability of our approach by its application into common WSN functional properties, as well as specific ones designed from our own routing protocol. We provide relevant testing verdicts through a real indoor testbed and the implementation of our protocol. Furthermore, the flexibility, genericity and practicability of our approach have been proven by the experimental results. PMID:26610495

  10. Alternative parallel ring protocols

    NASA Technical Reports Server (NTRS)

    Mukkamala, R.; Foudriat, E. C.; Maly, Kurt J.; Kale, V.

    1990-01-01

    Communication protocols are know to influence the utilization and performance of communication network. The effect of two token ring protocols on a gigabit network with multiple ring structure is investigated. In the first protocol, a mode sends at most one message on receiving a token. In the second protocol, a mode sends all the waiting messages when a token is received. The behavior of these protocols is shown to be highly dependent on the number of rings as well as the load in the network.

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

    NASA Astrophysics Data System (ADS)

    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.

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

    PubMed

    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. A study of infrasonic anisotropy and multipathing in the atmosphere using seismic networks.

    PubMed

    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.

  14. Central chemoreceptor modulation of breathing via multipath tuning in medullary ventrolateral respiratory column circuits.

    PubMed

    Ott, Mackenzie M; Nuding, Sarah C; Segers, Lauren S; O'Connor, Russell; Morris, Kendall F; Lindsey, Bruce G

    2012-01-01

    Ventrolateral respiratory column (VRC) circuits that modulate breathing in response to changes in central chemoreceptor drive are incompletely understood. We employed multielectrode arrays and spike train correlation methods to test predictions of the hypothesis that pre-Bötzinger complex (pre-BötC) and retrotrapezoid nucleus/parafacial (RTN-pF) circuits cooperate in chemoreceptor-evoked tuning of ventral respiratory group (VRG) inspiratory neurons. Central chemoreceptors were selectively stimulated by injections of CO(2)-saturated saline into the vertebral artery in seven decerebrate, vagotomized, neuromuscularly blocked, and artificially ventilated cats. Among sampled neurons in the Bötzinger complex (BötC)-to-VRG region, 70% (161 of 231) had a significant change in firing rate after chemoreceptor stimulation, as did 70% (101 of 144) of the RTN-pF neurons. Other responsive neurons (24 BötC-VRG; 11 RTN-pF) had a change in the depth of respiratory modulation without a significant change in average firing rate. Seventy BötC-VRG chemoresponsive neurons triggered 189 offset-feature correlograms (96 peaks; 93 troughs) with at least one responsive BötC-VRG cell. Functional input from at least one RTN-pF cell could be inferred for 45 BötC-VRG neurons (19%). Eleven RTN-pF cells were correlated with more than one BötC-VRG target neuron, providing evidence for divergent connectivity. Thirty-seven RTN-pF neurons, 24 of which were chemoresponsive, were correlated with at least one chemoresponsive BötC-VRG neuron. Correlation linkage maps and spike-triggered averages of phrenic nerve signals suggest transmission of chemoreceptor drive via a multipath network architecture: RTN-pF modulation of pre-BötC-VRG rostral-to-caudal excitatory inspiratory neuron chains is tuned by feedforward and recurrent inhibition from other inspiratory neurons and from "tonic" expiratory neurons.

  15. Security in MANETs using reputation-adjusted routing

    NASA Astrophysics Data System (ADS)

    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.

  16. Analysis of F-Canyon Effluents During the Dissolution Cycle with a Fourier Transform Infrared Spectrometer/Multipath Cell

    SciTech Connect

    Villa, E.

    1999-07-28

    Air samples from F-Canyon effluents were collected at the F-Canyon stack and transported to a laboratory at the Savannah River Technology Center (SRTC) for analysis using a Fourier transform infrared spectrometer in conjunction with a multipath cell. Air samples were collected during the decladding and acid cuts of the dissolution of the irradiated aluminum-cladded slugs. The FTIR analyses of the air samples show the presence of NO2, NO, HNO2, N2O, SF6, and 85Kr during the dissolution cycle. The concentration time profiles of these effluents corresponded with expected release rates from the F-Canyon operations.

  17. Robustness of airline route networks

    NASA Astrophysics Data System (ADS)

    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.

  18. Performance enhancement of OSPF protocol in the private network

    NASA Astrophysics Data System (ADS)

    Yang, Yang; Lu, Yang; Lin, Xiaokang

    2005-11-01

    The private network serves as an information exchange platform to support the integrated services via microwave channels and accordingly selects the open shortest path first (OSPF) as the IP routing protocol. But the existing OSPF can't fit the private network very well for its special characteristics. This paper presents our modifications to the standard protocol in such aspects as the single-area scheme, link state advertisement (LSA) types and formats, OSPF packet formats, important state machines, setting of protocol parameters and link flap damping. Finally simulations are performed in various scenarios and the results indicate that our modifications can enhance the OSPF performance in the private network effectively.

  19. An adaptive OFDMA-based MAC protocol for underwater acoustic wireless sensor networks.

    PubMed

    Khalil, Issa M; Gadallah, Yasser; Hayajneh, Mohammad; Khreishah, Abdallah

    2012-01-01

    Underwater acoustic wireless sensor networks (UAWSNs) have many applications across various civilian and military domains. However, they suffer from the limited available bandwidth of acoustic signals and harsh underwater conditions. In this work, we present an Orthogonal Frequency Division Multiple Access (OFDMA)-based Media Access Control (MAC) protocol that is configurable to suit the operating requirements of the underwater sensor network. The protocol has three modes of operation, namely random, equal opportunity and energy-conscious modes of operation. Our MAC design approach exploits the multi-path characteristics of a fading acoustic channel to convert it into parallel independent acoustic sub-channels that undergo flat fading. Communication between node pairs within the network is done using subsets of these sub-channels, depending on the configurations of the active mode of operation. Thus, the available limited bandwidth gets fully utilized while completely avoiding interference. We derive the mathematical model for optimal power loading and subcarrier selection, which is used as basis for all modes of operation of the protocol. We also conduct many simulation experiments to evaluate and compare our protocol with other Code Division Multiple Access (CDMA)-based MAC protocols.

  20. An Adaptive OFDMA-Based MAC Protocol for Underwater Acoustic Wireless Sensor Networks

    PubMed Central

    Khalil, Issa M.; Gadallah, Yasser; Hayajneh, Mohammad; Khreishah, Abdallah

    2012-01-01

    Underwater acoustic wireless sensor networks (UAWSNs) have many applications across various civilian and military domains. However, they suffer from the limited available bandwidth of acoustic signals and harsh underwater conditions. In this work, we present an Orthogonal Frequency Division Multiple Access (OFDMA)-based Media Access Control (MAC) protocol that is configurable to suit the operating requirements of the underwater sensor network. The protocol has three modes of operation, namely random, equal opportunity and energy-conscious modes of operation. Our MAC design approach exploits the multi-path characteristics of a fading acoustic channel to convert it into parallel independent acoustic sub-channels that undergo flat fading. Communication between node pairs within the network is done using subsets of these sub-channels, depending on the configurations of the active mode of operation. Thus, the available limited bandwidth gets fully utilized while completely avoiding interference. We derive the mathematical model for optimal power loading and subcarrier selection, which is used as basis for all modes of operation of the protocol. We also conduct many simulation experiments to evaluate and compare our protocol with other Code Division Multiple Access (CDMA)-based MAC protocols. PMID:23012517

  1. AIB-OR: improving onion routing circuit construction using anonymous identity-based cryptosystems.

    PubMed

    Wang, Changji; Shi, Dongyuan; Xu, Xilei

    2015-01-01

    The rapid growth of Internet applications has made communication anonymity an increasingly important or even indispensable security requirement. Onion routing has been employed as an infrastructure for anonymous communication over a public network, which provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. However, existing onion routing protocols usually exhibit poor performance due to repeated encryption operations. In this paper, we first present an improved anonymous multi-receiver identity-based encryption (AMRIBE) scheme, and an improved identity-based one-way anonymous key agreement (IBOWAKE) protocol. We then propose an efficient onion routing protocol named AIB-OR that provides provable security and strong anonymity. Our main approach is to use our improved AMRIBE scheme and improved IBOWAKE protocol in onion routing circuit construction. Compared with other onion routing protocols, AIB-OR provides high efficiency, scalability, strong anonymity and fault tolerance. Performance measurements from a prototype implementation show that our proposed AIB-OR can achieve high bandwidths and low latencies when deployed over the Internet. PMID:25815879

  2. AIB-OR: Improving Onion Routing Circuit Construction Using Anonymous Identity-Based Cryptosystems

    PubMed Central

    Wang, Changji; Shi, Dongyuan; Xu, Xilei

    2015-01-01

    The rapid growth of Internet applications has made communication anonymity an increasingly important or even indispensable security requirement. Onion routing has been employed as an infrastructure for anonymous communication over a public network, which provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. However, existing onion routing protocols usually exhibit poor performance due to repeated encryption operations. In this paper, we first present an improved anonymous multi-receiver identity-based encryption (AMRIBE) scheme, and an improved identity-based one-way anonymous key agreement (IBOWAKE) protocol. We then propose an efficient onion routing protocol named AIB-OR that provides provable security and strong anonymity. Our main approach is to use our improved AMRIBE scheme and improved IBOWAKE protocol in onion routing circuit construction. Compared with other onion routing protocols, AIB-OR provides high efficiency, scalability, strong anonymity and fault tolerance. Performance measurements from a prototype implementation show that our proposed AIB-OR can achieve high bandwidths and low latencies when deployed over the Internet. PMID:25815879

  3. Comparative study of signaling and routing schemes in ASTN

    NASA Astrophysics Data System (ADS)

    Zhang, Hui; Ma, Yuanyuan; Mao, Dongfeng; Zhang, Jie; Gu, Wanyi

    2005-02-01

    We have developed a GMPLS-based software platform with Intelligence Optical Network (ION) capabilities to simulate different technologies and protocols of ASTN. For optical transport network (OTN) based ASTN, usually named as automatically switched optical network (ASON), two signalling schemes, Explicit Label Control (ELC) and Backward Wavelength Reservation with N retries (BWR-N), are considered. The ELC is associated with two routing and wavelength assignment (RWA) policies, the shortest path first routing (Dijkstra algorithm) with first-fit (FF) wavelength assignment and the fixed path least congestion (FPLC) routing with FF wavelength assignment. For the BWR-N, the route is determined by Dijkstra's algorithm and the wavelength is selected through signalling process. For SDH/SONET-based ASTN, we also consider two signalling scheme, the ELC and the Forward Timeslot Reservation (FTR). Similar simulations have been performed. These signalling and routing schemes are evaluated by several crucial metrics, such as the blocking probability, the setup time, the average routing length of the connections and the control overhead. Some significant conclusions have been presented by this paper.

  4. Routing in Ad Hoc Network Using Ant Colony Optimization

    NASA Astrophysics Data System (ADS)

    Khanpara, Pimal; Valiveti, Sharada; Kotecha, K.

    The ad hoc networks have dynamic topology and are infrastructure less. So it is required to implement a new network protocol for providing efficient end to end communication based on TCP/IP structure. There is a need to re-define or modify the functions of each layer of TCP/IP model to provide end to end communication between nodes. The mobility of the nodes and the limited resources are the main reason for this change. The main challenge in ad hoc networks is routing. Due to the mobility of the nodes in the ad hoc networks, routing becomes very difficult. Ant based algorithms are suitable for routing in ad hoc networks due to its dynamic nature and adaptive behavior. There are number of routing algorithms based on the concept of ant colony optimizations. It is quite difficult to determine the best ant based algorithm for routing as these algorithms perform differently under various circumstances such as the traffic distribution and network topology. In this paper, the overview of such routing algorithms is given.

  5. Auto-configuration protocols in mobile ad hoc networks.

    PubMed

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    The TCP/IP protocol allows the different nodes in a network to communicate by associating a different IP address to each node. In wired or wireless networks with infrastructure, we have a server or node acting as such which correctly assigns IP addresses, but in mobile ad hoc networks there is no such centralized entity capable of carrying out this function. Therefore, a protocol is needed to perform the network configuration automatically and in a dynamic way, which will use all nodes in the network (or part thereof) as if they were servers that manage IP addresses. This article reviews the major proposed auto-configuration protocols for mobile ad hoc networks, with particular emphasis on one of the most recent: D2HCP. This work also includes a comparison of auto-configuration protocols for mobile ad hoc networks by specifying the most relevant metrics, such as a guarantee of uniqueness, overhead, latency, dependency on the routing protocol and uniformity.

  6. Analysis of BeiDou Satellite Measurements with Code Multipath and Geometry-Free Ionosphere-Free Combinations.

    PubMed

    Zhao, Qile; Wang, Guangxing; Liu, Zhizhao; Hu, Zhigang; Dai, Zhiqiang; Liu, Jingnan

    2016-01-01

    Using GNSS observable from some stations in the Asia-Pacific area, the carrier-to-noise ratio (CNR) and multipath combinations of BeiDou Navigation Satellite System (BDS), as well as their variations with time and/or elevation were investigated and compared with those of GPS and Galileo. Provided the same elevation, the CNR of B1 observables is the lowest among the three BDS frequencies, while B3 is the highest. The code multipath combinations of BDS inclined geosynchronous orbit (IGSO) and medium Earth orbit (MEO) satellites are remarkably correlated with elevation, and the systematic "V" shape trends could be eliminated through between-station-differencing or modeling correction. Daily periodicity was found in the geometry-free ionosphere-free (GFIF) combinations of both BDS geostationary Earth orbit (GEO) and IGSO satellites. The variation range of carrier phase GFIF combinations of GEO satellites is -2.0 to 2.0 cm. The periodicity of carrier phase GFIF combination could be significantly mitigated through between-station differencing. Carrier phase GFIF combinations of BDS GEO and IGSO satellites might also contain delays related to satellites. Cross-correlation suggests that the GFIF combinations' time series of some GEO satellites might vary according to their relative geometries with the sun. PMID:26805831

  7. Analysis of BeiDou Satellite Measurements with Code Multipath and Geometry-Free Ionosphere-Free Combinations.

    PubMed

    Zhao, Qile; Wang, Guangxing; Liu, Zhizhao; Hu, Zhigang; Dai, Zhiqiang; Liu, Jingnan

    2016-01-20

    Using GNSS observable from some stations in the Asia-Pacific area, the carrier-to-noise ratio (CNR) and multipath combinations of BeiDou Navigation Satellite System (BDS), as well as their variations with time and/or elevation were investigated and compared with those of GPS and Galileo. Provided the same elevation, the CNR of B1 observables is the lowest among the three BDS frequencies, while B3 is the highest. The code multipath combinations of BDS inclined geosynchronous orbit (IGSO) and medium Earth orbit (MEO) satellites are remarkably correlated with elevation, and the systematic "V" shape trends could be eliminated through between-station-differencing or modeling correction. Daily periodicity was found in the geometry-free ionosphere-free (GFIF) combinations of both BDS geostationary Earth orbit (GEO) and IGSO satellites. The variation range of carrier phase GFIF combinations of GEO satellites is -2.0 to 2.0 cm. The periodicity of carrier phase GFIF combination could be significantly mitigated through between-station differencing. Carrier phase GFIF combinations of BDS GEO and IGSO satellites might also contain delays related to satellites. Cross-correlation suggests that the GFIF combinations' time series of some GEO satellites might vary according to their relative geometries with the sun.

  8. Middleware Solutions for Self-organizing Multi-hop Multi-path Internet Connectivity Based on Bluetooth

    NASA Astrophysics Data System (ADS)

    Bellavista, Paolo; Giannelli, Carlo

    The availability of heterogeneous wireless interfaces and of growing computing resources on widespread portable devices pushes for enabling innovative deployment scenarios where mobile nodes dynamically self-organize to offer Internet connectivity to their peers via dynamically established multi-hop multi-path opportunities. We claim the suitability of novel, mobility-aware, and application-layer middleware based on lightweight evaluation indicators to support the complexity of that scenario, involving heterogeneous wireless technologies over differentiated and statically unpredictable execution environments. To validate these claims, we have implemented an innovative middleware that manages the durability/throughput-aware formation and selection of different multi-hop paths simultaneously. This paper specifically focuses on how our middleware effectively exploits Bluetooth for multi-hop multi-path networking, by pointing out the crucial role of i) compliance with standard solutions to favor rapid deployment over off-the-shelf equipment and ii) the reduction of the usual overhead associated with some expensive Bluetooth operations, e.g., device inquiry. In particular, the paper shows how it is possible, on the one hand, to extend JSR-82 to portably access monitoring indicators for lightweight mobility/throughput estimations and, on the other hand, to reduce the time needed to update the set of available Bluetooth-based connectivity opportunities via approximated and lightweight forms of discovery.

  9. Analysis of BeiDou Satellite Measurements with Code Multipath and Geometry-Free Ionosphere-Free Combinations

    PubMed Central

    Zhao, Qile; Wang, Guangxing; Liu, Zhizhao; Hu, Zhigang; Dai, Zhiqiang; Liu, Jingnan

    2016-01-01

    Using GNSS observable from some stations in the Asia-Pacific area, the carrier-to-noise ratio (CNR) and multipath combinations of BeiDou Navigation Satellite System (BDS), as well as their variations with time and/or elevation were investigated and compared with those of GPS and Galileo. Provided the same elevation, the CNR of B1 observables is the lowest among the three BDS frequencies, while B3 is the highest. The code multipath combinations of BDS inclined geosynchronous orbit (IGSO) and medium Earth orbit (MEO) satellites are remarkably correlated with elevation, and the systematic “V” shape trends could be eliminated through between-station-differencing or modeling correction. Daily periodicity was found in the geometry-free ionosphere-free (GFIF) combinations of both BDS geostationary Earth orbit (GEO) and IGSO satellites. The variation range of carrier phase GFIF combinations of GEO satellites is −2.0 to 2.0 cm. The periodicity of carrier phase GFIF combination could be significantly mitigated through between-station differencing. Carrier phase GFIF combinations of BDS GEO and IGSO satellites might also contain delays related to satellites. Cross-correlation suggests that the GFIF combinations’ time series of some GEO satellites might vary according to their relative geometries with the sun. PMID:26805831

  10. Passive ranging errors due to multipath distortion of deterministic transient signals with application to the localization of small arms fire

    NASA Astrophysics Data System (ADS)

    Ferguson, Brian G.; Lo, Kam W.

    2002-01-01

    A passive ranging technique based on wavefront curvature is used to estimate the ranges and bearings of impulsive sound sources represented by small arms fire. The discharge of a firearm results in the generation of a transient acoustic signal whose energy propagates radially outwards from the omnidirectional source. The radius of curvature of the spherical wavefront at any instant is equal to the instantaneous range from the source. The curvature of the acoustic wavefront is sensed with a three-microphone linear array by first estimating the differential time of arrival (or time delay) of the acoustic wavefront at each of the two adjacent sensor pairs and then processing the time-delay information to extract the range and bearing of the source. However, modeling the passive ranging performance of the wavefront curvature method for a deterministic transient signal source in a multipath environment shows that when the multipath and direct path arrivals are unresolvable, the time-delay estimates are biased which, in turn, biases the range estimates. The model explains the observed under-ranging of small arms firing positions during a field experiment.

  11. Passive ranging errors due to multipath distortion of deterministic transient signals with application to the localization of small arms fire.

    PubMed

    Ferguson, Brian G; Lo, Kam W

    2002-01-01

    A passive ranging technique based on wavefront curvature is used to estimate the ranges and bearings of impulsive sound sources represented by small arms fire. The discharge of a firearm results in the generation of a transient acoustic signal whose energy propagates radially outwards from the omnidirectional source. The radius of curvature of the spherical wavefront at any instant is equal to the instantaneous range from the source. The curvature of the acoustic wavefront is sensed with a three-microphone linear array by first estimating the differential time of arrival (or time delay) of the acoustic wavefront at each of the two adjacent sensor pairs and then processing the time-delay information to extract the range and bearing of the source. However, modeling the passive ranging performance of the wavefront curvature method for a deterministic transient signal source in a multipath environment shows that when the multipath and direct path arrivals are unresolvable, the time-delay estimates are biased which, in turn, biases the range estimates. The model explains the observed under-ranging of small arms firing positions during a field experiment. PMID:11831787

  12. Intelligent route surveillance

    NASA Astrophysics Data System (ADS)

    Schoemaker, Robin; Sandbrink, Rody; van Voorthuijsen, Graeme

    2009-05-01

    Intelligence on abnormal and suspicious behaviour along roads in operational domains is extremely valuable for countering the IED (Improvised Explosive Device) threat. Local sensor networks at strategic spots can gather data for continuous monitoring of daily vehicle activity. Unattended intelligent ground sensor networks use simple sensing nodes, e.g. seismic, magnetic, radar, or acoustic, or combinations of these in one housing. The nodes deliver rudimentary data at any time to be processed with software that filters out the required information. At TNO (Netherlands Organisation for Applied Scientific Research) research has started on how to equip a sensor network with data analysis software to determine whether behaviour is suspicious or not. Furthermore, the nodes should be expendable, if necessary, and be small in size such that they are hard to detect by adversaries. The network should be self-configuring and self-sustaining and should be reliable, efficient, and effective during operational tasks - especially route surveillance - as well as robust in time and space. If data from these networks are combined with data from other remote sensing devices (e.g. UAVs (Unmanned Aerial Vehicles)/aerostats), an even more accurate assessment of the tactical situation is possible. This paper shall focus on the concepts of operation towards a working intelligent route surveillance (IRS) research demonstrator network for monitoring suspicious behaviour in IED sensitive domains.

  13. The RTS2 protocol

    NASA Astrophysics Data System (ADS)

    Kubánek, Petr; Jelínek, Martin; French, John; Prouza, Michal; Vítek, Stanislav; Castro-Tirado, Alberto J.; Reglero, Victor

    2008-07-01

    Remote Telescope System 2nd version (RTS2) is an open source project aimed at developing a software environment to control a fully robotic observatory. RTS2 consists of various components, which communicate via an ASCII based protocol. As the protocol was from the beginning designed as an observatory control system, it provides some unique features, which are hard to find in the other communication systems. These features include advanced synchronisation mechanisms and strategies for setting variables. This presentation describes the protocol and its unique features. It also assesses protocol performance, and provides examples how the RTS2 library can be used to quickly build an observatory control system.

  14. Self-healing routing: a study in efficiency and resiliency of data delivery in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Wasilewski, Kamil; Branch, Joel W.; Lisee, Mark; Szymanski, Boleslaw K.

    2007-04-01

    This paper presents the results of implementation of a novel protocol, Self-Healing Routing (SHR) for opportunistic multi-hop wireless communication, on MicaZ sensor motes. The protocol uses broadcast communication and a prioritized transmission back-off delay scheme to empower a receiving mote to use its hop distance from the destination to decide autonomously whether to forward a packet. When severed routes are encountered, the protocol dynamically and locally re-routes packets so they traverse the surviving shortest route. We have implemented this protocol on a set of MicaZ motes as well as in the SENSE sensor network simulator and conducted field testing with different mote and network configurations. We also tested scenarios with the motes turned off (modeling permanent failures) and in simulation also temporarily off line (modeling transient failures). We compared SHR with two traditional protocols: MintRoute and AODV. The results, as shown by experimental measurement and simulations reported in the paper, demonstrate that Self-Healing Routing is an efficient fault-tolerant protocol that performs well even with spontaneous network topology changes.

  15. Source localization of narrow band signals in multipath environments, with application to marine mammals

    NASA Astrophysics Data System (ADS)

    Valtierra, Robert Daniel

    Passive acoustic localization has benefited from many major developments and has become an increasingly important focus point in marine mammal research. Several challenges still remain. This work seeks to address several of these challenges such as tracking the calling depths of baleen whales. In this work, data from an array of widely spaced Marine Acoustic Recording Units (MARUs) was used to achieve three dimensional localization by combining the methods Time Difference of Arrival (TDOA) and Direct-Reflected Time Difference of Arrival (DRTD) along with a newly developed autocorrelation technique. TDOA was applied to data for two dimensional (latitude and longitude) localization and depth was resolved using DRTD. Previously, DRTD had been limited to pulsed broadband signals, such as sperm whale or dolphin echolocation, where individual direct and reflected signals are separated in time. Due to the length of typical baleen whale vocalizations, individual multipath signal arrivals can overlap making time differences of arrival difficult to resolve. This problem can be solved using an autocorrelation, which can extract reflection information from overlapping signals. To establish this technique, a derivation was made to model the autocorrelation of a direct signal and its overlapping reflection. The model was exploited to derive performance limits allowing for prediction of the minimum resolvable direct-reflected time difference for a known signal type. The dependence on signal parameters (sweep rate, call duration) was also investigated. The model was then verified using both recorded and simulated data from two analysis cases for North Atlantic right whales (NARWs, Eubalaena glacialis) and humpback whales (Megaptera noveaengliae). The newly developed autocorrelation technique was then combined with DRTD and tested using data from playback transmissions to localize an acoustic transducer at a known depth and location. The combined DRTD-autocorrelation methods

  16. Asymmetric effect of route-length difference and bottleneck on route choice in two-route traffic system

    NASA Astrophysics Data System (ADS)

    Hino, Yuki; Nagatani, Takashi

    2015-06-01

    We study the traffic behavior in the asymmetric two-route traffic system with real-time information. In the asymmetric two-route system, the length on route A is different from that on route B and there exists a bottleneck on route A. We extend the symmetric two-route dynamic model to the asymmetric case. We investigate the asymmetric effects of the route-length difference and bottleneck on the route choice with real-time information. The travel time on each route depends on the road length, bottleneck, and vehicular density. We derive the dependence of the travel time and mean density on the route-length ratio. We show where, when, and how the congestion occurs by the route choice in the asymmetric two-route system. We clarify the effect of the route-length ratio on the traffic behavior in the route choice.

  17. Reliable freestanding position-based routing in highway scenarios.

    PubMed

    Galaviz-Mosqueda, Gabriel A; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur

    2012-01-01

    Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model. PMID:23202159

  18. Protocol for a Delay-Tolerant Data-Communication Network

    NASA Technical Reports Server (NTRS)

    Torgerson, Jordan; Hooke, Adrian; Burleigh, Scott; Fall, Kevin

    2004-01-01

    As its name partly indicates, the Delay-Tolerant Networking (DTN) Bundle Protocol is a protocol for delay-tolerant transmission of data via communication networks. This protocol was conceived as a result of studies of how to adapt Internet protocols so that Internet-like services could be provided across interplanetary distances in support of deep-space exploration. The protocol, and software to implement the protocol, is being developed in collaboration among experts at NASA's Jet Propulsion Laboratory and other institutions. No current Internet protocols can accommodate long transmission delay times or intermittent link connectivity. The DTN Bundle Protocol represents a departure from the standard Internet assumption that a continuous path is available from a host computer to a client computer: It provides for routing of data through networks that may be disjointed and may be characterized by long transmission delays. In addition to networks that include deepspace communication links, examples of such networks include terrestrial ones within which branches are temporarily disconnected. The protocol is based partly on the definition of a message-based overlay above the transport layers of the networks on which it is hosted.

  19. Southern states` routing agency report

    SciTech Connect

    Not Available

    1989-02-01

    The Southern states` routing agency report is a compendium of 16-southern states` routing programs relative to the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source ad scope of the agencies` rulemaking authority. Additionally, the state agency and contact designated by the state`s governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed.

  20. Southern States` Routing Agency Report

    SciTech Connect

    Not Available

    1990-03-01

    The Southern States` Routing Agency Report is a compendium of 16-southern states` routing program for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies` rulemaking authority. Additionally, the state agency and contact designated by the state`s governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed.

  1. Southern states' routing agency report

    SciTech Connect

    Not Available

    1989-02-01

    The Southern states' routing agency report is a compendium of 16-southern states' routing programs relative to the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source ad scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed.

  2. Southern States' Routing Agency Report

    SciTech Connect

    Not Available

    1990-03-01

    The Southern States' Routing Agency Report is a compendium of 16-southern states' routing program for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed.

  3. National Sample Assessment Protocols

    ERIC Educational Resources Information Center

    Ministerial Council on Education, Employment, Training and Youth Affairs (NJ1), 2012

    2012-01-01

    These protocols represent a working guide for planning and implementing national sample assessments in connection with the national Key Performance Measures (KPMs). The protocols are intended for agencies involved in planning or conducting national sample assessments and personnel responsible for administering associated tenders or contracts,…

  4. VHDL Control Routing Simulator

    1995-07-10

    The control router simulates a backplane consisting of up to 16 slot. Slot 0, reserved for a control module (cr-ctrl), generates the system clocks and provides the serial interface to the Gating Logic. The remaining 15 slots (1-15) contain routing modules (cr mod), each having up to 64 serial inputs and outputs with FIFOs. Messages to be transmitted to the Control Router are taken from text files. There are currently 17 such source files. Inmore » the model, the serial output of each source is connected to multiple receivers, so that there are 8 identical messages transmitted to the router for each message file entry.« less

  5. Montreal protocol: Business opportunites

    SciTech Connect

    1998-12-31

    The Montreal Protocol on Substances that Deplete the Ozone Layer was signed by 24 countries in 1987, establishing measures for controlling the production and consumption of ozone-depleting substances. This publication begins with some background information on ozone depletion and the history of the Protocol. It then describes aspects of the Protocol`s Multilateral Fund, created to assist developing countries to meet Protocol deadlines: Its administration, structure, and how projects are initiated. Names, addresses, and phone/fax numbers of Fund contacts are provided. Canadian projects under the Fund are then reviewed and opportunities for Canadian environmental companies are noted. Finally, information sheets are presented which summarize Fund-related Canadian bilateral projects undertaken to date.

  6. Reliable broadcast protocols

    NASA Technical Reports Server (NTRS)

    Joseph, T. A.; Birman, Kenneth P.

    1989-01-01

    A number of broadcast protocols that are reliable subject to a variety of ordering and delivery guarantees are considered. Developing applications that are distributed over a number of sites and/or must tolerate the failures of some of them becomes a considerably simpler task when such protocols are available for communication. Without such protocols the kinds of distributed applications that can reasonably be built will have a very limited scope. As the trend towards distribution and decentralization continues, it will not be surprising if reliable broadcast protocols have the same role in distributed operating systems of the future that message passing mechanisms have in the operating systems of today. On the other hand, the problems of engineering such a system remain large. For example, deciding which protocol is the most appropriate to use in a certain situation or how to balance the latency-communication-storage costs is not an easy question.

  7. Energy Consumption and Control Response Evaluations of AODV Routing in WSANs for Building-Temperature Control

    PubMed Central

    Booranawong, Apidet; Teerapabkajorndet, Wiklom; Limsakul, Chusak

    2013-01-01

    The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved. PMID:23807689

  8. Energy consumption and control response evaluations of AODV routing in WSANs for building-temperature control.

    PubMed

    Booranawong, Apidet; Teerapabkajorndet, Wiklom; Limsakul, Chusak

    2013-06-27

    The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved.

  9. Social-Stratification Probabilistic Routing Algorithm in Delay-Tolerant Network

    NASA Astrophysics Data System (ADS)

    Alnajjar, Fuad; Saadawi, Tarek

    Routing in mobile ad hoc networks (MANET) is complicated due to the fact that the network graph is episodically connected. In MANET, topology is changing rapidly because of weather, terrain and jamming. A key challenge is to create a mechanism that can provide good delivery performance and low end-to-end delay in an intermittent network graph where nodes may move freely. Delay-Tolerant Networking (DTN) architecture is designed to provide communication in intermittently connected networks, by moving messages towards destination via ”store, carry and forward” technique that supports multi-routing algorithms to acquire best path towards destination. In this paper, we propose the use of probabilistic routing in DTN architecture using the concept of social-stratification network. We use the Opportunistic Network Environment (ONE) simulator as a simulation tool to compare the proposed Social- stratification Probabilistic Routing Algorithm (SPRA) with the common DTN-based protocols. Our results show that SPRA outperforms the other protocols.

  10. Self-adaptive trust based ABR protocol for MANETs using Q-learning.

    PubMed

    Kumar, Anitha Vijaya; Jeyapal, Akilandeswari

    2014-01-01

    Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation. PMID:25254243

  11. Self-Adaptive Trust Based ABR Protocol for MANETs Using Q-Learning

    PubMed Central

    Jeyapal, Akilandeswari

    2014-01-01

    Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation. PMID:25254243

  12. Self-adaptive trust based ABR protocol for MANETs using Q-learning.

    PubMed

    Kumar, Anitha Vijaya; Jeyapal, Akilandeswari

    2014-01-01

    Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation.

  13. Modelling Routes towards Learning Goals

    ERIC Educational Resources Information Center

    Tattersall, Colin; Janssen, Jose; van den Berg, Bert; Koper, Rob

    2006-01-01

    Purpose: This paper aims to define the need for a route modelling language in e-learning, identifying requirements and candidate languages, before providing a recommended approach. Design/methodology/approach: Several sources of requirements are drawn from the literature then used to review available approaches to route modelling. The best…

  14. Producing Gestures Facilitates Route Learning

    PubMed Central

    So, Wing Chee; Ching, Terence Han-Wei; Lim, Phoebe Elizabeth; Cheng, Xiaoqin; Ip, Kit Yee

    2014-01-01

    The present study investigates whether producing gestures would facilitate route learning in a navigation task and whether its facilitation effect is comparable to that of hand movements that leave physical visible traces. In two experiments, we focused on gestures produced without accompanying speech, i.e., co-thought gestures (e.g., an index finger traces the spatial sequence of a route in the air). Adult participants were asked to study routes shown in four diagrams, one at a time. Participants reproduced the routes (verbally in Experiment 1 and non-verbally in Experiment 2) without rehearsal or after rehearsal by mentally simulating the route, by drawing it, or by gesturing (either in the air or on paper). Participants who moved their hands (either in the form of gestures or drawing) recalled better than those who mentally simulated the routes and those who did not rehearse, suggesting that hand movements produced during rehearsal facilitate route learning. Interestingly, participants who gestured the routes in the air or on paper recalled better than those who drew them on paper in both experiments, suggesting that the facilitation effect of co-thought gesture holds for both verbal and nonverbal recall modalities. It is possibly because, co-thought gesture, as a kind of representational action, consolidates spatial sequence better than drawing and thus exerting more powerful influence on spatial representation. PMID:25426624

  15. Dynamic Message Routing Using Processes

    NASA Astrophysics Data System (ADS)

    Scheibler, Thorsten; Karastoyanova, Dimka; Leymann, Frank

    The Enterprise Service Bus (ESB) is composable middleware that provides applications with services such as message routing and transformation, service composition, dynamic discovery, transactional support, coordination, security features, and others. In an ESB supporting SOAP message exchange, routing algorithms typically follow the sequential SOAP message processing model, where SOAP headers are the main artefacts used to specify the message route and the processing of the payload by intermediaries along that route. This model supports neither alternative nor parallel message routes. In the case of a failing intermediary node this leads to a failure in the message delivery. Moreover, the execution order of services on SOAP message payloads at the intermediaries cannot be prescribed. In this paper, we demonstrate how these deficiencies of the SOAP message processing model can be addressed. We introduce an approach that allows for specifying SOAP message routing logic in terms of BPEL processes. We show that parallel and alternative routes for SOAP messages can be modelled and executed, and the order of services that process a message at intermediaries can be predefined to accommodate the correct processing sequence as required by the concrete application domain. Features like dynamic discovery of services and flexible service composition are leveraged to enable flexible SOAP message routing.

  16. Producing gestures facilitates route learning.

    PubMed

    So, Wing Chee; Ching, Terence Han-Wei; Lim, Phoebe Elizabeth; Cheng, Xiaoqin; Ip, Kit Yee

    2014-01-01

    The present study investigates whether producing gestures would facilitate route learning in a navigation task and whether its facilitation effect is comparable to that of hand movements that leave physical visible traces. In two experiments, we focused on gestures produced without accompanying speech, i.e., co-thought gestures (e.g., an index finger traces the spatial sequence of a route in the air). Adult participants were asked to study routes shown in four diagrams, one at a time. Participants reproduced the routes (verbally in Experiment 1 and non-verbally in Experiment 2) without rehearsal or after rehearsal by mentally simulating the route, by drawing it, or by gesturing (either in the air or on paper). Participants who moved their hands (either in the form of gestures or drawing) recalled better than those who mentally simulated the routes and those who did not rehearse, suggesting that hand movements produced during rehearsal facilitate route learning. Interestingly, participants who gestured the routes in the air or on paper recalled better than those who drew them on paper in both experiments, suggesting that the facilitation effect of co-thought gesture holds for both verbal and nonverbal recall modalities. It is possibly because, co-thought gesture, as a kind of representational action, consolidates spatial sequence better than drawing and thus exerting more powerful influence on spatial representation. PMID:25426624

  17. Reliable multicast protocol specifications protocol operations

    NASA Technical Reports Server (NTRS)

    Callahan, John R.; Montgomery, Todd; Whetten, Brian

    1995-01-01

    This appendix contains the complete state tables for Reliable Multicast Protocol (RMP) Normal Operation, Multi-RPC Extensions, Membership Change Extensions, and Reformation Extensions. First the event types are presented. Afterwards, each RMP operation state, normal and extended, is presented individually and its events shown. Events in the RMP specification are one of several things: (1) arriving packets, (2) expired alarms, (3) user events, (4) exceptional conditions.

  18. A scheduling-function-based distributed access protocol that uses CDM to relay control information in a network with hidden nodes

    SciTech Connect

    Gold, Y.I.; Franta, W.R.

    1987-05-01

    The authors introduce a method for broadcasting control information (such as the information essential for correct operation of SOSAM and other scheduling-function-based access protocols) in stationary networks with ''hidden'' nodes (multihop networks). Control information is transmitted as short bit-parallel control messages on a separate control channel whose capacity is shared among the bits of a control message using code division multiplexing (CDM). The CDM method takes advantage of spread-spectrum signal properties that allow, in particular, high accuracy of time-of-arrival measurement and relatively easy separation of multipath copies of a control message. Generalized versions of SOSAM's scheduling function and the protocol algorithm are also provided. The generalized protocol, which applies the new method for broadcasting control information, provides distributed collision-free channel-access control, and allows prioritized access with high channel utilization and small expected message delay.

  19. Reliable on-demand multicast routing with congestion control in wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Tang, Ken; Gerla, Mario

    2001-07-01

    In this paper, we address the congestion control multicast routing problem in wireless ad hoc networks through the medium access control (MAC) layer. We first introduce the Broadcast Medium Window (BMW) MAC protocol, which provides reliable delivery to broadcast packets at the MAC layer. We then extend the wireless On-Demand Multicast Routing Protocol (ODMRP) to facilitate congestion control in ad hoc networks using BMW. Through simulation, we show that ODMRP with congestion control adapts well to multicast sources that are aggressive in data transmissions.

  20. Past Tense Route Priming

    PubMed Central

    Cohen-Shikora, Emily R.; Balota, David A.

    2013-01-01

    The present research examined whether lexical (whole word) or more rule-based (morphological constituent) processes can be locally biased by experimental list context in past tense verb inflection. In Experiment 1, younger and older adults completed a past tense inflection task in which list context was manipulated across blocks containing regular past tense verbs (e.g. REACH-REACHED) or irregular past tense verbs (TEACH-TAUGHT). Critical targets, consisting of half regular and half irregular verbs, were embedded within blocks and participants' inflection response latency and accuracy were assessed. The results yielded a cross-over interaction in response latencies. In the regular context there was a robust regularity effect: regular target verbs were conjugated faster than irregular target verbs. In contrast, in the irregular context, irregular target verbs were conjugated faster than regular target verbs. Experiment 2 used the same targets but in the context of either standard nonwords or nonwords ending in “-ED” to test the possibility of a phonological basis for the effect. The effect of context was eliminated. The results support the notion that distinct processes in past tense verb production can be locally biased by list context and, as shown in Experiment 2, this route priming effect was not due to phonological priming. PMID:23291293

  1. Calling depths of baleen whales from single sensor data: development of an autocorrelation method using multipath localization.

    PubMed

    Valtierra, Robert D; Glynn Holt, R; Cholewiak, Danielle; Van Parijs, Sofie M

    2013-09-01

    Multipath localization techniques have not previously been applied to baleen whale vocalizations due to difficulties in application to tonal vocalizations. Here it is shown that an autocorrelation method coupled with the direct reflected time difference of arrival localization technique can successfully resolve location information. A derivation was made to model the autocorrelation of a direct signal and its overlapping reflections to illustrate that an autocorrelation may be used to extract reflection information from longer duration signals containing a frequency sweep, such as some calls produced by baleen whales. An analysis was performed to characterize the difference in behavior of the autocorrelation when applied to call types with varying parameters (sweep rate, call duration). The method's feasibility was tested using data from playback transmissions to localize an acoustic transducer at a known depth and location. The method was then used to estimate the depth and range of a single North Atlantic right whale (Eubalaena glacialis) and humpback whale (Megaptera novaeangliae) from two separate experiments.

  2. An independent review of the Multi-Path Redundant Avionics Suite (MPRAS) architecture assessment and characterization report

    SciTech Connect

    Johnson, M.R.

    1991-02-01

    In recent years the NASA Langley Research Center has funded several contractors to conduct conceptual designs defining architectures for fault tolerant computer systems. Such a system is referred to as a Multi-Path Redundant Avionics Suite (MPRAS), and would form the basis for avionics systems that would be used in future families of space vehicles in a variety of missions. The principal contractors were General Dynamics, Boeing, and Draper Laboratories. These contractors participated in a series of review meetings, and submitted final reports defining their candidate architectures. NASA then commissioned the Research Triangle Institute (RTI) to perform an assessment of these architectures to identify strengths and weaknesses of each. This report is a separate, independent review of the RTI assessment, done primarily to assure that the assessment was comprehensive and objective. The report also includes general recommendations relative to further MPRAS development.

  3. Installation effects on multi-path ultrasonic flow meters: The {open_quote}ULTRAFLOW{close_quote} project

    SciTech Connect

    Bloemendaal, K. van; Kam, P.M.A. van der

    1995-12-31

    {open_quote}ULTRAFLOW{close_quote} was a Joint Industry Project aimed at establishing the effect of installation conditions on multi-path ultrasonic flow meters. An extensive test series was performed at 5 test facilities on 6 inch and 12 inch meters operating on natural gas at pressures from 10 to 60 bar. All test facilities and procedures are reviewed by an independent international Quality Assessment Team, comprising experts from legal metrological authorities, to ensure that the work was appropriate to support International Standards activity. This paper is a condensed version of the projects final report describing the project and test results. The tests in ideal flow conditions pay attention to meter stability and effects of signal averaging and pressure. From the error shifts in the tests with upstream disturbances (1 or 2 bends, step changes in pipe diameter and pressure reduction) values for uncertainties due to the presence of these disturbances are proposed.

  4. EFFECT OF MOBILITY ON PERFORMANCE OF WIRELESS AD-HOC NETWORK PROTOCOLS.

    SciTech Connect

    Barrett, C. L.; Drozda, M.; Marathe, M. V.; Marathe, A.

    2001-01-01

    We empirically study the effect of mobility on the performance of protocols designed for wireless adhoc networks. An important ohjective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols was measured in terms of (i) latency, (ii) throughput, (iii) number of packels received, (iv) long term fairness and (v) number of control packets at the MAC layer level. Three different commonly studied routing protocols were used: AODV, DSR and LAR1. Similarly three well known MAC protocols were used: MACA, 802.1 1 and CSMA. The inair1 conclusion of our study include the following: 1. 'I'he performance of the: network varies widely with varying mobility models, packet injection rates and speeds; and can ba in fact characterized as fair to poor depending on the specific situation. Nevertheless, in general, it appears that the combination of AODV and 802.1 I is far better than other combination of routing and MAC protocols. 2. MAC layer protocols interact with routing layer protocols. This concept which is formalized using statistics implies that in general it is not meaningful to speak about a MAC or a routing protocol in isolation. Such an interaction leads to trade-offs between the amount of control packets generated by each layer. More interestingly, the results wise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. 3. Routing prolocols with distributed knowledge about routes are more suitable for networks with mobility. This is seen by comparing the performance of AODV with DSR or LAR scheme 1. In DSli and IAR scheme 1, information about a computed path is being stored in the route query control packct. 4. MAC layer protocols have varying performance with varying mobility models. It is

  5. An Accurate Link Correlation Estimator for Improving Wireless Protocol Performance

    PubMed Central

    Zhao, Zhiwei; Xu, Xianghua; Dong, Wei; Bu, Jiajun

    2015-01-01

    Wireless link correlation has shown significant impact on the performance of various sensor network protocols. Many works have been devoted to exploiting link correlation for protocol improvements. However, the effectiveness of these designs heavily relies on the accuracy of link correlation measurement. In this paper, we investigate state-of-the-art link correlation measurement and analyze the limitations of existing works. We then propose a novel lightweight and accurate link correlation estimation (LACE) approach based on the reasoning of link correlation formation. LACE combines both long-term and short-term link behaviors for link correlation estimation. We implement LACE as a stand-alone interface in TinyOS and incorporate it into both routing and flooding protocols. Simulation and testbed results show that LACE: (1) achieves more accurate and lightweight link correlation measurements than the state-of-the-art work; and (2) greatly improves the performance of protocols exploiting link correlation. PMID:25686314

  6. An accurate link correlation estimator for improving wireless protocol performance.

    PubMed

    Zhao, Zhiwei; Xu, Xianghua; Dong, Wei; Bu, Jiajun

    2015-02-12

    Wireless link correlation has shown significant impact on the performance of various sensor network protocols. Many works have been devoted to exploiting link correlation for protocol improvements. However, the effectiveness of these designs heavily relies on the accuracy of link correlation measurement. In this paper, we investigate state-of-the-art link correlation measurement and analyze the limitations of existing works. We then propose a novel lightweight and accurate link correlation estimation (LACE) approach based on the reasoning of link correlation formation. LACE combines both long-term and short-term link behaviors for link correlation estimation. We implement LACE as a stand-alone interface in TinyOS and incorporate it into both routing and flooding protocols. Simulation and testbed results show that LACE: (1) achieves more accurate and lightweight link correlation measurements than the state-of-the-art work; and (2) greatly improves the performance of protocols exploiting link correlation.

  7. 49 CFR 236.767 - Locking, route.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... Locking, route. Electric locking, effective when a train passes a signal displaying an aspect for it to... within the route entered. It may be so arranged that as a train clears a track section of the route,...

  8. 49 CFR 236.767 - Locking, route.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... Locking, route. Electric locking, effective when a train passes a signal displaying an aspect for it to... within the route entered. It may be so arranged that as a train clears a track section of the route,...

  9. An Adaptive QoS Routing Solution for MANET Based Multimedia Communications in Emergency Cases

    NASA Astrophysics Data System (ADS)

    Ramrekha, Tipu Arvind; Politis, Christos

    The Mobile Ad hoc Networks (MANET) is a wireless network deprived of any fixed central authoritative routing entity. It relies entirely on collaborating nodes forwarding packets from source to destination. This paper describes the design, implementation and performance evaluation of CHAMELEON, an adaptive Quality of Service (QoS) routing solution, with improved delay and jitter performances, enabling multimedia communication for MANETs in extreme emergency situations such as forest fire and terrorist attacks as defined in the PEACE project. CHAMELEON is designed to adapt its routing behaviour according to the size of a MANET. The reactive Ad Hoc on-Demand Distance Vector Routing (AODV) and proactive Optimized Link State Routing (OLSR) protocols are deemed appropriate for CHAMELEON through their performance evaluation in terms of delay and jitter for different MANET sizes in a building fire emergency scenario. CHAMELEON is then implemented in NS-2 and evaluated similarly. The paper concludes with a summary of findings so far and intended future work.

  10. An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks

    PubMed Central

    Abba, Sani; Lee, Jeong-A

    2015-01-01

    We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network. PMID:26295236

  11. A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks.

    PubMed

    Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

    2016-01-01

    Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes' collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance. PMID:26927118

  12. A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks.

    PubMed

    Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

    2016-01-01

    Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes' collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance.

  13. A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks

    PubMed Central

    Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

    2016-01-01

    Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance. PMID:26927118

  14. Precise clock synchronization protocol

    NASA Astrophysics Data System (ADS)

    Luit, E. J.; Martin, J. M. M.

    1993-12-01

    A distributed clock synchronization protocol is presented which achieves a very high precision without the need for very frequent resynchronizations. The protocol tolerates failures of the clocks: clocks may be too slow or too fast, exhibit omission failures and report inconsistent values. Synchronization takes place in synchronization rounds as in many other synchronization protocols. At the end of each round, clock times are exchanged between the clocks. Each clock applies a convergence function (CF) to the values obtained. This function estimates the difference between its clock and an average clock and corrects its clock accordingly. Clocks are corrected for drift relative to this average clock during the next synchronization round. The protocol is based on the assumption that clock reading errors are small with respect to the required precision of synchronization. It is shown that the CF resynchronizes the clocks with high precision even when relatively large clock drifts are possible. It is also shown that the drift-corrected clocks remain synchronized until the end of the next synchronization round. The stability of the protocol is proven.

  15. Hot-Spot Avoidance With Multi-Pathing Over Infiniband: An MPI Perspective

    SciTech Connect

    Vishnu, A; Koop, M; Moody, A; Mamidala, A R; Narravula, S; Panda, D K

    2007-03-06

    Large scale InfiniBand clusters are becoming increasingly popular, as reflected by the TOP 500 Supercomputer rankings. At the same time, fat tree has become a popular interconnection topology for these clusters, since it allows multiple paths to be available in between a pair of nodes. However, even with fat tree, hot-spots may occur in the network depending upon the route configuration between end nodes and communication pattern(s) in the application. To make matters worse, the deterministic routing nature of InfiniBand limits the application from effective use of multiple paths transparently and avoid the hot-spots in the network. Simulation based studies for switches and adapters to implement congestion control have been proposed in the literature. However, these studies have focused on providing congestion control for the communication path, and not on utilizing multiple paths in the network for hot-spot avoidance. In this paper, we design an MPI functionality, which provides hot-spot avoidance for different communications, without a priori knowledge of the pattern. We leverage LMC (LID Mask Count) mechanism of InfiniBand to create multiple paths in the network and present the design issues (scheduling policies, selecting number of paths, scalability aspects) of our design. We implement our design and evaluate it with Pallas collective communication and MPI applications. On an InfiniBand cluster with 48 processes, collective operations like MPI All-to-all Personalized and MPI Reduce Scatter show an improvement of 27% and 19% respectively. Our evaluation with MPI applications like NAS Parallel Benchmarks and PSTSWM on 64 processes shows significant improvement in execution time with this functionality.

  16. InterGroup Protocols

    2003-04-02

    Existing reliable ordered group communication protocols have been developed for local-area networks and do not in general scale well to a large number of nodes and wide-area networks. The InterGroup suite of protocols is a scalable group communication system that introduces an unusual approach to handling group membership, and supports a receiver-oriented selection of service. The protocols are intended for a wide-area network, with a large number of nodes, that has highly variable delays andmore » a high message loss rate, such as the Internet. The levels of the message delivery service range from unreliable unordered to reliable timestamp ordered.« less

  17. Optimal protocols for nonlocality distillation

    SciTech Connect

    Hoeyer, Peter; Rashid, Jibran

    2010-10-15

    Forster et al. recently showed that weak nonlocality can be amplified by giving the first protocol that distills a class of nonlocal boxes (NLBs) [Phys. Rev. Lett. 102, 120401 (2009)] We first show that their protocol is optimal among all nonadaptive protocols. We next consider adaptive protocols. We show that the depth-2 protocol of Allcock et al. [Phys. Rev. A 80, 062107 (2009)] performs better than previously known adaptive depth-2 protocols for all symmetric NLBs. We present a depth-3 protocol that extends the known region of distillable NLBs. We give examples of NLBs for which each of the Forster et al., the Allcock et al., and our protocols perform best. The understanding we develop is that there is no single optimal protocol for NLB distillation. The choice of which protocol to use depends on the noise parameters for the NLB.

  18. Vascular access through the intraosseous route in pediatric emergencies

    PubMed Central

    de Sá, Ricardo Américo Ribeiro; Melo, Clayton Lima; Dantas, Raquel Batista; Delfim, Luciana Valverde Vieira

    2012-01-01

    Obtaining venous access in critically ill children is an essential procedure to restore blood volume and administer drugs during pediatric emergencies. The first option for vascular access is through a peripheral vein puncture. If this route cannot be used or if a prolonged period of access is necessary, then the intraosseous route is an effective option for rapid and safe venous access. The present work is a descriptive and exploratory literature review. The study's aim was to describe the techniques, professional responsibilities, and care related to obtaining venous access via the intraosseous route in pediatric emergencies. We selected 22 articles (published between 2000 and 2011) that were available in the Latin American and Caribbean Health Sciences (LILACS) and MEDLINE databases and the SciELO electronic library, in addition to the current protocol of cardiopulmonary resuscitation from the American Heart Association (2010). After the literature search, data were pooled and grouped into the following categories of analysis: historical aspects and physiological principles; indications, benefits, and contraindications; professional assignments; technical principles; care during the access; and possible complications. The results of the present study revealed that the intraosseous route is considered the main secondary option for vascular access during the emergency response because the technique is quick and easily executed, presents several non-collapsible puncture sites, and enables the rapid and effective administration of drugs and fluid replacement. PMID:23917941

  19. WOODSTOVE DURABILITY TESTING PROTOCOL

    EPA Science Inventory

    The report discusses the development of an accelerated laboratory test to simulate in-home woodstove aging and degradation. nown as a stress test, the protocol determines the long-term durability of woodstove models in a 1- to 2-week time frame. wo avenues of research have been t...

  20. Central East Pacific Flight Routing

    NASA Technical Reports Server (NTRS)

    Grabbe, Shon; Sridhar, Banavar; Kopardekar, Parimal; Cheng, Nadia

    2006-01-01

    With the introduction of the Federal Aviation Administration s Advanced Technology and Oceanic Procedures system at the Oakland Oceanic Center, a level of automation now exists in the oceanic environment to potentially begin accommodating increased user preferred routing requests. This paper presents the results of an initial feasibility assessment which examines the potential benefits of transitioning from the fixed Central East Pacific routes to user preferred routes. As a surrogate for the actual user-provided routing requests, a minimum-travel-time, wind-optimal dynamic programming algorithm was developed and utilized in this paper. After first describing the characteristics (e.g., origin airport, destination airport, vertical distribution and temporal distribution) of the westbound flights utilizing the Central East Pacific routes on Dec. 14-16 and 19-20, the results of both a flight-plan-based simulation and a wind-optimal-based simulation are presented. Whereas the lateral and longitudinal distribution of the aircraft trajectories in these two simulations varied dramatically, the number of simulated first-loss-of-separation events remained relatively constant. One area of concern that was uncovered in this initial analysis was a potential workload issue associated with the redistribution of traffic in the oceanic sectors due to thc prevailing wind patterns.

  1. A Novel Routing Strategy on Space Communication Network

    NASA Astrophysics Data System (ADS)

    LI, Yujian; WANG, Xu-Liang; Zhen-dong, XI; Bing-hong, WANG

    2016-02-01

    In this paper, we propose an effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential time delay exponent β. Traffic dynamics both near and far away from the critical generating rate Rc are discussed. Simulation results demonstrate that the optimal performance of the system corresponds to β =-0.5. Due to the low cost of acquiring nearest-neighbor information and the strongly improved network capacity, our strategy may be useful and reasonable for the protocol designing of modern communication networks and space communication networks.

  2. Routing Algorithm Exploits Spatial Relations

    NASA Technical Reports Server (NTRS)

    Okino, Clayton; Jennings, Esther

    2004-01-01

    A recently developed routing algorithm for broadcasting in an ad hoc wireless communication network takes account of, and exploits, the spatial relationships among the locations of nodes, in addition to transmission power levels and distances between the nodes. In contrast, most prior algorithms for discovering routes through ad hoc networks rely heavily on transmission power levels and utilize limited graph-topology techniques that do not involve consideration of the aforesaid spatial relationships. The present algorithm extracts the relevant spatial-relationship information by use of a construct denoted the relative-neighborhood graph (RNG).

  3. Predicting impact of multi-paths on phase change in map-based vehicular ad hoc networks

    NASA Astrophysics Data System (ADS)

    Rahmes, Mark; Lemieux, George; Sonnenberg, Jerome; Chester, David B.

    2014-05-01

    Dynamic Spectrum Access, which through its ability to adapt the operating frequency of a radio, is widely believed to be a solution to the limited spectrum problem. Mobile Ad Hoc Networks (MANETs) can extend high capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact cognitive radio employs spectrum sensing to facilitate identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We quantify optimal signal detection in map based cognitive radio networks with multiple rapidly varying phase changes and multiple orthogonal signals. Doppler shift occurs due to reflection, scattering, and rapid vehicle movement. Path propagation as well as vehicle movement produces either constructive or destructive interference with the incident wave. Our signal detection algorithms can assist the Doppler spread compensation algorithm by deciding how many phase changes in signals are present in a selected band of interest. Additionally we can populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate Dynamic Spectrum Access. We show how topography can help predict the impact of multi-paths on phase change, as well as about the prediction from dense traffic areas. Utilization of high resolution geospatial data layers in RF propagation analysis is directly applicable.

  4. Simple boric acid-based fluorescent focusing for sensing of glucose and glycoprotein via multipath moving supramolecular boundary electrophoresis chip.

    PubMed

    Dong, Jingyu; Li, Si; Wang, Houyu; Meng, Qinghua; Fan, Liuyin; Xie, Haiyang; Cao, Chengxi; Zhang, Weibing

    2013-06-18

    Boric acid-based fluorescent complex probe of BBV-HPTS (boronic acid-based benzyl viologen (BBV) and hydroxypyrene trisulfonic acid trisodium salt (HPTS)) was rarely used for sensitive sensing of saccharide (especially glycoprotein) via electrophoresis. We proposed a novel model of moving supramolecular boundary (MSB) formed with monosaccharide or glycoprotein in microcolumn and the complex probe of BBV-HPTS in the cathodic injection tube, developed a method of MSB fluorescent focusing for sensitive recognition of monosaccharide and glycoprotein, and designed a special multipath capillary electrophoresis (CE) chip for relative experiments. As a proof of concept, glucose and hemoglobin A1c (HbA1c) were respectively used as the mode saccharide and glycoprotein for the relevant demonstration. The experiments revealed that (i) the complex of BBV-HPTS could interact with free glucose or bound one in glycoprotein; (ii) the fluorescent signal was a function of glucose or glycoprotein content approximately; and (iii) interestingly the fluorescent band motion was dependent on glucose content. The developed method had the following merits: (i) low cost; (ii) low limit of detection (down to 1.39 pg/mL for glucose and 2.0 pg per capillary HbA1c); and (iii) high throughput (up to 12 runs or more per patch) and speed (less than 5 min). The developed method has potential use for sensitive monitoring of monosaccharide and glycoprotein in biomedical samples.

  5. Multipath variational transition state theory: rate constant of the 1,4-hydrogen shift isomerization of the 2-cyclohexylethyl radical.

    PubMed

    Yu, Tao; Zheng, Jingjing; Truhlar, Donald G

    2012-01-12

    We propose a new formulation of variational transition state theory called multipath variational transition state theory (MP-VTST). We employ this new formulation to calculate the forward and reverse thermal rate constant of the 1,4-hydrogen shift isomerization of the 2-cyclohexylethyl radical in the gas phase. First, we find and optimize all the local-minimum-energy structures of the reaction, product, and transition state. Then, for the lowest-energy transition state structures, we calculate the reaction path by using multiconfiguration Shepard interpolation (MSCI) method to represent the potential energy surface, and, from this representation, we also calculate the ground-state vibrationally adiabatic potential energy curve, the reaction-path curvature vector, and the generalized free energy of activation profile. With this information, the path-averaged generalized transmission coefficients <γ> are evaluated. Then, thermal rate constant containing the multiple-structure anharmonicity and torsional anharmonicity effects is calculated using multistructural transition state theory (MS-TST). The final MP-VTST thermal rate constant is obtained by multiplying k(MS-T)(MS-TST) by <γ>. In these calculations, the M06 density functional is utilized to compute the energy, gradient, and Hessian at the Shepard points, and the M06-2X density functional is used to obtain the structures (conformers) of the reactant, product, and the saddle point for computing the multistructural anharmonicity factors.

  6. Fast data and voice transmission for mobile services with high immunity against multipath and co-channel interference

    NASA Astrophysics Data System (ADS)

    Langewellpott, U.

    1984-10-01

    A scheme for high rate data and voice transmission over multipath channels was developed and evaluated during the design of a wideband cellular mobile telephone and data system operating at 900 MHz. The transmission bandwidth in the order of 5 MHz is a consequence of the time division multiple access (TDMA) architecture was selected for cost savings and advantages in system organization. In TDMA time is divided into a contiguous stream of short time slots and individual channels consist of different subsets of time slots. All time slots use the same frequency, so no synthesizer is required. In addition, there is no need for a diplexer at the mobile because the transmit and receive time slots can be separated in time. For the same reason the base stations only need one transmitter and one receiver tuned to the transmit and receive frequency respectively. So the complexity is favorably reduced. The highest potential for cost savings stems from digital transmission which, in conjunction with a forecast number of more than one million subscribers, fulfills the prerequisite to low production cost. System organization is facilitated by the TDMA approach because the mobiles only need to be active during the short transmit and receive times slots and can easily monitor all surrounding base stations and decide to initiate hand-off to the one offering the best propagation conditions.

  7. Distributed Dynamic Host Configuration Protocol (D2HCP).

    PubMed

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment.

  8. Distributed Dynamic Host Configuration Protocol (D2HCP).

    PubMed

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856

  9. Distributed Dynamic Host Configuration Protocol (D2HCP)

    PubMed Central

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856

  10. Protocols for distributive scheduling

    NASA Technical Reports Server (NTRS)

    Richards, Stephen F.; Fox, Barry

    1993-01-01

    The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of space shuttle mission planning.

  11. Generalized teleportation protocol

    SciTech Connect

    Gordon, Goren; Rigolin, Gustavo

    2006-04-15

    A generalized teleportation protocol (GTP) for N qubits is presented, where the teleportation channels are nonmaximally entangled and all the free parameters of the protocol are considered: Alice's measurement basis, her sets of acceptable results, and Bob's unitary operations. The full range of fidelity (F) of the teleported state and the probability of success (P{sub suc}) to obtain a given fidelity are achieved by changing these free parameters. A channel efficiency bound is found, where one can determine how to divide it between F and P{sub suc}. A one-qubit formulation is presented and then expanded to N qubits. A proposed experimental setup that implements the GTP is given using linear optics.

  12. Dysphonia risk screening protocol

    PubMed Central

    Nemr, Katia; Simões-Zenari, Marcia; da Trindade Duarte, João Marcos; Lobrigate, Karen Elena; Bagatini, Flavia Alves

    2016-01-01

    OBJECTIVE: To propose and test the applicability of a dysphonia risk screening protocol with score calculation in individuals with and without dysphonia. METHOD: This descriptive cross-sectional study included 365 individuals (41 children, 142 adult women, 91 adult men and 91 seniors) divided into a dysphonic group and a non-dysphonic group. The protocol consisted of 18 questions and a score was calculated using a 10-cm visual analog scale. The measured value on the visual analog scale was added to the overall score, along with other partial scores. Speech samples allowed for analysis/assessment of the overall degree of vocal deviation and initial definition of the respective groups and after six months, the separation of the groups was confirmed using an acoustic analysis. RESULTS: The mean total scores were different between the groups in all samples. Values ranged between 37.0 and 57.85 in the dysphonic group and between 12.95 and 19.28 in the non-dysphonic group, with overall means of 46.09 and 15.55, respectively. High sensitivity and specificity were demonstrated when discriminating between the groups with the following cut-off points: 22.50 (children), 29.25 (adult women), 22.75 (adult men), and 27.10 (seniors). CONCLUSION: The protocol demonstrated high sensitivity and specificity in differentiating groups of individuals with and without dysphonia in different sample groups and is thus an effective instrument for use in voice clinics. PMID:27074171

  13. Mars Communication Protocols

    NASA Technical Reports Server (NTRS)

    Kazz, G. J.; Greenberg, E.

    2000-01-01

    Over the next decade, international plans and commitments are underway to develop an infrastructure at Mars to support future exploration of the red planet. The purpose of this infrastructure is to provide reliable global communication and navigation coverage for on-approach, landed, roving, and in-flight assets at Mars. The claim is that this infrastructure will: 1) eliminate the need of these assets to carry Direct to Earth (DTE) communications equipment, 2) significantly increase data return and connectivity, 3) enable small mission exploration of Mars without DTE equipment, 4) provide precision navigation i.e., 10 to 100m position resolution, 5) supply timing reference accurate to 10ms. This paper in particular focuses on two CCSDS recommendations for that infrastructure: CCSDS Proximity-1 Space Link Protocol and CCSDS File Delivery Protocol (CFDP). A key aspect of Mars exploration will be the ability of future missions to interoperate. These protocols establish a framework for interoperability by providing standard communication, navigation, and timing services. In addition, these services include strategies to recover gracefully from communication interruptions and interference while ensuring backward compatibility with previous missions from previous phases of exploration.

  14. Robust Optimization of Biological Protocols

    PubMed Central

    Flaherty, Patrick; Davis, Ronald W.

    2015-01-01

    When conducting high-throughput biological experiments, it is often necessary to develop a protocol that is both inexpensive and robust. Standard approaches are either not cost-effective or arrive at an optimized protocol that is sensitive to experimental variations. We show here a novel approach that directly minimizes the cost of the protocol while ensuring the protocol is robust to experimental variation. Our approach uses a risk-averse conditional value-at-risk criterion in a robust parameter design framework. We demonstrate this approach on a polymerase chain reaction protocol and show that our improved protocol is less expensive than the standard protocol and more robust than a protocol optimized without consideration of experimental variation. PMID:26417115

  15. A tool for debugging internet multicast routing

    SciTech Connect

    Agarwal, D.; Floyd, S.

    1994-03-01

    In this paper the authors describe a debugging tool that is an effective means of analyzing problems with multicast packet routing in a network. Multicast packet routing is a source-driven distributed calculation performed by the routers in a multicast network. The routes taken by multicast packets are difficult to predict manually due to the large number of variables that must be considered. The multicast route debugging tool allows off-line investigation of the route taken by a multicast packet and the effects of network modifications on that route. The tool has already proved useful in debugging the problems that have occurred in the experimental Internet Multicast Backbone. The multicast route debugging tool currently predicts multicast routes of packets using the distance-vector truncated-broadcast algorithm implemented for Internet multicast traffic. They will be upgrading the tool to allow the user to choose other multicast routing algorithms.

  16. SNAP-tagging the retrograde route.

    PubMed

    Johannes, Ludger; Shafaq-Zadah, Massiullah

    2013-01-01

    We have developed a chemical biology strategy to identify proteins that follow the retrograde transport route from the plasma membrane to the Golgi apparatus, via endosomes. The general principle is the following: plasma membrane proteins are covalently tagged with a first probe. Only the ones that are then transported to trans-Golgi/TGN membranes are covalently bound to a capture reagent that has been engineered into this compartment. Specifically, the first probe is benzylguanine (BG) that is conjugated onto primary amino groups of plasma-membrane proteins. The capture reagent includes an O(6)-alkylguanine-DNA alkyltransferase-derived fragment, the SNAP-tag, which forms a covalent linkage with BG. The SNAP-tag is fused to the GFP-tagged Golgi membrane anchor from galactosyl transferase for proper targeting to trans-Golgi/TGN membranes. Cell-surface BG-tagged proteins that are transported to trans-Golgi/TGN membranes (i.e., that are retrograde cargoes) are thereby covalently captured by the SNAP-tag fusion protein. For identification, the latter is immunopurified using GFP-Trap, and associated retrograde cargo proteins are identified by mass spectrometry. We here provide a step-by-step protocol of this method.

  17. Performance and policy dimensions in internet routing

    NASA Technical Reports Server (NTRS)

    Mills, David L.; Boncelet, Charles G.; Elias, John G.; Schragger, Paul A.; Jackson, Alden W.; Thyagarajan, Ajit

    1995-01-01

    The Internet Routing Project, referred to in this report as the 'Highball Project', has been investigating architectures suitable for networks spanning large geographic areas and capable of very high data rates. The Highball network architecture is based on a high speed crossbar switch and an adaptive, distributed, TDMA scheduling algorithm. The scheduling algorithm controls the instantaneous configuration and swell time of the switch, one of which is attached to each node. In order to send a single burst or a multi-burst packet, a reservation request is sent to all nodes. The scheduling algorithm then configures the switches immediately prior to the arrival of each burst, so it can be relayed immediately without requiring local storage. Reservations and housekeeping information are sent using a special broadcast-spanning-tree schedule. Progress to date in the Highball Project includes the design and testing of a suite of scheduling algorithms, construction of software reservation/scheduling simulators, and construction of a strawman hardware and software implementation. A prototype switch controller and timestamp generator have been completed and are in test. Detailed documentation on the algorithms, protocols and experiments conducted are given in various reports and papers published. Abstracts of this literature are included in the bibliography at the end of this report, which serves as an extended executive summary.

  18. Dynamic Weather Routes Architecture Overview

    NASA Technical Reports Server (NTRS)

    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.

  19. Roots/Routes: Part I

    ERIC Educational Resources Information Center

    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…

  20. Judaism and the Silk Route.

    ERIC Educational Resources Information Center

    Foltz, Richard

    1998-01-01

    Demonstrates that the Judeans traveled along the Ancient Silk Route. Discusses the Iranian influence on the formation of Jewish religious ideas. Considers the development of Jewish trade networks, focusing on the Radanites (Jewish traders), the Jewish presence in the Far East, and the survival of Judaism in central Asia. (CMK)

  1. How to choose the route.

    PubMed

    Grecu, Irina

    2013-01-01

    Choosing the route for nutrition support delivery is one of the main steps in the algorithm of providing successful nutrition to the critically ill, but it is certainly not an easy process. The rationale should be guided not only by principles like physiology and benefit versus harm, but also by individual patient factors like feasibility, contraindications, predicted versus actual tolerance, and (most important) the timing for starting food delivery. Although oral nutrition is the more physiological route for feeding, it is seldom possible or sufficient in critically ill patients. Enteral nutrition, in the form of tube feeding, remains the best option in the absence of absolute contraindications, but many other factors should be taken into account. These include the importance of starting early and trying to achieve target nutrients delivery early, especially in previously undernourished or in most severely ill patients, as well as the gastrointestinal intolerance present in the majority of critically ill patients. Parenteral nutrition is an alternative route for nutrition delivery when the enteral one is impossible or insufficient. The most common complication when choosing this route is overfeeding, which has been associated with increased complications rate. On the other hand, the most common complication of enteral nutrition is underfeeding, which has also been associated with worse outcome and even increased mortality. Combining enteral with supplemental parenteral nutrition is therefore a rational approach for providing early and adequate nutritional support in the most severely ill patients.

  2. Overview of wideband packet protocols

    NASA Astrophysics Data System (ADS)

    Sherif, M. H.

    1992-10-01

    Wideband packet networks operate at rates equal to, or higher than, 64 kb/s, but lower than the basic broadband rate of 150 Mb/s, on cables or satellite links. Wideband packet protocols are the transmission protocols for these networks. They define open interfaces that can be used for public and private ISDNs. The protocols are defined in CCITT Recommendations G.764 and G.765. This paper describes the objectives of the wideband protocols, and how the objectives were achieved.

  3. Enhanced parent selection algorithms in mintroute protocol

    NASA Astrophysics Data System (ADS)

    Kim, Ki-Il

    2012-11-01

    A low-rate, short-range wireless radio communication on a small device often hampers high reliability in wireless sensor networks. However, more applications are increasingly demanding high reliability. To meet this requirement, various approaches have been proposed in each viewpoint of layers. Among those, MintRoute is a well-known network layer approach to develop a new metric based on link quality for path selection towards the sink. By choosing the link with the highest measured value, it has a higher possibility to transmit a packet over the link without error. However, there are still several issues to be mentioned during operations. In this paper, we propose how to improve the MintRoute protocol through revised algorithms. They include a parent selection considering distance and level from the sink node, and a fast recovery method against failures. Simulations and analysis are performed by in order to validate the suitability of reduced end-to-end delay and fast recovery for failures, thus to enhance the reliability of communication.

  4. Communication complexity protocols for qutrits

    SciTech Connect

    Tamir, Boaz

    2007-03-15

    Consider a function where its entries are distributed among many parties. Suppose each party is allowed to send only a limited amount of information to a referee. The referee can use a classical protocol to compute the value of the global function. Is there a quantum protocol improving the results of all classical protocols? In a recent work Brukner et al. showed the deep connection between such problems and the theory of Bell inequalities. Here we generalize the theory to trits. There, the best classical protocol fails whereas the quantum protocol yields the correct answer.

  5. Integrating network structure and dynamic information for better routing strategy on scale-free networks

    NASA Astrophysics Data System (ADS)

    Tang, Xiao-Gai; Wong, Eric W. M.; Wu, Zhi-Xi

    2009-06-01

    We study information packet routing processes on scale-free networks by mimicking the Internet traffic delivery strategies. We incorporate both the global network structure information and local queuing information in the dynamic processes. We propose several new routing strategies to guide the packet routing. The performance of the routing strategies is measured by the average transit time of the packets as well as their dependence on the traffic amount. We find that the routing strategies which integrate both global network structure information and local dynamic information perform much better than the traditional shortest-path routing protocol which takes into account only the global topological information. Moreover, from comparative studies of these routing strategies, we observe that some of our proposed methods can decrease the average transit time of packets but the performance is closely dependent on the total amount of traffic while some other proposed methods can have good performance independent of the total amount of traffic with hyper-excellent average transit time of packets. Also, numerical results show that our proposed methods integrating network structure information and local dynamic information can work much better than the methods recently proposed in [S. Sreenivasan, R. Cohen, E. López, Z. Toroczkai, H.E. Stanley, Phys. Rev. E 75 (2007) 036105, Zhi-Xi Wu, Gang Peng, Eric W.M. Wong, Kai-Hau Yeung, J. Stat. Mech. (2008) P11002.], which only considered network structure information.

  6. An improved least cost routing approach for WDM optical network without wavelength converters

    NASA Astrophysics Data System (ADS)

    Bonani, Luiz H.; Forghani-elahabad, Majid

    2016-12-01

    Routing and wavelength assignment (RWA) problem has been an attractive problem in optical networks, and consequently several algorithms have been proposed in the literature to solve this problem. The most known techniques for the dynamic routing subproblem are fixed routing, fixed-alternate routing, and adaptive routing methods. The first one leads to a high blocking probability (BP) and the last one includes a high computational complexity and requires immense backing from the control and management protocols. The second one suggests a trade-off between performance and complexity, and hence we consider it to improve in our work. In fact, considering the RWA problem in a wavelength routed optical network with no wavelength converter, an improved technique is proposed for the routing subproblem in order to decrease the BP of the network. Based on fixed-alternate approach, the first k shortest paths (SPs) between each node pair is determined. We then rearrange the SPs according to a newly defined cost for the links and paths. Upon arriving a connection request, the sorted paths are consecutively checked for an available wavelength according to the most-used technique. We implement our proposed algorithm and the least-hop fixed-alternate algorithm to show how the rearrangement of SPs contributes to a lower BP in the network. The numerical results demonstrate the efficiency of our proposed algorithm in comparison with the others, considering different number of available wavelengths.

  7. Computerized Bus Routing in San Francisco.

    ERIC Educational Resources Information Center

    Caswell, Peter J.; Jungherr, J. Anton

    1979-01-01

    A computerized routing and scheduling system for the San Francisco Public Schools includes the batch processing of bus route assignments and schedules for all schools and the online terminal processing of daily changes. (Author/MLF)

  8. Blind Alley Aware ACO Routing Algorithm

    NASA Astrophysics Data System (ADS)

    Yoshikawa, Masaya; Otani, Kazuo

    2010-10-01

    The routing problem is applied to various engineering fields. Many researchers study this problem. In this paper, we propose a new routing algorithm which is based on Ant Colony Optimization. The proposed algorithm introduces the tabu search mechanism to escape the blind alley. Thus, the proposed algorithm enables to find the shortest route, even if the map data contains the blind alley. Experiments using map data prove the effectiveness in comparison with Dijkstra algorithm which is the most popular conventional routing algorithm.

  9. Multicast Routing of Hierarchical Data

    NASA Technical Reports Server (NTRS)

    Shacham, Nachum

    1992-01-01

    The issue of multicast of broadband, real-time data in a heterogeneous environment, in which the data recipients differ in their reception abilities, is considered. Traditional multicast schemes, which are designed to deliver all the source data to all recipients, offer limited performance in such an environment, since they must either force the source to overcompress its signal or restrict the destination population to those who can receive the full signal. We present an approach for resolving this issue by combining hierarchical source coding techniques, which allow recipients to trade off reception bandwidth for signal quality, and sophisticated routing algorithms that deliver to each destination the maximum possible signal quality. The field of hierarchical coding is briefly surveyed and new multicast routing algorithms are presented. The algorithms are compared in terms of network utilization efficiency, lengths of paths, and the required mechanisms for forwarding packets on the resulting paths.

  10. Daisy Found on 'Route 66'

    NASA Technical Reports Server (NTRS)

    2004-01-01

    This composite image from the panoramic camera on NASA's Mars Exploration Rover Spirit gives an approximately true-color rendering of a daisy-like pattern of brushed circles that Spirit produced on a rock called 'Route 66.' Spirit used the rock abrasion tool to complete this 6-position 'RAT daisy' on sol 99. It took this image on sol 100, April 14, 2004.

    The purpose for these large brushings is to create a large enough patch of treated surface area for the miniature thermal emission spectrometer to analyze. Scientists had previously conducted a brushing like this one on the rock 'Mazatzal.' The brushed area of Route 66 looks very different from the brushed area of Mazatzal, leading scientists to think that the rocks although both light in tone actually have different coating types.

  11. A line-of-sight propagation model for calculating atmospheric, sea, terrain multipath, and clutter at microwave frequencies

    NASA Astrophysics Data System (ADS)

    Ott, Randolph H.

    1997-03-01

    The two-dimensional parabolic wave equation (PE) is solved asymptotically in order to derive a propagation/scattering model for propagation in a stratified atmosphere, together with scattering and diffraction from the sea/terrain surface, within line of sight. The asymptotic solution to the PE begins by expanding the unknown field in a Luneberg-Kline expansion. The first-order solution to the Luneberg-Kline expansion yields the eikonal equation for the ray trajectory, and the second-order solution yields the transport equation for the energy density of the rays along the trajectory. The solution to the eikonal and transport equations is used to derive an asymptotic result for the plane wave spectrum solution for the PE, referred to as the wave-theoretic model. The asymptotic solution for the field shows the relationship between a properly directed tube of rays in the atmosphere satisfying the eikonal and conservation of energy equations and the same tube of rays striking an edge and being diffracted, as in the geometrical theory of diffraction (GTD). The solution for the eikonal yields the ray trajectory in the stratified atmosphere and therefore the grazing angle on the sea/terrain profile necessary for calculating multipath and clutter. Also, a new derivation for the backscatter from a deterministic sea/terrain profile is given which agrees with Collin's [1992] new full wave theory and at grazing reduces to the perturbation result with the correct polarization dependence. Incorporating the various electromagnetic propagation/scattering mechanisms in one model yields a prediction tool that can be applied to a large class of propagation/scattering problems such as the analysis of radar performance in a littoral scenario, or the performance of a line-of-sight communication link operating over irregular terrain.

  12. Modeling the carbon cost of plant nitrogen acquisition: Mycorrhizal trade-offs and multipath resistance uptake improve predictions of retranslocation

    NASA Astrophysics Data System (ADS)

    Brzostek, Edward R.; Fisher, Joshua B.; Phillips, Richard P.

    2014-08-01

    Accurate projections of the future land carbon (C) sink by terrestrial biosphere models depend on how nutrient constraints on net primary production are represented. While nutrient limitation is nearly universal, current models do not have a C cost for plant nutrient acquisition. Also missing are symbiotic mycorrhizal fungi, which can consume up to 20% of net primary production and supply up to 50% of a plant's nitrogen (N) uptake. Here we integrate simultaneous uptake and mycorrhizae into a cutting-edge plant N model—Fixation and Uptake of Nitrogen (FUN)—that can be coupled into terrestrial biosphere models. The C cost of N acquisition varies as a function of mycorrhizal type, with plants that support arbuscular mycorrhizae benefiting when N is relatively abundant and plants that support ectomycorrhizae benefiting when N is strongly limiting. Across six temperate forested sites (representing arbuscular mycorrhizal- and ectomycorrhizal-dominated stands and 176 site years), including multipath resistance improved the partitioning of N uptake between aboveground and belowground sources. Integrating mycorrhizae led to further improvements in predictions of N uptake from soil (R2 = 0.69 increased to R2 = 0.96) and from senescing leaves (R2 = 0.29 increased to R2 = 0.73) relative to the original model. On average, 5% and 9% of net primary production in arbuscular mycorrhizal- and ectomycorrhizal-dominated forests, respectively, was needed to support mycorrhizal-mediated acquisition of N. To the extent that resource constraints to net primary production are governed by similar trade-offs across all terrestrial ecosystems, integrating these improvements to FUN into terrestrial biosphere models should enhance predictions of the future land C sink.

  13. K-BRiR: An Efficient and Self-organized Routing Mechanism for Structured Peer-to-Peer Service Networks

    NASA Astrophysics Data System (ADS)

    Tan, Zhenhua; Yang, Guangming; Zhu, Zhiliang; Cheng, Wei; Chang, Guiran

    Peer-to-Peer service network takes an important role in the internet technology. The routing mechanism is the core technology for P2P service network. In this paper, an efficient and self-organized routing mechanism named K-BRiR for structured P2P service network is presented. K-BRiR includes a basic routing protocol BRiR which is based on ring topology. The definitions and algorithms are discussed. Our experimental results confirm that K-BRiR is stable and efficient in P2P service network.

  14. Retrieving and routing quantum information in a quantum network

    NASA Astrophysics Data System (ADS)

    Sazim, S.; Chiranjeevi, V.; Chakrabarty, I.; Srinathan, K.

    2015-12-01

    In extant quantum secret sharing protocols, once the secret is shared in a quantum network ( qnet) it cannot be retrieved, even if the dealer wishes that his/her secret no longer be available in the network. For instance, if the dealer is part of the two qnets, say {{Q}}_1 and {{Q}}_2 and he/she subsequently finds that {{Q}}_2 is more reliable than {{Q}}_1, he/she may wish to transfer all her secrets from {{Q}}_1 to {{Q}}_2. Known protocols are inadequate to address such a revocation. In this work we address this problem by designing a protocol that enables the source/dealer to bring back the information shared in the network, if desired. Unlike classical revocation, the no-cloning theorem automatically ensures that the secret is no longer shared in the network. The implications of our results are multi-fold. One interesting implication of our technique is the possibility of routing qubits in asynchronous qnets. By asynchrony we mean that the requisite data/resources are intermittently available (but not necessarily simultaneously) in the qnet. For example, we show that a source S can send quantum information to a destination R even though (a) S and R share no quantum resource, (b) R's identity is unknown to S at the time of sending the message, but is subsequently decided, (c) S herself can be R at a later date and/or in a different location to bequeath her information (`backed-up' in the qnet) and (d) importantly, the path chosen for routing the secret may hit a dead end due to resource constraints, congestion, etc., (therefore the information needs to be back-tracked and sent along an alternate path). Another implication of our technique is the possibility of using insecure resources. For instance, if the quantum memory within an organization is insufficient, it may safely store (using our protocol) its private information with a neighboring organization without (a) revealing critical data to the host and (b) losing control over retrieving the data. Putting the

  15. Next-Generation WDM Network Design and Routing

    NASA Astrophysics Data System (ADS)

    Tsang, Danny H. K.; Bensaou, Brahim

    2003-10-01

    Call for Papers The Editors of JON are soliciting papers on WDM Network Design and Routing. The aim in this focus issue is to publish original research on topics including - but not limited to - the following: - WDM network architectures and protocols - GMPLS network architectures - Wavelength converter placement in WDM networks - Routing and wavelength assignment (RWA) in WDM networks - Protection and restoration strategies and algorithms in WDM networks - Traffic grooming in WDM networks - Dynamic routing strategies and algorithms - Optical burst switching - Support of multicast - Protection and restoration in WDM networks - Performance analysis and optimization in WDM networks Manuscript Submission To submit to this special issue, follow the normal procedure for submission to JON, indicating "WDM Network Design" in the "Comments" field of the online submission form. For all other questions relating to this focus issue, please send an e-mail to jon@osa.org, subject line "WDM Network Design." Additional information can be found on the JON website: http://www.osa-jon.org/submission/. Schedule - Paper Submission Deadline: November 1, 2003 - Notification to Authors: January 15, 2004 - Final Manuscripts to Publisher: February 15, 2004 - Publication of Focus Issue: February/March 2004

  16. Next-Generation WDM Network Design and Routing

    NASA Astrophysics Data System (ADS)

    Tsang, Danny H. K.; Bensaou, Brahim

    2003-08-01

    Call for Papers The Editors of JON are soliciting papers on WDM Network Design and Routing. The aim in this focus issue is to publish original research on topics including - but not limited to - the following: - WDM network architectures and protocols - GMPLS network architectures - Wavelength converter placement in WDM networks - Routing and wavelength assignment (RWA) in WDM networks - Protection and restoration strategies and algorithms in WDM networks - Traffic grooming in WDM networks - Dynamic routing strategies and algorithms - Optical Burst Switching - Support of Multicast - Protection and restoration in WDM networks - Performance analysis and optimization in WDM networks Manuscript Submission To submit to this special issue, follow the normal procedure for submission to JON, indicating "WDM Network Design" in the "Comments" field of the online submission form. For all other questions relating to this focus issue, please send an e-mail to jon@osa.org, subject line "WDM Network Design." Additional information can be found on the JON website: http://www.osa-jon.org/submission/. Schedule Paper Submission Deadline: November 1, 2003 Notification to Authors: January 15, 2004 Final Manuscripts to Publisher: February 15, 2004 Publication of Focus Issue: February/March 2004

  17. Next-Generation WDM Network Design and Routing

    NASA Astrophysics Data System (ADS)

    Tsang, Danny H. K.; Bensaou, Brahim

    2003-09-01

    Call for Papers The Editors of JON are soliciting papers on WDM Network Design and Routing. The aim in this focus issue is to publish original research on topics including - but not limited to - the following: - WDM network architectures and protocols - GMPLS network architectures - Wavelength converter placement in WDM networks - Routing and wavelength assignment (RWA) in WDM networks - Protection and restoration strategies and algorithms in WDM networks - Traffic grooming in WDM networks - Dynamic routing strategies and algorithms - Optical burst switching - Support of multicast - Protection and restoration in WDM networks - Performance analysis and optimization in WDM networks Manuscript Submission To submit to this special issue, follow the normal procedure for submission to JON, indicating "WDM Network Design" in the "Comments" field of the online submission form. For all other questions relating to this focus issue, please send an e-mail to jon@osa.org, subject line "WDM Network Design." Additional information can be found on the JON website: http://www.osa-jon.org/submission/. Schedule - Paper Submission Deadline: November 1, 2003 - Notification to Authors: January 15, 2004 - Final Manuscripts to Publisher: February 15, 2004 - Publication of Focus Issue: February/March 2004

  18. Protocol Architecture Model Report

    NASA Technical Reports Server (NTRS)

    Dhas, Chris

    2000-01-01

    NASA's Glenn Research Center (GRC) defines and develops advanced technology for high priority national needs in communications technologies for application to aeronautics and space. GRC tasked Computer Networks and Software Inc. (CNS) to examine protocols and architectures for an In-Space Internet Node. CNS has developed a methodology for network reference models to support NASA's four mission areas: Earth Science, Space Science, Human Exploration and Development of Space (REDS), Aerospace Technology. This report applies the methodology to three space Internet-based communications scenarios for future missions. CNS has conceptualized, designed, and developed space Internet-based communications protocols and architectures for each of the independent scenarios. The scenarios are: Scenario 1: Unicast communications between a Low-Earth-Orbit (LEO) spacecraft inspace Internet node and a ground terminal Internet node via a Tracking and Data Rela Satellite (TDRS) transfer; Scenario 2: Unicast communications between a Low-Earth-Orbit (LEO) International Space Station and a ground terminal Internet node via a TDRS transfer; Scenario 3: Multicast Communications (or "Multicasting"), 1 Spacecraft to N Ground Receivers, N Ground Transmitters to 1 Ground Receiver via a Spacecraft.

  19. 14 CFR 121.95 - Route width.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false Route width. 121.95 Section 121.95 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED) AIR CARRIERS..., FLAG, AND SUPPLEMENTAL OPERATIONS Approval of Routes: Domestic and Flag Operations § 121.95 Route...

  20. 46 CFR 45.175 - Applicable routes.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 46 Shipping 2 2012-10-01 2012-10-01 false Applicable routes. 45.175 Section 45.175 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) LOAD LINES GREAT LAKES LOAD LINES Unmanned River Barges on Lake Michigan Routes § 45.175 Applicable routes. This subpart applies to the following...

  1. 46 CFR 45.175 - Applicable routes.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 46 Shipping 2 2013-10-01 2013-10-01 false Applicable routes. 45.175 Section 45.175 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) LOAD LINES GREAT LAKES LOAD LINES Unmanned River Barges on Lake Michigan Routes § 45.175 Applicable routes. This subpart applies to the following...

  2. 46 CFR 45.175 - Applicable routes.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 46 Shipping 2 2014-10-01 2014-10-01 false Applicable routes. 45.175 Section 45.175 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) LOAD LINES GREAT LAKES LOAD LINES Unmanned River Barges on Lake Michigan Routes § 45.175 Applicable routes. This subpart applies to the following...

  3. Make phloroglucinol by hydroperoxide route

    SciTech Connect

    Not Available

    1986-11-01

    This new industrial process produces phloroglucinol (1,3,5-trihydroxybenzene) from 1,3,5-triisopropylbenzene (TIP) by hydroperoxidation. Phloroglucinol is used as a pharmaceutical intermediate, and demand is expected to increase because of its application in diazo photo papers and intermediates for coupling agents. Phloroglucinol by the hydroperoxide route per se is known. However, these processes produce yields far too low for industrial practice. Phloroglucinol is presently manufactured in relatively small quantities from trinitrotoluene by a series of oxidation, decarbonylation, reduction and hydrolysis reactions. The process has safety and production cost problems. The application of phloroglucinol uses has not expanded because of these limitations. Development of a large-scale, more economical process was needed because there is a large potential market for phloroglucinol in photosensitive papers, photographic chemicals and other areas. Sumito Chemical has made extensive study of the hydroperoxide route to introduce hydroxyl groups into aromatic compounds. Commercial plants for cresol and resorcinol via the hydroperoxide route are in operation today.

  4. Corporations' Resistance to Innovation: The Adoption of the Internet Protocol Version 6

    ERIC Educational Resources Information Center

    Pazdrowski, Tomasz

    2013-01-01

    Computer networks that brought unprecedented growth in global communication have been using Internet Protocol version 4 (IPv4) as a standard for routing. The exponential increase in the use of the networks caused an acute shortage of available identification numbers (IP addresses). The shortage and other network communication issues are…

  5. Auto-configuration protocols in mobile ad hoc networks.

    PubMed

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    The TCP/IP protocol allows the different nodes in a network to communicate by associating a different IP address to each node. In wired or wireless networks with infrastructure, we have a server or node acting as such which correctly assigns IP addresses, but in mobile ad hoc networks there is no such centralized entity capable of carrying out this function. Therefore, a protocol is needed to perform the network configuration automatically and in a dynamic way, which will use all nodes in the network (or part thereof) as if they were servers that manage IP addresses. This article reviews the major proposed auto-configuration protocols for mobile ad hoc networks, with particular emphasis on one of the most recent: D2HCP. This work also includes a comparison of auto-configuration protocols for mobile ad hoc networks by specifying the most relevant metrics, such as a guarantee of uniqueness, overhead, latency, dependency on the routing protocol and uniformity. PMID:22163814

  6. Auto-Configuration Protocols in Mobile Ad Hoc Networks

    PubMed Central

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    The TCP/IP protocol allows the different nodes in a network to communicate by associating a different IP address to each node. In wired or wireless networks with infrastructure, we have a server or node acting as such which correctly assigns IP addresses, but in mobile ad hoc networks there is no such centralized entity capable of carrying out this function. Therefore, a protocol is needed to perform the network configuration automatically and in a dynamic way, which will use all nodes in the network (or part thereof) as if they were servers that manage IP addresses. This article reviews the major proposed auto-configuration protocols for mobile ad hoc networks, with particular emphasis on one of the most recent: D2HCP. This work also includes a comparison of auto-configuration protocols for mobile ad hoc networks by specifying the most relevant metrics, such as a guarantee of uniqueness, overhead, latency, dependency on the routing protocol and uniformity. PMID:22163814

  7. Underwater acoustic wireless sensor networks: advances and future trends in physical, MAC and routing layers.

    PubMed

    Climent, Salvador; Sanchez, Antonio; Capella, Juan Vicente; Meratnia, Nirvana; Serrano, Juan Jose

    2014-01-01

    This survey aims to provide a comprehensive overview of the current research on underwater wireless sensor networks, focusing on the lower layers of the communication stack, and envisions future trends and challenges. It analyzes the current state-of-the-art on the physical, medium access control and routing layers. It summarizes their security threads and surveys the currently proposed studies. Current envisioned niches for further advances in underwater networks research range from efficient, low-power algorithms and modulations to intelligent, energy-aware routing and medium access control protocols. PMID:24399155

  8. Underwater acoustic wireless sensor networks: advances and future trends in physical, MAC and routing layers.

    PubMed

    Climent, Salvador; Sanchez, Antonio; Capella, Juan Vicente; Meratnia, Nirvana; Serrano, Juan Jose

    2014-01-01

    This survey aims to provide a comprehensive overview of the current research on underwater wireless sensor networks, focusing on the lower layers of the communication stack, and envisions future trends and challenges. It analyzes the current state-of-the-art on the physical, medium access control and routing layers. It summarizes their security threads and surveys the currently proposed studies. Current envisioned niches for further advances in underwater networks research range from efficient, low-power algorithms and modulations to intelligent, energy-aware routing and medium access control protocols.

  9. Underwater Acoustic Wireless Sensor Networks: Advances and Future Trends in Physical, MAC and Routing Layers

    PubMed Central

    Climent, Salvador; Sanchez, Antonio; Capella, Juan Vicente; Meratnia, Nirvana; Serrano, Juan Jose

    2014-01-01

    This survey aims to provide a comprehensive overview of the current research on underwater wireless sensor networks, focusing on the lower layers of the communication stack, and envisions future trends and challenges. It analyzes the current state-of-the-art on the physical, medium access control and routing layers. It summarizes their security threads and surveys the currently proposed studies. Current envisioned niches for further advances in underwater networks research range from efficient, low-power algorithms and modulations to intelligent, energy-aware routing and medium access control protocols. PMID:24399155

  10. Clinical Protocol Information System

    PubMed Central

    Wirtschafter, David D.; Gams, Richard; Ferguson, Carol; Blackwell, William; Boackle, Paul

    1980-01-01

    The Clinical Protocol Information System (CPIS) supports the clinical research and patient care objectives of the SouthEastern Cancer Study Group (SEG). The information system goals are to improve the evaluability of clinical trials, decrease the frequency of adverse patient events, implement drug toxicity surveillance, improve the availability of study data and demonstrate the criteria for computer networks that can impact on the general medical care of the community. Nodes in the network consist of Data General MicroNova MP-100 minicomputers that drive the interactive data dialogue and communicate with the network concentrator (another DG MicroNova) in Birmingham. Functions supported include: source data editing, care “advice,” care “audit,” care “explanation,” and treatment note printing. The complete database is updated nightly and resides on UAB's IBM 370/158-AP.

  11. Optimal fully adaptive wormhole routing for meshes

    SciTech Connect

    Schwiebert, L.; Jayasimha, D.N.

    1993-12-31

    A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. The routing algorithm imposes less than half as many routing restrictions as any previous fully adaptive routing algorithm. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm that achieves both of these goals. The implementation of the routing algorithm requires relatively simple router control logic. The new algorithm is extended, in a straightforward manner to arbitrary dimension meshes. It needs only 4n-2 virtual channels, the minimum number for an n-dimensional mesh. All previous algorithms require an exponential number of virtual channels in the dimension of the mesh.

  12. Dynamic information routing in complex networks

    NASA Astrophysics Data System (ADS)

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

    2016-04-01

    Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function.

  13. Dynamic information routing in complex networks

    PubMed Central

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

    2016-01-01

    Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function. PMID:27067257

  14. Indoor air quality investigation protocols

    SciTech Connect

    Greene, R.E.; Williams, P.L.

    1996-10-01

    Over the past 10 to 15 years, an increasing number of complaints about discomfort and health effects related to indoor air quality (IAQ) have been reported. The increase in complaints has been accompanied by an increase in requests for IAQ investigations. This study presents an overview of the many IAQ investigation protocols published since 1984. For analysis, the protocols are divided into four categories: solution-oriented, building diagnostics, industrial hygiene, and epidemiology. In general, the protocols begin with general observations, proceed to collect more specific data as indicated, and end with conclusions and recommendations. A generic IAQ protocol is presented that incorporates the common aspects of the various protocols. All of the current protocols place heavy emphasis on the ventilation system during the investigation. A major problem affecting all of the current protocols is the lack of generally accepted IAQ standards. IN addition, the use of questionnaires, occupant interviews, and personal diaries (as well as the point in the investigation at which they are administered) differs among the protocols. Medical evaluations and verification procedures also differ among the protocols.

  15. A QoS-guaranteed coverage precedence routing algorithm for wireless sensor networks.

    PubMed

    Jiang, Joe-Air; Lin, Tzu-Shiang; Chuang, Cheng-Long; Chen, Chia-Pang; Sun, Chin-Hong; Juang, Jehn-Yih; Lin, Jiun-Chuan; Liang, Wei-Wen

    2011-01-01

    For mission-critical applications of wireless sensor networks (WSNs) involving extensive battlefield surveillance, medical healthcare, etc., it is crucial to have low-power, new protocols, methodologies and structures for transferring data and information in a network with full sensing coverage capability for an extended working period. The upmost mission is to ensure that the network is fully functional providing reliable transmission of the sensed data without the risk of data loss. WSNs have been applied to various types of mission-critical applications. Coverage preservation is one of the most essential functions to guarantee quality of service (QoS) in WSNs. However, a tradeoff exists between sensing coverage and network lifetime due to the limited energy supplies of sensor nodes. In this study, we propose a routing protocol to accommodate both energy-balance and coverage-preservation for sensor nodes in WSNs. The energy consumption for radio transmissions and the residual energy over the network are taken into account when the proposed protocol determines an energy-efficient route for a packet. The simulation results demonstrate that the proposed protocol is able to increase the duration of the on-duty network and provide up to 98.3% and 85.7% of extra service time with 100% sensing coverage ratio comparing with LEACH and the LEACH-Coverage-U protocols, respectively. PMID:22163804

  16. A network architecture for precision formation flying using the IEEE 802.11 MAC Protocol

    NASA Technical Reports Server (NTRS)

    Clare, Loren P.; Gao, Jay L.; Jennings, Esther H.; Okino, Clayton

    2005-01-01

    Precision Formation Flying missions involve the tracking and maintenance of spacecraft in a desired geometric formation. The strong coupling of spacecraft in formation flying control requires inter-spacecraft communication to exchange information. In this paper, we present a network architecture that supports PFF control, from the initial random deployment phase to the final formation. We show that a suitable MAC layer for the application protocol is IEEE's 802.11 MAC protocol. IEEE 802.11 MAC has two modes of operations: DCF and PCF. We show that DCF is suitable for the initial deployment phase while switching to PCF when the spacecraft are in formation improves jitter and throughput. We also consider the effect of routing on protocol performance and suggest when it is profitable to turn off route discovery to achieve better network performance.

  17. Improving Operational Acceptability of Dynamic Weather Routes Through Analysis of Commonly Use Routings

    NASA Technical Reports Server (NTRS)

    Evans, Antony D.; Sridhar, Banavar; McNally, David

    2016-01-01

    The Dynamic Weather Routes (DWR) tool is a ground-based trajectory automation system that continuously and automatically analyzes active in-flight aircraft in en route airspace to find simple modifications to flight plan routes that can save significant flying time, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. Trials of the DWR system have shown that significant delay savings are possible. However, some DWR advised routes are also rejected by dispatchers or modified before being accepted. Similarly, of those sent by dispatchers to flight crews as proposed route change requests, many are not accepted by air traffic control, or are modified before implementation as Center route amendments. Such actions suggest that the operational acceptability of DWR advised route corrections could be improved, which may reduce workload and increase delay savings. This paper analyzes the historical usage of different flight routings, varying from simple waypoint pairs to lengthy strings of waypoints incorporating jet routes, in order to improve DWR route acceptability. An approach is developed that can be incorporated into DWR, advising routings with high historical usage and savings potential similar to that of the nominal DWR advisory. It is hypothesized that modifying a nominal DWR routing to one that is commonly used, and nearby, will result in more actual savings since common routings are generally familiar and operationally acceptable to air traffic control. The approach allows routing segments with high historical usage to be concatenated to form routes that meet all DWR constraints. The relevance of a route's historical usage to its acceptance by dispatchers and air traffic control is quantified by analyzing historical DWR data. Results indicate that while historical usage may be less of a concern to flight dispatchers accepting or rejecting DWR advised route corrections, it may be

  18. Ant-based power efficient, adaptive, reliable, and load balanced (A-PEARL) routing for smart metering networks

    NASA Astrophysics Data System (ADS)

    Muraleedharan, Rajani

    2011-06-01

    The future of metering networks requires adaptation of different sensor technology while reducing energy exploitation. In this paper, a routing protocol with the ability to adapt and communicate reliably over varied IEEE standards is proposed. Due to sensor's resource constraints, such as memory, energy, processing power an algorithm that balances resources without compromising performance is preferred. The proposed A-PEARL protocol is tested under harsh simulated scenarios such as sensor failure and fading conditions. The inherent features of A-PEARL protocol such as data aggregation, fusion and channel hopping enables minimal resource consumption and secure communication.

  19. Performance analysis of precoding-based asymmetrically clipped optical orthogonal frequency division multiplexing wireless system in additive white Gaussian noise and indoor multipath channel

    NASA Astrophysics Data System (ADS)

    Ranjha, Bilal; Zhou, Zhou; Kavehrad, Mohsen

    2014-08-01

    We have compared the bit error rate (BER) performance of precoding-based asymmetrically clipped optical orthogonal frequency division multiplexing (ACO-OFDM) and pulse amplitude modulated discrete multitone (PAM-DMT) optical wireless (OW) systems in additive white Gaussian noise (AWGN) and indoor multipath frequency selective channel. Simulation and analytical results show that precoding schemes such as discrete Fourier transform, discrete cosine transform, and Zadoff-Chu sequences do not affect the performance of the OW systems in the AWGN channel while they do reduce the peak-to-average power ratio (PAPR) of the OFDM output signal. However, in a multipath indoor channel, using zero forcing frequency domain equalization precoding-based systems give better BER performance than their conventional counterparts. With additional clipping to further reduce the PAPR, precoding-based systems also show better BER performance compared to nonprecoded systems when clipped relative to the peak of nonprecoded systems. Therefore, precoding-based ACO-OFDM and PAM-DMT systems offer better BER performance, zero signaling overhead, and low PAPR compared to conventional systems.

  20. Performance of Reverse-Link Synchronous DS-CDMA System on a Frequency-Selective Multipath Fading Channel with Imperfect Power Control

    NASA Astrophysics Data System (ADS)

    Hwang, Seung-Hoon; Kim, Duk Kyung

    2002-12-01

    We analyze the performance for reverse-link synchronous DS-CDMA system in a frequency-selective Rayleigh fading channel with an imperfect power control scheme. The performance degradation due to power control error (PCE), which is approximated by a log-normally distributed random variable, is estimated as a function of the standard deviation of the PCE. In addition, we investigate the impacts of the multipath intensity profile (MIP) shape and the number of resolvable paths on the performance. Finally, the coded bit error performance is evaluated in order to estimate the system capacity. Comparing with the conventional CDMA system, we show an achievable gain of from 59% to 23% for reverse-link synchronous transmission technique (RLSTT) in the presence of imperfect power control over asynchronous transmission for[InlineEquation not available: see fulltext.]. As well, the effect of tradeoff between orthogonality and diversity can be seen according to the number of multipaths, and the tendency is kept even in the presence of PCE. We conclude that the capacity can be further improved via the RLSTT, because the DS-CDMA system is very sensitive to power control imperfections.

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

    PubMed

    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.

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

    PubMed

    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.

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

    PubMed

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

    2015-01-01

    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. PMID:26266412

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

    PubMed Central

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

    2015-01-01

    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. PMID:26266412

  5. Towards better GNSS observations at the new IGS reference station BRUX: multipath mitigation and individual antenna calibration

    NASA Astrophysics Data System (ADS)

    Aerts, W.; Baire, Q.; Bruyninx, C.; Legrand, J.; Pottiaux, E.

    2012-12-01

    A new multi-GNSS IGS reference station, BRUX, has been installed at Brussels. It replaces the former IGS reference station BRUS, which had to be dismantled because of construction works. The antenna of BRUX is sited on top of a telescope dome. Although this might be an unfortunate choice from an electromagnetic point of view, the siting is very convenient for other reasons. Being close to the time lab hosting the atomic clocks, the cable length is within acceptable and affordable limits, both for cost and signal loss reasons. Moreover, the site offers open sky view, which can indeed be expected from a former telescope siting. The dome is entirely metal, hence shielding of the dome was required in order to mitigate multipath propagation. This was achieved using a metal shield topped with RF absorbing material and respecting a certain antenna-to-absorber spacing in order not to alter the antenna phase center offset (PCO) and variations (PCVs) too much. This would otherwise render the individual calibration of the antenna, in an anechoic chamber in the case of BRUX, invalid. But even taking all precautions, the PCO and PCVs of the calibration do not exactly equal those after installation. Moreover, different calibrations, in an anechoic chamber and by an outdoor robot, of the same antenna have shown to result in PCO and PCVs that differ up to several mm at certain azimuths and elevations. A test set-up with 6 such redundantly calibrated GNSS antennas revealed that the calibration differences can reach 8 mm on the ionosphere-free frequency, which amplifies the calibration differences by a factor three compared to L1 and L2 only. The use of different receiver antenna calibration models can impact position at almost the centimeter level. In an attempt to align the historical time series for BRUS with the (future) data for BRUX, the tie between the new station BRUX and the old IGS station BRUS was determined using terrestrial measurements as well as GPS. In the case of

  6. LQER: A Link Quality Estimation based Routing for Wireless Sensor Networks

    PubMed Central

    Chen, Jiming; Lin, Ruizhong; Li, Yanjun; Sun, Youxian

    2008-01-01

    Routing protocols are crucial to self-organize wireless sensor networks (WSNs), which have been widely studied in recent years. For some specific applications, both energy aware and reliable data transmission need to be considered together. Historical link status should be captured and taken into account in making data forwarding decisions to achieve the data reliability and energy efficiency tradeoff. In this paper, a dynamic window concept (m, k) is presented to record the link historical information and a link quality estimation based routing protocol (LQER) are proposed, which integrates the approach of minimum hop field and (m, k). The performance of LQER is evaluated by extensive simulation experiments to be more energy-aware, with lower loss rate and better scalability than MHFR [1] and MCR [2]. Thus the WSNs with LQER get longer lifetime of networks and better link quality.

  7. A novel load-balanced fixed routing (LBFR) algorithm for wavelength routed optical networks

    NASA Astrophysics Data System (ADS)

    Shen, Gangxiang; Li, Yongcheng; Peng, Limei

    2011-11-01

    In the wavelength-routed optical transport networks, fixed shortest path routing is one of major lightpath service provisioning strategies, which shows simplicity in network control and operation. Specifically, once a shortest route is found for a node pair, the route is always used for any future lightpath service provisioning, which therefore does not require network control and management system to maintain any active network-wide link state database. On the other hand, the fixed shortest path routing strategy suffers from the disadvantage of unbalanced network traffic load distribution and network congestion because it keeps on employing the same fixed shortest route between each pair of nodes. To avoid the network congestion and meanwhile retain the operational simplicity, in this study we develop a Load-Balanced Fixed Routing (LBFR) algorithm. Through a training process based on a forecasted network traffic load matrix, the proposed algorithm finds a fixed (or few) route(s) for each node pair and employs the fixed route(s) for lightpath service provisioning. Different from the fixed shortest path routes between node pairs, these routes can well balance traffic load within the network when they are used for lightpath service provisioning. Compared to the traditional fixed shortest path routing algorithm, the LBFR algorithm can achieve much better lightpath blocking performance according to our simulation and analytical studies. Moreover, the performance improvement is more significant with the increase of network nodal degree.

  8. Publishing protocols for partnered research.

    PubMed

    Hysong, Sylvia J; Woodard, LeChauncy; Garvin, Jennifer H; Murawsky, Jeffrey; Petersen, Laura A

    2014-12-01

    Published scientific protocols are advocated as a means of controlling bias in research reporting. Indeed, many journals require a study protocol with manuscript submission. However, publishing protocols of partnered research (PPR) can be challenging in light of the research model's dynamic nature, especially as no current reporting standards exist. Nevertheless, as these protocols become more prevalent, a priori documentation of methods in partnered research studies becomes increasingly important. Using as illustration a suite of studies aimed at improving coordination and communication in the primary care setting, we sought to identify challenges in publishing PPR relative to traditional designs, present alternative solutions to PPR publication, and propose an initial checklist of content to be included in protocols of partnered research. Challenges to publishing PPR include reporting details of research components intended to be co-created with operational partners, changes to sampling and entry strategy, and alignment of scientific and operational goals. Proposed solutions include emulating reporting standards of qualitative research, participatory action research, and adaptive trial designs, as well as embracing technological tools that facilitate publishing adaptive protocols, with version histories that are able to be updated as major protocol changes occur. Finally, we present a proposed checklist of reporting elements for partnered research protocols. PMID:25355092

  9. The simulation of communication protocols

    NASA Astrophysics Data System (ADS)

    de Carvalho Viola, F. E.

    1985-12-01

    Simulators for communication protocols specified in the ESTELLE and LC/1 languages are developed. The general principles of protocol simulation are reviewed; ESTELLE and LC/1 are characterized; a prototype LC/1 simulator based on predicate Petri nets is described; and a detailed specification for a driving interface for an ESTELLE simulator is given.

  10. Publishing protocols for partnered research.

    PubMed

    Hysong, Sylvia J; Woodard, LeChauncy; Garvin, Jennifer H; Murawsky, Jeffrey; Petersen, Laura A

    2014-12-01

    Published scientific protocols are advocated as a means of controlling bias in research reporting. Indeed, many journals require a study protocol with manuscript submission. However, publishing protocols of partnered research (PPR) can be challenging in light of the research model's dynamic nature, especially as no current reporting standards exist. Nevertheless, as these protocols become more prevalent, a priori documentation of methods in partnered research studies becomes increasingly important. Using as illustration a suite of studies aimed at improving coordination and communication in the primary care setting, we sought to identify challenges in publishing PPR relative to traditional designs, present alternative solutions to PPR publication, and propose an initial checklist of content to be included in protocols of partnered research. Challenges to publishing PPR include reporting details of research components intended to be co-created with operational partners, changes to sampling and entry strategy, and alignment of scientific and operational goals. Proposed solutions include emulating reporting standards of qualitative research, participatory action research, and adaptive trial designs, as well as embracing technological tools that facilitate publishing adaptive protocols, with version histories that are able to be updated as major protocol changes occur. Finally, we present a proposed checklist of reporting elements for partnered research protocols.

  11. Using Reputation Systems and Non-Deterministic Routing to Secure Wireless Sensor Networks

    PubMed Central

    Moya, José M.; Vallejo, Juan Carlos; Fraga, David; Araujo, Álvaro; Villanueva, Daniel; de Goyeneche, Juan-Mariano

    2009-01-01

    Security in wireless sensor networks is difficult to achieve because of the resource limitations of the sensor nodes. We propose a trust-based decision framework for wireless sensor networks coupled with a non-deterministic routing protocol. Both provide a mechanism to effectively detect and confine common attacks, and, unlike previous approaches, allow bad reputation feedback to the network. This approach has been extensively simulated, obtaining good results, even for unrealistically complex attack scenarios. PMID:22412345

  12. Near real-time traffic routing

    NASA Technical Reports Server (NTRS)

    Yang, Chaowei (Inventor); Cao, Ying (Inventor); Xie, Jibo (Inventor); Zhou, Bin (Inventor)

    2012-01-01

    A near real-time physical transportation network routing system comprising: a traffic simulation computing grid and a dynamic traffic routing service computing grid. The traffic simulator produces traffic network travel time predictions for a physical transportation network using a traffic simulation model and common input data. The physical transportation network is divided into a multiple sections. Each section has a primary zone and a buffer zone. The traffic simulation computing grid includes multiple of traffic simulation computing nodes. The common input data includes static network characteristics, an origin-destination data table, dynamic traffic information data and historical traffic data. The dynamic traffic routing service computing grid includes multiple dynamic traffic routing computing nodes and generates traffic route(s) using the traffic network travel time predictions.

  13. Cascade defense via routing in complex networks

    NASA Astrophysics Data System (ADS)

    Xu, Xiao-Lan; Du, Wen-Bo; Hong, Chen

    2015-05-01

    As the cascading failures in networked traffic systems are becoming more and more serious, research on cascade defense in complex networks has become a hotspot in recent years. In this paper, we propose a traffic-based cascading failure model, in which each packet in the network has its own source and destination. When cascade is triggered, packets will be redistributed according to a given routing strategy. Here, a global hybrid (GH) routing strategy, which uses the dynamic information of the queue length and the static information of nodes' degree, is proposed to defense the network cascade. Comparing GH strategy with the shortest path (SP) routing, efficient routing (ER) and global dynamic (GD) routing strategies, we found that GH strategy is more effective than other routing strategies in improving the network robustness against cascading failures. Our work provides insight into the robustness of networked traffic systems.

  14. Isomorphic routing on a toroidal mesh

    NASA Technical Reports Server (NTRS)

    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.

  15. Zone routing in a torus network

    DOEpatents

    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.

  16. Label-based routing for a family of small-world Farey graphs

    PubMed Central

    Zhai, Yinhu; Wang, Yinhe

    2016-01-01

    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. PMID:27167605

  17. Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

    NASA Technical Reports Server (NTRS)

    Burleigh, Scott C.

    2008-01-01

    Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.

  18. Label-based routing for a family of small-world Farey graphs

    NASA Astrophysics Data System (ADS)

    Zhai, Yinhu; Wang, Yinhe

    2016-05-01

    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.

  19. Label-based routing for a family of small-world Farey graphs.

    PubMed

    Zhai, Yinhu; Wang, Yinhe

    2016-01-01

    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. PMID:27167605

  20. Label-based routing for a family of small-world Farey graphs.

    PubMed

    Zhai, Yinhu; Wang, Yinhe

    2016-01-01

    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.