WorldWideScience

Sample records for air routes

  1. Effective local dynamic routing strategy for air route networks

    Institute of Scientific and Technical Information of China (English)

    Wu Wenjun; Zhao Lingxi

    2015-01-01

    With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network (ARN), we propose an effective local dynamic routing strategy in this paper. Several factors, such as the rout-ing distance, the geographical distance and the real-time local traffic, are taken into consideration. When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing (SPR) strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network (CARN) is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.

  2. Air France Offers A Second Daily Flight on Its Beijing - Paris Route

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

      Starting from 14 June 2005, Air France is adding one more daily flight on its Beijing - Paris's route. Air France customers will then have a choice of fourteen weekly flights between the two cities.……

  3. Air France Offers A Second Daily Flight on Its Beijing - Paris Route

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    @@ Starting from 14 June 2005, Air France is adding one more daily flight on its Beijing - Paris's route. Air France customers will then have a choice of fourteen weekly flights between the two cities.

  4. A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

    Science.gov (United States)

    Sadovsky, Alexander V.

    2016-01-01

    A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

  5. Dynamic Air-Route Adjustments - Model,Algorithm,and Sensitivity Analysis

    Institute of Scientific and Technical Information of China (English)

    GENG Rui; CHENG Peng; CUI Deguang

    2009-01-01

    Dynamic airspace management (DAM) is an important approach to extend limited air space resources by using them more efficiently and flexibly.This paper analyzes the use of the dynamic air-route adjustment (DARA) method as a core procedure in DAM systems.DARA method makes dynamic decisions on when and how to adjust the current air-route network with the minimum cost.This model differs from the air traffic flow management (ATFM) problem because it considers dynamic opening and closing of air-route segments instead of only arranging flights on a given air traffic network and it takes into account several new constraints,such as the shortest opening time constraint.The DARA problem is solved using a two-step heuristic algorithm.The sensitivities of important coefficients in the model are analyzed to determine proper values for these coefficients.The computational results based on practical data from the Beijing ATC region show that the two-step heuristic algorithm gives as good results as the CPLEX in less or equal time in most cases.

  6. Impact of bicycle route type on exposure to traffic-related air pollution.

    Science.gov (United States)

    MacNaughton, Piers; Melly, Steven; Vallarino, Jose; Adamkiewicz, Gary; Spengler, John D

    2014-08-15

    Cyclists are exposed to traffic-related air pollution (TRAP) during their commutes due to their proximity to vehicular traffic. Two of the main components of TRAP are black carbon (BC) and nitrogen dioxide (NO2), which have both been causally associated with increased mortality. To assess the impact of cyclists' exposure to TRAP, a battery-powered mobile monitoring station was designed to sample air pollutants along five bike routes in Boston, Massachusetts. The bike routes were categorized into three types: bike paths, which are separated from vehicle traffic; bike lanes, which are adjacent to traffic; and designated bike lanes, which are shared traffic lanes for buses and cyclists. Bike lanes were found to have significantly higher concentrations of BC and NO2 than bike paths in both adjusted and unadjusted generalized linear models. Higher concentrations were observed in designated bike lanes than bike paths; however, this association was only significant for NO2. After adjusting for traffic density, background concentration, and proximity to intersections, bike lanes were found to have concentrations of BC and NO2 that were approximately 33% higher than bike paths. Distance from the road, vegetation barriers, and reduced intersection density appear to influence these variations. These findings suggest that cyclists can reduce their exposure to TRAP during their commute by using bike paths preferentially over bike lanes regardless of the potential increase of traffic near these routes. PMID:24840278

  7. Identifying vital edges in Chinese air route network via memetic algorithm

    CERN Document Server

    Du, Wen-Bo; Yan, Gang; Lordan, Oriol; Cao, Xian-Bin

    2016-01-01

    Due to its rapid development in the past decade, air transportation system has attracted considerable research attention from diverse communities. While most of the previous studies focused on airline networks, here we systematically explore the robustness of the Chinese air route network, and identify the vital edges which form the backbone of Chinese air transportation system. Specifically, we employ a memetic algorithm to minimize the network robustness after removing certain edges hence the solution of this model is the set of vital edges. Counterintuitively, our results show that the most vital edges are not necessarily the edges of highest topological importance, for which we provide an extensive explanation from the microscope of view. Our findings also offer new insights to understanding and optimizing other real-world network systems.

  8. Measurement and simulation of the in-flight radiation exposure on different air routes

    International Nuclear Information System (INIS)

    The exposure of air-crew personnel to cosmic radiation is considered to be occupational exposure and requirements for dose assessment are given in the European Council Directive 96/29/EURATOM. The High-Temperature Ratio (HTR) Method for LiF: Mg, Ti TLDs utilizes the well-investigated relative intensity of the combined high-temperature glow peaks 6 and 7 compared with the dominant peak 5 (left-hand side of Figure 1) as an indication of the dose-average LET of a mixed radiation field of unknown composition. The difference in the peak-5 readings of the neutron-sensitive TLD-600 (6LiF: Mg, Ti) and the neutron-insensitive TLD-700 (7LiF: Mg, Ti) can be utilized to assess the neutron dose equivalent accumulated in-flight. For this purpose, the dosemeter crystals were calibrated individually in the CERN-EU High Energy Reference Field (CERF) [8] which simulates the cosmic-ray induced neutron spectrum in good detail. The experiments conducted onboard passenger aircraft on different north-bound and trans-equatorial flight routes were aimed at the following: to measure the total dose equivalent accumulated during the flight, to assess the contribution of neutrons, and to compare the results with calculations by means of the well-known CARI computer code. Measurements were performed on a series of eight north-bound flights between Cologne and Washington as well as on the routes Vienna-Atlanta, Vienna-Sydney and Vienna-Tokyo during different solar activity conditions. Precise altitude and route profiles were recorded by the pilots. The experimental results were compared with model calculations using the latest release 6M of the CARI code. Precise altitude and route data on a ten-minute to one-hour scale were taken as input. The calculated dose values indicate that the algorithms employed for the computational assessment of route doses have been significantly improved during the last decade. The CARI results generally tend to be in reasonable agreement with the measured values

  9. Radon in the air in the Millenium of the Polish State Underground Tourist Route in Klodzko (Lower Silesia, PL)

    International Nuclear Information System (INIS)

    The paper presents results of measurements of average monthly radon concentrations in drifts of the Millenium of the Polish State Underground Tourist Route in Klodzko. The studies revealed no significant seasonal fluctuations of radon concentration. Constant influx of radon from the geological basement, and most of all from loess-like loams and rhyolite inliers, is compensated by a natural ventilation system. Only in the summer periods of elevated radon concentrations in the air of the drifts and chambers of the Route can occur. In individual sections it is possible to measure occasional higher radon concentrations caused by local air flow fluctuations in the drifts. The highest concentrations were measured in places with the poorest ventilation - blind drifts ventilated only by backward currents. The average radon concentrations measured do not exceed concentrations allowed in apartment buildings. Therefore, in the Route there is no risk of exposure to excessive amounts of radon for personnel and tourists. The results obtained in the Route's drifts may be compared with minimum results expected in basements of houses in the Old Town in Klodzko. The paper stresses also a role of natural ventilation in protection of underground constructions and apartment buildings against high radon concentrations in areas of its elevated emanations from the geological basement. (author)

  10. Radon as a tracer of daily, seasonal and spatial air movements in the Underground Tourist Route "Coal Mine" (SW Poland).

    Science.gov (United States)

    Tchorz-Trzeciakiewicz, Dagmara Eulalia; Parkitny, Tomasz

    2015-11-01

    The surveys of radon concentrations in the Underground Tourist Route "Coal Mine" were carried out using passive and active measurement techniques. Passive methods with application of Solid State Nuclear Track Detectors LR115 were used at 4 points in years 2004-2007 and at 21 points in year 2011. These detectors were exchanged at the beginning of every season in order to get information about seasonal and spatial changes of radon concentrations. The average radon concentration noted in this facility was 799 Bq m(-3) and is consistent with radon concentrations noted in Polish coal mines. Seasonal variations, observed in this underground tourist route, were as follows: the highest radon concentrations were noted during summers, the lowest during winters, during springs and autumns intermediate but higher in spring than in autumn. The main external factor that affected seasonal changes of radon concentrations was the seasonal variation of outside temperature. No correlation between seasonal variations of radon concentrations and seasonal average atmospheric pressures was found. Spatial variations of radon concentrations corresponded with air movements inside the Underground Tourist Route "Coal Mine". The most vivid air movements were noted along the main tunnel in adit and at the place located near no blinded (in the upper part) shaft. Daily variations of radon concentrations were recorded in May 2012 using RadStar RS-230 as the active measurement technique. Typical daily variations of radon concentrations followed the pattern that the highest radon concentrations were recorded from 8-9 a.m. to 7-8 p.m. and the lowest during nights. The main factor responsible for hourly variations of radon concentrations was the daily variation of outside temperatures. No correlations were found between radon concentration and other meteorological parameters such as atmospheric pressure, wind velocity or precipitation. Additionally, the influence of human factor on radon

  11. 77 FR 30437 - Proposed Amendment of Air Traffic Service Routes; Southwestern United States

    Science.gov (United States)

    2012-05-23

    ...; Southwestern United States as published in the Federal Register of April 23, 2010 (77 FR 24156) FR Doc. 2012... (77 FR 24156). The description of V-16 in the NPRM did not reflect a previous amendment of the route that was published on September 19, 2011 (76 FR 57902). The incorrect part of the V-16 description...

  12. MAMMI Phase1- Collaborative workspaces for en-route air traffic controllers

    OpenAIRE

    Valès, Stéphane; Chatty, Stéphane; Lemort, Alexandre; Conversy, Stéphane

    2006-01-01

    International audience En route control positions put into operation in the last few years are all based on the WIMP (Windows, Icons, Menus, and Pointers) interaction paradigm. Each controller has only one designation mean (a mouse or a trackball) and his/her own screen(s). This technology has a lot of advantages compared to older environments that often relied on paper strips. Nevertheless, this technology has not been able to improve teamwork for ATCOs, because it implies some rigidity c...

  13. Cyclist route choice, traffic-related air pollution, and lung function: a scripted exposure study

    OpenAIRE

    Jarjour, Sarah; Jerrett, Michael; Westerdahl, Dane; de Nazelle, Audrey; Hanning, Cooper; Daly, Laura; Lipsitt, Jonah; Balmes, John

    2013-01-01

    Abstract Background A travel mode shift to active transportation such as bicycling would help reduce traffic volume and related air pollution emissions as well as promote increased physical activity level. Cyclists, however, are at risk for exposure to vehicle-related air pollutants due to their proximity to vehicle traffic and elevated respiratory rates. To promote safe bicycle commuting, the City of Berkeley, California, has designated a network of ...

  14. Transmission through air as a possible route of exposure for MRSA.

    Science.gov (United States)

    Bos, Marian E H; Verstappen, Koen M; van Cleef, Brigitte A G L; Dohmen, Wietske; Dorado-García, Alejandro; Graveland, Haitske; Duim, Birgitta; Wagenaar, Jaap A; Kluytmans, Jan A J W; Heederik, Dick J J

    2016-05-01

    Livestock-associated methicillin-resistant Staphylococcus aureus (LA-MRSA) is highly prevalent in pigs and veal calves. The environment and air in pig and veal calf barns is often contaminated with LA-MRSA, and can act as a transmission source for humans. This study explores exposure-response relationships between sequence type 398 (ST398) MRSA air exposure level and nasal ST398 MRSA carriage in people working and/or living on farms. Samples and data were used from three longitudinal field studies in pig and veal calf farm populations. Samples consisted of nasal swabs from the human participants and electrostatic dust fall collectors capturing airborne settled dust in barns. In both multivariate and mutually adjusted analyses, a strong association was found between nasal ST398 MRSA carriage in people working in the barns for >20 h per week and MRSA air levels. In people working in the barns < 20 h per week there was a strong association between nasal carriage and number of working hours. Exposure to ST398 MRSA in barn air seems to be an important determinant for nasal carriage, especially in the highly exposed group of farmers, next to duration of contact with animals. Intervention measures should therefore probably also target reduction of ST398 MRSA air levels. PMID:25515375

  15. Radar Inaccuracies and Mid-Air Collision Risk: Part 2 En Route Radar Separation Minima

    Science.gov (United States)

    Brooker, Peter

    2004-01-01

    A review of safety targets for en route ATC radar separation suggests that the existing target level of safety (TLS) is over-cautious. If risk budgeting principles are followed consistently, a ‘radar TLS’ of 1·0×10[minus sign]9 fatal aircraft accidents per flying hour is appropriate. This rate is consistent with Joint Aviation Authorities (JAA) guidance on system failure conditions leading to catastrophic accidents. Dynamic and static calculations using published data are compared. The new methodology shows where there are problems with the traditional static calculations, and how to improve the estimation. A further improvement introduces a simple robust model of the controller's decision processes. The focus is not on describing what controllers would generally do, but on setting criteria based on what they could not reasonably be expected to do. This additional ingredient into the calculation adds realism and ensures that attention is focused on hazardous correlated errors. Focused data collection would be an essential component of new risk estimates. The key information required would be on radar performance and the nature and frequency of use of radar separation, including the relative velocities for proximate events at closest point of approach and the frequency of correlated gross errors (through a conditional probability factor). If this factor is not properly taken into account, then the data collection and analysis could be inefficient.

  16. STS-56 inflight maintenance (IFM) air duct routing on OV-103's middeck

    Science.gov (United States)

    1993-01-01

    STS-56 inflight maintenance (IFM) repair on Discovery's, Orbiter Vehicle (OV) 103's, middeck was required to offset overheating problems with one of the onboard experiments -- Detailed Supplementary Objective (DSO) 322, Human lymphocyte locomotion in microgravity. This 'elephant's trunk' fix was rigged from the airlock's air recirculation duct to DSO 322's forward locker location by Commander Kenneth Cameron. The 'elephant's trunk' was fashioned from trash bags and other plastic items to extend an airline to the troubled area. DSO 322 is collecting data on the locomotion and migration of human lymphocytes through intercellular matrix and is testing the rotating wall vessel and the specimen temperature controller. In the background is the port side wall with the side hatch, middeck accomodations rack (MAR), and shuttle orbiter repackaged galley (SORG) visible.

  17. Influence of walking route choice on primary school children's exposure to air pollution: A proof of concept study using simulation

    OpenAIRE

    Mölter, Anna; Lindley, Sarah

    2015-01-01

    This study developed a walking network for the Greater Manchester area (UK). The walking network allows routes to be calculated either based on the shortest duration or based on the lowest cumulative nitrogen dioxide (NO2) or particulate matter (PM10) exposure. The aim of this study was to analyse the costs and benefits of faster routes versus lower pollution exposure for walking routes to primary schools. Random samples of primary schools and residential addresses were used to generate 1...

  18. Open Air Rock Art Between Alva and Ceira Rivers: a Voyage Through Mining, Trading, Transhumance Routes and the Orientation in the Landscape

    Science.gov (United States)

    Pimenta, F.; Ribeiro, N.; Smith, A.; Joaquinito, A.; Pereira, S.; Tirapicos, L.

    2015-05-01

    Open air rock carvings, the object of the present study, were artistic expressions made by the itinerant shepherds, miners, traders and the resident populations along trading and transhumance routes and nearby areas. These rock art sites were used as markers to denote routes or territorial claims and in some cases may have been associated with ritual celebrations. In this paper we will present the results of the analysis of the orientations in the landscape of 688 engraved outcrops, distributed in 11 mountainous areas between the Alva and Ceira rivers. We will discuss possible solsticial markers and will address a possible relationship between the orientation of the podomorph carvings with the Summer Full Moon or Alpha Centauri.

  19. The fabrication of polyfluorene and polycarbazole-based photovoltaic devices using an air-stable process route

    Energy Technology Data Exchange (ETDEWEB)

    Bovill, E.; Lidzey, D. G., E-mail: d.g.lidzey@sheffield.ac.uk [Department of Physics and Astronomy, The University of Sheffield, Hicks Building, Hounsfield Road, Sheffield S3 7RH (United Kingdom); Yi, H.; Iraqi, A. [Department of Chemistry, The University of Sheffield, The Dainton Building, Sheffield S3 7HF (United Kingdom)

    2014-12-01

    We report a comparative study based on the fabrication of polymer:fullerene photovoltaic (PV) devices incorporating carbazole, fluorene, and a PTB based co-polymer. We have explored the efficiency and performance of such devices when the active polymer:fullerene layer is deposited by spin-casting either under nitrogen or ambient conditions. We show that PV devices based on carbazole and fluorene based materials have very similar power conversion efficiencies when processed under both air and nitrogen, with other photobleaching measurements suggesting that such materials have comparatively enhanced photostability. Devices based on the PTB co-polymer, however, have reduced efficiency when processed in air.

  20. Competitive allocation of resources on a network: an agent-based model of air companies competing for the best routes

    CERN Document Server

    Gurtner, Gérald; Lillo, Fabrizio

    2014-01-01

    We present a stylized model of the allocation of resources on a network. By considering as a concrete example the network of sectors of the airspace, where each node is a sector characterized by a maximal number of simultaneously present aircraft, we consider the problem of air companies competing for the allocation of the airspace. Each company is characterized by a cost function, weighting differently punctuality and length of the flight. We consider the model in the presence of pure and mixed populations of types of airline companies and we study how the equilibria depends on the characteristics of the network.

  1. Influence of walking route choice on primary school children's exposure to air pollution--A proof of concept study using simulation.

    Science.gov (United States)

    Mölter, Anna; Lindley, Sarah

    2015-10-15

    This study developed a walking network for the Greater Manchester area (UK). The walking network allows routes to be calculated either based on the shortest duration or based on the lowest cumulative nitrogen dioxide (NO2) or particulate matter (PM10) exposure. The aim of this study was to analyse the costs and benefits of faster routes versus lower pollution exposure for walking routes to primary schools. Random samples of primary schools and residential addresses were used to generate 100,000 hypothetical school routes. For 60% (59,992) and 40% (40,460) an alternative low NO2 and PM10 route was found, respectively. The median change in travel time (NO2: 4.5s, PM10: 0.5s) and average route exposure (NO2: -0.40 μg/m(3), PM10: -0.03 μg/m(3)) was small. However, quantile regression analysis indicated that for 50% of routes a 1% increase in travel time was associated with a 1.5% decrease in NO2 and PM10 exposure. The results of this study suggest that the relative decrease in pollution exposure on low pollution routes tends to be greater than the relative increase in route length. This supports the idea that a route planning tool identifying less polluted routes to primary schools could help deliver potential health benefits for children. PMID:26047859

  2. Producing gestures facilitates route learning.

    Directory of Open Access Journals (Sweden)

    Wing Chee So

    Full Text Available The present study investigates whether producing gestures would facilitate route learning in a navigation task and whether its facilitation effect is comparable to that of hand movements that leave physical visible traces. In two experiments, we focused on gestures produced without accompanying speech, i.e., co-thought gestures (e.g., an index finger traces the spatial sequence of a route in the air. Adult participants were asked to study routes shown in four diagrams, one at a time. Participants reproduced the routes (verbally in Experiment 1 and non-verbally in Experiment 2 without rehearsal or after rehearsal by mentally simulating the route, by drawing it, or by gesturing (either in the air or on paper. Participants who moved their hands (either in the form of gestures or drawing recalled better than those who mentally simulated the routes and those who did not rehearse, suggesting that hand movements produced during rehearsal facilitate route learning. Interestingly, participants who gestured the routes in the air or on paper recalled better than those who drew them on paper in both experiments, suggesting that the facilitation effect of co-thought gesture holds for both verbal and nonverbal recall modalities. It is possibly because, co-thought gesture, as a kind of representational action, consolidates spatial sequence better than drawing and thus exerting more powerful influence on spatial representation.

  3. Producing gestures facilitates route learning.

    Science.gov (United States)

    So, Wing Chee; Ching, Terence Han-Wei; Lim, Phoebe Elizabeth; Cheng, Xiaoqin; Ip, Kit Yee

    2014-01-01

    The present study investigates whether producing gestures would facilitate route learning in a navigation task and whether its facilitation effect is comparable to that of hand movements that leave physical visible traces. In two experiments, we focused on gestures produced without accompanying speech, i.e., co-thought gestures (e.g., an index finger traces the spatial sequence of a route in the air). Adult participants were asked to study routes shown in four diagrams, one at a time. Participants reproduced the routes (verbally in Experiment 1 and non-verbally in Experiment 2) without rehearsal or after rehearsal by mentally simulating the route, by drawing it, or by gesturing (either in the air or on paper). Participants who moved their hands (either in the form of gestures or drawing) recalled better than those who mentally simulated the routes and those who did not rehearse, suggesting that hand movements produced during rehearsal facilitate route learning. Interestingly, participants who gestured the routes in the air or on paper recalled better than those who drew them on paper in both experiments, suggesting that the facilitation effect of co-thought gesture holds for both verbal and nonverbal recall modalities. It is possibly because, co-thought gesture, as a kind of representational action, consolidates spatial sequence better than drawing and thus exerting more powerful influence on spatial representation. PMID:25426624

  4. Heritage Route

    Czech Academy of Sciences Publication Activity Database

    Chlustiková, Katarína; Válová, Katarína

    2013. [Kulturstraßen als Konzept. 20 Jahre Straße der Romanik. 14.11.2013-16.11.2013, Merseburg] Grant ostatní: Culture Programme of European Commission(SI) CU7-MULT7/2010-0653/001-001 Source of funding: R - rámcový projekt EK Keywords : cultural routes * Romanesque * heritage Subject RIV: AC - Archeology, Anthropology, Ethnology

  5. Air

    Science.gov (United States)

    ... house) Industrial emissions (like smoke and chemicals from factories) Household cleaners (spray cleaners, air fresheners) Car emissions (like carbon monoxide) *All of these things make up “particle pollution.” They mostly come from cars, trucks, buses, and ...

  6. Air

    International Nuclear Information System (INIS)

    In recent years several regulations and standards for air quality and limits for air pollution were issued or are in preparation by the European Union, which have severe influence on the environmental monitoring and legislation in Austria. This chapter of the environmental control report of Austria gives an overview about the legal situation of air pollution control in the European Union and in specific the legal situation in Austria. It gives a comprehensive inventory of air pollution measurements for the whole area of Austria of total suspended particulates, ozone, volatile organic compounds, nitrogen oxides, sulfur dioxide, carbon monoxide, heavy metals, benzene, dioxin, polycyclic aromatic hydrocarbons and eutrophication. For each of these pollutants the measured emission values throughout Austria are given in tables and geographical charts, the environmental impact is discussed, statistical data and time series of the emission sources are given and legal regulations and measures for an effective environmental pollution control are discussed. In particular the impact of fossil-fuel power plants on the air pollution is analyzed. (a.n.)

  7. Routing Proposals for Multipath Interdomain Routing

    OpenAIRE

    Bilal, Sardar M.; Dilber, Muhammad Naveed; Khan, Atta ur Rehman

    2013-01-01

    Internet is composed of numbers of independent autonomous systems. BGP is used to disseminate reachability information and establishing path between autonomous systems. Each autonomous system is allowed to select a single route to a destination and then export the selected route to its neighbors. The selection of single best route imposes restrictions on the use of alternative paths during interdomain link failure and thus, incurred packet loss. Packet loss still occurs even when multiple pat...

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

  9. A facile synthetic route toward air-stable magnetic nanoalloys with Fe–Ni/Fe–Co core and iron oxide shell

    International Nuclear Information System (INIS)

    Air-stable bimetallic spherically shaped Fe–Ni and Fe–Co magnetic nanoparticles (MNPs), having an average size of 15 nm and core–shell structure, were synthesized by a simple wet chemical method under ambient conditions. For the first time, sodium borohydride reduction method, commonly applied for the syntheses of metal nanoparticles, was used for the preparation of well-defined Fe–Ni and Fe–Co nanoalloys, avoiding exploitation of any organic solvent. This approach allows a large scale production of nanoparticles specifically stabilized by an iron oxyhydroxide shell without a need of secondary functionalization. Transmission electron microscopy, X-ray powder diffraction, X-ray fluorescence, magnetization, and Mössbauer data demonstrate a core–shell nature of the as-synthesized nanoparticles. The nanoparticle core is of metallic origin and is inhomogeneous at the atomic level, consisting of iron-rich and iron-poor alloy phases. The composition of the shell is close to the ferrihydrite and its role lies in prevention of oxidation-induced degradation of nanoparticle properties. The core is ferromagnetic at and below room temperature, experiencing superparamagnetic relaxation effects due to a reduced size of nanoparticles, whereas the shell is completely superparamagnetic at 300 K and magnetically orders below ∼25 K. Both developed types of magnetic nanoalloys exhibit a strong magnetic response under applied magnetic fields with a high magnetization values achievable at relatively low applied magnetic fields. Beside this, the highly biocompatible chemical composition of the nanoparticle shell and ability of its chemical modification by substitution or addition of other ions or molecules further empower the application potential of these MNPs, especially in the field of biomedicine.

  10. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

  11. State alternative route designations

    Energy Technology Data Exchange (ETDEWEB)

    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.

  12. State alternative route designations

    Energy Technology Data Exchange (ETDEWEB)

    1989-07-01

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

  13. Traffic-Adaptive Routing

    OpenAIRE

    Kammenhuber, Nils

    2011-01-01

    Despite the bursty and highly volatile traffic, routing in the Internet today is optimised only on coarse time scales, as load-adaptive routing is known to induce performance deterioration by causing massive oscillations. We describe ReplEx, an universally applicable distributed algorithm for dynamic routing/traffic engineering, which is based on game theory. We show through extensive realistic simulations that ReplEx does not oscillate, and that it achieves performance gains comparable to tr...

  14. Contact Graph Routing

    Science.gov (United States)

    Burleigh, Scott C.

    2011-01-01

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

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

  16. Understanding individual routing behaviour.

    Science.gov (United States)

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

    2016-03-01

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

  17. Sleep-Route: Routing through Sleeping Sensors

    OpenAIRE

    Sarkar, Chayan; Rao, Vijay S.; Prasad, R. Venkatesha

    2014-01-01

    In this article, we propose an energy-efficient data gathering scheme for wireless sensor network called Sleep-Route, which splits the sensor nodes into two sets - active and dormant (low-power sleep). Only the active set of sensor nodes participate in data collection. The sensing values of the dormant sensor nodes are predicted with the help of an active sensor node. Virtual Sensing Framework (VSF) provides the mechanism to predict the sensing values by exploiting the data correlation among ...

  18. Dahomey Breeding Bird Survey Route

    Data.gov (United States)

    US Fish and Wildlife Service, Department of the Interior — Document contains route directions and map for the naitonal Dahomey BBS route. Includes milage for where specific listening stations are located along the route...

  19. Class network routing

    Science.gov (United States)

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

    2009-09-08

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

  20. Modeling Routing Overhead Generated by Wireless Reactive Routing Protocols

    CERN Document Server

    Javaid, Nadeem; Javaid, Akmal; Malik, Shahzad A

    2011-01-01

    In this paper, we have modeled the routing over- head generated by three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and DYnamic MANET On-deman (DYMO). Routing performed by reactive protocols consists of two phases; route discovery and route maintenance. Total cost paid by a protocol for efficient routing is sum of the cost paid in the form of energy consumed and time spent. These protocols majorly focus on the optimization performed by expanding ring search algorithm to control the flooding generated by the mechanism of blind flooding. So, we have modeled the energy consumed and time spent per packet both for route discovery and route maintenance. The proposed framework is evaluated in NS-2 to compare performance of the chosen routing protocols.

  1. Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols

    CERN Document Server

    Javaid, Nadeem; Javaid, Akmal; Malik, Shahzad A

    2011-01-01

    In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). The questions like, how these protocols differ from each other on the basis of implementing different routing strategies, how neighbor estimation errors affect broadcast of route requests, how reduction of broadcast overhead achieves bandwidth, how to cope with the problem of mobility and density, etc, are attempted to respond. In all of the above mentioned situations, routing overhead and delay generated by the chosen protocols can exactly be calculated from our modeled equations. Finally, we analyze the performance of selected routing protocols using our proposed framework in NS-2 by considering different performance parameters; Route REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) with respect to varyi...

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

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

  4. Roots and routes

    DEFF Research Database (Denmark)

    Christensen, Ann-Dorte; Jensen, Sune Qvotrup

    2011-01-01

    arguing that there is a dynamic interplay between roots and routes in people's lives. The empirical point of departure is narratives about roots and routes by ethnic minorities settled in Aalborg East, an underprivileged neighbourhood in northern Denmark. One of the main findings is a gap between the...... somewhat paradoxical finding is that it appears to be more difficult for transnational migrants to maintain their roots in the country of origin when they go back than it was to establish new roots in the host country...

  5. Torch Route Twist

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    San Francisco changes Olympic flame route due to security fears The city of San Francisco,the only North American stop for the 2008 Beijing Olympic torch,surprised thousands of supporters,demon- strators and visitors on April 9,by com- pletely changing the planned torch route at the last minute without notification. As scheduled,the torch was expected to start from the McCovey Cove in the south- east of the city at 1:00 p.m.before heading along the waterfront northbound to famous tourist spot Fisherman’s Wharf and finally

  6. Route based forecasting

    Science.gov (United States)

    Zuurendonk, I. W.; Wokke, M. J. J.

    2009-09-01

    Road surface temperatures can differ several degrees on a very short distance due to local effects. In order to get more insight in the local temperature differences and to develop safer gritting routes, Meteogroup has developed a system for route based temperature forecasting. The standard version of the road model is addressed to forecast road surface temperature and condition for a specific location. This model consists of two parts. First a physical part, based on the energy balance equations. The second part of the model performs a statistical correction on the calculated physical road surface temperature. The road model is able to create a forecast for one specific location. From infrared measurements, we know that large local differences in road surface temperature exist on a route. Differences can be up to 5 degrees Celsius over a distance of several hundreds of meters. Based on those measurements, the idea came up to develop a system that forecasts road surface temperature and condition for an entire route: route based forecasting. The route is split up in sections with equal properties. For each section a temperature and condition will be calculated. The main factors that influence the road surface temperature are modelled in this forecasting system: •The local weather conditions: temperature, dew point temperature, wind, precipitation, weather type, cloudiness. •The sky view: A very sheltered place will receive less radiation during daytime and emit less radiation during nighttime. For a very open spot, the effects are reversed. •The solar view: A road section with trees on the southern side, will receive less solar radiation during daytime than a section with tress on the southern side. The route based forecast shows by means of a clear Google Maps presentation which sections will be slippery at what time of the coming night. The final goal of this type of forecast, is to make dynamical gritting possible: a variable salt amount and a different

  7. SET-Routes programme

    CERN Multimedia

    Marietta Schupp, EMBL Photolab

    2008-01-01

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

  8. SET-Routes programme

    CERN Multimedia

    CERN audiovisual service

    2009-01-01

    The SET-Routes programme, launched in 2007 with the goal of attracting girls and young women to careers in science, came to an end in April this year. The result of a collaboration between EMBL, EMBO and CERN, the programme established a network of "ambassadors", women scientists who went out to talk about their careers in science at schools and universities across Europe.

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

  10. Occurrence of radon in the Polish underground tourist routes

    Directory of Open Access Journals (Sweden)

    Jerzy Olszewski

    2015-08-01

    Full Text Available Background: There are about 200 underground tourist routes in Poland. There are caves, mines or underground structures. This paper presents the results of the research intended to identify the extent of the occurrence of radon concentrations in underground areas of tourist routes. Material and Methods: We conducted the measurement of periodic concentrations of radon (1–2 months in the summer using type Tastrak trace detectors. We determined the average concentrations of radon in air in 66 underground tourist routes in Poland. Results: The research results comprise 259 determinations of average radon concentrations in 66 routes. The arithmetic average of the results was 1610 Bqm–3, and the maximum measured concentration was over 20 000 Bqm–3. The minimum concentration was 100 Bqm–3 (threshold method considering the arithmetic average of the measurements. It was found that in 67% of the routes, the average concentration of radon has exceeded 300 Bqm–3 and in 22 underground routes it exceeded 1000 Bqm–3. Conclusions: Radon which occurs in many Polish underground tourist routes may be an organizational, legal and health problem. It is necessary to develop a program of measures to reduce radon concentrations in underground routes, especially routes located in the former mines. Med Pr 2015;66(4:557–563

  11. Combining Speed and Routing Decisions in Maritime Transportation

    DEFF Research Database (Denmark)

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

    charter costs and cargo inventory costs may impact both speed and routing decisions. We develop models that optimize speed for a spectrum of routing scenarios and we use a heuristic method to solve them. Some examples are presented so as to illustrate the various trade-offs that are involved.......We present recent results on the problem of combining ship speed and routing decisions. Speed is a key determinant of the economic and the environmental performance affecting variables such as trip duration, fuel costs, and air emissions, among others. It is seen that inputs such as fuel cost, ship...

  12. Issues of Routing in VANET

    OpenAIRE

    Raja, Umar Waqas; Mustafa, Bilal

    2010-01-01

    Vehicular Ad Hoc Network (VANET) is a sub class of mobile ad hoc networks. VANET provides wireless communication among vehicles and vehicle to road side equipments. The communication between vehicles is used for safety, comfort and for entertainment as well. The performance of communication depends on how better the routing takes place in the network. Routing of data depends on the routing protocols being used in network. In this study we investigated about different ad hoc routing protocols ...

  13. Alternative iron making routes

    Energy Technology Data Exchange (ETDEWEB)

    Kaushik, P.; Sharma, T. [Indian School of Mines, Dhanbad (India)

    2002-07-01

    The versatile route of iron production 'blast furnace' technique is being replaced by widely accepted Corex technology, Midrex process using Fastmelt ironmaking, eco-friendly Romelt process, more innovative Ausmelt & Hismelt technology, TATA KORF Mini blast furnace improvement, 'quickest iron through Orbiting Plasma', Direct iron ore smelting process, Conred, AISI-Hyl, Inred processes, Direct iron ore reduction methods, their comparison and proposed modifications. 18 refs., 11 figs., 14 tabs.

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

  15. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

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

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

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

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

  18. Linear Network Fractional Routing

    Directory of Open Access Journals (Sweden)

    S.ASOKAN,

    2011-07-01

    Full Text Available A Network is a finite directed acyclic graph with source messages from a fixed alphabet and message demands at sink nodes. Linear Programming is an algorithm design method. It can be used whenthe solution to a problem can be viewed as the result of a sequence of decisions. The Linear Programming model for the network problem where in every variable has a value one or zero. The problem is todetermine a method of transmitting the messages through the network such that all sink demands are satisfied. We will prove fractional routing capacity for some solvable network using Linear Programmingmodel.

  19. Uncovering the Missing Routes

    DEFF Research Database (Denmark)

    Tsirogiannis, Constantinos; Tsirogiannis, Christos

    2016-01-01

    In the present work we model and analyse the global network of the illegal trade in antiquities. Our goal is to use this network to estimate for any given artefact the potential sequence of people in the network among whom this artefact was traded. For this reason, we have implemented and evaluated...... three different algorithms that estimate potential trade routes within the network. We also evaluate the performance of a popular method that estimates direct links in the network, links which may not have been documented in the police records....

  20. Route Monopolie and Optimal Nonlinear Pricing

    Science.gov (United States)

    Tournut, Jacques

    2003-01-01

    To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform

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

    Science.gov (United States)

    Hino, Yuki; Nagatani, Takashi

    2015-06-01

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

  2. Central Control Over Distributed Routing

    OpenAIRE

    Vissicchio, Stefano; Tilmans, Olivier; Vanbever, Laurent; Rexford, Jennifer; ACM SIGCOMM

    2015-01-01

    Centralizing routing decisions offers tremendous flexibility, but sacrifices the robustness of distributed protocols. In this paper, we present Fibbing, an architecture that achieves both flexibility and robustness through central control over distributed routing. Fibbing introduces fake nodes and links into an underlying link-state routing protocol, so that routers compute their own forwarding tables based on the augmented topology. Fibbing is expressive, and readily supports flexible load b...

  3. Alternative routes of insulin delivery

    Institute of Scientific and Technical Information of China (English)

    Ranjith K. Krishnankutty; Aju Mathew; Saikiran K. Sedimbi; Shrikumar Suryanarayan; Carani B. Sanjeevi

    2009-01-01

    Parenteral route of insulin administration has been the mode of treatment for all Type 1 diabetics and Type 2 diabetics with complications. Patient compliance has really been a major concern for this route of administration. Several alternative routes of administration are under consideration for effective glycemic control, including oral, inhaled, buccal, nasal, and patch routes. One of the approaches involving inhaled insulin has now reached the market. Several other candidates may reach the market in the near future, the promising one being oral insulin.

  4. Southern States' Routing Agency Report

    International Nuclear Information System (INIS)

    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

  5. A Primer of Multicast Routing

    CERN Document Server

    Rosenberg, Eric

    2012-01-01

    Whereas unicast routing determines a path from one source node to one destination node, multicast routing determines a path from one source to many destinations, or from many sources to many destinations. We survey multicast routing methods for when the set of destinations is static, and for when it is dynamic. While most of the methods we review are tree based, some non-tree methods are also discussed. We survey results on the shape of multicast trees, delay constrained multicast routing, aggregation of multicast traffic, inter-domain multicast, and multicast virtual private networks. We focu

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

  7. Route Elimination Heuristic for Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Sándor Csiszár

    2005-11-01

    Full Text Available The paper deals with the design of a route elimination (RE algorithm for thevehicle routing problem with time windows (VRPTW. The problem has two objectives, oneof them is the minimal number of routes the other is the minimal cost. To cope with theseobjectives effectively two-phase solutions are often suggested in the relevant literature. Inthe first phase the main focus is the route elimination, in the second one it is the costreduction. The algorithm described here is a part of a complete VRPWT study. The methodwas developed by studying the graph behaviour during the route elimination. For thispurpose a model -called “Magic Bricks” was developed. The computation results on theSolomon problem set show that the developed algorithm is competitive with the best ones.

  8. Smart aircraft routing - a possibility for mitigation?

    Science.gov (United States)

    Mannstein, H.; Gierens, K.; Waibel, A.; Meilinger, S.; Seifert, A.; Köhler, C.; Kühne, H.

    2009-04-01

    Air traffic affects the energy balance of the earth in various ways. Emission of CO2 with atmospheric residence times measured in decades contributes to the greenhouse effect as well as emission of nitrous oxides, with their impact on ozone and methane chemistry. Soot has a direct effect on the net radiation and, much more important, is involved the production of contrails and the triggering of contrail cirrus, which can be visible for several hours. These artificial clouds are initiated when flying in sufficiently cold and moist air. In total their net radiative forcing is of the same order of magnitude as the forcing by the emitted CO2. The impact of contrail cirrus on net radiation results from the conversion of ambient moisture in ice super-saturated regions into ice crystals and depends strongly on the conditions of the ambient radiation field. It ranges from a warming at night or over bright low clouds to cooling during daytime over dark surfaces like the ocean. For the time being these effects are not at all taken into consideration in aircraft routing: the production of contrails and contrail cirrus happens by chance. in. The dependency of the radiative forcing by contrail cirrus clouds on the weather conditions opens the possibility for a soft version of geo-engineering: Avoiding warming (and perhaps also producing cooling) contrails and contrail cirrus by small changes of the flight routes has the potential to reduce the man-made imbalance in radiative forcing by a few percent - not much compared to other geo-engineering strategies, but without any adverse consequences. With the exception of a small amount of additional fuel usage no other substances have to be brought into the atmosphere. As contrails are produced only in 10%-20% of the flown distances and only the warming contrails should be avoided, the impact on the traffic system is limited. The basic idea of the project 'Environmentally compatible flight route optimisation', funded by the German

  9. Inter-Domain Routing Under Scrutiny: Routing Models and Alternative Routing Architectures

    OpenAIRE

    Mühlbauer, Wolfgang

    2010-01-01

    Inter-Domain Routing, also die Verkehrslenkung zwischen Autonomen Systemen (ASen), ist seit Jahren ein lebendiges Forschungsgebiet. Hauptursache hierfür ist dessen Komplexität: Zusammenspiel zwischen Interior und Exterior Gateway Protokollen, eine Vielfalt unterschiedlicher Routing Policies, komplexe Verbindungsstrukturen zwischen ASen, usw. Ein wesentliches Ziel der vorliegenden Dissertation besteht in einem verbesserten Allgemeinverständnis des Inter-Domain Routings. Desweiteren werden neua...

  10. Routing Discovery Algorithm Using Parallel Chase Packet

    OpenAIRE

    Amera Al-Ameri; Muneer Bani Yassein; Khamayseh, Yaser M.

    2013-01-01

    On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been...

  11. Perception bias in route choice

    NARCIS (Netherlands)

    Vreeswijk, J.D.; Thomas, T.; Berkum, van E.C.; Arem, van B.

    2014-01-01

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

  12. Generalized Maneuvers in Route Planning

    CERN Document Server

    Hlineny, Petr

    2011-01-01

    We study an important practical aspect of the route planning problem in real-world road networks -- maneuvers. Informally, maneuvers are walks that might either decrease or increase the weight of a route by additional costs. One can model a wide range of route restrictions or traffic regulations by maneuvers. For instance turn-prohibitions, traffic light delays, round-abouts, forbidden passages and so on. A new approach to tackle maneuvers during route planning queries without prior adjustments of the underlying road network graph is presented. First, a generic maneuver is defined so that we are able to model almost arbitrarily complex route restriction. In the rest we show how to modify Dijkstra's algorithm to respect maneuvers together with a formal proof of correctness and a complexity analysis of our algorithm.

  13. Security Consideration With Dynamic Routing

    Directory of Open Access Journals (Sweden)

    VISWESWARARAO BOLLA

    2012-03-01

    Full Text Available One of the major issues for data communication over wired and wireless networks is the security. the past work is on the designs of cryptography algorithms and system infrastructures. Dynamic routing algorithm called improved dynamic routing with security consideration, which is based on the concept of Zone Routing Protocol (ZRP that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP in wired networks and Destination-Sequenced Distance Vector (DSDV protocol in wireless networks, without introducing extra control messages. This algorithm is mainly proposed to improve the and to overcome the limitations existing with the present cryptographic algorithms and protocols. Although some designs like IP security, Secure Socket Layer provide essential security, E-Mail security they unavoidably introduce substantial overheads in the Gateway/Host performance and effective network bandwidths.

  14. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    shortest nor fastest, indicating that drivers value route properties that are diverse and hard to quantify or even identify. We propose a routing service that uses an existing routing service while exploiting the availability of historical route usage data from local drivers. Given a source and destination......, the service recommends a corresponding route that is most preferred by local drivers. It uses a route preference function that takes into account the number of distinct drivers and the number of trips associated with a route, as well as temporal aspects of the trips. The paper provides empirical...... studies with real route usage data and an existing online routing service....

  15. Road Routes for Waste Disposal - MDC_RecyclingRoute

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — 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...

  16. 基于元胞蚂蚁算法的防空靶机航路规划研究%Route Planning of Anti-Air Target Drone Based on Cellular-Ant Colony Algorithm

    Institute of Scientific and Technical Information of China (English)

    刘志强; 雷宇曜; 阳再清

    2014-01-01

    防空靶机飞行航路设计是实现靶机有效控制,确保高效完成供靶任务的保障。通过对靶机三维航路规划模型进行分析,给出了元胞蚂蚁算法的航路规划模型的求解方法及算法实现的具体流程,并分别应用蚁群算法和元胞蚂蚁算法进行仿真实验。结果表明:元胞蚂蚁算法克服了蚁群算法收敛速度慢、陷于局部最小值的缺陷,可得到较优的航路。%The design of the flight airway of anti-air target is essential to the effective target control and the high effective completion of target supply task. Through the analysis of the three-dimensional airway design model, the solution method and corresponding algorithm flow of the cellular-ant colony algorithm is provided in this paper. The simulation experiment of the ant colony and cellular-ant colony algorithms is carried out, which shows that the cellular ant algorithm over comes the ant colony algorithm disadvantages of the slow convergence and local optima, and it is able to obtain optimal airway.

  17. Critical Route Network for Earthquake Response and Dynamic Route Analysis

    OpenAIRE

    Peeta, Srinivas; Kalafatas, Georgios

    2007-01-01

    Earthquakes can significantly disrupt societal functioning, cause ecological damage, and lead to loss of human lives and property, warranting a coordinated and efficient response to mitigate their negative impacts. Preparedness against earthquakes entails a pre-disaster planning aspect and a post disaster operational aspect. In the JTRP study “Emergency Earthquake Routes for the State of Indiana; Part I: Criteria for Selection of Primary Routes: Transportation Aspects”, a multicommodity maxim...

  18. Capacity Constrained Routing Algorithms for Evacuation Route Planning

    OpenAIRE

    Shekhar, Shashi; George, Betsy; Lu, Qingsong

    2010-01-01

    Efficient tools are needed to identify routes and schedules to evacuate affected populations to safety in face of natural disasters or terrorist attacks. Challenges arise due to violation of key assumptions (e.g. stationary ranking of alternative routes, Wardrop equilibrium) behind popular shortest path algorithms (e.g. Dijktra's, A*) and microscopic traffic simulators (e.g. DYNASMART). Time-expanded graphs (TEG) based mathematical programming paradigm does not scale up to large urban scenari...

  19. Protocol Independent Adaptive Route Update for VANET

    OpenAIRE

    Asim Rasheed; Sana Ajmal; Amir Qayyum

    2014-01-01

    High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptiv...

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

  1. Protocol independent adaptive route update for VANET.

    Science.gov (United States)

    Rasheed, Asim; Ajmal, Sana; Qayyum, Amir

    2014-01-01

    High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptive route update usually becomes impractical for dense networks due to large routing overheads. This paper presents an adaptive route update approach which can provide solution for any baseline routing protocol. The proposed adaptation eliminates the classification of reactive and proactive by categorizing them as logical conditions to find and update the route. PMID:24723807

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

  3. Dynamic routing using maximal road capacity

    NARCIS (Netherlands)

    Rothkrantz, L.J.M.

    2015-01-01

    Current routing devices route an individual car driver from start to destination in the shortest time. In this paper we propose a routing algorithm, routing the whole population of car drivers in the shortest time. The algorithm is an adapted dynamic version of the shortest path algorithm of Dijkstr

  4. Compressed Transmission of Route Descriptions

    CERN Document Server

    Batz, Gernot Veit; Luxen, Dennis; Sanders, Peter

    2010-01-01

    We present two methods to compress the description of a route in a road network, i.e., of a path in a directed graph. The first method represents a path by a sequence of via edges. The subpaths between the via edges have to be unique shortest paths. Instead of via edges also via nodes can be used, though this requires some simple preprocessing. The second method uses contraction hierarchies to replace subpaths of the original path by shortcuts. The two methods can be combined with each other. Also, we propose the application to mobile server based routing: We compute the route on a server which has access to the latest information about congestions for example. Then we transmit the computed route to the car using some mobile radio communication. There, we apply the compression to save costs and transmission time. If the compression works well, we can transmit routes even when the bandwidth is low. Although we have not evaluated our ideas with realistic data yet, they are quite promising.

  5. ACO based routing for MANETs

    CERN Document Server

    Arif, Mohammad

    2012-01-01

    Mobile ad hoc network (MANET) is a collection of wireless mobile nodes. It dynamically forms a temporary network without using any pre existing network infrastructure or centralized administration i.e. with minimal prior planning. All nodes have routing capabilities and forward data packets to other nodes in multi-hop fashion. As the network is dynamic, the network topology continuously experiences alterations during deployment. The biggest challenge in MANETs is to find a path between communicating nodes. The considerations of the MANET environment and the nature of the mobile nodes create further complications which results in the need to develop special routing algorithms to meet these challenges. Swarm intelligence, a bio-inspired technique, which has proven to be very adaptable in other problem domains, has been applied to the MANET routing problem as it forms a good fit to the problem. In ant societies the activities of the individuals are not regulated by any explicit form of centralized control but ar...

  6. Routing Discovery Algorithm Using Parallel Chase Packet

    Directory of Open Access Journals (Sweden)

    Amera Al-Ameri

    2013-04-01

    Full Text Available On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been proposed to control the simple flooding technique. Ideally, the broadcast of route request or the route discovery process must be stopped as soon as the destination node is found. This will free the network from many redundant packets that may cause network collision and contention. In this paper, chasing packet technique is used with standard AODV routing protocol to end the fulfilled route requests. The chase packet is initiated by the source node and is broadcasted in parallel with route request packet. As soon as the destination is found the chase packet starts its work by trying to catch and discard the route request in early stages before it broadcasts further in the network. Performance evaluation is conducted using simulation to investigate the performance of the proposed scheme against the existing approach that uses chase packet technique such as Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C. Results reveal that the proposed scheme minimizes end-to-end packet delays and achieves low routing request overhead.

  7. Optimal routing of electric vehicles

    OpenAIRE

    Andelmin, Juho

    2014-01-01

    In this thesis, a vehicle routing problem (VRP) variant tailored for plug-in battery electric vehicles (BEVs) is studied. The studied problem involves a fleet of identical BEVs located at a central depot, a set of customers that must be serviced within given time windows, and a set of charging stations where the vehicles can recharge their batteries. The objective is to design a set of vehicle routes, each starting and ending at the depot, so that each customer is serviced exactly once and th...

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

  9. ACO Based Routing for MANETs

    Directory of Open Access Journals (Sweden)

    Mohammad Arif

    2012-05-01

    Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile nodes. It dynamically forms atemporary network without using any pre existing network infrastructure or centralized administrationi.e. with minimal prior planning. All nodes have routing capabilities and forward data packets to othernodes in multi-hop fashion. As the network is dynamic, the network topology continuously experiencesalterations during deployment. The biggest challenge in MANETs is to find a path betweencommunicating nodes. The considerations of the MANET environment and the nature of the mobile nodescreate further complications which results in the need to develop special routing algorithms to meet thesechallenges. Swarm intelligence, a bio-inspired technique, which has proven to be very adaptable in otherproblem domains, has been applied to the MANET routing problem as it forms a good fit to the problem.In ant societies the activities of the individuals are not regulated by any explicit form of centralizedcontrol but are the result of self-organizing dynamics driven by local interactions and communicationsamong a number of relatively simple individuals. This unique characteristic has made ant societies anattractive and inspiring model for building new algorithms and new multi-agent systems. In this paper,we have studied and reviewed Ant Colony based routing algorithms and its variants. Finally, aperformance evaluation of the original ARA and the EARA is carried out with respect to each other.

  10. A Computer Simulation of the System-Wide Effects of Parallel-Offset Route Maneuvers

    Science.gov (United States)

    Lauderdale, Todd A.; Santiago, Confesor; Pankok, Carl

    2010-01-01

    Most aircraft managed by air-traffic controllers in the National Airspace System are capable of flying parallel-offset routes. This paper presents the results of two related studies on the effects of increased use of offset routes as a conflict resolution maneuver. The first study analyzes offset routes in the context of all standard resolution types which air-traffic controllers currently use. This study shows that by utilizing parallel-offset route maneuvers, significant system-wide savings in delay due to conflict resolution of up to 30% are possible. It also shows that most offset resolutions replace horizontal-vectoring resolutions. The second study builds on the results of the first and directly compares offset resolutions and standard horizontal-vectoring maneuvers to determine that in-trail conflicts are often more efficiently resolved by offset maneuvers.

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

    International Nuclear Information System (INIS)

    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

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

  13. Air Pollution

    Science.gov (United States)

    Air pollution is a mixture of solid particles and gases in the air. Car emissions, chemicals from factories, dust, ... a gas, is a major part of air pollution in cities. When ozone forms air pollution, it's ...

  14. Air Pollution

    Science.gov (United States)

    Air pollution is a mixture of solid particles and gases in the air. Car emissions, chemicals from factories, dust, pollen and ... Ozone, a gas, is a major part of air pollution in cities. When ozone forms air pollution, ...

  15. Comparison of on Demand Routing Protocols

    Directory of Open Access Journals (Sweden)

    Bharat Bhushan

    2013-02-01

    Full Text Available A routing protocol is used to facilitate communication in ad hoc network. The primary goal of such a routing protocol is to provide an efficient and reliable path between a pair of nodes. The routing protocols for ad hoc network can be categorized into three categories: table driven, on demand and hybrid routing. The table driven and hybrid routing strategies require periodic exchange of hello messages between nodes of the ad hoc network and thus have high processing and bandwidth requirements. On the other hand on demand routing strategy creates routes when required and hence is very much suitable for ad hoc network. This paper therefore examines the performance of three on demand routing protocols at application layer using QualNet-5.01 simulator.

  16. Vehicle routing and the value of postponement

    OpenAIRE

    Pang, G.; L Muyldermans

    2013-01-01

    We study capacitated vehicle routing problems (CVRPs) in which the client demands occur over time and the collector or distributor performing the service can decide when to visit the clients. It has been reported in the literature that postponement of collection (or delivery) services may decrease the overall routing cost or distance. We investigate this issue in greater detail and report on experiments in different routing settings to uncover the impact of postponement on routing efficiency....

  17. Algorithmic generation of railroad and highway routes

    Energy Technology Data Exchange (ETDEWEB)

    Low, J. T.; Bushnell, R. C.; Shannon, R.; Borsos, R.; Graham, J.; Sherry, R.

    1979-01-01

    A minimum-time algorithm can be used to generate realistic highway routes between specific origins and destinations. Minimizing distances on links will not produce realistic railroad routes if links bear any resemblance to physical trackage. There are also multiple routes between two points since each carrier has its own philosophy. This paper outlines a systematic method of preparing information such that a computer algorithm can generate realistic routes for single- or multiple-carrier movements.

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

  19. Analyzing security of Authenticated Routing Protocol (ARAN)

    OpenAIRE

    Seema Mehla; Bhawna Gupta; Preeti Nagrath

    2010-01-01

    Ad hoc network allow nodes to communicate beyond their direct wireless transmission range by introducing cooperation in mobile computer (nodes). Many proposed routing protocol for ad hoc network operate in an ad hoc fashion, as on demand routing protocol often have low overhead and faster reaction time than other type of routingbased on periodic protocol. However variety of attacks targeting routing protocol have been identified. By attacking the routing protocol attacker can absorb network t...

  20. Thematic Routes - Tourist Destinations in Romania

    OpenAIRE

    Mihaela DINU; Adrian CIOACA

    2008-01-01

    Thematic routes have become greatly demanded ”fashionable” tourist destinations, in recent years. In many countries they gained popularity not only through their value as individual objectives, but also through their attraction, generated by the association of tourist objectives, in a larger region. The main purpose of this article is to analyze the main Romanian thematic routes, as part of the European routes, or as regional/local routes, specific on a national level, their actual condition ...

  1. Routing Data Authentication in Wireless Networks; TOPICAL

    International Nuclear Information System (INIS)

    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

  2. Blind Alley Aware ACO Routing Algorithm

    Science.gov (United States)

    Yoshikawa, Masaya; Otani, Kazuo

    2010-10-01

    The routing problem is applied to various engineering fields. Many researchers study this problem. In this paper, we propose a new routing algorithm which is based on Ant Colony Optimization. The proposed algorithm introduces the tabu search mechanism to escape the blind alley. Thus, the proposed algorithm enables to find the shortest route, even if the map data contains the blind alley. Experiments using map data prove the effectiveness in comparison with Dijkstra algorithm which is the most popular conventional routing algorithm.

  3. A route towards immune protection

    OpenAIRE

    Groot Nibbelink, Milou

    2016-01-01

    This work describes a route towards an immune protective device for islet of Langerhans transplantation. We developed a protocol to use MIN6 β cells aggregates as pseudo-islets to overcome the donor shortage issue (chapter 3). In this thesis we explored two different immune protective strategies; a multibore hollow fiber and flat microwell membranes. In chapter 4 we investigated the possibility to use a commercial multibore hollow fiber. In this chapter we showed that we were capable to physi...

  4. Shortest Paths and Vehicle Routing

    OpenAIRE

    Petersen, Bjørn; Pisinger, David

    2011-01-01

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

  5. Cultural Routes and Intangible Heritage

    Directory of Open Access Journals (Sweden)

    Enza Zabbini

    2012-08-01

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

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

  7. Classification of Dynamic Vehicle Routing Systems

    DEFF Research Database (Denmark)

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

    2007-01-01

    classify dynamic vehicle routing systems. Methods for evaluation of the performance of algorithms that solve on-line routing problems are discussed and we list some of the most important issues to include in the system objective. Finally, we provide a three-echelon classification of dynamic vehicle routing...... systems based on their degree of dynamism and the system objective....

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

  9. Metaheuristics applied to vehicle routing. A case study. Part 3: Genetic Clustering and Tabu Routing

    Directory of Open Access Journals (Sweden)

    Guillermo González Vargas

    2010-04-01

    Full Text Available This paper presents hybrid meta-heuristics called Genetic Clustering and Tabu Routing for solving a vehicle routing problem using two phases methodology: first clustering and then routing. The results are compared with those obtained using meta-heuristics and heuristic techniques presented in previous papers. Genetic clustering and Tabu routing average results were 23% and 9.1% better, respectively.

  10. Routing for wireless multi-hop networks

    CERN Document Server

    Hamid, Sherin Abdel; Takahara, Glen

    2013-01-01

    The focus of this brief is to identify what unifies and what distinguishes the routing functions in four wireless multi-hop network paradigms. The brief introduces a generic routing model that can be used as a foundation of wireless multi-hop routing protocol analysis and design. It demonstrates that such model can be adopted by any wireless multi-hop routing protocol. Also presented is a glimpse of the ideal wireless multi-hop routing protocol along with several open issues.

  11. Submarine Pipeline Routing Risk Quantitative Analysis

    Institute of Scientific and Technical Information of China (English)

    徐慧; 于莉; 胡云昌; 王金英

    2004-01-01

    A new method for submarine pipeline routing risk quantitative analysis was provided, and the study was developed from qualitative analysis to quantitative analysis.The characteristics of the potential risk of the submarine pipeline system were considered, and grey-mode identification theory was used. The study process was composed of three parts: establishing the indexes system of routing risk quantitative analysis, establishing the model of grey-mode identification for routing risk quantitative analysis, and establishing the standard of mode identification result. It is shown that this model can directly and concisely reflect the hazard degree of the routing through computing example, and prepares the routing selection for the future.

  12. Risk-minimal routes for emergency cars

    OpenAIRE

    Woelki, Marko; Nippold, Ronald; Bonert, Michael; Ruppe, Sten

    2013-01-01

    The computation of an optimal route for given start and destination in a static transportation network is used in many applications of private route planning. In this work we focus on route planning for emergency cars, such as for example police, fire brigade and ambulance. In case of private route planning typical quantities to be minimized are travel time or route length. However, the idea of this paper is to minimize the risk of a travel time exceeding a certain limit. This is inspired by ...

  13. SCRAM: A Sharing Considered Route Assignment Mechanism for Fair Taxi Route Recommendations

    OpenAIRE

    Qian, Shiyou; Cao, Jian; Le Mouël, Frédéric; Sahel, Issam; Li, Minglu

    2015-01-01

    Recommending routes for a group of competing taxi drivers is almost untouched in most route recommender systems. For this kind of problem, recommendation fairness and driving efficiency are two fundamental aspects. In the paper, we propose SCRAM, a sharing considered route assignment mechanism for fair taxi route recommendations. SCRAM aims to provide recommendation fairness for a group of competing taxi drivers, without sacrificing driving efficiency. By designing a concise route assignment ...

  14. Dynamic information routing in complex networks

    Science.gov (United States)

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

    2016-01-01

    Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function. PMID:27067257

  15. Dynamic information routing in complex networks

    Science.gov (United States)

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

    2016-04-01

    Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function.

  16. VANET Routing Protocols: Pros and Cons

    CERN Document Server

    Paul, Bijan; 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 has taken significant attention. So, it is very necessary to identify the pros and cons of routing protocols which can be used for further improvement or development of any new routing protocol. This paper presents the pros and cons of VANET routing protocols for inter vehicle communication.

  17. Legal regulation of commercial rights in international air law

    OpenAIRE

    Жмур, Наталія

    2016-01-01

    In the article analyzes problem of legal regulation of commercial rights in international air law. Analyzed normatively-legal acts of rights, which have been given from one country to another, under which appointed carriers have rights to carry out transportation of passengers, luggage and freight by established international air routes according to reciprocal contract about air connection.

  18. Conflict Resolution Performance in an Experimental Study of En Route Free Maneuvering Operations

    Science.gov (United States)

    Doble, Nathan A.; Barhydt, Richard; Hitt, James M., II

    2005-01-01

    NASA has developed a far-term air traffic management concept, termed Distributed Air/Ground Traffic Management (DAG-TM). One component of DAG-TM, En Route Free Maneuvering, allows properly trained flight crews of equipped autonomous aircraft to assume responsibility for separation from other autonomous aircraft and from Instrument Flight Rules (IFR) aircraft. Ground-based air traffic controllers continue to separate IFR traffic and issue flow management constraints to all aircraft. To examine En Route Free Maneuvering operations, a joint human-in-the-loop experiment was conducted in summer 2004 at the NASA Ames and Langley Research Centers. Test subject pilots used desktop flight simulators to resolve traffic conflicts and adhere to air traffic flow constraints issued by subject controllers. The experimental airspace integrated both autonomous and IFR aircraft at varying traffic densities. This paper presents a subset of the En Route Free Maneuvering experimental results, focusing on airborne and ground-based conflict resolution, and the effects of increased traffic levels on the ability of pilots and air traffic controllers to perform this task. The results show that, in general, increases in autonomous traffic do not significantly impact conflict resolution performance. In addition, pilot acceptability of autonomous operations remains high throughout the range of traffic densities studied. Together with previously reported findings, these results continue to support the feasibility of the En Route Free Maneuvering component of DAG-TM.

  19. Potential Routes for Thermochemical Biorefineries

    OpenAIRE

    García Haro, Pedro; Ollero de Castro, Pedro Antonio; Vidal-Barrero, José Fernando; Villanueva Perales, Ángel Luis

    2013-01-01

    This critical review focuses on potential routes for the multi-production of chemicals and fuels in the framework of thermochemical biorefineries. The up-to-date research and development in this field has been limited to BTL/G (biomass-to-liquids/gases) studies, where biomass-derived synthesis gas (syngas) is converted into a single product with/without the co-production of electricity and heat. Simultaneously, the interest on biorefineries is growing but mostly refers to the biochemical proc...

  20. The line planning routing game

    OpenAIRE

    Gattermann, P.; Schiewe, A.; Schmidt, M.

    2014-01-01

    In this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algorithm. We investigate, under which conditions on the line planning model a passenger’s best-response ...

  1. The line planning routing game

    OpenAIRE

    Gattermann, Philine; Schiewe, Alexander; Schmidt, Marie

    2014-01-01

    textabstractIn this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algorithm. We investigate, under which conditions on the line planning model a passenger’s be...

  2. Strategic route map of sulphur dioxide reduction in China

    International Nuclear Information System (INIS)

    China's economy has risen to the second place since 2010, accompanied by the largest energy consumption in the world. As one of the major air pollutants from the fossil fuel, excessive SO2 emissions have severe negative impacts on eco-environments. In order to achieve the balance between economic growth and environmental protection, many efforts have been made on the reduction of SO2. The route map for the reduction of SO2 in China includes policy setting, economic and energy structure adjustment, and the construction of desulphurization facilities. These initiatives and efforts together had resulted in the significant reduction of SO2 emissions along with fast economic development. This study provides a useful reference for other developing countries in coping SO2 control. The findings also provide implications for reducing the other two air pollutants with binding control targets in the Twelfth Five-Year Plan period in China, i.e. NOx and CO2. - Highlights: • A critical review on the policies of sulphur dioxide control in China. • The successful route map for the reduction of sulphur dioxide. • A useful reference for other countries in coping air pollutants emissions

  3. Air Abrasion

    Science.gov (United States)

    ... delivered directly to your desktop! more... What Is Air Abrasion? Article Chapters What Is Air Abrasion? What Happens? The Pros and Cons Will I Feel Anything? Is Air Abrasion for Everyone? print full article print this ...

  4. Energy Efficient Routing Protocol for MANET

    Directory of Open Access Journals (Sweden)

    S.Gopinath

    2012-03-01

    Full Text Available In recent years, many energy-efficient routing protocols have been proposed. However, very little efforts have been taken in studying the energy consumption of individual node, overhead and route maintaining issues. While not considering the design of energy efficient routing protocol, it may perform very worst than the normal routing protocol. Here, we have proposed On Demand Based Energy Efficient Routing Protocol (ODBEERP. The main aim of proposed protocol is to discover the minimum power-limitation route. The power limitation of a route is decided by the node which has the minimum energy in that route. So compared with the minimum node energy in any other route, the minimum node energy in the minimum power-limitation route has more energy. We have also proposed a more accurate analysis to track the energy consumptions due to various factors, and improve the performance during path discovery and in mobility scenarios. The proposed protocol is evaluated with object oriented discrete event simulator environment. Simulation results shows that the ODBEERP achieves good throughput, less delay, high packet delivery ratio and good energy efficiency than the existing protocol PEER.

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

  6. Bicretieria Optimization in Routing Games

    CERN Document Server

    Busch, Costas

    2008-01-01

    Two important metrics for measuring the quality of routing paths are the maximum edge congestion $C$ and maximum path length $D$. Here, we study bicriteria in routing games where each player $i$ selfishly selects a path that simultaneously minimizes its maximum edge congestion $C_i$ and path length $D_i$. We study the stability and price of anarchy of two bicriteria games: - {\\em Max games}, where the social cost is $\\max(C,D)$ and the player cost is $\\max(C_i, D_i)$. We prove that max games are stable and convergent under best-response dynamics, and that the price of anarchy is bounded above by the maximum path length in the players' strategy sets. We also show that this bound is tight in worst-case scenarios. - {\\em Sum games}, where the social cost is $C+D$ and the player cost is $C_i+D_i$. For sum games, we first show the negative result that there are game instances that have no Nash-equilibria. Therefore, we examine an approximate game called the {\\em sum-bucket game} that is always convergent (and ther...

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

  8. Dynamic information routing in complex networks

    CERN Document Server

    Kirst, Christoph; Battaglia, Demian

    2015-01-01

    Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this generic mechanism specifically for oscillatory dynamics and analyze how individual unit properties, the network topology and external inputs coact to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine non-local network-wide communication. These results help...

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

  10. Predicting transportation routes for radioactive wastes

    International Nuclear Information System (INIS)

    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

  11. Modified Rumor Routing for Wireless Sensor Networks

    OpenAIRE

    Chiranjib Patra; Parama Bhaumik; Debina Chakroborty

    2010-01-01

    Due to the limited processing power, and finite power available to each sensor node, regular ad-hoc routing techniques cannot be directly applied to sensor networks domain. Thus, energy-efficient routing algorithms suitable to the inherent characteristics of these types of networks are needed. However highly efficient data centric model of routing will improve the longevity of the network. This paper describes a mechanism of improvisation through simulation of existing feature of Rumor routin...

  12. Routing in Wireless Networks with Position Trees

    OpenAIRE

    Chavez, Edgar; Mitton, Nathalie; Tejeda, Hector

    2007-01-01

    Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing protocols are preferred because sensor networks have limited battery life. Location aware routing protocols are good candidates for sensor network applications, nevertheless they need either an external location service like GPS or Galileo (which are bulky, energy consuming devices) or internal location services prov...

  13. Learning multiple routes in homing pigeons

    OpenAIRE

    Flack, Andrea; Guilford, Tim; Biro, Dora

    2014-01-01

    The aerial lifestyle of central-place foraging birds allows wide-ranging movements, raising fundamental questions about their remarkable navigation and memory systems. For example, we know that pigeons (Columba livia), long-standing models for avian navigation, rely on individually distinct routes when homing from familiar sites. But it remains unknown how they cope with the task of learning several routes in parallel. Here, we examined how learning multiple routes influences homing in pigeon...

  14. Towards Building an Intelligent Call Routing System

    OpenAIRE

    Thien Khai Tran; Dung Minh Pham; Binh Van Huynh

    2016-01-01

    This paper presents EduICR - an Intelligent Call Routing system. This system can route calls to the most appropriate agent using routing rules built by the text classifier. EduICR includes the following main components: telephone communication network; Vietnamese speech recognition; Text classifier/ Natural language processor and Vietnamese speech synthesis. To our best knowledge, this is one of the first systems in Vietnam to implement the integration mechanism of text processing and speech ...

  15. Martel's routes in Mammoth cave, Kentucky, 1912.

    OpenAIRE

    Shaw Trevor R.

    2003-01-01

    Martel’s own copy of the Hovey 1912 guidebook to Mammoth Cave has his routes marked faintly in pencil on the printed cave plans. These plans are reproduced here, with his routes indicated on them. He generally followed the four standard tourist routes which now included Kaemper’s 1908 discoveries to Violet City, but instead of visiting the Maelstrom he went to Hovey’s Cathedral and Gerta’s Grotto.

  16. Routing Protocols in MANET: Comparative Study

    OpenAIRE

    Jayanti; Vikram Nandal

    2014-01-01

    A Mobile Ad Hoc Network (MANET) is composed of mobile nodes without any infrastructure like wireless access points or base stations. MANET describes wireless, mobile and multi-hop networks that operate without the benefit of any existing infrastructure except for the nodes themselves. The main goal of an ad hoc network routing protocol is to establish correct and efficient route between a pair of mobile nodes so that messages delivered within the active route timeout interval. Several protoco...

  17. An Anonymous Secure Routing Using OLSR Protocol

    OpenAIRE

    Osiers Gyamfuah Grace; Dr. John Rajan

    2013-01-01

    Security and privacy concerns are major issues to be considered in Mobile Ad hoc Networking (MANET). Several routing protocols have been proposed to achieve both routing and data packets security. In order to achieve privacy, the anonymous routing concept has been introduced and few protocols have been proposed for use in this area. In this paper, global position system (GPS) device is used to obtain the current location of nodes and with the help of a cryptographic algorithm incorporated int...

  18. Gender differences in virtual route learning

    OpenAIRE

    Larios, Hector

    2011-01-01

    Past studies have found evidence of gender differences in route-learning strategies, indicating that men rely on configurational strategies (e.g., cardinal directions) and women rely on topographic strategies (e.g., landmarks). Whether and how these gender differences in route-learning strategies extend to virtual environments is not fully known. In this dissertation, I investigated gender differences in learning virtual routes from two frames of reference- egocentric and allocentric. One hun...

  19. Advances in optimal routing through computer networks

    Science.gov (United States)

    Paz, I. M.

    1977-01-01

    The optimal routing problem is defined. Progress in solving the problem during the previous decade is reviewed, with special emphasis on technical developments made during the last few years. The relationships between the routing, the throughput, and the switching technology used are discussed and their future trends are reviewed. Economic aspects are also briefly considered. Modern technical approaches for handling the routing problems and, more generally, the flow control problems are reviewed.

  20. Flood Routing Technique for Data Networks

    OpenAIRE

    Cho, Jaihyung; Breen, James

    1998-01-01

    In this paper, a new routing algorithm based on a flooding method is introduced. Flooding techniques have been used previously, e.g. for broadcasting the routing table in the ARPAnet [1] and other special purpose networks [3][4][5]. However, sending data using flooding can often saturate the network [2] and it is usually regarded as an inefficient broadcast mechanism. Our approach is to flood a very short packet to explore an optimal route without relying on a pre-established routing table, a...

  1. Security Attacks On MANET Routing Protocols

    Directory of Open Access Journals (Sweden)

    Chiragkumar V. Patel

    2013-10-01

    Full Text Available The paper gives idea about various routing protocols for Mobile Ad-Hoc Network against security issues. MANET is vulnerable to various security attacks due to its dynamically changing topology, self configurable nature and lack of centralized control. Malicious node can significantly degrade the performance and reliability of Ad-hoc Network routing protocols. From the survey it has been made quite clear that basic MANET protocols are vulnerable to various routing attacks. While Secure AODV (SAODV routing protocol performs quite well to improve performance in presence of security attack in MANET.

  2. Flying Ad-Hoc Networks: Routing Protocols, Mobility Models, Issues

    Directory of Open Access Journals (Sweden)

    Muneer Bani Yassein

    2016-06-01

    Full Text Available Flying Ad-Hoc Networks (FANETs is a group of Unmanned Air Vehicles (UAVs which completed their work without human intervention. There are some problems in this kind of networks: the first one is the communication between (UAVs. Various routing protocols introduced classified into three categories, static, proactive, reactive routing protocols in order to solve this problem. The second problem is the network design, which depends on the network mobility, in which is the process of cooperation and collaboration between the UAV. Mobility model of FANET is introduced in order to solve this problem. In Mobility Model, the path and speed variations of the UAV and represents their position are defined. As of today, Random Way Point Model is utilized as manufactured one for Mobility in the greater part of recreation situations. The Arbitrary Way Point model is not relevant for the UAV in light of the fact that UAV do not alter their course and versatility, speed quickly at one time because of this reason, we consider more practical models, called Semi-Random Circular Movement (SRCM Mobility Model. Also, we consider different portability models, Mission Plan-Based (MPB Mobility Model, Pheromone-Based Model. Moreover, Paparazzi Mobility Model (PPRZM. This paper presented and discussed the main routing protocols and main mobility models used to solve the communication, cooperation, and collaboration in FANET networks.

  3. Evaluation of Night Route Network on Flight Efficiency in Europe

    Directory of Open Access Journals (Sweden)

    Tomislav Mihetec

    2011-09-01

    Full Text Available There are many different concepts and definitions for the flight efficiency, where every stakeholder involved in air transport has its own perception on flight efficiency. Flight efficiency concept is based on trade-offs between safety, airspace capacity, fuel consumption, flying distance, time distance, time cost, fuel cost etc. Flight time and flying distance which has impact to fuel burn and operation costs to airspace users are mainly generated by deviations from the optimum trajectories. According to the Performance Review Commission (PRC Report in 2009 average en-route extension in Europe was 47.6 km, with the year on year improvement of 1.2 km. The PRC Report emphasized that there is constant increase of medium/long haul flights operated by aircraft operators in Europe while short haul flights are decreasing. One of the issues, concerning flight efficiency in Europe, is that aircraft operators are not using night routes sufficient during flight planning process. This paper is presenting flight efficiency for the traffic demand using night route network and not using it at all. Flight inefficiency is expresses by the agreed performance indicators: distance difference (NM, duration difference (min, fuel combustion difference (kg and CO2 emission (t environmental indicator.

  4. Bus Routes, Marta Bus Routes located in Transportation database, Published in unknown, City of Roswell, GA.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Bus Routes dataset as of unknown. It is described as 'Marta Bus Routes located in Transportation database'. Data by this publisher are often provided in State...

  5. Transportation routing analysis geographic information system - tragis, progress on improving a routing tool

    International Nuclear Information System (INIS)

    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 United States. This paper outlines some of the features available in this model. (authors)

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

    International Nuclear Information System (INIS)

    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

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

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

    Directory of Open Access Journals (Sweden)

    Wen-Chen Hu

    2014-12-01

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

  9. Network Resilience through Multiple Routing Configurations

    Directory of Open Access Journals (Sweden)

    Naga Raju Pamidi

    2011-11-01

    Full Text Available We propose the use of multi-topology (MT routing for network resilience against link and node failures. We describe the multi-topologies by an n-dimensional vector of different link costs for all links in the network. It is the base for the calculation of n shortest path trees from any node to all other destinations, i.e. for n virtual routing topologies. We define the link costs in such a way that the routing topologies complement each other in the sense that at least one valid route remains in a single link or node failure scenario for each pair of nodes in at least one routing topology. In such a failure case, packets are rather deviated over the intact routing topology than discarded. The recovery speed of the presented mechanism is very fast and can be compared to fast rerouting mechanisms in MPLS, which reduce packet, drops to a minimum. In contrast to MPLS, MT routing is still a pure IP-based solution that retains the scalability and the robustness of IP routing. As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC. Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions.

  10. Routes visualization: Automated placement of multiple route symbols along a physical network infrastructure

    OpenAIRE

    Jules Teulade-Denantes; Adrien Maudet; Cécile Duchêne

    2015-01-01

    This paper tackles the representation of routes carried by a physical network infrastructure on a map. In particular, the paper examines the case where each route is represented by a separate colored linear symbol offset from the physical network segments and from other routes—as on public transit maps with bus routes offset from roads. In this study, the objective is to automate the placement of such route symbols while maximizing their legibility, especially at junctions. The problem is mod...

  11. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.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 sol

  12. Environmental factors along the Northern Sea Route

    International Nuclear Information System (INIS)

    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

  13. Energy Efficient Routing in Nomadic Networks

    DEFF Research Database (Denmark)

    Kristensen, Mads Darø; Bouvin, Niels Olof

    2007-01-01

    We present an evaluation of a novel energy-efficient routing protocol for mobile ad-hoc networks. We combine two techniques for optimizing energy levels with a well-known routing protocol. We examine the behavior of this combination in a nomadic network setting, where some nodes are stationary and...

  14. Secure Geographic Routing Protocols: Issues and Approaches

    OpenAIRE

    Mehdi sookhak; Ramin Karimi; NorafidaIthnin; Mahboobeh Haghparast; Ismail FauziISnin

    2011-01-01

    In the years, routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches Most state-of-the-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN) and also provide a qualitative comparison of them.

  15. TBRF: Trust Based Routing Framework for WSNs

    Directory of Open Access Journals (Sweden)

    Kushal Gulaskar

    2014-03-01

    Full Text Available The multi-hop routing in wireless sensor networks (WSNs offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implemented TBRF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TBRF provides trustworthy and energy-efficient route. Most importantly, TBRF proves effective against those harmful attacks developed out of identity deception; the resilience of TBRF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TBRF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TBRF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism

  16. Secure Geographic Routing Protocols: Issues and Approaches

    CERN Document Server

    sookhak, Mehdi; Haghparast, Mahboobeh; ISnin, Ismail Fauzi

    2011-01-01

    In the years, routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches. Most state-of-the-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN) and also provide a qualitative comparison of them.

  17. Parallel Genetic Algorithm for Channel Routing

    OpenAIRE

    Rao, Prahlada BB; Patnaik, LM; Hansdah, RC

    1993-01-01

    In this paper, we propose a new channel routing algorithm based on genetic approach. This involves designing a new encoding scheme and an evaluation function used by the genetic algorithm (GA) for channel routing problem. The algorithm has been implemented as both sequential and distributed CA. The speedup achieved is positive and encouraging.

  18. ROUTE CHOICE MODELLING FOR BICYCLE TRIPS

    Directory of Open Access Journals (Sweden)

    Ehsan Beheshtitabar

    2014-06-01

    Full Text Available This paper intends to find out which parameters have the highest influence on bicyclists’ route-choice-behaviour and how they contribute. There are many attributes considered throughout different studies that are favoured by cyclists. The attributes are the basis for generating a function which predicts the route choice of cyclists. The paper aims at making a comparison between distance-based routes and attribute-based routes. The model for creating the bicycle route choice program is based on the network model of Norrköping, Sweden. The preferred attributes of the model each assign a weight in the cost function of the model for each link of the urban network. The algorithm of the lowest cost function route searches the shortest path in terms of assigned link costs over the whole network. For comparing the results of the cost function and the shortest route (between an origin-destination, the model has a shortest path finding algorithm between different Origin and Destination pairs implemented. It has been viewed that around 25% of all cumulative routes do not show any distance differences between the shortest path distance and attributes based solution. With the used weights of the Standard scenario, it can be seen that the trade-off between shortest distance and safety respectively comfort can be optimized, fulfilling both criteria (distance and safety/comfort.

  19. Using Collective Intelligence to Route Internet Traffic

    OpenAIRE

    David H. Wolpert; Tumer, Kagan; Frank, Jeremy

    1999-01-01

    A COllective INtelligence (COIN) is a set of interacting reinforcement learning (RL) algorithms designed in an automated fashion so that their collective behavior optimizes a global utility function. We summarize the theory of COINs, then present experiments using that theory to design COINs to control internet traffic routing. These experiments indicate that COINs outperform all previously investigated RL-based, shortest path routing algorithms.

  20. Secure Geographic Routing Protocols: Issues and Approaches

    Directory of Open Access Journals (Sweden)

    Mehdi sookhak

    2011-09-01

    Full Text Available In the years, routing protocols in wireless sensor networks (WSN have been substantially investigated by researches Most state-of-the-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN and also provide a qualitative comparison of them.

  1. KREAM: Korean Radiation Exposure Assessment Model for Aviation Route Dose

    Science.gov (United States)

    Hwang, J.; Dokgo, K.; Choi, E. J.; Kim, K. C.; Kim, H. P.; Cho, K. S. F.

    2014-12-01

    Since Korean Air has begun to use the polar route from Seoul/ICN airport to New York/JFK airport on August 2006, there are explosive needs for the estimation and prediction against cosmic radiation exposure for Korean aircrew and passengers in South Korea from public. To keep pace with those needs of public, Korean government made the law on safety standards and managements of cosmic radiation for the flight attendants and the pilots in 2013. And we have begun to develop our own Korean Radiation Exposure Assessment Model (KREAM) for aviation route dose since last year funded by Korea Meteorological Administration (KMA). GEANT4 model and NRLMSIS 00 model are used for calculation of the energetic particles' transport in the atmosphere and for obtaining the background atmospheric neutral densities depending on altitude. For prediction the radiation exposure in many routes depending on the various space weather effects, we constructed a database from pre-arranged simulations using all possible combinations of R, S, and G, which are the space weather effect scales provided by the National Oceanic and Atmospheric Administration (NOAA). To get the solar energetic particles' spectrum at the 100 km altitude which we set as a top of the atmospheric layers in the KREAM, we use ACE and GOES satellites' proton flux observations. We compare the results between KREAM and the other cosmic radiation estimation programs such as CARI-6M which is provided by the Federal Aviation Agency (FAA). We also validate KREAM's results by comparison with the measurement from Liulin-6K LET spectrometer onboard Korean commercial flights and Korean Air Force reconnaissance flights.

  2. Aviation route dose calculation and its numerical basis

    International Nuclear Information System (INIS)

    The European Directive 96/12 requires that aircrew be considered as occupationally exposed persons and that measures are taken to determine the individual doses of air crew and cabin personnel. Consequently, several European research institutes have undertaken an extensive programme of air borne and mountain based experiments to measure the radiation field in the earth's atmosphere. Furthermore, Monte Carlo radiation transport calculations were done to follow the radiation cascades from the top of the atmosphere down to the earth's surface. Though the basic physical processes and radiation components have been studied previously, the determination of dose quantities require more physical information: Both operational (ambient dose equivalent) and risk related quantities (effective dose) contain non-physical information which is described by quality and radiation weighting factors, respectively. The radiation transport calculations show that at normal flight altitudes the spectral shapes of the particle fluences are essentially invariable. This permits to use calculated conversion coefficients to determine the dose quantities from calculated and experimental spectral data. This appears necessary especially for those radiation components whose dose contribution can not experimentally separated, but may considerably contribute to the effective dose considering the radiation factors presently recommended by the ICRP, e.g. for protons. The European Computer Package EPCARD for the Calculation of Aviation Route Doses was designed to combine the experimental and theoretical data in the best available way. The concept is to treat each major component of the cosmic rays separately, i.e. muons, electrons and photons, neutrons, protons and charged particles. The influence of geomagnetic shielding is considered based on calculations and experimental data, and the magnitude of solar modulation is inferred from neutron monitor data. Route doses are calculated along any specified

  3. Caspian producers contemplate excess of export routes

    International Nuclear Information System (INIS)

    The fourth quarter of 2005 sees the commissioning of the latest oil export route from the Caspian: the Baku-Tbilisi-Ceyhan (BTC) pipeline from Azerbaijan to Turkey. BTC is one of a series of potential export routes from Central Asia and the Trans-Caucasus. The proposed capacity of all these routes, however, far exceeds the volume of oil likely to be available to fill it at any time in the foreseeable future. Turkey nevertheless continues to press for more export capacity in an attempt to reduce the number of tankers passing through the narrow waterways that connect the Black Sea with the Mediterranean. For their part, Caspian oil producers want their oil to be transported by the cheapest and most direct route, which appears to rule out pipelines designed to divert their exports away from the Black Sea-Mediterranean sea-route. (author)

  4. Highway and interline transportation routing models

    International Nuclear Information System (INIS)

    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

  5. Individuality in bird migration: routes and timing.

    Science.gov (United States)

    Vardanis, Yannis; Klaassen, Raymond H G; Strandberg, Roine; Alerstam, Thomas

    2011-08-23

    The exploration of animal migration has entered a new era with individual-based tracking during multiple years. Here, we investigated repeated migratory journeys of a long-distance migrating bird, the marsh harrier Circus aeruginosus, in order to analyse the variation within and between individuals with respect to routes and timing. We found that there was a stronger individual repeatability in time than in space. Thus, the annual timing of migration varied much less between repeated journeys of the same individual than between different individuals, while there was considerable variation in the routes of the same individual on repeated journeys. The overall contrast in repeatability between time and space was unexpected and may be owing to strong endogenous control of timing, while short-term variation in environmental conditions (weather and habitat) might promote route flexibility. The individual variation in migration routes indicates that the birds navigate mainly by other means than detailed route recapitulation based on landmark recognition. PMID:21307045

  6. Latent variables and route choice behavior

    DEFF Research Database (Denmark)

    Prato, Carlo Giacomo; Bekhor, Shlomo; Pronello, Cristina

    2012-01-01

    In the last decade, a broad array of disciplines has shown a general interest in enhancing discrete choice models by considering the incorporation of psychological factors affecting decision making. This paper provides insight into the comprehension of the determinants of route choice behavior by...... proposing and estimating a hybrid model that integrates latent variable and route choice models. Data contain information about latent variable indicators and chosen routes of travelers driving regularly from home to work in an urban network. Choice sets include alternative routes generated with a branch....... Estimation results illustrate that considering latent variables (i.e., memory, habit, familiarity, spatial ability, time saving skills) alongside traditional variables (e.g., travel time, distance, congestion level) enriches the comprehension of route choice behavior....

  7. A New Approach to an Automated Air Traffic Control

    Institute of Scientific and Technical Information of China (English)

    Patchev Dragoljub

    2014-01-01

    This paper identifies areas of improvements of the air traffic control system and proposes modification of the concept of automation by using available technologies. With the proposed modification, the current Europe wide en route network structure can be modified in order to make routes more optimal. For this new route network structure, a new concept of automation will be used to manage with the air traffic. The first identified area of improvement is implementation of automation process that will enable decentralization of the air traffic control functionality to each individual aircraft and this will be achieved through automated routing of the aircrafts and CD&R (conflict detection and resolution). The FMS (flight management system) at the aircraft will make decisions for the optimal flight route based on the sensor inputs, information on selection of the routes, next hope points and flight levels, all received by ADS-B (automatic dependant surveillance-broadcast). The second area is processing the information about the deviation from the optimal route as in flight plan due to a traffic management (vectoring, level change) and taking it into consideration when further actions are undertaken. For each action, a cost factor will be calculated from the fuel burned for that action. This factor will be used to select conflict resolution protocol. The proposed concept shall increase the capacity of the network, and enable the air traff~c more efficient and more environmentally friendly while maintaining safe separation.

  8. New routes for allergen immunotherapy.

    Science.gov (United States)

    Johansen, Pål; von Moos, Seraina; Mohanan, Deepa; Kündig, Thomas M; Senti, Gabriela

    2012-10-01

    IgE-mediated allergy is a highly prevalent disease in the industrialized world. Allergen-specific immunotherapy (SIT) should be the preferred treatment, as it has long lasting protective effects and can stop the progression of the disease. However, few allergic patients choose to undergo SIT, due to the long treatment time and potential allergic adverse events. Since the beneficial effects of SIT are mediated by antigen presenting cells inducing Th1, Treg and antibody responses, whereas the adverse events are caused by mast cells and basophils, the therapeutic window of SIT may be widened by targeting tissues rich in antigen presenting cells. Lymph nodes and the epidermis contain high density of dendritic cells and low numbers of mast cells and basophils. The epidermis has the added benefit of not being vascularised thereby reducing the chances of anaphylactic shock due to leakage of allergen. Hence, both these tissues represent highly promising routes for SIT and are the focus of discussion in this review. PMID:23095873

  9. Drug targeting through pilosebaceous route.

    Science.gov (United States)

    Chourasia, Rashmi; Jain, Sanjay K

    2009-10-01

    Local skin targeting is of interest for the pharmaceutical and the cosmetic industry. A topically applied substance has basically three possibilities to penetrate into the skin: transcellular, intercellular, and follicular. The transfollicular path has been largely ignored because hair follicles constitute only 0.1% of the total skin. The hair follicle is a skin appendage with a complex structure containing many cell types that produce highly specialised proteins. The hair follicle is in a continuous cycle: anagen is the hair growth phase, catagen the involution phase and telogen is the resting phase. Nonetheless, the hair follicle has great potential for skin treatment, owing to its deep extension into the dermis and thus provides much deeper penetration and absorption of compounds beneath the skin than seen with the transdermal route. In the case of skin diseases and of cosmetic products, delivery to sweat glands or to the pilosebaceous unit is essential for the effectiveness of the drug. Increased accumulation in the pilosebaceous unit could treat alopecia, acne and skin cancer more efficiently and improve the effect of cosmetic substances and nutrients. Therefore, we review herein various drug delivery systems, including liposomes, niosomes, microspheres, nanoparticles, nanoemulsions, lipid nanocarriers, gene therapy and discuss the results of recent researches. We also review the drugs which have been investigated for pilosebaceous delivery. PMID:19663765

  10. Proximity Aware Routing in Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Valerie Alandzi

    2007-01-01

    Full Text Available Most of the existing routing protocols for ad hoc networks are designed to scale in networks of a few hundred nodes. They rely on state concerning all links of the network or links on the route between a source and a destination. This may result in poor scaling properties in larger mobile networks or when node mobility is high. Using location information to guide the routing process is one of the most often proposed means to achieve scalability in large mobile networks. However, location-based routing is difficult when there are holes in the network topology. We propose a novel position-based routing protocol called Proximity Aware Routing for Ad-hoc networks (PARA to address these issues. PARA selects the next hop of a packet based on 2-hops neighborhood information. We introduce the concept of “proximity discovery”. The knowledge of a node’s 2-hops neighborhood enables the protocol to anticipate concave nodes and helps reduce the risks that the routing protocol will reach a concave node in the network. Our simulation results show that PARA’s performance is better in sparse networks with little congestion. Moreover, PARA significantly outperforms GPSR for delivery ratio, transmission delay and path length. Our results also indicate that PARA delivers more packets than AODV under the same conditions.

  11. Integrated Routing Protocol for Opportunistic Networks

    Directory of Open Access Journals (Sweden)

    Anshul Verma

    2011-03-01

    Full Text Available In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a sender and a receiver. Information about the context in which the users communicate is a key piece of knowledge to design efficient routing protocols in opportunistic networks. But this kind of information is not always available. When users are very isolated, context information cannot be distributed, and cannot be used for taking efficient routing decisions. In such cases, context oblivious based schemes are only way to enable communication between users. As soon as users become more social, context data spreads in the network, and context based routing becomes an efficient solution. In this paper we design an integrated routing protocol that is able to use context data as soon as it becomes available and falls back to dissemination-based routing when context information is not available. Then, we provide a comparison between Epidemic and PROPHET, these are representative of context oblivious and context aware routing protocols. Our results show that integrated routing protocol is able to provide better result in term of message delivery probability and message delay in both cases when context information about users is available or not.

  12. Influence of inoculation route on the course of infection of Trichomonas gallinae in nonimmune pigeons

    Science.gov (United States)

    Kocan, R.M.

    1971-01-01

    The Jones' Barn strain of Trichomonas gallinae was given to nonimmune pigeons by five different routes: (I) oral; (2) pulmonary; (3) intravenous; (4) intramuscular; (5) subcutaneous. The birds infected by the oral and pulmonarv routes succumbed to typical trichomoniasis involving the liver and lungs respectively. The pulmonary route also produced air sac lesions resulting from trichomonads passing through the lungs via the mesobronchi. Intramuscular and subcutaneous introduction of the parasite resulted in transient infections involving small lesions which were resorbed in I to 2 weeks. The intravenous introductions resulted only in large lesions at the site of inoculation, presumably from perivascular leakage at the time of parasite entry. No other internal lesions were found and cultures made from liver and lung tissue were negative for T. gallinae. The results of infection by the oral and pulmonary routes were not surprising, since these are essentially normal routes of infection. The inhibition of parasite development at the intramuscular and subcutaneous sites of parasite introduction may have resulted from inhibition of the mobility of the parasite by connective tissue or these substrates may have been unsuitable for parasite development. The results of intravenous inoculation are surprising, since it has been stated that T. gallinae reaches the viscera via the circulation. If this were true, lesions should have occurred at least in the lungs where the parasites would have lodged following introduction into a vein. Recovery from infection at any site is apparently sufficient to produce an immunity to the parasite when subsequently introduced via the oral route.

  13. Routing problems based on hils system platform

    Directory of Open Access Journals (Sweden)

    Andrzej Adamski

    2015-03-01

    Full Text Available Background: The logistic systems are very complex socio-technical systems. In this paper the proposal of application of the hierarchical multi-layers system platform HILS approach for the solution of the complex vehicle routing problems is presented. The interactive system functional structure was proposed which by intelligent dedicated inter-layers interactions enables the professional solutions of these practical problems. To illustrate these capabilities the complex example of the real-time VRP-SPD-TW routing problem was presented in which upper layers offers the context-related real-time updating network specifications that stimulates the adequate routing parameters and specifications updating for problem solution in optimization layer. At the bottom dispatching control layer the DISCON (Dispatching CONtrol method from public transport was adopted to logistics applications in which the actual routing is treated as obligatory reference schedule to be stabilized. The intelligence aspects are related among others to HILS based decomposition, context-related trade-offs between routing modifications and corrective dispatching control capabilities e.g. priority or route guidance actions. Methods: Decomposition of the vehicle routing problem for the HILS layers tasks creating the ILS system hierarchical structure. Dedicated solution method for the VRP-SPD-TW routing problem. The recognition of the control preferences structure by AHP-Entropy methods. DISCON and PIACON multi-criteria interacting control methods. Results: Original formulation and solution of the vehicle routing problem by system-wide approach with essential practical advantages: consistency, lack of redundancy, essential reduction of dimension, dedicated formulation, multi-criteria approach, exploration of the integration and intelligence features supported by the intelligent PIACON-DISCON methods control activities Conclusions: The presented proposal creates the professional

  14. Agent routing algorithm in wireless sensor networks

    Science.gov (United States)

    Zhang, Yuqing; Yang, Shuqun

    2013-03-01

    Wireless sensor networks are a new technology of information acquisition and processing, so they are widely used in all kinds of fields. In the paper we introduce Agent technology into the wireless sensor network, conduct a in-depth research on the four routing schemes, and propose a new improved routing scheme, which considers the energy consumption of both nodes and path. Furthermore, The scheme we proposed has efficient routing function, can balance the energy consumption of nodes and extends the lifetime of the network in a more efficient way.

  15. Dynamic telecast Routing with Security Intensification

    Directory of Open Access Journals (Sweden)

    BeerthiSahadev

    2011-09-01

    Full Text Available Security has become one of the majorissues for data communication over wired and wireless networks. Different from the past work on the designs of network security algorithms and system infrastructures, we will propose a dynamic broadcast routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks , without introducing extra control messages. The simulation results have been verified from the proposed algorithm and it shows the capability of the proposed algorithm.

  16. UNFAIR COMPETITION? AMERICAN AND JAPANESE AIRLINES TRANSPACIFIC ROUTE RIVALRIES, 1946—1971

    Directory of Open Access Journals (Sweden)

    Douglas Karsner

    2007-01-01

    Full Text Available This article examines the changing nature of competition between American and Japanese airlines for transpacific passenger and cargo routes during the formative early postwar era. It focuses on the period from 1946, when the US government first certified Northwest and Pan American airlines to fly to Japan, to 1971, as the age of mass air travel took off amidst major economic changes such as the Nixon Shocks. Utilizing both American and Japanese sources, the author argues that a complex mixture of economic and diplomatic factors shaped American and Japanese airlines’ transpacific route rivalries.

  17. History-based route selection for reactive ad hoc routing protocols

    Science.gov (United States)

    Medidi, Sirisha; Cappetto, Peter

    2007-04-01

    Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.

  18. Performance Analysis of Route Discovery by Cross Layer Routing Protocol- RDCLRP

    Directory of Open Access Journals (Sweden)

    Mehajabeen Fatima

    2013-06-01

    Full Text Available Wired and wireless network is based on the TCP / IP architecture but it is not sufficient to cope with the dynamics of the MANET. Cross layer design can be an alternative architecture for MANET. Frequent route break is one of the major problems of mobile adhoc network (MANET. Path breaks due to less available battery power and mobility of nodes. Most of the battery power is consumed in flooding of control packets. A key challenge in the design of efficient routing protocol is to reduce link breakage and flooding of control packets. Route breakage can be reduced if the possibility of route breakage is predicted and a handoff is done without drop of data packets. If route breakage is reduced, the more battery power will be available with nodes. In turn it reduces the possibility of route breakage and the possibility of flooding. This is a cumulative effect. So a novel preemptive route repair algorithm is proposed named as RDCLRP- Route discovery by cross layer routing protocol to reduce frequency of control packet flooding and route breakage. Three variants of RDCLRP and their results are illustrated. In this paper, the impact of the number of nodes on performance of RDCLRP are investigated and analyzed. The results show 55.6% reduction in link breakage, 14.7% improvement in residual battery power and an average of 6.7% increase in throughput compared to basic AODV.

  19. Fabrication of copper-alumina nanocomposites by mechano-chemical routes

    Energy Technology Data Exchange (ETDEWEB)

    Shehata, F. [Department of Mechanical Design and Production Engineering, Faculty of Engineering, Zagazig University (Egypt)], E-mail: faroukash45@yahoo.com; Fathy, A.; Abdelhameed, M. [Department of Mechanical Design and Production Engineering, Faculty of Engineering, Zagazig University (Egypt); Moustafa, S.F. [Central Metallurgical Research and Development Institute (Egypt)

    2009-05-12

    It is well known that Cu-Al{sub 2}O{sub 3} nanocomposite materials have high potential for use in structural applications in which enhanced mechanical characteristics are required. Therefore, the present work is intended to produce nanosized powder of Cu-Al{sub 2}O{sub 3} nanocomposites, with various alumina contents, and to investigate their properties. Mechano-chemical method with two different routes, were used to synthesize the Cu-Al{sub 2}O{sub 3} nanocomposite powders. First, route A was carried out by addition of Cu to aqueous solution of aluminum nitrate, and second, route B was also carried out by addition of Cu to aqueous solution of aluminum nitrate and ammonium hydroxide. In both routes, the mixtures were heated in air and milled mechanically to get the oxides powders of CuO and Al{sub 2}O{sub 3}. The CuO was reduced in preferential hydrogen atmosphere into fine copper. The composite powders have been cold pressed into briquettes and sintered in hydrogen atmosphere. The structure and characteristics of powders as well as sintered composites produced from both routes were examined by X-ray diffraction (XRD), scanning electron microscopy (SEM) with energy dispersive spectrometer (EDS), transmission electron microscopy (TEM) and metallography techniques. The results showed that, in both routes, the alumina of nanosized particles was formed and dispersed within the copper matrix. The structure revealed the formation of CuAlO{sub 2} spinel structure at copper alumina interface. Nanocomposites produced by route B showed finer alumina particles of 30 nm compared to 50 nm produced by route A resulting in improving properties in terms of relative density and microhardness values.

  20. Advances in technology for integrated route analysis

    Energy Technology Data Exchange (ETDEWEB)

    Carey, N.T.; George, P.J.; Khamhawi, K. [SAGE Engineering Ltd., Bath (United Kingdom)

    1998-12-31

    Pipeline and cable routes are becoming ever complex with routes being chosen in increasingly remote and technically demanding areas. Clients now demand greater information and analysis from the surveys and interpretations. By utilising a range of leading edge equipment, greater information can be obtained, visualised and analysed than ever before. Three case studies are presented, indicating how such technology has been employed to provide the client with a greater understanding of complex engineering projects, and what additional technology could have been utilised to further enhance the project. Examples of data, systems and project management used on two major pipe routes and one major cable route are presented. Swath Bathymetry (ISIS), 3D visualisation (Fledermaus), cone penetrometer testing (SAGE Miniature CPT), GIS databases (INfoXProfessional), and the use of pipeline stress analysis, upheaval buckling and rock dump optimisation software (SAFE Profile) are all examined. (author)

  1. Statistical Analysis to Select Evacuation Route

    Science.gov (United States)

    Musyarof, Z.; Sutarto, D. Y.; Atika, D. R.; Fajriya Hakim, R. B.

    2015-06-01

    Each country should be responsible for the safety of people, especially responsible for the safety of people living in disaster-prone areas. One of those services is provides evacuation route for them. But all this time, the selection of evacuation route is seem does not well organized, it could be seen that when a disaster happen, there will be many accumulation of people on the steps of evacuation route. That condition is dangerous to people because hampers evacuation process. By some methods in Statistical analysis, author tries to give a suggestion how to prepare evacuation route which is organized and based on people habit. Those methods are association rules, sequential pattern mining, hierarchical cluster analysis and fuzzy logic.

  2. Quantum chemistry-assisted synthesis route development

    International Nuclear Information System (INIS)

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

  3. 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....... Additionally, we address the question how on-line routing methods can be integrated in this system....

  4. Integrating routing decisions in public transportation problems

    CERN Document Server

    Schmidt, Marie E

    2014-01-01

    This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously. This work is technically deep, with insightful findings regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs ...

  5. Language and Spatial Cognition in Route Navigation

    Institute of Scientific and Technical Information of China (English)

    宋娟

    2013-01-01

    The purpose of this study is to investigate the contrast between using street names or landmarks to process spatial in⁃structions. The study confirms the special cognitive status of landmarks in the mental representation of routes.

  6. IPv6 Network Mobility Route Optimization Survey

    Directory of Open Access Journals (Sweden)

    Samer S. Hassan

    2011-01-01

    Full Text Available Problem statement: This study describes that the Next Generation of Networks (NGN communication will supports multiple technologies, handles the mobility of end users to move through heterogeneous access networks, with ability to connect to different networks. Where the Internet Engineer Task Force maintain (IETF the Mobile IPv6 (MIPv6 to handles the mobility of networks (NEMO, to provide wide band and more scalable network services. One of the MIPv6 built-in features is Route Optimization (RO to solve the inefficient route problem. Conclusion/Recommendations: The main objective of this article is to survey, classify and make a compression between the available schemes for route optimization over the last years depends on the basic criteria generated from the published articles within different network topology. This article presents the problem of suboptimal route which is further increased with increasing of nesting levels and there is no such one scheme is perfect for all network environments.

  7. Rich Vehicle Routing Problems and Applications

    DEFF Research Database (Denmark)

    Wen, Min

    given set of customers. The VRP is a computationally hard combinatorial problem and has been intensively studied by numerous researchers in the last fifty years. Due to the significant economic benefit that can be achieved by optimizing the routing problems in practice, more and more attention has been......The Vehicle Routing Problem (VRP) is one of the most important and challenging optimization problems in the field of Operations Research. It was introduced by Dantzig and Ramser (1959) and defined as the problem of designing the optimal set of routes for a fleet of vehicles in order to serve a...... problems in the sense that consolidation decisions have to be made at the depot and these decisions interact with the planning of pickup and delivery routes. We presented a mathematical model and proposed a Tabu Search based heuristic to solve it. It is shown that the approach can produce near-optimal...

  8. Quantum chemistry-assisted synthesis route development

    Energy Technology Data Exchange (ETDEWEB)

    Hori, Kenji; Sumimoto, Michinori [Graduate School of Science and Engineering, Yamaguchi University, Tokiwadai, Ube, Yamaguchi 755-8611 (Japan); Murafuji, Toshihiro [Graduate School of Medicine, Yamaguchi University, Yamaguchi, Yamaguchi 753-8512 (Japan)

    2015-12-31

    We have been investigating “quantum chemistry-assisted synthesis route development” using in silico screenings and applied the method to several targets. Another example was conducted to develop synthesis routes for a urea derivative, namely 1-(4-(trifluoromethyl)-2-oxo-2H-chromen-7-yl)urea. While five synthesis routes were examined, only three routes passed the second in silico screening. Among them, the reaction of 7-amino-4-(trifluoromethyl)-2H-chromen-2-one and O-methyl carbamate with BF{sub 3} as an additive was ranked as the first choice for synthetic work. We were able to experimentally obtain the target compound even though its yield was as low as 21 %. The theoretical result was thus consistent with that observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings.

  9. An Anonymous Secure Routing Using OLSR Protocol

    Directory of Open Access Journals (Sweden)

    Osiers Gyamfuah Grace

    2013-01-01

    Full Text Available Security and privacy concerns are major issues to be considered in Mobile Ad hoc Networking (MANET. Several routing protocols have been proposed to achieve both routing and data packets security. In order to achieve privacy, the anonymous routing concept has been introduced and few protocols have been proposed for use in this area. In this paper, global position system (GPS device is used to obtain the current location of nodes and with the help of a cryptographic algorithm incorporated into the existing Optimized Link State Routing protocol (OLSR, it is expected that security services such as authentication, data integrity, privacy and confidentiality will be provided. This work proposes to protect the network against active attacks such as impersonation and modification.

  10. Latent factors and route choice behaviour

    DEFF Research Database (Denmark)

    Prato, Carlo Giacomo

    A behaviourally realistic description of the route choice process should consider variables that are both observable, such as travel time and cost, and unobservable, such as attitudes, perceptions, spatial abilities and network knowledge. This manuscript focuses on automotive route choice behaviour....... A reliable dataset was prepared through measures of internal consistency and sampling adequacy, and data were analyzed with a proper application of factor analysis to the route choice context. For the dataset obtained from the survey, six latent constructs affecting driver behaviour were extracted and scores...... on each factor for each survey participant were calculated. Path generation algorithms were examined with respect to observed behaviour, through a measure of reproduction with deterministic techniques of the routes indicated in the answers to the survey. Results presented evidence that the majority...

  11. Multicriteria Evolutionary Weather Routing Algorithm in Practice

    Directory of Open Access Journals (Sweden)

    Joanna Szlapczynska

    2013-03-01

    Full Text Available The Multicriteria Evolutionary Weather Routing Algorithm (MEWRA has already been introduced by the author on earlier TransNav 2009 and 2011 conferences with a focus on theoretical application to a hybrid-propulsion or motor-driven ship. This paper addresses the topic of possible practical weather routing applications of MEWRA. In the paper some practical advantages of utilizing Pareto front as a result of multicriteria optimization in case of route finding are described. The paper describes the notion of Pareto-optimality of routes along with a simplified, easy to follow, example. It also discusses a choice of the most suitable ranking method for MEWRA (a comparison between Fuzzy TOPSIS and Zero Unitarization Method is presented. In addition to that the paper briefly outlines a commercial application of MEWRA.

  12. Dams and Obstructions along Iowa's Canoe Routes

    Data.gov (United States)

    Iowa State University GIS Support and Research Facility — This dataset represents obstruction to canoe and boat users of the canoe routes of Iowa. This may represent actual dams, rock dams (natural or man made), large...

  13. Quantum chemistry-assisted synthesis route development

    Science.gov (United States)

    Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

    2015-12-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 BF3 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.

  14. A Multistage Method for Multiobjective Route Selection

    Science.gov (United States)

    Wen, Feng; Gen, Mitsuo

    The multiobjective route selection problem (m-RSP) is a key research topic in the car navigation system (CNS) for ITS (Intelligent Transportation System). In this paper, we propose an interactive multistage weight-based Dijkstra genetic algorithm (mwD-GA) to solve it. The purpose of the proposed approach is to create enough Pareto-optimal routes with good distribution for the car driver depending on his/her preference. At the same time, the routes can be recalculated according to the driver's preferences by the multistage framework proposed. In the solution approach proposed, the accurate route searching ability of the Dijkstra algorithm and the exploration ability of the Genetic algorithm (GA) are effectively combined together for solving the m-RSP problems. Solutions provided by the proposed approach are compared with the current research to show the effectiveness and practicability of the solution approach proposed.

  15. Air and pipeline transport; 1 : 1 500 000

    International Nuclear Information System (INIS)

    On this map the air and pipeline transport on the territory of the Slovak Republic are shown. Passenger and freight air transport in 2000 are analysed. Routes of the transit and international gas pipelines as well as crude oil pipelines are marked

  16. Stochastic vehicle routing: from theory to practice

    OpenAIRE

    Weyland, Dennis; Gambardella, Luca Maria; Montemanni, Roberto

    2013-01-01

    In this thesis we discuss practical and theoretical aspects of various stochastic vehicle routing problems. These are combinatorial optimization problems related to the field of transportation and logistics in which input data is (partially) represented in a stochastic way. More in detail, we focus on two-stage stochastic vehicle routing problems and in particular on so-called a priori optimization problems. The results are divided into a theoretical part and a practical part. In fact, the ...

  17. Southern Bohemian route of industrial heritage

    OpenAIRE

    Vladimír Dvořák; Blažena Gehinová; Dagmar Škodová Parmová; Eva Jaderná; Eduard Šitler

    2009-01-01

    This paper deals with the industrial heritage and its usage in the frame of tourism service supply. There were three so called Anchor Points selected based on the ERIH methodology in the southern Bohemia. And there were also other regional and important places and points named for the future tourist route. The Southern Bohemian Route of Industrial Heritage was invented around the Anchor Point of Schwarzenberg Channel because of its importance in European heritage and its location next to the ...

  18. ETOR-Efficient Token based Opportunistic Routing

    OpenAIRE

    A. Saichand; Naseer, A. R.

    2013-01-01

    This paper proposes an Efficient Token based Opportunistic Routing called ETOR, which is animprovement to the token based coordination approach for opportunistic routing proposed by Economy[1].In Economy, method used for finding the connected candidate order chooses neighbor as the nextcandidate by considering ETX of that neighbor towards the source but it does not consider the linkprobability between the relay candidate and neighbor to be selected. ETOR proposes variant methods forfinding th...

  19. Hybrid Routing in Delay Tolerant Networks

    OpenAIRE

    Mayer, Christoph P.

    2012-01-01

    This work addresses the integration of today\\'s infrastructure-based networks with infrastructure-less networks. The resulting Hybrid Routing System allows for communication over both network types and can help to overcome cost, communication, and overload problems. Mobility aspect resulting from infrastructure-less networks are analyzed and analytical models developed. For development and deployment of the Hybrid Routing System an overlay-based framework is presented.

  20. A CONTRIBUTION TO SECURE THE ROUTING PROTOCOL

    Directory of Open Access Journals (Sweden)

    Mohammed ERRITALI

    2011-10-01

    Full Text Available This work presents a contribution to secure the routing protocol GPSR (Greedy Perimeter StatelessRouting for vehicular ad hoc networks, we examine the possible attacks against GPSR and securitysolutions proposed by different research teams working on ad hoc network security. Then, we propose asolution to secure GPSR packet by adding a digital signature based on symmetric cryptographygenerated using the AES algorithm and the MD5 hash function more suited to a mobile environment

  1. A CONTRIBUTION TO SECURE THE ROUTING PROTOCOL

    OpenAIRE

    Mohammed ERRITALI; Oussama Mohamed Reda; Bouabid El Ouahidi

    2011-01-01

    This work presents a contribution to secure the routing protocol GPSR (Greedy Perimeter StatelessRouting) for vehicular ad hoc networks, we examine the possible attacks against GPSR and securitysolutions proposed by different research teams working on ad hoc network security. Then, we propose asolution to secure GPSR packet by adding a digital signature based on symmetric cryptographygenerated using the AES algorithm and the MD5 hash function more suited to a mobile environment

  2. Integrated Routing Protocol for Opportunistic Networks

    OpenAIRE

    Anshul Verma; Dr. Anurag Srivastava

    2012-01-01

    In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a sender and a receiver. Information about the context in which the users communicate is a key piece of knowledge to design efficient routing protocols in opportunistic networks. But this kind of information is not always available. When users are very isolated, context information cannot be distributed, and cannot be used for taking efficient routing decisions. In such cases, context o...

  3. Ising model for packet routing control

    International Nuclear Information System (INIS)

    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

  4. Low Carbon Footprint Routes for Bird Watching

    OpenAIRE

    Wei-Ta Fang; Chin-Wei Huang; Jui-Yu Chou; Bai-You Cheng; Shang-Shu Shih

    2015-01-01

    Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic info...

  5. Security Conformance for the Dynamically Routed Data

    OpenAIRE

    Suma Patra; Dr.V.Janaki; Priyanka suram; Nalubala Ranjeeth Kumar

    2011-01-01

    Secure transmission of data plays a crucial role in the networks. To improve the security many methodologies have been proposed till now, like cryptographic designs, intrusion detection, dynamic routing etc. In this paper we consider that the data transmission is done by using the concept of dynamic routing. Sometimes the sender may be neglecting the security due to the lack of personal interest, but the receiver has to take the utmost care. In such cases the receiver after forcing the sender...

  6. Improved Multispanning Tree Routing Using Efficient and Reliable Routing Algorithm for Irregular Networks

    Directory of Open Access Journals (Sweden)

    L. Keerthana

    2012-06-01

    Full Text Available A Strategy of Multispanning Tree Zone Ordered Label Based routing is improved with Efficient and Reliable (EAR routing for irregular networks is presented and analyzed in this work. Most existing deadlock free routing methods for irregular topologies impose several limitations on node and channel labeling in an irregular network is based on a pre-defined spanning tree.It is not possible to form a deadlock free zone of three or four channel labels for two spanning tree. So this existing Multispanning Tree Zone Ordered Label Based routing is modified with Efficient and Reliable (EAR routing. EAR is based on four parameters length of the path,distance traversed,transmission of link and energy levels to dynamically determine and maintain the best routes.. The simulation results have shown highest packet delivery ratio, minimum latency, and energy consumption.

  7. Multirate Anypath Routing in Wireless Mesh Networks

    CERN Document Server

    Laufer, Rafael

    2008-01-01

    In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set and one of them forwards the packet on to the destination. To date, there is no theory capable of jointly optimizing both the set of next hops and the transmission rate used by each node. We bridge this gap by introducing a polynomial-time algorithm to this problem and provide the proof of its optimality. The proposed algorithm runs in the same running time as regular shortest-path algorithms and is therefore suitable for deployment in link-state routing protocols. We conducted experiments in a 802.11b testbed network, and our results show that multirate anypath routing performs on average 80% and up to 6.4 times better than anypath routing with a fixed rate of 11 Mbps. If the rate is fixed at 1 Mbps instead, p...

  8. ACO Agent Based Routing in AOMDV Environment

    Directory of Open Access Journals (Sweden)

    Kaur Amanpreet

    2016-01-01

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

  9. Grid data extraction algorithm for ship routing

    Science.gov (United States)

    Li, Yuankui; Zhang, Yingjun; Yue, Xingwang; Gao, Zongjiang

    2015-05-01

    With the aim of extracting environmental data around routes, as the basis of ship routing optimization and other related studies, this paper, taking wind grid data as an example, proposes an algorithm that can effectively extract the grid data around rhumb lines. According to different ship courses, the algorithm calculates the wind grid index values in eight different situations, and a common computational formula is summarised. The wind grids around a ship route can be classified into `best-fitting' grids and `additional' grids, which are stored in such a way that, for example, when the data has a high-spacing resolution, only the `best-fitting' grids around ship routes are extracted. Finally, the algorithm was implemented and simulated with MATLAB programming. As the simulation results indicate, the algorithm designed in this paper achieved wind grid data extraction in different situations and further resolved the extraction problem of meteorological and hydrogeological field grids around ship routes efficiently. Thus, it can provide a great support for optimal ship routing related to meteorological factors.

  10. Route selection issues for NWPA shipments

    International Nuclear Information System (INIS)

    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

  11. Manet Load Balancing Parallel Routing Protocol

    Directory of Open Access Journals (Sweden)

    Hesham Arafat Ali

    2012-07-01

    Full Text Available In recent years, multi-path routing protocols have attained more attention in mobile ad hoc networks as compared to other routing schemes due to their abilities and efficiency in improving bandwidth of communication, increasing delivery reliability, responding to congestion and heavy traffic. Several protocols have been developed to address multi path routing, but it always has a problem that the discovered paths may be not 100% disjoint and sending data is done in only one path until it's broken; the discovery of multiple paths also generates more overhead on the network. Load Balancing Parallel Routing Protocol [LBPRP] tried to solve previous multi path problems, distributing traffic among multiple paths sending data in parallel form as it uses all paths in the same time. We employed a simple test scenario to be sure of proposed model efficiency and to validate the proposed Load Balancing Parallel Routing Protocol. [LBPRP] will achieve load balancing in sending data, decreasing the end-to-end delay and increasing the packet delivery ratio and throughput, thus the performance of multi-path routing protocols can be improved consequently.

  12. A wavelength-switched time-slot routing scheme for wavelength-routed networks

    OpenAIRE

    Li, CY.; Li, GM; Wai, PKA; Li, VOK

    2004-01-01

    Optical time division multiplexing (OTDM) is an effective approach to improve the performance of wavelength-routed (WR) networks. Implementation of all-optical time-slot routing in OTDM-WR networks is difficult owing to the lack of practical optical buffer and sophisticated optical processing devices. In this paper, we proposed a wavelength-switched time-slot routing scheme that can be implemented with fast wavelength converters only. Simulation results demonstrate that the performance of the...

  13. Are GIS-modelled routes a useful proxy for the actual routes followed by commuters?

    OpenAIRE

    Dalton, Alice M; Jones, Andrew P.; Panter, Jenna; Ogilvie, David

    2014-01-01

    Active commuting offers the potential to increase physical activity among adults by being built into daily routines. Characteristics of the route to work may influence propensity to walk or cycle. Geographic information system (GIS) software is often used to explore this by modelling routes between home and work. However, if the validity of modelled routes depends on the mode of travel used, studies of environmental determinants of travel may be biased. We aimed to understand how well mod...

  14. Air Pollution

    OpenAIRE

    Lawther, P. J.

    2014-01-01

    The human costs of air pollution are considerable in Jordan. According to a report published in 2000 by the World Bank under the Mediterranean Environmental Technical Assistance Program (METAP), approximately 600 people die prematurely each year in Jordan because of urban pollution. 50-90% of air pollution in Jordanian towns is caused by road traffic. Readings taken in 2007 by Jordanian researchers showed that levels of black carbon particles in the air were higher in urban areas (caused by v...

  15. Air Pollution.

    Science.gov (United States)

    Air quality is affected by many types of pollutants that are emitted from various sources, including stationary and mobile. These sources release both criteria and hazardous air pollutants, which cause health effects, ecological harm, and material damage. They are generally categ...

  16. PERFORMANCE EVALUATION OF VANETS ROUTING PROTOCOLS

    Directory of Open Access Journals (Sweden)

    Abduladhim Ashtaiwi

    2014-11-01

    Full Text Available Lately, the concept of VANETs (Vehicular Ad hoc Networks has gotten a huge attention as more wireless communication technologies becoming available. Such networkis expected to be one of the most valuable technology for improving efficiency and safety of the future transportation. Vehicular networks are characterized by high mobility nodes which pose many communication challenging problems. In vehicular networks, routing Collision Avoidance Messages (CAMs among vehicles is a key communication problem.Failure in routing CAMs to their intended destination within the time constraint can render these messages useless. Many routing protocols have been adapted for VANETs, such as DSDV (Destination Sequenced Distance Vector, AODV (Ad-hoc On demand Distance Vector, and DSR (Dynamic Source Routing. This work compares the performance of those routing protocols at different driving environments and scenarios created by using the mobility generator (VanetMobiSim and network simulator(NS2. The obtained results at different vehicular densities, speeds, road obstacles, lanes, traffic lights, and transmission ranges showed that on average AODV protocol outperforms DSR and DSDV protocols in packet delivery ratio and end-toend delay. However, at certain circumstances (e.g., at shorter transmission ranges DSR tends to have better performance than AODV and DSDV protocols.

  17. Service discovery with routing protocols for MANETs

    Science.gov (United States)

    Gu, Xuemai; Shi, Shuo

    2005-11-01

    Service discovery is becoming an important topic as its use throughout the Internet becomes more widespread. In Mobile Ad hoc Networks (MANETs), the routing protocol is very important because it is special network. To find a path for data, and destination nodes, nodes send packets to each node, creating substantial overhead traffic and consuming much time. Even though a variety of routing protocols have been developed for use in MANETs, they are insufficient for reducing overhead traffic and time. In this paper, we propose SDRP: a new service discovery protocol combined with routing policies in MANETs. The protocol is performed upon a distributed network. We describe a service by a unique ID number and use a group-cast routing policy in advertisement and request. The group-cast routing policy decreases the traffic in networks, and it is efficient to find destination node. In addition, the nodes included in the reply path also cache the advertisement information, and it means when each node finds a node next time, they can know where it is as soon as possible, so they minimize the time. Finally, we compare SDRP with both Flood and MAODV in terms of overload, and average delay. Simulation results show SDRP can spend less response time and accommodate even high mobility network environments.

  18. An Indirect Route for Ethanol Production

    Energy Technology Data Exchange (ETDEWEB)

    Eggeman, T.; Verser, D.; Weber, E.

    2005-04-29

    The ZeaChem indirect method is a radically new approach to producing fuel ethanol from renewable resources. Sugar and syngas processing platforms are combined in a novel way that allows all fractions of biomass feedstocks (e.g. carbohydrates, lignins, etc.) to contribute their energy directly into the ethanol product via fermentation and hydrogen based chemical process technologies. The goals of this project were: (1) Collect engineering data necessary for scale-up of the indirect route for ethanol production, and (2) Produce process and economic models to guide the development effort. Both goals were successfully accomplished. The projected economics of the Base Case developed in this work are comparable to today's corn based ethanol technology. Sensitivity analysis shows that significant improvements in economics for the indirect route would result if a biomass feedstock rather that starch hydrolyzate were used as the carbohydrate source. The energy ratio, defined as the ratio of green energy produced divided by the amount of fossil energy consumed, is projected to be 3.11 to 12.32 for the indirect route depending upon the details of implementation. Conventional technology has an energy ratio of 1.34, thus the indirect route will have a significant environmental advantage over today's technology. Energy savings of 7.48 trillion Btu/yr will result when 100 MMgal/yr (neat) of ethanol capacity via the indirect route is placed on-line by the year 2010.

  19. Fuzzy Optimized Metric for Adaptive Network Routing

    Directory of Open Access Journals (Sweden)

    Ahmad Khader Haboush

    2012-04-01

    Full Text Available Network routing algorithms used today calculate least cost (shortest paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .

  20. Eccentricity in Zone Routing Protocol for MANET

    Directory of Open Access Journals (Sweden)

    Mrs Komal Nair

    2012-06-01

    Full Text Available A Mobile Ad-Hoc Network (MANET is a decentralized network of autonomous mobile nodes, able to communicate with each other over wireless links. Due to the mobility of the nodes, the topology ofthe network changes spontaneously, therefore use of conventional routing tables maintained at fixed points (routers is not suggested. Such a network may operate in a standalone fashion. There are variousrouting protocols available for MANETs. The most popular ones are DSR, DSDV and ZRP .The zone routing protocol (ZRP is a hybrid routing protocol that proactively maintains routes within a localregion of the network. ZRP can be configured for a particular network through adjustment of a single parameter, the routing zone radius. In this paper, we address the issue of configuring the ZRP to providethe best performance for a particular network at any time with the concept of eccentricity. The results illustrate the important characteristics of different protocols based on their performance and thus suggest some improvements in the respective protocol. The tools used for the simulation are NS2 which is the main simulator, NAM (Network Animator and Tracegraph which is used for preparing the graphs from the trace files.

  1. Low Carbon Footprint Routes for Bird Watching

    Directory of Open Access Journals (Sweden)

    Wei-Ta Fang

    2015-03-01

    Full Text Available Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic information systems to detect the shortest path, thereby solving the problems associated with time-consuming transport. Based on the results of road network analyses, optimal travel-route planning can be determined. These methods include simulated annealing (SA and genetic algorithms (GA. We applied two algorithms in our simulation research to detect which one is an appropriate algorithm for running carbon-routing algorithms at the regional scale. SA, which is superior to GA, is considered an excellent approach to search for the optimal path to reduce carbon dioxide and high gasoline fees, thereby controlling travel time by using the shortest travel routes.

  2. Alternative routes to olefins. Chances and challenges

    Energy Technology Data Exchange (ETDEWEB)

    Meiswinkel, A.; Delhomme, C.; Ponceau, M. [Linde AG, Pullach (Germany)

    2013-11-01

    In the future, conventional raw materials which are used for the production of olefins will get shorter and more expensive and alternative raw materials and production routes will gain importance. Natural gas, coal, shale oil or bio-mass are potential sources for the production of olefins, especially ethylene and propylene, as major base chemicals. Several potential production routes were already developed in the past, but cost, energy and environmental considerations might make these unattractive or unfeasible in comparison to traditional processes (e.g. steam cracking). Other processes such as methanol to olefins processes were successfully developed and first commercial units are running. In addition, combination of traditional processes (e.g. coal/biomass gasification, Fischer-Tropsch and steam cracking) might enable new pathways. Besides, dehydration of ethanol is opening direct routes from biomass to 'green' ethylene. However, for these 'bio-routes', feedstock availability and potential land use conflict with food production (sugar cane, wheat,..) still need to be evaluated. finally, new oxidative routes, including processes such as oxidative coupling of methane or oxidative dehydrogenation, are still at an early development stage but present potential for future industrial applications. (orig.) (Published in summary form only)

  3. Impact of adaptive intra cluster routing on energy efficiency

    International Nuclear Information System (INIS)

    Speed, size and cost are the basic driving forces that cause research thirst for researchers. These forces have given birth to Wireless Sensor Network (WSN) that is composed of small, cheap and power efficient sensor nodes. These sensor nodes are battery operated that causes need of energy efficient/aware routing for such type of networks. Traditionally there are two routing techniques used for routing Direct Routing and MultiHop Routing, but Energy Efficient Adaptive Cluster Routing (EEACR) technique is proposed in this research work that has increased the energy efficiency, network lifetime and packet delivery ratio when compared with MultiHop routing a traditional routing technique. EEACR is an improved version of Adaptive Intra Cluster Routing (AICR). Results show that EEACR is much better than MultiHop routing techniques. For simulation and verification of results TOSSIM simulator is used. (author)

  4. A Hybrid Routing Algorithm Based on Ant Colony and ZHLS Routing Protocol for MANET

    Science.gov (United States)

    Rafsanjani, Marjan Kuchaki; Asadinia, Sanaz; Pakzad, Farzaneh

    Mobile Ad hoc networks (MANETs) require dynamic routing schemes for adequate performance. This paper, presents a new routing algorithm for MANETs, which combines the idea of ant colony optimization with Zone-based Hierarchical Link State (ZHLS) protocol. Ant colony optimization (ACO) is a class of Swarm Intelligence (SI) algorithms. SI is the local interaction of many simple agents to achieve a global goal. SI is based on social insect for solving different types of problems. ACO algorithm uses mobile agents called ants to explore network. Ants help to find paths between two nodes in the network. Our algorithm is based on ants jump from one zone to the next zones which contains of the proactive routing within a zone and reactive routing between the zones. Our proposed algorithm improves the performance of the network such as delay, packet delivery ratio and overhead than traditional routing algorithms.

  5. ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests

    CERN Document Server

    Kataria, Jayesh; Sanyal, Sugata

    2010-01-01

    Reactive routing protocols like Ad Hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR)in Ad-Hoc Wireless Networks which are used in Mobile and Ad Hoc Networks (MANETs) work by flooding the network with control packets. There is generally a limit on the number of these packets that can be generated or forwarded. But a malicious node can disregard this limit and flood the network with fake control packets. These packets hog the limited bandwidth and processing power of genuine nodes in the network while being forwarded. Due to this, genuine route requests suffer and many routes either do not get a chance to materialize or they end up being longer than otherwise. In this paper we propose a non cryptographic solution to the above problem and prove its efficiency by means of simulation.

  6. A Review Paper on Route Maintenance in Stability Based Energy Aware Routing Protocol In MANET

    Directory of Open Access Journals (Sweden)

    Gaurav J. Bhatt*,

    2014-05-01

    Full Text Available Mobile Ad hoc Networks (MANETs are temporary formed, infrastructure-less networks. Due to the mobility in nature of mobile nodes, limited battery, congestion, as well as noise, the problem of link failure causes. The performance metrics degrades due to the unstable channel conditions, network connectivity, and mobility and resource limitations. The goal of this paper is to review papers that finds most reliable and energy aware route that is impervious to failures by topological changes by mobile node mobility or lack of energy and various route maintenance approaches in order to establish stable, long lasting route and reduce link failure and packet drops. Make before break mechanism used to achieve route maintenance that predicts link failure before it actually breaks and find alternate route towards destination to avoid unpredictable link failure. Performance increases by considering various parameters like signal strength, energy of node, congestion, noise instead of the minimum hop count approach of the default distance vector algorithm. Keywords -

  7. Routes visualization: Automated placement of multiple route symbols along a physical network infrastructure

    Directory of Open Access Journals (Sweden)

    Jules Teulade-Denantes

    2015-12-01

    Full Text Available This paper tackles the representation of routes carried by a physical network infrastructure on a map. In particular, the paper examines the case where each route is represented by a separate colored linear symbol offset from the physical network segments and from other routes—as on public transit maps with bus routes offset from roads. In this study, the objective is to automate the placement of such route symbols while maximizing their legibility, especially at junctions. The problem is modeled as a constraint optimization problem. Legibility criteria are identified and formalized as constraints to optimize, while focusing on the case of hiking routes in a physical network composed of roads and pedestrian paths. Two solving methods are tested, based on backtracking and simulated annealing meta-heuristics respectively. Encouraging results obtained on real data are presented and discussed.

  8. Research on secure routing algorithm in wireless sensor network

    Science.gov (United States)

    Zhang, Bo

    2013-03-01

    Through the research on the existing wireless sensor network (WSN) and its security technologies, this paper presents a design of the WSN-based secure routing algorithm. This design uses the existing routing algorithm as chief source, adding the security guidance strategy, introducing the location key information, to enhance the security performance of WSN routing. The improved routing algorithm makes the WSN routing achieve better anti-attack in the case of little overhead increase, therefore has high practical value.

  9. The commercial viability of the arctic shipping routes

    OpenAIRE

    Nilsen, Alexander

    2013-01-01

    It is commonly held that the Arctic Ocean and Arctic routes, presents an alternative to the traditional shipping routes through the Suez- and Panama- Channel, which is less time and cost consuming. This thesis strives to uncover weather or not this is the case by assessing the environmental developments, the distance and time characteristics of each defined route, as well as the individual costs associated with each route. The results from the alternative Arctic routes are then compared with ...

  10. The properties of route catchments in orbital - radial cities

    OpenAIRE

    Geoffrey Hyman; Les Mayhew

    2000-01-01

    In this paper we consider the analytical and geometric properties of route catchments in urban areas in which the transport network consists of a combination of radial routes converging on the city centre and one or more major orbital routes around the city. After defining the basic concepts, we examine in detail the analytical and geometric determination of quickest routes through the city centre versus orbital routing and how these vary with location, speed, and urban transport provision. T...

  11. Dynamics of hot-potato routing in IP networks

    OpenAIRE

    Teixeira, Renata; Shaikh, Aman; Griffin, Tim; Rexford, Jennifer

    2004-01-01

    Despite the architectural separation between intradomain and inter-domain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, a router selects the one with the closest egress point, based on the intrado-main path cost. Under such hot-potato routing, an intradomain event can trigger BGP routing changes. To characterize the influ-ence of hot-potato routing, we conduct...

  12. MAP: Medial axis based geometric routing in sensor networks

    OpenAIRE

    Bruck, Jehoshua; Gao, Jie; Jiang, Anxiao

    2007-01-01

    One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consideration includes scalability, routing complexity, quality of communication paths and the load sharing of the routes. In this paper, we show that a compact and expressive abstraction of network connectivity by the medial axis enables efficient and localized routing. We propose MAP, a Medial Axis based naming and routing...

  13. Carbon monoxide levels in popular passenger commuting modes traversing major commuting routes in Hong Kong

    International Nuclear Information System (INIS)

    Vehicle exhaust is a major source of air pollution in metropolitan cities. Commuters are exposed to high traffic-related pollutant concentrations. Public transportation is the most popular commuting mode in Hong Kong and there are about 10.8 million passenger trips every day. Two-thirds of them are road commuters. An extensive survey was conducted to measure carbon monoxide in three popular passenger commuting modes, bus, minibus, and taxi, which served, respectively, 3.91 million, 1.76 million and 1.31 million passenger trips per day in 1998. Three types of commuting microenvironments were selected: urban-urban, urban-suburban and urban-rural. Results indicated that in-vehicle CO level increased in the following order: bus, minibus and taxi. The overall average in-vehicle CO level in air-conditioned bus, minibus and taxi were 1.8, 2.9 and 3.3ppm, respectively. The average concentration level between air-conditioned buses (1.8ppm) and non-air-conditioned buses (1.9ppm) was insignificant. The fluctuation of in-vehicle CO level of non-air-conditioned vehicle followed the variation of out-vehicle CO concentration. Our result also showed that even in air-conditioned vehicles, the in-vehicle CO concentration was affected by the out-vehicle CO concentration although there exists a smoothing out effect. The in-vehicle CO level was the highest in urban-suburban commuting routes and was followed by urban-urban routes. The in-vehicle CO level in urban-rural routes was the lowest. The highest CO level was recorded after the vehicle traversed through tunnel.. The average CO exposure level of public road transportation commuters in Honk Kong was lower than most other cities. Factors governing the CO levels were also discussed. (Author)

  14. Evolution Strategies in the Multipoint Connections Routing

    Directory of Open Access Journals (Sweden)

    L. Krulikovska

    2010-09-01

    Full Text Available Routing of multipoint connections plays an important role in final cost and quality of a found connection. New algorithms with better results are still searched. In this paper, a possibility of using the evolution strategies (ES for routing is presented. Quality of found connection is evaluated from the view of final cost and time spent on a searching procedure. First, parametrical analysis of results of the ES are discussed and compared with the Prim’s algorithm, which was chosen as a representative of the deterministic routing algorithms. Second, ways for improving the ES are suggested and implemented. The obtained results are reviewed. The main improvements are specified and discussed in conclusion.

  15. Genetic algorithms for the vehicle routing problem

    Science.gov (United States)

    Volna, Eva

    2016-06-01

    The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.

  16. Predication-Based Intelligence Routing on Telecommunications

    Institute of Scientific and Technical Information of China (English)

    DONGJun; HEJifeng; PANYunhe

    2004-01-01

    The routingtelecommunication networksbeing one of key issues of management influences the switch rate and load balance directly, and becomes more and more important as the telecommunication traffic increases at full speed. It was said that raising one percent of switch rate of current Chinese telecommunication networks would result in revenue about one billion Yuan RMB. On the basis of demerit-analysis of routing scheme being used, a new intelligent routing strategy based on multi-agent systems and recurrent neural network predication is presented, including routing strategy, Calls generating and agent~ recurrent neural network computation, simulation software design, results and discussion. The results show that the new one is better by virtue of its upstanding distribution and intelligence characters, and provides excellent solution to increase network switch rate and balance network load. Meanwhile, its applications will go beyond the scope of telecommunication networks. But whether the strategy will be perfect depends on the cooperation among operator, manufacturer and researchers.

  17. Effective Privacy-Preserving Online Route Planning

    DEFF Research Database (Denmark)

    Ruiz Vicente, Carmen; Assent, Ira; Jensen, Christian Søndergaard

    An online Route Planning Service (RPS) computes a route from one location to another. Current RPSs such as Google Maps require the use of precise locations. However, some users may not want to disclose their source and destination locations due to privacy concerns. An approach that supplies fake...... locations to an existing service incurs a substantial loss of quality of service, and the service may well return a result that may be not helpful to the user. We propose a solution that is able to return accurate route planning results when source and destination regions are used in order to achieve...... privacy. The solution re-uses a standard online RPS rather than replicate this functionality, and it needs no trusted third party. The solution is able to compute the exact results without leaking of the exact locations to the RPS or un-trusted parties. In addition, we provide heuristics that reduce the...

  18. Towards Building an Intelligent Call Routing System

    Directory of Open Access Journals (Sweden)

    Thien Khai Tran

    2016-01-01

    Full Text Available This paper presents EduICR - an Intelligent Call Routing system. This system can route calls to the most appropriate agent using routing rules built by the text classifier. EduICR includes the following main components: telephone communication network; Vietnamese speech recognition; Text classifier/ Natural language processor and Vietnamese speech synthesis. To our best knowledge, this is one of the first systems in Vietnam to implement the integration mechanism of text processing and speech processing. This allows voice applications to be more intelligent, able to communicate with humans in natural language with high accuracy and reasonable speed. Having been built and tested in real environment, our system proves its accuracy attaining more than 95%.

  19. Generalized routing protocols for multihop relay networks

    KAUST Repository

    Khan, Fahd Ahmed

    2011-07-01

    Performance of multihop cooperative networks depends on the routing protocols employed. In this paper we propose the last-n-hop selection protocol, the dual path protocol, the forward-backward last-n-hop selection protocol and the forward-backward dual path protocol for the routing of data through multihop relay networks. The average symbol error probability performance of the schemes is analysed by simulations. It is shown that close to optimal performance can be achieved by using the last-n-hop selection protocol and its forward-backward variant. Furthermore we also compute the complexity of the protocols in terms of number of channel state information required and the number of comparisons required for routing the signal through the network. © 2011 IEEE.

  20. An Integrated Tool Suite for En Route Radar Controllers in NextGen

    Science.gov (United States)

    Mercer, Joey; Prevot, Thomas; Brasil, Connie; Mainini, Matthew; Kupfer, Michael; Smtih, Nancy

    2010-01-01

    This paper describes recent human-in-the-loop research in the Airspace Operations Laboratory at the NASA Ames Research Center focusing on en route air traffic management with advanced trajectory planning tools and increased levels of human-automation cooperation. The decision support tools were exercised in a simulation of seven contiguous high-altitude sectors. Preliminary data suggests the controllers were able to manage higher amounts of traffic as compared to today, while maintaining acceptable levels of workload.

  1. Ambient noise near the sea-route

    Institute of Scientific and Technical Information of China (English)

    HE Li; LI ZhengLin; PENG ZhaoHui

    2009-01-01

    Ambient noise data measured in an experiment conducted in shallow water near a sea-route were analyzed. It was observed that, at low frequency, the horizontal correlation has an obvious difference from that predicted by the classical ambient noise model. The theoretical analyses show that this phenomenon is caused by wind noise together with the discrete shipping noise nearby. An ambient noise model was proposed to include the effects caused by both the noise sources. Data measured at different times verify that the proposed model can be used to forecast the ambient noise field in shal-low water near the sea-route.

  2. Ambient noise near the sea-route

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    Ambient noise data measured in an experiment conducted in shallow water near a sea-route were analyzed. It was observed that, at low frequency, the horizontal correlation has an obvious difference from that predicted by the classical ambient noise model. The theoretical analyses show that this phenomenon is caused by wind noise together with the discrete shipping noise nearby. An ambient noise model was proposed to include the effects caused by both the noise sources. Data measured at different times verify that the proposed model can be used to forecast the ambient noise field in shallow water near the sea-route.

  3. An Improved Wireless Sensor Network Routing Algorithm

    Institute of Scientific and Technical Information of China (English)

    Shengmei Luo; Xue Li; Yiai Jin; Zhixin Sun

    2015-01-01

    High performance with low power consumption is an essential factor in wireless sensor networks (WSN). In order to address the issue on the lifetime and the consumption of nodes in WSNs, an improved ad hoc on⁃demand distance vector rout⁃ing (IAODV) algorithm is proposed based on AODV and LAR protocols. This algorithm is a modified on⁃demand routing al⁃gorithm that limits data forwarding in the searching domain, and then chooses the route on basis of hop count and power consumption. The simulation results show that the algorithm can effectively reduce power consumption as well as prolong the network lifetime.

  4. Software for Simulating Air Traffic

    Science.gov (United States)

    Sridhar, Banavar; Bilimoria, Karl; Grabbe, Shon; Chatterji, Gano; Sheth, Kapil; Mulfinger, Daniel

    2006-01-01

    Future Air Traffic Management Concepts Evaluation Tool (FACET) is a system of software for performing computational simulations for evaluating advanced concepts of advanced air-traffic management. FACET includes a program that generates a graphical user interface plus programs and databases that implement computational models of weather, airspace, airports, navigation aids, aircraft performance, and aircraft trajectories. Examples of concepts studied by use of FACET include aircraft self-separation for free flight; prediction of air-traffic-controller workload; decision support for direct routing; integration of spacecraft-launch operations into the U.S. national airspace system; and traffic- flow-management using rerouting, metering, and ground delays. Aircraft can be modeled as flying along either flight-plan routes or great-circle routes as they climb, cruise, and descend according to their individual performance models. The FACET software is modular and is written in the Java and C programming languages. The architecture of FACET strikes a balance between flexibility and fidelity; as a consequence, FACET can be used to model systemwide airspace operations over the contiguous U.S., involving as many as 10,000 aircraft, all on a single desktop or laptop computer running any of a variety of operating systems. Two notable applications of FACET include: (1) reroute conformance monitoring algorithms that have been implemented in one of the Federal Aviation Administration s nationally deployed, real-time, operational systems; and (2) the licensing and integration of FACET with the commercially available Flight Explorer, which is an Internet- based, real-time flight-tracking system.

  5. Influence of processing route and yttria additions on the oxidation behavior of tungsten

    OpenAIRE

    Muñoz Castellanos, Ángel; Monge Alcázar, Miguel Ángel; Cifuentes, S. C.; Pérez, P.

    2011-01-01

    The oxidation resistance in dry air of pure tungsten and tungsten reinforced with a dispersion of 0.6 wt.% Y₂O₃ nanoparticles has been evaluated between 873 and 1073 K, temperature range that divertor in fusion power plants should endure during long-term times in the case of loss of coolant accident and/or air ingress in the vessel. Both materials were prepared by a powder metallurgy route involving hot isostatic pressing of ball milled tungsten powders and tungsten with dispersed Y₂O₃ nanopa...

  6. Thin air

    OpenAIRE

    Jasanoff, Sheila

    2013-01-01

    Clearing the air How do we grasp the air? Without Michel Callon’s guidance, I might never have asked that question. Years ago, when I first entered environmental law practice, I took it for granted that problems such as air pollution exist “out there” in the real world for science to discover and law to fix. It is a measure of Callon’s influence that I understand the law today as a metaphysical instrument, no less powerful in its capacity to order nature than the tools of the ancient oracular...

  7. Taking an Alternative Route: A guide for fleet operators and individual owners using alternative fuels in cars and trucks

    International Nuclear Information System (INIS)

    Taking an Alternative Route is a 30-page guide for fleet managers and individual owners on using alternative fuels in cars and trucks. Discussed in detail are all fuels authorized for federal credits under the Energy Policy Act of 1992 (EPAct). The publication informs federal and state fleet managers about how to comply with EPAct, and provides information about the Clean Air Act Amendments

  8. Air Pollution

    Science.gov (United States)

    ... to a close in June 2013 when the company, Conscious Clothing, was awarded the My Air grand ... Page Options: Request Translation Services Facebook Twitter LinkedIn Google+ Reddit Email Evernote More Increase Font Size Decrease ...

  9. Mobile IPv6 Route Optimization Protocol

    Directory of Open Access Journals (Sweden)

    Aumdevi K. Barbudhe

    2013-07-01

    Full Text Available Mobile IPv6 (MIPv6 allows a Mobile Node to talk directly to its peers while retaining the ability to move around and change the currently used IP address. This mode of operation is called Route Optimization (RO, as it allows the packets to traverse a shorter route than the default one through the Home Agent. In Route Optimization, the peer node learns a binding between the Mobile Node’s permanent Home Address and its current temporary Care-ofAddress. Once such a binding is in place, the peer node will send all packets whose destination is the Home Address to the Care-ofAddress. This is potentially dangerous, since a malicious host might be able to establish false bindings, thereby preventing some packets from reaching their intended destination, diverting some traffic to the attacker, or flooding third parties with unwanted traffic. In this paper we discuss the design rationale behind the MIPv6 Route Optimization Security Design

  10. Traffic disruption route Einstein near building 170

    CERN Multimedia

    A Lopez - TS/CE

    2005-01-01

    The TS/CE Group informs you that, for the duration of the work at Building 170, there may be some disruption to traffic on route Einstein in the vicinity of Building 170. The work is due to take place from the 14th to 18th February. For more information, please contact 165029. A. Lopez TS/CE

  11. Wales energy route map consultation : SDC response

    OpenAIRE

    Sustainable Development Commission Wales

    2005-01-01

    Sustainable Development Commission submission to the Welsh Assembly Government’s consultation on 'Energy Wales : route map to a clean, low-carbon and more competitive energy future for Wales'. Topics covered include Raising awareness, energy efficiency, renewable energy, coal/carbon capture storage, energy infrastructure and reducing carbon dioxide emissions. Publisher PDF

  12. Mingling Multipath Routing With Quality Of Service

    Directory of Open Access Journals (Sweden)

    Dr. Shuchita Upadhyaya

    2011-09-01

    Full Text Available The QoS issue in the Internet have become essential for the successful transmission of multimedia applications . The basic problem of QoS routing is to find a path satisfying multiple constraints. It is concerned with identifying the path that will consider multiple parameters like bandwidth, delay, cost, hopcount etc. instead of one .To provide user- or application-level Quality of Service (QoS guarantee Multipath routing strategy can be used for the transmission of QoS sensitive traffic over the network. Multipath routing means using multiple paths instead of using single path to forward the traffic.If multiple paths are being used for the transmission of the traffic then the traffic will be redirected to the back up path if active path fails. In this way robustness can be achieved. On the other hand load balancing for communication network to avoid network congestion optimize network throughput also requires multi paths to distribute flows . Robustness load balancing are aspects of QoS routing . So multipath can be proved very valuable for Quality of service. This paper investigates the approaches of mingling Multipath Quality of service. The approaches considered are based on Dijkstra algorithm, Bellman ford algorithm, Resource reservation MPLS.

  13. Network Routing Optimization Using Swarm Intelligence

    OpenAIRE

    Galil, Mohamed A. El

    2012-01-01

    The aim of this paper is to highlight and explore a traditional problem, which is the minimum spanning tree, and finding the shortest-path in network routing, by using Swarm Intelligence. This work to be considered as an investigation topic with combination between operations research, discrete mathematics, and evolutionary computing aiming to solve one of networking problems.

  14. Routing Algorithms for Wireless Sensor Networks

    OpenAIRE

    Raicu, Ioan

    2004-01-01

    Our contribution in this paper is e3D, a diffusion based routing protocol that prolongs the system lifetime, evenly distributes the power dissipation throughout the network, and incurs minimal overhead for synchronizing communication. We compare e3D with other algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm.

  15. ROUTE PLAN DESIGNER FOR TRACTOR GUIDANCE SYSTEMS

    DEFF Research Database (Denmark)

    Sveistrup, Daniel; Jørgensen, Rasmus Nyholm; Green, Ole;

    2010-01-01

    Earlier works have shown field trial designs to be very labor extensive, even when combining autoguidancesystems with conventional machinery.Designing routes for semi-automated systems in a controlled manner is both resource demandingand complicated. Different types of auto-guidance systems vary ...

  16. Real Time Route for Dynamic Road Congestions

    Directory of Open Access Journals (Sweden)

    A. M. Riad

    2012-05-01

    Full Text Available Minimizing service delivery and travel time during rush hours downtown is strategic target for several organizations, especially the emergency organizations. This paper presents an On-line and Real-time Dynamic Route System (ORDRS which benefits from the advantages and integration between information system and communications technology. It utilizes Global Positioning System (GPS, Geographical Information Systems (GIS, and Global System for Mobile communications (GSM; for producing the real time routes for vehicles. GPS-Tracker is the main input device for ORDRS. It is fixated in a vehicle, sends vehicle's movement data (Geo-info to the control center wirelessly through either Short Message Service (SMS or General Packet Radio Service (GPRS. Geo-info includes time, date, longitude, latitude, speed, and etc., these data is classified over time during weekdays into interval time slices, each slice is 30 minutes. Speeds are treated by GIS tools to determine historical and real time speeds for each street segment in the road network which is being used for calculating time impedance (cost matrix for each street segment dynamically. ORDRS uses a cost matrix of the current time slice for determining the best route to each vehicle in duty attached. Several algorithms was used to calculate the shortest route, a comparison between Dijekstra and Yen algorithms was studied.

  17. Locating Depots for Capacitated Vehicle Routing

    CERN Document Server

    Goertz, Inge Li

    2011-01-01

    We study a location-routing problem in the context of capacitated vehicle routing. The input is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for this problem. To achieve this result, we reduce to the k-median-forest problem, which generalizes both k-median and minimum spanning tree, and which might be of independent interest. We give a (3+c)-approximation algorithm for k-median-forest, which leads to a (12+c)-approximation algorithm for the above location-routing problem, for any constant c>0. The algorithm for k-median-forest is just t-swap local search, and we prove that it has locality gap 3+2/t; this generalizes the corresponding result known for k-median. Finally we consider the "non-uniform" k-median-forest problem which has different cost ...

  18. Low Mobility Based Geographic Routing Strategy

    Directory of Open Access Journals (Sweden)

    Prashanth Kolandaiswami Arjunan

    2014-02-01

    Full Text Available In geographic routing, nodes need to maintain up-to-date positions of their immediate neighbours for making effective forwarding decisions. Periodic broadcasting of beacon packets regardless of the node mobility and traffic patterns are proved to increase the update cost and decreases the routing performance. If only a small percentage of the nodes are involved in forwarding packets, it is unnecessary for nodes which are located far away from the forwarding path to employ periodic beaconing because these updates are not useful for forwarding the current traffic. Hence Adaptive Position Update (APU Scheme was introduced, (i nodes whose movements are harder to predict update their positions more frequently (and vice versa, and (ii nodes closer to forwarding paths update their positions more frequently (and vice versa. Further we contend that if forwarding nodes have high mobility there is an increased risk of frequent link failures. Thereby we propose a low mobility based forwarding node selection strategy to improve the routing performance and energy efficiency of the nodes in the system. Extensive simulations demonstrated that our routing strategy has two interesting features: 1 Less number of link failures with improved packet delivery ratio. 2 Less energy consumption when compared to APU alone and periodic broadcasting schemes.

  19. 基于航线网络结构的上海浦东机场亚太枢纽竞争力分析%Analysis of Competitiveness of Shanghai PudongAirport as anAsia-Pacific Hub Based on Air Route Structure

    Institute of Scientific and Technical Information of China (English)

    陈蓓蓓; 曾小舟; 董莉莉

    2013-01-01

      从亚太主要枢纽机场的现状及国际背景出发,以航线网络结构为基础,从枢纽机场与亚太地区其他机场的连接紧密程度,枢纽机场拥有基地航空公司的规模,枢纽机场腹地客源及其在亚太航线网络中的位置四方面建立测评指标,对浦东机场、仁川机场等五个竞争机场进行竞争力分析,得出浦东机场的竞争优劣势,并据此提出发展建议。%Starting from development and international background of hub airports of Asia-Pacific and based on route network structure, this article establishes indicators in four aspects as follows: connections of hub airports and other airports of Asia-Pacific area, sizes of base airlines of hub airports, hinterland passengers of hub airports, position of hub airports in Asia-Pacific area. The paper analyses the competitiveness of Pudong Airport, Incheon Airport and other three airports, and draws a conclusion of advantages and disadvantages of Pudong Airport. Last, the authors propose recommendations accordingly for the development of Pudong Airport.

  20. An Analysis of Routing Disruption Attack on Dynamic Source Routing Protocol

    CERN Document Server

    Sen, Jaydip

    2011-01-01

    Dynamic Source Routing (DSR) is a well known source routing protocol for ad hoc networks. The algorithm depends on the cooperative participation of the nodes that enables route discovery from a source node to a destination node. However, if a group of nodes do not cooperate, the performance of the DSR protocol may be severely degraded. This paper presents a probabilistic attack model on the DSR protocol and analyses its effect on the routing performance. Simulations results of the model show that the effect of the attack is catastrophic only if a large number of nodes are compromised and there is no detection mechanism. As an interesting observation, the analysis also shows that the attack model can also be used to improve the performance of the DSR protocol.

  1. PNW River Reach Files -- 1:100k LLID Routed Streams (routes)

    Data.gov (United States)

    Pacific States Marine Fisheries Commission — This feature class includes the ROUTE features from the 2001 version of the PNW River Reach files Arc/INFO coverage. Separate, companion feature classes are also...

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

  3. Air surveillance

    Energy Technology Data Exchange (ETDEWEB)

    Patton, G.W.

    1995-06-01

    This section of the 1994 Hanford Site Environmental Report summarizes the air surveillance and monitoring programs currently in operation at that Hanford Site. Atmospheric releases of pollutants from Hanford to the surrounding region are a potential source of human exposure. For that reason, both radioactive and nonradioactive materials in air are monitored at a number of locations. The influence of Hanford emissions on local radionuclide concentrations was evaluated by comparing concentrations measured at distant locations within the region to concentrations measured at the Site perimeter. This section discusses sample collection, analytical methods, and the results of the Hanford air surveillance program. A complete listing of all analytical results summarized in this section is reported separately by Bisping (1995).

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

  5. Chain-Chain Based Routing Protocol

    Directory of Open Access Journals (Sweden)

    Samia A Ali

    2011-05-01

    Full Text Available Wireless sensor network (WSN is an emerging technology for monitoring physical world. WSNs consist of large numbers of sensor nodes operated by battery mostly in harsh environment. Thus energy conservation is a primary issue for organization of these sensor nodes. Another crucial issue is the data delivery time by sensor nodes to the sink node, especially in Military, medical fields, and security monitoring systems where minimum delay is desirable. Number of protocols has been proposed in the literature for routing. One of such protocols is the cluster based routing protocol LEACH (low energy adaptive clustering hierarchy. LEACH protocol organizes WSN into a set of clusters and a periodic voting for cluster head is performed in order to be evenly distributed among all the sensors of the WSN. This periodical cluster head voting in LEACH, however, consumes an amount of non-negligible energy and other resources. For energy conservation, PEGASIS (power efficient gathering in sensor information systems a near optimal chain-based protocol has been proposed, however, it is faced with the challenge of long delay for the transmitted data. Another routing protocol called CCM (Chain-Cluster based Mixed routing, which is mainly a hybrid of LEACH and PEGASIS is proposed, the consumed energy increases as network size increases. In this paper, we propose an efficient routing protocol called CCBRP (Chain-Chain based routing protocol, it achieves both minimum energy consumption and minimum delay. The CCBRP protocol mainly divides a WSN into a number of chains (Greedy algorithm is used to form each chain as in PEGSIS protocol and runs in two phases. In the first phase, sensor nodes in each chain transmit data to their chain leader nodes in parallel. In the second phase, all chain leader nodes form a chain (also, using Greedy algorithm and choose randomly a leader node then all chain leader nodes send their data to this chosen leader node. This chosen leader node

  6. Adaptive routing in wireless communication networks using swarm intelligence

    Science.gov (United States)

    Arabshahi, P.; Gray, A.; Kassabalidis, I.; Das, A.; Narayanan, S.; Sharkawi, M. El; Marks, R. J.

    2001-01-01

    In this paper we focus on the network routing problem, and survey swarm intelligent approaches for its efficient solution, after a brief overview of power-aware routing schemes, which are important in the network examples outlined above.

  7. On effectiveness of routing algorithms for satellite communication networks

    Science.gov (United States)

    Yu, Wei; Wei, Sixiao; Xu, Guobin; Chen, Genshe; Pham, Khanh; Blasch, Erik P.; Lu, Chao

    2013-05-01

    For worldwide, a satellite communication network is an integral component of the global networking infrastructure. In this paper, we focus on developing effective routing techniques that consider both user preferences and network dynamic conditions. In particular, we develop a weighted-based route selection scheme for the core satellite communication network. Unlike the shortest path routing scheme, our scheme chooses the route from multiple matched entries based on the assigned weights that reflect the dynamic condition of networks. We also discuss how to derive the optimal weights for route assignment. To further meet user's preference, we implement the multiple path routing scheme to achieve the high rate of data transmission and the preemption based routing scheme to guarantee the data transmission for high priority users. Through extensive simulation studies, our data validates the effectiveness of our proposed routing schemes.

  8. Stateless and Delivery Guaranteed Geometric Routing on Virtual Coordinate System

    CERN Document Server

    Liu, Ke

    2008-01-01

    Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. However, the performance of geographic routing is impacted by physical voids, and localization errors. Accordingly, virtual coordinate systems (VCS) were proposed as an alternative approach that is resilient to localization errors and that naturally routes around physical voids. However, VCS also faces virtual anomalies, causing their performance to trail geographic routing. In existing VCS routing protocols, there is a lack of an effective stateless and delivery guaranteed complementary routing algorithm that can be used to traverse voids. Most proposed solutions use variants of flooding or blind searching when a void is encountered. In this paper, we propose a spanning-path virtual coordinate system which can be used as a complete routing algorithm or as the complementary algorithm to greedy forwarding that is invoked when voids are encountere...

  9. Fund allocation using capacitated vehicle routing problem

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Darus, Maslina

    2014-09-01

    In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.

  10. Application of Harmony Search to Vehicle Routing

    Directory of Open Access Journals (Sweden)

    Zong W.  Geem

    2005-01-01

    Full Text Available A phenomenon-inspired meta-heuristic algorithm, harmony search, imitating music improvisation process, is introduced and applied to vehicle routing problem, then compared with one of the popular evolutionary algorithms, genetic algorithm. The harmony search algorithm conceptualized a group of musicians together trying to search for better state of harmony. This algorithm was applied to a test traffic network composed of one bus depot, one school and ten bus stops with demand by commuting students. This school bus routing example is a multi-objective problem to minimize both the number of operating buses and the total travel time of all buses while satisfying bus capacity and time window constraints. Harmony search could find good solution within the reasonable amount of time and computation.

  11. Multicast Routing Protocols in Adhoc Mobile networks

    Directory of Open Access Journals (Sweden)

    S.Nagaprasad,

    2010-11-01

    Full Text Available The majority of applications are in areas where rapid deployment and dynamic reconfiguration are necessary and a wire line network is not available. These include military battlefields, emergency search and rescue sites, classrooms, and conventions where participants share information dynamically using their mobile devices. Well established routing protocols do exist to offer efficient multicasting service in conventional wired networks. These protocols, having been designed for fixed networks, may fails to keep up with node movements and frequent topology changes in a MANET. Therefore, adapting existing wired multicast protocols as such to a MANET, which completely lacks infrastructure, appear less promising. Providing efficient multicasting over MANET faces many challenges, includes scalability,quality of service, reliable service, security, Address configuration, Applications for multicast over MANET. The existing multicast routing protocol do not addresses these issues effectively over Mobile Adhoc Networks (MANET.

  12. Adaptive Routing Algorithm for MANET:TERMITE

    Directory of Open Access Journals (Sweden)

    Sharvani G S

    2009-12-01

    Full Text Available Mobile Ad hoc network consists of a set of mobile nodes. This network does not have anyinfrastructure or central administration, hence it is called infrastructure less network. As the nodes aremobile, it is very difficult to find the path between two end points. This paper presents a solution forfinding path between nodes in mobile ad hoc network. Termite is an innovative algorithm for packetrouting in communication networks. Termite is an adaptive, distributed, mobile-agents-based algorithmwhich was inspired by recent work on the ant colony metaphor. According to this algorithm, a group ofmobile agents (or artificial termites build paths between pair of nodes; exploring the networkconcurrently and exchanging obtained information to update the routing tables. Some of the parametersused to evaluate its performance are packet delays and throughput. The results of this algorithm showsbetter throughput as compared to existing algorithms. So, Termite algorithm is a promising alternativefor routing of data in commercial networks.

  13. Multicast Routing Based on Hybrid Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    CAO Yuan-da; CAI Gui

    2005-01-01

    A new multicast routing algorithm based on the hybrid genetic algorithm (HGA) is proposed. The coding pattern based on the number of routing paths is used. A fitness function that is computed easily and makes algorithm quickly convergent is proposed. A new approach that defines the HGA's parameters is provided. The simulation shows that the approach can increase largely the convergent ratio, and the fitting values of the parameters of this algorithm are different from that of the original algorithms. The optimal mutation probability of HGA equals 0.50 in HGA in the experiment, but that equals 0.07 in SGA. It has been concluded that the population size has a significant influence on the HGA's convergent ratio when it's mutation probability is bigger. The algorithm with a small population size has a high average convergent rate. The population size has little influence on HGA with the lower mutation probability.

  14. Routing in Cognitive Radio Networks - A Survey

    Directory of Open Access Journals (Sweden)

    Harpreet Kaur

    2015-12-01

    Full Text Available Cognitive Radio Networks (CRNs have been emerged as a revolutionary solution to migrate the spectrum scarcity problem in wireless networks. Due to increasing demand for additional spectrum resources, CRNs have been receiving significant research to solve issues related with spectrum underutilization. This technology brings efficient spectrum usage and effective interference avoidance, and also brings new challenges to routing in multi-hop Cognitive Radio Networks. In CRN, unlicensed users or secondary users are able to use underutilized licensed channels, but they have to leave the channel if any interference is caused to the primary or licensed users. So CR technology allows sharing of licensed spectrum band in opportunistic and non-interfering manner. Different routing protocols have been proposed recently based on different design goals under different assumptions.

  15. NIST cooperative laboratory for OSI routing technology

    Energy Technology Data Exchange (ETDEWEB)

    Montgomery, D.

    1994-05-23

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

  16. Efficient routing on multilayered communication networks

    CERN Document Server

    Zhou, Jie; Lai, Choy-Heng; 10.1209/0295-5075/102/28002

    2013-01-01

    We study the optimal routing on multilayered communication networks, which are composed of two layers of subnetworks. One is a wireless network, and the other is a wired network. We develop a simple recurrent algorithm to find an optimal routing on this kind of multilayered network, where the single-channel transmission mode and the multichannel transmission mode used on the wireless subnetwork are considered, respectively. Compared with the performance of the shortest path algorithm, our algorithm can significantly enhance the transport capacity. We show that our methods proposed in this letter could take advantage of the coupling of the two layers to the most extent, so that the wireless subnetwork could sufficiently utilize the wired subnetwork for transportation.

  17. Eco-sustainable routing in optical networks

    DEFF Research Database (Denmark)

    Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco;

    2013-01-01

    novel eco-sustainable Routing and Wavelength Assignment (RWA) algorithm, based on shortest-path routing with an adaptive link weighting function relying on an extension of the OSPF-TE protocol to convey carbon footprint information, has been proposed to decrease the network ecological impact while......It is quite easy to foresee that in the next years, the future generation ultra-high speed network infrastructures and equipments will be no longer constrained only by their pure transport capacity, but also by their energy consumption costs and environmental eects. In particular, large network...... infrastructures are now widely recognized to play a fundamental role in the emission of green-house gases (GHG) in the at- mosphere, signicantly aecting the environmental sustainability of new evolutions in network architectures as well as technological developments in communication devices. In this paper, a...

  18. Routing of individual polymers in designed patterns

    DEFF Research Database (Denmark)

    Knudsen, Jakob Bach; Liu, Lei; Kodal, Anne Louise Bank;

    2015-01-01

    Synthetic polymers are ubiquitous in the modern world, but our ability to exert control over the molecular conformation of individual polymers is very limited. In particular, although the programmable self-assembly of oligonucleotides and proteins into artificial nanostructures has been...... demonstrated, we currently lack the tools to handle other types of synthetic polymers individually and thus the ability to utilize and study their single-molecule properties. Here we show that synthetic polymer wires containing short oligonucleotides that extend from each repeat can be made to assemble...... into arbitrary routings. The wires, which can be more than 200 nm in length, are soft and bendable, and the DNA strands allow individual polymers to self-assemble into predesigned routings on both two- and three-dimensional DNA origami templates. The polymers are conjugated and potentially conducting, and could...

  19. Optimizing the Routing of Communication Networks

    International Nuclear Information System (INIS)

    Nowadays, communication networks are represented one of the main important application areas all over the world. Wireless Networks are consisting of nodes having limited radio range and bandwidth without having any fixed infrastructure. However, to successfully deliver the message from source to destination, the network must use the optimum route. On the other hand, recently, genetic algorithms (GAs) have proved their effectiveness as learning and optimization technique to optimize the route performance. Thus, the proposed system introduces the use of the genetic algorithms to optimize the derived router that not only considered as the shortest path but also ensure its minimum delay and reliability. The proposed system has proved its success and performance for the practical applications when applied for a communication network

  20. Green-Aware Routing in GMPLS Networks

    DEFF Research Database (Denmark)

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

    2012-01-01

    The increasing amount of traffic in the Internet has been accommodated by the exponential growth of bandwidth provided by the optical networks technologies. However, such a growth has been also accompanied by an increase in the energy consumption and the concomitant green house gases (GHG......) emissions. Despite the efforts for improving energy efficiency in silicon technologies and network designs, the large energy consumption still poses challenges for the future development of Internet. In this paper, we propose an extension of the Open Shortest Path First - Traffic Engineering (OSPF......-TE) protocol and a greenaware routing and wavelength assignment (RWA) algorithm for minimizing the GHG emissions by routing connection requests through green network elements (NE). The network behavior and the performance of the algorithm are analyzed through simulations under different scenarios, and results...

  1. Educational routes in tourism of Novohradské hory mountains

    OpenAIRE

    CVACHOVÁ, Klára

    2011-01-01

    The chief aim of this bachelor work is to asses current situation to usage of educational routes in tourism of Novohradské hory mountains. The first aim is to construct dokumentation of educational routes in choice area. On educational routes was executed the personal research.The second aim is to asses the relation of current visitors to educational routes in certain area. We came by nformation about relation of visitors through the questionaire.The last aim introduces identification of them...

  2. Traffic modifications on Routes Rutherford, Democrite and Fermi

    CERN Multimedia

    2015-01-01

    The GS Department would like to inform you that until the end of December, the construction of Building 245 will result in the following traffic modifications: Traffic on Route Rutherford will be partially restricted in front of the construction site, Traffic on Route Democrite will be one-way towards Route Rutherford. Also, please note that due to construction work in front of Building 377, Route Fermi will be closed from Wednesday, 10 June until Friday, 7 August. Thank you for your understanding.

  3. Energy efficient cluster-based routing in wireless sensor networks

    OpenAIRE

    Zeghilet, Houda; Badache, Nadjib; Maimour, Moufida

    2009-01-01

    Because of the lack of a global naming scheme, routing protocols in sensor networks usually use flooding to select paths and deliver data. This process although simple and effective, is very costly in terms of energy consumption, an important design issue in sensor networks routing protocols. Cluster-based routing is one solution to save energy. In this paper, we propose a combination of an improved clustering algorithm and directed diffusion, a well-known data-centric routing paradigm in sen...

  4. Multipath Routing with Erasure Coding for Wireless Sensor Networks

    OpenAIRE

    Wu, Jian; Dulman, Stefan; Havinga, Paul; Nieberg, Tim

    2004-01-01

    Multipath routing algorithm in wireless sensor networks (WSN) increase the reliability of the system at the cost of significantly increased traffic. This paper introduces a splitted multipath routing scheme to improve the reliability of data routing in WSN by keeping the traffic at a low level. Our proposed on-demand multipah routing algorithm offers the data source several paths to any destination. It is used in combination with a data splitting method based on Erasure Coding. The algorithms...

  5. An Efficient Bypassing Void Routing Algorithm for Wireless Sensor Network

    OpenAIRE

    2015-01-01

    Since the sensor node’s distribution in a wireless sensor network (WSN) is irregular, geographic routing protocols using the greedy algorithm can cause local minima problem. This problem may fail due to routing voids and lead to failure of data transmission. Based on the virtual coordinate mapping, this paper proposes an efficient bypassing void routing protocol to solve the control packet overhead and transmission delay in routing void of WSN, which is called EBVRPVCM. The basic idea is to t...

  6. Reactive and proactive routing in labelled optical burst switching networks

    OpenAIRE

    Klinkowski, Miroslaw; Careglio, Davide; Solé Pareta, Josep

    2009-01-01

    Optical burst switching architectures without buffering capabilities are sensitive to burst congestion. The existence of a few highly congested links may seriously aggravate the network throughput. Proper network routing may help in congestion reduction. The authors focus on adaptive routing strategies to be applied in labelled OBS networks, that is, with explicit routing paths. In particular, two isolated alternative routing algorithms that aim at network performance improvement because o...

  7. DNA display I. Sequence-encoded routing of DNA populations.

    OpenAIRE

    Halpin, David R; Pehr B Harbury

    2004-01-01

    Recently reported technologies for DNA-directed organic synthesis and for DNA computing rely on routing DNA populations through complex networks. The reduction of these ideas to practice has been limited by a lack of practical experimental tools. Here we describe a modular design for DNA routing genes, and routing machinery made from oligonucleotides and commercially available chromatography resins. The routing machinery partitions nanomole quantities of DNA into physically distinct subpools ...

  8. Mobility Tolerant Firework Routing for Improving Reachability in MANETs

    OpenAIRE

    Gen Motoyoshi; Kenji Leibnitz; Masayuki Murata

    2014-01-01

    In this paper, we investigate our mobility-assisted and adaptive broadcast routing mechanism, called Mobility Tolerant Firework Routing (MTFR), which utilizes the concept of potentials for routing and improves node reachability, especially in situations with high mobility, by including a broadcast mechanism. We perform detailed evaluations by simulations in a mobile environment and demonstrate the advantages of MTFR over conventional potential-based routing. In particular, we show that MTFR p...

  9. Availability analysis of resilient geometric routing on Internet topology

    OpenAIRE

    Sahhaf, Seyedeh Sahel; Tavernier, Wouter; Colle, Didier; Pickavet, Mario; Demeester, Piet

    2014-01-01

    Scalable routing schemes for large-scale networks, especially future Internet, are required. Geometric routing scheme is a promising candidate to solve the scalability issue of routing tables in conventional IP routing based on longest prefix matching. In this scheme, network nodes are assigned virtual coordinates and packets are forwarded towards their intended destination following a distance-decreasing policy. Dynamics in the network such as node/link failures might affect this forwarding ...

  10. The Efficiency of Constraint Based Routing in MPLS Networks

    Directory of Open Access Journals (Sweden)

    Martin Medvecky

    2011-01-01

    Full Text Available The paper presents the simulation results and evaluates the efficiency of constraint base routing algorithms used in MPLS network from the point of their usability in Next Generation Networks. The efficiency of constraint based routing is evaluated according following criteria: optimal path selection, routing priority of traffic flows selected for constraint routing and bandwidth allocation by MAM or RDM bandwidth constraints models.

  11. An Approach In Optimization Of Ad-Hoc Routing Algorithms

    Directory of Open Access Journals (Sweden)

    Sarvesh Kumar Sharma

    2012-06-01

    Full Text Available In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.

  12. Speed-Consumption Tradeoff for Electric Vehicle Route Planning

    OpenAIRE

    Baum, Moritz; Dibbelt, Julian; Hübschle-Schneider, Lorenz; Pajor, Thomas; Wagner, Dorothea

    2014-01-01

    We study the problem of computing routes for electric vehicles (EVs) in road networks. Since their battery capacity is limited, and consumed energy per distance increases with velocity, driving the fastest route is often not desirable and may even be infeasible. On the other hand, the energy-optimal route may be too conservative in that it contains unnecessary detours or simply takes too long. In this work, we propose to use multicriteria optimization to obtain Pareto sets of routes that trad...

  13. Performance Comparison of Routing Protocols for Remote Login in MANETs

    OpenAIRE

    VIKAS GOYAL; SHAVETA RANI; PARAMJIT SINGH

    2013-01-01

    Wireless networks are those networks, in which devices are connected without using cables. Thebest example, which comes across in our daily life is mobile phones. MANET has mobile nodes in network,which transfer data packets from source node to destination node; this is possible by routing protocols. Inthis paper, the routing protocols used are - Ad hoc On-Demand Distance Vector (AODV) Protocol,Geographical Routing Protocol (GRP) and Optimized Link State Routing (OLSR) Protocol. The performan...

  14. Trustworthy Robust Routing Protocol for Mobile Ad Hoc Network

    OpenAIRE

    E.Venkat Reddy

    2010-01-01

    A protocol called RMP (Route Management Protocol) is proposed; for making misbehavior effect eliminated on Adhoc network is proposed. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing andforwarding behavior of other nodes. The implementation of this rotocol is made on the network layer based on the Dynamic Source Routing (DSR) protocol. We pre...

  15. Secure Routing and Identifying Hacking In P2p System

    OpenAIRE

    Gowsiga Subramaniam; Senthilkumar Ponnusamy

    2014-01-01

    Packet forwarding is the procedure to route the packet from source to destination via routers. Getting the systems ip address in a LAN and decides the source, destination and the intermediate systems for our routing process. Using any database form the routing table with columns like source address, destination address and router addresses. After creating the routing table enters the ip address in the respective columns. As per this procedure by comparing ip addresses in the r...

  16. Auction-based schemes for multipath routing in selfish networks

    OpenAIRE

    Zhou, H; Leung, KC; Li, VOK

    2013-01-01

    We study multipath routing with traffic assignment in selfish networks. Based on the Vickrey-Clarke-Groves (VCG) auction, an optimal and strategy-proof scheme, known as optimal auction-based multipath routing (OAMR), is developed. However, OAMR is computationally expensive and cannot run in real time when the network size is large. Therefore, we propose sequential auction-based multipath routing (SAMR). SAMR handles routing requests sequentially using some greedy strategies. In particular, wi...

  17. An Application of Intuitionistic Fuzzy in Routing Networks

    Directory of Open Access Journals (Sweden)

    Ashit Kumar Dutta

    2012-06-01

    Full Text Available Routing is an important functional aspect of networks to transport packets from source to destination. A router sets up optimized paths among the different nodes in the network. In this paper the authors proposed a new type of routing algorithm which includes exchange of routing information for small amount of time and then halts for few hours but this information is used by each router to make its own routing decisions based on intuitionistic fuzzy logic during these hours.

  18. Thermochemical conversion routes of lignocellulosic biomass

    OpenAIRE

    Gerbinet, Saïcha; Léonard, Angélique

    2012-01-01

    The thermo-chemical route, especially the gasification process is considered. This process converts carbonaceous biomass into combustible gas (CO, H2, CO2, CH4 and impurities) called syngas and this syngas can be converted into a large range of products. Production of four of these compounds is specifically investigated: ethylene, propylene, diesel and DME. Diesel can be produced via a Fischer-Tropsch process, whereas DME (dimethyl ether) can be obtained directly or from methanol which is ob...

  19. Traffic Engineering With Traditional IP Routing Protocols

    OpenAIRE

    Fortz, Bernard; Rexford, Jennifer; Thorup, Mikkel

    2002-01-01

    Traffic engineering involves adapting the routing of traffic to the network conditions, with the joint goals of good user performance and efficient use of network resources. In this paper, we describe an approach to intradomain traffic engineering that works within the existing deployed base of Interior Gateway Protocols (IGPs), such as Open Shortest Path First (OSPF) and Intermediate System-Intermediate System (IS-IS). We explain how to adapt the configuration of link weights, based on a ...

  20. Advanced routing protocols for wireless networks

    CERN Document Server

    Campista , Miguel Elias Mitre

    2014-01-01

    This text introduces the principles of routing protocols and metrics as they affect wireless networking environments, specifically in urban areas. Timely because of the recent rise in small city life, this topic includes the consideration of ad hoc, mesh, vehicular, sensor, and delay tolerant networks. These approaches are each unique, and author Miguel Mitre Campista provides a thorough, but accessible, explanation of their individual characteristics for engineers, computer scientists, IT professionals, and curious Internet users.

  1. Route optimization model for strike aircraft

    OpenAIRE

    Lee, Steve H. K.

    1995-01-01

    A model is designed and implemented to construct a 'flyable,' least- risk route for strike aircraft from takeoff to target, through enemy radars, in a defined area of operations. A network is fust constructed by discretizing the airspace into a three-dimensional grid of nodes and then connecting adjacent nodes with arcs. A shortest-path model in this network is then constructed with arc lengths that are a function of the probability of detection by radars monitoring t...

  2. Routing on Overlay Networks : Developments and Challenges

    OpenAIRE

    Popescu, Adrian

    2005-01-01

    Overlay networks are networks operating on the inter-domain level, where the edge hosts learn of each other and, based on knowledge of underlying network performance, they form loosely coupled neighboring relationships. These relationships can be used to induce a specific graph, where nodes are representing hosts and edges are representing neighboring relationships. Graph abstraction and the associated graph theory can be further used to formulate routing algorithms on overlay networks. The m...

  3. Vehicle routing problem for save fuel consumption

    Institute of Scientific and Technical Information of China (English)

    LIU Hao; AI Wen-wen

    2016-01-01

    This study has extended a vehicle routing problem,by considering economy of fuel,and constructing a LF-VRP model,to obtain optimal fixed costs.Our objective was to minimize not only distance,but also the fuel consumption.A example were developed to solve the proposed models.It was found that our proposed models yielded better results than the traditional VRP models.

  4. Congestion Free Routing in Adhoc Networks

    Directory of Open Access Journals (Sweden)

    V. Sankaranarayanan

    2012-01-01

    Full Text Available Problem statement: A Mobile Ad-Hoc Network (MANET is a temporary network; the mobile devices in an ad-hoc network are communicating through wireless links without any pre-existing infrastructure. The one major problem of this network is network congestion, it may take place at any intermediate nodes when data packets are traveling from source to destination. The major problems of congestion or high data loss, increasing End to End and retransmission packets which affects the overall network performance. The main goal of congestion control is to effectively utilize the existing network resources and maintain the network load below the capacity. Approach: This study presents the Congestion Free Routing in Adhoc networks (CFR, based on dynamically estimated mechanism to monitor network congestion by calculating the average queue length at the node level. While using the average queue length, the nodes’ congestion status divided into the three zones (safe zone, likely to be congested zone and congested zone. CFR utilizes the non-congested neighbors and initiates route discovery mechanism to discover a congestion free route between source and destination. This path becomes a core path between source and destination. To maintain the congestion free status, the nodes which are helping data packet transmission periodically calculate their congestion status at the node level. When a core node is noticed that it fell in to likely to congested zone and alerts to its neighbors. The predecessor core path node is aware of this situation and initiates an alternate path discovery mechanism to a destination. Finally it discovers a new congestion free route to the destination. Results: The assessment between CFR and AODV was conducted by using the Ns-2 simulator. The simulation results confirmed that the CFR improved packet delivery ratio, reduction of End to End delay and control packets. Conclusion: Our proposed technique solved the congestion problems in a

  5. Vehicle Routing and the Value of Postponement

    OpenAIRE

    Asim, Muhammad

    2008-01-01

    Industrial wisdom presumes that postponing the collection (or delivery) services reduces the transportation cost & most of the studies conducted in practical scenarios also substantiate this belief. However there is a dearth of in-depth research assessing the value of postponement in vehicle routing context. This research aims to explore the significance of postponement & its inter-relationship with related problem parameters such as vehicle capacity, clients' density, location of clients & d...

  6. Model-based immunization information routing.

    OpenAIRE

    Wang, D.; Jenders, R. A.

    2000-01-01

    We have developed a model for clinical information routing within an immunization registry. Components in this model include partners, contents and mechanisms. Partners are classified into senders, receivers and intermediates. Contents are classified into core contents and management information. Mechanisms are classified into topological control, temporal control, process control and communication channel control. Immunization reminders, forecasts and recalls in e-mail, fax and regular mail ...

  7. Opportunistic Routing for the Vehicular Energy Network

    OpenAIRE

    Lam, Albert Y. S.; Li, Victor O. K.

    2014-01-01

    Vehicular energy network (VEN) is a vehicular network which can transport energy over a large geographical area by means of electric vehicles (EVs). In the near future, an abundance of EVs, plentiful generation of the renewables, and mature wireless energy transfer and vehicular communication technologies will expedite the realization of VEN. To transmit energy from a source to a destination, we need to establish energy paths, which are composed of segments of vehicular routes, while satisfyi...

  8. Agent-Based Routing in Queueing Systems

    OpenAIRE

    Gallay, Olivier

    2010-01-01

    Waiting time in any network is often a costly and hence a bad experience. Therefore, to avoid jamming regions becomes essential in the optimization of traffic flows. In this regard, the conception and the control of complex networks supporting flows of units are key issues in various strategic engineering and service areas ranging from manufacturing systems, supply chains, retail stores, transportation and communication networks to only quote a few. Flow dynamics depend jointly on the routing...

  9. Personalized routing for multitudes in smart cities

    OpenAIRE

    De Domenico, Manlio; Lima, Antonio; Arenas, Alex; Gonzalez, Marta C.

    2014-01-01

    Human mobility in a city represents a fascinating complex system that combines social interactions, daily constraints and random explorations. New collections of data that capture human mobility not only help us to understand their underlying patterns but also to design intelligent systems. Bringing us the opportunity to reduce traffic and to develop other applications that make cities more adaptable to human needs. In this paper, we propose an adaptive routing strategy which accounts for ind...

  10. Challenges in Enzymatic Route of Mannitol Production

    OpenAIRE

    Sheelendra Mangal Bhatt; Anand Mohan,; Suresh Kumar Srivastava

    2012-01-01

    Mannitol is an important biochemical often used as medicine and in food sector, yet its biotechnological is not preffered in Industry for large scale production, which may be due to the multistep mechanism involved in hydrogenation and reduction. This paper is a comparative preview covering present chemical and biotechnological approaches existing today for mannitol production at industrial scale. Biotechnological routes are suitable for adaptation at industrial level for mannitol production,...

  11. Dynamic routing for social information sharing

    OpenAIRE

    Li, Yunpeng; Courcoubetis, Costas; Duan, Lingjie

    2016-01-01

    Today mobile users are intensively interconnected thanks to the emerging mobile social networks, where they share location-based information with each other when traveling on different routes and visit different areas of the city. In our model the information collected is aggregated over all users' trips and made publicly available as a public good. Due to information overlap, the total useful content amount increases with the diversity in path choices made by the users, and it is crucial to ...

  12. A Novel Insight Into Beaconless Geo- Routing

    OpenAIRE

    Bader, Ahmed; Abed-Meraim, Karim; Alouini, Mohamed-Slim

    2012-01-01

    Analysis and simulation of beaconless geo-routing protocols have been traditionally conducted assuming equal communication ranges for the data and control packets. In reality, this is not true since the communication range is actually function of the packet length. Control packets are typically much shorter than data packets. As a consequence, a substantial discrepancy exists in practice between their respective communication ranges. In this paper, we devise a practical link model for computi...

  13. A simple route to graphene oxide frameworks

    OpenAIRE

    Imperiali, Luna; Clasen, Christian; Fransaer, Jan; Macosko, Christopher W.; Vermant, Jan

    2014-01-01

    Lightweight graphene structures have promising applications, for example as separation media, as micro reactor environments, for use in energy storage or in microelectronics. The assembly of graphene or its derivates into such frameworks typically require rather elaborate and expensive methods which are moreover dicult to scale up. In the present work we propose a simpler route which is based on arresting the temperature induced phase separation in a water-lutidine mixture containing graphene...

  14. Performance Analysis of Location Profile Routing

    OpenAIRE

    Bild, David R.; Liu, Yue; Dick, Robert P.; Mao, Z. Morley; Wallach, Dan S.

    2014-01-01

    We propose using the predictability of human motion to eliminate the overhead of distributed location services in human-carried MANETs, dubbing the technique location profile routing. This method outperforms the Geographic Hashing Location Service when nodes change locations 2x more frequently than they initiate connections (e.g., start new TCP streams), as in applications like text- and instant-messaging. Prior characterizations of human mobility are used to show that location profile routin...

  15. Secure Position-Based Routing for VANETs

    OpenAIRE

    Harsch, Charles; Festag, Andreas; Papadimitratos, Panagiotis

    2007-01-01

    Vehicular communication (VC) systems have the potential to improve road safety and driving comfort. Nevertheless, securing the operation is a prerequisite for deployment. So far, the security of VC applications has mostly drawn the attention of research efforts, while comprehensive solutions to protect the network operation have not been developed. In this paper, we address this problem: we provide a scheme that secures geographic position-based routing, which has been widely accepted as the ...

  16. Healthy Air Outdoors

    Science.gov (United States)

    ... lung.org > Our Initiatives > Healthy Air > Outdoor Healthy Air Outdoors The quality of the air we breathe ... families and can even shorten their lives. Outdoor Air Pollution and Health Outdoor air pollution continues to ...

  17. Air quality

    International Nuclear Information System (INIS)

    This chapter of the 'Assessment of the state of the environment in Lebanon' describes the air quality and identifies the most important air quality issues. Baseline information about the factors affecting dispersion and the climate of Lebanon presents as well and overall estimation of total emissions in Lebanon. Emissions from vehicles, electricity and power plants generation are described. Industrial emitters of air pollutants are described for each kind of industry i.e.cement plants, Selaata fertilizer factory, sugar-beet factory, refineries and for those derived from the use of leaded fuel . Impact of economic and human activities on air quality in Lebanon (especially in Beirut and Tripoli) are quantified by quantities of CO2, SO2, NOx, total suspended particulates(TSP), deposition and their environmental effects on health. In abscence of emissions monitoring, data available are expressed in terms of fuel use, output and appropriate empirical factors, national output and workfores sizes. Finally key issues and some potential mitigation /management approaches are presented

  18. Manufacturing of self-passivating tungsten based alloys by different powder metallurgical routes

    Science.gov (United States)

    Calvo, A.; Ordás, N.; Iturriza, I.; Pastor, J. Y.; Tejado, E.; Palacios, T.; García-Rosales, C.

    2016-02-01

    Self-passivating tungsten based alloys will provide a major safety advantage compared to pure tungsten when used as first wall armor of future fusion reactors, due to the formation of a protective oxide layer which prevents the formation of volatile and radioactive WO3 in case of a loss of coolant accident with simultaneous air ingress. Bulk WCr10Ti2 alloys were manufactured by two different powder metallurgical routes: (1) mechanical alloying (MA) followed by hot isostatic pressing (HIP) of metallic capsules, and (2) MA, compaction, pressureless sintering in H2 and subsequent HIPing without encapsulation. Both routes resulted in fully dense materials with homogeneous microstructure and grain sizes of 300 nm and 1 μm, respectively. The content of impurities remained unchanged after HIP, but it increased after sintering due to binder residue. It was not possible to produce large samples by route (2) due to difficulties in the uniaxial compaction stage. Flexural strength and fracture toughness measured on samples produced by route (1) revealed a ductile-to-brittle-transition temperature (DBTT) of about 950 °C. The strength increased from room temperature to 800 °C, decreasing significantly in the plastic region. An increase of fracture toughness is observed around the DBTT.

  19. An Alternative Route to Pentavalent Postperovskite.

    Science.gov (United States)

    Crichton, Wilson A; Yusenko, Kirill V; Riva, Sephira; Mazzali, Francesco; Margadonna, Serena

    2016-06-20

    Two different high-pressure and -temperature synthetic routes have been used to produce only the second-known pentavalent CaIrO3-type oxide. Postperovskite NaOsO3 has been prepared from GdFeO3-type perovskite NaOsO3 at 16 GPa and 1135 K. Furthermore, it has also been synthesized at the considerably lower pressure of 6 GPa and 1100 K from a precursor of hexavalent Na2OsO4 and nominally pentavalent KSbO3-like phases. The latter synthetic pathway offers a new lower-pressure route to the postperovskite form, one that completely foregoes any perovskite precursor or intermediate. This work suggests that postperovskite can be obtained in other compounds and chemistries where generalized rules based on the perovskite structure may not apply or where no perovskite is known. One more obvious consequence of our second route is that perovskite formation may even mask and hinder other less extreme chemical pathways to postperovskite phases. PMID:27267734

  20. QoS Routing in Smart Grid

    CERN Document Server

    Li, Husheng

    2010-01-01

    Smart grid is an emerging technology which is able to control the power load via price signaling. The communication between the power supplier and power customers is a key issue in smart grid. Performance degradation like delay or outage may cause significant impact on the stability of the pricing based control and thus the reward of smart grid. Therefore, a QoS mechanism is proposed for the communication system in smart grid, which incorporates the derivation of QoS requirement and applies QoS routing in the communication network. For deriving the QoS requirement, the dynamics of power load and the load-price mapping are studied. The corresponding impacts of different QoS metrics like delay are analyzed. Then, the QoS is derived via an optimization problem that maximizes the total revenue. Based on the derived QoS requirement, a simple greedy QoS routing algorithm is proposed for the requirement of high speed routing in smart grid. It is also proven that the proposed greedy algorithm is a $K$-approximation. ...

  1. ETOR-Efficient Token based Opportunistic Routing

    Directory of Open Access Journals (Sweden)

    A. Saichand

    2013-06-01

    Full Text Available This paper proposes an Efficient Token based Opportunistic Routing called ETOR, which is animprovement to the token based coordination approach for opportunistic routing proposed by Economy[1].In Economy, method used for finding the connected candidate order chooses neighbor as the nextcandidate by considering ETX of that neighbor towards the source but it does not consider the linkprobability between the relay candidate and neighbor to be selected. ETOR proposes variant methods forfinding the connected candidate order in token based opportunistic routing by considering both the ETXof the neighbor towards source as well as ETX of the relay towards sending candidate which avoids weakerlinks between its intermediate nodes thereby improving the throughput and reducing the AA Ratio. We alsopropose a solution for reducing the number of hops traversed by the token, which in turn increases thetoken generation speed. Simulation results show that the proposed ETOR approaches perform better thanEconomy approach in terms of AA Ratio, number of hops traversed by the token and number of tokentraversals.

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

    Science.gov (United States)

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

    2016-01-01

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

  3. Simulated Annealing Technique for Routing in a Rectangular Mesh Network

    Directory of Open Access Journals (Sweden)

    Noraziah Adzhar

    2014-01-01

    Full Text Available In the process of automatic design for printed circuit boards (PCBs, the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniform Nx×Ny array of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.

  4. A Survey on Underwater Acoustic Sensor Network Routing Protocols

    Directory of Open Access Journals (Sweden)

    Ning Li

    2016-03-01

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

  5. Evaluate Dynamic Source Routing Protocol Performance in Wireless MANET

    Directory of Open Access Journals (Sweden)

    Ashwin Perti

    2014-03-01

    Full Text Available Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth. In my research paper I have analyzed a routing protocol called Dynamic Source Routing (DSR. At the ed of my Research paper result of its unique design, the protocol adapts quickly to routing changes when node movement is frequent, yet requires little or no overhead during periods in which nodes move less frequently. By graphical form a detailed analysis of DSR’s behaviour in a variety of situations, this paper generalizes the lessons learned from DSR so that they can be applied to the many other new routing protocols that have adopted the basic DSR framework. In the DSR protocol, a backup route will be initiated to transfer data (in route cache when the initial route is broken. However, a backup route affects the overall network performance such as end-to-end delay, etc. In this paper, I showed the simulation results of the dynamic source routing protocol based on it’s throughput, pause time, packet received, drop packet ratio, end to end delay, packet delivery fraction, and routing overhead. This results shows that dynamic source routing protocol is an efficient protocol to be used in Ad Hoc network.

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

  7. Impact of the Mobility Models, Route and Link connectivity on the performance of Position based routing protocols

    OpenAIRE

    Adam MACINTOSH; Ming FEISIYAU; Mohammed GHAVAMI

    2014-01-01

    This paper investigate the fundamental factors “mobility models, route and link connectivity” in Mobile Ad hoc networks (MANET) which have a major impact on the performance of position based routing protocols. In addition, a new measurement method called probability of communication process is proposed. The method is used to measure the success rate of established path by a MANET routing protocol, which allow to stress test and inspect the stability, scalability and adaptability of MANET rout...

  8. Enhancing Wireless Sensor Network Routing by High Quality Link Set Cooperative Routing Algorithm

    Directory of Open Access Journals (Sweden)

    A.Narendrakumar

    2013-10-01

    Full Text Available In general Wireless Sensor Networks (WSN’s, improving the network reliability by using cooperative communication to select the relay node with low overhead is a challenging task. Also the design of routing scheme based on link quality is a critical problem. Due to the resource constraints, connections between the nodes are changeable one. It leads to the network to create a various routes which are necessary. By using the established path, it delivers the data to the base station in a reliable manner. This paper concentrates on a cross layer approach by using various cooperative metric such as Packet Delivery Rate (PDR, Packet Reception Rate(PRR, Required Number of Packet transmission (RNP, Average number of packet sent/resent and Expected Transmission Time (ETX. These parameters are taken as a fuzzy parameter that exploits the cooperative diversity at the routing layer. We propose a Fuzzy based High Quality Link Set Routing (FHQLSR which selects the high quality relay node and evaluates the quality of link in each node by using RNP and ETX parameters. This FHQLSR scheme is used to find the effective relay node that forward packets to the base station via high quality link and also find the optimal path using Improved Dijikstra’s Algorithm (IDA in the multi hop networks. By considering routing and link quality parameters, the FHQLSR scheme improves theoverall reliability, scalability and stability of the network.

  9. Digital Labeling and Narrative Mapping in Mobile Remote Audio Signage: Verbalization of Routes and Generation of New Verbal Route Descriptions from Existing Route Sets

    OpenAIRE

    Tammineni, Tharun Tej

    2013-01-01

    Independent navigation is a great challenge for people with visual impairments. In this project, we have designed and implemented an assisted navigation solution based on the ability of visually impaired travelers to interpret and contextualize verbal route descriptions. Previous studies have validated that if a route is verbally described in sufficient and appropriate manner then VI can use their orientation and mobility skills to successfully follow the route. In this project, we do not con...

  10. Royal Danish Air Force. Air Operations Doctrine

    DEFF Research Database (Denmark)

    Nørby, Søren

    This brief examines the development of the first Danish Air Force Air Operations Doctrine, which was officially commissioned in October 1997 and remained in effect until 2010. The development of a Danish air power doctrine was heavily influenced by the work of Colonel John Warden (USAF), both...... through his book ”The Air Campaign” and his subsequent planning of the air campaign against Iraq in 1990-1991. Warden’s ideas came to Denmark and the Danish Air Force by way of Danish Air Force students attending the United States Air Force Air University in Alabama, USA. Back in Denmark, graduates from...... the Air University inspired a small number of passionate airmen, who then wrote the Danish Air Operations Doctrine. The process was supported by the Air Force Tactical Command, which found that the work dovetailed perfectly with the transformation process that the Danish Air Force was in the midst of...

  11. Secure multipath routing and data transmission in MANET

    DEFF Research Database (Denmark)

    Banoth, Rajkumar; Narsimha, Gugulothu

    2016-01-01

    In mobile ad hoc network (MANET), providing security during multipath routing protocol and during the data transmission with the multiple routes is a challenging task. For this, in this paper, we propose a secure multipath routing and data transmission in which RREQ packets are signed using digital...... verified, then the path will be accepted. At the source node, the message parts are encrypted using session keys and hash function. Based on the trust level of the nodes, secure routing can be performed. An algorithm was used to choose an optimal secure routing path. The messages are then fragmented into...

  12. Performance Enhancement of Ad Hoc Networks with Janitor Based Routing

    CERN Document Server

    Siddique, Isnain; Hashem, M M A

    2012-01-01

    We propose and analyze a new on the fly strategy that discovers, repairs and maintains routes in hierarchical and distributed fashion called Janitor Based Routing (JBR). The main motivation behind our JBR protocol is to decrease flooding and routing overhead and increase efficiencies in packet movement. An analytical model for the proposed JBR is presented and detailed simulation is used to observe the performance of JBR. This route discovery and maintenance protocol clearly achieved improvement in terms of reduction of flooding, routing overhead, and, hence, provides enhanced reliability.

  13. Mobility Tolerant Firework Routing for Improving Reachability in MANETs

    Directory of Open Access Journals (Sweden)

    Gen Motoyoshi

    2014-03-01

    Full Text Available In this paper, we investigate our mobility-assisted and adaptive broadcast routing mechanism, called Mobility Tolerant Firework Routing (MTFR, which utilizes the concept of potentials for routing and improves node reachability, especially in situations with high mobility, by including a broadcast mechanism. We perform detailed evaluations by simulations in a mobile environment and demonstrate the advantages of MTFR over conventional potential-based routing. In particular, we show that MTFR produces better reachability in many aspects at the expense of a small additional transmission delay and intermediate traffic overhead, making MTFR a promising routing protocol and feasible for future mobile Internet infrastructures.

  14. Children's Representation of the Route in a Familiar Environment

    Directory of Open Access Journals (Sweden)

    E.A. Kolukisa

    2007-09-01

    Full Text Available Giving route in a familiar environment is an essential component in geographic and spatial cognition. In normally conditions, a person who recognized own neighborhood easily give a route and represent it. In this study it was investigated “how children represent their environment for a route task”. In order to provide empirical evidence was conducted drawing activity. Participants are 71 6th grades students in elementary school (34 girls and 37 boys. They were familiar with the route. During the study, children are observed and sometimes ask some questions about the route.

  15. RSRP: A Robust Secure Routing Protocol in MANET

    OpenAIRE

    Sinha Ditipriya; Bhattacharya Uma; Chaki Rituparna

    2014-01-01

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

  16. Adaptive swarm-based routing in communication networks

    Institute of Scientific and Technical Information of China (English)

    吕勇; 赵光宙; 苏凡军; 历小润

    2004-01-01

    Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness and distributed, decentralized nature, which are well suited for routing in modern communication networks. This paper describes an adaptive swarm-based routing algorithm that increases convergence speed, reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called momentum.Experiment on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.

  17. Adaptive swarm-based routing in communication networks

    Institute of Scientific and Technical Information of China (English)

    吕勇; 赵光宙; 苏凡军; 历小润

    2004-01-01

    Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features,including adaptation,robustness and distributed,decentralized nature,which are well suited for routing in modern communication networks.This paper describes an adaptive swarm-based routing algorithm that increases convergence speed,reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called momentum.Experiment on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.

  18. EXTENDED DYNAMIC SOURCE ROUTING PROTOCOL FOR AD HOC NETWORK

    Directory of Open Access Journals (Sweden)

    Puja Kumari Sharma

    2012-07-01

    Full Text Available MANET is a collection of self-configurable mobile nodes. Several routing protocols are proposed for ad hoc network among which DSR and AODV On demand routing protocols are mostly used. Existing Dynamic source routing protocol is not suitable for large network because packet size gets increased according to the number of nodes travelled by route discovery packet. In this paper, extended DSR routing protocol is proposed to eliminate the above limitation of existing DSR. Proposed protocol will be suitable for small and large both types of networks.

  19. Trust-Based Route Selection in Dynamic Source Routin

    DEFF Research Database (Denmark)

    Jensen, Christian D.; Connell, Paul O

    Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Nodes rely on each other to route packets to other mobile nodes or toward stationary nodes that may act as a gateway to a fixed network. Mobile nodes are generally assumed to participate as routers...... routing protocols, which selects the route based on a local evaluation of the trustworthiness of all known intermediary nodes (routers) on the route to the destination. We have implemented this mechanism in an existing ad hoc routing protocol, and we show how trust can be built from previous experience...

  20. Air pollution

    International Nuclear Information System (INIS)

    Australian cites experience a number of current and emerging air pollution problems. Concentrations of traditional primary pollutants such as CO, lead and dust have fallen in recent years as a consequence of air pollutant control measures, and the widespread introduction of lead-free petrol. However, recommended guidelines for ozone, the principal component of photochemical smog, are regularly exceeded in major capital cities in the summer months. In addition, it is predicted that extensive urban expansion will lead to much greater dependence on the motor vehicle as the primary means of transportation. Effects of air pollution are felt at a variety of scales. Traditionally, concerns about gaseous and particulate emissions from industrial and vehicular sources were focused on local impacts due to exposure to toxic species such as CO and lead. As noted above, concentrations of these pollutants have been reduced by a variety of control measures. Pollutants which have effects at a regional scale, such as photochemically-produced ozone, and acidic gases and particles have proved more difficult to reduce. In general, these pollutants arc not the result of direct emissions to atmosphere, but result from complex secondary processes driven by photochemical reactions of species such as NO2 and aldehydes. In addition, global effects of gaseous and particulate emissions to the atmosphere have received significant recent attention, concentrations of atmospheric CO2 with predicted impacts on global climate, and ozone depletion due to anthropogenic emissions of chlorine-containing chemicals are the two major examples. Combustion processes from petrol- and diesel-fuelled vehicles, make major contributions to air pollution, and the magnitude of this contribution is discussed in this article

  1. Using Ant Colony Optimization for Routing in VLSI Chips

    Science.gov (United States)

    Arora, Tamanna; Moses, Melanie

    2009-04-01

    Rapid advances in VLSI technology have increased the number of transistors that fit on a single chip to about two billion. A frequent problem in the design of such high performance and high density VLSI layouts is that of routing wires that connect such large numbers of components. Most wire-routing problems are computationally hard. The quality of any routing algorithm is judged by the extent to which it satisfies routing constraints and design objectives. Some of the broader design objectives include minimizing total routed wire length, and minimizing total capacitance induced in the chip, both of which serve to minimize power consumed by the chip. Ant Colony Optimization algorithms (ACO) provide a multi-agent framework for combinatorial optimization by combining memory, stochastic decision and strategies of collective and distributed learning by ant-like agents. This paper applies ACO to the NP-hard problem of finding optimal routes for interconnect routing on VLSI chips. The constraints on interconnect routing are used by ants as heuristics which guide their search process. We found that ACO algorithms were able to successfully incorporate multiple constraints and route interconnects on suite of benchmark chips. On an average, the algorithm routed with total wire length 5.5% less than other established routing algorithms.

  2. Route-specific analysis for radioactive materials transportation

    International Nuclear Information System (INIS)

    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

  3. MiniTE: data acquisition routing for wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    LI Wen-feng; WANG Ru-chuan; SUN Li-juan

    2009-01-01

    Routing is one of the most important supporting parts in wireless sensor networks (WSNs) application that directly affects the application efficiency. Routing time and energy consumption are two major factors used to evaluate WSNs routing. This article proposes a minimum routing time and energy consumption (MiniTE) routing, which can ensure feasibility of the routing protocol both in routing time and energy consumption. Based on the MiniTE, WSNs can be partitioned into different regions according to the received signal strength indication (RSSI). Messages are sent by nodes in the region to their parent node and again up to their parent node until finally to the sink node. Theoretic evaluation and simulation results are given to verify the features of the protocol.

  4. Our Brothers' Keepers: Secure Routing with High Performance

    CERN Document Server

    Brodsky, Alex

    2008-01-01

    The Trinity (Brodsky et al., 2007) spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of processing hundreds of messages per second, and must be able to route messages to their destination even in the presence of failures and malicious peers that misroute packets or inject fraudulent routing information into the system. Typically there is tension between the requirements to route messages securely and efficiently in the overlay. We describe a secure and efficient routing extension that we developed within the I3 (Stoica et al. 2004) implementation of the Chord (Stoica et al. 2001) overlay. Secure routing is accomplished through several complementary approaches: First, peers in close proximity form overlapping groups that police themselves to identify and mitigate fraudulent routing information. Second, a form of random routing solves the problem of entire packet flows passing through a malicious peer. Thi...

  5. REDUCING BURST PACKET LOSS THROUGH ROUTE-FREE FORWARDING

    Institute of Scientific and Technical Information of China (English)

    Ma Hailong; Guo Yunfei; Cheng Dongnian; Zhang Jianwei

    2010-01-01

    It is well known that today's inter-domain routing protocol,Border Gateway Protocol (BGP),converges slowly during network failures. Due to the distribution nature of Internet routing decisions and the rate-limiting timer Minimum Route Advertisement Interval (MRAI) of BGP,unavoidable convergence latency is introduced in reaction to network changes. During the period of convergence temporarily routing table inconsistencies cause short-term routing blackholes and loops which result in widespread temporary burst packet loss. In this paper,we present ROute-Free Forwarding (ROFF) - a novel technique for packet delivering continuously during periods of convergence. With slightly modifications on IP packet header and BGP,route loops and blackholes can be avoided. Our preliminary evaluation demonstrates that ROFF succeeds in reducing the number of Autonomous Systems (ASes) which experience burst packet loss and the duration of packet loss.

  6. Comprehensive restoration performance analyzed under different routing and rerouting policies

    Science.gov (United States)

    Lei, Bo; Lee, Peiyuan; Gu, Wanyi

    2005-11-01

    This paper studies the routing and wavelength assignment (RWA) problem in wavelength-routed all-optical networks with dynamic traffic demand. As well known, the performance of network restoration strongly depends upon the routing and rerouting policies. In this letter, we comprehensively analyzed the restoration performance under two main alternate dynamic routing algorithm, LLR(Least Loaded Routing) and FPLC(Fixed-Paths Least-Congestion routing), and two rerouting policies, based on K-path backup or Dijkstra algorithm. Through modelling and simulation, we compute the restoration efficiencies of four combinations on the NSFNET T1 backbone network, with different traffic load. The numerical simulation result shows that the rerouting policy based on Dijkstra algorithm has improved more 10%-20% performance than the rerouting policy based on K-path backup. The LLR and FPLC routing algorithm achieve the same performance by and large when the same rerouting policy is used.

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

  8. Integrated Modeling of Air Traffic, Aviation Weather, and Communication Systems

    OpenAIRE

    Quan, Chuanwen

    2007-01-01

    Aviation suffers many delays due to the lack of timely air traffic flow management. These delays are also caused by the uncertainty weather information; and the lack of efficient dissemination of weather products to pilots. It is clear that better models are needed to quantify air traffic flow in three flight regions - en-route, in the terminal, and on the ground, to determine aviation weather information requirements at each region, and to quantify their bandwidth requirements. Furthermore,...

  9. Secure Routing and Identifying Hacking In P2p System

    Directory of Open Access Journals (Sweden)

    Gowsiga Subramaniam

    2014-08-01

    Full Text Available Packet forwarding is the procedure to route the packet from source to destination via routers. Getting the systems ip address in a LAN and decides the source, destination and the intermediate systems for our routing process. Using any database form the routing table with columns like source address, destination address and router addresses. After creating the routing table enters the ip address in the respective columns. As per this procedure by comparing ip addresses in the routing table the packet will be forward to next ip address. The ip addresses in the routing table, are the path selected by the user according to the respective path the packet will be forward and finally reach destination. Source generate a packet and forward to ip address which is in router ip as per in routing table. Source need to know whether the packet received by authenticated router or not thus each router send an acknowledgement packet to the source. Thus each and every router follows the same procedure to avoid unauthenticated router access in a routing process. As per acknowledgement received from each router source finds out the unauthenticated router access. As per security concern added the signature scheme in a routing process. Before send the packet, source generates the signature with peer ID of destination then forwards the packet to the ip address as per routing table. The packet will be decrypted only the system matched with the signature otherwise just forwards the packet to the next system. Tracer routing is to find out the unauthorized router access in a routing process. This is verifying by getting acknowledgment from each and every router in the routing process by a source. Then source compare the acknowledgement with the predefined routing table if any ip mismatch then it will be consider as unauthorized ip.

  10. Air filtration and indoor air quality

    DEFF Research Database (Denmark)

    Bekö, Gabriel

    2006-01-01

    Demands for better indoor air quality are increasing, since we spend most of our time indoors and we are more and more aware of indoor air pollution. Field studies in different parts of the world have documented that high percentage of occupants in many offices and buildings find the indoor air...... decent ventilation and air cleaning/air filtration, high indoor air quality cannot be accomplished. The need for effective air filtration has increased with increasing evidence on the hazardous effects of fine particles. Moreover, the air contains gaseous pollutants, removal of which requires various air...... cleaning techniques. Supply air filter is one of the key components in the ventilation system. Studies have shown that used ventilation filters themselves can be a significant source of indoor air pollution with consequent impact on perceived air quality, sick building syndrome symptoms and performance...

  11. Travel Along The Long March Route

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    <正>At the invi-tation of the China-Ja-pan Friendship Association(CJFA),the delegation for studying the Chinese peo-ple’s revolu-tionary wars(Long March delegation for short)orga-nized by the Japan Iskra In-dustry Compa-ny Ltd.came to China to travel along the route of the Red Army’s Long March in Si-chuan Province to learn the Chinese revo-lutionary spirit from October 25 to 31,2007.

  12. An easy route to make superhydrophobic surface

    Science.gov (United States)

    Panda, Kalpataru; Kumar, N.; Polaki, S. R.; Panigrahi, B. K.

    2012-06-01

    Superhydrophobic films with excellent flexibility have been fabricated on silicon surface, generated by means of a chemical galvanic cell route, within a short span of 10 sec. The results show a water contact angle of 155° (superhydrophobic) for the chemically modified silicon surface while it is 63° (hydrophilic) in pure silicon substrate. The surface roughness increases with well ordered protrusions after the chemical treatment. Surface roughness and low surface energy are ascribed for the superhydrophobic behavior of these chemically modified silicon surfaces.

  13. Express route between Frankfort and Traverse City

    OpenAIRE

    Embrey, Shaan-Mya; Falenius, Sofie

    2012-01-01

    Since 2007 Benzie Bus has operated public transportation in Benzie County, Michigan. Benzie County is a rural area with a lot of people commuting every day to Traverse City for work and education. At present the company mainly operates a Dial-a-Ride system, but also a route between Frankfort and Traverse City three times a day Monday to Friday. Only a few of these commuters travel by public transportation today and a large reason is that the trip takes too long, mainly because of a high servi...

  14. RAPTOR: Routing Attacks on Privacy in Tor

    OpenAIRE

    Sun, Yixin; Edmundson, Anne; Vanbever, Laurent; Li, Oscar; Rexford, Jennifer; Chiang, Mung; Mittal, Prateek

    2015-01-01

    The Tor network is a widely used system for anonymous communication. However, Tor is known to be vulnerable to attackers who can observe traffic at both ends of the communication path. In this paper, we show that prior attacks are just the tip of the iceberg. We present a suite of new attacks, called Raptor, that can be launched by Autonomous Systems (ASes) to compromise user anonymity. First, AS-level adversaries can exploit the asymmetric nature of Internet routing to increase the chance of...

  15. Energy-Efficient Routing in GMPLS Network

    DEFF Research Database (Denmark)

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

    2011-01-01

    In this paper, a GMPLS controlled core network model that takes energy efficiency into account is built using OPNET MODELER. By extending the standard GMPLS routing protocol -- OSPF-TE, we are able to spread desired energy related information over the local area, and subsequently use RSVP-TE for...... connection setup. The OSPF designing process of the simulation model is given in details, including necessary simplifications to enable a fast implementation while keeping the key characteristics of the GMPLS protocol behaviors. The efficiency of the proposed extensions are analyzed, and improved energy...... efficiency is shown through the results collected from OPNET MODELER simulation models....

  16. Vehicle routing with cross-docking

    DEFF Research Database (Denmark)

    Wen, Min; Larsen, Jesper; Clausen, Jens; Cordeau, Jean-Francois; Laporte, Gilbert

    2009-01-01

    Over the past decade, cross-docking has emerged as an important material handling technology in transportation. A variation of the well-known Vehicle Routing Problem (VRP), the VRP with Cross-Docking (VRPCD) arises in a number of logistics planning contexts. This paper addresses the VRPCD, where a...... set of homogeneous vehicles are used to transport orders from the suppliers to the corresponding customers via a cross-dock. The orders can be consolidated at the cross-dock but cannot be stored for very long because the cross-dock does not have long-term inventory-holding capabilities. The objective...

  17. Green maritime transportation: Speed and route optimization

    DEFF Research Database (Denmark)

    Psaraftis, Harilaos N.; Kontovas, Christos A.

    2015-01-01

    Among the spectrum of logistics-based measures for green maritime transportation, this chapter focuses on speed optimization. This involves the selection of an appropriate speed by the vessel, so as to optimize a certain objective. As ship speed is not fixed, depressed shipping markets and/or high...... necessarily be possible. The chapter presents some basics, discusses the main trade-offs and also examines combined speed and route optimization problems. Some examples are finally presented so as to highlight the main issues that are at play....

  18. Region growing for multi-route cuts

    OpenAIRE

    Barman, Siddharth; Chawla, Shuchi

    2009-01-01

    We study a number of multi-route cut problems: given a graph G=(V,E) and connectivity thresholds k_(u,v) on pairs of nodes, the goal is to find a minimum cost set of edges or vertices the removal of which reduces the connectivity between every pair (u,v) to strictly below its given threshold. These problems arise in the context of reliability in communication networks; They are natural generalizations of traditional minimum cut problems where the thresholds are either 1 (we want to completely...

  19. Endocannabinoids, Related Compounds and Their Metabolic Routes

    Directory of Open Access Journals (Sweden)

    Filomena Fezza

    2014-10-01

    Full Text Available Endocannabinoids are lipid mediators able to bind to and activate cannabinoid receptors, the primary molecular targets responsible for the pharmacological effects of the Δ9-tetrahydrocannabinol. These bioactive lipids belong mainly to two classes of compounds: N-acylethanolamines and acylesters, being N-arachidonoylethanolamine (AEA and 2-arachidonoylglycerol (2-AG, respectively, their main representatives. During the last twenty years, an ever growing number of fatty acid derivatives (endocannabinoids and endocannabinoid-like compounds have been discovered and their activities biological is the subject of intense investigations. Here, the most recent advances, from a therapeutic point of view, on endocannabinoids, related compounds, and their metabolic routes will be reviewed.

  20. The competitive landscape of air transport in Europe

    NARCIS (Netherlands)

    R. Lieshout; P. Malighetti; R. Redondi; G. Burghouwt

    2016-01-01

    Competition between airlines and airports increased significantly since the deregulation of the intra-European air transport market in 1997. The passenger has a wider choice in terms of routings and departure airports than twenty-five years ago and pays a lower price. In this paper we investigate in

  1. Prevention Of WormholeAttacks In Geographic Routing Protocol

    Directory of Open Access Journals (Sweden)

    E.Poornima,

    2011-01-01

    Full Text Available As mobile ad hoc network applications are deployed, security emerges as a central requirement..Position aided routing protocols can offer a significant performance increase over traditional ad hoc routing protocols. Boundary State Routing (BSR is a geographic routing protocol which routes the data using the location of the nodes. Geographic routing protocols are known to be particularly susceptible to attacks.. In this paper we present the possible attacks on BSR protocol. One of the most popular and serious attacks in ad hoc networks is wormhole attack in which two or more colluding attackers record packets at one location, and tunnel them to another location for a replay at that remote location. A wormhole attack is very powerful, and preventing the attack has proven to be very difficult. In this paper, we devise efficient methods to detect and avoid wormhole attacks in the BSR protocol. The first method namely Reverse Routing Scheme (RRS attempts to detect the intrusion action .The second technique namely Authentication of Nodes Scheme (ANS uses cryptographic concepts to detect and prevent wormhole attacks. It not only detects the fake route but also adopts preventive measures against action wormhole nodes from reappearing during routing. The proposed system is designed in Boundary state routing (BSRprotocol and analysis and simulations are performed in network simulator (NS-2.

  2. A Performance Analysis Between AODV & DSR Routing Protocol

    Directory of Open Access Journals (Sweden)

    Sankalp Bahadur Singh

    2012-07-01

    Full Text Available Mobile ad hoc network (MANET is an autonomous system of mobile nodes connected by wireless links. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. In this paper an attempt has been made to compare the performance of two prominent on demand reactive routing protocols for MANETs: Ad hoc On Demand Distance Vector (AODV, Dynamic Source Routing (DSR protocols. DSR and AODV are reactive gateway discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. As per our findings the differences in the protocol mechanics lead to significant performance differentials for both of these protocols. The performance differentials are analyzed using varying simulation time. These simulations are carried out using the ns-2 network simulator. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment..

  3. Secure Routing in Wireless Mesh Networks

    CERN Document Server

    Sen, Jaydip

    2011-01-01

    Wireless mesh networks (WMNs) have emerged as a promising concept to meet the challenges in next-generation networks such as providing flexible, adaptive, and reconfigurable architecture while offering cost-effective solutions to the service providers. Unlike traditional Wi-Fi networks, with each access point (AP) connected to the wired network, in WMNs only a subset of the APs are required to be connected to the wired network. The APs that are connected to the wired network are called the Internet gateways (IGWs), while the APs that do not have wired connections are called the mesh routers (MRs). The MRs are connected to the IGWs using multi-hop communication. The IGWs provide access to conventional clients and interconnect ad hoc, sensor, cellular, and other networks to the Internet. However, most of the existing routing protocols for WMNs are extensions of protocols originally designed for mobile ad hoc networks (MANETs) and thus they perform sub-optimally. Moreover, most routing protocols for WMNs are des...

  4. Multiple routes transmitted epidemics on multiplex networks

    International Nuclear Information System (INIS)

    This letter investigates the multiple routes transmitted epidemic process on multiplex networks. We propose detailed theoretical analysis that allows us to accurately calculate the epidemic threshold and outbreak size. It is found that the epidemic can spread across the multiplex network even if all the network layers are well below their respective epidemic thresholds. Strong positive degree–degree correlation of nodes in multiplex network could lead to a much lower epidemic threshold and a relatively smaller outbreak size. However, the average similarity of neighbors from different layers of nodes has no obvious effect on the epidemic threshold and outbreak size. -- Highlights: •We studies multiple routes transmitted epidemic process on multiplex networks. •SIR model and bond percolation theory are used to analyze the epidemic processes. •We derive equations to accurately calculate the epidemic threshold and outbreak size. •ASN has no effect on the epidemic threshold and outbreak size. •Strong positive DDC leads to a lower epidemic threshold and a smaller outbreak size.

  5. Impact of Flooding on Traffic Route Choices

    Directory of Open Access Journals (Sweden)

    Othman M.H.

    2014-01-01

    Full Text Available Traffic route choice using road network modelling can play a key role in preventing and minimizing traffic problems during disasters. Using road network modelling, real road conditions during flooding are simulated in order to produce a response plan for road users to evacuate based on the roads' real risks and situation. Using a Geographical Information System (GIS we can forecast and provide road users with available alternatives when certain access roads or links need to be closed due to catastrophic hazards such as floods. This study focuses on floods as it is the most common form of natural disaster occurring in Malaysia, and due to the fact that the chance and risk of a flood occurring cannot be accurately predicted nor measured. Therefore, as a response to this problem, the outcome of this study is highly useful for the retrieval of information on flooded roads and the impacts on road users. Using GIS's capability to display both spatial and attributive information, we have provided an attractive alternative to conventional methods in order to show available traffic route choices and a transportation network plan.

  6. Population estimation techniques for routing analysis

    International Nuclear Information System (INIS)

    A number of on-site and off-site factors affect the potential siting of a radioactive materials repository at Yucca Mountain, Nevada. Transportation related issues such route selection and design are among them. These involve evaluation of potential risks and impacts, including those related to population. Population characteristics (total population and density) are critical factors in the risk assessment, emergency preparedness and response planning, and ultimately in route designation. This paper presents an application of Geographic Information System (GIS) technology to facilitate such analyses. Specifically, techniques to estimate critical population information are presented. A case study using the highway network in Nevada is used to illustrate the analyses. TIGER coverages are used as the basis for population information at a block level. The data are then synthesized at tract, county and state levels of aggregation. Of particular interest are population estimates for various corridor widths along transport corridors -- ranging from 0.5 miles to 20 miles in this paper. A sensitivity analysis based on the level of data aggregation is also presented. The results of these analysis indicate that specific characteristics of the area and its population could be used as indicators to aggregate data appropriately for the analysis

  7. Robustness of airline alliance route networks

    Science.gov (United States)

    Lordan, Oriol; Sallan, Jose M.; Simo, Pep; Gonzalez-Prieto, David

    2015-05-01

    The aim of this study is to analyze the robustness of the three major airline alliances' (i.e., Star Alliance, oneworld and SkyTeam) route networks. Firstly, the normalization of a multi-scale measure of vulnerability is proposed in order to perform the analysis in networks with different sizes, i.e., number of nodes. An alternative node selection criterion is also proposed in order to study robustness and vulnerability of such complex networks, based on network efficiency. And lastly, a new procedure - the inverted adaptive strategy - is presented to sort the nodes in order to anticipate network breakdown. Finally, the robustness of the three alliance networks are analyzed with (1) a normalized multi-scale measure of vulnerability, (2) an adaptive strategy based on four different criteria and (3) an inverted adaptive strategy based on the efficiency criterion. The results show that Star Alliance has the most resilient route network, followed by SkyTeam and then oneworld. It was also shown that the inverted adaptive strategy based on the efficiency criterion - inverted efficiency - shows a great success in quickly breaking networks similar to that found with betweenness criterion but with even better results.

  8. Route Scherrer 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.   The part of Route Scherrer between Building 510 and Building 53 (see Figure) 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. 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 car park situated between Buildings 32, 38 and 168.

  9. The Suprachoroidal Route in Glaucoma Surgery

    Science.gov (United States)

    Shaarawy, Tarek

    2016-01-01

    ABSTRACT Glaucoma surgeries targeting the uveoscleral drainage pathways have been drawing more attention lately. Among all the available techniques, procedures focusing on the supra-choroidal space seem particularly promising, by making use of a presumably efficient and secure outflow route and avoiding subconjunctival filtration blebs. The purpose of this review is to assess the efficacy and the security of the different suprachoroidal drainage implants, namely the CyPass Micro-Stent, the iStent Supra, the SOLX Gold Shunt, the Aquashunt, and the STARflo Glaucoma Implant. Most clinical studies seem to currently point toward the direction that there are actual benefits in suprachoroidal surgeries by avoiding bleb-related complications. Nevertheless, even suprachoroidal implants may be subject to scarring and failure. More data are still needed, especially concerning long-term effects, although the approach does seem appealing. How to cite this article: Gigon A, Shaarawy T. The Suprachoroidal Route in Glaucoma Surgery. J Curr Glaucoma Pract 2016;10(1): 13-20.

  10. Self-Healing and Optimizing Adhoc Routing

    Directory of Open Access Journals (Sweden)

    Sunil Taneja

    2012-02-01

    Full Text Available Wireless networking is an emerging field with its potential applications in extremely unpredictable and dynamic environments. Individuals and industries choose wireless because it allows flexibility of location, whether that means mobility, portability, or just ease of installation at a fixed point. Wireless networks that fix their own broken communication links may speed up their widespread acceptance. The challenge for wireless communication is optimized handling of unpredictable environment through which commu¬nications travels. Despite early problems in overcoming this pitfall, the newest develop¬ments in self-healing wireless networks are solving the problem. The changes made to the network architectures are resulting in new methods of applica¬tion design for this medium. This paper presents an overview of self healing networks and a new scheme has been proposed that tries to heal the routing when a link failure occurs. The scheme can be incorporated into any adhoc on-demand unicast routing protocol. In this research work, the proposed scheme has been incorporated to AODV and observation is that the performance has been improved. The simulations have been carried over NS2 simulator with existing schemes and proposed scheme. Simulation results indicated that the proposed technique provides robustness.

  11. "To Control Tibet, First Pacify Kham": Trade Routes and "Official Routes" (Guandao in Easternmost Kham

    Directory of Open Access Journals (Sweden)

    Patrick Booz

    2016-06-01

    Full Text Available This article focuses on the trade routes in the western Sichuan borderlands that facilitated contact and trade between Chinese counties and Eastern Tibet. In particular, the article offers a description of “official routes” (guandao—which the Chinese emperor twice proclaimed to be the vital mode of access between China and Tibet—from Chengdu, Sichuan’s provincial capital, to Khampa areas, with Lhasa as the final destination. The exchange of goods in this region followed various routes during different periods. From the tenth to sixteenth centuries, transactions occurred primarily along the borders of Amdo (Tib. A mdo, Northeastern Tibet, but for political, economic, and practical reasons, such exchanges became more limited geographically and eventually focused along the Sichuan–Kham/Ngawa border. Many routes shifted to the towns of Kangding (Tib. Dartsedo and Songpan (Tib. Zungchu, the main sites of distribution, where rich opportunities for trade and a strictly limiting transport geography made them important entrepôts that evolved into centers of prosperity. The geographic range of this article reaches to these two towns and leaves the investigation of the routes that led to western centers such as Derge, Batang, Chamdo, and Jyekundo for future research.

  12. R9 Air Districts

    Data.gov (United States)

    U.S. Environmental Protection Agency — The Region 9 Air Districts layer is a compilation of polygons representing the California Air Pollution Control and Air Quality Management Districts, Arizona Air...

  13. AirData

    Data.gov (United States)

    U.S. Environmental Protection Agency — The AirData site provides access to yearly summaries of United States air pollution data, taken from EPA's air pollution databases. AirData has information about...

  14. California Air Basins

    Data.gov (United States)

    California Department of Resources — Air ResourcesCalifornia Air Resources BoardThe following datasets are from the California Air Resources Board: * arb_california_airbasins - California Air BasinsThe...

  15. Hazardous Air Pollutants

    Science.gov (United States)

    ... Facebook Twitter Google+ Pinterest Contact Us Hazardous Air Pollutants Hazardous air pollutants are those known to cause ... protect against adverse environmental effects. About Hazardous Air Pollutants What are hazardous air pollutants? Health and Environmental ...

  16. Infectious Risks of Air Travel.

    Science.gov (United States)

    Mangili, Alexandra; Vindenes, Tine; Gendreau, Mark

    2015-10-01

    Infectious diseases are still among the leading causes of death worldwide due to their persistence, emergence, and reemergence. As the recent Ebola virus disease and MERS-CoV outbreaks demonstrate, the modern epidemics and large-scale infectious outbreaks emerge and spread quickly. Air transportation is a major vehicle for the rapid spread and dissemination of communicable diseases, and there have been a number of reported outbreaks of serious airborne diseases aboard commercial flights including tuberculosis, severe acute respiratory syndrome, influenza, smallpox, and measles, to name a few. In 2014 alone, over 3.3 billion passengers (a number equivalent to 42% of the world population) and 50 million metric tons of cargo traveled by air from 41,000 airports and 50,000 routes worldwide, and significant growth is anticipated, with passenger numbers expected to reach 5.9 billion by 2030. Given the increasing numbers of travelers, the risk of infectious disease transmission during air travel is a significant concern, and this chapter focuses on the current knowledge about transmission of infectious diseases in the context of both transmissions within the aircraft passenger cabin and commercial aircraft serving as vehicles of worldwide infection spread. PMID:26542037

  17. Air crew monitoring in Germany

    International Nuclear Information System (INIS)

    Cosmic radiation at high altitudes, especially high energetic neutrons, significantly increases exposure to man. Pilots and flight attendants may receive annual effective doses comparable to doses received in occupations, in which ionising radiation is used or radioactive sources are handled. For this reason, the European Council Directive 96/29 EURATOM requires that air-crew members also be monitored for radiation protection. Flight personnel, receiving an effective dose from cosmic radiation of more than 1 mSv per year are subject to monitoring i.e. radiation exposure has to be assessed, limited and minimized. As the physical conditions causing cosmic radiation doses are well established, it is possible to calculate the expected radiation dose with sufficient accuracy. Several codes for this purpose are available. Since August 2003, the operators of airlines in Germany are obliged to assess the doses of their air crew personnel from cosmic radiation exposure and to minimise radiation exposure by means of appropriate work schedules, flight routes and flight profiles. Approx. 31 000 persons of 45 airlines are monitored by the German Radiation Protection Register. Gender, age and 3 different occupational categories are used to characterise different groups and their doses. The presentation will give an overview about the legislation and organisation of air crew monitoring in Germany and will show detailed statistical results from the first year of monitoring. (authors)

  18. Contamination of cars and exposure dose to drivers traveling through the Route 6 in the restricted area

    International Nuclear Information System (INIS)

    Traffic on the Route 6 will increase after the revision of evacuation area and restricted area. At the request of the Local Nuclear Emergency Response Headquarters established in Fukushima Prefecture, Japan Nuclear Energy Safety Organization (JNES) has surveyed the effect on cars and drivers traveling through the Route 6 in the restricted area as listed bellow. (1) Investigation of contamination of cars traveling through the Route 6. (2) Investigation of exposure dose of drivers traveling through the Route 6. The maximum contamination at the surface of tires and tire-houses of cars traveling through the Route 6 is estimated to be 2 Bq/cm2 (this concentration is correspond to 470 cpm). The external exposure dose of drivers will be about 4 μSv when they run through the restricted area at a pace of 40 km/h. The internal exposure dose will be small because of the low radioactive concentration in the air. It is important not to stay long in high radiation areas to prevent unnecessary exposure. The main source of the contamination is sand cloud thrown up by the wheels. Though, the radioactivity of the sand cloud is proportional to the surface concentration of roads and dose rate of each area, contamination level by the sand cloud will remain low level. Significant contamination is likely to be caused by running on the soil. So, it is important not to run on the soil on the local road around the Route 6 or road shoulder of the Route 6. It is recommended to wash tires and tire-houses when accidentally run on the soil. (author)

  19. 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. PMID:26361856

  20. 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 J.; Markstrom, Steve L.; Hay, Lauren E.; Woods, Ross; Arnold, Jeffrey R.; Brekke, Levi D.

    2016-06-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.

  1. Fast reactor calculational route for Pu burning core design

    International Nuclear Information System (INIS)

    This document provides a description of a calculational route, used in the Reactor Physics Research Section for sensitivity studies and initial design optimization calculations for fast reactor cores. The main purpose in producing this document was to provide a description of and user guides to the calculational methods, in English, as an aid to any future user of the calculational route who is (like the author) handicapped by a lack of literacy in Japanese. The document also provides for all users a compilation of information on the various parts of the calculational route, all in a single reference. In using the calculational route (to model Pu burning reactors) the author identified a number of areas where an improvement in the modelling of the standard calculational route was warranted. The document includes comments on and explanations of the modelling assumptions in the various calculations. Practical information on the use of the calculational route and the computer systems is also given. (J.P.N.)

  2. Expert System Design for Mode and Route Selection

    Directory of Open Access Journals (Sweden)

    Madhavi Dhingra

    2012-09-01

    Full Text Available Travelling from one place to other in the most convenient and time saving manner requires appropriate selection of route, as well as medium of transport. It is not easy to study all the factors that identify the best route between any two places like distance, availability of different modes of travel, time, comfort, etc. Also, there can be multiple connectivity of routes between any two places which are generally not shown if you consider any railway or airline booking search. Furthermore, even if the connecting routes are known, arriving at the best route taking into account all the factors can be tedious. This paper aims at developing an expert system incorporating all the factors and constraints as knowledgebase with specific purpose of getting the best routes as output.

  3. Modeling and Analysis of Source Management Routing Scheme for BGP

    Directory of Open Access Journals (Sweden)

    Shu Wang

    2010-05-01

    Full Text Available Source management routing scheme called SMR is a new approach that provides a backup routing path for BGP on AS-level. In SMR, each AS in the virtual ring just is defined by a node which owns a unique identifier. It is a novel way to integrate some physical topology into virtual topology to shorten the routes greatly. And then, we present a theoretical model of virtual ring SMR to describe the routing mechanism and the impacts on the routing performance. We evaluate the performance of SMR by simulations on a real BGP topology. In the case of each AS only maintaining a route to one virtual neighbor, virtual ring SMR still provides a path to destination with low overhead. Furthermore, our theoretical model fit the process of SMR well, and provides the insight for us to improve the virtual ring SMR.

  4. Memoryless Routing in Convex Subdivisions: Random Walks are Optimal

    CERN Document Server

    Chen, Dan; Dujmovic, Vida; Morin, Pat

    2009-01-01

    A memoryless routing algorithm is one in which the decision about the next edge on the route to a vertex t for a packet currently located at vertex v is made based only on the coordinates of v, t, and the neighbourhood, N(v), of v. The current paper explores the limitations of such algorithms by showing that, for any (randomized) memoryless routing algorithm A, there exists a convex subdivision on which A takes Omega(n^2) expected time to route a message between some pair of vertices. Since this lower bound is matched by a random walk, this result implies that the geometric information available in convex subdivisions is not helpful for this class of routing algorithms. The current paper also shows the existence of triangulations for which the Random-Compass algorithm proposed by Bose etal (2002,2004) requires 2^{\\Omega(n)} time to route between some pair of vertices.

  5. Pheromone-Based Ant Routing System for IP Networks

    Institute of Scientific and Technical Information of China (English)

    张林; 任勇; 山秀明

    2004-01-01

    The pheromone-based ant routing algorithm is a distributed routing algorithm with good scalability and robustness. A 2-D cellular automata (CA) model of the computer network was presented to analyze the algorithm. The results show that the procedure of establishing a stable route is self-organized towards the attractive peculiar state, and the duration of time for the routing establishment is power-law distributed. A practical ant routing protocol over an IP network was also presented, and two simulations were done to compare the performance dynamic and the load balancing performance between this protocol and the open shortest path first (OSPF) protocol. The results show that the ant routing protocol out-performs OSPF in these aspects.

  6. Evaluation of Flood Routing Techniques for Incremental Damage Assessment

    OpenAIRE

    Jayyousi, Enan Fakhri

    1994-01-01

    Incremental damage assessment is a tool used to assess the justification for expensive modifications of inadequate dams. The input data to incremental damage assessment are the output from the breach analysis and flood routing. For this reason, flood routing should be conducted carefully. Distorted results from the flood routing technique or unstable modeling of the problem will distort the results of an incremental damage assessment, because an error in the estimated incremental stage will c...

  7. An Improved Directed Diffusion Protocol based on Opportunistic Routing

    OpenAIRE

    Yi Xu; Yixian Yang; Yang Xin; Hongliang Zhu

    2014-01-01

    Researchers are paying more and more attention to the application of wireless sensor networks (WSNs), where routing is one of the vital techniques. An advanced Directed Diffusion protocol, named DDOR, is presented in this paper based on Opportunistic Routing to improve the disadvantage of mono-forwarder of traditional routing protocol. Packet head has been modified in order to implement a forwarder list in DDOR. Instead of fixed next-hop forwarding in transmission, DDOR selects the optimal no...

  8. LBR: Load Balancing Routing Algorithm for Wireless Sensor Networks

    Science.gov (United States)

    Daabaj, Khaled; Dixon, Mike; Koziniec, Terry

    2010-06-01

    Homogeneous wireless sensor networks (WSNs) are organized using identical sensor nodes, but the nature of WSNs operations results in an imbalanced workload on gateway sensor nodes which may lead to a hot-spot or routing hole problem. The routing hole problem can be considered as a natural result of the tree-based routing schemes that are widely used in WSNs, where all nodes construct a multi-hop routing tree to a centralized root, e.g., a gateway or base station. For example, sensor nodes on the routing path and closer to the base station deplete their own energy faster than other nodes, or sensor nodes with the best link state to the base station are overloaded with traffic from the rest of the network and experience a faster energy depletion rate than their peers. Routing protocols for WSNs are reliability-oriented and their use of reliability metric to avoid unreliable links makes the routing scheme worse. However, none of these reliability oriented routing protocols explicitly uses load balancing in their routing schemes. Since improving network lifetime is a fundamental challenge of WSNs, we present, in this chapter, a novel, energy-wise, load balancing routing (LBR) algorithm that addresses load balancing in an energy efficient manner by maintaining a reliable set of parent nodes. This allows sensor nodes to quickly find a new parent upon parent loss due to the existing of node failure or energy hole. The proposed routing algorithm is tested using simulations and the results demonstrate that it outperforms the MultiHopLQI reliability based routing algorithm.

  9. Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network

    OpenAIRE

    Sridharan D; Neelavathy Pari.S; Kalaiarasi.R; Sara, Getsy S.

    2010-01-01

    A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes a novel hybrid multipath routing algorithm with an efficien...

  10. Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

    OpenAIRE

    2015-01-01

    Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the ...

  11. An Overlapping Clustering Approach for Routing in Wireless Sensor Networks

    OpenAIRE

    Zhenquan Qin; Can Ma; Lei Wang; Jiaqi Xu; Bingxian Lu

    2013-01-01

    The design and analysis of routing algorithm is an important issue in wireless sensor networks (WSNs). Most traditional geographical routing algorithms cannot achieve good performance in duty-cycled networks. In this paper, we propose a k-connected overlapping clustering approach with energy awareness, namely, k-OCHE, for routing in WSNs. The basic idea of this approach is to select a cluster head by energy availability (EA) status. The k-OCHE scheme adopts a sleep scheduling strategy of CKN,...

  12. The influence of advertisements on the conspicuity of routing information

    OpenAIRE

    Boersema, T.; Zwaga, H.J.G.

    1985-01-01

    An experiment is described in which the influence of advertisements on the conspicuity of routing information was investigated. Stimulus material consisted of colour slides of 12 railway station scenes. In two of these scenes, number and size of advertisements were systematically varied. Subjects were instructed to locate routing signs in the scenes. Performance on the location task was used as a measure of the routing sign conspicuity. The results show that inserting an advertisement lessens...

  13. Security Analysis of Routing Protocols in Wireless Sensor Networks

    OpenAIRE

    Mohammad Sadeghi; Farshad Khosravi; Kayvan Atefi; Mehdi Barati

    2012-01-01

    In this paper, I describe briefly some of the different types of attacks on wireless sensor networks such as Sybil, HELLO, Wormhole and Sinkhole attacks. Then I describe security analysis of some major routing protocols in wireless sensor network such as Directed Diffusion, TinyOS beaconing, geographic and Rumor routings in term of attacks and security goals. As a result I explain some secure routing protocols for wireless sensor network and is discussed briefly some methods and policy of the...

  14. Routing-based Synthesis of Digital Microfluidic Biochips

    DEFF Research Database (Denmark)

    Maftei, Elena; Pop, Paul; Madsen, Jan

    2010-01-01

    the concept of virtual modules and allow the droplets to move on the chip on any route during operation execution. Thus, the synthesis problem is transformed into a routing problem. We propose an approach derived from a Greedy Randomized Adaptive Search Procedure (GRASP) and we show that by considering...... routing-based synthesis, significant improvements can be obtained in the application completion time. The proposed heuristic has been evaluated using two real-life case studies and ten synthetic benchmarks....

  15. IMPLEMENTATION OF ADAPTIVE ZONE ROUTING PROTOCOL FOR WIRELESS NETWORKS

    OpenAIRE

    T. RAVI NAYAK; SAKE. POTHALAIAH; Dr. K ASHOK BABU

    2010-01-01

    Mobile Ad hoc wireless Networks (MANETs) that do not need any fixed infrastructure. They are characterized by dynamic topology due to node mobility, limited channel bandwidth, and limited battery power of nodes. The key challenge in the design of ad hoc networks is the development of dynamic routing protocols that can efficiently findroutes between two communicating nodes. Thus, many ad hoc routing protocols have been proposed in recent years. All these routing protocols attempt to provide a ...

  16. Medication wrong route administration: a poisons center-based study

    OpenAIRE

    Bloch-Teitelbaum, Alexandra; Lüde, Saskia; Rauber-Lüthy, Christine; Kupferschmidt, Hugo; Russmann, Stefan; Kullak-Ublick, Gerd A.; Ceschi, Alessandro

    2013-01-01

    OBJECTIVES: To describe clinical effects, circumstances of occurrence, management and outcomes of cases of inadvertent administration of medications by an incorrect parenteral route. METHODS: Retrospective single-center consecutive review of parenteral route errors of medications, reported to our center between January 2006 and June 2010. We collected demographic data and information on medications, route and time of administration, severity of symptoms/signs, treatment, and outcome. RE...

  17. BALANCE ROUTING TRAFFIC IN GENERALIZED SHUFFLE-EXCHANGE NETWORK

    Institute of Scientific and Technical Information of China (English)

    Chen Zhen; Liu Zengji; Qiu Zhiliang; Chen Peng; Tao Xiaoming

    2005-01-01

    A methodology is proposed to handle problem that under equiproble address of packet traffic at the input port, Generalized Shuffle-Exchange Network (GSEN) routes traffic unevenly because of the unbalanced routing tags. The idea is to use routing tag according to probability, which can be evaluated by using Moore-Penrose inverse in matrix analysis. An instance is used to illustrate the idea, and the simulation is done to show the improvement in performance issues.

  18. A measurement study of BGP Blackhole routing performance

    OpenAIRE

    Stamatelatos, Nikolaos

    2006-01-01

    Approved for public release, distribution unlimited BGP Blackhole routing is a mechanism used to protect networks from DDoS attacks. During the last several years, a number of variations of BGP Blackhole routing have been proposed. However, even though these methods have been used by many organizations and ISPs for some years, the academic community has provided only a limited evaluation of BGP Blackhole routing, using mainly network simulations. The objective of this research was to evalu...

  19. Implementation and Experimental Evaluation of Wireless Ad hoc Routing Protocols

    OpenAIRE

    Lundgren, Henrik

    2005-01-01

    A wireless ad hoc network consists of a number of mobile nodes that temporarily form a dynamic infrastructure-less network. New routing protocols that can adapt to the frequent topology changes induced by node mobility and varying link qualities are needed. During the last decade dozens of different ad hoc routing protocols have been proposed, optimized and partially compared, mainly through simulation studies. This thesis takes an experimental approach to the evaluation of ad hoc routing pro...

  20. ZERO: Probabilistic Routing for Deploy and Forget Wireless Sensor Networks

    OpenAIRE

    Jose Carlos Pacho; Xavier Vilajosana; Jose Lopez Vicario; Juan, Angel A.; Ignasi Vilajosana; Antoni Morell; Jordi Llosa

    2010-01-01

    As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols route data through most reliable links aiming to ensure 99% packet delivery. However, they suffer from t...

  1. Urban sidewalks: visualization and routing for individuals with limited mobility

    OpenAIRE

    Bolten, Nicholas; Amini, Amirhossein; Hao, Yun; Ravichandran, Vaishnavi; Stephens, Andre; Caspi, Anat

    2016-01-01

    People with limited mobility in the U.S. (defined as having difficulty or inability to walk a quarter of a mile without help and without the use of special equipment) face a growing informational gap: while pedestrian routing algorithms are getting faster and more informative, planning a route with a wheeled device in urban centers is very difficult due to lack of integrated pertinent information regarding accessibility along the route. Moreover, reducing access to street-spaces translates to...

  2. Non DTN Geographic Routing Protocols for Vehicular Ad Hoc Networks

    OpenAIRE

    Ramin Karimi; Norafida Ithnin; Shukor Abd Razak; Sara Najafzadeh

    2011-01-01

    Vehicular Ad Hoc Networks are highly mobile wireless ad hoc networks. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Geographic routing protocols are becoming popular due to advancement and availability of GPS devices. In this paper, we review the existing non DTN Geographic Routing Protocols for VANETs and also provide a qualitative comparison of them.

  3. Performance Evaluation of the WSN Routing Protocols Scalability

    Directory of Open Access Journals (Sweden)

    L. Alazzawi

    2008-01-01

    Full Text Available Scalability is an important factor in designing an efficient routing protocol for wireless sensor networks (WSNs. A good routing protocol has to be scalable and adaptive to the changes in the network topology. Thus scalable protocol should perform well as the network grows larger or as the workload increases. In this paper, routing protocols for wireless sensor networks are simulated and their performances are evaluated to determine their capability for supporting network scalability.

  4. The costs and benefits of different initial teacher training routes

    OpenAIRE

    Allen, Rebecca; Belfield, Chris; Greaves, Ellen; Sharp, Caroline; Walker, Matt

    2014-01-01

    This report provides the first evidence of the relative cost-effectiveness of different routes into teaching in England, describing and empirically estimating the costs and benefits of different routes into teaching while accounting, as far as possible, for the selection of teachers with different characteristics into each route. Our specific research questions are grouped into three strands: recruitment, training and retention. This report summarises our findings for the first two strands: t...

  5. A Comparative Study of Various Routing Protocols in VANET

    OpenAIRE

    Kumar, Rakesh; Dave, Mayank

    2011-01-01

    Vehicular Ad Hoc Networks (VANET) is a subclass of Mobile ad hoc networks which provides a distinguished approach for Intelligent Transport System (ITS). The survey of routing protocols in VANET is important and necessary for smart ITS. This paper discusses the advantages / disadvantages and the applications of various routing protocols for vehicular ad hoc networks. It explores the motivation behind the designed, and traces the evolution of these routing protocols. F inally the paper conclud...

  6. Research on routing algorithm based on the VANET

    OpenAIRE

    An, Li; Zhao Yong Mei; Xie Peng; Wang Qiong

    2016-01-01

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

  7. A Comparative Study of Various Routing Protocols in VANET

    OpenAIRE

    Rakesh Kumar; Mayank Dave

    2011-01-01

    Vehicular Ad Hoc Networks (VANET) is a subclass of Mobile ad hoc networks which provides a distinguished approach for Intelligent Transport System (ITS). The survey of routing protocols in VANET is important and necessary for smart ITS. This paper discusses the advantages / disadvantages and the applications of various routing protocols for vehicular ad hoc networks. It explores the motivation behind the designed, and traces the evolution of these routing protocols. Finally the paper conclude...

  8. Distributed Decision Making in Combined Vehicle Routing and Break Scheduling

    OpenAIRE

    Meyer, Christoph Manuel; Kopfer, Herbert; Kok, Adrianus Leendert; Schutten, Marco

    2009-01-01

    The problem of combined vehicle routing and break scheduling comprises three subproblems: clustering of customer requests, routing of vehicles, and break scheduling. In practice, these subproblems are usually solved in the interaction between planners and drivers. We consider the case that the planner performs the clustering and the drivers perform the routing and break scheduling. To analyze this problem, we embed it into the framework of distributed decision making proposed by Schneeweiss (...

  9. Geocasting and Multicasting Routing Operation in Mobile Ad Hoc Network

    OpenAIRE

    R.Kruthika

    2013-01-01

    The paper considers, the different multicasting routing protocols in wireless mobile Ad hoc network (MANET).An Ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure .In this environment routing/multicasting protocols are faced with the challenge of producing multihop router under host mobility and band constraints. Various approaches and routing protocol have been proposed to address Ad hoc networking problems and multiple standardization effort wit...

  10. Traffic modifications on Routes Rutherford, Democrite and Fermi

    CERN Multimedia

    2015-01-01

    The GS Department would like to inform you that, until the end of December, the construction of Building 245 will result in the following traffic modifications: Traffic on Route Rutherford will be partially restricted in front of the construction site, Traffic on Route Democrite will be one-way towards Route Rutherford. Also, please note that due to construction work in front of Building 377, Route Fermi will be closed from Wednesday, 10 June until Friday, 7 August. Thank you for your understanding.

  11. Improved ZigBee Network Routing Algorithm Based on LEACH

    Science.gov (United States)

    Zhao, Yawei; Zhang, Guohua; Xia, Zhongwu; Li, Xinhua

    Energy efficiency design of routing protocol is a kind of the key technologies used to wireless sensor networks. The paper introduces the ZigBee technology, summarizes the current transmitting routing model in wireless sensor networks, and finds that the traditional LEACH protocol can lead to overload of some cluster head nodes. The paper suggested that the existing LEACH agreement was improved and the new algorithm was better than traditional LEACH routing algorithm by the comprasion of simulation. The improved routing algorithm can prolong the networks lifetime and effectively save the scarce energy.

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

  13. DNA display I. Sequence-encoded routing of DNA populations.

    Directory of Open Access Journals (Sweden)

    David R Halpin

    2004-07-01

    Full Text Available Recently reported technologies for DNA-directed organic synthesis and for DNA computing rely on routing DNA populations through complex networks. The reduction of these ideas to practice has been limited by a lack of practical experimental tools. Here we describe a modular design for DNA routing genes, and routing machinery made from oligonucleotides and commercially available chromatography resins. The routing machinery partitions nanomole quantities of DNA into physically distinct subpools based on sequence. Partitioning steps can be iterated indefinitely, with worst-case yields of 85% per step. These techniques facilitate DNA-programmed chemical synthesis, and thus enable a materials biology that could revolutionize drug discovery.

  14. Influence of queue propagation and dissipation on route travel times

    DEFF Research Database (Denmark)

    Raovic, Nevena

    classes into account (Bliemer, 2008). Yperman (2007) indicates that there is a significant difference in queue-propagation and queue-dissipation between the LTM and DQM. This results in different route travel times, and can further affect route choice. In this paper, different approaches to represent...... queue propagation and dissipation through the CTM, LTM and DQM are studied. A simple network allows to show how these approaches influence route travel time. Furthermore, the possibility of changing the existing DQM is considered in order to more realistically represent queue propagation and dissipation......, which would lead to more accurate route travel times....

  15. Lessons learned by southern states in designating alternative routes

    International Nuclear Information System (INIS)

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

  16. Secure Data Collection in Wireless Sensor Networks Using Randomized Routes

    Directory of Open Access Journals (Sweden)

    A.Vijay Kumar

    2011-08-01

    Full Text Available Among the various possible threats in the WSN’s, like node failure, data security, etc., we are presenting this paper in order to circumvent or overcome the ‘blackholes’ that are formed due to compromised-node (CN and denial-of-service (Denial of service by using some routing mechanisms. Basic idea of developing this paper is nothing but combat the vulnerability of existing system in handling such attacks due to their deterministic nature i.e., once an obstructionist can gather or acquire the routing algorithm can figure out the same routes known to the source, and hence intimidate all information sent over these routes. We have developed a structure that generates randomized routes. Under this design the routes taken by the “shares” of different packets change over time to time increasing the probability of randomness of paths to be selected for transferring the information. Therefore, even though adversary or offender comes to know about the routing algorithm still he cannot pinpoint the routes in where each packet is traversed randomly. Apart from randomness, the routes that are generated by our mechanisms are energy efficient as well as dispersive which ultimately make them capable of circumventing the blackholes at less energy cost. Extensive frameworks are conducted to verify the validity of our mechanisms.

  17. a Genetic Algorithm for Urban Transit Routing Problem

    Science.gov (United States)

    Chew, Joanne Suk Chun; Lee, Lai Soon

    The Urban Transit Routing Problem (UTRP) involves solving a set of transit route networks, which proved to be a highly complex multi-constrained problem. In this study, a bus route network to find an efficient network to meet customer demands given information on link travel times is considered. An evolutionary optimization technique, called Genetic Algorithm is proposed to solve the UTRP. The main objective is to minimize the passenger costs where the quality of the route sets is evaluated by a set of parameters. Initial computational experiments show that the proposed algorithm performs better than the benchmark results for Mandl's problems.

  18. Trustworthy Robust Routing Protocol for Mobile Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    E.Venkat Reddy

    2010-02-01

    Full Text Available A protocol called RMP (Route Management Protocol is proposed; for making misbehavior effect eliminated on Adhoc network is proposed. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing andforwarding behavior of other nodes. The implementation of this rotocol is made on the network layer based on the Dynamic Source Routing (DSR protocol. We present a performance analysis of DSR fortified by RMP and compare it to regular defenseless DSR. A network with RMP is observed to improve about 60% of misbehaving nodes in the network, in contrast to a defenseless network.

  19. Network parameters awareness for routing discovery in autonomic optical Internet

    Institute of Scientific and Technical Information of China (English)

    JIN Jin; WANG Hong-xiang; JI Yue-feng

    2009-01-01

    The article proposes a network parameter-awareness (NPA) method and applies it to routing discovery algorithms in autonomic optical Internet. This NPA method can perceive the main parameters of the network, such as delay, jitter and traffic, which can represent the current situation of the network. And these parameters enable network to determine the appropriate nodes for routing discovery. The simulation results of evaluating performance of a network with NPA method and its routing applications show that the method and its applications in routing improve the performance of the network significantly with quality of service (QoS) guaranteed.

  20. Advanced Algorithms for Local Routing Strategy on Complex Networks

    Science.gov (United States)

    Lin, Benchuan; Chen, Bokui; Gao, Yachun; Tse, Chi K.; Dong, Chuanfei; Miao, Lixin; Wang, Binghong

    2016-01-01

    Despite the significant improvement on network performance provided by global routing strategies, their applications are still limited to small-scale networks, due to the need for acquiring global information of the network which grows and changes rapidly with time. Local routing strategies, however, need much less local information, though their transmission efficiency and network capacity are much lower than that of global routing strategies. In view of this, three algorithms are proposed and a thorough investigation is conducted in this paper. These algorithms include a node duplication avoidance algorithm, a next-nearest-neighbor algorithm and a restrictive queue length algorithm. After applying them to typical local routing strategies, the critical generation rate of information packets Rc increases by over ten-fold and the average transmission time 〈T〉 decreases by 70–90 percent, both of which are key physical quantities to assess the efficiency of routing strategies on complex networks. More importantly, in comparison with global routing strategies, the improved local routing strategies can yield better network performance under certain circumstances. This is a revolutionary leap for communication networks, because local routing strategy enjoys great superiority over global routing strategy not only in terms of the reduction of computational expense, but also in terms of the flexibility of implementation, especially for large-scale networks. PMID:27434502

  1. A Performance Analysis Between AODV & DSR Routing Protocol

    OpenAIRE

    Sankalp Bahadur Singh; Bharat Pesswani

    2012-01-01

    Mobile ad hoc network (MANET) is an autonomous system of mobile nodes connected by wireless links. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new ro...

  2. A Comparative Study of Various Routing Protocols in VANET

    CERN Document Server

    Kumar, Rakesh

    2011-01-01

    Vehicular Ad Hoc Networks (VANET) is a subclass of Mobile ad hoc networks which provides a distinguished approach for Intelligent Transport System (ITS). The survey of routing protocols in VANET is important and necessary for smart ITS. This paper discusses the advantages / disadvantages and the applications of various routing protocols for vehicular ad hoc networks. It explores the motivation behind the designed, and traces the evolution of these routing protocols. F inally the paper concludes by a tabular comparison of the various routing protocols for VANET.

  3. OSPF-TE Extensions for Green Routing in Optical Networks

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Ricciardi, S.; Fagertun, Anna Manolova;

    2012-01-01

    This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing.......This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing....

  4. Evaluating Wireless Proactive Routing Protocols under Scalability and Traffic Constraints

    CERN Document Server

    Javaid, N; Khan, Z A; Khan, U; Djouani, K

    2012-01-01

    In this paper, we evaluate and analyze the impact of different network loads and varying no. of nodes on distance vector and link state routing algorithms. We select three well known proactive protocols; Destination Sequenced Distance Vector (DSDV) operates on distance vector routing, while Fisheye State Routing (FSR) and Optimized Link State Routing (OLSR) protocols are based on link state routing. Further, we evaluate and compare the effects on the performance of protocols by changing the routing strategies of routing algorithms. We also enhance selected protocols to achieve high performance. We take throughput, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) as performance metrics for evaluation and comparison of chosen protocols both with default and enhanced versions. Based upon extensive simulations in NS-2, we compare and discuss performance trade-offs of the protocols, i.e., how a protocol achieves high packet delivery by paying some cost in the form of increased E2ED and/or routing overhead...

  5. Gossip Based Routing Protocol Design for Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Toqeer Mahmood

    2012-01-01

    Full Text Available A spontaneously mannered decentralized network with no formal infrastructure and limited in temporal and spatial extent where each node communicate with each other over a wireless channel and is willing to forward data for other nodes is called as Wireless Ad Hoc network. In this research study, we proposed a routing strategy based on gossip based routing approach that follows the proactive routing with some treatment for wireless Ad Hoc network. The analytical verification of our proposed idea shows that it is a better approach based on gossip routing.

  6. Routing Physarum with electrical flow/current

    CERN Document Server

    Tsuda, Soichiro; Adamatzky, Andrew; Mills, Jonathan

    2012-01-01

    Plasmodium stage of Physarum polycephalum behaves as a distributed dynamical pattern formation mechanism who's foraging and migration is influenced by local stimuli from a wide range of attractants and repellents. Complex protoplasmic tube network structures are formed as a result, which serve as efficient `circuits' by which nutrients are distributed to all parts of the organism. We investigate whether this `bottom-up' circuit routing method may be harnessed in a controllable manner as a possible alternative to conventional template-based circuit design. We interfaced the plasmodium of Physarum polycephalum to the planar surface of the spatially represented computing device, (Mills' Extended Analog Computer, or EAC), implemented as a sheet of analog computing material whose behaviour is input and read by a regular 5x5 array of electrodes. We presented a pattern of current distribution to the array and found that we were able to select the directional migration of the plasmodium growth front by exploiting pla...

  7. Soft chemical routes to semiconductor nanostructures

    Indian Academy of Sciences (India)

    Ujjal K Gautam; Kripsindhu Sardar; F L Deepak; C N R Rao

    2005-10-01

    Soft chemistry has emerged as an important means of generating nanocrystals, nanowires and other nanostructures of semiconducting materials. We describe the synthesis of CdS and other metal chalcogenide nanocrystals by a solvothermal route. We also describe the synthesis of nanocrystals of AlN, GaN and InN by the reaction of hexamethyldisilazane with the corresponding metal chloride or metal cupferronate under solvothermal conditions. Nanowires of Se and Te have been obtained by a self-seeding solution-based method. A single source precursor based on urea complexes of metal chlorides gives rise to metal nitride nanocrystals, nanowires and nanotubes. The liquid-liquid interface provides an excellent medium for preparing single-crystalline films of metal chalcogenides.

  8. Two Alternative Routes to MS2 Nanotubes

    Institute of Scientific and Technical Information of China (English)

    Yanqing LIU; Changsheng LI; Jinghai YANG; Zhong HUA; Junmao LI; Kehong YAN; Shuhuo ZHAO

    2007-01-01

    Inorganic tubular nanostructure MS2 (M=Mo, W, Nb, Ta) were synthesized by two alternative routes. Thermal decomposition method was used for producing fullerence-like MS2 (M=Mo, W) nanotubes on Al2O3 template using ammonium sulfur respectively; NbS2, and TaS2 nanotubes were obtained successfully by reducing corresponding metal trisulfide in a stream of H2 (mixed with N2 in some cases) at elevated temperatures.Detailed experimental procedure, and the characterization of associated results, were evaluated using X-ray diffraction (XRD), scanning electron microscopy (SEM), transmission electron microscopy (TEM) and high resolution transmission electron microscopy (HRTEM). The result reveals that products are composed of high density of MS2 tubular nanostructures with the diameter of 100 nm and length of tens of micrometers. And no mistake, these 1-D (one-dimensional) tubular nanomaterials added quantities and varieties in the growing family of nanotubes of inorganic layered materials.

  9. A new route to process diamond wires

    Directory of Open Access Journals (Sweden)

    Marcello Filgueira

    2003-06-01

    Full Text Available We propose an original route to process diamond wires, denominated In Situ Technology, whose fabrication involves mechanical conformation processes, such as rotary forging, copper tubes restacking, and thermal treatments, such as sintering and recrystallisation of a bronze 4 wt.% diamond composite. Tensile tests were performed, reaching an ultimate tensile strength (UTS of 230 MPa for the diameter of Æ = 1.84 mm. Scanning electron microscopy showed the diamond crystals distribution along the composite rope during its manufacture, as well as the diamond adhesion to the bronze matrix. Cutting tests were carried out with the processed wire, showing a probable performance 4 times higher than the diamond sawing discs, however its probable performance was about 5 to 8 times less than the conventional diamond wires (pearl system due to the low abrasion resistance of the bronze matrix, and low adhesion between the pair bronze-diamond due to the use of not metallised diamond single crystals.

  10. Pivot Routing Improves Wireless Sensor Networks Performance

    Directory of Open Access Journals (Sweden)

    Nancy El Rachkidy

    2012-06-01

    Full Text Available Nowadays, wireless sensor networks (WSNs are used in several applications such as environmental monitoring. When network size and data rate increase, congestion becomes as an important issue, especially when an emergency situation generates alarm messages in a specific area of the network. In this paper, we describe the pivot routing protocol named PiRAT, which avoids congested paths by using intermediate pivot nodes. Simulations show that PiRAT has better performance than previous protocols in terms of packet loss, end-to-end delay, congestion and node overload. Moreover, we show that the load-balancing ability of PiRAT allows it to benefit from nodes having independent low duty cycles.

  11. Hybrid Trust Model for Internet Routing

    CERN Document Server

    Rantala, Pekka; Isoaho, Jouni

    2011-01-01

    The current Internet is based on a fundamental assumption of reliability and good intent among actors in the network. Unfortunately, unreliable and malicious behaviour is becoming a major obstacle for Internet communication. In order to improve the trustworthiness and reliability of the network infrastructure, we propose a novel trust model to be incorporated into BGP routing. In our approach, trust model is defined by combining voting and recommendation to direct trust estimation for neighbour routers located in different autonomous systems. We illustrate the impact of our approach with cases that demonstrate the indication of distrusted paths beyond the nearest neighbours and the detection of a distrusted neighbour advertising a trusted path. We simulated the impact of weighting voted and direct trust in a rectangular grid of 15*15 nodes (autonomous systems) with a randomly connected topology.

  12. Catalytic routes from biomass to fuels

    DEFF Research Database (Denmark)

    Riisager, Anders

    2014-01-01

    The carbon-based chemicals and fuels that are necessary to meet the energy demand for our society originate presently almost exclusively from inexpensive fossil resources – coal, oil and natural gas. The forecast of diminishing and more expensive petroleum reserves has, however, engaged the...... chemical industry to find new feasible chemocatalytic routes to convert the components of lignocellulosic plant biomass (green biomass) as well as aquatic biomass (blue biomass) into potential platform chemicals that can replace the fossil based chemicals in order to leave the chemical supply and value...... chain unaffected. This presentation will survey the status of biofuels production from different sources, and discuss the sustainability of making transportation fuels from biomass. Furthermore, recently developed chemocatalytic technologies that allow efficient conversion of lignocellulosic biomass...

  13. Integrated Job Scheduling and Network Routing

    DEFF Research Database (Denmark)

    Gamst, Mette; Pisinger, David

    2013-01-01

    We consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number of...... resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine. The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be NP-hard. An exact solution approach using Dantzig......, interior point stabilization is used to decrease the number of columns generated in the branch-and-price algorithm. The algorithm is experimentally evaluated on job scheduling instances for a Grid network. The Dantzig- Wolfe algorithm with stabilization is clearly superior, being able to solve large...

  14. HYBRID TRUST MODEL FOR INTERNET ROUTING

    Directory of Open Access Journals (Sweden)

    Pekka Rantala

    2011-05-01

    Full Text Available The current Internet is based on a fundamental assumption of reliability and good intent among actors inthe network. Unfortunately, unreliable and malicious behaviour is becoming a major obstacle forInternet communication. In order to improve the trustworthiness and reliability of the networkinfrastructure, we propose a novel trust model to be incorporated into BGP routing. In our approach,trust model is defined by combining voting and recommendation to direct trust estimation for neighbourrouters located in different autonomous systems. We illustrate the impact of our approach with cases thatdemonstrate the indication of distrusted paths beyond the nearest neighbours and the detection of adistrusted neighbour advertising a trusted path. We simulated the impact of weighting voted and directtrust in a rectangular grid of 15*15 nodes (autonomous systems with a randomly connected topology.

  15. Adaptive Probabilistic Flooding for Multipath Routing

    CERN Document Server

    Betoule, Christophe; Clavier, Remi; Rossi, Dario; Rossini, Giuseppe; Thouenon, Gilles

    2011-01-01

    In this work, we develop a distributed source routing algorithm for topology discovery suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play control plane, able to find multiple paths toward the same destination, and introduce a novel algorithm, called adaptive probabilistic flooding, to achieve this goal. By keeping a small amount of state in routers taking part in the discovery process, our technique significantly limits the amount of control messages exchanged with flooding -- and, at the same time, it only minimally affects the quality of the discovered multiple path with respect to the optimal solution. Simple analytical bounds, confirmed by results gathered with extensive simulation on four realistic topologies, show our approach to be of high practical interest.

  16. Plasmonic Route to Reconfigurable Polarization Optics

    CERN Document Server

    Li, L; Tang, X M; Wang, S M; Wang, Q J; Zhu, S N

    2014-01-01

    Surface plasmon polariton (SPP) as a bounded mode on a metal/dielectric interface intrinsically has a definite transverse magnetic (TM) polarization that usually lacks further manipulations. However, the in-plane longitudinal components of SPP field can produce versatile polarization states when two orthogonal propagating SPP interfere with each other. Here, we demonstrated a plasmonic polarization router by designing appropriate nanohole arrays that can selectively scatter the interfered SPP fields to desired light beams. It is well proved that our device is able to reconfigure a certain input polarization to all kinds of states with respect to a scattered light. Accompanied with a composite phase modulation by diffractions, multiple focusing beams with different polarization states are simultaneously achieved, promising the possibility in polarization multiplexing and related signal processing. Our design offers a new route for achieving full control of the optical polarizations as well as the optical spin-...

  17. Analysis of the traffic running cost under random route choice behavior in a network with two routes

    Science.gov (United States)

    Tang, Tie-Qiao; Yu, Qiang; Liu, Kai

    2016-05-01

    In this paper, a car-following model is used to study each driver's three running costs in a network with two routes under the random route choice behavior. The numerical results indicate that each driver's three running costs and the corresponding total cost are relevant to the gap of the time the driver enters the network. The results can help us to further explore each driver's trip cost in a more complex network under other route choice behavior.

  18. Pressurized air supply device

    International Nuclear Information System (INIS)

    Ventilation air-conditioning facilities in a nuclear reactor building are adapted to suck clean external air not containing radioactivity through air supply filters disposed at an air intake port of the nuclear reactor building by means of an air supply blower and then supply the sucked air through an air supply duct and an air supply port to the inside of the power plant. Futher, pipeways for supplying sucked air to a compressor is branched from the air supply duct, through which air is supplied to an air compressor for instrumentation and an air compressor used in the power plant. The air sucked and compressed in the air compressor for instrumentation is further supplied by way of pipeways for supplying air for instrumentation to air-actuated valves, instruments, etc. Further, air sucked and compressed in the air compressor used in the power plant is further supplied by way of air supply pipeways for the power plant to a reservoir, air mask, etc. By supplying clean compressed air in this way, operators exposure dose can be reduced. (T.M.)

  19. The Effects of Shared Information on Pilot-Controller Situation Awareness And Re-Route Negotiation

    Science.gov (United States)

    Farley, Todd C.; Hansman, R. John; Endsley, Mica R.; Amonlirdviman, Keith

    1999-01-01

    The effect of shared information is assessed in terms of pilot-controller negotiating behavior and shared situation awareness. Pilot goals and situation awareness requirements are developed and compared against those of air traffic controllers to identify areas of common and competing interest. An exploratory, part-task simulator experiment is described which evaluates the extent to which shared information may lead pilots and controllers to cooperate or compete when negotiating route amendments. Results are presented which indicate that shared information enhances situation awareness and can engender more collaborative interaction between pilots and air traffic controllers. Furthermore, the value of providing controllers with a good-quality weather overlay on their plan view displays is demonstrated. Observed improvements in situation awareness and separation assurance are discussed.

  20. CulRoute: Gamified WebGIS3D platform for selection of touristic routes

    Directory of Open Access Journals (Sweden)

    E.P.L. Baptista

    2015-11-01

    Full Text Available The importance of tourist information disclosure on digital platforms is, nowadays, reinforced by public entities such as Turismo de Portugal and Turismo do Algarve. The incorporation of strategies to encourage greater interest and involvement of the users are likely to contribute to a more effective dissemination of tourist destinations and their historical and cultural heritage. This paper presents the concepts, strategies and technologies in the design and implementation of the gamified WebGIS3D platform named CulRoute. This platform enables the users to visualize and navigate the three-dimensional virtual models of monuments and to explore the 'treasures' of each monument in a gaming environment, as well as to test their knowledge by answering optional quizzes. From the list of visited monuments and other information available on the platform, the user can create customized routes, save them into files or print as maps for later use.

  1. Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies

    CERN Document Server

    Chen, Phoebus; Balister, Paul; Bollobás, Béla; Sastry, Shankar

    2011-01-01

    Several emerging classes of applications that run over wireless networks have a need for mathematical models and tools to systematically characterize the reliability of the network. We propose two metrics for measuring the reliability of wireless mesh routing topologies, one for flooding and one for unicast routing. The Flooding Path Probability (FPP) metric measures the end-to-end packet delivery probability when each node broadcasts a packet after hearing from all its upstream neighbors. The Unicast Retransmission Flow (URF) metric measures the end-to-end packet delivery probability when a relay node retransmits a unicast packet on its outgoing links until it receives an acknowledgement or it tries all the links. Both metrics rely on specific packet forwarding models, rather than heuristics, to derive explicit expressions of the end-to-end packet delivery probability from individual link probabilities and the underlying connectivity graph. We also propose a distributed, greedy algorithm that uses the URF me...

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

  3. Air movement and perceived air quality

    DEFF Research Database (Denmark)

    Melikov, Arsen Krikor; Kaczmarczyk, J.

    2012-01-01

    The impact of air movement on perceived air quality (PAQ) and sick building syndrome (SBS) symptoms was studied. In total, 124 human subjects participated in four series of experiments performed in climate chambers at different combinations of room air temperature (20, 23, 26 and 28 °C), relative...... humidity (30, 40 and 70%) and pollution level (low and high). Most of the experiments were performed with and without facially applied airflow at elevated velocity. The importance of the use of recirculated room air and clean, cool and dry outdoor air was studied. The exposures ranged from 60. min to 235....... min. Acceptability of PAQ and freshness of the air improved when air movement was applied. The elevated air movement diminished the negative impact of increased air temperature, relative humidity and pollution level on PAQ. The degree of improvement depended on the pollution level, the temperature and...

  4. Reduction of the air traffic's contribution to climate change: A REACT4C case study

    OpenAIRE

    Grewe, V; Champougny, T.; Matthes, Sigrun; Frömming, Christine; Brinkop, Sabine; Soevde, Amund; Irvine, Emma A.; Halscheidt, Lucia

    2014-01-01

    Air traffic alters the atmospheric composition and thereby contributes to climate change. Here we investigate the trans-Atlantic air traffic for one specific winter day and analyse, which routing changes were required to achieve a reduction in the air traffic’s contribution to climate change. We have applied an atmosphere-chemistry model to calculate so-called five dimensional climate cost functions (CCF), which describe the climate effect of a locally confined emission. The five dimensions r...

  5. IMPACT OF INFORMATION ON THE DELIVERY OF CARGO WITH AIR TRANSPORT

    OpenAIRE

    Габріелова, Т.Ю.; National Aviation University; Войцеховський, В.С.; National Aviation University

    2014-01-01

    Peculiarities of the impact of informatization on the process of cargo delivery involving air transport under conditions of competitive environment dynamic development have been considered. Information products providing uploading capacity on an extensive air route network were analysed. The role of international mediation bodies for financial settlements between participants of air transportation process was determined. Basic aspects of the pricing control depending on the condition of fligh...

  6. Determination of Sulphur Dioxide Concentrations in Ambient Air of Some Selected Traffic Areas in Kaduna Metropolis

    OpenAIRE

    Mohammed, Y.; A. Uzairu; J.O. Ujoh

    2013-01-01

    This research study was aimed at determining concentrations of sulphurdioxide in ambient air of some selected areas viz: industrial area (Kakuri), high vehicler traffic/commercial area (Leventis Roundabout), traveling route (Kawo overhead bridge), Low vehicler traffic area (Tafawa Balewa Roundabout), residential area (Kawo New Extension) and a control site (NFA base) in Kaduna metropolis Nigeria. Air sample was collected at each sampling site by passing ambient air through an impinger bottle ...

  7. Human exposures to volatile halogenated organic chemicals in indoor and outdoor air.

    OpenAIRE

    Andelman, J B

    1985-01-01

    Volatile halogenated organic chemicals are found in indoor and outdoor air, often at concentrations substantially above those in remote, unpopulated areas. The outdoor ambient concentrations vary considerably among sampling stations throughout the United States, as well as diurnally and daily. The vapor pressures and air-water equilibrium (Henry's Law) constants of these chemicals influence considerably the likely relative human exposures for the air and water routes. Volatilization of chemic...

  8. A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem

    Directory of Open Access Journals (Sweden)

    Pop Petrica

    2011-01-01

    Full Text Available Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc. These generalized problems typically belong to the class of NP-complete problems; they are harder than the classical ones, and nowadays are intensively studied due to their interesting properties and applications in the real world. Because of the complexity of finding the optimal or near-optimal solution in case of the generalized combinatorial optimization problems, great effort has been made, by many researchers, to develop efficient ways of their transformation into classical corresponding variants. We present in this paper an efficient way of transforming the generalized vehicle routing problem into the vehicle routing problem, and a new integer programming formulation of the problem.

  9. Optimization of the imported air express cargo distribution problem

    Directory of Open Access Journals (Sweden)

    Hwang, T.L.

    2013-03-01

    Full Text Available This study examines the delivering network of imported air express cargo as an integrated multi-depot vehicle routing problem. Integrated multi-depot vehicle routing problem attempts to decide which service centers should be used and how much freight should be unloaded in each service center. The role of an exchange point which is allowing the delivery vans and shuttles to exchange imported and exported goods is also addressed. Test results demonstrate the feasibility of the four models so these are highly promising for use in a diverse array of applications, such as in home delivery and reverse logistics.

  10. Air filtration and indoor air quality

    DEFF Research Database (Denmark)

    Bekö, Gabriel

    decent ventilation and air cleaning/air filtration, high indoor air quality cannot be accomplished. The need for effective air filtration has increased with increasing evidence on the hazardous effects of fine particles. Moreover, the air contains gaseous pollutants, removal of which requires various air...... contradictions should motivate manufacturers and researchers to develop new efficient filtration techniques and/or improve the existing ones. Development of low polluting filtration techniques, which are at the same time easy and inexpensive to maintain is the way forward in the future....

  11. 76 FR 43477 - Debit Card Interchange Fees and Routing

    Science.gov (United States)

    2011-07-20

    ... July 20, 2011 Part III Federal Reserve System 12 CFR Part 235 Debit Card Interchange Fees and Routing... Regulations#0;#0; ] FEDERAL RESERVE SYSTEM 12 CFR Part 235 RIN 7100-AD 63 Debit Card Interchange Fees and... in Regulation II (Debit Card Interchange Fees and Routing) adopted in accordance with Section...

  12. ENERGY AWARE ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORK

    OpenAIRE

    Barani, S.; Dr. C. Gomathy

    2011-01-01

    Technological advancements made major research challenges in the area of wireless sensor network. Power saving is the foremost criteria in this field. Consumption of energy is considerably reduced on properly designed protocol. This paper focuses on energy aware fuzzy based routing protocol. Protocol based on fuzzy logic computation reduces power consumption by the ratio of 10 when compared to classical routing protocol.

  13. Topographies of the Kasbah Route: Hardening of a heritage trail

    NARCIS (Netherlands)

    Wagner, L.B.; Minca, C.

    2015-01-01

    In 1932, the Tourism Syndicate of the French Protectorate government in Morocco published a guidebook for French tourists to follow the ‘Route des Kasbas’ through southern Morocco. The trajectory described is still in many ways reproduced by contemporary guiding materials, delineating specific route

  14. Algorithm for Route Planning with Multiple Intermediate Destinations

    Science.gov (United States)

    Mainali, Manoj Kanta; Mabu, Shingo; Hirasawa, Kotaro

    The optimal route recommendation in navigation systems is often considered to be the optimal route recommendation between two locations, i.e., an origin and a destination. However, in practical scenarios, traveling to several intermediate destinations before the final destination needs to be considered. Conventional route search algorithms cannot consider such restrictions in the route search. In this paper, a method to find the optimal route via several intermediate destinations is proposed. The proposed method is divided into three steps. In the first step, the conventional route search algorithm is used to find the optimal traveling time and optimal route among the origin, intermediate destinations and final destination. In the second step, the visiting order of the intermediate destination is optimized using the population based RasID-D (RasID-DP) to minimize the total traveling time. Finally, the optimal route from the origin to destination is determined based on the results of the previous steps. The proposed method is evaluated based on the efficiency of the optimization of the visiting order of intermediate destinations. Simulation results show that RasID-DP based optimization can find better solutions efficiently.

  15. Performance Comparison of Routing Attacks in Manet and WSN

    Directory of Open Access Journals (Sweden)

    Shyamala Ramachandran

    2012-08-01

    Full Text Available Routing is a basic step for data exchange. In wirel ess ad-hoc networks each node acts as a router and executes a routing protocol. Wireless ad-hoc networ ks are highly resource constrained in terms of network topology, memory and computation power. The reliable data transfer is a difficult task in wireless ad-hoc networks because of resource constr aints. A mobile ad-hoc network (MANET is a kind of wireless ad-hoc network, and is a self-configuri ng network of mobile routers connected by wireless links. A wireless sensor network (WSN is a highly constrained wireless ad-hoc network. In these network, multicast is the efficient routing service for data broadcasting. Denial of service (DOS att ack, sinkhole, wormhole, sybil, black hole and rushing a ttacks are some routing attacks. So, it is necessar y to study the impact of routing attacks on existing mul ticast routing protocols to suggest a suitable secu re multicast routing protocol. The objective of this p aper is to study the effects of black hole and rush ing attack on MANET and WSN. The NS-2 based simulation is used in analyzing the black hole and rushing attacks. From performance metrics such as packet de livery ratio (PDR, packet drop ratio (PDrR, network throughput (NTh and energy consumption it is observed that the routing attacks have severe impact on MANET than WSN.

  16. PACKET ROUTING ALGORITHM FOR LEO SATELLITE CONSTELLATION NETWORK

    Institute of Scientific and Technical Information of China (English)

    Wang Kaidong; Tian Bin; Yi Kechu

    2005-01-01

    A novel distributed packet routing algorithm for Low Earth Orbit (LEO) satellite networks based on spiderweb topology is presented. The algorithm gives the shortest path with very low computational complexity and without on-board routing tables, which is suitable and practical for on-board processing. Simulation results show its practicability and feasibility.

  17. 77 FR 39911 - The New York North Shore Helicopter Route

    Science.gov (United States)

    2012-07-06

    ... operations offshore. The FAA published the route on the Helicopter Route Chart for New York, effective May 8...'' (75 FR 29471). The FAA proposed requiring civil helicopters operating along Long Island, New York's... helicopter flights over communities along the north shore of Long Island by moving those flights offshore...

  18. 14 CFR 121.161 - Airplane limitations: Type of route.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false Airplane limitations: Type of route. 121... OPERATING REQUIREMENTS: DOMESTIC, FLAG, AND SUPPLEMENTAL OPERATIONS Aircraft Requirements § 121.161 Airplane... specifications, no certificate holder may operate a turbine-engine-powered airplane over a route that contains...

  19. BGP routing changes: Merging views of two ISPs

    OpenAIRE

    Teixeira, Renata; Agarwal, Sharad; Rexford, Jennifer

    2005-01-01

    Large ISPs experience millions of BGP routing changes a day. In this paper, we discuss the impact of BGP routing changes on the flow of traffic, summarizing and reconciling the results from six measurement studies of the Sprint and AT&T backbone networks.

  20. Basic cable routing guidelines for a fast reactor plant

    International Nuclear Information System (INIS)

    In this paper the guidelines evolved for cable routing in 500 MWe Prototype Fast Breeder Reactor (PFBR) are presented. Safety related redundant system cables in a nuclear plant shall not become unavailable due to cable fire. This is ensured by proper cable routing in the plant in addition to the other general fire protection measures

  1. PGBR Protocol for Cloud Routing Implementation in NS-3

    Directory of Open Access Journals (Sweden)

    Mr.Tushar Kailas Mendhe

    2013-01-01

    Full Text Available The current internet infrastructure is fronting a number of boundaries that is not suitable to meet the growing number of services and users. In particular, one aspect that requires enhancement is routing, where original routing concepts were designed for static traffic patterns with minimal variations and supporting mainly low through put traffic (e.g. Data. As the number of users as well as services supporting the user grows, the current routing mechanisms will not be feasible. In this paper we present a gradient based distributed routing technique that is based on discovering routes through a gradient field created in the topology. The gradient calculation is based on weighted sum of a number of components, which modifies the gradient field as the network load changes. An improved version of a fully distributed routing protocol that is applicable for cloud computing infrastructure, also an implementation of the PGBR routing protocol within the ns-3 simulator. Broadband convergence networks can offer a solution for multiple service classes through integrated heterogeneous networks. However, to prepare this for the future variability in traffic demand, a dynamic routing protocol that boosts scalability, QoS awareness, and easy roadmap to deployment if necessary. The implementation using ns-3 simulator can ensure this capability.

  2. COORDINATION OF THE WORK OF BUSES IN CITY ROUTES

    Directory of Open Access Journals (Sweden)

    Fuad DASHDAMIROV

    2013-12-01

    Full Text Available The paper studied the work of bus routes passing through a street. Optimality criterion was chosen for the development of appropriate models of effective work of buses on the land. The paper proposes a new model costing time passengers at bus stops. A method of technique was developed to coordinate the buses running on the combined section of route.

  3. 17 CFR 242.606 - Disclosure of order routing information.

    Science.gov (United States)

    2010-04-01

    ... (CONTINUED) REGULATIONS M, SHO, ATS, AC, AND NMS AND CUSTOMER MARGIN REQUIREMENTS FOR SECURITY FUTURES Regulation Nms-Regulation of the National Market System § 242.606 Disclosure of order routing information. (a... calendar quarter a report on its routing of non-directed orders in NMS securities during that quarter....

  4. Nature-Inspired and Energy Efficient Route Planning

    DEFF Research Database (Denmark)

    Schlichtkrull, Anders; Christensen, J. B. S.; Feld, T.;

    2015-01-01

    an order on the stops, the route can be made shorter. When, for instance, a furniture dealer has to deliver goods, the order of visiting the customers will often be unimportant. We present a prototype app that can make shorter and more energy efficient routes by allowing it to change the order of the...

  5. Anycast service model and its QoS routing algorithm

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify certain applications. In this paper, the authors described a simple anycast service model in the Internet without significant affecting the routing and protocol processing infrastructure that was already in place, and proposed an anycast QoS routing algorithm for this model. The algorithm used randomized method to balance network load and improve its performance. Several new techniques are proposed in the algorithm, first, theminimum hops for each node are used in the algorithm, which are used as metric for computing the probability of possible out-links. The metric is pre-computed for each node in the network, which can simplify the network complexity and provide the routing process with useful information. Second, randomness is used at the link level and depends dynamically on the routing configuration. This provides great flexibility for the routing process, prevents the routing process from overusing certain fixed routing paths, and adequately balances the delay of the routing path. the authors assess the quality of QoS algorithm in terms of the acceptance ratio on anycast QoS requests, and the simulation results on a variety of network topologies and on various parameters show that the algorithm has good performances and can balance network load effectively.

  6. 78 FR 44624 - Inquiry Routing and Information System; Correction

    Science.gov (United States)

    2013-07-24

    ...) published an information collection notice in a Federal Register on July 15, 2013 (78 FR 42157), that... AFFAIRS Inquiry Routing and Information System; Correction AGENCY: Office of Information and Technology... (VHA) had submitted the collection of information titled ``Inquiry Routing and Information System...

  7. Integrated cargo routing and ship scheduling in liner shipping

    DEFF Research Database (Denmark)

    Kjeldsen, Karina Hjortshøj

    The problem consists of creating routes and schedules for a heterogeneous fleet of ships while determining the cargo routing and the speed for all relevant port pair/ship combinations. Transshipment is allowed in ports with transshipment capabilities. The service frequency is fixed at one week...

  8. 41 CFR 109-40.302 - Standard routing principle.

    Science.gov (United States)

    2010-07-01

    ... principle. 109-40.302 Section 109-40.302 Public Contracts and Property Management Federal Property Management Regulations System (Continued) DEPARTMENT OF ENERGY PROPERTY MANAGEMENT REGULATIONS AVIATION... Standard routing principle. (a) Shipments shall be routed using the mode of transportation, or...

  9. Trade routes and communication pattern of ancient Orissa

    Digital Repository Service at National Institute of Oceanography (India)

    Tripati, S.; Patnaik, S.K.

    attempt has been made for the study of the trade routes and communication pattern of ancient Orissa. Thus an attempt is made to trace out the trade routes and communication pattern of ancient Orissa in the light of available archaeological and literary...

  10. Chemical Routes to Colloidal Chalcogenide Nanosheets

    Energy Technology Data Exchange (ETDEWEB)

    Schaak, Raymond

    2015-02-19

    This project sought to develop new low-temperature synthetic pathways to intermetallic and chalcogenide nanostructures and powders, with an emphasis on systems that are relevant to advancing the synthesis, processing, and discovery of superconducting materials. The primary synthetic routes involved solution chemistry methods, and several fundamental synthetic challenges that underpinned the formation of these materials were identified and investigated. Methods for incorporating early transition metals and post transition metals into nanoscale and bulk crystals using low-temperature solution chemistry methods were developed and studied, leading to colloidal nanocrystals of elemental indium, manganese, and germanium, as well as nanocrystalline and bulk intermetallic compounds containing germanium, gallium, tin, indium, zinc, bismuth, and lithium. New chemical tools were developed to help target desired phases in complex binary intermetallic and metal chalcogenide systems that contain multiple stable phases, including direct synthesis methods and chemical routes that permit post-synthetic modification. Several phases that are metastable in bulk systems were targeted, synthesized, and characterized as nanocrystalline solids and bulk powders, including the L12-type intermetallic compounds Au3Fe, Au3Ni, and Au3Co, as well as wurtzite-type MnSe. Methods for accessing crystalline metal borides and carbides using direct solution chemistry methods were also developed, with an emphasis on Ni3B and Ni3C, which revealed useful correlations of composition and magnetic properties. Methods for scale-up and nanoparticle purification were explored, providing access to centimeter-scale pressed pellets of polyol-synthesized nanopowders and a bacteriophage-mediated method for separating impure nanoparticle mixtures into their components. Several advances were made in the synthesis of iron selenide and related superconducting materials, including the production of colloidal Fe

  11. Variations on the seventh route to relativity

    International Nuclear Information System (INIS)

    Wheeler asked how one might derive the Einstein-Hamilton-Jacobi equation from plausible first principles without any use of the Einstein field equations themselves. In addition to Hojman, Kuchar and Teitelboim's 'seventh route to relativity' partial answer to this, there is now a '3-space' partial answer due to Barbour, Foster and O Murchadha (BFO) which principally differs in that general covariance is no longer presupposed. BFO's formulation of the 3-space approach is based on best-matched actions such as the lapse-eliminated Baierlein-Sharp-Wheeler (BSW) action of general relativity (GR). These give rise to several branches of gravitational theories including GR on superspace and a theory of gravity on conformal superspace. This paper investigates the 3-space approach further, motivated both by the hierarchies of increasingly well-defined and weakened simplicity postulates present in all routes to relativity, and by the requirement that all the known fundamental matter fields be included. We further the study of configuration spaces of gravity-matter systems upon which BFO's formulation leans. We note that in further developments the lapse-eliminated BSW actions used by BFO become impractical and require generalization. We circumvent many of these problems by the equivalent use of lapse-uneliminated actions, which furthermore permit us to interpret BFO's formulation within Kuchar's generally covariant hypersurface framework. This viewpoint provides alternative reasons to BFO's as to why the inclusion of bosonic fields in the 3-space approach gives rise to minimally coupled scalar fields, electromagnetism and Yang-Mills theory. This viewpoint also permits us to quickly exhibit further GR-matter theories admitted by the 3-space formulation. In particular, we show that the spin-(1/2) fermions of the theories of Dirac, Maxwell-Dirac and Yang-Mills-Dirac, all coupled to GR, are admitted by the generalized 3-space formulation we present. Thus all the known fundamental

  12. Analyzing the evolutionary mechanisms of the Air Transportation System-of-Systems using network theory and machine learning algorithms

    Science.gov (United States)

    Kotegawa, Tatsuya

    Complexity in the Air Transportation System (ATS) arises from the intermingling of many independent physical resources, operational paradigms, and stakeholder interests, as well as the dynamic variation of these interactions over time. Currently, trade-offs and cost benefit analyses of new ATS concepts are carried out on system-wide evaluation simulations driven by air traffic forecasts that assume fixed airline routes. However, this does not well reflect reality as airlines regularly add and remove routes. A airline service route network evolution model that projects route addition and removal was created and combined with state-of-the-art air traffic forecast methods to better reflect the dynamic properties of the ATS in system-wide simulations. Guided by a system-of-systems framework, network theory metrics and machine learning algorithms were applied to develop the route network evolution models based on patterns extracted from historical data. Constructing the route addition section of the model posed the greatest challenge due to the large pool of new link candidates compared to the actual number of routes historically added to the network. Of the models explored, algorithms based on logistic regression, random forests, and support vector machines showed best route addition and removal forecast accuracies at approximately 20% and 40%, respectively, when validated with historical data. The combination of network evolution models and a system-wide evaluation tool quantified the impact of airline route network evolution on air traffic delay. The expected delay minutes when considering network evolution increased approximately 5% for a forecasted schedule on 3/19/2020. Performance trade-off studies between several airline route network topologies from the perspectives of passenger travel efficiency, fuel burn, and robustness were also conducted to provide bounds that could serve as targets for ATS transformation efforts. The series of analysis revealed that high

  13. Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network

    CERN Document Server

    Sara, Getsy S; S, Neelavathy Pari; D, Sridharan

    2010-01-01

    A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes a novel hybrid multipath routing algorithm with an efficient clustering technique. A node is selected as cluster head if it has high surplus energy, better transmission range and least mobility. The Energy Aware (EA) selection mechanism and the Maximal Nodal Surplus Energy estimation technique incorporated in this algorithm improves the energy performance during routing. Simulation results can show that the proposed clustering and routing algorithm can scale well in dynamic and energy deficient mobile sensor network.

  14. Reformative multicast routing protocol based on Ad Hoc

    Institute of Scientific and Technical Information of China (English)

    杨喜旺; 王华; 焦国太

    2008-01-01

    Mobile Ad Hoc networks has been widely applied to military field, emergency management, public service and so on. Because it is uncertain on network and communication, a great deal of energy will be consumed with nodes increasing and creating routing each other. The reformative on-demand multicast routing protocol was putted forward by researching the energy consuming of multicast routing protocol in Ad Hoc. It will decrease consumption in a big multicast flooding through studying the relaying group net structure based on map or wormhole. The energy consumption is reduced 30% by creating the two kinds of routing principles: minimization of energy consumption and minimization of maximum nodes energy consumption. The simulation result indicates that the reformative RODMRP is effective to reduce the energy consuming while routing protocol built.

  15. Routing-based synthesis of digital microfluidic biochips

    DEFF Research Database (Denmark)

    Maftei, Elena; Pop, Paul; Madsen, Jan

    2012-01-01

    electrodes are considered occupied during the operation execution, although the droplet uses only one electrode at a time. Moreover, the operations can actually be performed by routing the droplets on any sequence of electrodes on the microfluidic array. Hence, in this paper, we eliminate the concept...... of virtual devices and allow the droplets to move on the chip on any route during operation execution. Thus, the synthesis problem is transformed into a routing problem. We develop an algorithm based on a Greedy Randomized Adaptive Search Procedure (GRASP) and we show that routing-based synthesis leads...... to significant improvements in the application completion time compared to traditional synthesis based on virtual devices. However, the disadvantage of the routing-based approach is that it may contaminate larger areas of the biochip, when synthesizing applications containing liquids which may adsorb...

  16. A Novel Multipoint Relay based Secure Routing in MANET

    Directory of Open Access Journals (Sweden)

    Himadri Nath Saha

    2012-12-01

    Full Text Available Security in routing is a challenging issue in mobile ad-hoc (MANET network because of itsopen nature, infrastructure less property, mobility and energy constraints. Messages typically roam inmulti-hopped fashion and nodes may be powered by limited energy source and with limited physicalsecurity. So we proposed a new scheme which is significantly different from others available schemes toprovide security during routing in mobile ad hoc networks. In this paper, our proposed scheme, SecureMultipoint Relay based Routing in MANET (SMRR provides routing based on trust, which is an integervalue that helps to select Multipoint Relay (administrator inside the network for routing. We have alsoimplemented the message confidentiality and integrity in our proposed scheme. Our simulation resultsshow the robustness, reliability and trustworthiness of our scheme.

  17. Hybrid songbirds employ intermediate routes in a migratory divide.

    Science.gov (United States)

    Delmore, Kira E; Irwin, Darren E

    2014-10-01

    Migratory divides are contact zones between populations that use different routes to navigate around unsuitable areas on seasonal migration. Hybrids in divides have been predicted to employ intermediate and potentially inferior routes. We provide the first direct test of this hypothesis, using light-level geolocators to track birds breeding in a hybrid zone between Swainson's thrushes in western Canada. Compared to parental forms, hybrids exhibited increased variability in their migratory routes, with some using intermediate routes that crossed arid and mountainous regions, and some using the same routes as one parental group on fall migration and the other on spring migration. Hybrids also tended to use geographically intermediate wintering sites. Analysis of genetic variation across the hybrid zone suggests moderately strong selection against hybrids. These results indicate that seasonal migratory behaviour might be a source of selection against hybrids, supporting a possible role for migration in speciation. PMID:25040456

  18. Optimization Model for Headway of a Suburban Bus Route

    Directory of Open Access Journals (Sweden)

    Xiaohong Jiang

    2014-01-01

    Full Text Available Due to relatively low passenger demand, headways of suburban bus route are usually longer than those of urban bus route. Actually it is also difficult to balance the benefits between passengers and operators, subject to the service standards from the government. Hence the headway of a suburban bus route is usually determined on the empirical experience of transport planners. To cope with this problem, this paper proposes an optimization model for designing the headways of suburban bus routes by minimizing the operating and user costs. The user costs take into account both the waiting time cost and the crowding cost. The feasibility and validity of the proposed model are shown by applying it to the Route 206 in Jiangning district, Nanjing city of China. Weightages of passengers’ cost and operating cost are further discussed, considering different passenger flows. It is found that the headway and objective function are affected by the weightages largely.

  19. Efficient Implementation of Dynamic Routing With Security Considerations

    Directory of Open Access Journals (Sweden)

    UMADEVI DURVASULA

    2011-12-01

    Full Text Available Now-a-days security is one of the major issues for data communication over wireless and wired networks. The past work on the designs of cryptography algorithms and system infrastructures. Apart from that the authors proposed a dynamic routing algorithm called improved dynamic routing with security consideration, which is based on the concept of Zone Routing Protocol (ZRP that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP in wired networks and Destination-Sequenced Distance Vector (DSDV protocol in wireless networks, without introducing extra control messages. This improves security as well as controls traffic in the network. A clear study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the results and to show the capability of the proposed algorithm.

  20. Development and Application of a Next Generation Air Sensor Network for the Hong Kong Marathon 2015 Air Quality Monitoring

    Directory of Open Access Journals (Sweden)

    Li Sun

    2016-02-01

    Full Text Available This study presents the development and evaluation of a next generation air monitoring system with both laboratory and field tests. A multi-parameter algorithm was used to correct for the impact of environmental conditions on the electrochemical sensors for carbon monoxide (CO and nitrogen dioxide (NO2 pollutants. The field evaluation in an urban roadside environment in comparison to designated monitors showed good agreement with measurement error within 5% of the pollutant concentrations. Multiple sets of the developed system were then deployed in the Hong Kong Marathon 2015 forming a sensor-based network along the marathon route. Real-time air pollution concentration data were wirelessly transmitted and the Air Quality Health Index (AQHI for the Green Marathon was calculated, which were broadcast to the public on an hourly basis. The route-specific sensor network showed somewhat different pollutant patterns than routine air monitoring, indicating the immediate impact of traffic control during the marathon on the roadside air quality. The study is one of the first applications of a next generation sensor network in international sport events, and it demonstrated the usefulness of the emerging sensor-based air monitoring technology in rapid network deployment to supplement existing air monitoring.

  1. Development and Application of a Next Generation Air Sensor Network for the Hong Kong Marathon 2015 Air Quality Monitoring.

    Science.gov (United States)

    Sun, Li; Wong, Ka Chun; Wei, Peng; Ye, Sheng; Huang, Hao; Yang, Fenhuan; Westerdahl, Dane; Louie, Peter K K; Luk, Connie W Y; Ning, Zhi

    2016-01-01

    This study presents the development and evaluation of a next generation air monitoring system with both laboratory and field tests. A multi-parameter algorithm was used to correct for the impact of environmental conditions on the electrochemical sensors for carbon monoxide (CO) and nitrogen dioxide (NO2) pollutants. The field evaluation in an urban roadside environment in comparison to designated monitors showed good agreement with measurement error within 5% of the pollutant concentrations. Multiple sets of the developed system were then deployed in the Hong Kong Marathon 2015 forming a sensor-based network along the marathon route. Real-time air pollution concentration data were wirelessly transmitted and the Air Quality Health Index (AQHI) for the Green Marathon was calculated, which were broadcast to the public on an hourly basis. The route-specific sensor network showed somewhat different pollutant patterns than routine air monitoring, indicating the immediate impact of traffic control during the marathon on the roadside air quality. The study is one of the first applications of a next generation sensor network in international sport events, and it demonstrated the usefulness of the emerging sensor-based air monitoring technology in rapid network deployment to supplement existing air monitoring. PMID:26861336

  2. Phosphate valorization by dry chlorination route

    Directory of Open Access Journals (Sweden)

    Kanari N.

    2016-01-01

    Full Text Available This work deals with the extraction of phosphorus chlorinated compounds from phosphate materials using chlorination with gaseous chlorine. An industrial sample of dicalcium phosphate dihydrate, after transformation into calcium pyrophosphate (Ca2P2O7, is subjected to reactions with Cl2+CO+N2 and Cl2+C+N2 at temperatures ranging from 625 to 950°C using boat experiments. Gathering results of the thermodynamic predictions and TG/DT analysis with those of SEM and XRD examinations of the chlorinated residues allowed the interpretation of phenomena and reactions mechanism occurring during the calcium pyrophosphate carbochlorination. Reaction rate of Ca2P2O7 by Cl2+CO+N2 at 950°C is slowed down due to the formation of a CaCl2 liquid layer acting as a barrier for the diffusion of the reactive gases and further reaction progress. While, the carbochlorination with Cl2+C+N2 led to almost full chlorination of Ca2P2O7 at 750°C and the process proceeds with an apparent activation energy of about 104 kJ/mol between 625 and 750°C. Carbochlorination technique can be considered as an alternative and selective route for the valorization of low grade phosphates and for the phosphorus extraction from its bearing materials.

  3. Light Routing Algorithm for Utility Networks

    Directory of Open Access Journals (Sweden)

    Rosario Culmone

    2014-06-01

    Full Text Available In several application domains like Ambient Assisted Living systems or in users accounting services, specific network protocols are called for to interconnect different data processing devices having limited processing power and energy [1]. Typically, the interconnections are accomplished through dedicated cables or as power lines, or through wireless, but even if the cables are fully utilized, few protocols have been drawn up or planned to optimize communication among a high number of devices. One reason for the limited development of these protocols lies in the difficulty of reconciling the efficiency and efficacy of a protocol with scarce power computing of the nodes. This article will propose an efficient algorithm for routing applicable to networks with many nodes and with interferences typically present in power lines, and with low management overhead. The algorithm guarantees reliability and transparent distribution over large networks like accounting networks for the distribution of water, gas and tele-heating. Implementation of the protocol can be realized within the European M-Bus [EN13757] [2] [3]. 

  4. Impact of Strangers on Opportunistic Routing Performance

    Institute of Scientific and Technical Information of China (English)

    Pei-Yan Yuan; Hua-Dong Ma; Peng-Rui Duan

    2013-01-01

    Routing is one of the challenging tasks in Delay Tolerant Networks (DTNs),due to the lack of global knowledge and sporadic contacts between nodes.Most existing studies take a greedy scheme in data forwarding process,i.e.,only nodes with higher utility values than current carriers can be selected as relays.They lack an in-depth investigation on the main features of the optimal paths in Epidemic.These features are vital to any forwarding scheme that tends to make a trade-off between packet delivery delay and cost.This is mainly because Epidemic provides an upper bound on cost and a lower bound on delivery delay.Therefore,a deep understanding of these features is useful to make informed forwarding decisions.In this paper,we try to explore these features by observing the roles of different social relationships in the optimal paths through a set of real datasets.These datasets provide evidence that strangers have two sides in data forwarding process,and that the importance of strangers shows a decreasing trend along the forwarding paths.Using this heuristic knowledge,we propose STRON,a distributed and lightweight forwarding scheme.The distributed feature makes it very suitable for opportunistic scenarios and the low communication and computation features make it easy to be integrated with state-of-the-art work.The trace-driven simulations obviously confirm its effectiveness,especially in terms of packet delivery delay and cost.

  5. Exploring Routes to Persuasive Online Advertising

    Directory of Open Access Journals (Sweden)

    Wen-Chin Tsao

    2014-11-01

    Full Text Available Studies show that the Internet is gaining status as a mainstream medium for delivering advertisements and thatonline advertising may surpass advertising in traditional media. This study proposes a model for evaluating theeffects of various elements of Internet advertisements on purchase intention and outlines a potential route bywhich persuasive messages might travel. A structural equation model is developed to test the causal effectbetween those constructs. The multiple-group analysis is applied to investigate the moderating effect of Internetusage.The empirical results show that (1 purchase intention is influenced indirectly by peripheral cues via the mediationof hedonic value, (2 purchase intention is influenced indirectly by central cues via the mediation of utilitarianvalue and search intention, (3 Internet usage plays a partial moderating role in persuasive communication, and (4utilitarian value plays a critical meditating role by converting rational ad stimuli into purchase acts after thepersuasive communication effected by online advertisements. This study clarified the process of consumerperception and interpretation towards online advertisement information, proposing two pathways for persuasion.Furthermore, we confirmed that in the event that more central cures are released in online advertisements, theconsumers will enhance a greater utilitarian value to the message. This further induces greater search intention andpurchase intention, the finding of which is the contribution of this study.

  6. GOOGLE MAPS FOR CROWDSOURCED EMERGENCY ROUTING

    Directory of Open Access Journals (Sweden)

    S. Nedkov

    2012-08-01

    Full Text Available Gathering infrastructure data in emergency situations is challenging. The affected by a disaster areas are often large and the needed observations numerous. Spaceborne remote sensing techniques cover large areas but they are of limited use as their field of view may be blocked by clouds, smoke, buildings, highways, etc. Remote sensing products furthermore require specialists to collect and analyze the data. This contrasts the nature of the damage detection problem: almost everyone is capable of observing whether a street is usable or not. The crowd is fit for solving these challenges as its members are numerous, they are willing to help and are often in the vicinity of the disaster thereby forming a highly dispersed sensor network. This paper proposes and implements a small WebGIS application for performing shortest path calculations based on crowdsourced information about the infrastructure health. The application is built on top of Google Maps and uses its routing service to calculate the shortest distance between two locations. Impassable areas are indicated on a map by people performing in-situ observations on a mobile device, and by users on a desktop machine who consult a multitude of information sources.

  7. Google Maps for Crowdsourced Emergency Routing

    Science.gov (United States)

    Nedkov, S.; Zlatanova, S.

    2012-08-01

    Gathering infrastructure data in emergency situations is challenging. The affected by a disaster areas are often large and the needed observations numerous. Spaceborne remote sensing techniques cover large areas but they are of limited use as their field of view may be blocked by clouds, smoke, buildings, highways, etc. Remote sensing products furthermore require specialists to collect and analyze the data. This contrasts the nature of the damage detection problem: almost everyone is capable of observing whether a street is usable or not. The crowd is fit for solving these challenges as its members are numerous, they are willing to help and are often in the vicinity of the disaster thereby forming a highly dispersed sensor network. This paper proposes and implements a small WebGIS application for performing shortest path calculations based on crowdsourced information about the infrastructure health. The application is built on top of Google Maps and uses its routing service to calculate the shortest distance between two locations. Impassable areas are indicated on a map by people performing in-situ observations on a mobile device, and by users on a desktop machine who consult a multitude of information sources.

  8. Routes and mechanisms of extracellular vesicle uptake

    Directory of Open Access Journals (Sweden)

    Laura Ann Mulcahy

    2014-08-01

    Full Text Available Extracellular vesicles (EVs are small vesicles released by donor cells that can be taken up by recipient cells. Despite their discovery decades ago, it has only recently become apparent that EVs play an important role in cell-to-cell communication. EVs can carry a range of nucleic acids and proteins which can have a significant impact on the phenotype of the recipient. For this phenotypic effect to occur, EVs need to fuse with target cell membranes, either directly with the plasma membrane or with the endosomal membrane after endocytic uptake. EVs are of therapeutic interest because they are deregulated in diseases such as cancer and they could be harnessed to deliver drugs to target cells. It is therefore important to understand the molecular mechanisms by which EVs are taken up into cells. This comprehensive review summarizes current knowledge of EV uptake mechanisms. Cells appear to take up EVs by a variety of endocytic pathways, including clathrin-dependent endocytosis, and clathrin-independent pathways such as caveolin-mediated uptake, macropinocytosis, phagocytosis, and lipid raft–mediated internalization. Indeed, it seems likely that a heterogeneous population of EVs may gain entry into a cell via more than one route. The uptake mechanism used by a given EV may depend on proteins and glycoproteins found on the surface of both the vesicle and the target cell. Further research is needed to understand the precise rules that underpin EV entry into cells.

  9. Air protection. Ochrana ovzdusia

    Energy Technology Data Exchange (ETDEWEB)

    Siska, F.

    1980-01-01

    This paper discusses problems of air pollution control, air pollution abatement and effects of air pollution. Air pollution caused by black and brown coal combustion, by fossil-fuel power plants and by coking plants is evaluated. Air pollution by dusts, sulfur oxides, nitrogen oxides, carbon monoxide, ammonia as well arsenic, barium, beryllium, boron, chromium, gallium, cobalt, manganese, copper, nickel, lead, plutonium, titanium and vanadium, which sometimes accompany ashes in coal, is analyzed. Methods of air pollution abatement such as fluidized bed combustion, coal preparation, desulfurization or dry coke quenching are described. Systems for air pollution control are presented: air filtration, cyclones, electrostatic precipitators. Systems of air pollution measurement and recording are evaluated. Propagation of air pollutants in the atmosphere as well as the factors which influence pollutant propagation are characterized. Problems associated with site selection for fossil-fuel power plants are also discussed. An analysis of economic aspects of air pollution abatement and air pollution control is made. (55 refs.)

  10. Indoor Air Quality

    Science.gov (United States)

    ... protect yourself and your family. Learn more Air Quality at Work Workers should breathe easy while on the job, but worksites with poor air quality put employees at risk. Healthy air is essential ...

  11. HEPA air filter (image)

    Science.gov (United States)

    ... pet dander and other irritating allergens from the air. Along with other methods to reduce allergens, such ... controlling the amount of allergens circulating in the air. HEPA filters can be found in most air ...

  12. Bad Air Day

    Science.gov (United States)

    ... link, please review our exit disclaimer . Subscribe Bad Air Day Air Quality and Your Health In many parts of the country, summer has the worst air quality of any season. When the forecast says ...

  13. Impact of the Mobility Models, Route and Link connectivity on the performance of Position based routing protocols

    Directory of Open Access Journals (Sweden)

    Adam MACINTOSH

    2014-10-01

    Full Text Available This paper investigate the fundamental factors “mobility models, route and link connectivity” in Mobile Ad hoc networks (MANET which have a major impact on the performance of position based routing protocols. In addition, a new measurement method called probability of communication process is proposed. The method is used to measure the success rate of established path by a MANET routing protocol, which allow to stress test and inspect the stability, scalability and adaptability of MANET routing protocols. We analysed the effect of “route and link connectivity” on the performance of protocols under two different mobility models. Results show the evaluation and performance of the proposed protocol under a unified simulation environment for different scenarios.

  14. Review paper on solar-powered air-conditioning through adsorption route

    Energy Technology Data Exchange (ETDEWEB)

    Choudhury, B.; Chatterjee, P.K. [Thermal Engineering Group, Central Mechanical Engineering Research Institute, Durgapur 713209 (India); Sarkar, J.P. [Chemical Engineering Department, National Institute of Technology, Durgapur 713209 (India)

    2010-10-15

    Solar-power based sorption refrigeration systems do not suffer from the problem of greenhouse gas emission and release of ozone layer depleting substances as in the case of conventional vapour compression refrigeration system. Absorption based systems are already commercially available while adsorption based systems are still in research and development stage. Progress and development of solar-powered adsorption cooling systems have been described in this paper. Factors preventing commercialization of this system have been discussed in detail. The state of the ongoing research, to make the system more efficient and cost effective, has been presented. (author)

  15. From the ground up: groundwater, surface water runoff, and air as pathogen routes for food contamination

    Science.gov (United States)

    Foodborne infectious disease transmission of 31 pathogen types is estimated to account for 9.4 million illnesses, 56,000 hospitalizations, and 1,300 deaths in the United States annually (Scallan et al. 2011). The economic costs from foodborne illness in the United States are more than $50 billion pe...

  16. A Method for Scheduling Air Traffic with Uncertain En Route Capacity Constraints

    Science.gov (United States)

    Arneson, Heather; Bloem, Michael

    2009-01-01

    A method for scheduling ground delay and airborne holding for flights scheduled to fly through airspace with uncertain capacity constraints is presented. The method iteratively solves linear programs for departure rates and airborne holding as new probabilistic information about future airspace constraints becomes available. The objective function is the expected value of the weighted sum of ground and airborne delay. In order to limit operationally costly changes to departure rates, they are updated only when such an update would lead to a significant cost reduction. Simulation results show a 13% cost reduction over a rough approximation of current practices. Comparison between the proposed as needed replanning method and a similar method that uses fixed frequency replanning shows a typical cost reduction of 1% to 2%, and even up to a 20% cost reduction in some cases.

  17. A Recovery Method for Greedy Routing Protocols in Web Communications

    Directory of Open Access Journals (Sweden)

    Sheetal Kaushik

    2012-01-01

    Full Text Available Greedy Perimeter Stateless Routing (GPSR protocol is an appropriate and the most well-known routing protocol for high mobile vehicular ad-hoc networks. The protocol includes two routing modes, the greedy mode and the recovery mode, and utilizes a neighbor list to make a route decision. However, not only does the neighbor list in the protocol involve stale neighbor information, but also the stale nodes inherit a higher selection priority in the greedy mode according to the routing policy; besides, the useful redundant route information can be eliminated during planarization in the recovery mode. To overcome those problems, we propose a new recovery mode, named as Greedy Border Superiority Routing (GBSR, along with an Adaptive Neighbor list Management (ANM scheme. A node generates aborder superior graph instead of generating a planar graph whenthe node faces the local maximum. Packets in the recovery modecan escape from the recovery mode as fast as possible using thegraph. Here, GBSR protocol has the same assumption as that ofGPSR, and does not require any additional information. With anetwork simulator, GBSR and ANM are evaluated using two vehicle mobility scenarios. GBSR shows higher network performance in comparison with GPSR protocol. In addition, we accomplish a nearly stale-free neighbor list using the ANM scheme.

  18. SURVEY OF GENETIC BASED APPROACH FOR MULTICAST ROUTING IN MANET

    Directory of Open Access Journals (Sweden)

    Sumathy S

    2012-12-01

    Full Text Available An independent, self-governing group of mobile wireless hosts communicate through wireless links by forming a temporary network (Mobile Ad-hoc Network in a dynamic manner without any fixedand centralized infrastructure. Since the nodes in MANET are not stationary, same path may not be taken always for routing between the sender and the receiver(s. So, routing in such situation is acomplicated task. In addition, the resources of the wireless nodes are limited. With the intention of saving the resources of the nodes in the network, multicasting can be used instead of multiple unicast data transmissions whenever a node needs to send same data in parallel to several destinations. The grouporiented services are the primary ones that support today’s need and trend of communication. In recent years, such services are provided with the help of MANETs. The residual energy of the battery of a mobile node is finite (before recharging is done, which is a constraint while developing multicast routing protocols. Genetic Algorithm (GA presents an improved solution for the multi-constrained multicast routing problem. By choosing proper fitness function and values for metrics such as initial population size, crossover and mutation that closely relates to the chosen scenario, the genetic algorithm optimizes the routes in terms of selected metrics. This paper focuses to provide a survey and analyses the categories of multicast routing protocols. In addition, this also covers the details of the application of genetic approach in finding multicast routes.

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

  20. Super Node Routing Strategy in Content-Centric Networking

    Institute of Scientific and Technical Information of China (English)

    苗春浇; 张宏科; 周华春; 董平; 沈烁

    2015-01-01

    There were two strategies for the data forwarding in the content-centric networking (CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment. This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forward-ing information base (FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing, reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.