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

Directory of Open Access Journals (Sweden)

A.V. Sutagundar

2013-03-01

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

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

Science.gov (United States)

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

2015-04-17

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

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

Directory of Open Access Journals (Sweden)

Ahmad Mohamad Mezher

2015-04-01

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

MultiPaths Revisited - A novel approach using OpenFlow-enabled devices

CERN Document Server

Al-Shabibi, Ali; Martin, Brian

2011-06-11

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

An Overlay Architecture for Throughput Optimal Multipath Routing

Science.gov (United States)

2017-01-14

maximum throughput. Finally, we propose a threshold-based policy (BP-T) and a heuristic policy (OBP), which dynamically control traffic bifurcations...network stability region is available . Second, given any subset of nodes that are controllable, we also wish to develop an optimal routing policy that...case when tunnels do not overlap. We also develop a heuristic overlay control policy for use on general topologies, and show through simulation that

Mitigation of multipath effect in GNSS short baseline positioning by the multipath hemispherical map

Science.gov (United States)

Dong, D.; Wang, M.; Chen, W.; Zeng, Z.; Song, L.; Zhang, Q.; Cai, M.; Cheng, Y.; Lv, J.

2016-03-01

Multipath is one major error source in high-accuracy GNSS positioning. Various hardware and software approaches are developed to mitigate the multipath effect. Among them the MHM (multipath hemispherical map) and sidereal filtering (SF)/advanced SF (ASF) approaches utilize the spatiotemporal repeatability of multipath effect under static environment, hence they can be implemented to generate multipath correction model for real-time GNSS data processing. We focus on the spatial-temporal repeatability-based MHM and SF/ASF approaches and compare their performances for multipath reduction. Comparisons indicate that both MHM and ASF approaches perform well with residual variance reduction (50 %) for short span (next 5 days) and maintains roughly 45 % reduction level for longer span (next 6-25 days). The ASF model is more suitable for high frequency multipath reduction, such as high-rate GNSS applications. The MHM model is easier to implement for real-time multipath mitigation when the overall multipath regime is medium to low frequency.

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

African Journals Online (AJOL)

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

One Kind of Routing Algorithm Modified in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Wei Ni Ni

2016-01-01

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

Performance evaluation of CPPM modulation in multi-path environments

International Nuclear Information System (INIS)

Tasev, Zarko; Kocarev, Ljupco

2003-01-01

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

Performance evaluation of CPPM modulation in multi-path environments

Energy Technology Data Exchange (ETDEWEB)

Tasev, Zarko E-mail: ztasev@ucsd.edu; Kocarev, Ljupco E-mail: lkocarev@ucsd.edu

2003-01-01

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

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

Science.gov (United States)

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

2017-04-01

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

Classification of Dynamic Vehicle Routing Systems

DEFF Research Database (Denmark)

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

2007-01-01

This chapter discusses important characteristics seen within dynamic vehicle routing problems. We discuss the differences between the traditional static vehicle routing problems and its dynamic counterparts. We give an in-depth introduction to the degree of dynamism measure which can be used to c...

Multipath Detection Using Boolean Satisfiability Techniques

Directory of Open Access Journals (Sweden)

Fadi A. Aloul

2011-01-01

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

Global Positioning System (GPS) Receiver Design For Multipaths Mitigation

National Research Council Canada - National Science Library

Gadallah, El-Sayed

1998-01-01

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

Performance Evaluation of Concurrent Multipath Video Streaming in Multihomed Mobile Networks

Directory of Open Access Journals (Sweden)

James Nightingale

2013-01-01

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

Distortion Cancellation via Polyphase Multipath Circuits

NARCIS (Netherlands)

Mensink, E.; Klumperink, Eric A.M.; Nauta, Bram

The central question of this paper is: can we enhance the spectral purity of nonlinear circuits with the help of polyphase multipath circuits. Polyphase multipath circuits are circuits with two or more paths that exploit phase differences between the paths to cancel unwanted signals. It turns out

Chaos-based wireless communication resisting multipath effects

Science.gov (United States)

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

2017-09-01

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

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

OpenAIRE

Dianjie Lu; Guijuan Zhang; Ren Han; Xiangwei Zheng; Hong Liu

2014-01-01

Wireless Sensor Networks (WSNs) are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficu...

Multipath modeling for aeronautical communications.

Science.gov (United States)

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.

Spectral Purity Enhancement via Polyphase Multipath Circuits

NARCIS (Netherlands)

Mensink, E.; Klumperink, Eric A.M.; Nauta, Bram

2004-01-01

The central question of this paper is: can we enhance the spectral purity of nonlinear circuits by using polyphase multipath circuits? The basic idea behind polyphase multipath circuits is to split the nonlinear circuits into two or more paths and exploit phase differences between these paths to

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

Science.gov (United States)

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

2015-01-01

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

Inverse Scattering in a Multipath Environment

Directory of Open Access Journals (Sweden)

A. Cuccaro

2016-09-01

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

Benefits Analysis of Multi-Center Dynamic Weather Routes

Science.gov (United States)

Sheth, Kapil; McNally, David; Morando, Alexander; Clymer, Alexis; Lock, Jennifer; Petersen, Julien

2014-01-01

Dynamic weather routes are flight plan corrections that can provide airborne flights more than user-specified minutes of flying-time savings, compared to their current flight plan. These routes are computed from the aircraft's current location to a flight plan fix downstream (within a predefined limit region), while avoiding forecasted convective weather regions. The Dynamic Weather Routes automation has been continuously running with live air traffic data for a field evaluation at the American Airlines Integrated Operations Center in Fort Worth, TX since July 31, 2012, where flights within the Fort Worth Air Route Traffic Control Center are evaluated for time savings. This paper extends the methodology to all Centers in United States and presents benefits analysis of Dynamic Weather Routes automation, if it was implemented in multiple airspace Centers individually and concurrently. The current computation of dynamic weather routes requires a limit rectangle so that a downstream capture fix can be selected, preventing very large route changes spanning several Centers. In this paper, first, a method of computing a limit polygon (as opposed to a rectangle used for Fort Worth Center) is described for each of the 20 Centers in the National Airspace System. The Future ATM Concepts Evaluation Tool, a nationwide simulation and analysis tool, is used for this purpose. After a comparison of results with the Center-based Dynamic Weather Routes automation in Fort Worth Center, results are presented for 11 Centers in the contiguous United States. These Centers are generally most impacted by convective weather. A breakdown of individual Center and airline savings is presented and the results indicate an overall average savings of about 10 minutes of flying time are obtained per flight.

Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Ricciardi, Sergio; Fagertun, Anna Manolova

2012-01-01

In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...

Analysis of Multipath Mitigation Techniques with Land Mobile Satellite Channel Model

Directory of Open Access Journals (Sweden)

M. Z. H. Bhuiyan J. Zhang

2012-12-01

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

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

Science.gov (United States)

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.

Analysis of multipath channel fading techniques in wireless communication systems

Science.gov (United States)

Mahender, Kommabatla; Kumar, Tipparti Anil; Ramesh, K. S.

2018-04-01

Multipath fading occurs in any environment where there is multipath propagation and there is some movement of elements within the radio communications system. This may include the radio transmitter or receiver position, or in the elements that give rise to the reflections. The multipath fading can often be relatively deep, i.e. the signals fade completely away, whereas at other times the fading may not cause the signal to fall below a useable strength. Multipath fading may also cause distortion to the radio signal. As the various paths that can be taken by the signals vary in length, the signal transmitted at a particular instance will arrive at the receiver over a spread of times. This can cause problems with phase distortion and inter symbol interference when data transmissions are made. As a result, it may be necessary to incorporate features within the radio communications system that enables the effects of these problems to be minimized. This paper analyses the effects of various types of multipath fading in wireless transmission system.

Statistical Multipath Model Based on Experimental GNSS Data in Static Urban Canyon Environment

Directory of Open Access Journals (Sweden)

Yuze Wang

2018-04-01

Full Text Available A deep understanding of multipath characteristics is essential to design signal simulators and receivers in global navigation satellite system applications. As a new constellation is deployed and more applications occur in the urban environment, the statistical multipath models of navigation signal need further study. In this paper, we present statistical distribution models of multipath time delay, multipath power attenuation, and multipath fading frequency based on the experimental data in the urban canyon environment. The raw data of multipath characteristics are obtained by processing real navigation signal to study the statistical distribution. By fitting the statistical data, it shows that the probability distribution of time delay follows a gamma distribution which is related to the waiting time of Poisson distributed events. The fading frequency follows an exponential distribution, and the mean of multipath power attenuation decreases linearly with an increasing time delay. In addition, the detailed statistical characteristics for different elevations and orbits satellites is studied, and the parameters of each distribution are quite different. The research results give useful guidance for navigation simulator and receiver designers.

Ultrasonic imaging of material flaws exploiting multipath information

Science.gov (United States)

Shen, Xizhong; Zhang, Yimin D.; Demirli, Ramazan; Amin, Moeness G.

2011-05-01

In this paper, we consider ultrasonic imaging for the visualization of flaws in a material. Ultrasonic imaging is a powerful nondestructive testing (NDT) tool which assesses material conditions via the detection, localization, and classification of flaws inside a structure. Multipath exploitations provide extended virtual array apertures and, in turn, enhance imaging capability beyond the limitation of traditional multisensor approaches. We utilize reflections of ultrasonic signals which occur when encountering different media and interior discontinuities. The waveforms observed at the physical as well as virtual sensors yield additional measurements corresponding to different aspect angles. Exploitation of multipath information addresses unique issues observed in ultrasonic imaging. (1) Utilization of physical and virtual sensors significantly extends the array aperture for image enhancement. (2) Multipath signals extend the angle of view of the narrow beamwidth of the ultrasound transducers, allowing improved visibility and array design flexibility. (3) Ultrasonic signals experience difficulty in penetrating a flaw, thus the aspect angle of the observation is limited unless access to other sides is available. The significant extension of the aperture makes it possible to yield flaw observation from multiple aspect angles. We show that data fusion of physical and virtual sensor data significantly improves the detection and localization performance. The effectiveness of the proposed multipath exploitation approach is demonstrated through experimental studies.

On joint power allocation and multipath routing in femto-relay networks

OpenAIRE

Hoteit , Sahar; Duhamel , Pierre; Lasaulce , Samson

2016-01-01

International audience; —Transmit power allocation techniques are very important to manage interference in small-cell networks. While available power allocation algorithms in the literature rely on a predefined routing protocol, we propose in this paper a power-efficient two-step algorithm that allows power allocation and routing to be performed jointly in femto-relay networks. First, we propose an interference-based partitioning method to cluster the femto-relays, then we adopt an iterative ...

Automated Flight Routing Using Stochastic Dynamic Programming

Science.gov (United States)

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

2010-01-01

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

Phone Routing using the Dynamic Memory Model

DEFF Research Database (Denmark)

Bendtsen, Claus Nicolaj; Krink, Thiemo

2002-01-01

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

Dynamic Weather Routes Architecture Overview

Science.gov (United States)

Eslami, Hassan; Eshow, Michelle

2014-01-01

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

Dynamic Escape Routes for Naval Ships

National Research Council Canada - National Science Library

Villalonga, Francisco J

2005-01-01

This thesis addresses the problem of optimal evacuation of a naval ship. We propose the use of a dynamic escape-route system which employs a signaling system to adapt the emergency egress process to the instigating contingency...

OpenVPN and Multipath TCP

OpenAIRE

Paulus, Aloïs

2015-01-01

Testing the performances of using Multipath TCP and OpenVPN on a consumer grade router to aggregate multiple Internet connections and provide a fast and reliable connection to individuals and small companies. Master [60] en sciences informatiques, Université catholique de Louvain, 2015

LoRa Performance under Variable Interference and Heavy-Multipath Conditions

Directory of Open Access Journals (Sweden)

Kamil Staniec

2018-01-01

Full Text Available LoRa (or LoRaWAN is by far the best known representative of narrowband communication systems designed for the Internet of Things. As a system dedicated specifically for long-range operations, it possesses a considerable processing gain for the energetic link budget improvement and a remarkable immunity to multipath and interference. The paper describes outcomes of measurement campaigns during which the LoRa performance was tested against these two factors, that is, a heavy-multipath propagation and a controlled, variable interference generated, respectively, in a reverberation chamber and an anechoic chamber. Results allow quantitative appraisal of the system behavior under these harsh conditions with respect to LoRa’s three major configurable parameters: the spreading factor, bandwidth, and code rate. They also allow dividing LoRa configurational space into three distinct sensitivity regions: in the white region it is immune to both interference and multipath propagation, in the light-grey region it is only immune to the multipath phenomenon but sensitive to interference, and in the dark grey region LoRa is vulnerable to both phenomena.

Cross-Correlation-Function-Based Multipath Mitigation Method for Sine-BOC Signals

Directory of Open Access Journals (Sweden)

H. H. Chen

2012-06-01

Full Text Available Global Navigation Satellite Systems (GNSS positioning accuracy indoor and urban canyons environments are greatly affected by multipath due to distortions in its autocorrelation function. In this paper, a cross-correlation function between the received sine phased Binary Offset Carrier (sine-BOC modulation signal and the local signal is studied firstly, and a new multipath mitigation method based on cross-correlation function for sine-BOC signal is proposed. This method is implemented to create a cross-correlation function by designing the modulated symbols of the local signal. The theoretical analysis and simulation results indicate that the proposed method exhibits better multipath mitigation performance compared with the traditional Double Delta Correlator (DDC techniques, especially the medium/long delay multipath signals, and it is also convenient and flexible to implement by using only one correlator, which is the case of low-cost mass-market receivers.

The Dynamic Multi-Period Vehicle Routing Problem

DEFF Research Database (Denmark)

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

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

Target Localization with a Single Antenna via Directional Multipath Exploitation

Directory of Open Access Journals (Sweden)

Ali H. Muqaibel

2015-01-01

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

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

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2017-02-01

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

Vehicle routing with dynamic travel times : a queueing approach

NARCIS (Netherlands)

Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.

2008-01-01

Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routes is a crucial management problem. In this paper, a vehicle routing problem with dynamic

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

African Journals Online (AJOL)

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

A dynamic routing strategy with limited buffer on scale-free network

Science.gov (United States)

Wang, Yufei; Liu, Feng

2016-04-01

In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

Towards Internet QoS provisioning based on generic distributed QoS adaptive routing engine.

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Amira Y. Haikal

2014-01-01

Full Text Available 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.

Characterization of Static/Dynamic Topological Routing For Grid Networks

DEFF Research Database (Denmark)

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

2009-01-01

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

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

African Journals Online (AJOL)

Cilence Munghemezulu

Mapping GPS Multipath: a Case Study for the Lunar Laser .... assess the level of multipath in the vicinity of the GNSS antenna by making use of ..... navigation in urban environment', Indian Journal of Radio and Space Physics, vol. ... Torrence C & Compo GP 1998, 'A practical guide to wavelet Analysis', Bulletin of the ...

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

Directory of Open Access Journals (Sweden)

Shereen Omar

2017-01-01

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

Multipathing Via Three Parameter Common Image Gathers (CIGs) From Reverse Time Migration

Science.gov (United States)

Ostadhassan, M.; Zhang, X.

2015-12-01

A noteworthy problem for seismic exploration is effects of multipathing (both wanted or unwanted) caused by subsurface complex structures. We show that reverse time migration (RTM) combined with a unified, systematic three parameter framework that flexibly handles multipathing can be accomplished by adding one more dimension (image time) to the angle domain common image gather (ADCIG) data. RTM is widely used to generate prestack depth migration images. When using the cross-correlation image condition in 2D prestack migration in RTM, the usual practice is to sum over all the migration time steps. Thus all possible wave types and paths automatically contribute to the resulting image, including destructive wave interferences, phase shifts, and other distortions. One reason is that multipath (prismatic wave) contributions are not properly sorted and mapped in the ADCIGs. Also, multipath arrivals usually have different instantaneous attributes (amplitude, phase and frequency), and if not separated, the amplitudes and phases in the final prestack image will not stack coherently across sources. A prismatic path satisfies an image time for it's unique path; Cavalca and Lailly (2005) show that RTM images with multipaths can provide more complete target information in complex geology, as multipaths usually have different incident angles and amplitudes compared to primary reflections. If the image time slices within a cross-correlation common-source migration are saved for each image time, this three-parameter (incident angle, depth, image time) volume can be post-processed to generate separate, or composite, images of any desired subset of the migrated data. Images can by displayed for primary contributions, any combination of primary and multipath contributions (with or without artifacts), or various projections, including the conventional ADCIG (angle vs depth) plane. Examples show that signal from the true structure can be separated from artifacts caused by multiple

Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Roy Sohini

2015-09-01

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

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

Science.gov (United States)

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

2017-12-01

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

A Simulation-Based Dynamic Stochastic Route Choice Model for Evacuation

Directory of Open Access Journals (Sweden)

Xing Zhao

2012-01-01

Full Text Available This paper establishes a dynamic stochastic route choice model for evacuation to simulate the propagation process of traffic flow and estimate the stochastic route choice under evacuation situations. The model contains a lane-group-based cell transmission model (CTM which sets different traffic capacities for links with different turning movements to flow out in an evacuation situation, an actual impedance model which is to obtain the impedance of each route in time units at each time interval and a stochastic route choice model according to the probit-based stochastic user equilibrium. In this model, vehicles loading at each origin at each time interval are assumed to choose an evacuation route under determinate road network, signal design, and OD demand. As a case study, the proposed model is validated on the network nearby Nanjing Olympic Center after the opening ceremony of the 10th National Games of the People's Republic of China. The traffic volumes and clearing time at five exit points of the evacuation zone are calculated by the model to compare with survey data. The results show that this model can appropriately simulate the dynamic route choice and evolution process of the traffic flow on the network in an evacuation situation.

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

Science.gov (United States)

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

1972-01-01

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

Congested Link Inference Algorithms in Dynamic Routing IP Network

Directory of Open Access Journals (Sweden)

Yu Chen

2017-01-01

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

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

Science.gov (United States)

Mahendra, Chetan; Puthusserypady, Sadasivan

2006-11-01

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

RELIABLE DYNAMIC SOURCE ROUTING PROTOCOL (RDSRP FOR ENERGY HARVESTING WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

B. Narasimhan

2015-03-01

Full Text Available Wireless sensor networks (WSNs carry noteworthy pros over traditional communication. Though, unkind and composite environments fake great challenges in the reliability of WSN communications. It is more vital to develop a reliable unipath dynamic source routing protocol (RDSRPl for WSN to provide better quality of service (QoS in energy harvesting wireless sensor networks (EH-WSN. This paper proposes a dynamic source routing approach for attaining the most reliable route in EH-WSNs. Performance evaluation is carried out using NS-2 and throughput and packet delivery ratio are chosen as the metrics.

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

Science.gov (United States)

Wu, Xuerui; Jin, Shuanggen; Xia, Junming

2017-06-05

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

Performance analysis of passive time reversal communication technique for multipath interference in shallow sea acoustic channel

Science.gov (United States)

Kida, Yukihiro; Shimura, Takuya; Deguchi, Mitsuyasu; Watanabe, Yoshitaka; Ochi, Hiroshi; Meguro, Koji

2017-07-01

In this study, the performance of passive time reversal (PTR) communication techniques in multipath rich underwater acoustic environments is investigated. It is recognized empirically and qualitatively that a large number of multipath arrivals could generally raise the demodulation result of PTR. However, the relationship between multipath and the demodulation result is hardly evaluated quantitatively. In this study, the efficiency of the PTR acoustic communication techniques for multipath interference cancelation was investigated quantitatively by applying a PTR-DFE (decision feed-back filter) scheme to a synthetic dataset of a horizontal underwater acoustic channel. Mainly, in this study, we focused on the relationship between the signal-to-interference ratio (SIR) of datasets and the output signal-to-noise ratio (OSNR) of demodulation results by a parametric study approach. As a result, a proportional relation between SIR and OSNR is confirmed in low-SNR datasets. It was also found that PTR has a performance limitation, that is OSNR converges to a typical value depending on the number of receivers. In conclusion, results indicate that PTR could utilize the multipath efficiently and also withstand the negative effects of multipath interference at a given limitation.

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

Directory of Open Access Journals (Sweden)

Admir Barolli

2011-01-01

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

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

Directory of Open Access Journals (Sweden)

Špánik Peter

2017-12-01

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

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

Directory of Open Access Journals (Sweden)

Béla Almási

2016-01-01

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

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Francisco José Estévez

2016-06-01

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

Role of Distance-Based Routing in Traffic Dynamics on Mobile Networks

Science.gov (United States)

Yang, Han-Xin; Wang, Wen-Xu

2013-06-01

Despite of intensive investigations on transportation dynamics taking place on complex networks with fixed structures, a deep understanding of networks consisting of mobile nodes is challenging yet, especially the lacking of insight into the effects of routing strategies on transmission efficiency. We introduce a distance-based routing strategy for networks of mobile agents toward enhancing the network throughput and the transmission efficiency. We study the transportation capacity and delivering time of data packets associated with mobility and communication ability. Interestingly, we find that the transportation capacity is optimized at moderate moving speed, which is quite different from random routing strategy. In addition, both continuous and discontinuous transitions from free flow to congestions are observed. Degree distributions are explored in order to explain the enhancement of network throughput and other observations. Our work is valuable toward understanding complex transportation dynamics and designing effective routing protocols.

ANALYSIS OF MULTIPATH PIXELS IN SAR IMAGES

Directory of Open Access Journals (Sweden)

J. W. Zhao

2016-06-01

Full Text Available 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, permittivitywhich 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.

Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

International Nuclear Information System (INIS)

Xie Wei-Hao; Zhou Bin; Liu En-Xiao; Lu Wei-Dang; Zhou Ting

2015-01-01

Many real communication networks, such as oceanic monitoring network and land environment observation network, can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue (HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue (HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity. (paper)

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

Directory of Open Access Journals (Sweden)

Srinivasan Murali

2007-01-01

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

SAR Image Simulation of Ship Targets Based on Multi-Path Scattering

Science.gov (United States)

Guo, Y.; Wang, H.; Ma, H.; Li, K.; Xia, Z.; Hao, Y.; Guo, H.; Shi, H.; Liao, X.; Yue, H.

2018-04-01

Synthetic Aperture Radar (SAR) plays an important role in the classification and recognition of ship targets because of its all-weather working ability and fine resolution. In SAR images, besides the sea clutter, the influence of the sea surface on the radar echo is also known as the so-called multipath effect. These multipath effects will generate some extra "pseudo images", which may cause the distortion of the target image and affect the estimation of the characteristic parameters. In this paper,the multipath effect of rough sea surface and its influence on the estimation of ship characteristic parameters are studied. The imaging of the first and the secondary reflection of sea surface is presented . The artifacts not only overlap with the image of the target itself, but may also appear in the sea near the target area. It is difficult to distinguish them, and this artifact has an effect on the length and width of the ship.

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

Science.gov (United States)

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

2015-01-01

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

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

Science.gov (United States)

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

2015-01-01

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

A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Shifeng Chen

2017-09-01

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

Robust OFDM Timing Synchronisation in Multipath Channels

Directory of Open Access Journals (Sweden)

McLaughlin S

2008-01-01

Full Text Available Abstract This paper addresses pre-FFT synchronisation for orthogonal frequency division multiplex (OFDM under varying multipath conditions. To ensure the most efficient data transmission possible, there should be no constraints on how much of the cyclic prefix (CP is occupied by intersymbol interference (ISI. Here a solution for timing synchronisation is proposed, that is, robust even when the strongest multipath components are delayed relative to the first arriving paths. In this situation, existing methods perform poorly, whereas the solution proposed uses the derivative of the correlation function and is less sensitive to the channel impulse response. In this paper, synchronisation of a DVB single-frequency network is investigated. A refinement is proposed that uses heuristic rules based on the maxima of the correlation and derivative functions to further reduce the estimate variance. The technique has relevance to broadcast, OFDMA, and WLAN applications, and simulations are presented which compare the method with existing approaches.

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

Directory of Open Access Journals (Sweden)

Dongshuang Li

2018-05-01

Full Text Available The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.

Spatial Dynamics of Indoor Radio Wideband Channels

Directory of Open Access Journals (Sweden)

Hayar Aawatif

2010-01-01

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

Performance of an Orthogonal Multicarrier CDMA System in a Multicell/Multipath Environment

Energy Technology Data Exchange (ETDEWEB)

Yoon, W.S. [Ajou University, Suwon (Korea)

1999-08-01

We have considered an improved orthogonal multicarrier (MC) CDMA system. This system combines the advantages of both DS-CDMA with a concatenated spreading scheme and an MC modulation technique to combat the effects of a multipath fading channel and intersymbol interference (IS). The performance of the system is analyzed under a multicell, multiuser, and multipath Rician fading channel. The system is shown to outperform the orthogonal MC-CDMA system with a conventional PN sequence. (author). 4 refs., 3 figs.

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

Directory of Open Access Journals (Sweden)

DING Yulin

2016-12-01

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

Multipath TCP for user cooperation in wireless networks

CERN Document Server

Zhou, Dizhi

2014-01-01

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

A Simplified Multipath Component Modeling Approach for High-Speed Train Channel Based on Ray Tracing

Directory of Open Access Journals (Sweden)

Jingya Yang

2017-01-01

Full Text Available High-speed train (HST communications at millimeter-wave (mmWave band have received a lot of attention due to their numerous high-data-rate applications enabling smart rail mobility. Accurate and effective channel models are always critical to the HST system design, assessment, and optimization. A distinctive feature of the mmWave HST channel is that it is rapidly time-varying. To depict this feature, a geometry-based multipath model is established for the dominant multipath behavior in delay and Doppler domains. Because of insufficient mmWave HST channel measurement with high mobility, the model is developed by a measurement-validated ray tracing (RT simulator. Different from conventional models, the temporal evolution of dominant multipath behavior is characterized by its geometry factor that represents the geometrical relationship of the dominant multipath component (MPC to HST environment. Actually, during each dominant multipath lifetime, its geometry factor is fixed. To statistically model the geometry factor and its lifetime, the dominant MPCs are extracted within each local wide-sense stationary (WSS region and are tracked over different WSS regions to identify its “birth” and “death” regions. Then, complex attenuation of dominant MPC is jointly modeled by its delay and Doppler shift both which are derived from its geometry factor. Finally, the model implementation is verified by comparison between RT simulated and modeled delay and Doppler spreads.

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

Directory of Open Access Journals (Sweden)

Jianping Du

2018-03-01

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

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

Science.gov (United States)

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

2018-03-17

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

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

Science.gov (United States)

Yu, Hongyi

2018-01-01

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

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

Directory of Open Access Journals (Sweden)

Dianjie Lu

2014-05-01

Full Text Available Wireless Sensor Networks (WSNs are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficult in the scenario of multiple sessions since different source-destination pairs may pass the same link which makes the flow distribution of each link uncertain. Our goal is to minimize the energy cost and provide the robust transmission by choosing the optimal paths. We first study the problem from a theoretical standpoint by mapping it to the multi-commodity network design problem. Since it is hard to build a global addressing scheme due to the great number of sensor nodes, we propose a Distributed Energy Efficient Routing protocol (D2ER. In D2ER, we employ the transportation method which can optimize the flow distribution with minimal energy consumption. Simulation results demonstrate that our optimal algorithm can save energy drastically.

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

Science.gov (United States)

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

2016-09-05

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

SDN-enabled dynamic WDM networks to address routing information inaccuracy

CSIR Research Space (South Africa)

Ravhuanzwo, Lusani

2016-11-01

Full Text Available Large dynamic wavelength-division multiplexed (WDM) networks based on the distributed control mechanism are susceptible to routing information inaccuracies. Factors such as non-negligible propagation delays, infrequent network state updates...

Mitigating Receiver’s Buffer Blocking by Delay Aware Packet Scheduling in Multipath Data Transfer

OpenAIRE

Sarwar, Golam; Boreli, Roksana; Lochin, Emmanuel; Mifdaoui, Ahlem; Smith, Guillaume

2013-01-01

Reliable in-order multi-path data transfer under asymmetric heterogeneous network conditions has known problems related to receiver's buffer blocking, caused by out of order packet arrival. Consequently, the aggregate capacity from multiple paths, which theoretically should be available to and achievable by the multi-path transport protocol, is practically severely underutilized. Several mitigation techniques have been proposed to address this issue mostly by using various packet retransmissi...

Multipath interference test method for distributed amplifiers

Science.gov (United States)

Okada, Takahiro; Aida, Kazuo

2005-12-01

A method for testing distributed amplifiers is presented; the multipath interference (MPI) is detected as a beat spectrum between the multipath signal and the direct signal using a binary frequency shifted keying (FSK) test signal. The lightwave source is composed of a DFB-LD that is directly modulated by a pulse stream passing through an equalizer, and emits the FSK signal of the frequency deviation of about 430MHz at repetition rate of 80-100 kHz. The receiver consists of a photo-diode and an electrical spectrum analyzer (ESA). The base-band power spectrum peak appeared at the frequency of the FSK frequency deviation can be converted to amount of MPI using a calibration chart. The test method has improved the minimum detectable MPI as low as -70 dB, compared to that of -50 dB of the conventional test method. The detailed design and performance of the proposed method are discussed, including the MPI simulator for calibration procedure, computer simulations for evaluating the error caused by the FSK repetition rate and the fiber length under test and experiments on singlemode fibers and distributed Raman amplifier.

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions.

Science.gov (United States)

Khan, Anwar; Ali, Ihsan; Ghani, Abdullah; Khan, Nawsher; Alsaqer, Mohammed; Rahman, Atiq Ur; Mahmood, Hasan

2018-05-18

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described

Multicast routing for wavelength-routed WDM networks with dynamic membership

Science.gov (United States)

Huang, Nen-Fu; Liu, Te-Lung; Wang, Yao-Tzung; Li, Bo

2000-09-01

Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work, we explore the optical link control layer on the top of optical layer that enables the possibility of bandwidth on-demand service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over the optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to joint a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as less as possible. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.

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

Science.gov (United States)

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

2018-01-12

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

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

Directory of Open Access Journals (Sweden)

Qiuzhao Zhang

2018-01-01

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

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

DEFF Research Database (Denmark)

Stephansen, E.; Mogensen, G.

1979-01-01

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

Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

Science.gov (United States)

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.

FPGA Dynamic Power Minimization through Placement and Routing Constraints

Directory of Open Access Journals (Sweden)

Deepak Agarwal

2006-08-01

Full Text Available Field-programmable gate arrays (FPGAs are pervasive in embedded systems requiring low-power utilization. A novel power optimization methodology for reducing the dynamic power consumed by the routing of FPGA circuits by modifying the constraints applied to existing commercial tool sets is presented. The power optimization techniques influence commercial FPGA Place and Route (PAR tools by translating power goals into standard throughput and placement-based constraints. The Low-Power Intelligent Tool Environment (LITE is presented, which was developed to support the experimentation of power models and power optimization algorithms. The generated constraints seek to implement one of four power optimization approaches: slack minimization, clock tree paring, N-terminal net colocation, and area minimization. In an experimental study, we optimize dynamic power of circuits mapped into 0.12 μm Xilinx Virtex-II FPGAs. Results show that several optimization algorithms can be combined on a single design, and power is reduced by up to 19.4%, with an average power savings of 10.2%.

Development and testing of a new ray-tracing approach to GNSS carrier-phase multipath modelling

Science.gov (United States)

Lau, Lawrence; Cross, Paul

2007-11-01

Multipath is one of the most important error sources in Global Navigation Satellite System (GNSS) carrier-phase-based precise relative positioning. Its theoretical maximum is a quarter of the carrier wavelength (about 4.8 cm for the Global Positioning System (GPS) L1 carrier) and, although it rarely reaches this size, it must clearly be mitigated if millimetre-accuracy positioning is to be achieved. In most static applications, this may be accomplished by averaging over a sufficiently long period of observation, but in kinematic applications, a modelling approach must be used. This paper is concerned with one such approach: the use of ray-tracing to reconstruct the error and therefore remove it. In order to apply such an approach, it is necessary to have a detailed understanding of the signal transmitted from the satellite, the reflection process, the antenna characteristics and the way that the reflected and direct signal are processed within the receiver. This paper reviews all of these and introduces a formal ray-tracing method for multipath estimation based on precise knowledge of the satellite reflector antenna geometry and of the reflector material and antenna characteristics. It is validated experimentally using GPS signals reflected from metal, water and a brick building, and is shown to be able to model most of the main multipath characteristics. The method will have important practical applications for correcting for multipath in well-constrained environments (such as at base stations for local area GPS networks, at International GNSS Service (IGS) reference stations, and on spacecraft), and it can be used to simulate realistic multipath errors for various performance analyses in high-precision positioning.

Over-the-Horizon Radar Multipath and Multisensor Track Fusion Algorithm Development

National Research Council Canada - National Science Library

Sarunic, P

2001-01-01

.... However the data is often subject to ambiguity and uncertainty due to the complexities of the HF signal propagation environment, which give rise to multipath OTHR tracks, as well as ambiguities...

Weighted OFDM for wireless multipath channels

DEFF Research Database (Denmark)

Prasad, Ramjee; Nikookar, H.

2000-01-01

In this paper the novel method of "weighted OFDM" is addressed. Different types of weighting factors (including Rectangular, Bartlett, Gaussian. Raised cosine, Half-sin and Shanon) are considered. The impact of weighting of OFDM on the peak-to-average power ratio (PAPR) is investigated by means...... of simulation and is compared for the above mentioned weighting factors. Results show that by weighting of the OFDM signal the PAPR reduces. Bit error performance of weighted multicarrier transmission over a multipath channel is also investigated. Results indicate that there is a trade off between PAPR...

A reliability-based approach of fastest routes planning in dynamic traffic network under emergency management situation

Directory of Open Access Journals (Sweden)

Ye Sun

2011-12-01

Full Text Available In order to establish an available emergency management system, it is important to conduct effective evacuation with reliable and real time optimal route plans. This paper aims at creating a route finding strategy by considering the time dependent factors as well as uncertainties that may be encountered during the emergency management system. To combine dynamic features with the level of reliability in the process of fastest route planning, the speed distribution of typical intercity roads is studied in depth, and the strategy of modifying real time speed to a more reliable value based on speed distribution is proposed. Two algorithms of route planning have been developed to find three optimal routes with the shortest travel time and the reliability of 0.9. In order to validate the new strategy, experimental implementation of the route planning method is conducted based on road speed information acquired by field study. The results show that the proposed strategy might provide more reliable routes in dynamic traffic networks by conservatively treating roads with large speed discretion or with relative extreme real speed value.

Improving the road network performance with dynamic route guidance by considering the indifference band of road users

NARCIS (Netherlands)

Vreeswijk, J.D.; Landman, R.L.; Van Berkum, E.C.; Hegyi, A.; Hoogendoorn, S.P.; Van Arem, B.

2012-01-01

When applying dynamic route guidance to improve the network performance, it is important to balance the interests of the road authorities and the road users. In this paper we will illustrate how bounded rationality and indifference bands can be taken into account in dynamic route guidance to improve

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

Directory of Open Access Journals (Sweden)

Maksim Kitsak

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

Towards suppression of all harmonics in a polyphase multipath transmitter

NARCIS (Netherlands)

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

2011-01-01

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

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

NARCIS (Netherlands)

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

2008-01-01

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

Modeling of Doppler frequency shift in multipath radio channels

Directory of Open Access Journals (Sweden)

Penzin M.S.

2016-06-01

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

Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

Directory of Open Access Journals (Sweden)

Yingcheng Xu

2013-01-01

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

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

Directory of Open Access Journals (Sweden)

Joseph Y.J. Chow

2016-10-01

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

Determination of scattering center of multipath signals using geometric optics and Fresnel zone concepts

Directory of Open Access Journals (Sweden)

Kamil Yavuz Kapusuz

2014-06-01

Full Text Available In this study, a method for determining scattering center (or center of scattering points of a multipath is proposed, provided that the direction of arrival of the multipath is known by the receiver. The method is based on classical electromagnetic wave principles in order to determine scattering center over irregular terrain. Geometrical optics (GO along with Fresnel zone concept is employed, as the receiver, the transmitter positions and irregular terrain data are assumed to be provided. The proposed method could be used at UHF bands, especially, operations of radars and electronic warfare applications.

Short Term Strategies for a Dynamic Multi-Period Routing Problem

NARCIS (Netherlands)

Angelelli, E.; Bianchessi, N.; Mansini, R.; Speranza, M. G.

2009-01-01

We consider a Dynamic Multi-Period Routing Problem (DMPRP) faced by a company which deals with on-line pick-up requests and has to serve them by a fleet of uncapacitated vehicles over a finite time horizon. When a request is issued, a deadline of a given number of days d ≤ 2 is associated to it: if

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

Directory of Open Access Journals (Sweden)

Markku Renfors

2007-12-01

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

Proposal for automated transformations on single-photon multipath qudits

Science.gov (United States)

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

2017-09-01

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

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

Directory of Open Access Journals (Sweden)

Tan Yun-hua

2015-10-01

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

Bellman Ford algorithm - in Routing Information Protocol (RIP)

Science.gov (United States)

Krianto Sulaiman, Oris; Mahmud Siregar, Amir; Nasution, Khairuddin; Haramaini, Tasliyah

2018-04-01

In a large scale network need a routing that can handle a lot number of users, one of the solutions to cope with large scale network is by using a routing protocol, There are 2 types of routing protocol that is static and dynamic, Static routing is manually route input based on network admin, while dynamic routing is automatically route input formed based on existing network. Dynamic routing is efficient used to network extensively because of the input of route automatic formed, Routing Information Protocol (RIP) is one of dynamic routing that uses the bellman-ford algorithm where this algorithm will search for the best path that traversed the network by leveraging the value of each link, so with the bellman-ford algorithm owned by RIP can optimize existing networks.

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

Science.gov (United States)

Bulczak, David; Lambers, Martin; Kolb, Andreas

2017-12-22

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

Quantified, Interactive Simulation of AMCW ToF Camera Including Multipath Effects

Directory of Open Access Journals (Sweden)

David Bulczak

2017-12-01

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

Dynamic vehicle routing problems: Three decades and counting

DEFF Research Database (Denmark)

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

2016-01-01

of DVRP papers according to 11 criteria. These are (1) type of problem, (2) logistical context, (3) transportation mode, (4) objective function, (5) fleet size, (6) time constraints, (7) vehicle capacity constraints, (8) the ability to reject customers, (9) the natureof the dynamic element, (10......Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing areal explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy......) the nature of the stochasticity (if any), and (11) the solution method. We comment on technological vis-à-vis methodological advances for this class of problems and suggest directions for further research. The latter include alternative objective functions, vehicle speed as decision variable, more explicit...

ITS Multi-path Communications Access Decision Scheme

Directory of Open Access Journals (Sweden)

Miroslav Svitek

2008-02-01

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

Rate Control for Network-Coded Multipath Relaying with Time-Varying Connectivity

Science.gov (United States)

2010-12-10

Armen Babikyan, Nathaniel M. Jones, Thomas H. Shake, and Andrew P. Worthen MIT Lincoln Laboratory 244 Wood Street Lexington, MA 02420 DDRE, 1777...delay U U U U SAR 11 Zach Sweet 781-981-5997 1 Rate Control for Network-Coded Multipath Relaying with Time-Varying Connectivity Brooke Shrader, Armen

An Optimization Algorithm for Multipath Parallel Allocation for Service Resource in the Simulation Task Workflow

Directory of Open Access Journals (Sweden)

Zhiteng Wang

2014-01-01

Full Text Available Service oriented modeling and simulation are hot issues in the field of modeling and simulation, and there is need to call service resources when simulation task workflow is running. How to optimize the service resource allocation to ensure that the task is complete effectively is an important issue in this area. In military modeling and simulation field, it is important to improve the probability of success and timeliness in simulation task workflow. Therefore, this paper proposes an optimization algorithm for multipath service resource parallel allocation, in which multipath service resource parallel allocation model is built and multiple chains coding scheme quantum optimization algorithm is used for optimization and solution. The multiple chains coding scheme quantum optimization algorithm is to extend parallel search space to improve search efficiency. Through the simulation experiment, this paper investigates the effect for the probability of success in simulation task workflow from different optimization algorithm, service allocation strategy, and path number, and the simulation result shows that the optimization algorithm for multipath service resource parallel allocation is an effective method to improve the probability of success and timeliness in simulation task workflow.

SAR antenna design for ambiguity and multipath suppression

DEFF Research Database (Denmark)

Christensen, Erik Lintz; Dich, Mikael

1993-01-01

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

An adaptive weighting algorithm for accurate radio tomographic image in the environment with multipath and WiFi interference

OpenAIRE

Wang, M.; Wang, Zhonglei; Bu, X.; Ding, E.

2017-01-01

Radio frequency device-free localization based on wireless sensor network has proved its feasibility in buildings. With this technique, a target can be located relying on the changes of received signal strengths caused by the moving object. However, the accuracy of many such systems deteriorates seriously in the environment with WiFi and the multipath interference. State-of-the-art methods do not efficiently solve the WiFi and multipath interference problems at the same time. In this article,...

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

DEFF Research Database (Denmark)

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

2010-01-01

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

Dynamic Routing of Short Transfer Baggage

DEFF Research Database (Denmark)

Clausen, Tommy; Pisinger, David

of dispatch. Computational results are presented for real-life passenger data with stochastic bag arrival times and travel times. The results indicate that the algorithm is able to dispatch the baggage considerably better than the manual delivery plans reported in the case study, and due to its fast running...... that arrive continuously during the day. We present an IP model of the problem and describe the problem as a case study from a real life setting. We present a weighted greedy algorithm for dispatching vehicles that works in an dynamic context, meaning that it only considers bags available at the time......We consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags...

3D Imaging of Dead Sea Area Using Weighted Multipath Summation: A Case Study

Directory of Open Access Journals (Sweden)

Shemer Keydar

2013-01-01

Full Text Available The formation of sinkholes along the Dead Sea is caused by the rapid decline of the Dead Sea level, as a possible result of human extensive activity. According to one of the geological models, the sinkholes in several sites are clustered along a narrow coastal strip developing along lineaments representing faults in NNW direction. In order to understand the relationship between a developing sinkhole and its tectonic environment, a high-resolution (HR three-dimensional (3D seismic reflection survey was carried out at the western shoreline of the Dead Sea. A recently developed 3D imaging approach was applied to this 3D dataset. Imaging of subsurface is performed by a spatial summation of seismic waves along time surfaces using recently proposed multipath summation with proper weights. The multipath summation is performed by stacking the target waves along all possible time surfaces having a common apex at the given point. This approach does not require any explicit information on parameters since the involved multipath summation is performed for all possible parameters values within a wide specified range. The results from processed 3D time volume show subhorizontal coherent reflectors at approximate depth of 50–80 m which incline on closer location to the exposed sinkhole and suggest a possible linkage between revealed fault and the sinkholes.

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

DEFF Research Database (Denmark)

Shutin, Dmitriy; Fleury, Bernard Henri

2011-01-01

In this paper, we develop a sparse variational Bayesian (VB) extension of the space-alternating generalized expectation-maximization (SAGE) algorithm for the high resolution estimation of the parameters of relevant multipath components in the response of frequency and spatially selective wireless...... channels. The application context of the algorithm considered in this contribution is parameter estimation from channel sounding measurements for radio channel modeling purpose. The new sparse VB-SAGE algorithm extends the classical SAGE algorithm in two respects: i) by monotonically minimizing...... parametric sparsity priors for the weights of the multipath components. We revisit the Gaussian sparsity priors within the sparse VB-SAGE framework and extend the results by considering Laplace priors. The structure of the VB-SAGE algorithm allows for an analytical stability analysis of the update expression...

Multi-Objective Emergency Material Vehicle Dispatching and Routing under Dynamic Constraints in an Earthquake Disaster Environment

Directory of Open Access Journals (Sweden)

Jincheng Jiang

2017-05-01

Full Text Available Emergency material vehicle dispatching and routing (EMVDR is an important task in emergency relief after large-scale earthquake disasters. However, EMVDR is subject to dynamic disaster environment, with uncertainty surrounding elements such as the transportation network and relief materials. Accurate and dynamic emergency material dispatching and routing is difficult. This paper proposes an effective and efficient multi-objective multi-dynamic-constraint emergency material vehicle dispatching and routing model. Considering travel time, road capacity, and material supply and demand, the proposed EMVDR model is to deliver emergency materials from multiple emergency material depositories to multiple disaster points while satisfying the objectives of maximizing transport efficiency and minimizing the difference of material urgency degrees among multiple disaster points at any one time. Furthermore, a continuous-time dynamic network flow method is developed to solve this complicated model. The collected data from Ludian earthquake were used to conduct our experiments in the post-quake and the results demonstrate that: (1 the EMVDR model adapts to the dynamic disaster environment very well; (2 considering the difference of material urgency degree, the material loss ratio is −10.7%, but the variance of urgency degree decreases from 2.39 to 0.37; (3 the EMVDR model shows good performance in time and space, which allows for decisions to be made nearly in real time. This paper can provide spatial decision-making support for emergency material relief in large-scale earthquake disasters.

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

Science.gov (United States)

Barton, Richard J.

2014-01-01

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

Analysis of the Bias on the Beidou GEO Multipath Combinations

Science.gov (United States)

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

Analysis of the Bias on the Beidou GEO Multipath Combinations

Directory of Open Access Journals (Sweden)

Yafei Ning

2016-08-01

Full Text Available 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.

Dynamic multicast routing scheme in WDM optical network

Science.gov (United States)

Zhu, Yonghua; Dong, Zhiling; Yao, Hong; Yang, Jianyong; Liu, Yibin

2007-11-01

During the information era, the Internet and the service of World Wide Web develop rapidly. Therefore, the wider and wider bandwidth is required with the lower and lower cost. The demand of operation turns out to be diversified. Data, images, videos and other special transmission demands share the challenge and opportunity with the service providers. Simultaneously, the electrical equipment has approached their limit. So the optical communication based on the wavelength division multiplexing (WDM) and the optical cross-connects (OXCs) shows great potentials and brilliant future to build an optical network based on the unique technical advantage and multi-wavelength characteristic. In this paper, we propose a multi-layered graph model with inter-path between layers to solve the problem of multicast routing wavelength assignment (RWA) contemporarily by employing an efficient graph theoretic formulation. And at the same time, an efficient dynamic multicast algorithm named Distributed Message Copying Multicast (DMCM) mechanism is also proposed. The multicast tree with minimum hops can be constructed dynamically according to this proposed scheme.

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

Directory of Open Access Journals (Sweden)

Yuanlong Cao

2012-01-01

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

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

Directory of Open Access Journals (Sweden)

Petrella Angelo

2010-01-01

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

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

DEFF Research Database (Denmark)

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

2013-01-01

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

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

Directory of Open Access Journals (Sweden)

Ivanov Nikola V.

2016-01-01

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

Multipath ultrasonic gas flow-meter based on multiple reference waves.

Science.gov (United States)

Zhou, Hongliang; Ji, Tao; Wang, Ruichen; Ge, Xiaocheng; Tang, Xiaoyu; Tang, Shizhen

2018-01-01

Several technologies can be used in ultrasonic gas flow-meters, such as transit-time, Doppler, cross-correlation and etc. In applications, the approach based on measuring transit-time has demonstrated its advantages and become more popular. Among those techniques which can be applied to determine time-of-flight (TOF) of ultrasonic waves, including threshold detection, cross correlation algorithm and other digital signal processing algorithms, cross correlation algorithm has more advantages when the received ultrasonic signal is severely disturbed by the noise. However, the reference wave for cross correlation computation has great influence on the precise measurement of TOF. In the applications of the multipath flow-meters, selection of the reference wave becomes even more complicated. Based on the analysis of the impact factors that will introduce noise and waveform distortion of ultrasonic waves, an averaging method is proposed to determine the reference wave in this paper. In the multipath ultrasonic gas flow-meter, the analysis of each path of ultrasound needs its own reference wave. In case study, a six-path ultrasonic gas flow-meter has been designed and tested with air flow through the pipeline. The results demonstrate that the flow rate accuracy and the repeatability of the TOF are significantly improved by using averaging reference wave, compared with that using random reference wave. Copyright © 2017 Elsevier B.V. All rights reserved.

Dynamic route guidance strategy in a two-route pedestrian-vehicle mixed traffic flow system

Science.gov (United States)

Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

2016-05-01

With the rapid development of transportation, traffic questions have become the major issue for social, economic and environmental aspects. Especially, during serious emergencies, it is very important to alleviate road traffic congestion and improve the efficiency of evacuation to reduce casualties, and addressing these problems has been a major task for the agencies responsible in recent decades. Advanced road guidance strategies have been developed for homogeneous traffic flows, or to reduce traffic congestion and enhance the road capacity in a symmetric two-route scenario. However, feedback strategies have rarely been considered for pedestrian-vehicle mixed traffic flows with variable velocities and sizes in an asymmetric multi-route traffic system, which is a common phenomenon in many developing countries. In this study, we propose a weighted road occupancy feedback strategy (WROFS) for pedestrian-vehicle mixed traffic flows, which considers the system equilibrium to ease traffic congestion. In order to more realistic simulating the behavior of mixed traffic objects, the paper adopted a refined and dynamic cellular automaton model (RDPV_CA model) as the update mechanism for pedestrian-vehicle mixed traffic flow. Moreover, a bounded rational threshold control was introduced into the feedback strategy to avoid some negative effect of delayed information and reduce. Based on comparisons with the two previously proposed strategies, the simulation results obtained in a pedestrian-vehicle traffic flow scenario demonstrated that the proposed strategy with a bounded rational threshold was more effective and system equilibrium, system stability were reached.

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

NARCIS (Netherlands)

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

2006-01-01

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

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

Directory of Open Access Journals (Sweden)

A. O. Olopade

2014-01-01

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

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

CSIR Research Space (South Africa)

Naicker, K

2006-06-01

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

Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

Directory of Open Access Journals (Sweden)

Haitao Xu

2018-01-01

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

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

Indian Academy of Sciences (India)

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

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

International Nuclear Information System (INIS)

Johansson, Ola M.

2006-01-01

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

Tourist activated networks: Implications for dynamic bundling and en-route recommendations

DEFF Research Database (Denmark)

Zach, Florian; Gretzel, Ulrike

2011-01-01

This article discusses tourist-activated networks as a concept to inform technological applications supporting dynamic bundling and en route recommendations. Empirical data were collected from travelers who visited a regional destination in the US and then analyzed with respect to its network...... structure. The results indicate that the tourist-activated network for the destination is rather sparse and that there are clearly differences in core and peripheral nodes. The findings illustrate the structure of a tourist-activated network and provide implications for technology design and tourism...

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

Directory of Open Access Journals (Sweden)

Khaled Rouabah

2009-01-01

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

Partial PIC-MRC Receiver Design for Single Carrier Block Transmission System over Multipath Fading Channels

Directory of Open Access Journals (Sweden)

Juinn-Horng Deng

2012-01-01

Full Text Available Single carrier block transmission (SCBT system has become one of the most popular modulation systems due to its low peak-to-average power ratio (PAPR, and it is gradually considered to be used for uplink wireless communication systems. In this paper, a low complexity partial parallel interference cancellation (PIC with maximum ratio combining (MRC technology is proposed to use for receiver to combat the intersymbol interference (ISI problem over multipath fading channel. With the aid of MRC scheme, the proposed partial PIC technique can effectively perform the interference cancellation and acquire the benefit of time diversity gain. Finally, the proposed system can be extended to use for multiple antenna systems to provide excellent performance. Simulation results reveal that the proposed low complexity partial PIC-MRC SIMO system can provide robust performance and outperform the conventional PIC and the iterative frequency domain decision feedback equalizer (FD-DFE systems over multipath fading channel environment.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network.

Science.gov (United States)

Ahmed, Farwa; Wadud, Zahid; Javaid, Nadeem; Alrajeh, Nabil; Alabed, Mohamad Souheil; Qasim, Umar

2018-04-02

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Farwa Ahmed

2018-04-01

Full Text Available The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs. The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Dynamic Routing during Disaster Events

NARCIS (Netherlands)

Fitrianie, S.; Rothkrantz, L.J.M.

2015-01-01

Innovations in mobile technology allow people to request route information on their smartphone to reach safe areas during emergency and disaster evacuations. In return, the affected people in the field can send their observation reports, e.g. using a dedicated icon-based disaster language. However,

A Robust Parametric Technique for Multipath Channel Estimation in the Uplink of a DS-CDMA System

Directory of Open Access Journals (Sweden)

2006-01-01

Full Text Available The problem of estimating the multipath channel parameters of a new user entering the uplink of an asynchronous direct sequence-code division multiple access (DS-CDMA system is addressed. The problem is described via a least squares (LS cost function with a rich structure. This cost function, which is nonlinear with respect to the time delays and linear with respect to the gains of the multipath channel, is proved to be approximately decoupled in terms of the path delays. Due to this structure, an iterative procedure of 1D searches is adequate for time delays estimation. The resulting method is computationally efficient, does not require any specific pilot signal, and performs well for a small number of training symbols. Simulation results show that the proposed technique offers a better estimation accuracy compared to existing related methods, and is robust to multiple access interference.

A dynamic continental runoff routing model applied to the last Northern Hemisphere deglaciation

Directory of Open Access Journals (Sweden)

H. Goelzer

2012-05-01

Full Text Available We describe and evaluate a dynamical continental runoff routing model for the Northern Hemisphere that calculates the runoff pathways in response to topographic modifications due to changes in ice thickness and isostatic adjustment. The algorithm is based on the steepest gradient method and takes as simplifying assumption that depressions are filled at all times and water drains through the lowest outlet points. It also considers changes in water storage and lake drainage in post-processing mode that become important in the presence of large ice dammed proglacial lakes. Although applicable to other scenarios as well, the model was conceived to study the routing of freshwater fluxes during the last Northern Hemisphere deglaciation. For that specific application we simulated the Northern Hemisphere ice sheets with an existing 3-D thermomechanical ice sheet model, which calculates changes in topography due to changes in ice cover and isostatic adjustment, as well as the evolution of freshwater fluxes resulting from surface ablation, iceberg calving and basal melt. The continental runoff model takes this input, calculates the drainage pathways and routes the freshwater fluxes to the surface grid points of an existing ocean model. This results in a chronology of temporally and spatially varying freshwater fluxes from the Last Glacial Maximum to the present day. We analyse the dependence of the runoff routing to grid resolution and parameters of the isostatic adjustment module of the ice sheet model.

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

Directory of Open Access Journals (Sweden)

Waheb A. Jabbar

2014-01-01

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

BIFOCAL STEREO FOR MULTIPATH PERSON RE-IDENTIFICATION

Directory of Open Access Journals (Sweden)

G. Blott

2017-11-01

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

Pheromone Static Routing Strategy for Complex Networks

Science.gov (United States)

Hu, Mao-Bin; Henry, Y. K. Lau; Ling, Xiang; Jiang, Rui

2012-12-01

We adopt the concept of using pheromones to generate a set of static paths that can reach the performance of global dynamic routing strategy [Phys. Rev. E 81 (2010) 016113]. The path generation method consists of two stages. In the first stage, a pheromone is dropped to the nodes by packets forwarded according to the global dynamic routing strategy. In the second stage, pheromone static paths are generated according to the pheromone density. The output paths can greatly improve traffic systems' overall capacity on different network structures, including scale-free networks, small-world networks and random graphs. Because the paths are static, the system needs much less computational resources than the global dynamic routing strategy.

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

Science.gov (United States)

Sheth, Kapil; Wang, Easter Mayan Chan

2016-01-01

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

Route Generation for a Synthetic Character (BOT) Using a Partial or Incomplete Knowledge Route Generation Algorithm in UT2004 Virtual Environment

Science.gov (United States)

Hanold, Gregg T.; Hanold, David T.

2010-01-01

This paper presents a new Route Generation Algorithm that accurately and realistically represents human route planning and navigation for Military Operations in Urban Terrain (MOUT). The accuracy of this algorithm in representing human behavior is measured using the Unreal Tournament(Trademark) 2004 (UT2004) Game Engine to provide the simulation environment in which the differences between the routes taken by the human player and those of a Synthetic Agent (BOT) executing the A-star algorithm and the new Route Generation Algorithm can be compared. The new Route Generation Algorithm computes the BOT route based on partial or incomplete knowledge received from the UT2004 game engine during game play. To allow BOT navigation to occur continuously throughout the game play with incomplete knowledge of the terrain, a spatial network model of the UT2004 MOUT terrain is captured and stored in an Oracle 11 9 Spatial Data Object (SOO). The SOO allows a partial data query to be executed to generate continuous route updates based on the terrain knowledge, and stored dynamic BOT, Player and environmental parameters returned by the query. The partial data query permits the dynamic adjustment of the planned routes by the Route Generation Algorithm based on the current state of the environment during a simulation. The dynamic nature of this algorithm more accurately allows the BOT to mimic the routes taken by the human executing under the same conditions thereby improving the realism of the BOT in a MOUT simulation environment.

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

Science.gov (United States)

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

2018-01-26

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

A Proposal for IoT Dynamic Routes Selection Based on Contextual Information

Directory of Open Access Journals (Sweden)

Harilton da Silva Araújo

2018-01-01

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

Analysis of a Combined Antenna Arrays and Reverse-Link Synchronous DS-CDMA System over Multipath Rician Fading Channels

Directory of Open Access Journals (Sweden)

Kim Yong-Seok

2005-01-01

Full Text Available We present the BER analysis of antenna array (AA receiver in reverse-link asynchronous multipath Rician channels and analyze the performance of an improved AA system which applies a reverse-link synchronous transmission technique (RLSTT in order to effectively make a better estimation of covariance matrices at a beamformer-RAKE receiver. In this work, we provide a comprehensive analysis of user capacity which reflects several important factors such as the ratio of the specular component power to the Rayleigh fading power, the shape of multipath intensity profile, and the number of antennas. Theoretical analysis demonstrates that for the case of a strong specular path's power or for a high decay factor, the employment of RLSTT along with AA has the potential of improving the achievable capacity by an order of magnitude.

The QKD network: model and routing scheme

Science.gov (United States)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn't address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.

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

Directory of Open Access Journals (Sweden)

Lohan Elena Simona

2006-01-01

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

Methylmercury determination using a hyphenated high performance liquid chromatography ultraviolet cold vapor multipath atomic absorption spectrometry system

Energy Technology Data Exchange (ETDEWEB)

Campos, Reinaldo C. [Department of Chemistry, Pontifical Catholic University of Rio de Janeiro, Rua Marques de S Vicente 225, 22453-900 Rio de Janeiro (Brazil)], E-mail: rccampos@puc-rio.br; Goncalves, Rodrigo A.; Brandao, Geisamanda P.; Azevedo, Marlo S. [Department of Chemistry, Pontifical Catholic University of Rio de Janeiro, Rua Marques de S Vicente 225, 22453-900 Rio de Janeiro (Brazil); Oliveira, Fabiana; Wasserman, Julio [Institut of Geosciences, Fluminense Federal University, Av. Gal. Milton Tavares de Souza, s/n, 24.210-340, Niteroi, Rio de Janeiro (Brazil)

2009-06-15

The present work investigates the use of a multipath cell atomic absorption mercury detector for mercury speciation analysis in a hyphenated high performance liquid chromatography assembly. The multipath absorption cell multiplies the optical path while energy losses are compensated by a very intense primary source. Zeeman-effect background correction compensates for non-specific absorption. For the separation step, the mobile phase consisted in a 0.010% m/v mercaptoethanol solution in 5% methanol (pH = 5), a C{sub 18} column was used as stationary phase, and post column treatment was performed by UV irradiation (60 deg. C, 13 W). The eluate was then merged with 3 mol L{sup -1} HCl, reduction was performed by a NaBH{sub 4} solution, and the Hg vapor formed was separated at the gas-liquid separator and carried through a desiccant membrane to the detector. The detector was easily attached to the system, since an external gas flow to the gas-liquid separator was provided. A multivariate approach was used to optimize the procedure and peak area was used for measurement. Instrumental limits of detection of 0.05 {mu}g L{sup -1} were obtained for ionic (Hg{sup 2+}) and HgCH{sub 3}{sup +}, for an injection volume of 200 {mu}L. The multipath atomic absorption spectrometer proved to be a competitive mercury detector in hyphenated systems in relation to the most commonly used atomic fluorescence and inductively coupled plasma mass spectrometric detectors. Preliminary application studies were performed for the determination of methyl mercury in sedi0011men.

Methylmercury determination using a hyphenated high performance liquid chromatography ultraviolet cold vapor multipath atomic absorption spectrometry system

International Nuclear Information System (INIS)

Campos, Reinaldo C.; Goncalves, Rodrigo A.; Brandao, Geisamanda P.; Azevedo, Marlo S.; Oliveira, Fabiana; Wasserman, Julio

2009-01-01

The present work investigates the use of a multipath cell atomic absorption mercury detector for mercury speciation analysis in a hyphenated high performance liquid chromatography assembly. The multipath absorption cell multiplies the optical path while energy losses are compensated by a very intense primary source. Zeeman-effect background correction compensates for non-specific absorption. For the separation step, the mobile phase consisted in a 0.010% m/v mercaptoethanol solution in 5% methanol (pH = 5), a C 18 column was used as stationary phase, and post column treatment was performed by UV irradiation (60 deg. C, 13 W). The eluate was then merged with 3 mol L -1 HCl, reduction was performed by a NaBH 4 solution, and the Hg vapor formed was separated at the gas-liquid separator and carried through a desiccant membrane to the detector. The detector was easily attached to the system, since an external gas flow to the gas-liquid separator was provided. A multivariate approach was used to optimize the procedure and peak area was used for measurement. Instrumental limits of detection of 0.05 μg L -1 were obtained for ionic (Hg 2+ ) and HgCH 3 + , for an injection volume of 200 μL. The multipath atomic absorption spectrometer proved to be a competitive mercury detector in hyphenated systems in relation to the most commonly used atomic fluorescence and inductively coupled plasma mass spectrometric detectors. Preliminary application studies were performed for the determination of methyl mercury in sediments.

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

Science.gov (United States)

2016-04-25

ElectroMagnetic, Multipath propagation, Reflection-diffraction, SAR signal processing 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT SAR 18...protection, and traffic surveillance, etc. With these above reasons, we are motivated to introduce a new approach to the target detection and...coherent integrating the backscattering signal , we propose a 3D propagation model that is useful not only in explaining the mechanisms of wave

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

DEFF Research Database (Denmark)

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

2006-01-01

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

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

Directory of Open Access Journals (Sweden)

Yulia Shichkina

2017-01-01

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

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

Directory of Open Access Journals (Sweden)

Siyuan He

2012-01-01

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

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

2013-02-04

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

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

Directory of Open Access Journals (Sweden)

Antonio A. F. Loureiro

2013-02-01

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

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

Science.gov (United States)

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

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

Science.gov (United States)

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

2017-02-01

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

QoE-Driven Energy-Aware Multipath Content Delivery Approach for MPTCP-Based Mobile Phones

Institute of Scientific and Technical Information of China (English)

Yuanlong Cao; Shengyang Chen; Qinghua Liu; Yi Zuo; Hao Wang; Minghe Huang

2017-01-01

Mobile phones equipped with multiple wireless interfaces can increase their goodput performance by making use of concurrent transmissions over multiple paths,enabled by the Multipath TCP (MPTCP).However,utilizing MPTCP for data delivery may generally result in higher energy consumption,while the battery power of a mobile phone is limited.Thus,how to optimize the energy usage becomes very crucial and urgent.In this paper,we propose MPTCP-QE,a novel quality of experience (QoE)-driven energy-aware multipath content delivery approach for MPTCP-based mobile phones.The main idea of MPTCP-QE is described as follows:it first provides an application rate-aware energy-efficient subflow management strategy to tradeoff throughput performance and energy consumption for mobile phones;then uses an available bandwidth-aware congestion window fast recovery strategy to make a sender avoid unnecessary slow-start and utilize wireless resource quickly;and further introduces a novel receiver-driven energy-efficient SACK strategy to help a receiver possible to detect SACK loss timely and trigger loss recovery in a more energy-efficient way.The simulation results show that with the MPTCP-QE,the energy usage is enhanced while the performance level is maintained compared to existing MPTCP solutions.

Routing Optimization of Intelligent Vehicle in Automated Warehouse

Directory of Open Access Journals (Sweden)

Yan-cong Zhou

2014-01-01

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

DTN routing in body sensor networks with dynamic postural partitioning.

Science.gov (United States)

Quwaider, Muhannad; Biswas, Subir

2010-11-01

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

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

Directory of Open Access Journals (Sweden)

Chen Yu-Fan

2006-01-01

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

A queueing framework for routing problems with time-dependent travel times

NARCIS (Netherlands)

Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.

2007-01-01

Assigning and scheduling vehicle routes in a dynamic environment is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic and dynamic nature of travel times. In this paper, a vehicle

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

Directory of Open Access Journals (Sweden)

Qile Zhao

2016-01-01

Full Text Available 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.

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

Science.gov (United States)

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.

On line routing per mobile phone

DEFF Research Database (Denmark)

Bieding, Thomas; Görtz, Simon; Klose, Andreas

2009-01-01

On-line routing is concerned with building vehicle routes in an ongoing fashion in such a way that customer requests arriving dynamically in time are efficiently and effectively served. An indispensable prerequisite for applying on-line routing methods is mobile communication technology....... Additionally it is of utmost importance that the employed communication system is suitable integrated with the firm’s enterprise application system and business processes. On basis of a case study, we describe in this paper a system that is cheap and easy to implement due to the use of simple mobile phones...

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

Science.gov (United States)

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-05-12

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.

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

Science.gov (United States)

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

2016-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2009-12-03

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

Selective epidemic vaccination under the performant routing algorithms

Science.gov (United States)

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

2018-04-01

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

Ising model for packet routing control

International Nuclear Information System (INIS)

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

2004-01-01

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

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

Science.gov (United States)

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

2007-05-01

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

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

Directory of Open Access Journals (Sweden)

Arafatur RAHMAN

2009-01-01

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

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

Science.gov (United States)

Hu, Chia-Chang; Lin, Hsuan-Yu; Chen, Yu-Fan; Wen, Jyh-Horng

2006-12-01

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

Multipath Suppression with an Absorber for UWB Wind Turbine Blade Deflection Sensing Systems

DEFF Research Database (Denmark)

Zhang, Shuai; Franek, Ondrej; Eggers, Patrick Claus F.

2017-01-01

The deflection of a wind turbine blade can be monitored with an ultra-wideband (UWB) deflection sensing system which consists of one transmitting antenna at the blade tip and two receiving antennas at the blade root. The blade deflection is calculated by two estimated tip-root antenna distances...... verifications of the proposed method are carried out with different full-blade measurements. From all the results, it is found that the proposed technique can efficiently suppress multipath for the in-blade tip antenna, and improve the pulse wave front fidelity, so that the UWB sensing system can also...

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

CERN Document Server

Markiewicz, Michal

2017-01-01

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

On the Packet Loss Correlation in Wireless Mesh Networks

DEFF Research Database (Denmark)

Pahlevani, Peyman; Cabrera Guerrero, Juan Alberto; Roetter, Daniel Enrique Lucani

2014-01-01

/or multi-path routing approaches as well as network coding (NC) subgraph selection problems (routing in NC). This paper proposes simple channel models to incorporate the effect of correlation between receivers in a parametric fashion and supports them with a measurement campaign that leverages various...

Self-Interested Routing in Queueing Networks

OpenAIRE

Ali K. Parlaktürk; Sunil Kumar

2004-01-01

We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two-station multiclass queueing network in which the system manager chooses the scheduling rule and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a nontrivial scheduling rule that negates the performance degradation resulting from s...

Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mann Raminder P

2005-01-01

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

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

DEFF Research Database (Denmark)

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

2009-01-01

OBJECTIVES/HYPOTHESIS: To examine the routes, dynamics and correlates of cochlear inflammation in meningitis to provide information on the pathogenesis of the associated hearing loss and indications for rational pharmacotherapeutical intervention. STUDY DESIGN: A well-established rat model...... with inflammatory cells via cochlear aqueduct, whereas the endolymphatic space was infiltrated from the spiral ligament. Rosenthal's canal was infiltrated through osseous spiral lamina canaliculi. In the untreated group, the degree of inflammation correlated with time of death, whereas antibiotic treatment reversed...... this development. Perilymphatic inflammation correlated significantly with the CSF leukocyte count, whereas endolymphatic inflammation correlated with spiral ligament inflammation. CONCLUSIONS: Meningogenic inflammation of the rat cochlea occurs via the cochlear aqueduct and the spiral ligament capillary bed...

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

Science.gov (United States)

Eslaminejad, Mohammadreza; Razak, Shukor Abd

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

An Efficient Code-Timing Estimator for DS-CDMA Systems over Resolvable Multipath Channels

Directory of Open Access Journals (Sweden)

Jian Li

2005-04-01

Full Text Available We consider the problem of training-based code-timing estimation for the asynchronous direct-sequence code-division multiple-access (DS-CDMA system. We propose a modified large-sample maximum-likelihood (MLSML estimator that can be used for the code-timing estimation for the DS-CDMA systems over the resolvable multipath channels in closed form. Simulation results show that MLSML can be used to provide a high correct acquisition probability and a high estimation accuracy. Simulation results also show that MLSML can have very good near-far resistant capability due to employing a data model similar to that for adaptive array processing where strong interferences can be suppressed.

A Multicast Protocol Utilizing On-demand Routing Strategy for MPRN

Institute of Scientific and Technical Information of China (English)

无

2002-01-01

This paper proposes a multicast protocol utilizing ondemand routing strategy for mobile packet radio network. It does not maintain permanent route tables with full topological views. Instead, multicast senders apply on-demand procedures to dynamically discover routes and build forwarding group in this protocol. The data packets are propagated by each forwarding group member via scoped flooding, so the protocol can reduce network bandwidth overhead and avoid the propagation of potentially large routing updates throughout the network.

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

Directory of Open Access Journals (Sweden)

Guilin Zheng

2011-03-01

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

Research on routing algorithm based on the VANET

Directory of Open Access Journals (Sweden)

AN Li

2016-01-01

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

Route Choice Model Based on Game Theory for Commuters

Directory of Open Access Journals (Sweden)

Licai Yang

2016-06-01

Full Text Available The traffic behaviours of commuters may cause traffic congestion during peak hours. Advanced Traffic Information System can provide dynamic information to travellers. Due to the lack of timeliness and comprehensiveness, the provided information cannot satisfy the travellers’ needs. Since the assumptions of traditional route choice model based on Expected Utility Theory conflict with the actual situation, a route choice model based on Game Theory is proposed to provide reliable route choice to commuters in actual situation in this paper. The proposed model treats the alternative routes as game players and utilizes the precision of predicted information and familiarity of traffic condition to build a game. The optimal route can be generated considering Nash Equilibrium by solving the route choice game. Simulations and experimental analysis show that the proposed model can describe the commuters’ routine route choice decisionexactly and the provided route is reliable.

Optimizing well intervention routes

Energy Technology Data Exchange (ETDEWEB)

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

2000-07-01

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

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

Science.gov (United States)

McNally, B. David; Love, John

2011-01-01

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

Noise-Assisted Concurrent Multipath Traffic Distribution in Ad Hoc Networks

Science.gov (United States)

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

Suppressing traffic-driven epidemic spreading by adaptive routing strategy

International Nuclear Information System (INIS)

Yang, Han-Xin; Wang, Zhen

2016-01-01

The design of routing strategies for traffic-driven epidemic spreading has received increasing attention in recent years. In this paper, we propose an adaptive routing strategy that incorporates topological distance with local epidemic information through a tunable parameter h. In the case where the traffic is free of congestion, there exists an optimal value of routing parameter h, leading to the maximal epidemic threshold. This means that epidemic spreading can be more effectively controlled by adaptive routing, compared to that of the static shortest path routing scheme. Besides, we find that the optimal value of h can greatly relieve the traffic congestion in the case of finite node-delivering capacity. We expect our work to provide new insights into the effects of dynamic routings on traffic-driven epidemic spreading.

Performance of Reverse-Link Synchronous DS-CDMA System on a Frequency-Selective Multipath Fading Channel with Imperfect Power Control

Directory of Open Access Journals (Sweden)

Duk Kyung Kim

2002-08-01

Full Text Available 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 BER=10−6. 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.

Comparison of MANET routing protocols using a scaled indoor wireless grid

CSIR Research Space (South Africa)

Johnson, DL

2008-04-01

Full Text Available accumulation feature of Dynamic Source Routing (DSR) by adding the accumulated route, back to the source, to the Route Request packet. It retains the destination sequence number feature of AODV but HELLO packets are an optional feature and are normally left... than the inbound traffic as the routing algorithm makes a decision to rebroadcast the packet or not and Figure 20 confirms this. DYMO shows the least amount of routing traffic due to its lack of HELLO packets. This is also due to no further...

A Clustering Routing Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jinke Huang

2016-01-01

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

Link reliability based hybrid routing for tactical mobile ad hoc network

Institute of Scientific and Technical Information of China (English)

Xie Xiaochuan; Wei Gang; Wu Keping; Wang Gang; Jia Shilou

2008-01-01

Tactical mobile ad hoc network (MANET) is a collection of mobile nodes forming a temporary network,without the aid of pre-established network infrastructure. The routing protocol has a crucial impact on the networkperformance in battlefields. Link reliability based hybrid routing (LRHR) is proposed, which is a novel hybrid routing protocol, for tactical MANET. Contrary to the traditional single path routing strategy, multiple paths are established between a pair of source-destination nodes. In the hybrid routing strategy, the rate of topological change provides a natural mechanism for switching dynamically between table-driven and on-demand routing. The simulation results indicate that the performances of the protocol in packet delivery ratio, routing overhead, and average end-to-end delay are better than the conventional routing protocol.

Trust-Based Route Selection in Dynamic Source Routin

DEFF Research Database (Denmark)

Jensen, Christian D.; Connell, Paul O

2006-01-01

in the mobile wireless network. However, blindly trusting all other nodes to respect the routing protocol exposes the local node to a wide variety of vulnerabilities. Traditional security mechanisms rely on either the authenticated identity of the requesting principal or some form of credentials that authorise...

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

Directory of Open Access Journals (Sweden)

G. Arul Elango

2016-09-01

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

Augmenting static and dynamic mechanical strength of carbon nanotube/epoxy soft nanocomposites via modulation of purification and functionalization routes.

Science.gov (United States)

Billing, Beant Kaur; Dhar, Purbarun; Singh, Narinder; Agnihotri, Prabhat K

2018-01-03

A detailed experimental investigation was carried out to establish the relationship between CNT purification and functionalization routes and the average response of CNT/epoxy nanocomposites under static and dynamic loading. It was shown that the relative improvement in the mechanical properties of the epoxy matrix due to the addition of CNTs depends on the choice of purification and functionalization steps. A better dispersion of CNTs was recorded for the functionalized CNTs as compared to the oxidized and CVD grown CNTs. Moreover, tensile, 3-point bending and nanoDMA testing performed on nanocomposites processed with CVD-grown, oxidized and functionalized CNTs revealed that COOH functionalization after the oxidation of CNTs at 350 °C is the optimized processing route to harness the excellent properties of CNTs in CNT/epoxy nanocomposites.

Intelligent routing protocol for ad hoc wireless network

Science.gov (United States)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

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

Comparison of MANET Routing Protocols in Different Traffic and Mobility Models

Directory of Open Access Journals (Sweden)

J. Baraković

2010-06-01

Full Text Available Routing protocol election in MANET (Mobile Ad Hoc Network is a great challenge, because of its frequent topology changes and routing overhead. This paper compares performances of three routing protocols: Destination Sequenced Distance Vector (DSDV, Ad Hoc Ondemand Distance Vector (AODV and Dynamic Source Routing (DSR, based on results analysis obtained using simulations with different load and mobility scenarios performed with Network Simulator version 2 (NS-2. In low load and low mobility scenarios routing protocols perform in a similar manner. However, with mobility and load increasing DSR outperforms AODV and DSDV protocols.

Glistening-region model for multipath studies

Science.gov (United States)

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.

Identification of Robust Terminal-Area Routes in Convective Weather

Science.gov (United States)

Pfeil, Diana Michalek; Balakrishnan, Hamsa

2012-01-01

Convective weather is responsible for large delays and widespread disruptions in the U.S. National Airspace System, especially during summer. Traffic flow management algorithms require reliable forecasts of route blockage to schedule and route traffic. This paper demonstrates how raw convective weather forecasts, which provide deterministic predictions of the vertically integrated liquid (the precipitation content in a column of airspace) can be translated into probabilistic forecasts of whether or not a terminal area route will be blocked. Given a flight route through the terminal area, we apply techniques from machine learning to determine the likelihood that the route will be open in actual weather. The likelihood is then used to optimize terminalarea operations by dynamically moving arrival and departure routes to maximize the expected capacity of the terminal area. Experiments using real weather scenarios on stormy days show that our algorithms recommend that a terminal-area route be modified 30% of the time, opening up 13% more available routes that were forecast to be blocked during these scenarios. The error rate is low, with only 5% of cases corresponding to a modified route being blocked in reality, whereas the original route is in fact open. In addition, for routes predicted to be open with probability 0.95 or greater by our method, 96% of these routes (on average over time horizon) are indeed open in the weather that materializes

Multicarrier chaotic communications in multipath fading channels without channel estimation

Energy Technology Data Exchange (ETDEWEB)

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

2015-01-15

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

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

Directory of Open Access Journals (Sweden)

Meng-Hsun Tsai

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

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

Science.gov (United States)

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

2016-01-01

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

Multicarrier chaotic communications in multipath fading channels without channel estimation

Directory of Open Access Journals (Sweden)

Shilian Wang

2015-01-01

Full Text Available 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.

Dynamic call center routing policies using call waiting and agent idle times

NARCIS (Netherlands)

Chan, W.; Koole, G.M.; L'Ecuyer, P.

2014-01-01

We study call routing policies for call centers with multiple call types and multiple agent groups. We introduce new weight-based routing policies where each pair (call type, agent group) is given a matching priority defined as an affine combination of the longest waiting time for that call type and

Provisioning of adaptability to variable topologies for routing schemes in MANETs

DEFF Research Database (Denmark)

Jiang, Shengming; Liu, Yaoda; Jiang, Yuming

2004-01-01

.g., low, medium, and high mobility) have been proposed in the,literature. However, since a mobile node should not be limited to operate in a particular MANET assumed by-a routing scheme, an important issue is how to enable, a mobile node to achieve routing performance as high as possible when it roams...... in the dynamic source routing protocol to provide the adaptability to variable topologies caused by mobility through computer simulation in NS-2....

Dynamic Routing and Coordination in Multi-Agent Networks

Science.gov (United States)

2016-06-10

epidemics spreading . Bibliography (J1) F. Pasqualetti, S. Zampieri, and F. Bullo. Controllability metrics, limitations and algorithms for complex networks ...controllability properties of the clusters and on their coupling strength. We validate our results with examples from power networks , social networks , and...SECURITY CLASSIFICATION OF: Supported by this project, we designed innovative routing, planning and coordination strategies for robotic networks and

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

NARCIS (Netherlands)

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

2016-01-01

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

Quality-constrained routing in publish/subscribe systems

NARCIS (Netherlands)

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

2005-01-01

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

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

Science.gov (United States)

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

2010-01-01

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

Accurate Bit Error Rate Calculation for Asynchronous Chaos-Based DS-CDMA over Multipath Channel

Science.gov (United States)

Kaddoum, Georges; Roviras, Daniel; Chargé, Pascal; Fournier-Prunaret, Daniele

2009-12-01

An accurate approach to compute the bit error rate expression for multiuser chaosbased DS-CDMA system is presented in this paper. For more realistic communication system a slow fading multipath channel is considered. A simple RAKE receiver structure is considered. Based on the bit energy distribution, this approach compared to others computation methods existing in literature gives accurate results with low computation charge. Perfect estimation of the channel coefficients with the associated delays and chaos synchronization is assumed. The bit error rate is derived in terms of the bit energy distribution, the number of paths, the noise variance, and the number of users. Results are illustrated by theoretical calculations and numerical simulations which point out the accuracy of our approach.

On a New Route to Chaos in Railway Dynamics

DEFF Research Database (Denmark)

True, Hans; Jensen, Carsten Nordstroem

1997-01-01

a period-doubling cascade of the secondary period in an asymptotically stable quasiperiodic oscillation at decreasing speed. Several quasiperiodic windows were found in the chaotic motion. This route to chaos was first described by Franceschini [9], who discovered it in a seven-mode truncation of the plane...

Analysis of Pervasive Mobile Ad Hoc Routing Protocols

Science.gov (United States)

Qadri, Nadia N.; Liotta, Antonio

Mobile ad hoc networks (MANETs) are a fundamental element of pervasive networks and therefore, of pervasive systems that truly support pervasive computing, where user can communicate anywhere, anytime and on-the-fly. In fact, future advances in pervasive computing rely on advancements in mobile communication, which includes both infrastructure-based wireless networks and non-infrastructure-based MANETs. MANETs introduce a new communication paradigm, which does not require a fixed infrastructure - they rely on wireless terminals for routing and transport services. Due to highly dynamic topology, absence of established infrastructure for centralized administration, bandwidth constrained wireless links, and limited resources in MANETs, it is challenging to design an efficient and reliable routing protocol. This chapter reviews the key studies carried out so far on the performance of mobile ad hoc routing protocols. We discuss performance issues and metrics required for the evaluation of ad hoc routing protocols. This leads to a survey of existing work, which captures the performance of ad hoc routing algorithms and their behaviour from different perspectives and highlights avenues for future research.

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

DEFF Research Database (Denmark)

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

2017-01-01

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

Improved routing strategies for data traffic in scale-free networks

International Nuclear Information System (INIS)

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

2008-01-01

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

Adaptive Multi-path Telecommunications Solutions for ITS

Directory of Open Access Journals (Sweden)

Tomas Zelinka

2011-02-01

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

Epidemic metapopulation model with traffic routing in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chen, Shengyong

2011-01-01

In this paper, we propose a model incorporating both the traffic routing dynamics and the virus prevalence dynamics. In this model, each packet may be isolated from the network on its transporting path, which means that the packet cannot be successfully delivered to its destination. In contrast, a successful transport means that a packet can be delivered from source to destination without being isolated. The effects of model parameters on the delivery success rate and the delivery failure rate are intensively studied and analyzed. Several routing strategies are performed for our model. Results show that the shortest path routing strategy is the most effective for enhancing the delivery success rate, especially when each packet is only allowed to be delivered to the neighbor with the lowest degree along the shortest path. We also find that, by minimizing the sum of the nodes' degree along the transporting path, we can also obtain a satisfactory delivery success rate

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

International Nuclear Information System (INIS)

Villa, E.

1999-01-01

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

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

Directory of Open Access Journals (Sweden)

Noor M. Khan

2009-01-01

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

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

Science.gov (United States)

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

2013-01-01

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

Remotely Sensed Based Lake/Reservoir Routing in Congo River Basin

Science.gov (United States)

Raoufi, R.; Beighley, E.; Lee, H.

2017-12-01

Lake and reservoir dynamics can influence local to regional water cycles but are often not well represented in hydrologic models. One challenge that limits their inclusion in models is the need for detailed storage-discharge behavior that can be further complicated in reservoirs where specific operation rules are employed. Here, the Hillslope River Routing (HRR) model is combined with a remotely sensed based Reservoir Routing (RR) method and applied to the Congo River Basin. Given that topographic data are often continuous over the entire terrestrial surface (i.e., does not differentiate between land and open water), the HRR-RR model integrates topographic derived river networks and catchment boundaries (e.g., HydroSHEDs) with water boundary extents (e.g., Global Lakes and Wetlands Database) to develop the computational framework. The catchments bordering lakes and reservoirs are partitioned into water and land portions, where representative flowpath characteristics are determined and vertical water balance and lateral routings is performed separately on each partition based on applicable process models (e.g., open water evaporation vs. evapotranspiration). To enable reservoir routing, remotely sensed water surface elevations and extents are combined to determine the storage change time series. Based on the available time series, representative storage change patterns are determined. Lake/reservoir routing is performed by combining inflows from the HRR-RR model and the representative storage change patterns to determine outflows. In this study, a suite of storage change patterns derived from remotely sensed measurements are determined representative patterns for wet, dry and average conditions. The HRR-RR model dynamically selects and uses the optimal storage change pattern for the routing process based on these hydrologic conditions. The HRR-RR model results are presented to highlight the importance of lake attenuation/routing in the Congo Basin.

Hyperbolicity in median graphs

Indian Academy of Sciences (India)

mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.

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

Energy Technology Data Exchange (ETDEWEB)

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

2007-07-01

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

An Enhanced Hybrid Social Based Routing Algorithm for MANET-DTN

Directory of Open Access Journals (Sweden)

Martin Matis

2016-01-01

Full Text Available A new routing algorithm for mobile ad hoc networks is proposed in this paper: an Enhanced Hybrid Social Based Routing (HSBR algorithm for MANET-DTN as optimal solution for well-connected multihop mobile networks (MANET and/or worse connected MANET with small density of the nodes and/or due to mobility fragmented MANET into two or more subnetworks or islands. This proposed HSBR algorithm is fully decentralized combining main features of both Dynamic Source Routing (DSR and Social Based Opportunistic Routing (SBOR algorithms. The proposed scheme is simulated and evaluated by replaying real life traces which exhibit this highly dynamic topology. Evaluation of new proposed HSBR algorithm was made by comparison with DSR and SBOR. All methods were simulated with different levels of velocity. The results show that HSBR has the highest success of packet delivery, but with higher delay in comparison with DSR, and much lower in comparison with SBOR. Simulation results indicate that HSBR approach can be applicable in networks, where MANET or DTN solutions are separately useless or ineffective. This method provides delivery of the message in every possible situation in areas without infrastructure and can be used as backup method for disaster situation when infrastructure is destroyed.

Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

R. Asokan

2008-01-01

Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA with self-healing and optimized routing techniques (SHORT. SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy.

Dynamic origin-to-destination routing of wirelessly connected, autonomous vehicles on a congested network

Science.gov (United States)

Davis, L. C.

2017-07-01

Up-to-date information wirelessly communicated among vehicles can be used to select the optimal route between a given origin and destination. To elucidate how to make use of such information, simulations are performed for autonomous vehicles traveling on a square lattice of roads. All the possible routes between the origin and the destination (without backtracking) are of the same length. Congestion is the only determinant of delay. At each intersection, right-of-way is given to the closest vehicle. There are no traffic lights. Trip times of a subject vehicle are recorded for various initial conditions using different routing algorithms. Surprisingly, the simplest algorithm, which is based on the total number of vehicles on a route, is as good as one based on computing travel times from the average velocity of vehicles on each road segment.

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

International Nuclear Information System (INIS)

Yang, Han-Xin; Wu, Zhi-Xi

2014-01-01

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

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

International Nuclear Information System (INIS)

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

2010-01-01

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

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model

Directory of Open Access Journals (Sweden)

Yi Yang

2014-01-01

Full Text Available This paper mainly focuses on routing in two-dimensional mesh networks. We propose a novel faulty block model, which is cracky rectangular block, for fault-tolerant adaptive routing. All the faulty nodes and faulty links are surrounded in this type of block, which is a convex structure, in order to avoid routing livelock. Additionally, the model constructs the interior spanning forest for each block in order to keep in touch with the nodes inside of each block. The procedure for block construction is dynamically and totally distributed. The construction algorithm is simple and ease of implementation. And this is a fully adaptive block which will dynamically adjust its scale in accordance with the situation of networks, either the fault emergence or the fault recovery, without shutdown of the system. Based on this model, we also develop a distributed fault-tolerant routing algorithm. Then we give the formal proof for this algorithm to guarantee that messages will always reach their destinations if and only if the destination nodes keep connecting with these mesh networks. So the new model and routing algorithm maximize the availability of the nodes in networks. This is a noticeable overall improvement of fault tolerability of the system.

Browse Title Index

African Journals Online (AJOL)

Items 1 - 50 of 525 ... Vol 2, No 5 (2010), A node-disjoint multi-path routing protocol ... of hot press forming process parameters on mechanical properties of ... of LLC-T series parallel resonant converter using fuzzy logic controller, Abstract PDF.

Rich Vehicle Routing Problems and Applications

DEFF Research Database (Denmark)

Wen, Min

very short computational time on real-life data involving up to 200 pairs of suppliers and customers. The second problem we consider is a dynamic vehicle routing problem with multiple objectives over a planning horizon that consists of multiple periods. In this problem, customer orders are revealed...... the company’s solution in terms of all the objectives, including the travel time, customer waiting and daily workload balances, under the given constraints considered in the work. Finally, we address an integrated vehicle routing and driver scheduling problem, in which a large number of practical constraints....... The method is implemented and tested on real-life data involving up to 2000 orders. It is shown that the method is able to provide solutions of good quality within reasonable running time....

A human-machine cooperation route planning method based on improved A* algorithm

Science.gov (United States)

Zhang, Zhengsheng; Cai, Chao

2011-12-01

To avoid the limitation of common route planning method to blindly pursue higher Machine Intelligence and autoimmunization, this paper presents a human-machine cooperation route planning method. The proposed method includes a new A* path searing strategy based on dynamic heuristic searching and a human cooperated decision strategy to prune searching area. It can overcome the shortage of A* algorithm to fall into a local long term searching. Experiments showed that this method can quickly plan a feasible route to meet the macro-policy thinking.

Route-external and route-internal landmarks in route descriptions : Effects of route length and map design

NARCIS (Netherlands)

Westerbeek, Hans; Maes, Alfons

2013-01-01

Landmarks are basic ingredients in route descriptions. They often mark choice points: locations where travellers choose from different options how to continue the route. This study focuses on one of the loose ends in the taxonomy of landmarks. In a memory-based production experiment in which

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

Science.gov (United States)

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

2013-04-01

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

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

Science.gov (United States)

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

2017-11-01

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

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

Directory of Open Access Journals (Sweden)

Mingchuan Zhang

2015-01-01

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

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

Science.gov (United States)

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.

Spatiotemporal neural network dynamics for the processing of dynamic facial expressions

Science.gov (United States)

Sato, Wataru; Kochiyama, Takanori; Uono, Shota

2015-01-01

The dynamic facial expressions of emotion automatically elicit multifaceted psychological activities; however, the temporal profiles and dynamic interaction patterns of brain activities remain unknown. We investigated these issues using magnetoencephalography. Participants passively observed dynamic facial expressions of fear and happiness, or dynamic mosaics. Source-reconstruction analyses utilizing functional magnetic-resonance imaging data revealed higher activation in broad regions of the bilateral occipital and temporal cortices in response to dynamic facial expressions than in response to dynamic mosaics at 150–200 ms and some later time points. The right inferior frontal gyrus exhibited higher activity for dynamic faces versus mosaics at 300–350 ms. Dynamic causal-modeling analyses revealed that dynamic faces activated the dual visual routes and visual–motor route. Superior influences of feedforward and feedback connections were identified before and after 200 ms, respectively. These results indicate that hierarchical, bidirectional neural network dynamics within a few hundred milliseconds implement the processing of dynamic facial expressions. PMID:26206708

Spatiotemporal neural network dynamics for the processing of dynamic facial expressions.

Science.gov (United States)

Sato, Wataru; Kochiyama, Takanori; Uono, Shota

2015-07-24

The dynamic facial expressions of emotion automatically elicit multifaceted psychological activities; however, the temporal profiles and dynamic interaction patterns of brain activities remain unknown. We investigated these issues using magnetoencephalography. Participants passively observed dynamic facial expressions of fear and happiness, or dynamic mosaics. Source-reconstruction analyses utilizing functional magnetic-resonance imaging data revealed higher activation in broad regions of the bilateral occipital and temporal cortices in response to dynamic facial expressions than in response to dynamic mosaics at 150-200 ms and some later time points. The right inferior frontal gyrus exhibited higher activity for dynamic faces versus mosaics at 300-350 ms. Dynamic causal-modeling analyses revealed that dynamic faces activated the dual visual routes and visual-motor route. Superior influences of feedforward and feedback connections were identified before and after 200 ms, respectively. These results indicate that hierarchical, bidirectional neural network dynamics within a few hundred milliseconds implement the processing of dynamic facial expressions.

Routing Service Quality—Local Driver Behavior Versus Routing Services

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

2013-01-01

of the quality of one kind of location-based service, namely routing services. Specifically, the paper presents a framework that enables the comparison of the routes provided by routing services with the actual driving behaviors of local drivers. Comparisons include route length, travel time, and also route...... popularity, which are enabled by common driving behaviors found in available trajectory data. The ability to evaluate the quality of routing services enables service providers to improve the quality of their services and enables users to identify the services that best serve their needs. The paper covers......Mobile location-based services is a very successful class of services that are being used frequently by users with GPS-enabled mobile devices such as smartphones. This paper presents a study of how to exploit GPS trajectory data, which is available in increasing volumes, for the assessment...

Nonreciprocal signal routing in an active quantum network

Science.gov (United States)

Metelmann, A.; Türeci, H. E.

2018-04-01

As superconductor quantum technologies are moving towards large-scale integrated circuits, a robust and flexible approach to routing photons at the quantum level becomes a critical problem. Active circuits, which contain parametrically driven elements selectively embedded in the circuit, offer a viable solution. Here, we present a general strategy for routing nonreciprocally quantum signals between two sites of a given lattice of oscillators, implementable with existing superconducting circuit components. Our approach makes use of a dual lattice of overdamped oscillators linking the nodes of the main lattice. Solutions for spatially selective driving of the lattice elements can be found, which optimally balance coherent and dissipative hopping of microwave photons to nonreciprocally route signals between two given nodes. In certain lattices these optimal solutions are obtained at the exceptional point of the dynamical matrix of the network. We also demonstrate that signal and noise transmission characteristics can be separately optimized.

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

Directory of Open Access Journals (Sweden)

Gábor Lencse

2015-05-01

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

A Day-to-Day Route Choice Model Based on Reinforcement Learning

Directory of Open Access Journals (Sweden)

Fangfang Wei

2014-01-01

Full Text Available Day-to-day traffic dynamics are generated by individual traveler’s route choice and route adjustment behaviors, which are appropriate to be researched by using agent-based model and learning theory. In this paper, we propose a day-to-day route choice model based on reinforcement learning and multiagent simulation. Travelers’ memory, learning rate, and experience cognition are taken into account. Then the model is verified and analyzed. Results show that the network flow can converge to user equilibrium (UE if travelers can remember all the travel time they have experienced, but which is not necessarily the case under limited memory; learning rate can strengthen the flow fluctuation, but memory leads to the contrary side; moreover, high learning rate results in the cyclical oscillation during the process of flow evolution. Finally, both the scenarios of link capacity degradation and random link capacity are used to illustrate the model’s applications. Analyses and applications of our model demonstrate the model is reasonable and useful for studying the day-to-day traffic dynamics.

Indoor Semantic Modelling for Routing: The Two-Level Routing Approach for Indoor Navigation

Directory of Open Access Journals (Sweden)

Liu Liu

2017-11-01

detailed levels. • On the conceptual level, it supports routing on a logical network and assists the derivation of a conceptual path (i.e., logical path for a user in terms of space sequence. Routing criteria are designed based on the INSM semantics of spaces, which can generate logical paths similar to human wayfinding results such as minimizing VerticalUnit or HorizontalConnector. • On the detailed level, it considers the size of users and results in obstacle-avoiding paths. By using this approach, geometric networks can be generated to avoid obstacles for the given users and accessible paths are flexibly provided for user demands. This approach can process changes of user size more efficiently, in contrast to routing on a complete geometric network. • It supports routing on both the logical and the geometric networks, which can generate geometric paths based on user-specific logical paths, or re-compute logical paths when geometric paths are inaccessible. This computation method is very useful for complex buildings. The two-level routing approach can flexibly provide logical and geometric paths according to user preferences and sizes, and can adjust the generated paths in limited time. Based on the two-level routing approach, this thesis also provides a vision on possible cooperation with other methods. A potential direction is to design more routing options according to other indoor scenarios and user preferences. Extensions of the two-level routing approach, such as other types of semantics, multi-level networks and dynamic obstacles, will make it possible to deal with other routing cases. Last but not least, it is also promising to explore its relationships with indoor guidance, different building subdivisions and outdoor navigation.

Comparative empirical analysis of flow-weighted transit route networks in R-space and evolution modeling

Science.gov (United States)

Huang, Ailing; Zang, Guangzhi; He, Zhengbing; Guan, Wei

2017-05-01

Urban public transit system is a typical mixed complex network with dynamic flow, and its evolution should be a process coupling topological structure with flow dynamics, which has received little attention. This paper presents the R-space to make a comparative empirical analysis on Beijing’s flow-weighted transit route network (TRN) and we found that both the Beijing’s TRNs in the year of 2011 and 2015 exhibit the scale-free properties. As such, we propose an evolution model driven by flow to simulate the development of TRNs with consideration of the passengers’ dynamical behaviors triggered by topological change. The model simulates that the evolution of TRN is an iterative process. At each time step, a certain number of new routes are generated driven by travel demands, which leads to dynamical evolution of new routes’ flow and triggers perturbation in nearby routes that will further impact the next round of opening new routes. We present the theoretical analysis based on the mean-field theory, as well as the numerical simulation for this model. The results obtained agree well with our empirical analysis results, which indicate that our model can simulate the TRN evolution with scale-free properties for distributions of node’s strength and degree. The purpose of this paper is to illustrate the global evolutional mechanism of transit network that will be used to exploit planning and design strategies for real TRNs.

Energy efficient SDN commodity switch based practical flow forwarding method

KAUST Repository

AlGhadhban, Amer

2016-07-04

Recent SDN researches suffer from over-accumulation of unhealthy flow-load. Instead, we leverage the SDN controller network view to encode the end-to-end path information into the packet address. Our solution EncPath significantly reduces the flow-table size and the number of control messages. Consequently, the power consumption of network switches is in orders of magnitude less than other evaluated solutions. It also provides flow management flexibility and scalability. We compare EncPath with single and multipath routing solutions and single path solution. Also, we operated them in proactive and reactive modes. We find that EncPath flow entries in core switches in a multihomed fat-tree with 144 hosts is approximately 1000 times smaller than Equal-Cost MultiPath (ECMP) and random routing. Additionally, the number of control messages to setup the network is reduced by a factor of 200×. This, consequently, affords data-plane and control-plane devices space to process other tasks. © 2016 IEEE.

Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

YongQiang Li

2018-01-01

Full Text Available For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR, is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

State alternative route designations

International Nuclear Information System (INIS)

1989-07-01

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

A Comparative Study of Novel Opportunistic Routing Protocols in Mobile Ad Hoc Networks

OpenAIRE

R. Poonkuzhali; M. Y. Sanavullah; M. R. Gurupriya

2014-01-01

Opportunistic routing is used, where the network has the features like dynamic topology changes and intermittent network connectivity. In Delay tolerant network or Disruption tolerant network opportunistic forwarding technique is widely used. The key idea of opportunistic routing is selecting forwarding nodes to forward data packets and coordination among these nodes to avoid duplicate transmissions. This paper gives the analysis of pros and cons of various opportunistic ...

Extended shortest path selection for package routing of complex networks

Science.gov (United States)

Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi

The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

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

Directory of Open Access Journals (Sweden)

Abbas Mahmoudabadi

2015-01-01

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

Hurricane Evacuation Routes

Data.gov (United States)

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

Routing - a preliminary study of the use of modern information and communication technology

International Nuclear Information System (INIS)

Stjernman, G.

1992-01-01

Communication and data transfer to mobile equipment are in a very active developing face. These technologies might be useful in the work on enhancing the safety of dangerous goods transports. The risk at a certain place, when passed by a transport of dangerous goods, is not the same at every moment. Taking this into account when selecting roads for dangerous goods vehicles so that, for every vehicle, the road most suited at the time in question is selected, should give better results than todays practise. The principles of dynamic routeing of dangerous goods are discussed and the needed and available technologies for implementing dynamic routeing are outlined, as are some other aspects of the implementation. (au)

Pseudo-Cycle-Based Multicast Routing in Wormhole-Routed Networks

Institute of Scientific and Technical Information of China (English)

SONG JianPing (宋建平); HOU ZiFeng (侯紫峰); XU Ming (许铭)

2003-01-01

This paper addresses the problem of fault-tolerant multicast routing in wormholerouted multicomputers. A new pseudo-cycle-based routing method is presented for constructing deadlock-free multicast routing algorithms. With at most two virtual channels this technique can be applied to any connected networks with arbitrary topologies. Simulation results show that this technique results in negligible performance degradation even in the presence of a large number of faulty nodes.

Routing in opportunistic networks

CERN Document Server

Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

2013-01-01

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

Efficient priority queueing routing strategy on networks of mobile agents

Science.gov (United States)

Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

2018-03-01

As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

Complex Dynamics on the Routes to Chaos in a Discrete Predator-Prey System with Crowley-Martin Type Functional Response

Directory of Open Access Journals (Sweden)

Huayong Zhang

2018-01-01

Full Text Available We present in this paper an investigation on a discrete predator-prey system with Crowley-Martin type functional response to know its complex dynamics on the routes to chaos which are induced by bifurcations. Via application of the center manifold theorem and bifurcation theorems, occurrence conditions for flip bifurcation and Neimark-Sacker bifurcation are determined, respectively. Numerical simulations are performed, on the one hand, verifying the theoretical results and, on the other hand, revealing new interesting dynamical behaviors of the discrete predator-prey system, including period-doubling cascades, period-2, period-3, period-4, period-5, period-6, period-7, period-8, period-9, period-11, period-13, period-15, period-16, period-20, period-22, period-24, period-30, and period-34 orbits, invariant cycles, chaotic attractors, sub-flip bifurcation, sub-(inverse Neimark-Sacker bifurcation, chaotic interior crisis, chaotic band, sudden disappearance of chaotic dynamics and abrupt emergence of chaos, and intermittent periodic behaviors. Moreover, three-dimensional bifurcation diagrams are utilized to study the transition between flip bifurcation and Neimark-Sacker bifurcation, and a critical case between the two bifurcations is found. This critical bifurcation case is a combination of flip bifurcation and Neimark-Sacker bifurcation, showing the nonlinear characteristics of both bifurcations.

Performance Analysis of the Enhanced DSR Routing Protocol for the Short Time Disconnected MANET to the OPNET Modeler

Directory of Open Access Journals (Sweden)

PAPAJ Ján

2013-05-01

Full Text Available Disconnected mobile ad-hoc networks (MANET are very important areas of the research. In this article, the performance analysis of the enhanced dynamic source routing protocol (OPP_DSR is introduced. This modification enables the routing process in the case when there are no connections to other mobile nodes. It also will enable the routing mechanisms when the routes, selected by routing mechanisms, are disconnected for some time. Disconnection can be for a short time and standard routing protocol DSR cannot reflect on this situation.The main idea is based on opportunistic forwarding where the nodes not only forward data but it's stored in the cache during long time. The network parameters throughput, routing load and are analysed.

Planning routes around the world: International evidence for southern route preferences

NARCIS (Netherlands)

Brunyé, Tad T.; Andonova, Elena; Meneghetti, Chiara; Noordzij, Matthijs Leendert; Pazzaglia, Francesca; Wienemann, Rasmus; Mahoney, Caroline R.; Taylor, Holly A.

2012-01-01

Three studies test whether the southern route preference, which describes the tendency for route planners to disproportionately select south- rather than north-going routes, can be attributed to regional elevation patterns; specifically, we ask whether this effect replicates in three topographically

Routing policies for a partially observable two-server queueing system

NARCIS (Netherlands)

Ellens, W.; Kovács, P.; Núñez-Queija, R.; Berg, H. van den

2015-01-01

We consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues with independent

Routing policies for a partially observable two-server queueing system

NARCIS (Netherlands)

W. Ellens; P. Kovacs; J.L. van den Berg (Hans); R. Núñez Queija (Rudesindo); A. Busic; M. Gribaudo; P. Reinecke

2015-01-01

htmlabstractWe consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues

An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

DEFF Research Database (Denmark)

Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

deliberation. To tackle these two problems, Mobile Wireless Sensor Networks (MWSNs) is a better choice. In MWSN, Sensor nodes move freely to a target area without the need for any special infrastructure. Due to mobility, the routing process in MWSN has become more complicated as connections in the network can...... such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The authors study the influence of energy heterogeneity and mobility of sensor nodes on the performance of EMRP. The Performance of EMRP compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing...

Acoustic measurement of sediment dynamics in the coastal zones using wireless sensor networks

Science.gov (United States)

Sudhakaran, A., II; Paramasivam, A.; Seshachalam, S.; A, C.

2014-12-01

Analyzing of the impact of constructive or low energy waves and deconstructive or high energy waves in the ocean are very much significant since they deform the geometry of seashore. The deformation may lead to productive result and also to the end of deteriorate damage. Constructive waves results deposition of sediment which widens the beach where as deconstructive waves results erosion which narrows the beach. Validation of historic sediment transportation and prediction of the direction of movement of seashore is essential to prevent unrecoverable damages by incorporating precautionary measurements to identify the factors that influence sediment transportation if feasible. The objective of this study is to propose a more reliable and energy efficient Information and communication system to model the Coastal Sediment Dynamics. Various factors influencing the sediment drift at a particular region is identified. Consequence of source depth and frequency dependencies of spread pattern in the presence of sediments is modeled. Property of source depth and frequency on sensitivity to values of model parameters are determined. Fundamental physical reasons for these sediment interaction effects are given. Shallow to deep water and internal and external wave model of ocean is obtained intended to get acoustic data assimilation (ADA). Signal processing algorithms are used over the observed data to form a full field acoustic propagation model and construct sound speed profile (SSP). The inversions of data due to uncertainties at various depths are compared. The impact of sediment drift over acoustic data is identified. An energy efficient multipath routing scheme Wireless sensor networks (WSN) is deployed for the well-organized communication of data. The WSN is designed considering increased life time, decreased power consumption, free of threats and attacks. The practical data obtained from the efficient system to model the ocean sediment dynamics are evaluated with remote

Opportunity costs calculation in agent-based vehicle routing and scheduling

NARCIS (Netherlands)

Mes, Martijn R.K.; van der Heijden, Matthijs C.; Schuur, Peter

2006-01-01

In this paper we consider a real-time, dynamic pickup and delivery problem with timewindows where orders should be assigned to one of a set of competing transportation companies. Our approach decomposes the problem into a multi-agent structure where vehicle agents are responsible for the routing and

A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters

Science.gov (United States)

Wang, Xiaoming; Lin, Yaguang; Zhang, Shanshan; Cai, Zhipeng

2017-05-01

Sudden disasters such as earthquake, flood and hurricane necessitate the employment of communication networks to carry out emergency response activities. Routing has a significant impact on the functionality, performance and flexibility of communication networks. In this article, the routing problem is studied considering the delivery ratio of messages, the overhead ratio of messages and the average delay of messages in mobile opportunistic networks (MONs) for enterprise-level emergency response communications in sudden disaster scenarios. Unlike the traditional routing methods for MONS, this article presents a new two-stage spreading and forwarding dynamic routing algorithm based on the proposed social activity degree and physical contact factor for mobile customers. A new modelling method for describing a dynamic evolving process of the topology structure of a MON is first proposed. Then a multi-copy spreading strategy based on the social activity degree of nodes and a single-copy forwarding strategy based on the physical contact factor between nodes are designed. Compared with the most relevant routing algorithms such as Epidemic, Prophet, Labelled-sim, Dlife-comm and Distribute-sim, the proposed routing algorithm can significantly increase the delivery ratio of messages, and decrease the overhead ratio and average delay of messages.

Design and Analysis of QoS Routing Framework integrated with OLSR protocol for Multimedia Traffic in Mobile Adhoc Networks

Directory of Open Access Journals (Sweden)

S. Soni

2017-06-01

Full Text Available MANETs (Mobile Ad-hoc Networks is the self organizing wireless structure of mobile hosts. Wireless media is used for communication in MANETs. Considering the developing requirements for multimedia and real-time traffic applications in real world, QoS (Quality-of-Service support is essential in MANETs. But most of the characteristics of MANETs make QoS support a difficult problem. It is challenging to support QoS routing in MANET due to dynamic behavior and mobility of the hosts. The OLSR (Optimized Link State Routing protocol can be efficiently used in MANETs to provide QoS routing because of its dynamic MPR (Multi Point Relay selection criteria and proactive nature. In this paper, a design of QoS routing framework integrated with OLSR protocol is proposed and also analyzed using network simulator. Proposed QoS framework combines a bandwidth estimation algorithm with explicit resource reservation, QoS routing and connection admission control (CAC. OLSR protocol is extended for QoS framework to solve performance issues related to node mobility using cross layer approach. Results after simulation conclude about efficiency of the proposed QoS routing framework.

Transportation routing analysis geographic information system -- TRAGIS, a multimodal transportation routing tool

International Nuclear Information System (INIS)

Johnson, P.E.

1995-01-01

Over 15 years ago, Oak Ridge National Laboratory (ORNL) developed two transportation routing models: HIGHWAY, which predicts truck transportation routes, and INTERLINE, which predicts rail transportation routes. Subsequent modifications have been made to enhance each of these models. Some of these changes include population density information for routes, HM-164 routing regulations for highway route controlled quantities of radioactive materials (RAM) truck shipments, and inclusion of waterway routing into INTERLINE. The AIRPORT model, developed 2 years after the HIGHWAY and INTERLINE models, serves as an emergency response tool. This model identifies the nearest airports from a designated location. Currently, the AIRPORT model is inactive. The Transportation Management Division of the US Department of Energy held a Baseline Requirements Assessment Session on the HIGHWAY, INTERLINE, and AIRPORT models in April 1994 to bring together many users of these models and other experts in the transportation routing field to discuss these models and to decide on the capabilities that needed to be added. Of the many needs discussed, the primary one was to have the network databases within a geographic information system (GIS). As a result of the Baseline Requirements Session, the development of a new GIS model has been initiated. This paper will discuss the development of the new Transportation Routing Analysis GIS (TRAGIS) model at ORNL

VINE ROUTES IN BULGARIA

Directory of Open Access Journals (Sweden)

Lyuben Hristov

2015-03-01

Full Text Available The article deals with a scheme for the modern vine route in Bulgaria. Five basic vine routes and one international, between Bulgaria, Macedonia and Greece are defined. All routes consider characteristic varieties of grapes and kinds of vine products. Vine tourist products combined with visits of important natural and anthropological object are in the bases of the defined routes. The described routes are an important contribution to development of alternative tourist products in the country.

Robust against route failure using power proficient reliable routing in MANET

Directory of Open Access Journals (Sweden)

M. Malathi

2018-03-01

Full Text Available The aim of this paper was to propose a novel routing protocol for Mobile Adhoc Network communication which reduces the route failure during transmission. The proposed routing protocol uses 3 salient parameters to discover the path which ensure the reliable communication. The quality of the channel, link quality and energy level of the node are the major reasons for unintentional node failure in mobile Adhoc network. So the proposed routing protocol considers these three parameters to select the best forwarder node in the path. The reliable data communication is achieved by transmitting data via path selected by the proposed routing scheme has been proven using network simulator (NS2. Keywords: Channel quality, Link quality, Mobile Adhoc Network (MANET, Residual energy

Increased longevity of wireless Ad hoc network through fuzzy system

Directory of Open Access Journals (Sweden)

Fawzia Abdali Larki

2014-06-01

Full Text Available The Ad hoc network is one of the multistep-based self-organizing networks, which are dynamically changing and are taken more into account as the ways of connecting the terminals through the development of wireless communication terminals. We are faced with numerous challenges in designing a wireless network such as the dynamic topology, common and limited bandwidth, and the limited energy. The nodes are moving according to the continuous changes in the topology and the source-to-destination paths are completely broken. Therefore, the repeated route discovery enhances the delay and overload of routing. Thus, it is essential to consider the link stability while designing the path in order to choose the routing protocol. Providing the multiple paths may lead to the better performance than a path. The transmission energy control in the wireless Ad hoc networks is the option for the level of transmission energy in order to transmit each node packet in this system. Therefore, transmission energy control affects the wireless medium interface. Because of choosing the appropriate protocol, the routing operation can be improved and the energy consumption can be controlled properly as well as enhancing the durability and longevity of network. The main objective of this study is to enhance the network longevity. The proposed algorithm in this research considers the combination of 2 parameters including the rate of node energy and number of steps in Fuzzy System applied on AOMDV Protocol, which is a Multipath Routing Protocol. The results of simulation also indicate the improved performance of proposed algorithm (AOMDV-F compared to AODV and AOMDV Protocols in NS2 simulator.

Adaptive local routing strategy on a scale-free network

International Nuclear Information System (INIS)

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

2010-01-01

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

Multi-Objective Weather Routing of Sailing Vessels

Directory of Open Access Journals (Sweden)

Życzkowski Marcin

2017-12-01

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

Key Management Scheme Based on Route Planning of Mobile Sink in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Ying Zhang

2016-01-01

Full Text Available In many wireless sensor network application scenarios the key management scheme with a Mobile Sink (MS should be fully investigated. This paper proposes a key management scheme based on dynamic clustering and optimal-routing choice of MS. The concept of Traveling Salesman Problem with Neighbor areas (TSPN in dynamic clustering for data exchange is proposed, and the selection probability is used in MS route planning. The proposed scheme extends static key management to dynamic key management by considering the dynamic clustering and mobility of MSs, which can effectively balance the total energy consumption during the activities. Considering the different resources available to the member nodes and sink node, the session key between cluster head and MS is established by modified an ECC encryption with Diffie-Hellman key exchange (ECDH algorithm and the session key between member node and cluster head is built with a binary symmetric polynomial. By analyzing the security of data storage, data transfer and the mechanism of dynamic key management, the proposed scheme has more advantages to help improve the resilience of the key management system of the network on the premise of satisfying higher connectivity and storage efficiency.

Key Management Scheme Based on Route Planning of Mobile Sink in Wireless Sensor Networks.

Science.gov (United States)

Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming; Chen, Wei

2016-01-29

In many wireless sensor network application scenarios the key management scheme with a Mobile Sink (MS) should be fully investigated. This paper proposes a key management scheme based on dynamic clustering and optimal-routing choice of MS. The concept of Traveling Salesman Problem with Neighbor areas (TSPN) in dynamic clustering for data exchange is proposed, and the selection probability is used in MS route planning. The proposed scheme extends static key management to dynamic key management by considering the dynamic clustering and mobility of MSs, which can effectively balance the total energy consumption during the activities. Considering the different resources available to the member nodes and sink node, the session key between cluster head and MS is established by modified an ECC encryption with Diffie-Hellman key exchange (ECDH) algorithm and the session key between member node and cluster head is built with a binary symmetric polynomial. By analyzing the security of data storage, data transfer and the mechanism of dynamic key management, the proposed scheme has more advantages to help improve the resilience of the key management system of the network on the premise of satisfying higher connectivity and storage efficiency.

Predictive routing for autonomous mobility-on-demand systems with ride-sharing

NARCIS (Netherlands)

Alonso Mora, J.; Wallar, Alex; Rus, Daniela; Bicchi, A.; Maciejewski, T.

2017-01-01

Ride-sharing, or carpooling, systems with autonomous vehicles will provide efficient and reliable urban mobility on demand. In this work we present a method for dynamic vehicle routing that leverages historical data to improve the performance of a network of self-driving taxis. In particular, we

Route churn: an analysis of low-cost carrier route continuity in Europe

NARCIS (Netherlands)

de Wit, J.G.; Zuidberg, J.

2016-01-01

Discontinuity of air routes is a subject that has been analysed in various ways. For example, the complex network approach focuses on network robustness and resilience due to route interruptions during a relatively short period. Also seasonal interruptions of air routes are a well-documented

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

Energy Technology Data Exchange (ETDEWEB)

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

2009-07-22

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

Adaptive Reliable Routing Based on Cluster Hierarchy for Wireless Multimedia Sensor Networks

Directory of Open Access Journals (Sweden)

Kai Lin

2010-01-01

Full Text Available As a multimedia information acquisition and processing method, wireless multimedia sensor network(WMSN has great application potential in military and civilian areas. Compared with traditional wireless sensor network, the routing design of WMSN should obtain more attention on the quality of transmission. This paper proposes an adaptive reliable routing based on clustering hierarchy named ARCH, which includes energy prediction and power allocation mechanism. To obtain a better performance, the cluster structure is formed based on cellular topology. The introduced prediction mechanism makes the sensor nodes predict the remaining energy of other nodes, which dramatically reduces the overall information needed for energy balancing. ARCH can dynamically balance the energy consumption of nodes based on the predicted results provided by power allocation. The simulation results prove the efficiency of the proposed ARCH routing.

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

International Nuclear Information System (INIS)

Comellas, Francesc; Miralles, Alicia

2011-01-01

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

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

Directory of Open Access Journals (Sweden)

Liu KJ Ray

2002-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2010-05-15

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

Hazmat Routes (National)

Data.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Adamu Murtala Zungeru

2013-01-01

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

A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Lesiba Morries Kola

2017-12-01

Full Text Available The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources. We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV and the weighted cumulative expected transmission time (WCETT routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

A Link Quality and Geographical-aware Routing Protocol for Video Transmission in Mobile IoT

OpenAIRE

Rosário, Denis; Zhao, Zhongliang; Cerqueira, Eduardo; Braun, Torsten; Santos, Aldri

2013-01-01

Wireless mobile sensor networks are enlarging the Internet of Things (IoT) portfolio with a huge number of multimedia services for smart cities. Safety and environmental monitoring multimedia applications will be part of the Smart IoT systems, which aim to reduce emergency response time, while also predicting hazardous events. In these mobile and dynamic (possible disaster) scenarios, opportunistic routing allows routing decisions in a completely distributed manner, by using a hop- by-hop rou...

A Dynamic Tap Allocation for Concurrent CMA-DD Equalizers

Directory of Open Access Journals (Sweden)

Trindade DiegovonBM

2010-01-01

Full Text Available Abstract This paper proposes a dynamic tap allocation for the concurrent CMA-DD equalizer as a low complexity solution for the blind channel deconvolution problem. The number of taps is a crucial factor which affects the performance and the complexity of most adaptive equalizers. Generally an equalizer requires a large number of taps in order to cope with long delays in the channel multipath profile. Simulations show that the proposed new blind equalizer is able to solve the blind channel deconvolution problem with a specified and reduced number of active taps. As a result, it minimizes the output excess mean square error due to inactive taps during and after the equalizer convergence and the hardware complexity as well.

Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks

International Nuclear Information System (INIS)

Comellas, Francesc; Miralles, Alicia

2009-01-01

This paper introduces a labeling and optimal routing algorithm for a family of modular, self-similar, small-world graphs with clustering zero. Many properties of this family are comparable to those of networks associated with technological and biological systems with low clustering, such as the power grid, some electronic circuits and protein networks. For these systems, the existence of models with an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization) and also to understand the underlying mechanisms that have shaped their particular structure.

Simulated performance of an acoustic modem using phase-modulated signals in a time-varying, shallow-water environment

DEFF Research Database (Denmark)

Bjerrum-Niese, Christian; Jensen, Leif Bjørnø

1996-01-01

and dynamic multipath channel. Multipath arrivals at the receiver cause phase distortion and fading of the signal envelope. Yet, for extreme ratios of range to depth, the delays of multipath arrivals decrease, and the channel impulse response coherently contributes energy to the signal at short delays......Underwater acoustic modems using coherent modulation, such as phase-shift keying, have proven to efficiently exploit the bandlimited underwater acoustical communication channel. However, the performance of an acoustic modem, given as maximum range and data and error rate, is limited in the complex...... relative to the first arrival, while longer delays give rise to intersymbol interference. Following this, the signal-to-multipath ratio (SMR) is introduced. It is claimed that the SMR determines the performance rather than the signal-to-noise ratio (SNR). Using a ray model including temporal variations...

An advanced traveler navigation system adapted to route choice preferences of the individual users

Directory of Open Access Journals (Sweden)

Mahyar Amirgholy

2017-12-01

Full Text Available The majority of existing navigation systems only account for a single aspect of the route choice, like travel time or distance, in finding the optimal route for the trips in the network. In this research, we first identify a range of diverse factors that travelers take into account in their route choice decision in the network. A stated preference survey is conducted to show the heterogeneity in the preferences of users and its dependence to the purpose of the trips over the weekdays and weekends. Interestingly, results of the survey show that road safety is the most influential factor in the route choice decision of the average participants over weekends, exceeding even the travel time, and participants give more importance to the scenic quality of the routes for their weekend trips in comparison to their weekday trips. The results of the second part of the survey also indicate that in 27% of the cases participants choose routes other than the ones suggested by navigation systems, and 33% of the times that they take the suggested routes, they modify these routes according to their own preferences. The partial inability of existing navigation systems to suggest the routes that match the preferences of users can be attributed to ignoring (1 the diversity in influential factors and (2 the heterogeneity in preferences of the users by these systems. We propose a dynamic mixed logit route choice model to include the effects of information and learning to estimate parameters of a multivariable utility function for individual users based on their own historical route choice data over time. Finally, we present the concept of a smart navigation system that can gather the required information from real-time and online sources to suggest the routes that best match the users’ own preferences.

Analysis of Greedy Decision Making for Geographic Routing for Networks of Randomly Moving Objects

Directory of Open Access Journals (Sweden)

Amber Israr

2016-04-01

Full Text Available Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network

Traffic Dynamics on Complex Networks: A Survey

Directory of Open Access Journals (Sweden)

Shengyong Chen

2012-01-01

Full Text Available Traffic dynamics on complex networks are intriguing in recent years due to their practical implications in real communication networks. In this survey, we give a brief review of studies on traffic routing dynamics on complex networks. Strategies for improving transport efficiency, including designing efficient routing strategies and making appropriate adjustments to the underlying network structure, are introduced in this survey. Finally, a few open problems are discussed in this survey.

Multihop Wireless Networks Opportunistic Routing

CERN Document Server

Zeng, Kai; Li, Ming

2011-01-01

This book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the technological challenges lying behind opportunistic routing. The authors cover many fundamental research issues for this new concept, including the basic principles, performance limit and performance improvement of opportunistic routing compared to traditional routing, energy efficiency and distributed opportunistic routing protocol desig

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

Directory of Open Access Journals (Sweden)

Omar M. Zakaria

2016-01-01

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

Dynamic Route Choice Modelling of the Effects of Travel Information using RP Data

NARCIS (Netherlands)

De Moraes Ramos, G.

2015-01-01

Traffic congestion is experienced by a great number of travellers during peak hours and is directly influenced by travel-related decisions, such as route choice decisions. In order to minimize problems that arise from congestion, such as delays, uncertainty and environmental effects, there has been

Understanding individual routing behaviour.

Science.gov (United States)

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

2016-03-01

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

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

Directory of Open Access Journals (Sweden)

Ailian Jiang

2018-03-01

Full Text Available Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs. This paper investigates the existing ant colony optimization (ACO-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

A Dynamic Probabilistic Based Broadcasting Scheme for MANETs

Science.gov (United States)

Shanmugam, Kannan; Subburathinam, Karthik; Velayuthampalayam Palanisamy, Arunachalam

2016-01-01

MANET is commonly known as Mobile Ad Hoc Network in which cluster of mobile nodes can communicate with each other without having any basic infrastructure. The basic characteristic of MANET is dynamic topology. Due to the dynamic behavior nature, the topology of the network changes very frequently, and this will lead to the failure of the valid route repeatedly. Thus, the process of finding the valid route leads to notable drop in the throughput of the network. To identify a new valid path to the targeted mobile node, available proactive routing protocols use simple broadcasting method known as simple flooding. The simple flooding method broadcasts the RREQ packet from the source to the rest of the nodes in mobile network. But the problem with this method is disproportionate repetitive retransmission of RREQ packet which could result in high contention on the available channel and packet collision due to extreme traffic in the network. A reasonable number of routing algorithms have been suggested for reducing the lethal impact of flooding the RREQ packets. However, most of the algorithms have resulted in considerable amount of complexity and deduce the throughput by depending on special hardware components and maintaining complex information which will be less frequently used. By considering routing complexity with the goal of increasing the throughput of the network, in this paper, we have introduced a new approach called Dynamic Probabilistic Route (DPR) discovery. The Node's Forwarding Probability (NFP) is dynamically calculated by the DPR mobile nodes using Probability Function (PF) which depends on density of local neighbor nodes and the cumulative number of its broadcast covered neighbors. PMID:27019868

SAFEBIKE: A Bike-sharing Route Recommender with Availability Prediction and Safe Routing

OpenAIRE

Zhong, Weisheng; Chen, Fanglan; Fu, Kaiqun; Lu, Chang-Tien

2017-01-01

This paper presents SAFEBIKE, a novel route recommendation system for bike-sharing service that utilizes station information to infer the number of available bikes in dock and recommend bike routes according to multiple factors such as distance and safety level. The system consists of a station level availability predictor that predicts bikes and docks amount at each station, and an efficient route recommendation service that considers safety and bike/dock availability factors. It targets use...

Personal continuous route pattern mining

Institute of Scientific and Technical Information of China (English)

Qian YE; Ling CHEN; Gen-cai CHEN

2009-01-01

In the daily life, people often repeat regular routes in certain periods. In this paper, a mining system is developed to find the continuous route patterns of personal past trips. In order to count the diversity of personal moving status, the mining system employs the adaptive GPS data recording and five data filters to guarantee the clean trips data. The mining system uses a client/server architecture to protect personal privacy and to reduce the computational load. The server conducts the main mining procedure but with insufficient information to recover real personal routes. In order to improve the scalability of sequential pattern mining, a novel pattern mining algorithm, continuous route pattern mining (CRPM), is proposed. This algorithm can tolerate the different disturbances in real routes and extract the frequent patterns. Experimental results based on nine persons' trips show that CRPM can extract more than two times longer route patterns than the traditional route pattern mining algorithms.

Wavelength converter placement for different RWA algorithms in wavelength-routed all-optical networks

Science.gov (United States)

Chu, Xiaowen; Li, Bo; Chlamtac, Imrich

2002-07-01

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study in this paper further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under fixed-alternate routing algorithm and least-loaded routing algorithm. Under the fixed-alternate routing algorithm, we propose a heuristic algorithm called Minimum Blocking Probability First (MBPF) algorithm for wavelength converter placement. Under the least-loaded routing algorithm, we propose a heuristic converter placement algorithm called Weighted Maximum Segment Length (WMSL) algorithm. The objective of the converter placement algorithm is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance comparing with full wavelength

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

Directory of Open Access Journals (Sweden)

Matteo Mallus

2017-02-01

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

Class network routing

Science.gov (United States)

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

2009-09-08

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

mizuRoute version 1: A river network routing tool for a continental domain water resources applications

Science.gov (United States)

Mizukami, Naoki; Clark, Martyn P.; Sampson, Kevin; Nijssen, Bart; Mao, Yixin; McMillan, Hilary; Viger, Roland; Markstrom, Steven; Hay, Lauren E.; Woods, Ross; Arnold, Jeffrey R.; Brekke, Levi D.

2016-01-01

This paper describes the first version of a stand-alone runoff routing tool, mizuRoute. The mizuRoute tool post-processes runoff outputs from any distributed hydrologic model or land surface model to produce spatially distributed streamflow at various spatial scales from headwater basins to continental-wide river systems. The tool can utilize both traditional grid-based river network and vector-based river network data. Both types of river network include river segment lines and the associated drainage basin polygons, but the vector-based river network can represent finer-scale river lines than the grid-based network. Streamflow estimates at any desired location in the river network can be easily extracted from the output of mizuRoute. The routing process is simulated as two separate steps. First, hillslope routing is performed with a gamma-distribution-based unit-hydrograph to transport runoff from a hillslope to a catchment outlet. The second step is river channel routing, which is performed with one of two routing scheme options: (1) a kinematic wave tracking (KWT) routing procedure; and (2) an impulse response function – unit-hydrograph (IRF-UH) routing procedure. The mizuRoute tool also includes scripts (python, NetCDF operators) to pre-process spatial river network data. This paper demonstrates mizuRoute's capabilities to produce spatially distributed streamflow simulations based on river networks from the United States Geological Survey (USGS) Geospatial Fabric (GF) data set in which over 54 000 river segments and their contributing areas are mapped across the contiguous United States (CONUS). A brief analysis of model parameter sensitivity is also provided. The mizuRoute tool can assist model-based water resources assessments including studies of the impacts of climate change on streamflow.

Cooperative Optimization QoS Cloud Routing Protocol Based on Bacterial Opportunistic Foraging and Chemotaxis Perception for Mobile Internet

Directory of Open Access Journals (Sweden)

Shujuan Wang

2015-01-01

Full Text Available In order to strengthen the mobile Internet mobility management and cloud platform resources utilization, optimizing the cloud routing efficiency is established, based on opportunistic bacterial foraging bionics, and puts forward a chemotaxis perception of collaborative optimization QoS (Quality of Services cloud routing mechanism. The cloud routing mechanism is based on bacterial opportunity to feed and bacterial motility and to establish the data transmission and forwarding of the bacterial population behavior characteristics. This mechanism is based on the characteristics of drug resistance of bacteria and the structure of the field, and through many iterations of the individual behavior and population behavior the bacteria can be spread to the food gathering area with a certain probability. Finally, QoS cloud routing path would be selected and optimized based on bacterial bionic optimization and hedge mapping relationship between mobile Internet node and bacterial population evolution iterations. Experimental results show that, compared with the standard dynamic routing schemes, the proposed scheme has shorter transmission delay, lower packet error ratio, QoS cloud routing loading, and QoS cloud route request overhead.

Developing an eco-routing application.

Science.gov (United States)

2014-01-01

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

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

Science.gov (United States)

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

2017-12-01

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

Optimization for routing vehicles of seafood product transportation

Science.gov (United States)

Soenandi, I. A.; Juan, Y.; Budi, M.

2017-12-01

Recently, increasing usage of marine products is creating new challenges for businesses of marine products in terms of transportation that used to carry the marine products like seafood to the main warehouse. This can be a problem if the carrier fleet is limited, and there are time constraints in terms of the freshness of the marine product. There are many ways to solve this problem, including the optimization of routing vehicles. In this study, this strategy is to implement in the marine product business in Indonesia with such an expected arrangement of the company to optimize routing problem in transportation with time and capacity windows. Until now, the company has not used the scientific method to manage the routing of their vehicle from warehouse to the location of marine products source. This study will solve a stochastic Vehicle Routing Problems (VRP) with time and capacity windows by using the comparison of six methods and looking the best results for the optimization, in this situation the company could choose the best method, in accordance with the existing condition. In this research, we compared the optimization with another method such as branch and bound, dynamic programming and Ant Colony Optimization (ACO). Finally, we get the best result after running ACO algorithm with existing travel time data. With ACO algorithm was able to reduce vehicle travel time by 3189.65 minutes, which is about 23% less than existing and based on consideration of the constraints of time within 2 days (including rest time for the driver) using 28 tons capacity of truck and the companies need two units of vehicles for transportation.

Attention and awareness influence amygdala activity for dynamic bodily expressions - A short review.

Directory of Open Access Journals (Sweden)

Beatrice eDe Gelder

2012-08-01

Full Text Available The amygdala (AMG has long been viewed as the gateway to sensory processing of emotions and is also known to play an importanta role at the interface between cognition and emotion. However, the debate continues on whether AMG activation is independent of attentional demands. Recently, researchers started exploring AMG functions using dynamic stimuli rather than the traditional pictures of facial expressions. Our present goal is to review some recent studies using dynamic stimuli to investigate AMG activation and discuss the impact of different viewing conditions, including oddball detection, explicit or implicit recognition, variable cognitive task load, and non-conscious perception. In the second part we relate these different effects to a dynamic dual route model of affective processing and discuss its implications for AMG activity. We sketch a dynamic dual route perspective of affective perception and we argue that this allows for multiple AMG involvement in separate networks and at different times in the processing streams. Attention has a different impact on these separate but interacting networks. Route I is engaged in early emotion processing, is partly supported by AMG activity and is possibly independent of attention, whereas activity in the later emotion processing is influenced by attention. Route II is a cortical-based network that underlies body recognition and action representation. The end result of route I and II is reflexive and voluntary behavior respectively. We conclude that using dynamic emotion stimuli and a dynamic dual route model of affective perception can provide new insights into the varieties of AMG activation.

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

Directory of Open Access Journals (Sweden)

Nader Abdullah Khadam

2018-03-01

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

Robustness of airline route networks

Science.gov (United States)

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

2016-03-01

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

Border Collision Route to Quasiperiodicity: Numerical Investigation and Experimental Confirmation

DEFF Research Database (Denmark)

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

2006-01-01

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

RECONFIGURABLE PRODUCT ROUTING AND CONTROL FOR MASS CUSTOMISATION MANUFACTURING

Directory of Open Access Journals (Sweden)

A. J. Walker

2012-01-01

Full Text Available

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

AFRIKAANSE OPSOMMING:Verstelbare beheer van aanpasbare vervaardigingstelsels kan die doeltreffende en reaktiewe produksie van doelgemaakte produkeksemplare toelaat. Hierdie beheer kan assisteer in die voorsiening van vervaardig-na-bestellingbesigheidsmodelle aan ’n aantal klein- tot medium-grootte ondernemings in Suid-Afrika, en aan hulle ’n kompeterende voorsprong bied in ’n dinamiese globale mark. Die instelling van verstelbare beheer vereis dat die modi van produkveranderlikheid in massa verbruikersaanpassingsvervaardiging verstaan word. Hierdie artikel spreek die probleem van aanpasbare roetebepaling van materiaalvragte in massa verbruikersaanpassingsvervaardiging aan. ’n Mobiele robot-platform, ontwikkel vir navorsing in verstelbare roetebepalingstelsels, word ook voorgelê.

LOTIR: A Routing Protocol for Multi-hop V-to-I Communication Using Local Traffic Information

Directory of Open Access Journals (Sweden)

Kun-chan Lan

2012-08-01

Full Text Available Vehicular Ad Hoc Network (VANET is an emerging technology that can be applied to safety, transport efficiency, or infotainment applications for roads and highways. However, due to its unique features, such as dynamic mobility patterns and uneven distributions of vehicles, VANET faces many challenging research issues for robust data dissemination in the network. Many routing protocols have been proposed for VANET in the past few years, and the idea of utilizing a navigation system to assist the routing protocol for selecting the next best forwarder has become increasingly popular. However, it might not be realistic to assume that every vehicle is equipped with a navigation system. In addition, due to privacy concerns, drivers might not want to reveal their planned routes to other cars. In this work, we propose a new routing protocol, called LOTIR (LOcal Traffic Information Routing, that relies on only local traffic information and does not require the assistance of a navigation system. LOTIR is a DTN-based routing protocol that utilizes the car-following theory and traffic light information to decide the next carrier to forward the data to. We implement LOTIR in NS-2, and our results show that it can achieve similar performance as prior work which depends on the availability of global network topology information.

An overview of smart grid routing algorithms

Science.gov (United States)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

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

Southern states' routing agency report

International Nuclear Information System (INIS)

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

Southern States' Routing Agency Report

International Nuclear Information System (INIS)

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

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

MULTIPATH COMMUNICATIONS USING NAMES

OpenAIRE

Purushothama, Rashmi

2011-01-01

Increased host mobility, and multi-homing make IP address management very complex in applications. Due to host mobility, the IP address of a host may change dynamically, and also frequently. Multi-homing leads to multiple IP addresses for a single host. Name-based socket is a solution to address the complex IP address management. It relieves the applications from the overhead, and moves it to the operating system. It uses a constant name, instead of an IP address to establish a connection, th...

Congestion control and routing over satellite networks

Science.gov (United States)

Cao, Jinhua

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

Guidelines for selecting preferred highway routes for highway-route-controlled quantity shipments of radioactive materials

International Nuclear Information System (INIS)

1989-01-01

The document presents guidelines for use by State officials in selecting preferred routes for highway route controlled quantity shipments of radioactive materials. A methodology for analyzing and comparing safety factors of alternative routes is described. Technical information on the impacts of radioactive material transportation needed to apply the methodology is also presented. Application of the methodology will identify the route (or set of routes) that minimizes the radiological impacts from shipments of these radioactive materials within a given State. Emphasis in the document is on practical application of the methodology. Some details of the derivation of the methods and data are presented in the appendices. All references in the body of the report can be found listed in the Bibliography (Appendix F)

Performance modeling of neighbor discovery in proactive routing protocols

Directory of Open Access Journals (Sweden)

Andres Medina

2011-07-01

Full Text Available It is well known that neighbor discovery is a critical component of proactive routing protocols in wireless ad hoc networks. However there is no formal study on the performance of proposed neighbor discovery mechanisms. This paper provides a detailed model of key performance metrics of neighbor discovery algorithms, such as node degree and the distribution of the distance to symmetric neighbors. The model accounts for the dynamics of neighbor discovery as well as node density, mobility, radio and interference. The paper demonstrates a method for applying these models to the evaluation of global network metrics. In particular, it describes a model of network connectivity. Validation of the models shows that the degree estimate agrees, within 5% error, with simulations for the considered scenarios. The work presented in this paper serves as a basis for the performance evaluation of remaining performance metrics of routing protocols, vital for large scale deployment of ad hoc networks.

Strategies for Selecting Routes through Real-World Environments: Relative Topography, Initial Route Straightness, and Cardinal Direction.

Directory of Open Access Journals (Sweden)

Tad T Brunyé

Full Text Available Previous research has demonstrated that route planners use several reliable strategies for selecting between alternate routes. Strategies include selecting straight rather than winding routes leaving an origin, selecting generally south- rather than north-going routes, and selecting routes that avoid traversal of complex topography. The contribution of this paper is characterizing the relative influence and potential interactions of these strategies. We also examine whether individual differences would predict any strategy reliance. Results showed evidence for independent and additive influences of all three strategies, with a strong influence of topography and initial segment straightness, and relatively weak influence of cardinal direction. Additively, routes were also disproportionately selected when they traversed relatively flat regions, had relatively straight initial segments, and went generally south rather than north. Two individual differences, extraversion and sense of direction, predicted the extent of some effects. Under real-world conditions navigators indeed consider a route's initial straightness, cardinal direction, and topography, but these cues differ in relative influence and vary in their application across individuals.

Routing and scheduling problems

DEFF Research Database (Denmark)

Reinhardt, Line Blander

couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...

A Dynamic Travel Time Estimation Model Based on Connected Vehicles

Directory of Open Access Journals (Sweden)

Daxin Tian

2015-01-01

Full Text Available With advances in connected vehicle technology, dynamic vehicle route guidance models gradually become indispensable equipment for drivers. Traditional route guidance models are designed to direct a vehicle along the shortest path from the origin to the destination without considering the dynamic traffic information. In this paper a dynamic travel time estimation model is presented which can collect and distribute traffic data based on the connected vehicles. To estimate the real-time travel time more accurately, a road link dynamic dividing algorithm is proposed. The efficiency of the model is confirmed by simulations, and the experiment results prove the effectiveness of the travel time estimation method.

Risk assessment of alternative proliferation routes

International Nuclear Information System (INIS)

Ahmed, S.; Husseiny, A.A.

1982-01-01

Multi-Attribute Decision Theory is applied to rank II alternative routes to nuclear proliferation in order of difficulty in acquiring nuclear weapons by nonnuclear countries. The method is based on reducing the various variables affecting the decision to a single function providing a measure for the proliferation route. The results indicate that the most difficult route to obtain atomic weapons is through nuclear power reactors, specifically the liquid-metal fast breeder reactor, heavy water Canada deuterium uranium reactor, and light water reactors such as boiling water and pressurized water reactors. The easiest routes are supercritical centrifuge isotope separation, laser isotope separation, and research reactor. However, nonnuclear routes available that result in substantial damage to life and property are easier than any nuclear route

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

International Nuclear Information System (INIS)

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

1998-05-01

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

Collective network routing

Science.gov (United States)

Hoenicke, Dirk

2014-12-02

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

Route Scherrer and Route Einstein closed for construction work

CERN Multimedia

2015-01-01

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

Highway route controlled quantity shipment routing reports - An overview

International Nuclear Information System (INIS)

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

1989-01-01

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

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

Data.gov (United States)

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

Routing and wavelength assignment based on normalized resource and constraints for all-optical network

Science.gov (United States)

Joo, Seong-Soon; Nam, Hyun-Soon; Lim, Chang-Kyu

2003-08-01

With the rapid growth of the Optical Internet, high capacity pipes is finally destined to support end-to-end IP on the WDM optical network. Newly launched 2D MEMS optical switching module in the market supports that expectations of upcoming a transparent optical cross-connect in the network have encouraged the field applicable research on establishing real all-optical transparent network. To open up a customer-driven bandwidth services, design of the optical transport network becomes more challenging task in terms of optimal network resource usage. This paper presents a practical approach to finding a route and wavelength assignment for wavelength routed all-optical network, which has λ-plane OXC switches and wavelength converters, and supports that optical paths are randomly set up and released by dynamic wavelength provisioning to create bandwidth between end users with timescales on the order of seconds or milliseconds. We suggest three constraints to make the RWA problem become more practical one on deployment for wavelength routed all-optical network in network view: limitation on maximum hop of a route within bearable optical network impairments, limitation on minimum hops to travel before converting a wavelength, and limitation on calculation time to find all routes for connections requested at once. We design the NRCD (Normalized Resource and Constraints for All-Optical Network RWA Design) algorithm for the Tera OXC: network resource for a route is calculated by the number of internal switching paths established in each OXC nodes on the route, and is normalized by ratio of number of paths established and number of paths equipped in a node. We show that it fits for the RWA algorithm of the wavelength routed all-optical network through real experiments on the distributed objects platform.

Route-specific analysis for radioactive materials transportation

International Nuclear Information System (INIS)

1986-01-01

This report addresses a methodology for route-specific analysis, of which route-selection is one aspect. Identification and mitigation of specific hazards along a chosen route is another important facet of route-specific analysis. Route-selection and route-specific mitigation are two tools to be used in minimizing the risk of radioactive materials transportation and promoting public confidence. Other tools exist to improve the safety of transportation under the Nuclear Waste Policy Act. Selection of a transportation mode and other, non-route-specific measures, such as improved driver training and improved cask designs, are additional tools to minimize transportation risk and promote public confidence. This report addresses the route-specific analysis tool and does not attempt to evaluate its relative usefulness as compared to other available tools. This report represents a preliminary attempt to develop a route-specific analysis methodlogy. The Western Interstate Energy Board High-Level Waste Committee has formed a Route-Specific Analysis Task Force which will build upon the methodology proposed in this Staff Report. As western states continue to investigate route-specific analysis issues, it is expected that the methodology will evolve into a more refined product representing the views of a larger group of interested parties in the West

A lightweight neighbor-info-based routing protocol for no-base-station taxi-call system.

Science.gov (United States)

Zhu, Xudong; Wang, Jinhang; Chen, Yunchao

2014-01-01

Since the quick topology change and short connection duration, the VANET has had unstable routing and wireless signal quality. This paper proposes a kind of lightweight routing protocol-LNIB for call system without base station, which is applicable to the urban taxis. LNIB maintains and predicts neighbor information dynamically, thus finding the reliable path between the source and the target. This paper describes the protocol in detail and evaluates the performance of this protocol by simulating under different nodes density and speed. The result of evaluation shows that the performance of LNIB is better than AODV which is a classic protocol in taxi-call scene.

Crisis route to chaos in semiconductor lasers subjected to external optical feedback

Science.gov (United States)

Wishon, Michael J.; Locquet, Alexandre; Chang, C. Y.; Choi, D.; Citrin, D. S.

2018-03-01

Semiconductor lasers subjected to optical feedback have been intensively used as archetypical testbeds for high-speed (sub-ns) and high-dimensional nonlinear dynamics. By simultaneously extracting all the dynamical variables, we demonstrate that for larger current, the commonly named "quasiperiodic" route is in fact based on mixed external-cavity solutions that lock the oscillation frequency of the intensity, voltage, and separation in optical frequency through a mechanism involving successive rejections along the unstable manifold of an antimode. We show that chaos emerges from a crisis resulting from the inability to maintain locking as the unstable manifold becomes inaccessible.

Predicting transportation routes for radioactive wastes

International Nuclear Information System (INIS)

Joy, D.S.; Johnson, P.E.; Clarke, D.B.; McGuire, S.C.

1981-01-01

Oak Ridge National Laboratory (ORNL) has been involved in transportation logistics of radioactive wastes as part of the overall waste transportation program. A Spent Fuel Logistics Model (SFLM), was developed to predict overall material balances representing the flow of spent fuel assemblies from reactors to away-from-reactor storage facilities and/or to federal repositories. The transportation requirements to make these shipments are also itemized. The next logical step in the overall transportation project was the development of a set of computer codes which would predict likely transportation routes for waste shipments. Two separate routing models are now operational at ORNL. Routes for truck transport can be estimated with the HIGHWAY program, and rail and barge routes can be predicted with the INTERLINE model. This paper discusses examples of the route estimates and applications of the routing models

RSRP: A Robust Secure Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Sinha Ditipriya

2014-05-01

Full Text Available In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs. This algorithm is based on some basic schemes such as RSA_CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR, secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

Human risk assessment of dermal and inhalation exposures to chemicals assessed by route-to-route extrapolation: the necessity of kinetic data.

Science.gov (United States)

Geraets, Liesbeth; Bessems, Jos G M; Zeilmaker, Marco J; Bos, Peter M J

2014-10-01

In toxicity testing the oral route is in general the first choice. Often, appropriate inhalation and dermal toxicity data are absent. Risk assessment for these latter routes usually has to rely on route-to-route extrapolation starting from oral toxicity data. Although it is generally recognized that the uncertainties involved are (too) large, route-to-route extrapolation is applied in many cases because of a strong need of an assessment of risks linked to a given exposure scenario. For an adequate route-to-route extrapolation the availability of at least some basic toxicokinetic data is a pre-requisite. These toxicokinetic data include all phases of kinetics, from absorption (both absorbed fraction and absorption rate for both the starting route and route of interest) via distribution and biotransformation to excretion. However, in practice only differences in absorption between the different routes are accounted for. The present paper demonstrates the necessity of route-specific absorption data by showing the impact of its absence on the uncertainty of the human health risk assessment using route-to-route extrapolation. Quantification of the absorption (by in vivo, in vitro or in silico methods), particularly for the starting route, is considered essential. Copyright © 2014 Elsevier Inc. All rights reserved.

Vehicle Routing With User Generated Trajectory Data

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

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

Flow control and routing techniques for integrated voice and data networks

Science.gov (United States)

Ibe, O. C.

1981-10-01

We consider a model of integrated voice and data networks. In this model the network flow problem is formulated as a convex optimization problem. The objective function comprises two types of cost functions: the congestion cost functions, which limit the average input traffic to values compatible with the network conditions; and the rate limitation cost functions, which ensure that all conversations are fairly treated. A joint flow control and routing algorithm is constructed which determines the routes for each conversation, and effects flow control by setting voice packet lengths and data input rates in a manner that achieves optimal tradeoff between each user's satisfaction and the cost of network congestion. An additional congestion control protocol is specified which could be used in conjunction with the algorithm to make the latter respond more dynamically to network congestion.

A set packing inspired method for real-time junction train routing

DEFF Research Database (Denmark)

Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

2013-01-01

Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily...... basis at major railway junctions where disruptions to rail traffic make the planned schedule/routing infeasible and rolling stock planners are forced to re-schedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly....... In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming...

A Set Packing Inspired Method for Real-Time Junction Train Routing

DEFF Research Database (Denmark)

Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily...... basis at major railway junctions where disruptions to rail traffi c make the planned schedule/routing infeasible and rolling stock planners are forced to reschedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly....... In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming...

JISCARD GUI, a graphical interface application for simple and quick calculation of aviation route doses

International Nuclear Information System (INIS)

Andersson, Martin; Ryufuku, Susumu; Yasuda, Hiroshi

2011-01-01

Pilots, flight attendants, and passengers aboard jet aircrafts are subjected to higher cosmic radiation levels at high altitude than on the ground. Additional dose, received during flight is called 'aviation route dose'. Addressing the needs for precise and easy determination of aviation route doses (Sv), the authors have developed a new application 'JISCARD GUI' with a graphical user interface which provides dose rate (Sv/h) distribution along a flight route and aviation route dose. The graphical interface made with Adobe Flash provide functions to select airports on dynamic map or to search by airport/city names, and to report resulting aviation route doses and graphs of dose rate change through a flight. Dose rate data at several cut off rigidity, Rc and force field potential, FFP were calculated in advance using a PHITS-based analytical model and stored in the server as matrix data. Upon user's request of departure/arrival airports and flight date, interpolation using matrix data substantiates derivation of dose rate distribution in a simple and quick manner with sufficient accuracy. Precision of the dose calculation was verified by comparison with JISCARD EX (MS-Excel version) released in September 2008. This advanced application will be open to public through the website of the National Institute of Radiological Sciences in the near future. (author)

A Genetic Algorithm on Inventory Routing Problem

Directory of Open Access Journals (Sweden)

Nevin Aydın

2014-03-01

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

Energy efficient motion control of the electric bus on route

Science.gov (United States)

Kotiev, G. O.; Butarovich, D. O.; Kositsyn, B. B.

2018-02-01

At present, the urgent problem is the reduction of energy costs of urban motor transport. The article proposes a method of solving this problem by developing an energy-efficient law governing the movement of an electric bus along a city route. To solve this problem, an algorithm is developed based on the dynamic programming method. The proposed method allows you to take into account the constraints imposed on the phase coordinates, control action, as well as on the time of the route. In the course of solving the problem, the model of rectilinear motion of an electric bus on a horizontal reference surface is considered, taking into account the assumptions that allow it to be adapted for the implementation of the method. For the formation of a control action in the equations of motion dynamics, an algorithm for changing the traction / braking torque on the wheels of an electric bus is considered, depending on the magnitude of the control parameter and the speed of motion. An optimal phase trajectory was obtained on a selected section of the road for the prototype of an electric bus. The article presents the comparison of simulation results obtained with the optimal energy efficient control law with the results obtained by a test driver. The comparison proved feasibility of the energy efficient control law for the automobile city electric transport.

Zone routing in a torus network

Science.gov (United States)

Chen, Dong; Heidelberger, Philip; Kumar, Sameer

2013-01-29

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

Capacity Constrained Routing Algorithms for Evacuation Route Planning

National Research Council Canada - National Science Library

Lu, Qingsong; George, Betsy; Shekhar, Shashi

2006-01-01

.... In this paper, we propose a new approach, namely a capacity constrained routing planner which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints...

Entanglement-Gradient Routing for Quantum Networks.

Science.gov (United States)

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

DEFF Research Database (Denmark)

Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize proFIt by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel....... We devise a solution method based on column generation with a dynamic programming algorithm to generate columns. The method is heuristic mainly due to a discretization of the continuous bunker purchase variables. We show that the integrated planning approach can increase profits and that the decision...

Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization

DEFF Research Database (Denmark)

Vilhelmsen, Charlotte; Lusby, Richard Martin; Larsen, Jesper

A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize pro_t by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a _xed route network and itinerary as liner ships. Marine fuel...... and bunker consumption. We devise a solution method based on column generation with a dynamic programming algorithm to generate columns. The method is heuristic mainly due to a discretization of the continuous bunker purchase variables. We show that the integrated planning approach can increase pro...

Routes to spatiotemporal chaos in Kerr optical frequency combs.

Science.gov (United States)

Coillet, Aurélien; Chembo, Yanne K

2014-03-01

We investigate the various routes to spatiotemporal chaos in Kerr optical frequency combs, obtained through pumping an ultra-high Q-factor whispering-gallery mode resonator with a continuous-wave laser. The Lugiato-Lefever model is used to build bifurcation diagrams with regards to the parameters that are externally controllable, namely, the frequency and the power of the pumping laser. We show that the spatiotemporal chaos emerging from Turing patterns and solitons display distinctive dynamical features. Experimental spectra of chaotic Kerr combs are also presented for both cases, in excellent agreement with theoretical spectra.

The Pyramidal Capacitated Vehicle Routing Problem

DEFF Research Database (Denmark)

Lysgaard, Jens

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

The pyramidal capacitated vehicle routing problem

DEFF Research Database (Denmark)

Lysgaard, Jens

2010-01-01

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

Routed planar networks

Directory of Open Access Journals (Sweden)

David J. Aldous

2016-04-01

Full Text Available Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\\em routes} rather than {\\em edges} as primitives. This article is intended to introduce the relevant (discrete setting notion of {\\em routed network} to graph theorists. We give a naive classification of all 71 topologically different such networks on 4 leaves, and pose a variety of challenging research questions.

Road Routes for Waste Disposal - MDC_RecyclingRoute

Data.gov (United States)

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

Porcelain tiles by the dry route

International Nuclear Information System (INIS)

Melchiades, F. G.; Daros, M. T.; Boschi, A. O.

2010-01-01

In Brazil, the second largest tile producer of the world, at present, 70% of the tiles are produced by the dry route. One of the main reasons that lead to this development is the fact that the dry route uses approximately 30% less thermal energy them the traditional wet route. The increasing world concern with the environment and the recognition of the central role played by the water also has pointed towards privileging dry processes. In this context the objective of the present work is to study the feasibility of producing high quality porcelain tiles by the dry route. A brief comparison of the dry and wet route, in standard conditions industrially used today to produce tiles that are not porcelain tiles, shows that there are two major differences: the particle sizes obtained by the wet route are usually considerably finer and the capability of mixing the different minerals, the intimacy of the mixture, is also usually better in the wet route. The present work studied the relative importance of these differences and looked for raw materials and operational conditions that would result in better performance and glazed porcelain tiles of good quality. (Author) 7 refs.

VANET Routing Protocols: Pros and Cons

OpenAIRE

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

2012-01-01

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

Effect of exposure routes on the relationships of lethal toxicity to rats from oral, intravenous, intraperitoneal and intramuscular routes.

Science.gov (United States)

Ning, Zhong H; Long, Shuang; Zhou, Yuan Y; Peng, Zi Y; Sun, Yi N; Chen, Si W; Su, Li M; Zhao, Yuan H

2015-11-01

The lethal toxicity values (log 1/LD(50)) of 527 aliphatic and aromatic compounds in oral, intravenous, intramuscular and intraperitoneal routes were used to investigate the relationships of log 1/LD(50) from different exposure routes. Regression analysis shows that the log 1/LD(50) values are well correlated between intravenous and intraperitoneal or intramuscular injections. However, the correlations between oral and intravenous or intraperitoneal routes are relatively poor. Comparison of the average residuals indicates that intravenous injection is the most sensitive exposure route and oral administration is the least sensitive exposure route. This is attributed to the difference in kinetic process of toxicity testing. The toxic effect of a chemical can be similar or significantly different between exposure routes, depending on the absorption rates of chemicals into blood. Inclusion of hydrophobic parameter and fractions of ionic forms can improve the correlations between intravenous and intraperitoneal or oral routes, but not between intraperitoneal and oral routes. This is due to the differences of absorption rate in different exposure environments from different routes. Several factors, such as experimental uncertainty, metabolism and toxic kinetics, can affect the correlations between intravenous and intraperitoneal or oral routes. Copyright © 2015 Elsevier Inc. All rights reserved.

An algorithm for routing optimization in DiffServ-aware MPLS networks

OpenAIRE

Luigi Atzori; Fabio D'Andreagiovanni; Carlo Mannino; Tatiana Onali

2010-01-01

This paper addresses the constrained-based routing problem in DiffServaware MPLS networks. We consider a dynamic context in which new requests appear over time, asking for reconfigurations of the previous allocation. In the classical approach, a multi-phase heuristic procedure is adopted: the new requests are evaluated considering available bandwidth; if the bandwidth is not sufficient, preemption and rerouting of one or more connections are performed in sequence. As an alternative, we propos...

Dynamic optical routing and simultaneous generation of millimeter-wave signals for in-building access network

NARCIS (Netherlands)

Zou, S.; Okonkwo, C.M.; Cao, Z.; Tran, N.C.; Tangdiongga, E.; Koonen, A.M.J.

2012-01-01

Two-stage optical routing using SOA and integrated micro-ring resonator, and remote generation of millimeter-wave signals by optical frequency multiplication is demonstrated for inbuilding network. Both 150Mb/s 64-QAM and 802.11a WLAN signal at 38GHz are transmitted.

Dynamics of Air Passenger Transportation in Eastern Romania

Directory of Open Access Journals (Sweden)

Dan Păuna

2013-10-01

Full Text Available The concept of an air route mile is, of course, entirely different from that of a road or rail route mile. An air route is a direct service between two cities. The too-rapid development of the air route system must inevitably result in an average intensity of operations on the route, and this means the frequencies are low or high, or the airplanes used are profitable or unprofitable. The purpose of this paper is to emphasize air passenger dynamics in Romania and to calculate specific indicators regarding this calculation for the airports in eastern Romania in 2011t., this, because the air passenger featurea indicator passenger – kilometer, starting with 2009 no longer calculate for aviation and shipping.

Highway and interline transportation routing models

International Nuclear Information System (INIS)

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

1994-01-01

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

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

Directory of Open Access Journals (Sweden)

Haibin Yu

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

Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

Science.gov (United States)

Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

2018-01-01

Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

Whirlpool routing for mobility

KAUST Repository

Lee, Jung Woo

2010-01-01

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

Research on Innovating, Applying Multiple Paths Routing Technique Based on Fuzzy Logic and Genetic Algorithm for Routing Messages in Service - Oriented Routing

Directory of Open Access Journals (Sweden)

Nguyen Thanh Long

2015-02-01

Full Text Available MANET (short for Mobile Ad-Hoc Network consists of a set of mobile network nodes, network configuration changes very fast. In content based routing, data is transferred from source node to request nodes is not based on destination addresses. Therefore, it is very flexible and reliable, because source node does not need to know destination nodes. If We can find multiple paths that satisfies bandwidth requirement, split the original message into multiple smaller messages to transmit concurrently on these paths. On destination nodes, combine separated messages into the original message. Hence it can utilize better network resources, causes data transfer rate to be higher, load balancing, failover. Service Oriented Routing is inherited from the model of content based routing (CBR, combined with several advanced techniques such as Multicast, multiple path routing, Genetic algorithm to increase the data rate, and data encryption to ensure information security. Fuzzy logic is a logical field study evaluating the accuracy of the results based on the approximation of the components involved, make decisions based on many factors relative accuracy based on experimental or mathematical proof. This article presents some techniques to support multiple path routing from one network node to a set of nodes with guaranteed quality of service. By using these techniques can decrease the network load, congestion, use network resources efficiently.

Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm.

Science.gov (United States)

Hannan, M A; Akhtar, Mahmuda; Begum, R A; Basri, H; Hussain, A; Scavino, Edgar

2018-01-01

Waste collection widely depends on the route optimization problem that involves a large amount of expenditure in terms of capital, labor, and variable operational costs. Thus, the more waste collection route is optimized, the more reduction in different costs and environmental effect will be. This study proposes a modified particle swarm optimization (PSO) algorithm in a capacitated vehicle-routing problem (CVRP) model to determine the best waste collection and route optimization solutions. In this study, threshold waste level (TWL) and scheduling concepts are applied in the PSO-based CVRP model under different datasets. The obtained results from different datasets show that the proposed algorithmic CVRP model provides the best waste collection and route optimization in terms of travel distance, total waste, waste collection efficiency, and tightness at 70-75% of TWL. The obtained results for 1 week scheduling show that 70% of TWL performs better than all node consideration in terms of collected waste, distance, tightness, efficiency, fuel consumption, and cost. The proposed optimized model can serve as a valuable tool for waste collection and route optimization toward reducing socioeconomic and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Children's route choice during active transportation to school: Difference between shortest and actual route

NARCIS (Netherlands)

Dessing, D.; Vries, S.I. de; Hegeman, G.; Verhagen, E.; Mechelen, W. van; Pierik, F.H.

2016-01-01

Background: The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible

A source-initiated on-demand routing algorithm based on the Thorup-Zwick theory for mobile wireless sensor networks.

Science.gov (United States)

Mao, Yuxin; Zhu, Ping

2013-01-01

The unreliability and dynamics of mobile wireless sensor networks make it hard to perform end-to-end communications. This paper presents a novel source-initiated on-demand routing mechanism for efficient data transmission in mobile wireless sensor networks. It explores the Thorup-Zwick theory to achieve source-initiated on-demand routing with time efficiency. It is able to find out shortest routing path between source and target in a network and transfer data in linear time. The algorithm is easy to be implemented and performed in resource-constrained mobile wireless sensor networks. We also evaluate the approach by analyzing its cost in detail. It can be seen that the approach is efficient to support data transmission in mobile wireless sensor networks.

Analysing Stagecoach Network Problem Using Dynamic ...

African Journals Online (AJOL)

In this paper we present a recursive dynamic programming algorithm for solving the stagecoach problem. The algorithm is computationally more efficient than the first method as it obtains its minimum total cost using the suboptimal policies of the different stages without computing the cost of all the routes. By the dynamic ...

Policy Gradient SMDP for Resource Allocation and Routing in Integrated Services Networks

Science.gov (United States)

Vien, Ngo Anh; Viet, Nguyen Hoang; Lee, Seunggwan; Chung, Taechoong

In this paper, we solve the call admission control (CAC) and routing problem in an integrated network that handles several classes of calls of different values and with different resource requirements. The problem of maximizing the average reward (or cost) of admitted calls per unit time is naturally formulated as a semi-Markov Decision Process (SMDP) problem, but is too complex to allow for an exact solution. Thus in this paper, a policy gradient algorithm, together with a decomposition approach, is proposed to find the dynamic (state-dependent) optimal CAC and routing policy among a parameterized policy space. To implement that gradient algorithm, we approximate the gradient of the average reward. Then, we present a simulation-based algorithm to estimate the approximate gradient of the average reward (called GSMDP algorithm), using only a single sample path of the underlying Markov chain for the SMDP of CAC and routing problem. The algorithm enhances performance in terms of convergence speed, rejection probability, robustness to the changing arrival statistics and an overall received average revenue. The experimental simulations will compare our method's performance with other existing methods and show the robustness of our method.

Route selection issues for NWPA shipments

International Nuclear Information System (INIS)

Hill, C.V.; Harrison, I.G.

1993-01-01

Questions surrounding the designation of routes for the movement of spent nuclear fuel (SNF) and high-level radioactive waste (HLW) by the Office of Civilian Radioactive Waste Management (OCRWM) have broad implications. Federal regulations prescribe rules to be applied in the selection of highway routes. In most cases, these rules will lead to a clear selection of one route between an origin and destination point. However, in other cases, strict application of the regulations does not result in a clear choice of a preferred route. The regulations also provide discretion to State governments and carriers to select alternative routes to enhance the safety of the shipment. Railroad shipments of radioactive materials are not subject to Federal routing regulations. Since the railroads operate on private property, it has been assumed that they know the best way to move freight on their system. This discretion, while desirable for addressing unique local safety concerns or for responding to temporary safety concerns such as road problems, weather conditions, or construction areas, leads to significant opportunity for misunderstandings and uneasiness on the part of local residents

FFT Bifurcation Analysis of Routes to Chaos via Quasiperiodic Solutions

Directory of Open Access Journals (Sweden)

L. Borkowski

2015-01-01

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

The Comparative Study Some of Reactive and Proactive Routing Protocols in The Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Anas Ali Hussien

2018-02-01

Full Text Available The wireless sensor network (WSN consists mostly of a large number of nodes in a large area where not all nodes are directly connected. The applications of comprise a wide variety of scenarios.The mobile nodes are free to move because this network has selfــstructured topology. Routing protocols are responsible for detecting and maintaining paths in the network, and it classified into reactive (OnـــDemand, proactive (Table driven, and hybrid. In this paper represents a performance study of some WSN routing protocols: the Dynamic Source Routing (DSR, Ad hoc On-Demand Distance Vector (AODV, and Destination-Sequenced Distance-Vector (DSDV. The comparison made according to important metrics like packet delivery ratio (PDR, total packets dropped, Average end-to-end delay (Avg EED, and normalized routing load under the Transmission Control Protocol (TCP and User Datagram Protocol (UDP traffic connection and with varying number of nodes, pause time; and  varying speed. In this work used (NSــ2.35 that installed on (Ubuntu 14.04 operating system to implementing the scenario. Conclude that the DSR has better performance in TCP connection; while the DSDV has better performance in UDP protocol.

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Science.gov (United States)

Alena, Richard I.; Lee, Charles

2004-01-01

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the

A Comprehensive Real-Time Traffic Map for Geographic Routing in VANETs

Directory of Open Access Journals (Sweden)

Chi-Fu Huang

2017-01-01

Full Text Available Vehicular Ad Hoc Networks (VANETs have attracted a lot of attention during the last decade. VANETs can not only improve driving safety, but also convenience, and support most future Intelligent Transportation System (ITS. Due to the highly dynamic network topology of VANETs, many geographic routing protocols have been proposed and use real-time traffic information as an important metric to select a reliable forwarding path. However, most of the existing works do not describe how to gather real-time traffic. They either assume this information is already available, or can query an existing traffic center. Few studies have noticed this issue but the proposed solutions only consider a small region. In this paper, we propose a Comprehensive Real-Time Traffic Map (CRT Map to collect wide-ranging real-time traffic information with low overhead. In the design of a CRT Map, the concept of Crowdsensing is adopted. Vehicles cooperatively gather traffic information and share it with each other to construct an overview of the whole road network traffic. In addition, we design a CRT Map Based Routing (CBR, which takes into account the connectivity of consecutive roads in routing decisions. Simulation results show that the CBR can achieve a lower end-to-end delay and a higher packet delivery ratio.

Port Authority of Allegheny County Transit Routes

Data.gov (United States)

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

Advances in dynamic network modeling in complex transportation systems

CERN Document Server

Ukkusuri, Satish V

2013-01-01

This book focuses on the latest in dynamic network modeling, including route guidance and traffic control in transportation systems and other complex infrastructure networks. Covers dynamic traffic assignment, flow modeling, mobile sensor deployment and more.

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

Science.gov (United States)

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

2016-04-01

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

Environmental factors along the Northern Sea Route

International Nuclear Information System (INIS)

Fjeld, P.E.

1993-01-01

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

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

Science.gov (United States)

Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A; Al-Muhtadi, Jalal; Rodrigues, Joel J P C; Khalil, Mohammed Sayim; Ali Ahmed, Adel

2016-03-31

The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

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

Science.gov (United States)

Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A.; Al-Muhtadi, Jalal; Rodrigues, Joel J. P. C.; Khalil, Mohammed Sayim; Ali Ahmed, Adel

2016-01-01

The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks. PMID:27043572

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

Directory of Open Access Journals (Sweden)

Kashif Saleem

2016-03-01

Full Text Available 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.

Generating Heat Maps of Popular Routes Online from Massive Mobile Sports Tracking Application Data in Milliseconds While Respecting Privacy

Directory of Open Access Journals (Sweden)

Jani Sainio

2015-09-01

Full Text Available The breakthrough of GPS-equipped smartphones has enabled the collection of track data from human mobility on massive scales that can be used in route recommendation, urban planning and traffic management. In this work we present a fast map server that can generate and visualize heat maps of popular routes online from massive sports track data based on client preferences, e.g., running routes lasting less than an hour. The heat maps shown respect user privacy by not showing routes with less than a predefined number of different users, for instance five. The results are represented to the client using a dynamic tile layer. The current implementation uses data collected by the Sports Tracker mobile application with over 800,000 different tracks and 2.8 billion GPS data points. Stress tests indicate that the server can handle hundreds of simultaneous client requests in a single server configuration.

CAN Tree Routing for Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao LI

2014-01-01

Full Text Available We propose a novel topology to improve the routing performance of Content- Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree by means of equipping each node with a few long links towards some distant nodes. The long links enhance routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is O(log n, which is much better than a uniform greedy routing, while each node maintains two long links in average.

Pheromone based alternative route planning

Directory of Open Access Journals (Sweden)

Liangbing Feng

2016-08-01

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

Route planning algorithms: Planific@ Project

Directory of Open Access Journals (Sweden)

Gonzalo Martín Ortega

2009-12-01

Full Text Available Planific@ is a route planning project for the city of Madrid (Spain. Its main aim is to develop an intelligence system capable of routing people from one place in the city to any other using the public transport. In order to do this, it is necessary to take into account such things as: time, traffic, user preferences, etc. Before beginning to design the project is necessary to make a comprehensive study of the variety of main known route planning algorithms suitable to be used in this project.

Vehicle routing problem in investment fund allocation

Science.gov (United States)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Mohd, Ismail

2013-04-01

Since its introduction by Dantzig and Ramser in 1959, vehicle routing problem keeps evolving in theories, applications and variability. The evolution in computing and technology are also important contributors to research in solving vehicle routing problem. The main sectors of interests among researchers and practitioners for vehicle routing problem are transportation, distribution and logistics. However, literature found that concept and benefits of vehicle routing problem are not taken advantages of by researchers in the field of investment. Other methods found used in investment include multi-objective programming, linear programming, goal programming and integer programming. Yet the application of vehicle routing problem is not fully explored. A proposal on a framework of the fund allocation optimization using vehicle routing problem is presented here. Preliminary results using FTSE Bursa Malaysia data testing the framework are also given.

The Social Relationship Based Adaptive Multi-Spray-and-Wait Routing Algorithm for Disruption Tolerant Network

Directory of Open Access Journals (Sweden)

Jianfeng Guan

2017-01-01

Full Text Available The existing spray-based routing algorithms in DTN cannot dynamically adjust the number of message copies based on actual conditions, which results in a waste of resource and a reduction of the message delivery rate. Besides, the existing spray-based routing protocols may result in blind spots or dead end problems due to the limitation of various given metrics. Therefore, this paper proposes a social relationship based adaptive multiple spray-and-wait routing algorithm (called SRAMSW which retransmits the message copies based on their residence times in the node via buffer management and selects forwarders based on the social relationship. By these means, the proposed algorithm can remove the plight of the message congestion in the buffer and improve the probability of replicas to reach their destinations. The simulation results under different scenarios show that the SRAMSW algorithm can improve the message delivery rate and reduce the messages’ dwell time in the cache and further improve the buffer effectively.

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

Science.gov (United States)

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

2017-11-01

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

Comparison of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2011-09-01

Full Text Available in each and every relay node so as to find the next hop for the packet. A routing metric is simply a measure used for selecting the best path, used by a routing protocol. Figure 2 shows the relationship between a routing protocol and the routing... on its QoS-awareness level. The routing metrics that considered QoS the most were selected from each group. This section discusses the four routing metrics that were compared in this paper, which are: hop count (HOP), expected transmission count (ETX...

Aircraft route forecasting under adverse weather conditions

Directory of Open Access Journals (Sweden)

Thomas Hauf

2017-04-01

Full Text Available In this paper storm nowcasts in the terminal manoeuvring area (TMA of Hong Kong International Airport are used to forecast deviation routes through a field of storms for arriving and departing aircraft. Storms were observed and nowcast by the nowcast system SWIRLS from the Hong Kong Observatory. Storms were considered as no-go zones for aircraft and deviation routes were determined with the DIVSIM software package. Two days (21 and 22 May 2011 with 22 actual flown routes were investigated. Flights were simulated with a nowcast issued at the time an aircraft entered the TMA or departed from the airport. These flights were compared with a posteriori simulations, in which all storm fields were known and circumnavigated. Both types of simulated routes were then compared with the actual flown routes. The qualitative comparison of the various routes revealed generally good agreement. Larger differences were found in more complex situations with many active storms in the TMA. Route differences resulted primarily from air traffic control measures imposed such as holdings, slow-downs and shortcuts, causing the largest differences between the estimated and actual landing time. Route differences could be enhanced as aircraft might be forced to circumnavigate a storm ahead in a different sense. The use of route forecasts to assist controllers coordinating flights in a complex moving storm field is discussed. The study emphasises the important application of storm nowcasts in aviation meteorology.

The Silk Route from Land to Sea

Directory of Open Access Journals (Sweden)

Jack Weatherford

2018-04-01

Full Text Available The Silk Route reached its historic and economic apogee under the Mongol Empire (1207–1368, as a direct result of the policies of Chinggis Khan (Genghis Khan and his successors. Because the land network proved inefficient for the amount of goods needing transport from one part of the empire to another, the Mongols expanded the Silk Route to ocean shipping and thus created the first Maritime Silk Route. The sea traffic initially expanded the land routes but soon strangled them. With the expansion of the Maritime Silk Route through the fourteenth century, the land connections reverted to local networks and lost their global importance.

Development of a multi-path ultrasonic flow meter for the application to feedwater flow measurement in nuclear power plants

International Nuclear Information System (INIS)

Jong, J. C.; Ha, J. H.; Kim, Y. H.; Jang, W. H.; Park, K. S.; Park, M. S.; Park, M. H.

2002-01-01

In this work, we propose a method to measure the feedwater flow using multi-path ultrasonic flow meter (UFM). Since the UFM measures a path velocity at which the ultrasonic wave is propagated, the flow profile may be important to convey the path velocity to the velocity averaged over the entire cross section of the flowing medium. The conventional UFM has used the smooth-wall circular pipe model presented by Nikurades. However, this model covers a lower range which is less than 3.2 million while the Reynolds number of the feedwater flow in operating nuclear power plants (NPPs) is about 20 million. Therefore, we feedwater flow in operating nuclear power plants (NPPs) is about 20 million. Therefore, we proposed the non-linear correlation model that combines the ratio between the DP output and proposed the non-linear correlation model that combines the ratio between the DP output and UFM output. Experiments were performed using both computer simulation and newly constructed NPPs' test data. The uncertainty analysis result shows that the proposed method has reasonably lower uncertainty than conventional UFM

On the cost/delay tradeoff of wireless delay tolerant geographic routing

OpenAIRE

Tasiopoulos, Argyrios; Tsiaras, Christos; Toumpis, Stavros

2012-01-01

In Delay Tolerant Networks (DTNs), there is a fundamental tradeoff between the aggregate transport cost of a packet and the delay in its delivery. We study this tradeoff in the context of geographical routing in wireless DTNs.We ?rst specify the optimal cost/delay tradeoff, i.e., the tradeoff under optimal network operation, using a dynamic network construction termed the Cost/Delay Evolving Graph (C/DEG) and the Optimal Cost/Delay Curve (OC/DC), a function that gives the minimum possible agg...

On a Nonstationary Route Problem with Constraints

Directory of Open Access Journals (Sweden)

A. G. Chentsov

2012-01-01

Full Text Available The extremal route problem of permutations under constraints in the form of preceding conditions is investigated. It is supposed that an executer leaves the initial point (the base after which he visits a system of megalopolises (finite goal sets and performs some work on each megalopolis. The cost functions for executor permutations and interior works depend on the “visiting moment” that can correspond to the real time or can also correspond to the natural regular succession (the first visiting, the second visiting, and so on. An economic variant of the widely interpreted dynamic programming method (DPM is constructed. On this basis an optimal computer realized algorithm is constructed. A variant of a greed algorithm is proposed.

Fatigue mitigation effects of en-route napping on commercial airline pilots flying international routes

Science.gov (United States)

Baldwin, Jarret Taylor

The introduction of ultra-long range commercial aircraft and the evolution of the commercial airline industry has provided new opportunities for air carriers to fly longer range international route segments while deregulation, industry consolidation, and the constant drive to reduce costs wherever possible has pressured airline managements to seek more productivity from their pilots. At the same time, advancements in the understanding of human physiology have begun to make their way into flight and duty time regulations and airline scheduling practices. In this complex and ever changing operating environment, there remains an essential need to better understand how these developments, and other daily realities facing commercial airline pilots, are affecting their fatigue management strategies as they go about their rituals of getting to and from their homes to work and performing their flight assignments. Indeed, the need for commercial airline pilots to have access to better and more effective fatigue mitigation tools to combat fatigue and insure that they are well rested and at the top of their game when flying long-range international route segments has never been greater. This study examined to what extent the maximum fatigue states prior to napping, as self-accessed by commercial airline pilots flying international route segments, were affected by a number of other common flight assignment related factors. The study also examined to what extent the availability of scheduled en-route rest opportunities, in an onboard crew rest facility, affected the usage of en-route napping as a fatigue mitigation strategy, and to what extent the duration of such naps affected the perceived benefits of such naps as self-accessed by commercial airline pilots flying international route segments. The study utilized an online survey tool to collect data on crew position, prior flight segments flown in the same duty period, augmentation, commuting, pre-flight rest obtained in the

Perception bias in route choice

NARCIS (Netherlands)

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

2014-01-01

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

User habits and multimodal route planning

Directory of Open Access Journals (Sweden)

Géza Katona

2017-10-01

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

Routing Data Authentication in Wireless Networks; TOPICAL

International Nuclear Information System (INIS)

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

2001-01-01

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

Energy Efficiency Analysis for Dynamic Routing in Optical Transport Networks

DEFF Research Database (Denmark)

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

2012-01-01

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

Molecular Frame Reconstruction Using Time-Domain Photoionization Interferometry.

Science.gov (United States)

Marceau, Claude; Makhija, Varun; Platzer, Dominique; Naumov, A Yu; Corkum, P B; Stolow, Albert; Villeneuve, D M; Hockett, Paul

2017-08-25

Photoionization of molecular species is, essentially, a multipath interferometer with both experimentally controllable and intrinsic molecular characteristics. In this work, XUV photoionization of impulsively aligned molecular targets (N_{2}) is used to provide a time-domain route to "complete" photoionization experiments, in which the rotational wave packet controls the geometric part of the photoionization interferometer. The data obtained is sufficient to determine the magnitudes and phases of the ionization matrix elements for all observed channels, and to reconstruct molecular frame interferograms from lab frame measurements. In principle, this methodology provides a time-domain route to complete photoionization experiments and the molecular frame, which is generally applicable to any molecule (no prerequisites), for all energies and ionization channels.

The Time Window Vehicle Routing Problem Considering Closed Route

Science.gov (United States)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

The Vehicle Routing Problem (VRP) determines the optimal set of routes used by a fleet of vehicles to serve a given set of customers on a predefined graph; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we study a variant of the predefined graph: given a weighted graph G and vertices a and b, and given a set X of closed paths in G, find the minimum total travel cost of a-b path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model

Buckshot Routing with Distance Vectors in Three Application Scenarios for Wireless Sensor Networks with Unstable Network Topologies and Unidirectional Links

Directory of Open Access Journals (Sweden)

Reinhardt Karnapke

2015-02-01

Full Text Available Experiments have shown that the number of asymmetric and unidirectional links often exceeds the number of bidirectional ones, especially in the transitional area of the communication range of wireless sensor nodes. Still, most of today’s routing protocols ignore their existence or try to remove their implications. Also, links are not stable over time, and routes become unusable often, resulting in a need for new routing protocols that can handle highly dynamic links and use unidirectional links to their advantage. At SENSORCOMM' 2014, we presented BuckshotDV, a routing protocol which is resilient against link fluctuations and uses the longer reach of unidirectional links to increase its performance. Furthermore, its distance vector nature makes it scalable for large sensor networks. This paper is an extended version which adds some implementation details and the evaluation of BuckshotDV in two more application scenarios.

A Machine Learning Concept for DTN Routing

Science.gov (United States)

Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

2017-01-01

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

Chaotic systems are dynamically random

International Nuclear Information System (INIS)

Svozil, K.

1988-01-01

The idea is put forward that the significant route to chaos is driven by recursive iterations of suitable evolution functions. The corresponding formal notion of randomness is not based on dynamic complexity rather than on static complexity. 24 refs. (Author)

SD-EAR: Energy Aware Routing in Software Defined Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Anuradha Banerjee

2018-06-01

Full Text Available In today’s internet-of-things (IoT environment, wireless sensor networks (WSNs have many advantages, with broad applications in different areas including environmental monitoring, maintaining security, etc. However, high energy depletion may lead to node failures in WSNs. In most WSNs, nodes deplete energy mainly because of the flooding and broadcasting of route-request (RREQ packets, which is essential for route discovery in WSNs. The present article models wireless sensor networks as software-defined wireless sensor networks (SD-WSNs where the network is divided into multiple clusters or zones, and each zone is controlled by a software-defined network (SDN controller. The SDN controller is aware of the topology of each zone, and finds out the optimum energy efficient path from any source to any destination inside the zone. For destinations outside of the zone, the SDN controller of the source zone instructs the source to send a message to all of the peripheral nodes in that zone, so that they can forward the message to the peripheral nodes in other zones, and the process goes on until a destination is found. As far as energy-efficient path selection is concerned, the SDN controller of a zone is aware of the connectivity and residual energy of each node. Therefore, it is capable of discovering an optimum energy efficient path from any source to any destination inside as well as outside of the zone of the source. Accordingly, flow tables in different routers are updated dynamically. The task of route discovery is shifted from individual nodes to controllers, and as a result, the flooding of route-requests is completely eliminated. Software-defined energy aware routing (SD-EARalso proposes an innovative sleeping strategy where exhausted nodes are allowed to go to sleep through a sleep request—sleep grant mechanism. All of these result in huge energy savings in SD-WSN, as shown in the simulation results.

Cultural Tourism in the Urban Context: Museologic Routes – The cases of Aveiro and Ílhavo (Portugal

Directory of Open Access Journals (Sweden)

Sara Vidal Maia

2013-08-01

Full Text Available This study identifies how crucial are the relationships between cultural resources and touristic attractions, passing through a journey of transmutation that meets two essential requirements: the need for cultural storytelling or information and the need of providing a unique experience to cultural consumers. One of the most successful products, in the relationship between tourism and culture, are museum routes. This ex-post facto study creates a whole cultural-touristic dynamic through museum routes and their planning in urban areas. We also try to encompass the museum activity of Aveiro and Ílhavo in order to protect and promote sociocultural and patrimonial resources. Our main goal consists on the integration of related areas such as tradition, heritage, art, costumes, crafts, ethnography and history by creating a stronger regional cultural touristic product, that we named “Route Museums, Memories and Stories in the Urban Context of Aveiro and Ílhavo”.

Warehouse order-picking process. Order-picker routing problem

Directory of Open Access Journals (Sweden)

E. V. Korobkov

2015-01-01

Full Text Available This article continues “Warehouse order-picking process” cycle and describes order-picker routing sub-problem of a warehouse order-picking process. It draws analogies between the orderpickers’ routing problem and traveling salesman’s problem, shows differences between the standard problem statement of a traveling salesman and routing problem of warehouse orderpickers, and gives the particular Steiner’s problem statement of a traveling salesman.Warehouse layout with a typical order is represented by a graph, with some its vertices corresponding to mandatory order-picker’s visits and some other ones being noncompulsory. The paper describes an optimal Ratliff-Rosenthal algorithm to solve order-picker’s routing problem for the single-block warehouses, i.e. warehouses with only two crossing aisles, defines seven equivalent classes of partial routing sub-graphs and five transitions used to have an optimal routing sub-graph of a order-picker. An extension of optimal Ratliff-Rosenthal order-picker routing algorithm for multi-block warehouses is presented and also reasons for using the routing heuristics instead of exact optimal algorithms are given. The paper offers algorithmic description of the following seven routing heuristics: S-shaped, return, midpoint, largest gap, aisle-by-aisle, composite, and combined as well as modification of combined heuristics. The comparison of orderpicker routing heuristics for one- and two-block warehouses is to be described in the next article of the “Warehouse order-picking process” cycle.

Routing algorithms in networks-on-chip

CERN Document Server

Daneshtalab, Masoud

2014-01-01

This book provides a single-source reference to routing algorithms for Networks-on-Chip (NoCs), as well as in-depth discussions of advanced solutions applied to current and next generation, many core NoC-based Systems-on-Chip (SoCs). After a basic introduction to the NoC design paradigm and architectures, routing algorithms for NoC architectures are presented and discussed at all abstraction levels, from the algorithmic level to actual implementation.  Coverage emphasizes the role played by the routing algorithm and is organized around key problems affecting current and next generation, many-core SoCs. A selection of routing algorithms is included, specifically designed to address key issues faced by designers in the ultra-deep sub-micron (UDSM) era, including performance improvement, power, energy, and thermal issues, fault tolerance and reliability.   ·         Provides a comprehensive overview of routing algorithms for Networks-on-Chip and NoC-based, manycore systems; ·         Describe...

Stochastic vehicle routing with recourse

DEFF Research Database (Denmark)

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

2012-01-01

instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...

Integer Optimization Model for a Logistic System based on Location-Routing Considering Distance and Chosen Route

Science.gov (United States)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

In a distribution network it is important to decide the locations of facilities that impacts not only the profitability of an organization but the ability to serve customers.Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we impose restriction on the route that should be passed for delivery. We use integer programming model to describe the problem. A feasible neighbourhood search is proposed to solve the result model.

Dynamic traffic assignment : genetic algorithms approach

Science.gov (United States)

1997-01-01

Real-time route guidance is a promising approach to alleviating congestion on the nations highways. A dynamic traffic assignment model is central to the development of guidance strategies. The artificial intelligence technique of genetic algorithm...

Comprehensive experimental analysis of nonlinear dynamics in an optically-injected semiconductor laser

Directory of Open Access Journals (Sweden)

Kevin Schires

2011-09-01

Full Text Available We present the first comprehensive experimental study, to our knowledge, of the routes between nonlinear dynamics induced in a semiconductor laser under external optical injection based on an analysis of time-averaged measurements of the optical and RF spectra and phasors of real-time series of the laser output. The different means of analysis are compared for several types of routes and the benefits of each are discussed in terms of the identification and mapping of the nonlinear dynamics. Finally, the results are presented in a novel audio/video format that describes the evolution of the dynamics with the injection parameters.

Great Ellipse Route Planning Based on Space Vector

Directory of Open Access Journals (Sweden)

LIU Wenchao

2015-07-01

Full Text Available Aiming at the problem of navigation error caused by unified earth model in great circle route planning using sphere model and modern navigation equipment using ellipsoid mode, a method of great ellipse route planning based on space vector is studied. By using space vector algebra method, the vertex of great ellipse is solved directly, and description of great ellipse based on major-axis vector and minor-axis vector is presented. Then calculation formulas of great ellipse azimuth and distance are deduced using two basic vectors. Finally, algorithms of great ellipse route planning are studied, especially equal distance route planning algorithm based on Newton-Raphson(N-R method. Comparative examples show that the difference of route planning between great circle and great ellipse is significant, using algorithms of great ellipse route planning can eliminate the navigation error caused by the great circle route planning, and effectively improve the accuracy of navigation calculation.

The Route Analysis Based On Flight Plan

Science.gov (United States)

Feriyanto, Nur; Saleh, Chairul; Fauzi, Achmad; Rachman Dzakiyullah, Nur; Riza Iwaputra, Kahfi

2016-02-01

Economic development effects use of air transportation since the business process in every aspect was increased. Many people these days was prefer using airplane because it can save time and money. This situation also effects flight routes, many airlines offer new routes to deal with competition. Managing flight routes is one of the problems that must be faced in order to find the efficient and effective routes. This paper investigates the best routes based on flight performance by determining the amount of block fuel for the Jakarta-Denpasar flight route. Moreover, in this work compares a two kinds of aircraft and tracks by calculating flight distance, flight time and block fuel. The result shows Jakarta-Denpasar in the Track II has effective and efficient block fuel that can be performed by Airbus 320-200 aircraft. This study can contribute to practice in making an effective decision, especially helping executive management of company due to selecting appropriate aircraft and the track in the flight plan based on the block fuel consumption for business operation.

Is Entrepreneurship a Route Out of Deprivation?

DEFF Research Database (Denmark)

Frankish, Julian S.; Roberts, Richard G.; Coad, Alexander Jean-Luc

2014-01-01

Frankish J. S., Roberts R. G., Coad A. and Storey D. J. Is entrepreneurship a route out of deprivation?, Regional Studies. This paper investigates whether entrepreneurship constitutes a route out of deprivation for those living in deprived areas. The measure of income/wealth used is based...... the wealth distribution. Hence, entrepreneurship can be a route out of deprivation....

A study of routing algorithms for SCI-Based multistage networks

International Nuclear Information System (INIS)

Wu Bin; Kristiansen, E.; Skaali, B.; Bogaerts, A.; )

1994-03-01

The report deals with a particular class of multistage Scalable Coherent Interface (SCI) network systems and two important routing algorithms, namely self-routing and table-look up routing. The effect of routing delay on system performance is investigated by simulations. Adaptive routing and deadlock-free routing are studied. 8 refs., 11 figs., 1 tab

Dynamics of Number of Packets in Transit in Free Flow State of Data Network

International Nuclear Information System (INIS)

Shengkun Xie; Lawniczak, A.T.

2011-01-01

We study how the dynamics of Number of Packets in Transit (NPT) is affected by the coupling of a routing type with a volume of incoming packet traffic in a data network model of packet switching type. The NPT is a network performance indicator of an aggregate type that measures in '' real time '', how many packets are in the network on their routes to their destinations. We conduct our investigation using a time-discrete simulation model that is an abstraction of the Network Layer of the ISO OSI Seven Layer Reference Model. This model focuses on packets and their routing. We consider a static routing and two different types of dynamic routings coupled with different volumes of incoming packet traffic in the network free flow state. Our study shows that the order of the values of the NPT mean value time series depends on the coupling of a routing type with a volume of incoming packet traffic and changes when the volume of incoming packet traffic increases and is closed to the critical source load values, i.e. when it is closed to the phase transition points from the network free flow state to its congested states. (authors)

Dynamic traffic assignment based trailblazing guide signing for major traffic generator.

Science.gov (United States)

2009-11-01

The placement of guide signs and the display of dynamic massage signs greatly affect drivers : understanding of the network and therefore their route choices. Most existing dynamic traffic assignment : models assume that drivers heading to a Major...

Towards seasonal Arctic shipping route predictions

Science.gov (United States)

Haines, K.; Melia, N.; Hawkins, E.; Day, J. J.

2017-12-01

In our previous work [1] we showed how trans-Arctic shipping routes would become more available through the 21st century as sea ice declines, using CMIP5 models with means and stds calibrated to PIOMAS sea ice observations. Sea ice will continue to close shipping routes to open water vessels through the winter months for the foreseeable future so the availability of open sea routes will vary greatly from year to year. Here [2] we look at whether the trans-Arctic shipping season period can be predicted in seasonal forecasts, again using several climate models, and testing both perfect and imperfect knowledge of the initial sea ice conditions. We find skilful predictions of the upcoming summer shipping season can be made from as early as January, although typically forecasts may show lower skill before a May `predictability barrier'. Focussing on the northern sea route (NSR) off Siberia, the date of opening of this sea route is twice as variable as the closing date, and this carries through to reduced predictability at the start of the season. Under climate change the later freeze-up date accounts for 60% of the lengthening season, Fig1 We find that predictive skill is state dependent with predictions for high or low ice years exhibiting greater skill than for average ice years. Forecasting the exact timing of route open periods is harder (more weather dependent) under average ice conditions while in high and low ice years the season is more controlled by the initial ice conditions from spring onwards. This could be very useful information for companies planning vessel routing for the coming season. We tested this dependence on the initial ice conditions by changing the initial ice state towards climatologically average conditions and show directly that early summer sea-ice thickness information is crucial to obtain skilful forecasts of the coming shipping season. Mechanisms for this are discussed. This strongly suggests that good sea ice thickness observations

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2016-02-01

Full Text Available Abstrak OSPF (Open Shortest Path First dan EIGRP (Enhanced Interior Gateway Routing Protocol adalah dua routing protokol yang banyak digunakan dalam jaringan komputer. Perbedaan karakteristik antar routing protokol menimbulkan masalah dalam pengiriman paket data. Teknik redistribution adalah solusi untuk melakukan komunikasi antar routing protokol. Dengan menggunakan software Cisco Packet Tracer 5.3 pada penelitian ini dibuat simulasi OSPF dan EIGRP yang dihubungkan oleh teknik redistribution, kemudian dibandingkan kualitasnya dengan single routing protokol EIGRP dan OSPF. Parameter pengujian dalam penelitian ini adalah nilai time delay dan trace route. Nilai trace route berdasarkan perhitungan langsung cost dan metric dibandingkan dengan hasil simulasi. Hasilnya dapat dilakukan proses redistribution OSPF dan EIGRP. Nilai delay redistribution lebih baik 1% dibanding OSPF dan 2-3% di bawah EIGRP tergantung kepadatan traffic. Dalam perhitungan trace route redistribution dilakukan 2 perhitungan, yaitu cost untuk area OSPF dan metric pada area EIGRP. Pengambilan jalur utama dan alternatif pengiriman paket berdasarkan nilai cost dan metric yang terkecil, hal ini terbukti berdasarkan perhitungan dan simulasi. Kata kunci: OSPF, EIGRP, Redistribution, Delay, Cost, Metric. Abstract OSPF (Open Shortest Path First and EIGRP (Enhanced Interior Gateway Routing Protocol are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost

Lessons learned by southern states in designating alternative routes

International Nuclear Information System (INIS)

1989-08-01

The purpose of this report is to discuss the ''lessons learned'' by the five states within the southem region that have designated alternative or preferred routes under the regulations of the Department of Transportation (DOT) established for the transportation of radioactive materials. The document was prepared by reviewing applicable federal laws and regulations, examining state reports and documents and contacting state officials and routing agencies involved in making routing decisions. In undertaking this project, the Southern States Energy Board hopes to reveal the process used by states that have designated alternative routes and thereby share their experiences (i.e., lessons learned) with other southern states that have yet to make designations. Under DOT regulations (49 CFR 177.826), carriers of highway route controlled quantities of radioactive materials (which include spent nuclear fuel and high-level waste) must use preferred routes selected to reduce time in transit. Such preferred routes consist of (1) an interstate system highway with use of an interstate system bypass or beltway around cities when available, and (2) alternate routes selected by a ''state routing agency.''

Quantum chemistry-assisted synthesis route development

International Nuclear Information System (INIS)

Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

2015-01-01

We have been investigating “quantum chemistry-assisted synthesis route development” using in silico screenings and applied the method to several targets. Another example was conducted to develop synthesis routes for a urea derivative, namely 1-(4-(trifluoromethyl)-2-oxo-2H-chromen-7-yl)urea. While five synthesis routes were examined, only three routes passed the second in silico screening. Among them, the reaction of 7-amino-4-(trifluoromethyl)-2H-chromen-2-one and O-methyl carbamate with BF 3 as an additive was ranked as the first choice for synthetic work. We were able to experimentally obtain the target compound even though its yield was as low as 21 %. The theoretical result was thus consistent with that observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings

SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs.

Science.gov (United States)

Aslam, Muhammad; Hu, Xiaopeng; Wang, Fan

2017-12-13

Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN). Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs) utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR) routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR's routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS). This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR) to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime and stability

SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs

Directory of Open Access Journals (Sweden)

Muhammad Aslam

2017-12-01

Full Text Available Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN. Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR’s routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS. This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime

A tree routing protocol for cognitive radio network

Directory of Open Access Journals (Sweden)

Mohammed Hashem

2017-07-01

Full Text Available Cognitive Radio (CR technology is an agile solution for spectrum congestion and spectrum access utilization problems that result from the legacy fixed spectrum management policies. CR technology can exploit unused licensed band to meet the increasing demand for radio frequency. The routing process faces many challenges in CR Network (CRN such as the absence of centralized infrastructure, the coordination between the routing module and spectrum management module, in addition to the frequent link failure due to the sudden appearance of PUs. In this paper we propose a Tree routing protocol for cognitive radio network (C-TRP that jointly utilizes the tree routing algorithm with a spectrum management module in routing decisions, and also we proposed a new metric used in taking the best route decisions. In addition, we enhance the traditional tree routing algorithm by using a neighbor table technique that speeds up the forwarding data packets. Moreover, we add a robust recovery module to C-TRP to resume the network in case of the link failure. The main motivation in the design of C-TRP is quick data transmission and maximization of date rates. The performance evaluation is carried out in NS2 simulator. The simulation results proved that C-TRP protocol achieves better performance in terms of average “PDR”, “end-to-end delay” and “routing overhead ratio “compared to “CTBR” and “STOD-RP” routing protocols.

Route Network Construction with Location-Direction-Enabled Photographs

Science.gov (United States)

Fujita, Hideyuki; Sagara, Shota; Ohmori, Tadashi; Shintani, Takahiko

2018-05-01

We propose a method for constructing a geometric graph for generating routes that summarize a geographical area and also have visual continuity by using a set of location-direction-enabled photographs. A location- direction-enabled photograph is a photograph that has information about the location (position of the camera at the time of shooting) and the direction (direction of the camera at the time of shooting). Each nodes of the graph corresponds to a location-direction-enabled photograph. The location of each node is the location of the corresponding photograph, and a route on the graph corresponds to a route in the geographic area and a sequence of photographs. The proposed graph is constructed to represent characteristic spots and paths linking the spots, and it is assumed to be a kind of a spatial summarization of the area with the photographs. Therefore, we call the routes on the graph as spatial summary route. Each route on the proposed graph also has a visual continuity, which means that we can understand the spatial relationship among the continuous photographs on the route such as moving forward, backward, turning right, etc. In this study, when the changes in the shooting position and shooting direction satisfied a given threshold, the route was defined to have visual continuity. By presenting the photographs in order along the generated route, information can be presented sequentially, while maintaining visual continuity to a great extent.

A Method of Forming the Optimal Set of Disjoint Path in Computer Networks

Directory of Open Access Journals (Sweden)

As'ad Mahmoud As'ad ALNASER

2017-04-01

Full Text Available This work provides a short analysis of algorithms of multipath routing. The modified algorithm of formation of the maximum set of not crossed paths taking into account their metrics is offered. Optimization of paths is carried out due to their reconfiguration with adjacent deadlock path. Reconfigurations are realized within the subgraphs including only peaks of the main and an adjacent deadlock path. It allows to reduce the field of formation of an optimum path and time complexity of its formation.

Development of safe routes for children in urban environment

Science.gov (United States)

Koryagin, M. E.; Medvedev, V. I.; Strykov, P. G.

2018-01-01

The matter of development of safe travel routes for children between school and home is analyzed. The availability of various applications and devices to identify the location of the child and his/her travel routes is noted. The main factors to be taken into account when planning children travel routes are described. The most popular Russian services for route planning, Google, Yandex, and 2GIS, are discussed. These services are shown to have a number of shortcomings which does not allow them to choose really safe routes. A decision on making the route selection by two criteria (the travel time and the probability of an accident) is obtained. As a numerical example, the Pareto area for possible routes is constructed.

A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network

Science.gov (United States)

Han, Zhao; Wu, Jie; Zhang, Jie; Liu, Liefeng; Tian, Kaiyun

2014-04-01

Wireless sensor network (WSN) is a system composed of a large number of low-cost micro-sensors. This network is used to collect and send various kinds of messages to a base station (BS). WSN consists of low-cost nodes with limited battery power, and the battery replacement is not easy for WSN with thousands of physically embedded nodes, which means energy efficient routing protocol should be employed to offer a long-life work time. To achieve the aim, we need not only to minimize total energy consumption but also to balance WSN load. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. In this paper, we propose a General Self-Organized Tree-Based Energy-Balance routing protocol (GSTEB) which builds a routing tree using a process where, for each round, BS assigns a root node and broadcasts this selection to all sensor nodes. Subsequently, each node selects its parent by considering only itself and its neighbors' information, thus making GSTEB a dynamic protocol. Simulation results show that GSTEB has a better performance than other protocols in balancing energy consumption, thus prolonging the lifetime of WSN.

A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

Directory of Open Access Journals (Sweden)

Xuhao Zhang

2014-01-01

Full Text Available A framing link (FL based tabu search algorithm is proposed in this paper for a large-scale multidepot vehicle routing problem (LSMDVRP. Framing links are generated during continuous great optimization of current solutions and then taken as skeletons so as to improve optimal seeking ability, speed up the process of optimization, and obtain better results. Based on the comparison between pre- and postmutation routes in the current solution, different parts are extracted. In the current optimization period, links involved in the optimal solution are regarded as candidates to the FL base. Multiple optimization periods exist in the whole algorithm, and there are several potential FLs in each period. If the update condition is satisfied, the FL base is updated, new FLs are added into the current route, and the next period starts. Through adjusting the borderline of multidepot sharing area with dynamic parameters, the authors define candidate selection principles for three kinds of customer connections, respectively. Link split and the roulette approach are employed to choose FLs. 18 LSMDVRP instances in three groups are studied and new optimal solution values for nine of them are obtained, with higher computation speed and reliability.

Routing architecture and security for airborne networks

Science.gov (United States)

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.

Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

Directory of Open Access Journals (Sweden)

Yan Han

2014-01-01

Full Text Available The question prompted is how to design the tour route to make the tourists get the maximum satisfactions considering the tourists’ demand. The influence factors of the tour route choices of tourists were analyzed and tourists’ behavior characteristics and psychological preferences were regarded as the important influence factors based on the tourist behavioral theories. A questionnaire of tourists’ tour route information and satisfaction degree was carried out. Some information about the scene spot and tourists demand and tour behaviors characteristic such as visit frequency, number of attractions visited was obtained and analyzed. Based on the convey datum, tour routes multiobjective optimization functions were prompted for the tour route design regarding the maximum satisfaction and the minimum tour distance as the optimal objective. The available routes are listed and categorized. Based on the particle swarm optimization model, the priorities of the tour route are calculated and finally the suggestion depth tour route and quick route tour routes are given considering the different tour demands of tourists. The results can offer constructive suggestions on how to design tour routes on the part of tourism enterprises and how to choose a proper tour route on the part of tourists.

Optimizing departure times in vehicle routes

NARCIS (Netherlands)

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

2008-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW

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

Science.gov (United States)

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

2014-12-01

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

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...... depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0....

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0.......We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...

Routes and Stations

Data.gov (United States)

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

New TPG bus route 28

CERN Multimedia

2003-01-01

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

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

Directory of Open Access Journals (Sweden)

Nadeem Javaid