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. Dynamic Air Route Open-Close Problem for Airspace Management

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Dynamic airspace management plans and assigns airspace resources to airspace users on demand to increase airspace capacity. Although many studies of air traffic flow management (ATFM) have sought to optimally allocate air traffic to get the best use of given airspace resources, few studies have focused on how to build an efficient air traffic network or how to adjust the current network in real time. This paper presents an integer program model named the dynamic air route open-close problem (DROP). DROP has a cost-based objective function which takes into account constraints such as the shortest occupancy time of routes, which are not considered in ATFM models. The aim of DROP is to determine which routes will be opened to a certain user during a given time period. Simulation results show that DROP can facilitate utilization of air routes. DROP, a simplified version of an air traffic network constructing problem, is the first step towards realizing dynamic airspace management. The combination of ATFM and DROP can facilitate decisions toward more reasonable, efficient use of limited airspace resources.

  3. Air quality on bus routes in Umea, Sweden

    Energy Technology Data Exchange (ETDEWEB)

    Sandberg, H.; Forsberg, B. [Dept. of Environmental Health and Dept. of Public Health and Clinical Medicine, Umea University SE, Umea (Sweden)

    2000-07-01

    Bus traffic in some local streets with up to 650 buses per day has resulted in complaints about air pollution and suggestions from residents that the bus routes should be changed to other streets. We have studied nitrogen dioxide and benzene concentrations at five exposed sites and at two representative control sites without bus traffic, and found no general differences in air quality. However, the site and temperature adjusted concentrations fell significantly during a strike among bus drivers. (authors)

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

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

  6. Analysis of the Chinese air route network as a complex network

    Institute of Scientific and Technical Information of China (English)

    Cai Kai-Quan; Zhang Jun; Du Wen-Bo; Cao Xian-Bin

    2012-01-01

    The air route network,which supports all the flight activities of the civil aviation,is the most fundamental infrastructure of air traffic management system.In this paper,we study the Chinese air route network (CARN) within the framework of complex networks. We find that CARN is a geographical network possessing exponential degree distribution,low clustering coefficient,large shortest path length and exponential spatial distance distribution that is obviously different from that of the Chinese airport network (CAN).Besides,via investigating the flight data from 2002 to 2010,we demonstrate that the topology structure of CARN is homogeneous,howbeit the distribution of flight flow on CARN is rather heterogeneous.In addition,the traffic on CARN keeps growing in an exponential form and the increasing speed of west China is remarkably larger than that of east China.Our work will be helpful to better understand Chinese air traffic systems.

  7. Northwest passage: Trade route for large air cushion vehicles

    Science.gov (United States)

    Anderson, J. L.

    1973-01-01

    A conceptual vehicle and powerplant (10,000-ton) nuclear-powered air-cushion vehicle (ACV) that could open the Northwest Passage and other Arctic passages to commercial traffic is identified. The report contains a description of the conceptual vehicle, including the powerplant and operations, an assessment of technical feasibility, estimates of capital and operating costs, and identification of eligible cargo and markets. A comparison of the nuclear ACV freighter with nuclear container ships shows that for containerized or roll-on/roll-off cargo the ACV would provide greatly reduced transit time between North Atlantic and North Pacific ports at a competitive cost.

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

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

  10. The Calculation of Collision Risk on Air-Routes Based on Variable Nominal Separation

    Institute of Scientific and Technical Information of China (English)

    QU Yu-ling; HAN Song-chen

    2010-01-01

    In this paper, a new method to calculate collision risk of air-routes, based on variable nominal separation, is proposed. The collision risk model of air-routes, based on the time variable and initial time interval variable, is given. Because the distance and the collision probability vary with time when the nominal relative speed between aircraft is not zero for a fixed initial time interval, the distance, the variable nominal separation, and the collision probability at any time can be expressed as functions of time and initial time interval. By the probabilistic theory, a model for calculating collision risk is acquired based on initial time interval distribution, flow rates, and the proportion of aircraft type. From the results of calculations, the collision risk can be characterized by the model when the nominal separation changes with time. As well the roles of parameters can be shown more readily.

  11. Meeting Air Transportation Demand in 2025 by Using Larger Aircraft and Alternative Routing to Complement NextGen Operational Improvements

    Science.gov (United States)

    Smith, Jeremy C.; Guerreiro, Nelson M.; Viken, Jeffrey K.; Dollyhigh, Samuel M.; Fenbert, James W.

    2010-01-01

    A study was performed that investigates the use of larger aircraft and alternative routing to complement the capacity benefits expected from the Next Generation Air Transportation System (NextGen) in 2025. National Airspace System (NAS) delays for the 2025 demand projected by the Transportation Systems Analysis Models (TSAM) were assessed using NASA s Airspace Concept Evaluation System (ACES). The shift in demand from commercial airline to automobile and from one airline route to another was investigated by adding the route delays determined from the ACES simulation to the travel times used in the TSAM and re-generating new flight scenarios. The ACES simulation results from this study determined that NextGen Operational Improvements alone do not provide sufficient airport capacity to meet the projected demand for passenger air travel in 2025 without significant system delays. Using larger aircraft with more seats on high-demand routes and introducing new direct routes, where demand warrants, significantly reduces delays, complementing NextGen improvements. Another significant finding of this study is that the adaptive behavior of passengers to avoid congested airline-routes is an important factor when projecting demand for transportation systems. Passengers will choose an alternative mode of transportation or alternative airline routes to avoid congested routes, thereby reducing delays to acceptable levels for the 2025 scenario; the penalty being that alternative routes and the option to drive increases overall trip time by 0.4% and may be less convenient than the first-choice route.

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

  13. Air Traffic Management Technology Demostration: 1 Research and Procedural Testing of Routes

    Science.gov (United States)

    Wilson, Sara R.; Kibler, Jennifer L.; Hubbs, Clay E.; Smail, James W.

    2015-01-01

    NASA's Air Traffic Management Technology Demonstration-1 (ATD-1) will operationally demonstrate the feasibility of efficient arrival operations combining ground-based and airborne NASA technologies. The ATD-1 integrated system consists of the Traffic Management Advisor with Terminal Metering which generates precise time-based schedules to the runway and merge points; Controller Managed Spacing decision support tools which provide controllers with speed advisories and other information needed to meet the schedule; and Flight deck-based Interval Management avionics and procedures which allow flight crews to adjust their speed to achieve precise relative spacing. Initial studies identified air-ground challenges related to the integration of these three scheduling and spacing technologies, and NASA's airborne spacing algorithm was modified to address some of these challenges. The Research and Procedural Testing of Routes human-in-the-loop experiment was then conducted to assess the performance of the new spacing algorithm. The results of this experiment indicate that the algorithm performed as designed, and the pilot participants found the airborne spacing concept, air-ground procedures, and crew interface to be acceptable. However, the researchers concluded that the data revealed issues with the frequency of speed changes and speed reversals.

  14. 78 FR 38236 - Proposed Establishment, Modification and Cancellation of Air Traffic Service (ATS) Routes...

    Science.gov (United States)

    2013-06-26

    ... the affected routes. This action would enhance the safety and efficient management of aircraft within... Airspace Docket No. 13-AEA-3) and be submitted in triplicate to the Docket Management Facility (see...: is a newly established route to become effective August 22, 2013 (78 FR 29615, May 21,...

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

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

  17. 78 FR 53239 - Establishment, Modification and Cancellation of Air Traffic Service (ATS) Routes; Northeast...

    Science.gov (United States)

    2013-08-29

    ... navigation guidance for portions of the affected routes. This action enhances the safe and efficient management of aircraft within the National Airspace System. DATES: Effective date 0901 UTC, October 17, 2013... northeast United States (78 FR 38236, June 26, 2013). Interested parties were invited to participate in...

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

  19. En Route Air Traffic Control Input Devices for the Next Generation

    Science.gov (United States)

    Mainini, Matthew J.

    2010-01-01

    The purpose of this study was to investigate the usefulness of different input device configurations when trial planning new routes for aircraft in an advanced simulation of the en route workstation. The task of trial planning is one of the futuristic tools that is performed by the graphical manipulation of an aircraft's trajectory to reroute the aircraft without voice communication. In this study with two input devices, the FAA's current trackball and a basic optical computer mouse were evaluated with "pick" button in a click-and-hold state and a click-and-release state while the participant dragged the trial plan line. The trial plan was used for three different conflict types: Aircraft Conflicts, Weather Conflicts, and Aircraft + Weather Conflicts. Speed and accuracy were the primary dependent variables. Results indicate that the mouse conditions were significantly faster than the trackball conditions overall with no significant loss of accuracy. Several performance ratings and preference ratings were analyzed from post-run and post-simulation questionnaires. The release conditions were significantly more useful and likable than the hold conditions. The results suggest that the mouse in the release button state was the fastest and most well liked device configuration for trial planning in the en route workstation. Keywords-input devices, en route, controller, workstation, mouse, trackball, NextGen

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

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

  2. A Cognitive-System Model for En Route Air Traffic Management

    Science.gov (United States)

    Corker, Kevin M.; Pisanich, Gregory; Lebacqz, J. Victor (Technical Monitor)

    1998-01-01

    NASA Ames Research Center has been engaged in the development of advanced air traffic management technologies whose basic form is cognitive aiding systems for air traffic controller and flight deck operations. In the design and evaluation of such systems the dynamic interaction between the airborne aiding system and the ground-based aiding systems forms a critical coupling for control. The human operator is an integral control element in the system and the optimal integration of human decision and performance parameters with those of the automation aiding systems offers a significant challenge to cognitive engineering. This paper presents a study in full mission simulation and the development of a predictive computational model of human performance. We have found that this combination of methodologies provide a powerful design-aiding process. We have extended the computational model Man Machine Integrated Design and Analysis System (N13DAS) to include representation of multiple cognitive agents (both human operators and intelligent aiding systems), operating aircraft airline operations centers and air traffic control centers in the evolving airspace. The demands of this application require the representation of many intelligent agents sharing world-models, and coordinating action/intention with cooperative scheduling of goals and actions in a potentially unpredictable world of operations. The operator's activity structures have been developed to include prioritization and interruption of multiple parallel activities among multiple operators, to provide for anticipation (knowledge of the intention and action of remote operators), and to respond to failures of the system and other operators in the system in situation-specific paradigms. We have exercised this model in a multi-air traffic sector scenario with potential conflict among aircraft at and across sector boundaries. We have modeled the control situation as a multiple closed loop system. The inner and outer

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

  4. Relationship between Air Traffic Selection and Training (AT-SAT)) Battery Test Scores and Composite Scores in the Initial en Route Air Traffic Control Qualification Training Course at the Federal Aviation Administration (FAA) Academy

    Science.gov (United States)

    Kelley, Ronald Scott

    2012-01-01

    Scope and Method of Study: This study focused on the development and use of the AT-SAT test battery and the Initial En Route Qualification training course for the selection, training, and evaluation of air traffic controller candidates. The Pearson product moment correlation coefficient was used to measure the linear relationship between the…

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

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

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

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

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

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

  11. Improving Operational Acceptability of Dynamic Weather Routes Through Analysis of Commonly Use Routings

    Science.gov (United States)

    Evans, Antony D.; Sridhar, Banavar; McNally, David

    2016-01-01

    The Dynamic Weather Routes (DWR) tool is a ground-based trajectory automation system that continuously and automatically analyzes active in-flight aircraft in en route airspace to find simple modifications to flight plan routes that can save significant flying time, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. Trials of the DWR system have shown that significant delay savings are possible. However, some DWR advised routes are also rejected by dispatchers or modified before being accepted. Similarly, of those sent by dispatchers to flight crews as proposed route change requests, many are not accepted by air traffic control, or are modified before implementation as Center route amendments. Such actions suggest that the operational acceptability of DWR advised route corrections could be improved, which may reduce workload and increase delay savings. This paper analyzes the historical usage of different flight routings, varying from simple waypoint pairs to lengthy strings of waypoints incorporating jet routes, in order to improve DWR route acceptability. An approach is developed that can be incorporated into DWR, advising routings with high historical usage and savings potential similar to that of the nominal DWR advisory. It is hypothesized that modifying a nominal DWR routing to one that is commonly used, and nearby, will result in more actual savings since common routings are generally familiar and operationally acceptable to air traffic control. The approach allows routing segments with high historical usage to be concatenated to form routes that meet all DWR constraints. The relevance of a route's historical usage to its acceptance by dispatchers and air traffic control is quantified by analyzing historical DWR data. Results indicate that while historical usage may be less of a concern to flight dispatchers accepting or rejecting DWR advised route corrections, it may be

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

  13. METODOLOGÍA PARA EVALUAR EL IMPACTO AMBIENTAL SOBRE LA CALIDAD DEL AIRE EN LOS PROYECTOS DE REDISEÑO DE RUTAS DE TRANSPORTE PÚBLICO COLECTIVO EN LAS CIUDADES. ESTUDIO DE CASO: MEDELLÍN METHODOLOGY FOR ASSESSING ENVIRONMENTAL IMPACT ON AIR QUALITY IN PROJECTS REDESIGNING COLLECTIVE PUBLIC TRANSPORT ROUTES IN THE CITIES. CASE STUDY: MEDELLÍN

    Directory of Open Access Journals (Sweden)

    Carlos Echeverri

    2012-06-01

    Full Text Available Este documento establece la metodología y los procedimientos necesarios para evaluar el impacto ambiental sobre la calidad del aire en los proyectos de rediseño de rutas de transporte público colectivo en las principales ciudades del mundo. Para este propósito, se formuló un caso hipotético en la ciudad de Medellín teniendo en cuenta las rutas de transporte público colectivo complementarias al sistema integrado de transporte en el Valle de Aburrá, convirtiendo algunas rutas radiales en rutas transversales o de migración a otras cuencas. Con la reconfiguración propuesta para las rutas de transporte público colectivo la emisión de contaminantes proveniente de los buses no presentó cambios sustanciales. Sin embargo, la concentración de partículas aumentó en ciertos puntos de la zona de estudio y alcanzó valores que superan la norma anual de calidad del aire (50 µg/m³.This document provides the methodology and necessary procedures to assess the environmental impact on air quality in the projects of redesign of collective public transport routes in main cities around the world. For this purpose, it has been formulated a hypothetical case in the city of Medellin keeping in mind the public transport routes that are complementary to the integrated transport system in the Aburrá Valley, transforming some radial routes in transversal routes or migration to other basins. With the reconfiguration proposed for collective public transport routes, pollutant emissions from buses did not show substantial changes. However, the concentration of particles increased at certain points in the study area, reaching values that exceed the annual standard for air quality (50 µg/m³.

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

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

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

  17. Visualizing Internet routing changes.

    Science.gov (United States)

    Lad, Mohit; Massey, Dan; Zhang, Lixia

    2006-01-01

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

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

  19. Routing on Metacyclic Graphs

    Institute of Scientific and Technical Information of China (English)

    Wenjun Xiao

    2002-01-01

    Wu, Lakshmivarahan and Dhall[5] recently described a deterministic, distributed routing scheme for some special classes of metacyclic graphs. However they have no proof of correctness that the scheme is a shortest path routing algorithm. In the note we give a suboptimal, deterministic routing algorithm.

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

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

  2. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...... on the problems needed to be solved. The solution methods applied to the problems cover dynamic programming for multi constrained shortest paths, Branch-and-cut for liner shipping, Simulated annealing for transporting assisted passengers in airports, branch-cut-and-price for vehicle routing with time windows...

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

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

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

  6. Improving Reactive Ad Hoc Routing Performance by Geographic Route Length

    Institute of Scientific and Technical Information of China (English)

    CAO Yuan-da; YU Yan-bing; LU Di

    2005-01-01

    In order to help reactive ad hoc routing protocols select better-performance routes, a novel metric named geographic route length (GRL) is proposed. The relationship between GRL metric and routing performance is analyzed in detail. Combined with hop metric, GRL is applied into the original ad hoc on-demand distance vector (AODV) to demonstrate its effectiveness. Simulation experiments have shown that GRL can effectively reduce packet delay and route discovery frequency, thus can improve reactive ad hoc routing performance.

  7. A New Route Maintenance in Dynamic Source Routing Protocol

    CERN Document Server

    Shukla, Ashish

    2010-01-01

    Mobile ad-hoc network (MANET) is infrastructureless, self-organizable, multi hop packet switched network. A number of routing protocols for MANETs have been proposed in recent years. Dynamic Source Routing (DSR) protocol is one of the most popular routing protocol for ad hoc networks. This paper presents a novel method to enhance route maintenance part of DSR protocol. Our proposed route maintenance significantly increases the efficiency of the protocol at the time of route failures.

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

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

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

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

  12. Routed planar networks

    Directory of Open Access Journals (Sweden)

    David J. Aldous

    2016-04-01

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

  13. Routing Service Quality—Local Driver Behavior Versus Routing Services

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    2013-01-01

    of the quality of one kind of location-based service, namely routing services. Specifically, the paper presents a framework that enables the comparison of the routes provided by routing services with the actual driving behaviors of local drivers. Comparisons include route length, travel time, and also route...... experiments with real vehicle trajectory data and an existing online navigation service. It is found that the availability of information about previous trips enables better prediction of route travel time and makes it possible to provide the users with more popular routes than does a conventional navigation...

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

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

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

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

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

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

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

  1. Air traffic management evaluation tool

    Science.gov (United States)

    Sridhar, Banavar (Inventor); Sheth, Kapil S. (Inventor); Chatterji, Gano Broto (Inventor); Bilimoria, Karl D. (Inventor); Grabbe, Shon (Inventor); Schipper, John F. (Inventor)

    2012-01-01

    Methods for evaluating and implementing air traffic management tools and approaches for managing and avoiding an air traffic incident before the incident occurs. A first system receives parameters for flight plan configurations (e.g., initial fuel carried, flight route, flight route segments followed, flight altitude for a given flight route segment, aircraft velocity for each flight route segment, flight route ascent rate, flight route descent route, flight departure site, flight departure time, flight arrival time, flight destination site and/or alternate flight destination site), flight plan schedule, expected weather along each flight route segment, aircraft specifics, airspace (altitude) bounds for each flight route segment, navigational aids available. The invention provides flight plan routing and direct routing or wind optimal routing, using great circle navigation and spherical Earth geometry. The invention provides for aircraft dynamics effects, such as wind effects at each altitude, altitude changes, airspeed changes and aircraft turns to provide predictions of aircraft trajectory (and, optionally, aircraft fuel use). A second system provides several aviation applications using the first system. Several classes of potential incidents are analyzed and averted, by appropriate change en route of one or more parameters in the flight plan configuration, as provided by a conflict detection and resolution module and/or traffic flow management modules. These applications include conflict detection and resolution, miles-in trail or minutes-in-trail aircraft separation, flight arrival management, flight re-routing, weather prediction and analysis and interpolation of weather variables based upon sparse measurements. The invention combines these features to provide an aircraft monitoring system and an aircraft user system that interact and negotiate changes with each other.

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

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

  4. SET-Routes programme

    CERN Document Server

    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.

  5. Route Repetition and Route Retracing: Effects of Cognitive Aging

    Directory of Open Access Journals (Sweden)

    Jan Malte Wiener

    2012-05-01

    Full Text Available Retracing a recently traveled route is a frequent navigation task when learning novel routes or exploring unfamiliar environments. In the present study we utilized virtual environments technology to investigate age-related differences in repeating and retracing a learned route. In the training phase of the experiment participants were guided along a route consisting of multiple intersections each featuring one unique landmark. In the subsequent test phase, they were guided along short sections of the route and asked to indicate overall travel direction (repetition or retracing, the direction required to continue along the route, and the next landmark they would encounter. Results demonstrate age-related deficits in all three tasks. More specifically, in contrast to younger participants, the older participants had greater problems during route retracing than during route repetition. While route repetition can be solved with egocentric response or route strategies, successfully retracing a route requires allocentric processing. The age-related deficits in route retracing are discussed in the context of impaired allocentric processing and shifts from allocentric to egocentric navigation strategies as a consequence of age-related hippocampal degeneration.

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

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

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

  9. Electronic route information panels (DRIPs).

    NARCIS (Netherlands)

    2008-01-01

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

  10. Operational Evaluatioin of Dynamic Weather Routes at American Airlines

    Science.gov (United States)

    McNally, David; Sheth, Kapil; Gong, Chester; Borchers, Paul; Osborne, Jeff; Keany, Desmond; Scott, Brennan; Smith, Steve; Sahlman, Scott; Lee, Chuhan; Cheng, Jinn-Hwei

    2013-01-01

    Dynamic Weather Routes (DWR) is a search engine that continuously and automatically analyzes inflight aircraft in en route airspace and proposes simple route amendments for more efficient routes around convective weather while considering sector congestion, traffic conflicts, and active Special Use Airspace. NASA and American Airlines (AA) are conducting an operational trial of DWR at the AA System Operations Center in Fort Worth, TX. The trial includes only AA flights in Fort Worth Center airspace. Over the period from July 31, 2012 through August 31, 2012, 45% of routes proposed by DWR and evaluated by AA users - air traffic control coordinators and flight dispatchers - were rated as acceptable as proposed or with some modifications. The wind-corrected potential flying time savings for these acceptable routes totals 470 flying min, and results suggest another 1,500 min of potential savings for flights not evaluated due to staffing limitations. A sector congestion analysis shows that in only two out of 83 DWR routes rated acceptable by AA staff were the flights predicted to fly through a congested sector inside of 30 min downstream of present position. This shows that users considered sector congestion data provided by DWR automation and in nearly all cases did not accept routes through over-capacity sectors. It is estimated that 12 AA flights were given reroute clearances as a direct result of DWR for a total savings of 67 flying min.

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

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

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

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

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

  16. Geographic Routing on Improved Coordinates

    OpenAIRE

    Brandes, Ulrik; Fleischer, Daniel

    2007-01-01

    We consider routing methods for networks when geographic positions of nodes are available. Instead of using the original geographic coordinates, however, we precompute virtual coordinates using barycentric layout. Combined with simple geometric routing rules, this greatly reduces the lengths of routes and outperforms algorithms working on the original coordinates. Along with experimental results we proof properties such as guaranteed message delivery and worst-case optimality. Our methods app...

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

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

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

  20. Qos Routing Scheme and Route Repair in WSN

    Directory of Open Access Journals (Sweden)

    M. Belghachi

    2013-01-01

    Full Text Available During the last decade, a new type of wireless network has evoked great interest among the scientific community; it is the wireless sensor networks (WSN. The WSN are used in various social activities, such as industrial processes, military surveillance applications, observation and monitoring of habitat, etc... This diversity of applications brings these networks to support different types of traffic and to provide services that must be both generic and adaptive for applications, the properties of the quality of service (QoS are different from one application to another. However, the need to minimize energy consumption has been the most important field of WSNs research. Few studies in the field are concerned with mechanisms for efficiently delivering QoS at the application level from network level metrics and connection such as delay or bandwidth, while minimizing the energy consumption of sensor nodes that are part of network. The idea is to ensure QoS through a routing process, which can detect paths that meet the QoS requirements based on ant colony optimization (ACOs, coupled with detected routes reservation process. However, it is necessary to integrate to this diagram the maintenance of route disrupted during communication. We propose a method that aims to improve the probability of success of a local route repair. This method based on the density of nodes in the vicinity of a route, as well as on the availability of this vicinity. Taking into account these parameters in the route selection phase (end of the routing process allows selecting among multiple routes, the one which is potentially the most easily repairable. In addition, we propose a method for early detection of the failure of a local route repair. This method can directly trigger a process of global re-routing that better fits to restore communication between the source and destination.

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

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

  3. Stochastic Vehicle Routing with Recourse

    CERN Document Server

    Goertz, Inge Li; Saket, Rishi

    2012-01-01

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage optimization 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 lambda. We present an O(log^2 n log(n lambda))-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 orienteering, called knapsack rank-function orienteering. We also give a better approximation ratio for knapsack rank-function orienteering than what follows from prior work. Finally, we provide a Unique Games Conjecture based omega(1) hardness of approximation for StochVRP, even on star-like metrics on which our algorithm achieves a logarithmic approximation.

  4. 基于元胞蚂蚁算法的防空靶机航路规划研究%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.

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

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

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

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

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

  10. Local Routing in Convex Subdivisions

    DEFF Research Database (Denmark)

    Bose, Prosenjit; Durocher, Stephane; Mondal, Debajyoti;

    2015-01-01

    In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local geometric routing algorithms can guarantee delivery to the target node only in restricted...... classes of geometric graphs, such as triangulations. In order to guarantee delivery on more general classes of geometric graphs (e.g., convex subdivisions or planar subdivisions), previous local geometric routing algorithms required Θ(logn) state bits to be stored and passed with the message. We present...... the first local geometric routing algorithm using only one state bit to guarantee delivery on convex subdivisions and the first local geometric memoryless routing algorithm that guarantees delivery on edge-augmented monotone subdivisions (including all convex subdivisions) when the algorithm has knowledge...

  11. Route Optimization in Network Mobility

    Directory of Open Access Journals (Sweden)

    Md. Hasan Tareque

    2013-01-01

    Full Text Available NEtwork MObility (NEMO controls mobility of a number of mobile nodes in a comprehensive way using one or more mobile routers. To choose a route optimization scheme, it is very important to have a quantitative comparison of the available route optimization schemes. The focus of this paper is to analyze the degree of Route Optimization (RO, deploy-ability and type of RO supported by each class in general. The comparison shows the differences among the schemes in terms of issues, such as additional header, signaling and memory requirement. We classify the schemes established on the basic method for route optimization, and equal the schemes based on protocol overhead, such as header overhead, amount of signaling, and memory requirements. Lastly the performance of the classes of different schemes has to be estimated under norms such as available bandwidth, topology of the mobile network and mobility type.

  12. Dynamic Routing with Security Considerations

    Directory of Open Access Journals (Sweden)

    G. Murali

    2011-11-01

    Full Text Available Now-a-days 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. Apart from that we will propose a dynamic 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(RIP in wired networks and Destination-Sequenced Distance Vector(DSDV protocol in wireless networks, without introducing extra control messages. 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. This algorithm is mainly proposed to improve the security 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, they unavoidably introduce substantial overheads in the Gateway/Host performance and effective network bandwidths. This routing protocol is compatible with the Routing Information Protocol which uses hop-count as its Routing metric. So there will be a limited number of hops and data transmissions are done by selecting hops randomly in a network. This improves security as well as controls traffic in the network. So, the procedure also includes using the multipath routing to select the paths to be followed. It uses the randomization process for selecting the number of hops to be selected for transforming the data. The routing table in this algorithm is based on the well-known Bellman-Ford algorithm. So, this overcomes the problems with security and traffic occurred with increase in the number of networks in these days

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

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

  15. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neither...... 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...

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

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

  18. Optimization of OSPF Routing in IP Networks

    Science.gov (United States)

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

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

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

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

  1. Routing Algorithm Exploits Spatial Relations

    Science.gov (United States)

    Okino, Clayton; Jennings, Esther

    2004-01-01

    A recently developed routing algorithm for broadcasting in an ad hoc wireless communication network takes account of, and exploits, the spatial relationships among the locations of nodes, in addition to transmission power levels and distances between the nodes. In contrast, most prior algorithms for discovering routes through ad hoc networks rely heavily on transmission power levels and utilize limited graph-topology techniques that do not involve consideration of the aforesaid spatial relationships. The present algorithm extracts the relevant spatial-relationship information by use of a construct denoted the relative-neighborhood graph (RNG).

  2. le programme SET-Routes

    CERN Document Server

    CERN Audiovisual Service

    2009-01-01

    Les routes de la science sont plus escarpées pour les femmes Le programme SET-Routes, qui visait à sensibiliser les jeunes filles à l’intérêt des carrières scientifiques, a pris fin en avril. Porté par l’EMBL, l’EMBO et le CERN, il a mis en place un réseau de femmes scientifiques, des ambassadrices qui se sont rendues dans les établissements scolaires européens pour parler de leur parcours scientifique.

  3. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

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

    2012-01-01

    instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...... orienteering, called knapsack rank-function orienteering. We also give a better approximation ratio for knapsack rank-function orienteering than what follows from prior work. Finally, we provide a Unique Games Conjecture based ω(1) hardness of approximation for StochVRP, even on star-like metrics on which our...

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

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

  6. Genetic algorithms for route discovery.

    Science.gov (United States)

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

    2006-12-01

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

  7. Genetic algorithms for route discovery.

    Science.gov (United States)

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

    2006-12-01

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

  8. How to choose the route.

    Science.gov (United States)

    Grecu, Irina

    2013-01-01

    Choosing the route for nutrition support delivery is one of the main steps in the algorithm of providing successful nutrition to the critically ill, but it is certainly not an easy process. The rationale should be guided not only by principles like physiology and benefit versus harm, but also by individual patient factors like feasibility, contraindications, predicted versus actual tolerance, and (most important) the timing for starting food delivery. Although oral nutrition is the more physiological route for feeding, it is seldom possible or sufficient in critically ill patients. Enteral nutrition, in the form of tube feeding, remains the best option in the absence of absolute contraindications, but many other factors should be taken into account. These include the importance of starting early and trying to achieve target nutrients delivery early, especially in previously undernourished or in most severely ill patients, as well as the gastrointestinal intolerance present in the majority of critically ill patients. Parenteral nutrition is an alternative route for nutrition delivery when the enteral one is impossible or insufficient. The most common complication when choosing this route is overfeeding, which has been associated with increased complications rate. On the other hand, the most common complication of enteral nutrition is underfeeding, which has also been associated with worse outcome and even increased mortality. Combining enteral with supplemental parenteral nutrition is therefore a rational approach for providing early and adequate nutritional support in the most severely ill patients.

  9. The routed inventory pooling problem

    NARCIS (Netherlands)

    Bouma, Harmen Willem

    2013-01-01

    In supply chains vloeit een groot deel van de kosten voort uit voorraden en transport. Om deze reden wordt veel onderzoek gedaan naar technieken en concepten die de voorraad- en transportkosten helpen te verlagen. Twee populaire onderzoeksgebieden zijn Inventory Routing, waarbij het doel is optimale

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

  11. The Effects of the Emission Cost on Route Choices of International Container Ships

    Directory of Open Access Journals (Sweden)

    Hyangsook Lee

    2016-01-01

    Full Text Available Maritime freight shipping has increased significantly and air pollution from international ships has grown accordingly, having serious environmental effects all over the world. This paper analyzes the effects of the emission cost on ocean route choices, focusing on international container ships. First, the paper formulates a freight network model that captures decisions and interactions of ocean carriers and port terminal operators in the maritime freight transport system. Then, the emission cost is calculated based on an activity-based approach as a component of the ocean transportation cost function. A case study is examined to find if the emission cost affects ocean route choices. The results indicate that the optimal ocean route and transportation cost are changed distinctively due to the emission cost. The research discusses how the emission cost plays a role in route changes and why ocean carriers have to consider these costs in their routing decisions.

  12. Optimum Route Selection for Vehicle Navigation

    Directory of Open Access Journals (Sweden)

    Dalip

    2016-02-01

    Full Text Available The objective of Optimum Route Selection for Vehicle Navigation System (ORSVNS article is to develop a system, which provides information about real time alternate routes to the drivers and also helps in selecting the optimal route among all the alternate routes from an origin to destination. Two types of query systems, special and general, are designed for drivers. Here, the criterion for route selection is introduced using primary and secondary road attributes. The presented methodology helps the drivers in better decision making to choose optimal route using fuzzy logic. For experimental results ORSVNS is tested over 220 km portion of Haryana state in India.

  13. Route Scherrer and Route Einstein closed for construction work

    CERN Multimedia

    2015-01-01

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

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

  15. Multipath Routing Protocol for Effective Local Route Recovery in Mobile Ad hoc Network

    Directory of Open Access Journals (Sweden)

    S. K. Srivatsa

    2012-01-01

    Full Text Available Problem statement: In mobile ad hoc networks, frequent mobility during the transmission of data causes route failure which results in route rediscovery. In this, we propose multipath routing protocol for effective local route recovery in Mobile Ad hoc Networks (MANET. In this protocol, each source and destination pair establishes multiple paths in the single route discovery and they are cached in their route caches. Approach: The cached routes are sorted on the basis of their bandwidth availability. In case of route failure in the primary route, a recovery node which is an overhearing neighbor, detects it and establishes a local recovery path with maximum bandwidth from its route cache. Results: By simulation results, we show that the proposed approach improves network performance. Conclusion: The proposed route recovery management technique prevents the frequent collision and degradation in the network performance.

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

  17. 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...... of a pyramidal route is such that its traversal can be divided in two parts, where on the first part of the route, customers are visited in nondecreasing distance from the depot, and on the remaining part of the route, customers are visited in nonincreasing distance from the depot. Such a route shape is indeed...... found in many optimal solutions to CVRP instances. An optimal solution to the PCVRP may therefore be useful in itself as a heuristic solution to the CVRP. Further, an attempt can be made to find an even better CVRP solution by solving a TSP, possibly leading to a non-pyramidal route, for each...

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

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

  20. Visual perception aspects of excursion route composition

    OpenAIRE

    Antonets, Margaryta

    2013-01-01

    Research dedicated to the influence of visual perception on landscape excursion routes composition should be based on the characteristics of human perception of the environment. During forming of excursion route an important part is design of visual frames as the primary compositional elements of visual impressions. The general visual impression of the route is characterized by two parameters: the level of attractiveness of objects and the level of attractiveness of route.

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

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

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

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

  5. Verkeersveiligheidseffecten van Dynamische Route Informatie Panelen (DRIP's).

    NARCIS (Netherlands)

    2008-01-01

    The term Dynamic Route Information Panel (DRIP) is, also in the Netherlands, used for an electronic route information panel. A DRIP usually indicates if there are queues on the various routes to a particular destination, how long they are, and sometimes what the estimated journey time is. This is in

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

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

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

  9. Real-time routing control design for traffic networks with multi-route choices

    Institute of Scientific and Technical Information of China (English)

    罗莉华; 葛颖恩; 陈继红; 张方伟

    2016-01-01

    This work considers those road networks in which there are multi-route choices for bifurcation-destination (or origin-destination) pairs, and designs a real-time variable message sign (VMS)-based routing control strategy in the model predictive control (MPC) framework. The VMS route recommendation provided by the traffic management authority is directly considered as the control variable, and the routing control model is established, in which a multi-dimensional control vector is introduced to describe the influence of route recommendations on flow distribution. In the MPC framework, a system optimum routing strategy with the constraints regarding drivers’ acceptability with recommended routes is designed, which can not only meet the traffic management authority’s control requirement but also improve drivers’ satisfaction with the route guidance system. The simulation carried out shows that the proposed routing control can effectively mitigate traffic congestion, reduces followers’ time delay, and improves drivers’ satisfaction with routing control in road networks.

  10. 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....... A main feature of the algorithm is that exact pricing over elementary routes are done in pseudo-polynomial time. Computational results suggest that PCVRP solutions are highly useful for obtaining near-optimal solutions to the CVRP. Furthermore, pricing of pyramidal routes may prove to be very useful...

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

  12. Classification of Dynamic Vehicle Routing Systems

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

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

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

  16. MILITARY MULTI-HOP ROUTING PROTOCOL

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Military tactical network is one of the most important applications of ad hoc network. Currently the existing routing protocols are put forward based on the simple and universal network model which has the ability of multi-hop routing but cannot work efficiently in the special military applications. The narrow bandwidth and limited energy of the wireless network make general routing protocols seem to be more redundant.In order to satisfy military needs properly, this letter makes a detailed analysis of physical nodes and traffic distribution in military network, uses cross-layer design concept for reference, combines traffic characteristic of application layer with routing protocol design. It categorized routing problem as crucial routes and non-crucial routes which adopted separate maintenance methods. It not only realizes basic transmission function but also works efficiently. It is quite fit for military application.

  17. A Genetic Algorithm on Inventory Routing Problem

    Directory of Open Access Journals (Sweden)

    Nevin Aydın

    2014-03-01

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

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

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

  20. Research on Routing Protocol of Mobile Ad Hoc Network

    OpenAIRE

    Tuo Ming Fu; Che Min

    2016-01-01

    Routing protocol is an important content of mobile Ad Hoc. The typical mobile Ad Hoc network routing protocols is introduced. The advantages and disadvantages of these routing protocols are analyzed. A hybrid routing protocol is put forward based on this.

  1. Evolutionary air traffic flow management for large 3D-problems

    NARCIS (Netherlands)

    Kemenade, C.H.M. van; Akker, J.M. van den; Kok, J.N.

    1996-01-01

    We present an evolutionary tool to solve free-route Air Traffic Flow Management problems within a three-dimensional air space. This is the first evolutionary tool which solves free-route planning problems involving a few hundred aircraft. We observe that the importance of the recombination operator

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  16. Performance of Conferencing over MANET Routing Protocols

    Directory of Open Access Journals (Sweden)

    Md. Ibrahim Abdullah

    2012-06-01

    Full Text Available Wireless ad hoc network represents a system of wireless nodes that can freely and dynamically self-organize into arbitrary and temporary network topologies, allowing people and devices to seamlessly internet-work in areas without any preexisting communication infrastructure. The routing protocols of this network elapsed much time in route discovery and route maintenances. In this research work we have studied the performance of routing protocols DSR and AODV when the nodes involved in video conferencing. Simulation studies show that AODV is better than DSR in coverage area with acceptable delay and packet loss.

  17. Biocatalytic Route to Surface Active Lipid

    DEFF Research Database (Denmark)

    Cheong, Ling-Zhi; Xu, Xuebing

    Lipid can be structurally modified in order to attain improved functional properties. This work look into the possibilities of developing surface active lipids with improved functional properties through biocatalytic route. Biocatalytic route to surface active lipid are usually complex involving...... a biphasic system as the substrates used may differs in polarity. In some instances, chemical synthetic route are used. Attempts are made to study the biocatalytic route to surface active lipid including various factors affecting synthesis of such compounds. The surface active lipids produced may have...

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

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

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

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

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

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

  4. What Is the Best Route? Route-Finding Strategies of Middle School Students Using GIS

    Science.gov (United States)

    Wigglesivorth, John C.

    2003-01-01

    This paper summarizes a research project conducted to investigate the strategies developed by middle school students to solve a route-finding problem using Arc View GIS software. Three different types of route-finding strategies were identified. Some students were visual route-finders and used a highly visual strategy; others were logical route…

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

  6. Performance Evaluation of Routing Protocols in MANET

    Directory of Open Access Journals (Sweden)

    Smitha Sunny

    2015-01-01

    Full Text Available Mobile Ad-Hoc Network (MANET is an autonomous system that is composed of the mobile nodes which communicates through wireless links without any preexisting infrastructure. MANET is a collection of mobile nodes which can self-organize freely and dynamically into arbitrary and temporary network topologies. Mobile nodes in ad-hoc networks function as a router and can dynamically establish routes among themselves by means of a routing protocol. Routing protocols in mobile ad-hoc network helps node to send and receive packets. Therefore, selection of an appropriate routing protocol is an integral part of establishing a MANET. A suitable and effective routing mechanism helps to extend the successful deployment of mobile ad-hoc networks. An attempt has been made to compare the performance between on-demand reactive routing protocols namely AODV, DSR and proactive routing protocol namely DSDV for Constant Bit Rate (CBR traffic by varying network scope i.e. number of participating nodes as well as by varying the speed. The parameters used for evaluation are Packet delivery ratio (PDR, Normalized routing overhead, Average end to end delay (Delay, Throughput and Average Energy consumption. The simulations are carried out using Network Simulator NS2:34.

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

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

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

  10. Vessel Route Choice Theory and Modeling

    NARCIS (Netherlands)

    Shu, Y.; Daamen, W.; Ligteringen, H.; Hoogendoorn, S.P.

    2015-01-01

    A new maritime traffic model describes vessel traffic in ports and inland waterways better. In this research, vessel behavior is categorized into a tactical level (route choice) and an operational level (dynamics of vessel behavior). This new maritime traffic model comprises two parts. The route cho

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

  12. Routing in Optical and Stochastic Networks

    NARCIS (Netherlands)

    Yang, S.

    2015-01-01

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

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

  14. Using Collective Intelligence to Route Internet Traffic

    Science.gov (United States)

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

    1998-01-01

    A Collective Intelligence (COIN) is a community of interacting reinforcement learning (RL) algorithms designed so that their collective behavior maximizes a global utility function. We introduce the theory of COINs, then present experiments using that theory to design COINs to control internet traffic routing. These experiments indicate that COINs outperform previous RL-based systems for such routing that have previously been investigated.

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

  16. Joint Route Planning under Varying Market Conditions

    NARCIS (Netherlands)

    Cruijssen, F.C.A.M.; Braysy, O.; Dullaert, W.; Fleuren, H.A.; Salomon, M.

    2006-01-01

    Purpose - To provide empirical evidence on the level of savings that can be attained by joint route planning and how these savings depend on specific market characteristics.Design/methodology/approach - Joint route planning is a measure that companies can take to decrease the costs of their distribu

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

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

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

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

  1. Routing architecture and security for airborne networks

    Science.gov (United States)

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

    2009-05-01

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

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

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

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

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

  6. Dynamic Route Shortening and Route Repairing Mechanism for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    T. R. Rangaswamy

    2012-01-01

    Full Text Available Problem statement: Ad hoc Networks are wireless networks without any fixed infrastructure. The network topology changes frequently and unpredictably due to the random movement of the nodes. The ad hoc on Demand Distant Vector Routing (AODV protocol works in a dynamic fashion, by establishing a route on demand and continues that route until it breaks. Due to the changing network topology of ad hoc networks, if other routes with less hop count become available, the network topology is not able to adapt until the route break occurs. Hence in the route shortening scheme is some redundant nodes in the active route is replaced with a node that is not on the active route. When there is any link failure between any two nodes, the alternative route with optimum route to be constructed and not sending RRER message to the source node to initiate the route discovery process again. Approach: This study proposes a new routing protocol called, Dynamic Route Shortening and Repairing mechanism (DRSR. The route shortening is incorporated with route repairing mechanism, to improve the performance of the AODV. The route shortening scheme works by replacing some redundant nodes in the active route, with a node that is not on the active route. If there is a link failure between the two nodes, the route repairing mechanism repairs the route, by using the nodes that are close enough to the route to overhear the message. Whenever the links go down, the DRSR replaces the failed links with the optimum route that is adjacent to the main route and not sending and RRER message to the source node to initiate the route discovery process again. The alternative route construction process could be initiated at any time, not just when a route has failed. The dynamically constructed alternative route’s information is passed on to the upstream nodes, which then determine by themselves when to direct their packets to the Normal 0 false false false EN-US X

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

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

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

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

  11. Effective Privacy-Preserving Online Route Planning

    DEFF Research Database (Denmark)

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

    2011-01-01

    An online Route Planning Service (RPS) computes a route from one location to another. Current RPSs such as Google Maps require the use of precise locations. However, some users may not want to disclose their source and destination locations due to privacy concerns. An approach that supplies fake...... 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...

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

  13. Analysis of Enhanced Associativity Based Routing Protocol

    Directory of Open Access Journals (Sweden)

    Said A. Shaar

    2006-01-01

    Full Text Available This study introduces an analysis to the performance of the Enhanced Associativity Based Routing protocol (EABR based on two factors; Operation complexity (OC and Communication Complexity (CC. OC can be defined as the number of steps required in performing a protocol operation, while CC can be defined as the number of messages exchanged in performing a protocol operation[1]. The values represent the worst-case analysis. The EABR has been analyzed based on CC and OC and the results have been compared with another routing technique called ABR. The results have shown that EABR can perform better than ABR in many circumstances during the route reconstruction.

  14. Stability Analysis of Path-vector Routing

    CERN Document Server

    Dimitri, Papadimitriou

    2012-01-01

    Most studies on path-vector routing stability have been conducted empirically by means of ad-hoc analysis of BGP data traces. None of them consider prior specification of an analytic method including the use of stability measurement metrics for the systematic analysis of BGP traces and associated meta-processing for determining the local state of the routing system. In this paper, we define a set of metrics that characterize the local stability properties of path-vector routing such as BGP (Border Gateway Protocol). By means of these stability metrics, we propose a method to analyze the effects of BGP policy- and protocol-induced instability on local routers.

  15. Partially dynamic vehicle routing - models and algorithms

    DEFF Research Database (Denmark)

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

    2002-01-01

    In this paper we propose a framework for dynamic routing systems based on their degree of dynamism. Next, we consider its impact on solution methodology and quality. Specifically, we introduce the Partially Dynamic Travelling Repairman Problem and describe several dynamic policies to minimize...... routing costs. The results of our computational study indicate that increasing the dynamic level results in a linear increase in route length for all policies studied. Furthermore, a Nearest Neighbour policy performed, on the average, uniformly better than the other dispatching rules studied. Among these...

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

  17. A SURVEY ON THE ALGORITHMIC APPROACH USED IN ROUTING FOR PLACEMENT AND ROUTING FLOW

    Directory of Open Access Journals (Sweden)

    KOMAL

    2014-06-01

    Full Text Available Routing is one of the long-drawn-out processes after placement in VLSI design. The routing provides the path for nets on chip to interconnect the pins on the pads or blocks at the chip boundary. This paper provides a systematic insight of interconnect of nets in ‘Placement and Routing Flow’ based on various methods (global routing and detailed routing. Further, the work reported so far has been compared with a multiple techniques for multiple factors such as reduction in wire-length, short execution time, fast and accurate congestion, improvement in complexity, signal integrity and crosstalk. Here the methodologies adopts are the Routing congestion estimator algorithm, Ant Colony Optimization. Firefly Algorithm, Monotonic Staircase Routing and so on. It is also observed that Pattern Based Routing is much faster than the Maze Routing, and the improved parameters are there is no over-congestion and 100% routablity with Monotonic Staircase Channels. zero overflow by Simulated-Evolution(Sim-E, and Complexity improved by a Fuzzified Approach Towards Global Routing.

  18. A multicast routing algorithm with multiple trees

    Institute of Scientific and Technical Information of China (English)

    Cui Xunxue; Gao Wei; Fang Hongyu

    2005-01-01

    Quality of service (QoS) multicast routing has continued to be a very important research topic in the Internet.A method of multicast routing is proposed to simultaneously optimize several parameters based on multiobjective genetic algorithm, after the related work is reviewed. The contribution lies on that the selection process of such routing is treated with multiobjective optimization. Different quality criterions in IP network are taken into account for multicast communications. A set of routing trees is generated to approximate the Pareto front of multicast problem. Multiple trees can be selected from the final set of nondominated solutions, and applied to obtain a good overall link cost and balance traffic distribution according to some simulation results.

  19. Rich Vehicle Routing Problems and Applications

    DEFF Research Database (Denmark)

    Wen, Min

    of these problems was motivated by our cooperation with industrial companies, particularly Transvision A/S and its client distributors, and Danish Crown. The models and methods proposed in the thesis are general and can be applied to practical routing problems arising in many other distribution companies as well...... the company’s solution in terms of all the objectives, including the travel time, customer waiting and daily workload balances, under the given constraints considered in the work. Finally, we address an integrated vehicle routing and driver scheduling problem, in which a large number of practical constraints......The 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...

  20. A new routing assignment model for Internet

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper builds a new traffic assignment model for Internet. The routing policy based on this model can realize load splitting in a network automatically, which overcomes the shortcoming of OSPF and satisfies the load balancing requirement of IETF.

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

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

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

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

  6. Recommended Cross-Desert Driving Route

    Institute of Scientific and Technical Information of China (English)

    2004-01-01

    Beijing - Duolun - Dalai Nur- Hexigten Banner -Saihanba - Weichang - Luanping - Miyun - Beijing. Along this 1,600-kilometer route is a 150-kin section(between Duolun and Darhan) of desert with no surfaced road - a paradise for desert drivers.

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

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

  9. Latent variables and route choice behavior

    DEFF Research Database (Denmark)

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

    2012-01-01

    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...... and bound algorithm. A hybrid model consists of measurement equations, which relate latent variables to measurement indicators and utilities to choice indicators, and structural equations, which link travelers’ observable characteristics to latent variables and explanatory variables to utilities. 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....

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

  11. Performance Evaluation of MANET Routing Protocols

    Directory of Open Access Journals (Sweden)

    Hrituparna Paul

    2012-07-01

    Full Text Available The task of finding and sustaining routes in Mobile Ad-hoc Networks (MANETS is an important factor in determining the efficiency of any MANET protocol. MANET characteristically is an autonomous system of mobile nodes connected by wireless links without any centralised infrastructure. Absence of fixed infrastructures and host mobility thus network may experience rapid and unpredictable topology changes. Hence, routing is required in order to perform communication among the entire network. There are several routing protocols namely proactive, reactive and hybrid etc. In this paper we will discuss the active research work on these routing protocols and its performance evaluation. To this end, we adopt a simulation approach, which is more suitable to this kind of analysis

  12. Finding routes in anonymous sensor networks

    OpenAIRE

    Dutra, Renato C.; Barbosa, Valmir C

    2005-01-01

    We consider networks of anonymous sensors and address the problem of constructing routes for the delivery of information from a group of sensors in response to a query by a sink. In order to circumvent the restrictions imposed by anonymity, we rely on using the power level perceived by the sensors in the query from the sink. We introduce a simple distributed algorithm to achieve the building of routes to the sink and evaluate its performance by means of simulations.

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

  14. Efficient Networks Communication Routing Using Swarm Intelligence

    OpenAIRE

    Koushal Kumar

    2012-01-01

    As demonstrated by natural biological swarm’s collective intelligence has an abundance of desirable properties for problem-solving like in network routing. The focus of this paper is in the applications of swarm based intelligence in information routing for communication networks. As we know networks are growing and adopting new platforms as new technologies comes. Also according to new demands and requirements networks topologies and its complexity is increasing with time. Thus it is becomin...

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

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

  17. Light olefins - challenges from new production routes?

    Energy Technology Data Exchange (ETDEWEB)

    Zimmermann, H. [Linde Engineering, Pullach (Germany)

    2007-07-01

    Light Olefins are the building blocks for many modern plastic products and are produced in large quantities. Driven by high crude oil prices, production is shifted to regions with low cost raw materials. Alternatives to the traditional production from Naphta, AGO and other crude products are becoming attractive. This paper evaluates several methods Ethylene and Pro-pylene production economically and also the regional advantageous routes. The analysis includes Steamcracking, dehydrogenation, dehydration of Ethanol, Methanol based routes and olefin conversion by Metathesis. (orig.)

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

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

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

  1. Energy Efficient Routing in Nomadic Networks

    DEFF Research Database (Denmark)

    Kristensen, Mads Darø; Bouvin, Niels Olof

    2007-01-01

    We present an evaluation of a novel energy-efficient routing protocol for mobile ad-hoc networks. We combine two techniques for optimizing energy levels with a well-known routing protocol. We examine the behavior of this combination in a nomadic network setting, where some nodes are stationary...... and have a steady power supply. Protocol optimizations for the nomadic scenario are presented and validated through simulations...

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

  4. Information Priority Based Multicast Routing in MANETs

    Directory of Open Access Journals (Sweden)

    Rajashekhar

    2011-07-01

    Full Text Available The routing efficiency in Mobile Ad Hoc Networks (MANETs suffers from frequent batterydrains, mobility and large variation of received signal strength. Thus, nodes and links in MANETsbecome more vulnerable and unstable. Multicast routing in MANETs for group communication requiresestablishment of reliable links between neighbouring nodes called as reliability pair beginning from thesource and extending such reliability pairs enroute to the destination. If there are multiple paths fromsource to every multicast destination, the reliability of source information may be enhanced by sendinghigher priority information on higher priority path.In this paper, we propose a scheme of Information Priority based Multicast Routing in MANETsusing multiple paths (IPMRM. IPMRM operates in following phases. (1 Reliability pair factorcomputation based on node power level, received differential signal strength between the nodes andmobility. (2 Pruning neighbor nodes that have reliability pair factor lesser than a threshold. (3 Findingmulticast mesh routes with multiple paths to a destination using request and reply packets. (4 Priorityassignment to multiple paths based on minimum value of reliability pair factor of a path and informationtransfer from source to multicast destination. (4 Route maintenance against link failures. The simulationresults for packet delivery ratio and control overhead demonstrate better performance of IPMRM overOn Demand Multicast Routing Protocol (ODMRP and Enhanced ODMRP (EODMRP.

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

  6. Survivable Lightpath Routing in WDM Optical Networks

    Institute of Scientific and Technical Information of China (English)

    LIUFengqing; ZENGQingji; ZHUXu; YANGXudong; XIAOShilin

    2004-01-01

    In IP over WDM networks, when a failure(such as a fiber cut) occurs, the service restoration can be implemented by dynamic routing in IP layer. But it needs that the logical topology remains connected after any physical link failure. Otherwise, IP layer cannot find an alternate path to restore the service. The problem of routing logical links (lightpaths) on a physical network topology in a way that the logical topology remains connected in the event of single physical link failure is called survivabl erouting. In this paper~ we address the survivable routing problem by proposing a new ILP algorithm that works well with sparse-connected logical topologies. The necessary and sufficient conditions for survivable routing are simplified, which greatly reduces the number of survivable constraints. Based-on the simplified conditions, a new ILP formulation with K-shortest paths as alternate paths for a logical link is presented, which mainly reduces the number of ILP variables. Finally, numerical results are given and discussed to show that most survivable routing solutions can be found with our algorithms, and the time needed to find such a survivable routing solution is much smaller than other similar methods.

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

  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. Pseudo-Cycle-Based Multicast Routing in Wormhole-Routed Networks

    Institute of Scientific and Technical Information of China (English)

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

    2003-01-01

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

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

  11. The Green Ship Routing and Scheduling Problem (GSRSP): A conceptual approach

    DEFF Research Database (Denmark)

    Kontovas, Christos A.

    2014-01-01

    Recent reviews of the literature on ship routing and scheduling note the increased attention to environmental issues. This is an area of paramount importance for international shipping and will be even more so in the future. This short communication is motivated by the increasing attention...... to 'green' routing and scheduling and outlines some possible ways to incorporate the air emissions dimension into maritime transportation OR. The main contribution of this note vis-a-vis the state of the art is that it conceptualizes the formulation of the 'Green Ship Routing and Scheduling Problem' (GSRSP......) based on existing formulations and highlights all the important parameters of the problem. (C) 2014 Elsevier Ltd. All rights reserved....

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

  13. The cost of simplifying air travel when modeling disease spread.

    Directory of Open Access Journals (Sweden)

    Justin Lessler

    Full Text Available BACKGROUND: Air travel plays a key role in the spread of many pathogens. Modeling the long distance spread of infectious disease in these cases requires an air travel model. Highly detailed air transportation models can be over determined and computationally problematic. We compared the predictions of a simplified air transport model with those of a model of all routes and assessed the impact of differences on models of infectious disease. METHODOLOGY/PRINCIPAL FINDINGS: Using U.S. ticket data from 2007, we compared a simplified "pipe" model, in which individuals flow in and out of the air transport system based on the number of arrivals and departures from a given airport, to a fully saturated model where all routes are modeled individually. We also compared the pipe model to a "gravity" model where the probability of travel is scaled by physical distance; the gravity model did not differ significantly from the pipe model. The pipe model roughly approximated actual air travel, but tended to overestimate the number of trips between small airports and underestimate travel between major east and west coast airports. For most routes, the maximum number of false (or missed introductions of disease is small (<1 per day but for a few routes this rate is greatly underestimated by the pipe model. CONCLUSIONS/SIGNIFICANCE: If our interest is in large scale regional and national effects of disease, the simplified pipe model may be adequate. If we are interested in specific effects of interventions on particular air routes or the time for the disease to reach a particular location, a more complex point-to-point model will be more accurate. For many problems a hybrid model that independently models some frequently traveled routes may be the best choice. Regardless of the model used, the effect of simplifications and sensitivity to errors in parameter estimation should be analyzed.

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

  15. A UAV routing and sensor control optimization algorithm for target search

    Science.gov (United States)

    Collins, Gaemus E.; Riehl, James R.; Vegdahl, Philip S.

    2007-04-01

    An important problem in unmanned air vehicle (UAV) and UAV-mounted sensor control is the target search problem: locating target(s) in minimum time. Current methods solve the optimization of UAV routing control and sensor management independently. While this decoupled approach makes the target search problem computationally tractable, it is suboptimal. In this paper, we explore the target search and classification problems by formulating and solving a joint UAV routing and sensor control optimization problem. The routing problem is solved on a graph using receding horizon optimal control. The graph is dynamically adjusted based on the target probability distribution function (PDF). The objective function for the routing optimization is the solution of a sensor control optimization problem. An optimal sensor schedule (in the sense of maximizing the viewed target probability mass) is constructed for each candidate flight path in the routing control problem. The PDF of the target state is represented with a particle filter and an "occupancy map" for any undiscovered targets. The tradeoff between searching for undiscovered targets and locating tracks is handled automatically and dynamically by the use of an appropriate objective function. In particular, the objective function is based on the expected amount of target probability mass to be viewed.

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

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

  18. Routing algorithms in networks-on-chip

    CERN Document Server

    Daneshtalab, Masoud

    2014-01-01

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

  19. Low Carbon Footprint Routes for Bird Watching

    Directory of Open Access Journals (Sweden)

    Wei-Ta Fang

    2015-03-01

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

  20. An Indirect Route for Ethanol Production

    Energy Technology Data Exchange (ETDEWEB)

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

    2005-04-29

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

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

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

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

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

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

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

  7. Routing Security in Mobile Ad-hoc Networks

    OpenAIRE

    Karlsson, Jonny; Dooley, Laurence S.; Pulkkis, Goran

    2012-01-01

    The role of infrastructure-less mobile ad hoc networks (MANETs) in ubiquitous networks is outlined. In a MANET there are no dedicated routers and all network nodes must contribute to routing. Classification of routing protocols for MANET is based on how routing information is acquired and maintained by mobile nodes and/or on roles of network nodes in a routing. According to the first classification base, MANET routing protocols are proactive, reactive, or hybrid combinations of proactive and ...

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

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

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

  11. Crosstalk-Aware Routing Resource Assignment

    Institute of Scientific and Technical Information of China (English)

    Hai-Long Yao; Yi-Ci Cai; Qiang Zhou; Xian-Long Hong

    2005-01-01

    Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.

  12. Pheromone Static Routing Strategy for Complex Networks

    Science.gov (United States)

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

    2012-12-01

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

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

  14. Next Generation Network Routing and Control Plane

    DEFF Research Database (Denmark)

    Fu, Rong

    proved, the dominating Border Gateway Protocol (BGP) cannot address all the issues that in inter-domain QoS routing. Thus a new protocol or network architecture has to be developed to be able to carry the inter-domain traffic with the QoS and TE consideration. Moreover, the current network control also...... of Service classes. Under the NGN context, there are plenty of proposals intending to accommodate the issues listed above. Path Computation Elements (PCE) proposed by IETF designs suitable network architecture that aiming at compute the QoS based paths for traffic transportation through intra- and inter...... (RACF) provides the platform that enables cooperation and ubiquitous integration between networks. In this paper, we investigate in the network architecture, protocols and algorithms for inter-domain QoS routing and traffic engineering. The PCE based inter-domain routing architecture is enhanced...

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

  16. Trust Based Routing in Ad Hoc Network

    Science.gov (United States)

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

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

  17. Prevention of Routing Attacks In Manet

    Directory of Open Access Journals (Sweden)

    N.Rajesh

    2013-01-01

    Full Text Available Mobile Ad hoc Networks (MANET are easily prone to attacks due to its network infrastructure. In previous routing attacks the malicious node is isolated using naive fuzzy response decisions. In this paper a new technology of broadcasting the awareness information about attacker node to all the existing nodes in the network is discussed. The awareness approach is based on an extended Dempster-Shafer mathematical theory(D-S Theory. Dempster-Shafer mathematical theory is used to collect the evidence notion of importance factors. The adaptiveness of the mechanism allows to systematically cope with the identified MANET routing attacks. The intrusion response action in MANET was addressed by isolating uncooperative nodes based on the node reputation derived from their behaviors. Here the effectiveness of the approach with the consideration of the packet delivery ratio and routing cost were demonstrated using java swing concepts

  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. Detours in Scope-Based Route Planning

    CERN Document Server

    Hliněný, Petr

    2012-01-01

    We study a dynamic scenario of the static route planning problem in road networks. Particularly, we put accent on the most practical dynamic case - increased edge weights (up to infinity). We show how to enhance the scope-based route planning approach presented at ESA'11 to intuitively by-pass closures by detours. Three variants of a detour "admissibility" are presented - from a simple one with straightforward implementation through its enhanced version to a full and very complex variant variant which always returns an optimal detour.

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

  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. Mathematical Aspects of Network Routing Optimization

    CERN Document Server

    Oliveira, Carlos AS

    2011-01-01

    Before the appearance of broadband links and wireless systems, networks have been used to connect people in new ways. Now, the modern world is connected through large-scale, computational networked systems such as the Internet. Because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area. "Mathematical Aspects of Network Routing Optimization" focuses on computational issues arising from the process of optimizing network routes, such as quality of the resulting links and their reli

  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. Optimized QoS Routing Algorithm

    Institute of Scientific and Technical Information of China (English)

    石明洪; 王思兵; 白英彩

    2004-01-01

    QoS routing is one of the key technologies for providing guaranteed service in IP networks. The paper focuses on the optimization problem for bandwidth constrained QoS routing, and proposes an optimal algorithm based on the global optimization of path bandwidth and hop counts. The main goal of the algorithm is to minimize the consumption of network resource, and at the same time to minimize the network congestion caused by irrational path selection. The simulation results show that our algorithm has lower call blocking rate and higher throughput than traditional algorithms.

  5. 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...... and Link Nested Logit. Estimates were produced from model specifications that considered level-of-service, label and facility dummy variables. Moreover, a modelling framework was designed to represent drivers’ choices as affected by the latent constructs extracted with factor analysis. Previous experience...

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

  7. Ant Colony Based Approach for Solving FPGA routing

    Directory of Open Access Journals (Sweden)

    Vinay Chopra

    2011-07-01

    Full Text Available This paper is based on an ant colony optimization algorithm (ASDR for solving FPGA routing for a route based routing constraint model in FPGA design architecture. In this approach FPGA routing task is transformed into a Boolean Satisfiabilty (SAT equation with the property that any assignment of input variables that satisfies the equation specifies a valid route. The Satisfiability equation is then modeled as Constraint Satisfaction problem, which helps in reducing procedural programming. Satisfying assignment for particular route will result in a valid routing and absence of a satisfying assignment implies that the layout is unroutable. In second step ant colony optimization algorithm is applied on the Boolean equation for solving routing alternatives utilizing approach of hard combinatorial optimization problems. The experimental results suggest that the developed ant colony optimization algorithm based router has taken extremely short CPU time as compared to classical Satisfiabilty based detailed router (SDR and finds all possible routes even for large FPGA circuits.

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

  9. On Reducing the Impact of Interdomain Route Changes

    Science.gov (United States)

    Levanti, Kyriaki; Lee, Sihyung; Kim, Hyong S.

    Interdomain route changes are frequent and they can have negative impact on a network's operation: during route convergence, packets get delayed and dropped; after route convergence, changes in the egress point for reaching a destination can alter the network's intradomain traffic patterns and trigger new traffic-engineering. In this paper, we look into reducing the impact of interdomain route changes on the network's operation. First, we investigate a route decision process which avoids the selection of routes that cause egress point changes. However, this decision process does not consider the potential benefit of selecting a more preferred route even if it causes an egress point change. Then, we propose a system which only avoids route changes causing recurring intradomain traffic shifts by processing the route changes history and by selectively modifying route attributes which affect the route decision process. We evaluate both approaches using data from a major European ISP. The modified route decision process avoids 89% of the observed intradomain traffic shifts caused by interdomain route changes, whereas route attribute modifications reduce the number of traffic shifts on average by 25%, and as much as 50%.

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

  11. Efficient Networks Communication Routing Using Swarm Intelligence

    Directory of Open Access Journals (Sweden)

    Koushal Kumar

    2012-11-01

    Full Text Available As demonstrated by natural biological swarm’s collective intelligence has an abundance of desirable properties for problem-solving like in network routing. The focus of this paper is in the applications of swarm based intelligence in information routing for communication networks. As we know networks are growing and adopting new platforms as new technologies comes. Also according to new demands and requirements networks topologies and its complexity is increasing with time. Thus it is becoming very difficult to maintain the quality of services and reliability of the networks using current Networks routing algorithms. Thus Swarm intelligence (SI is the collective behavior of decentralized self-organized systems, natural or artificial. The concept is employed in work on artificial intelligence. A new class of algorithms, inspired by swarm intelligence is currently being developed that can potentially solve numerous problems of modern communications networks. These algorithms rely on the interaction of a multitude of simultaneously interacting agents. In this paper we give disadvantages of previously used network routing algorithms and how we can apply swarm intelligence to overcome these problems.

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

  13. Graphical route information on variable message signs

    NARCIS (Netherlands)

    Alkim, T.P.; Mede, P.H.J. van der; Janssen, W.H.

    2002-01-01

    Reports on experiments in the Netherlands on the use of graphical route information panels (GRIP) as part of variable message systems (VMS) providing information to drivers. GRIP appear to be as safe as regular VMS. Digestion of the information presented is initially quicker for regular VMS, but mot

  14. Optical Multicast Routing Under Light Splitter Constraints

    CERN Document Server

    Jawhar, Shadi; 10.1109/ITNG.2010.168

    2010-01-01

    During the past few years, we have observed the emergence of new applications that use multicast transmission. For a multicast routing algorithm to be applicable in optical networks, it must route data only to group members, optimize and maintain loop-free routes, and concentrate the routes on a subset of network links. For an all-optical switch to play the role of a branching router, it must be equipped with a light splitter. Light splitters are expensive equipments and therefore it will be very expensive to implement splitters on all optical switches. Optical light splitters are only implemented on some optical switches. That limited availability of light splitters raises a new problem when we want to implement multicast protocols in optical network (because usual multicast protocols make the assumption that all nodes have branching capabilities). Another issue is the knowledge of the locations of light splitters in the optical network. Nodes in the network should be able to identify the locations of light ...

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

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

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

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

  20. A Geographical Heuristic Routing Protocol for VANETs

    Directory of Open Access Journals (Sweden)

    Luis Urquiza-Aguiar

    2016-09-01

    Full Text Available Vehicular ad hoc networks (VANETs leverage the communication system of Intelligent Transportation Systems (ITS. Recently, Delay-Tolerant Network (DTN routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation.

  1. Phone Routing using the Dynamic Memory Model

    DEFF Research Database (Denmark)

    Bendtsen, Claus Nicolaj; Krink, Thiemo

    2002-01-01

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

  2. 基于航线网络结构的上海浦东机场亚太枢纽竞争力分析%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.

  3. Optimal Route Selection Method Based on Vague Sets

    Institute of Scientific and Technical Information of China (English)

    GUO Rui; DU Li min; WANG Chun

    2015-01-01

    Optimal route selection is an important function of vehicle trac flow guidance system. Its core is to determine the index weight for measuring the route merits and to determine the evaluation method for selecting route. In this paper, subjective weighting method which relies on driver preference is used to determine the weight and the paper proposes the multi-criteria weighted decision method based on vague sets for selecting the optimal route. Examples show that, the usage of vague sets to describe route index value can provide more decision-making information for route selection.

  4. Escape probability based routing for ad hoc networks

    Institute of Scientific and Technical Information of China (English)

    Zhang Xuanping; Qin Zheng; Li Xin

    2006-01-01

    Routes in an ad hoc network may fail frequently because of node mobility. Stability therefore can be an important element in the design of routing protocols. The node escape probability is introduced to estimate the lifetime and stability of link between neighboring nodes and the escape probability based routing (EPBR) scheme to discover stable routes is proposed. Simulation results show that the EPBR can discover stable routes to reduce the number of route rediscovery, and is applicable for the situation that has highly dynamic network topology with broad area of communication.

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

  6. Route guidance strategies revisited: Comparison and evaluation in an asymmetric two-route traffic system

    CERN Document Server

    He, Zhengbing; Guan, Wei

    2013-01-01

    To alleviate traffic congestion, a variety of route guidance strategies has been proposed for intelligent transportation systems. A number of the strategies are proposed and investigated on a symmetric two-route traffic system over the past decade. To evaluate the strategies in a more general scenario, this paper conducts eight prevalent strategies on a asymmetric two-route traffic network with different slowdown behaviors on alternative routes. The results show that only mean velocity feedback strategy is able to equalize travel time, i.e., approximate user optimality; while the others fail due to incapability of establishing relations between the feedback parameters and travel time. The paper helps better understand these strategies, and suggests mean velocity feedback strategy if the authority intends to achieve user optimality.

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

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

  9. Route Recapitulation and Route Loyalty in Homing Pigeons: Pilotage From 25 km?

    Science.gov (United States)

    Biro, Dora; Meade, Jessica; Guilford, Tim

    2006-01-01

    We utilised precision Global Positioning System (GPS) tracking to examine the homing paths of pigeons (Columba livia) released 20 times consecutively 25 km from the loft. By the end of the training phase, birds had developed highly stereotyped yet individually distinct routes home, with detailed recapitulation evident at each stage of the journey. Following training, birds also participated in a series of releases from novel sites at perpendicular distances of up to 3 km from their established routes. Results showed that subjects were attracted back to their established routes and recapitulated them from the point of contact. Naïve conspecifics (yoked controls) released from the same off-route sites confirmed that the experienced birds' route choices were not influenced by constraints exerted by terrain features, but that increased experience with the general area conferred a homing advantage in the form of more efficient flight tracks, even from these novel sites. Patterns in the paths taken by experienced birds to rejoin their established routes are discussed with reference to navigational mechanisms employed by homing pigeons in their familiar area.

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

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

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

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

  14. Nanostructured aluminium oxide powders obtained by aspartic acid-nitrate gel-combustion routes

    Energy Technology Data Exchange (ETDEWEB)

    Gardey Merino, Maria Celeste, E-mail: mcgardey@frm.utn.edu.a [Laboratorio de Investigaciones y Servicios Ambientales Mendoza (LISAMEN) - CCT - CONICET, Avda. Ruiz Leal s/n, Parque Gral. San Martin, (M5502IRA) Ciudad de Mendoza, Prov. de Mendoza (Argentina); Grupo CLIOPE, Universidad Tecnologica Nacional - Facultad Regional Mendoza, Rodriguez 273, (M5502AJE) Ciudad de Mendoza, Prov. de Mendoza (Argentina); Lascalea, Gustavo E. [Laboratorio de Investigaciones y Servicios Ambientales Mendoza (LISAMEN) - CCT - CONICET, Avda. Ruiz Leal s/n, Parque Gral. San Martin, (M5502IRA) Ciudad de Mendoza, Prov. de Mendoza (Argentina); Sanchez, Laura M. [CINSO (Centro de Investigaciones en Solidos), CITEFA - CONICET, J.B. de La Salle 4397, (B1603ALO) Villa Martelli, Prov. de Buenos Aires (Argentina); Vazquez, Patricia G. [Centro de Investigacion y Desarrollo en Ciencias Aplicadas ' Dr. Jorge J. Ronco' (CINDECA), CONICET, Universidad Nacional de La Plata, Calle 47 nro. 257, (B1900AJK) La Plata, Prov. de Buenos Aires (Argentina); Cabanillas, Edgardo D. [CONICET and Centro Atomico Constituyentes, Comision Nacional de Energia Atomica, Gral. Paz 1499, (1650) San Martin, Prov. de Buenos Aires (Argentina); Lamas, Diego G. [CINSO (Centro de Investigaciones en Solidos), CITEFA - CONICET, J.B. de La Salle 4397, (B1603ALO) Villa Martelli, Prov. de Buenos Aires (Argentina)

    2010-04-16

    In this work, two new gel-combustion routes for the synthesis of Al{sub 2}O{sub 3} nanopowders with aspartic acid as fuel are presented. The first route is a conventional stoichiometric process, while the second one is a non-stoichiometric, pH-controlled process. These routes were compared with similar synthesis procedures using glycine as fuel, which are well-known in the literature. The samples were calcined in air at different temperatures, in a range of 600-1200 {sup o}C. They were characterized by X-ray diffraction, scanning electron microscopy, transmission electron microscopy and BET specific surface area. Different phases were obtained depending on the calcination temperature: amorphous, {gamma} (metastable) or {alpha} (stable). The amorphous-to-{gamma} transition was found for calcination temperatures in the range of 700-900 {sup o}C, while the {gamma}-to-{alpha} one was observed for calcination temperatures of 1100-1200 {sup o}C. The retention of the metastable {gamma} phase is probably due to a crystallite size effect. It transforms to the {alpha} phase after the crystallite size increases over a critical size during the calcination process at 1200 {sup o}C. The highest BET specific surface areas were obtained for both nitrate-aspartic acid routes proposed in this work, reaching values of about 50 m{sup 2}/g.

  15. A Study on Competitiveness of Sea Transport by Comparing International Transport Routes between Korea and EU

    Directory of Open Access Journals (Sweden)

    Dae-seop Moon

    2015-03-01

    Route 1 was found the most competitive, and Route 5, the most widely used sea way was ranked the lowest. In addition, the new transport routes, Route 1 and 6 are shown to be more competitive than the currently available routes, Route 2, 3 and 4. However, these routes need national level supports (rail construction for Route 1 and subsidy plan for Route 6 for the commercial use in the future.

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

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

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

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

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

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

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

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

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

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

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

  8. Link Perdurability Based Routing for Mobile Ad Hoc Networks

    Institute of Scientific and Technical Information of China (English)

    Sun Xuebin; Zhou Zheng

    2003-01-01

    Ad Hoc networks are prone to link failures due to mobility. In this letter, a link perdurability based routing scheme is proposed to try dealing with this problem. This scheme uses signal strength measurements to estimate the route life time and hence chooses a stable route, and is implemented in two typical ad hoc routing protocols to evaluate its performance. The simulation results have shown that this scheme can improve these protocols' packet delivery ratio in cases where there are frequent link failures.

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

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

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

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

  13. 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......-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...... show that it is possible to reduce GHGs emissions at the expense of an increase in the path length, and, in some cases, in the blocking probability. The trade-off between emissions and performance is studied. To the authors knowledge, this is the first work that provides a detailed study of a green...

  14. Pedestrian Route Choice by Iterated Equilibrium Search

    CERN Document Server

    Kretz, Tobias; Hofsäß, Ingmar

    2014-01-01

    In vehicular traffic planning it is a long standing problem how to assign demand such on the available model of a road network that an equilibrium with regard to travel time or generalized costs is realized. For pedestrian traffic this question can be asked as well. However, as the infrastructure of pedestrian dynamics is not a network (a graph), but two-dimensional, there is in principle an infinitely large set of routes. As a consequence none of the iterating assignment methods developed for road traffic can be applied for pedestrians. In this contribution a method to overcome this problem is briefly summarized and applied with an example geometry which as a result is enhanced with routes with intermediate destination areas of certain shape. The enhanced geometry is used in some exemplary assignment calculations.

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

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

  17. On the Lorentzian route to Relativity

    CERN Document Server

    Gürel, Atilla

    2011-01-01

    We discuss pedagogical problems associated with the conventional approach in teaching relativity and the potential value of "Lorentzian route to relativity" for addressing these pedagogical problems. We think that Lorentzian approach may be valuable part of an introduction to relativity but the historical route should be followed up to its end. It must namely include Einstein's application of Occam's razor in reinterpreting Lorentz transformations kinematically and the discussion of the central role of the evolution from Lorentz's "local time" to relativity of simultaneity. We discuss also what Occam's razor is not and why it should not cut "too deeply or too permanently". Some misleading remarks in relativity text books concerning for example Kennedy Thorndike experiment and Trouton-Noble experiment indicate the not uncommon lack of awareness about the degree observational equivalence between prerelativistic (Lorentzian) and relativistic viewpoints as far as special relativistic experiments are considered. K...

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

  20. Secure Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Soumyashree Sahoo

    2012-01-01

    Full Text Available Wireless sensor networks is the new concept in the field of networks consists of small, large number of sensing nodes which is having the sensing, computational and transmission power. Due to lack of tamper-resistant infrastructure and the insecure nature of wireless communication channels, these networks are vulnerable to internal and external attacks. Key Management is a major challenge to achieve security in wireless sensor networks. Key management includes the process of key setup, the initial distribution of keys and keys revocation. To provide security and proper routing or communication should be encrypted and authenticated. It is not easy to achieve secure key establishment without public key cryptography. In this thesis, some key management schemes have been purposed which will be valuable for secure routing between different sensor nodes.

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

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

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

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

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

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

  7. Exploring Routes to Persuasive Online Advertising

    OpenAIRE

    Wen-Chin Tsao

    2014-01-01

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

  8. Geographic Routing with Minimal Local Geometry

    OpenAIRE

    Samarasinghe, Kasun; Leone, Pierre

    2012-01-01

    Geographic routing based on virtual coordinates has been studied extensively, especially in environments expensive localization techniques are infeasible. Even though, the construction of virtual coordinate system is theoretically understood, their practical deployment is questionable due to computational requirements. An alternative approach is to use raw range measures from a special set of nodes called ”anchors” as virtual coordinates, which only preserve partial geographic knowledge. In t...

  9. 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...... was outlined, it took less thanone hour entering the design into the software and generating the auto-guidance files.KeywordsGIS, Auto steering systems, plot trial design, full-scale field trials, Java...

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

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

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

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

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

  15. Dynamic Equilibrium Assignment Convergence by En-route Flow Smoothing

    NARCIS (Netherlands)

    Pel, A.J.; Bliemer, M.C.J.; Hoogendoorn, S.P.

    2010-01-01

    An essential feature in many dynamic traffic assignment (DTA) models used for planning purposes is to compute the (dynamic) equilibrium assignment, where travellers follow user-optimal routes, leading to minimal experienced route travel times. To compute these time-varying route flows in the equilib

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

  17. 49 CFR 397.103 - Requirements for State routing designations.

    Science.gov (United States)

    2010-10-01

    ... § 397.201(c), shall select routes to minimize radiological risk using “Guidelines for Selecting... equivalent routing analysis which adequately considers overall risk to the public. Designations must be... to ensure consideration of all impacts and continuity of designated routes. (b) State...

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

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

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

  1. An approximate algorithm for solving the watchman route problem

    NARCIS (Netherlands)

    Li, Fajie; Klette, Reinhard; Sommer, G; Klette, R

    2008-01-01

    The watchman route problem (WRP) was first introduced in 1988 and is defined as follows: How to calculate a shortest route completely contained inside a simple polygon such that any point inside this polygon is visible from at least one point on the route? So far the best known result for the WRP is

  2. 14 CFR 25.123 - En route flight paths.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false En route flight paths. 25.123 Section 25... AIRWORTHINESS STANDARDS: TRANSPORT CATEGORY AIRPLANES Flight Performance § 25.123 En route flight paths. (a) For the en route configuration, the flight paths prescribed in paragraph (b) and (c) of this section...

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

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

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

  6. Collective Intelligence, Data Routing and Braess' Paradox

    CERN Document Server

    Tumer, K; 10.1613/jair.995

    2011-01-01

    We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system so that they work synergistically to maximize a global utility. The particular problem domain we explore is the control of network routing by placing agents on all the routers in the network. Conventional approaches to this task have the agents all use the Ideal Shortest Path routing Algorithm (ISPA). We demonstrate that in many cases, due to the side-effects of one agent's actions on another agent's performance, having agents use ISPA's is suboptimal as far as global aggregate cost is concerned, even when they are only used to route infinitesimally small amounts of traffic. The utility functions of the individual agents are not "aligned" with the global utility, intuitively speaking. As a particular example of this we present an instance of Braess' paradox in which adding new links to a network whose agents all use the ISPA results in a decrease in overall throughput. We also demonstrate th...

  7. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2011-01-01

    We study a location-routing problem in the context of capacitated vehicle routing. The input to k-LocVRP is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so...... median forest, which leads to a (12+E)-approximation algorithm for k-LocVRP, for any constant E > 0. The algorithm for k median forest is t-swap local search, and we prove that it has locality gap 3 + 2 t ; this generalizes the corresponding result for k median [3]. Finally we consider the k median...... forest problem when there is a different (unrelated) cost function c for the MST part, i.e. the objective is Eu∈V d(u, S) + c(MST(V/S) ). We show that the locality gap for this problem is unbounded even under multi-swaps, which contrasts with the c = d case. Nevertheless, we obtain a constant...

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

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

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

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

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

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

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

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

  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. Routing Protocol Design and Performance Optimization in Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    Zhenguo Wu

    2013-10-01

    Full Text Available Routing protocol is an important issue in cognitive radio networks. This paper explored the issues and challenges of routing protocol in cognitive radio network from five aspects: hidden terminal, exposed terminal, deafness, cross-layer design, and topology. The existed protocols are classified by the metrics: the establishment of active routing, cross-layer routing, and network performance indicators. Focusing on analyzing performance of routing protocols and design optimized schemes in cognitive radio networks, the advantage and disadvantage of related work were discussed in detail.

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

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

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

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

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

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

  5. Adaptive Route Selection Policy Based on Back Propagation Neural Networks

    Directory of Open Access Journals (Sweden)

    Fang Jing

    2008-03-01

    Full Text Available One of the key issues in the study of multiple route protocols in mobile ad hoc networks (MANETs is how to select routes to the packet transmission destination. There are currently two route selection methods: primary routing policy and load-balancing policy. Many ad hoc routing protocols are based on primary (fastest or shortest but busiest routing policy from the self-standpoint of traffic transmission optimization of each node. Load-balancing protocols equalize transmission load among multiple routes in the network. However, the lack of global perspective can cause congestion in primary policy and prolong delay time in load-balancing policy. So, although they are sometimes efficient, these two types of policies cannot adapt to intricately changing network conditions. We propose a new multiple route protocol with an Adaptive route selection Policy based on a Back propagation Neural network (APBN to optimize selection policy. In our study, we used a gradient ascent algorithm to determine the relationship between different optimum route selection polices and varying conditions in the communication network and to make a neural network that learns this relationship using the Back Propagation (BP algorithm to predict the next optimum route selection policy. We evaluated our protocol using Omnet simulator. The results show that the proposed scheme performs better than current protocols.

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

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

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

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

  10. BCR Routing for Intermittently Connected Mobile Ad hoc Networks

    Directory of Open Access Journals (Sweden)

    S. RAMESH

    2014-03-01

    Full Text Available The Wireless and the Mobile Networks appear to provide a wide range of applications. Following these, the Mobile Ad hoc Networks (MANET aid in wide development of many applications. The achievement of the real world applications are attained through effective routing. The Intermittently Connected Mobile Ad hoc Network (ICMANET is a sparse network where a full connectivity is never possible. ICMANET is a disconnected MANET and is also a Delay Tolerant Network (DTN that sustains for higher delays. The routing in a disseminated network is a difficult task. A new routing scheme called Bee Colony Routing (BCR is been proposed with a motto of achieving optimal result in delivering the data packet towards the destined node. BCR is proposed with the basis of Bee Colony Optimization technique (BCO. The routing in ICMNAET is done by means of Bee routing protocol. This paper enchants a novel routing methodology for data transmission in ICMANET.

  11. Registration and Aggregate Cache Routing for Ad hoc Network

    Directory of Open Access Journals (Sweden)

    Abdul Samad

    2010-11-01

    Full Text Available A Mobile Ad-hoc Network (MANET is a temporary, infrastructure less wireless network composed of mobile nodes. Due to the limitations in the wireless environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. Since traditional routing protocols cannot be directly applied in the MANET, a lot of routing protocols have been proposed. Though there are many wireless routing protocols developed, there is not a single algorithm to accomplish efficient route in dynamic environment. This paper presents a new routing technique based on registration of newly arrived nodes and checking the local cache for forwarding the packet to the desired destination called Registration and Aggregate Cache (RAC routing algorithm. Theoretically RAC algorithm eliminates the drawback of Table Driven and On Demand routing algorithm.

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

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

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

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

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

  17. Possible routes for lead accumulation in feral pigeons (Columba livia).

    Science.gov (United States)

    Nam, Dong-Ha; Lee, Doo-Pyo

    2006-10-01

    This study examined possible routes for lead (Pb) accumulation in resident pigeons collected from rural, urban, and four industrial sites in Korea. The accumulation pattern of Pb was comparable to the study sites. The highest Pb concentration was found in the bone, followed by kidney, liver, and lung of pigeons. Highest Pb residues in bones were found in urban (Seoul), and two industrial complex areas (Busan and Ulsan), which were about 15 times higher than rural area (Duckjuk island), and followed by Ansan and Yochon industrial areas. Regional Pb variations in liver, kidney, and lung tissues were also similar pattern with the bone Pb difference. These findings indicate that Pb accumulation in tissues of pigeons may be affected by the Pb exposure in their respective habitats. Crop contents and gizzard materials were investigated as representing the ingested items. No difference of Pb concentration was observed in major foods (maize and/or wheat) of crop contents in the study sites except Busan, whereas variations of Pb levels in gizzard materials were indicative of a similar pattern with tissue Pb differences. The Pb concentration in tissues of pigeons did not correspond well to the atmospheric Pb levels. With regard to possible Pb sources, ingested items especially materials present in the gizzard are important sources for Pb contamination to pigeons because Pb-containing sources may be expected to present in roadside particles, dusts, paint chips and building flakes. However, air Pb value being low may not affect significant as the regional variations in tissues of pigeons.

  18. Tour Route Recommendation Begins with Multimodal Classification

    Directory of Open Access Journals (Sweden)

    Xiujun Chen

    2012-02-01

    Full Text Available Location estimation of tourist photos by classifi­cation is challenging due to the unstable and less-discriminative features of photos taken in each city. In this paper, we originally deal with this issue in an alternative way, which begins with but is not limited to classification. We explore textual, temporal, geographic as well as visual information to make tour route recommendation. Given a query photo, we recommend a city by first classifying the photo to get scores that indicate its similarities with photos from each city, and then evaluating the attractiveness of each city by modeling its hotness potential. We do not aim at finding out where the photo was taken exactly; instead, we combine the similarity and hotness potentials according to the user’s preference and recommend the city that has the highest combination value. Then, we suggest the next city by further modeling the correlation and interaction between cities pairwise with two potentials, i.e., proximity and co-visitedness. Applying the greedy algorithm, we recommend one city at a time and eventually generate a tour route consist­ing of all the recommended cities in order. Furthermore, in order to show different visual and cultural character­istics across cities, we classify photos of each city into four categories, i.e., food, landscape, man-made and person. In experiments, we collected a database containing 41792 photos of 35 important cities along the silkroad and provided a query sample for tour route recommendation. Experimental results have shown the effectiveness and reliability of our recommendation model.

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

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

  2. Respiratory effects of air pollution on children.

    Science.gov (United States)

    Goldizen, Fiona C; Sly, Peter D; Knibbs, Luke D

    2016-01-01

    A substantial proportion of the global burden of disease is directly or indirectly attributable to exposure to air pollution. Exposures occurring during the periods of organogenesis and rapid lung growth during fetal development and early post-natal life are especially damaging. In this State of the Art review, we discuss air toxicants impacting on children's respiratory health, routes of exposure with an emphasis on unique pathways relevant to young children, methods of exposure assessment and their limitations and the adverse health consequences of exposures. Finally, we point out gaps in knowledge and research needs in this area. A greater understanding of the adverse health consequences of exposure to air pollution in early life is required to encourage policy makers to reduce such exposures and improve human health.

  3. Semantic Probabilistic Modelling of novel routing Protocol with Implication of Cumulative Routing Attack in Mobile adhoc network

    Directory of Open Access Journals (Sweden)

    Anil G. N.

    2012-01-01

    Full Text Available The proposed system presents a novel approach for modelling along with mitigating various types of routing attacks in mobile adhoc network considering AODV protocol. Majority of the previous research work are either explored differently for security or routing protocols. The system identifies the susceptibility of the routing attack over the dynamic topology of mobile adhoc network where it has assumed a faster propagation of the infection towards the nodes. To make the analysis more challenging, the protocol also designs a sophisticated adversary module which is resilient against any types of preventive measure being adopted. The proposed system therefore used probabilistic approach for modelling the routing attack scenario over MANET. The uniqueness is that majority of the prior research work has focused on one type of routing attack, whereas the proposed system is experimentally evaluated for cumulative routing attack. The simulation results show highly contrastive result when compared with frequently used current algorithm for mitigating routing attacks.

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

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

  6. Trimming the Multipath for Efficient Dynamic Routing

    CERN Document Server

    Tam, Adrian Sai-wah; Chao, H Jonathan

    2011-01-01

    Multipath routing is a trivial way to exploit the path diversity to leverage the network throughput. Technologies such as OSPF ECMP use all the available paths in the network to forward traffic, however, we argue that is not necessary to do so to load balance the network. In this paper, we consider multipath routing with only a limited number of end-to-end paths for each source and destination, and found that this can still load balance the traffic. We devised an algorithm to select a few paths for each source-destination pair so that when all traffic are forwarded over these paths, we can achieve a balanced load in the sense that the maximum link utilization is comparable to that of ECMP forwarding. When the constraint of only shortest paths (i.e. equal paths) are relaxed, we can even outperform ECMP in certain cases. As a result, we can use a few end-to-end tunnels between each source and destination nodes to achieve the load balancing of traffic.

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

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

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

  10. Enhancing Transport Efficiency by Hybrid Routing Strategy

    CERN Document Server

    Dong, J -Q; Zhou, Z; Huang, L; Wu, Z -X; Do, Y; Wang, Y -H

    2012-01-01

    Traffic is essential for many dynamic processes on real networks, such as internet and urban traffic systems. The transport efficiency of the traffic system can be improved by taking full advantage of the resources in the system. In this paper, we propose a dual-strategy routing model for network traffic system, to realize the plenary utility of the whole network. The packets are delivered according to different "efficient routing strategies" [Yan, et al, Phys. Rev. E 73, 046108 (2006)]. We introduce the accumulate rate of packets, {\\eta} to measure the performance of traffic system in the congested phase, and propose the so-called equivalent generation rate of packet to analyze the jamming processes. From analytical and numerical results, we find that, for suitable selection of strategies, the dual- strategy system performs better than the single-strategy system in a broad region of strategy mixing ratio. The analytical solution to the jamming processes is verified by estimating the number of jammed nodes, w...

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

  12. The vehicle routing problem with backhauls

    Energy Technology Data Exchange (ETDEWEB)

    Goetschalckx, M.; Jacobs-Blecha, C.

    1989-09-05

    The Vehicle Routing Problem with Backhauls is a pickup/delivery problem where on each route all deliveries must be made before any pickups. A two-phased solution methodology is proposed. In the first phase, a high quality initial feasible solution is generated based on spacefilling curves. In the second phase, this solution is improved based on optimization of the subproblems identified in a mathematical model of the problem. An extensive computational analysis of several initial solution algorithms is presented, which identifies the tradeoffs between solution quality and computational requirements. The class of greedy algorithms is capacity oriented, while K-median algorithms focus on distance. It is concluded that the greedy and K-median algorithms generate equivalent tour lengths, but that the greedy procedure reduces the required number of trucks and increases the truck utilization. The effect of exchange improvement procedures as well as optimal procedures on solution quality and run time is demonstrated. Comparisons with the Clark-Wright method adapted to backhauls are also given. 4 figs., 26 refs.

  13. Multiple routes transmitted epidemics on multiplex networks

    Energy Technology Data Exchange (ETDEWEB)

    Zhao, Dawei [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China); National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Shandong Provincial Key Laboratory of Computer Network, Shandong Computer Science Center, Jinan 250014 (China); Li, Lixiang [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China); National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Peng, Haipeng, E-mail: penghaipeng@bupt.edu.cn [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China); National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Luo, Qun; Yang, Yixian [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China); National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China)

    2014-02-01

    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.

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

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

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

  17. Routing of multimedia connections in hybrid networks

    Science.gov (United States)

    Koegel, John F.; Syta, Andrzej

    1993-02-01

    The prevailing vision for next generation multimedia communication systems is a digital one. However, we anticipate a transitional period in which hybrid networks involving both analog and digital technology will coexist. These analog facilities will include crossbar audio-video switches, CATV distribution systems, and dedicated lines. For some scale of use, these facilities may offer economies for connectivity to conventional analog video equipment. We are interested in connection routing that will be needed in such hybrid networks for services including video conferencing and broadcast results. The routing problem in such topologies resembles but is not identical to that found in telephone systems because of the presence of broadcast connections. We discuss representative topologies, review related work, and describe algorithms and simulation results. In addition we describe a hybrid system that we have implemented in our research lab which involves several A/V switches, CATV channels, digital video on a LAN, and a point-to-point link to an offsite conference area.

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

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

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

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

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

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

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

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

  6. Analysis on Ad Hoc Routing Protocols in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    P.N.Renjith

    2012-12-01

    Full Text Available Outlook of wireless communication system marked an extreme transform with the invention of Wireless Sensor Networks (WSN. WSN is a promising technolog y for enabling a variety of applications like environmental monitoring, security and applications that save our lives and assets. In WSN, large numbers of sensor nodes are deployed to sensing and gathering information and forward them to the base station with the help of routing protocol. Routing protocols plays a major role by identifying and maintaining the routes in the network. Competence o f sensor networks relay on the strong and effective routing protocol used. In this paper, we present a simulation based performance evaluation of differen t Ad hoc routing protocols like AODV, DYMO, FSR, LANM AR, RIP and ZRP in Wireless Sensor Networks. Based on the study, the future research areas and k ey challenges for routing protocol in WSN are to optimize network performance for QoS support and en ergy conservation

  7. Routing in Highly Dynamic Ad Hoc Networks: Issues and Challenges

    Directory of Open Access Journals (Sweden)

    Varun G Menon

    2016-04-01

    Full Text Available The aim of this research paper is to analyze the various issues and challenges involved in routing of data packets in highly mobile ad hoc networks. Routing in ad hoc networks has always been a challenging and tough task due to the dynamic topology and error prone wireless channel. There are a number of issues like lack of centralized control, constantly moving nodes etc that has to be considered while routing a data packet from the source to the destination in the ad hoc network. Routing of data packets becomes much more difficult with increased mobility of nodes. This paper analyses the various issues in routing of data packets from the source to the destination node and also lists down the parameters that has to be considered while designing and selecting a routing protocol for highly mobile ad hoc networks.

  8. A Secure Multi-Routing Platform for Ad Hoc Network

    Institute of Scientific and Technical Information of China (English)

    LU She-jie; CHEN Jing; XIONG Zai-hong

    2008-01-01

    In an ad hoc network, it is usually difficult to optimize the assignment of network routing resources using a single type of routing protocol due to the differences in network scale, node moving mode and node distribution. Therefore, it is desirable to have nodes run multiple routing protocols simultaneously so that more than one protocols can be chosen to work jointly. For this purpose,a multiple routing platform for Ad hoc networks is proposed on a higher level of current routing protocols. In order to ensure the security of the platform, a security mechanism and its formal analysis by BAN logic is given. The simulation results of the network performance demonstrate that the proposed multi-routing platform is practicable in some complex applications.

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

  10. Parallel routing in Mobile Ad-Hoc Networks

    CERN Document Server

    Day, Khaled; Arafeh, Bassel; Alzeidi, Nasser; 10.5121/ijcnc.2011.3506

    2011-01-01

    This paper proposes and evaluates a new position-based Parallel Routing Protocol (PRP) for simultaneously routing multiple data packets over disjoint paths in a mobile ad-hoc network (MANET) for higher reliability and reduced communication delays. PRP views the geographical region where the MANET is located as a virtual 2-dimensional grid of cells. Cell-disjoint (parallel) paths between grid cells are constructed and used for building pre-computed routing tables. A single gateway node in each grid cell handles routing through that grid cell reducing routing overheads. Each node maintains updated information about its own location in the virtual grid using GPS. Nodes also keep track of the location of other nodes using a new proposed cell-based broadcasting algorithm. Nodes exchange energy level information with neighbors allowing energy-aware selection of the gateway nodes. Performance evaluation results have been derived showing the attractiveness of the proposed parallel routing protocol from different resp...

  11. Route Challenging Scheme Using Friend Based Rating in MANETs

    Directory of Open Access Journals (Sweden)

    S. Shantha Meena

    2013-04-01

    Full Text Available Security and Route identification are the major challenges in MANETs. Existing neighbour based routing algorithms provide route based on the quantity of data transferred [1] which may result in congestion. This is because the route having higher amount of transaction is preferred every time. In this paper we propose a Friend Based Routing algorithm [FBRA] for solving this problem. Here, the appropriate route is found not only based on the quantity of data transferred but also considers RSS and RTT. For providing re-authentication to the nodes in the network, FBRA uses Zero-Knowledge Protocol. The main advantage of this method is providing enhanced security and distinguishes the malicious nodes from the trusted nodes in the network.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    DEFF Research Database (Denmark)

    Raovic, Nevena

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

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

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

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

    DEFF Research Database (Denmark)

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

    2009-01-01

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

  17. A hybrid routing model for mitigating congestion in networks

    Science.gov (United States)

    He, Kun; Xu, Zhongzhi; Wang, Pu

    2015-08-01

    Imbalance between fast-growing transport demand and limited network supply has resulted in severe congestion in many transport networks. Increasing network supply or reducing transport demand could mitigate congestion, but these remedies are usually associated with high implementation cost. Combining shortest path (SP) routing and minimum cost (MC) routing, we developed a hybrid routing model to alleviate congestion in networks. This model requires only a small fraction of the total number of agents to use MC routes, and effectively mitigates congestion in networks under homogeneous or heterogeneous transport demand, offering new insights for improving the efficiency of practical transport networks.

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

  19. A New Approach to VC Routing in ATM Networks

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    A new ant-algorithm-based routing approach is proposed for the VC routing problem with considering the comprehensive effect between the resource utilization and the load balance in ATM networks. In the approach, the backup paths are calculated first, and then an ant algorithm based on the ability of ants to find the shortest path between their nest and the food source during their searching food, is constructed to optimize the VC global route.Simulation results show that the proposed approach can realize VC routing effectively according to the current traffic states in the networks and the user-specified delay requirements.

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

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

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

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

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

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

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

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

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

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

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

  11. The placement of an implantable chemoport via the external jugular vein as a primary route

    Energy Technology Data Exchange (ETDEWEB)

    Ahn, Moon Sang; Shin, Byung Seok [Chungnam National University Hospital, Daejeon (Korea, Republic of); Park, Mi Hyun [Taejon Veterans Hospital, Daejeon (Korea, Republic of)

    2008-03-15

    To evaluate the usefulness and safety of the placement of an implantable chemoport via external jugular vein as a primary route for chemotherapy. Between January 2006 and June 2007, a total of 108 implantable chemoports were placed on 325 patients for chemotherapy via the external jugular vein as a primary route. We placed a 9.6 F single lumen chemoport using a surgical procedure (n = 89) and an interventional procedure (n = 19), and evaluated the duration of catheterization days and treatment complications. An implantable chemoport was successfully installed in all cases. Furthermore, the duration of catheterization ranged from 2 to 461 days (mean: 187 days, total catheter days: 21,994). In addition, a total of 85 chemoports were removed due to complications (n = 7) and termination of chemotherapy (n 78). A transient pulmonary air embolism occurring during a procedure was observed in one case. No pneumothorax or catheter malpositions were observed in the study subjects. Two chemoports were removed two days after implantation due to persistent tachycardia. In addition, five late complications occurred, which resulted in catheter occlusion (3 cases) (3%, 0.14/1000 catheter day) and infection in (2 cases) (2%, 0.09/1000 Catheter days). Lastly, no symptoms were attributed to a central vein thrombosis. The results of this study suggest that the implantation of chemoports via the external jugular vein is a safe procedure. Moreover, the selection of the external jugular vein as a primary route is useful in determining chemoport insertion locations.

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

  13. 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...... fuel prices induce slow steaming which is being practised in many sectors of the shipping industry. In recent years the environmental dimension of slow steaming has also become important, as ship emissions are directly proportional to fuel burned. Win-win solutions are sought......, but they will not 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....

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

  15. The route to protein aggregate superstructures

    DEFF Research Database (Denmark)

    Vetri, Valeria; Foderà, Vito

    2015-01-01

    Depending on external conditions, native proteins may change their structure and undergo different association routes leading to a large scale polymorphism of the aggregates. This feature has been widely observed but is not fully understood yet. This review focuses on morphologies, physico-chemic...... changes and dominant forces in driving association together with their connection with the final aggregate structure. Eventually, we will discuss future perspectives in this field and we will comment what is, in our opinion, urgently needed.......-chemical properties and mechanisms of formation of amyloid structures and protein superstructures. In particular, the main focus will be on protein particulates and amyloid-like spherulites, briefly summarizing possible experimental methods of analysis. Moreover, we will highlight the role of protein conformational...

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

  17. Traffic routes and signals for the tonoplast.

    Science.gov (United States)

    Pedrazzini, Emanuela; Komarova, Nataliya Y; Rentsch, Doris; Vitale, Alessandro

    2013-06-01

    Tonoplast, the membrane delimiting plant vacuoles, regulates ion, water and nutrient movement between the cytosol and the vacuolar lumen through the activity of its membrane proteins. Correct traffic of proteins from the endoplasmic reticulum (ER) to the tonoplast requires (i) approval by the ER quality control, (ii) motifs for exit from the ER and (iii) motifs that promote sorting to the tonoplast. Recent evidence suggests that this traffic follows different pathways that are protein-specific and could also reflect vacuole specialization for lytic or storage function. The routes can be distinguished based on their sensitivity to drugs such as brefeldin A and C834 as well as using mutant plants that are defective in adaptor proteins of vesicle coats, or dominant-negative mutants of Rab GTPases.

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

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

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

  1. Safe Trust Alert Routing in MANET

    Directory of Open Access Journals (Sweden)

    Srikanth Meda

    2015-10-01

    Full Text Available  The main characteristic of the ad-hoc network is dynamic topology. In this, nodes modifications its position usually and these nodes have to be compelled to be compelled to adapt for the topology amendment. Nodes can amendment position quite frequently that mean the standard of the network. For quick info transmission, we'd sort of a routing protocol that adapts to topology changes. For our convenience, we've projected a fast and secure protocol that's proactive and reactive in nature. Proactive nature used for adding the node into list, as a results of it taking a short while to line the selection relating to node. And reactive nature used for locating the path for providing fast transmission.

  2. Dynamic Routing of Short Transfer Baggage

    DEFF Research Database (Denmark)

    Clausen, Tommy; Pisinger, David

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

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

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

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

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

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

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

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

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

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

  12. Exploring en-route parking type and parking-search route choice

    DEFF Research Database (Denmark)

    Kaplan, Sigal; Bekhor, Sholomo

    2011-01-01

    This paper describes the first phase of an on-going research investigating the joint choice of parking type, parking facility and cruising-for-parking route. The importance of this issue derives from the significant share of cruising-for-parking traffic in urban areas, the relevance of parking po...... concludes with a trajectory for the research completion and a discussion of data collection challenges yet to be addressed....

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

  14. Air traffic simulation in chemistry-climate model EMAC 2.41: AirTraf 1.0

    Science.gov (United States)

    Yamashita, Hiroshi; Grewe, Volker; Jöckel, Patrick; Linke, Florian; Schaefer, Martin; Sasaki, Daisuke

    2016-09-01

    Mobility is becoming more and more important to society and hence air transportation is expected to grow further over the next decades. Reducing anthropogenic climate impact from aviation emissions and building a climate-friendly air transportation system are required for a sustainable development of commercial aviation. A climate optimized routing, which avoids climate-sensitive regions by re-routing horizontally and vertically, is an important measure for climate impact reduction. The idea includes a number of different routing strategies (routing options) and shows a great potential for the reduction. To evaluate this, the impact of not only CO2 but also non-CO2 emissions must be considered. CO2 is a long-lived gas, while non-CO2 emissions are short-lived and are inhomogeneously distributed. This study introduces AirTraf (version 1.0) that performs global air traffic simulations, including effects of local weather conditions on the emissions. AirTraf was developed as a new submodel of the ECHAM5/MESSy Atmospheric Chemistry (EMAC) model. Air traffic information comprises Eurocontrol's Base of Aircraft Data (BADA Revision 3.9) and International Civil Aviation Organization (ICAO) engine performance data. Fuel use and emissions are calculated by the total energy model based on the BADA methodology and Deutsches Zentrum für Luft- und Raumfahrt (DLR) fuel flow method. The flight trajectory optimization is performed by a genetic algorithm (GA) with respect to a selected routing option. In the model development phase, benchmark tests were performed for the great circle and flight time routing options. The first test showed that the great circle calculations were accurate to -0.004 %, compared to those calculated by the Movable Type script. The second test showed that the optimal solution found by the algorithm sufficiently converged to the theoretical true-optimal solution. The difference in flight time between the two solutions is less than 0.01 %. The dependence of

  15. Cooperative Routing for Maximizing Network Performance of Wireless Networks

    Institute of Scientific and Technical Information of China (English)

    LIU Kai; ZHANG Wansheng; WANG Li; LIU Feng

    2011-01-01

    To greatly increase spectral efficiency and improve network performance in wireless networks, a novel cooperative routing algorithm, namely maximum throughput cooperative routing (MTCR) algorithm, is proposed. According to cooperative link model, throughput analysis is presented to evaluate performance improvement in the process of exploiting cooperative communication from physical layer to higher layer. Taking the throughput improvement as performance metric, a cooperative relay selection scheme is developed. Finally, based on the route constructed by adaptive forwarding cluster routing (AFCR) algorithm,each node on the route selects the optimum cooperative node from all the potential cooperative nodes to construct the cooperative link with maximum throughput so that cooperative route with maximum network throughput from source to destination can be set up. Simulation results show that compared with the noncooperative routing algorithm and minimum power selection decode-and-forward (MPSDF) routing algorithm, the proposed algorithm can obviously improve network throughput in the presence of low transmission power, large number of nodes and high spectral efficiency.

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

    Science.gov (United States)

    2013-07-24

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

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

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

  19. Short-Term Memory, Executive Control, and Children's Route Learning

    Science.gov (United States)

    Purser, Harry R. M.; Farran, Emily K.; Courbois, Yannick; Lemahieu, Axelle; Mellier, Daniel; Sockeel, Pascal; Blades, Mark

    2012-01-01

    The aim of this study was to investigate route-learning ability in 67 children aged 5 to 11 years and to relate route-learning performance to the components of Baddeley's model of working memory. Children carried out tasks that included measures of verbal and visuospatial short-term memory and executive control and also measures of verbal and…

  20. PERFORMANCE COMPARISON OF MOBILE AD HOC NETWORK ROUTING PROTOCOLS

    Directory of Open Access Journals (Sweden)

    Mandeep Kaur Gulati

    2014-03-01

    Full Text Available Mobile Ad-hoc Network (MANET is an infrastructure less and decentralized network which need a robust dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find optimized routes from source to the destination and prominent among them are Dynamic Source Routing (DSR, Ad-hoc On Demand Distance Vector (AODV, and Destination-Sequenced Distance Vector (DSDV routing protocols. The performance comparison of these protocols should be considered as the primary step towards the invention of a new routing protocol. This paper presents a performance comparison of proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery ratio, average end-to-end delay, throughput, jitter, normalized routing overhead and normalized MAC overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility speed, number of nodes and data rate. The comparison results show that AODV performs optimally well not the best among all the studied protocols.

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

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

  3. Comparing Context-Aware Routing and Local Intersection Management

    NARCIS (Netherlands)

    Ter Mors, A.W.; Witteveen, C.

    2012-01-01

    In multi-agent routing, there is a set of mobile agents each with a start location and destination location on a shared infrastructure. An agent wants to reach its destination as quickly as possible, but conflicts with other agents must be avoided. We have previously developed a single-agent route p

  4. Leapfrog: Optimal opportunistic Routing in Probabilistically Contacted Delay Tolerant Networks

    Institute of Scientific and Technical Information of China (English)

    Ming-Jun Xiao; Liu-Sheng Huang; Qun-Feng Dong; An Liu; Zhen-Guo Yang

    2009-01-01

    Delay tolerant networks (DTNs)experience frequent and long lasting network disconnection due to various reasons such as mobility.power management.and scheduling.One primary concern in DTNs is to route messages to keep the end-to-end delivery delay as low as possible.In this paper,we study the single-copy message routing problem and propose an optimal opportunistic routing strategy--Leapfrog Routing--for probabilistically contacted DTNs where nodes encounter or contact in some fixed probabilities.We deduce the iterative computation formulate of minimum expected opportunistic delivery delay from each node to the destination and discover that under the optimal opportunistic routing strategy,messages would be delivered from high-delay node to low-delay node in the leapfrog manner.Rigorous theoretical analysis shows that such a routing strategy is exactly the optimal among all possible ones.Moreover,we apply the idea of Reverse Dijkstra algorithm to design an algorithm.When a destination iS given,this algorithm can determine for each node the routing selection function under the Leapfrog Routing strategy.The computation overhead of this algorithm is only O(n~2) where n is the number of nodes in the network.In addition,through extensive simulations based on real DTN traces,we demonstrate that our algorithm can significantly outperform the previous ones.

  5. Routing Trains Through Railway Junctions: A New Set Packing Approach

    DEFF Research Database (Denmark)

    Lusby, Richard; Larsen, Jesper; Ryan, David;

    The problem of routing trains through railway junctions is an integral part of railway operations. Large junctions are highly interconnected networks of track where multiple railway lines meet, intersect, and split. The number of possible routings makes this a very complicated problem. Here we show...

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

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

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

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

  10. Nature-Inspired and Energy Efficient Route Planning

    DEFF Research Database (Denmark)

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

    2015-01-01

    Cars are responsible for substantial CO2 emission worldwide. Computers can help solve this problem by computing shortest routes on maps. A good example of this is the popular Google Maps service. However, such services often require the order of the stops on the route to be fixed. By not enforcing...

  11. 14 CFR 121.121 - En route navigation facilities.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false En route navigation facilities. 121.121 Section 121.121 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... Operations § 121.121 En route navigation facilities. (a) Except as provided in paragraph (b) of this...

  12. 14 CFR 121.103 - En route navigation facilities.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false En route navigation facilities. 121.103 Section 121.103 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... § 121.103 En route navigation facilities. (a) Except as provided in paragraph (b) of this section,...

  13. 14 CFR 125.51 - En route navigation facilities.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false En route navigation facilities. 125.51 Section 125.51 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... and Miscellaneous Requirements § 125.51 En route navigation facilities. (a) Except as provided...

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

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

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

  17. Disruption management of the vehicle routing problem with vehicle breakdown

    DEFF Research Database (Denmark)

    Mu, Q; Fu, Z; Lysgaard, Jens;

    2011-01-01

    This paper introduces a new class of problem, the disrupted vehicle routing problem (VRP), which deals with the disruptions that occur at the execution stage of a VRP plan. The paper then focuses on one type of such problem, in which a vehicle breaks down during the delivery and a new routing...

  18. A new shortcut synthesis route for (±)raphidecursinol

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    The new shortcut synthesis route of(±)raphidecursinol 1,a racemic 8,4′-oxyneolignan compound,can be more easily achieved by the synthesis route,starting from readily available inexpensive 3,4,5-trimethoxybenzaldehyde and 1,2,3-trihydroxybenzene.All structures were confirmed by ~1H NMR,IR and MS.

  19. Helicobacter pylori: epidemiology and routes of transmission.

    Science.gov (United States)

    Brown, L M

    2000-01-01

    H. pylori is a common bacterium, and approximately 50 percent of the world's population has been estimated to be infected (198). Humans are the principal reservoir. The prevalence of H. pylori infection varies widely by geographic area, age, race, ethnicity, and SES. Rates appear to be higher in developing than in developed countries, with most of the infections occurring during childhood, and they seem to be decreasing with improvements in hygiene practices. H. pylori causes chronic gastritis and has been associated with several serious diseases of the gastrointestinal tract, including duodenal ulcer and gastric cancer. Since its "discovery" in 1982 by Warren and Marshall (1), H. pylori has been the topic of extensive research. A number of studies have used questionnaire components to investigate factors possibly related to the etiology of H. pylori infection. The majority of recent studies have not found tobacco use or alcohol consumption to be risk factors for H. pylori infection. Adequate nutritional status, especially frequent consumption of fruits and vegetables and of vitamin C, appears to protect against infection with H. pylori. In contrast, food prepared under less than ideal conditions or exposed to contaminated water or soil may increase the risk. Overall, inadequate sanitation practices, low social class, and crowded or high-density living conditions seem to be related to a higher prevalence of H. pylori infection. This finding suggests that poor hygiene and crowded conditions may facilitate transmission of infection among family members and is consistent with data on intrafamilial and institutional clustering of H. pylori infection. Understanding the route of H. pylori transmission is important if public health measures to prevent its spread are to be implemented. Iatrogenic transmission of H. pylori following endoscopy is the only proven mode. For the general population, the most likely mode of transmission is from person to person, by either the

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