Optimal Re-Routes and Ground Delays Using a Route-Based Aggregate Air Traffic Flow Model

Science.gov (United States)

Soler, Lluis

The National Airspace System (NAS) is very complex and with a high level of uncertainty. For this reason, developing an automated conflict resolution tool at NAS level is presented as a big challenge. One way to address the problem is by using aggregate models, which can significantly reduce its dimension and complexity. Significant effort has been made to develop an air traffic aggregate model capable to effectively state and solve the problem. In this study, a Route-Based Aggregate Model is developed and tested. It consists in a modification of several existing models and overcomes some issues identified in previous aggregate models. It allows the implementation of Traffic Flow Management conventional controls, such as ground delay and rerouting. These control strategies can be used to avoid congestion conflicts based on sectors and airports capacity as well as regions affected by convective weather. The optimization problem is posed as a Linear Programming routine, which guarantees an optimal solution that minimizes the total accumulated delay required to avoid such capacity conflicts. The solutions can be directly translated into specific instructions at aircraft level, via modification of the times of departure and flight plans. The model is integrated with Future Air Traffic Management Concepts Evaluation Tool (FACET), a state of the art air traffic simulation tool, and uses its files as both input and output. This allows simulating in FACET the solution obtained from the aggregate domain. The approach is validated by applying it in three realistic scenarios at different scales. Results show that, for time horizons larger than 2 hours, the accuracy of the aggregate model is similar to other simulation tools. Also, the modified flight plans, the product of the disaggregated solution, reduce the number of capacity conflicts in the FACET simulation. Future research will study the robustness of these solutions and determine the most appropriate scenarios where to

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

Science.gov (United States)

Yang, Han-Xin; Wang, Wen-Xu

2013-06-01

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

Pheromone based alternative route planning

Directory of Open Access Journals (Sweden)

Liangbing Feng

2016-08-01

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

Improving catchment discharge predictions by inferring flow route contributions from a nested-scale monitoring and model setup

NARCIS (Netherlands)

Velde, Y. van der; Rozemeijer, J.C.; Rooij, G.H. de; Geer, F.C. van; Torfs, P.J.J.F.; Louw, P.G.B. de

2011-01-01

Identifying effective measures to reduce nutrient loads of headwaters in lowland catchments requires a thorough understanding of flow routes of water and nutrients. In this paper we assess the value of nested-scale discharge and groundwater level measurements for the estimation of flow route volumes

Flow Routing in River Yala Using the Muskingum Technique | Opere ...

African Journals Online (AJOL)

The magnitude and frequency of occurrence of extreme hydrological events is of great importance due to the reasons of communication, water supply, power generation, agriculture and others. Due to population ... Forecasting through flow routing is achieved in this study using the Muskingum method. In this method ...

Development of an integrated MOX-scrap recycling flow-sheet by dry and wet routes using microwave heating techniques

Energy Technology Data Exchange (ETDEWEB)

Mallik, G K; Malav, R K; Karande, A P; Bhargava, V K; Kamath, H S [Advanced Fuel Fabrication Facility, Bhabha Atomic Research Centre, Tarapur (India)

1999-01-01

A simple, short and efficient scrap, recycling flow-sheet, which is exclusively based on microwave heating techniques and, includes both dry and wet routes, for (U,Pu)O{sub 2} fuel scrap recycling has been developed and evaluated. (author) 6 refs., 1 tab.

Application of the MacCormack scheme to overland flow routing for high-spatial resolution distributed hydrological model

Science.gov (United States)

Zhang, Ling; Nan, Zhuotong; Liang, Xu; Xu, Yi; Hernández, Felipe; Li, Lianxia

2018-03-01

Although process-based distributed hydrological models (PDHMs) are evolving rapidly over the last few decades, their extensive applications are still challenged by the computational expenses. This study attempted, for the first time, to apply the numerically efficient MacCormack algorithm to overland flow routing in a representative high-spatial resolution PDHM, i.e., the distributed hydrology-soil-vegetation model (DHSVM), in order to improve its computational efficiency. The analytical verification indicates that both the semi and full versions of the MacCormack schemes exhibit robust numerical stability and are more computationally efficient than the conventional explicit linear scheme. The full-version outperforms the semi-version in terms of simulation accuracy when a same time step is adopted. The semi-MacCormack scheme was implemented into DHSVM (version 3.1.2) to solve the kinematic wave equations for overland flow routing. The performance and practicality of the enhanced DHSVM-MacCormack model was assessed by performing two groups of modeling experiments in the Mercer Creek watershed, a small urban catchment near Bellevue, Washington. The experiments show that DHSVM-MacCormack can considerably improve the computational efficiency without compromising the simulation accuracy of the original DHSVM model. More specifically, with the same computational environment and model settings, the computational time required by DHSVM-MacCormack can be reduced to several dozen minutes for a simulation period of three months (in contrast with one day and a half by the original DHSVM model) without noticeable sacrifice of the accuracy. The MacCormack scheme proves to be applicable to overland flow routing in DHSVM, which implies that it can be coupled into other PHDMs for watershed routing to either significantly improve their computational efficiency or to make the kinematic wave routing for high resolution modeling computational feasible.

Simulation-Based Dynamic Passenger Flow Assignment Modelling for a Schedule-Based Transit Network

Directory of Open Access Journals (Sweden)

Xiangming Yao

2017-01-01

Full Text Available The online operation management and the offline policy evaluation in complex transit networks require an effective dynamic traffic assignment (DTA method that can capture the temporal-spatial nature of traffic flows. The objective of this work is to propose a simulation-based dynamic passenger assignment framework and models for such applications in the context of schedule-based rail transit systems. In the simulation framework, travellers are regarded as individual agents who are able to obtain complete information on the current traffic conditions. A combined route selection model integrated with pretrip route selection and entrip route switch is established for achieving the dynamic network flow equilibrium status. The train agent is operated strictly with the timetable and its capacity limitation is considered. A continuous time-driven simulator based on the proposed framework and models is developed, whose performance is illustrated through a large-scale network of Beijing subway. The results indicate that more than 0.8 million individual passengers and thousands of trains can be simulated simultaneously at a speed ten times faster than real time. This study provides an efficient approach to analyze the dynamic demand-supply relationship for large schedule-based transit networks.

Prospect theory based estimation of drivers' risk attitudes in route choice behaviors.

Science.gov (United States)

Zhou, Lizhen; Zhong, Shiquan; Ma, Shoufeng; Jia, Ning

2014-12-01

This paper applied prospect theory (PT) to describe drivers' route choice behavior under Variable Message Sign (VMS), which presented visual traffic information to assist them to make route choice decisions. A quite rich empirical data from questionnaire and field spot was used to estimate parameters of PT. In order to make the parameters more realistic with drivers' attitudes, they were classified into different types by significant factors influencing their behaviors. Based on the travel time distribution of alternative routes and route choice results from questionnaire, the parameterized value function of each category was figured out, which represented drivers' risk attitudes and choice characteristics. The empirical verification showed that the estimates were acceptable and effective. The result showed drivers' risk attitudes and route choice characteristics could be captured by PT under real-time information shown on VMS. For practical application, once drivers' route choice characteristics and parameters were identified, their route choice behavior under different road conditions could be predicted accurately, which was the basis of traffic guidance measures formulation and implementation for targeted traffic management. Moreover, the heterogeneous risk attitudes among drivers should be considered when releasing traffic information and regulating traffic flow. Copyright © 2014 Elsevier Ltd. All rights reserved.

Tidal-scale flow routing and sedimentation in mangrove forests: combining field data and numerical modelling

NARCIS (Netherlands)

Horstman, Erik; Dohmen-Janssen, Catarine M.; Bouma, T.J.; Hulscher, Suzanne J.M.H.

2015-01-01

Tidal-scale biophysical interactions establish particular flow routing and sedimentation patterns in coastal mangroves. Sluggish water flows through the mangrove vegetation and enhanced sediment deposition are essential to maintain these valuable ecosystems, thereby enabling their contribution to

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.

A Low-Jitter Wireless Transmission Based on Buffer Management in Coding-Aware Routing

Directory of Open Access Journals (Sweden)

Cunbo Lu

2015-08-01

Full Text Available It is significant to reduce packet jitter for real-time applications in a wireless network. Existing coding-aware routing algorithms use the opportunistic network coding (ONC scheme in a packet coding algorithm. The ONC scheme never delays packets to wait for the arrival of a future coding opportunity. The loss of some potential coding opportunities may degrade the contribution of network coding to jitter performance. In addition, most of the existing coding-aware routing algorithms assume that all flows participating in the network have equal rate. This is unrealistic, since multi-rate environments often appear. To overcome the above problem and expand coding-aware routing to multi-rate scenarios, from the view of data transmission, we present a low-jitter wireless transmission algorithm based on buffer management (BLJCAR, which decides packets in coding node according to the queue-length based threshold policy instead of the regular ONC policy as used in existing coding-aware routing algorithms. BLJCAR is a unified framework to merge the single rate case and multiple rate case. Simulations results show that the BLJCAR algorithm embedded in coding-aware routing outperforms the traditional ONC policy in terms of jitter, packet delivery delay, packet loss ratio and network throughput in network congestion in any traffic rates.

Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets

Science.gov (United States)

Guex, Guillaume

2016-05-01

In recent articles about graphs, different models proposed a formalism to find a type of path between two nodes, the source and the target, at crossroads between the shortest-path and the random-walk path. These models include a freely adjustable parameter, allowing to tune the behavior of the path toward randomized movements or direct routes. This article presents a natural generalization of these models, namely a model with multiple sources and targets. In this context, source nodes can be viewed as locations with a supply of a certain good (e.g. people, money, information) and target nodes as locations with a demand of the same good. An algorithm is constructed to display the flow of goods in the network between sources and targets. With again a freely adjustable parameter, this flow can be tuned to follow routes of minimum cost, thus displaying the flow in the context of the optimal transportation problem or, by contrast, a random flow, known to be similar to the electrical current flow if the random-walk is reversible. Moreover, a source-targetcoupling can be retrieved from this flow, offering an optimal assignment to the transportation problem. This algorithm is described in the first part of this article and then illustrated with case studies.

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.

Improving catchment discharge predictions by inferring flow route contributions from a nested-scale monitoring and model setup

Science.gov (United States)

van der Velde, Y.; Rozemeijer, J. C.; de Rooij, G. H.; van Geer, F. C.; Torfs, P. J. J. F.; de Louw, P. G. B.

2011-03-01

Identifying effective measures to reduce nutrient loads of headwaters in lowland catchments requires a thorough understanding of flow routes of water and nutrients. In this paper we assess the value of nested-scale discharge and groundwater level measurements for the estimation of flow route volumes and for predictions of catchment discharge. In order to relate field-site measurements to the catchment-scale an upscaling approach is introduced that assumes that scale differences in flow route fluxes originate from differences in the relationship between groundwater storage and the spatial structure of the groundwater table. This relationship is characterized by the Groundwater Depth Distribution (GDD) curve that relates spatial variation in groundwater depths to the average groundwater depth. The GDD-curve was measured for a single field site (0.009 km2) and simple process descriptions were applied to relate groundwater levels to flow route discharges. This parsimonious model could accurately describe observed storage, tube drain discharge, overland flow and groundwater flow simultaneously with Nash-Sutcliff coefficients exceeding 0.8. A probabilistic Monte Carlo approach was applied to upscale field-site measurements to catchment scales by inferring scale-specific GDD-curves from the hydrographs of two nested catchments (0.4 and 6.5 km2). The estimated contribution of tube drain effluent (a dominant source for nitrates) decreased with increasing scale from 76-79% at the field-site to 34-61% and 25-50% for both catchment scales. These results were validated by demonstrating that a model conditioned on nested-scale measurements improves simulations of nitrate loads and predictions of extreme discharges during validation periods compared to a model that was conditioned on catchment discharge only.

Improving catchment discharge predictions by inferring flow route contributions from a nested-scale monitoring and model setup

Directory of Open Access Journals (Sweden)

Y. van der Velde

2011-03-01

Full Text Available Identifying effective measures to reduce nutrient loads of headwaters in lowland catchments requires a thorough understanding of flow routes of water and nutrients. In this paper we assess the value of nested-scale discharge and groundwater level measurements for the estimation of flow route volumes and for predictions of catchment discharge. In order to relate field-site measurements to the catchment-scale an upscaling approach is introduced that assumes that scale differences in flow route fluxes originate from differences in the relationship between groundwater storage and the spatial structure of the groundwater table. This relationship is characterized by the Groundwater Depth Distribution (GDD curve that relates spatial variation in groundwater depths to the average groundwater depth. The GDD-curve was measured for a single field site (0.009 km² and simple process descriptions were applied to relate groundwater levels to flow route discharges. This parsimonious model could accurately describe observed storage, tube drain discharge, overland flow and groundwater flow simultaneously with Nash-Sutcliff coefficients exceeding 0.8. A probabilistic Monte Carlo approach was applied to upscale field-site measurements to catchment scales by inferring scale-specific GDD-curves from the hydrographs of two nested catchments (0.4 and 6.5 km². The estimated contribution of tube drain effluent (a dominant source for nitrates decreased with increasing scale from 76–79% at the field-site to 34–61% and 25–50% for both catchment scales. These results were validated by demonstrating that a model conditioned on nested-scale measurements improves simulations of nitrate loads and predictions of extreme discharges during validation periods compared to a model that was conditioned on catchment discharge only.

Region based route planning - Multi-abstraction route planning based on intermediate level vision processing

Science.gov (United States)

Doshi, Rajkumar S.; Lam, Raymond; White, James E.

1989-01-01

Intermediate and high level processing operations are performed on vision data for the organization of images into more meaningful, higher-level topological representations by means of a region-based route planner (RBRP). The RBRP operates in terrain scenarios where some or most of the terrain is occluded, proceeding without a priori maps on the basis of two-dimensional representations and gradient-and-roughness information. Route planning is accomplished by three successive abstractions and yields a detailed point-by-point path by searching only within the boundaries of relatively small regions.

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.

Route Choice Model Based on Game Theory for Commuters

Directory of Open Access Journals (Sweden)

Licai Yang

2016-06-01

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

CBHRP: A Cluster Based Routing Protocol for Wireless Sensor Network

OpenAIRE

Rashed, M. G.; Kabir, M. Hasnat; Rahim, M. Sajjadur; Ullah, Sk. Enayet

2012-01-01

A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field. On rotation basis, a head-set member receives data from the neighbor nodes and transmits the aggregated results to the distance base station. This protocol ...

Design of a mesoscale continuous flow route towards lithiated methoxyallene.

Science.gov (United States)

Seghers, Sofie; Heugebaert, Thomas S A; Moens, Matthias; Sonck, Jolien; Thybaut, Joris; Stevens, Chris Victor

2018-05-11

The unique nucleophilic properties of lithiated methoxyallene allow for C-C bond formation with a wide variety of electrophiles, thus introducing an allenic group for further functionalization. This approach has yielded a tremendously broad range of (hetero)cyclic scaffolds, including API precursors. To date, however, its valorization at scale is hampered by the batch synthesis protocol which suffers from serious safety issues. Hence, the attractive heat and mass transfer properties of flow technology were exploited to establish a mesoscale continuous flow route towards lithiated methoxyallene. An excellent conversion of 94% was obtained, corresponding to a methoxyallene throughput of 8.2 g/h. The process is characterized by short reaction times, mild reaction conditions and a stoichiometric use of reagents. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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

Directory of Open Access Journals (Sweden)

Nguyen Thanh Long

2015-02-01

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

A Method for Driving Route Predictions Based on Hidden Markov Model

Directory of Open Access Journals (Sweden)

Ning Ye

2015-01-01

Full Text Available We present a driving route prediction method that is based on Hidden Markov Model (HMM. This method can accurately predict a vehicle’s entire route as early in a trip’s lifetime as possible without inputting origins and destinations beforehand. Firstly, we propose the route recommendation system architecture, where route predictions play important role in the system. Secondly, we define a road network model, normalize each of driving routes in the rectangular coordinate system, and build the HMM to make preparation for route predictions using a method of training set extension based on K-means++ and the add-one (Laplace smoothing technique. Thirdly, we present the route prediction algorithm. Finally, the experimental results of the effectiveness of the route predictions that is based on HMM are shown.

Extended shortest path selection for package routing of complex networks

Science.gov (United States)

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

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

Flow Merging and Hub Route Optimization in Collaborative Transportation

Directory of Open Access Journals (Sweden)

Kerui Weng

2014-01-01

Full Text Available This paper studies the optimal hub routing problem of merged tasks in collaborative transportation. This problem allows all carriers’ transportation tasks to reach the destinations optionally passing through 0, 1, or 2 hubs within limited distance, while a cost discount on arcs in the hub route could be acquired after paying fixed charges. The problem arises in the application of logistics, postal services, airline transportation, and so forth. We formulate the problem as a mixed-integer programming model, and provide two heuristic approaches, respectively, based on Lagrangian relaxation and Benders decomposition. Computational experiments show that the algorithms work well.

ARBR: Adaptive reinforcement-based routing for DTN

KAUST Repository

Elwhishi, Ahmed

2010-10-01

This paper introduces a novel routing protocol in Delay Tolerant Networks (DTNs), aiming to solve the online distributed routing problem. By manipulating a collaborative reinforcement learning technique, a group of nodes can cooperate with each other and make a forwarding decision for the stored messages based on a cost function at each contact with another node. The proposed protocol is characterized by not only considering the contact time statistics under a novel contact model, but also looks into the feedback on user behavior and network conditions, such as congestion and buffer occupancy sampled during each previous contact with any other node. Therefore, the proposed protocol can achieve high efficiency via an adaptive and intelligent routing mechanism according to network conditions. Extensive simulation is conducted to verify the proposed protocol, where a comparison is made with a number of existing encounter-based routing protocols in term of the number of transmissions of each message, message delivery delay, and delivery ratio. The results of the simulation demonstrate the effectiveness of the proposed technique.

Discharge estimation combining flow routing and occasional measurements of velocity

Directory of Open Access Journals (Sweden)

G. Corato

2011-09-01

Full Text Available A new procedure is proposed for estimating river discharge hydrographs during flood events, using only water level data at a single gauged site, as well as 1-D shallow water modelling and occasional maximum surface flow velocity measurements. One-dimensional diffusive hydraulic model is used for routing the recorded stage hydrograph in the channel reach considering zero-diffusion downstream boundary condition. Based on synthetic tests concerning a broad prismatic channel, the "suitable" reach length is chosen in order to minimize the effect of the approximated downstream boundary condition on the estimation of the upstream discharge hydrograph. The Manning's roughness coefficient is calibrated by using occasional instantaneous surface velocity measurements during the rising limb of flood that are used to estimate instantaneous discharges by adopting, in the flow area, a two-dimensional velocity distribution model. Several historical events recorded in three gauged sites along the upper Tiber River, wherein reliable rating curves are available, have been used for the validation. The outcomes of the analysis can be summarized as follows: (1 the criterion adopted for selecting the "suitable" channel length based on synthetic test studies has proved to be reliable for field applications to three gauged sites. Indeed, for each event a downstream reach length not more than 500 m is found to be sufficient, for a good performances of the hydraulic model, thereby enabling the drastic reduction of river cross-sections data; (2 the procedure for Manning's roughness coefficient calibration allowed for high performance in discharge estimation just considering the observed water levels and occasional measurements of maximum surface flow velocity during the rising limb of flood. Indeed, errors in the peak discharge magnitude, for the optimal calibration, were found not exceeding 5% for all events observed in the three investigated gauged sections, while the

Automation of route identification and optimisation based on data-mining and chemical intuition.

Science.gov (United States)

Lapkin, A A; Heer, P K; Jacob, P-M; Hutchby, M; Cunningham, W; Bull, S D; Davidson, M G

2017-09-21

Data-mining of Reaxys and network analysis of the combined literature and in-house reactions set were used to generate multiple possible reaction routes to convert a bio-waste feedstock, limonene, into a pharmaceutical API, paracetamol. The network analysis of data provides a rich knowledge-base for generation of the initial reaction screening and development programme. Based on the literature and the in-house data, an overall flowsheet for the conversion of limonene to paracetamol was proposed. Each individual reaction-separation step in the sequence was simulated as a combination of the continuous flow and batch steps. The linear model generation methodology allowed us to identify the reaction steps requiring further chemical optimisation. The generated model can be used for global optimisation and generation of environmental and other performance indicators, such as cost indicators. However, the identified further challenge is to automate model generation to evolve optimal multi-step chemical routes and optimal process configurations.

An improved AODV routing protocol based on tower structure

Directory of Open Access Journals (Sweden)

Li Yong Qiang

2016-01-01

Full Text Available The paper proposed a new routing protocol(IAODV based on tower structure in the Ad Hoc network for the problem which Location Routing Protocol need hardware and Complex algorithm. By the simulation, The complexity of the new routing protocol is reduced without reducing the performance of the network.

Route-Based Signal Preemption Control of Emergency Vehicle

Directory of Open Access Journals (Sweden)

Haibo Mu

2018-01-01

Full Text Available This paper focuses on the signal preemption control of emergency vehicles (EV. A signal preemption control method based on route is proposed to reduce time delay of EV at intersections. According to the time at which EV is detected and the current phase of each intersection on the travelling route of EV, the calculation methods of the earliest start time and the latest start time of green light at each intersection are given. Consequently, the effective time range of green light at each intersection is determined in theory. A multiobjective programming model, whose objectives are the minimal residence time of EV at all intersections and the maximal passing numbers of general society vehicles, is presented. Finally, a simulation calculation is carried out. Calculation results indicate that, by adopting the signal preemption method based on route, the delay of EV is reduced and the number of society vehicles passing through the whole system is increased. The signal preemption control method of EV based on route can reduce the time delay of EV and improve the evacuation efficiency of the system.

DRO: domain-based route optimization scheme for nested mobile networks

Directory of Open Access Journals (Sweden)

Chuang Ming-Chin

2011-01-01

Full Text Available Abstract The network mobility (NEMO basic support protocol is designed to support NEMO management, and to ensure communication continuity between nodes in mobile networks. However, in nested mobile networks, NEMO suffers from the pinball routing problem, which results in long packet transmission delays. To solve the problem, we propose a domain-based route optimization (DRO scheme that incorporates a domain-based network architecture and ad hoc routing protocols for route optimization. DRO also improves the intra-domain handoff performance, reduces the convergence time during route optimization, and avoids the out-of-sequence packet problem. A detailed performance analysis and simulations were conducted to evaluate the scheme. The results demonstrate that DRO outperforms existing mechanisms in terms of packet transmission delay (i.e., better route-optimization, intra-domain handoff latency, convergence time, and packet tunneling overhead.

Routing-based Synthesis of Digital Microfluidic Biochips

DEFF Research Database (Denmark)

Maftei, Elena; Pop, Paul; Madsen, Jan

2010-01-01

Microfluidic biochips are replacing the conventional biochemical analyzers, and are able to integrate on-chip all the basic functsions for biochemical analysis. The "digital" microfluidic biochips are manipulating liquids not as a continuous flow, but as discrete droplets on a two-dimensional array...... of electrodes. Basic microfluidic operations, such as mixing and dilution, are performed on the array, by routing the corresponding droplets on a series of electrodes. So far, researchers have assumed that these operations are executed on rectangular virtual devices, formed by grouping several adjacent...

Nested-scale discharge and groundwater level monitoring to improve predictions of flow route discharges and nitrate loads

Science.gov (United States)

van der Velde, Y.; Rozemeijer, J. C.; de Rooij, G. H.; van Geer, F. C.; Torfs, P. J. J. F.; de Louw, P. G. B.

2010-10-01

Identifying effective measures to reduce nutrient loads of headwaters in lowland catchments requires a thorough understanding of flow routes of water and nutrients. In this paper we assess the value of nested-scale discharge and groundwater level measurements for predictions of catchment-scale discharge and nitrate loads. In order to relate field-site measurements to the catchment-scale an upscaling approach is introduced that assumes that scale differences in flow route fluxes originate from differences in the relationship between groundwater storage and the spatial structure of the groundwater table. This relationship is characterized by the Groundwater Depth Distribution (GDD) curve that relates spatial variation in groundwater depths to the average groundwater depth. The GDD-curve was measured for a single field site (0.009 km2) and simple process descriptions were applied to relate the groundwater levels to flow route discharges. This parsimonious model could accurately describe observed storage, tube drain discharge, overland flow and groundwater flow simultaneously with Nash-Sutcliff coefficients exceeding 0.8. A probabilistic Monte Carlo approach was applied to upscale field-site measurements to catchment scales by inferring scale-specific GDD-curves from hydrographs of two nested catchments (0.4 and 6.5 km2). The estimated contribution of tube drain effluent (a dominant source for nitrates) decreased with increasing scale from 76-79% at the field-site to 34-61% and 25-50% for both catchment scales. These results were validated by demonstrating that a model conditioned on nested-scale measurements simulates better nitrate loads and better predictions of extreme discharges during validation periods compared to a model that was conditioned on catchment discharge only.

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.

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.

GIS-Based Population Model Applied to Nevada Transportation Routes

International Nuclear Information System (INIS)

Mills, G.S.; Neuhauser, K.S.

1999-01-01

Recently, a model based on geographic information system (GIS) processing of US Census Block data has made high-resolution population analysis for transportation risk analysis technically and economically feasible. Population density bordering each kilometer of a route may be tabulated with specific route sections falling into each of three categories (Rural, Suburban or Urban) identified for separate risk analysis. In addition to the improvement in resolution of Urban areas along a route, the model provides a statistically-based correction to population densities in Rural and Suburban areas where Census Block dimensions may greatly exceed the 800-meter scale of interest. A semi-automated application of the GIS model to a subset of routes in Nevada (related to the Yucca Mountain project) are presented, and the results compared to previous models including a model based on published Census and other data. These comparisons demonstrate that meaningful improvement in accuracy and specificity of transportation risk analyses is dependent on correspondingly accurate and geographically-specific population density data

Secure Trust Based Key Management Routing Framework for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jugminder Kaur

2016-01-01

Full Text Available Security is always a major concern in wireless sensor networks (WSNs. Several trust based routing protocols are designed that play an important role in enhancing the performance of a wireless network. However they still have some disadvantages like limited energy resources, susceptibility to physical capture, and little protection against various attacks due to insecure wireless communication channels. This paper presents a secure trust based key management (STKF routing framework that establishes a secure trustworthy route depending upon the present and past node to node interactions. This route is then updated by isolating the malicious or compromised nodes from the route, if any, and a dedicated link is created between every pair of nodes in the selected route with the help of “q” composite random key predistribution scheme (RKPS to ensure data delivery from source to destination. The performance of trust aware secure routing framework (TSRF is compared with the proposed routing scheme. The results indicate that STKF provides an effective mechanism for finding out a secure route with better trustworthiness than TSRF which avoids the data dropping, thereby increasing the data delivery ratio. Also the distance required to reach the destination in the proposed protocol is less hence effectively utilizing the resources.

Link reliability based hybrid routing for tactical mobile ad hoc network

Institute of Scientific and Technical Information of China (English)

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

2008-01-01

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

Remotely Sensed Based Lake/Reservoir Routing in Congo River Basin

Science.gov (United States)

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

2017-12-01

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

A Subpath-based Logit Model to Capture the Correlation of Routes

Directory of Open Access Journals (Sweden)

Xinjun Lai

2016-06-01

Full Text Available A subpath-based methodology is proposed to capture the travellers’ route choice behaviours and their perceptual correlation of routes, because the original link-based style may not be suitable in application: (1 travellers do not process road network information and construct the chosen route by a link-by-link style; (2 observations from questionnaires and GPS data, however, are not always link-specific. Subpaths are defined as important portions of the route, such as major roads and landmarks. The cross-nested Logit (CNL structure is used for its tractable closed-form and its capability to explicitly capture the routes correlation. Nests represent subpaths other than links so that the number of nests is significantly reduced. Moreover, the proposed method simplifies the original link-based CNL model; therefore, it alleviates the estimation and computation difficulties. The estimation and forecast validation with real data are presented, and the results suggest that the new method is practical.

Reverse stream flow routing by using Muskingum models

Indian Academy of Sciences (India)

Reverse stream flow routing is a procedure that determines the upstream hydrograph given the downstream hydrograph. This paper presents the development of methodology for Muskingum models parameter estimation for reverse stream flow routing. The standard application of the Muskingum models involves calibration ...

Routing-based synthesis of digital microfluidic biochips

DEFF Research Database (Denmark)

Maftei, Elena; Pop, Paul; Madsen, Jan

2012-01-01

Microfluidic biochips are replacing the conventional biochemical analyzers, and are able to integrate on-chip all the necessary functions for biochemical analysis. The “digital” biochips are manipulating liquids as discrete droplets on a two-dimensional array of electrodes. Basic microfluidic...... electrodes are considered occupied during the operation execution, although the droplet uses only one electrode at a time. Moreover, the operations can actually be performed by routing the droplets on any sequence of electrodes on the microfluidic array. Hence, in this paper, we eliminate the concept...... on the surface of the microfluidic array. We have extended the GRASP-based algorithm to consider contamination avoidance during routing-based synthesis. Several real-life examples and synthetic benchmarks are used to evaluate the proposed approaches....

Operating Time Division for a Bus Route Based on the Recovery of GPS Data

Directory of Open Access Journals (Sweden)

Jian Wang

2017-01-01

Full Text Available Bus travel time is an important source of data for time of day partition of the bus route. However, in practice, a bus driver may deliberately speed up or slow down on route so as to follow the predetermined timetable. The raw GPS data collected by the GPS device equipped on the bus, as a result, cannot reflect its real operating conditions. To address this concern, this study first develops a method to identify whether there is deliberate speed-up or slow-down movement of a bus. Building upon the relationships between the intersection delay, link travel time, and traffic flow, a recovery method is established for calculating the real bus travel time. Using the dwell time at each stop and the recovered travel time between each of them as the division indexes, a sequential clustering-based time of day partition method is proposed. The effectiveness of the developed method is demonstrated using the data of bus route 63 in Harbin, China. Results show that the partition method can help bus enterprises to design reasonable time of day intervals and significantly improve their level of service.

Nested-scale discharge and groundwater level monitoring to improve predictions of flow route discharges and nitrate loads

NARCIS (Netherlands)

Velde, Y. van der; Rozemeijer, J.C.; Rooij, G.H.de; Geer, F.C. van; Torfs, P.J.J.F.; Louw, P.G.B. de

2010-01-01

Identifying effective measures to reduce nutrient loads of headwaters in lowland catchments requires a thorough understanding of flow routes of water and nutrients. In this paper we assess the value of nested-scale discharge and groundwater level measurements for predictions of catchment-scale

DIRECTIONAL OPPORTUNISTIC MECHANISM IN CLUSTER MESSAGE CRITICALITY LEVEL BASED ZIGBEE ROUTING

OpenAIRE

B.Rajeshkanna *1, Dr.M.Anitha 2

2018-01-01

The cluster message criticality level based zigbee routing(CMCLZOR) has been proposed for routing the cluster messages in wireless smart energy home area networks. It employs zigbee opportunistic shortcut tree routing(ZOSTR) and AODV individually for routing normal messages and highly critical messages respectively. ZOSTR allows the receiving nodes to compete for forwarding a packet with the priority of left-over hops rather than stating single next hop node like unicast protocols. Since it h...

Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network

Directory of Open Access Journals (Sweden)

Istikmal

2017-01-01

Full Text Available In this study, we developed network and throughput formulation models and proposed new method of the routing protocol algorithm with a cross-layer scheme based on signal-to-noise ratio (SNR. This method is an enhancement of routing protocol ad hoc on-demand distance vector (AODV. This proposed scheme uses selective route based on the SNR threshold in the reverse route mechanism. We developed AODV SNR-selective route (AODV SNR-SR for a mechanism better than AODV SNR, that is, the routing protocol that used average or sum of path SNR, and also better than AODV which is hop-count-based. We also used selective reverse route based on SNR mechanism, replacing the earlier method to avoid routing overhead. The simulation results show that AODV SNR-SR outperforms AODV SNR and AODV in terms of throughput, end-to-end delay, and routing overhead. This proposed method is expected to support Device-to-Device (D2D communications that are concerned with the quality of the channel awareness in the development of the future Fifth Generation (5G.

EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network

Directory of Open Access Journals (Sweden)

Halikul Lenando

2018-01-01

Full Text Available In opportunistic networks, the nature of intermittent and disruptive connections degrades the efficiency of routing. Epidemic routing protocol is used as a benchmark for most of routing protocols in opportunistic mobile social networks (OMSNs due to its high message delivery and latency. However, Epidemic incurs high cost in terms of overhead and hop count. In this paper, we propose a hybrid routing protocol called EpSoc which utilizes the Epidemic routing forwarding strategy and exploits an important social feature, that is, degree centrality. Two techniques are used in EpSoc. Messages’ TTL is adjusted based on the degree centrality of nodes, and the message blocking mechanism is used to control replication. Simulation results show that EpSoc increases the delivery ratio and decreases the overhead ratio, the average latency, and the hop counts as compared to Epidemic and Bubble Rap.

Collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation

Science.gov (United States)

Yang, Shangwen; Guo, Baohua; Xiao, Xuefei; Gao, Haichao

2018-01-01

To allocate the en-routes and slots to the flights with collaborative decision making, a collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation was proposed. Evaluation indexes include flight delay costs, delay time and the number of turning points. Analytic hierarchy process is applied to determining index weights. Remark set for current two flights not yet obtained the en-route and slot in flight schedule is established. Then, fuzzy comprehensive evaluation is performed, and the en-route and slot for the current two flights are determined. Continue selecting the flight not yet obtained an en-route and a slot in flight schedule. Perform fuzzy comprehensive evaluation until all flights have obtained the en-routes and slots. MatlabR2007b was applied to numerical test based on the simulated data of a civil en-route. Test results show that, compared with the traditional strategy of first come first service, the algorithm gains better effect. The effectiveness of the algorithm was verified.

Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

OpenAIRE

Yan Han; Hongzhi Guan; Jiaying Duan

2014-01-01

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

Intelligent Aggregation Based on Content Routing Scheme for Cloud Computing

Directory of Open Access Journals (Sweden)

Jiachen Xu

2017-10-01

Full Text Available Cloud computing has emerged as today’s most exciting computing paradigm for providing services using a shared framework, which opens a new door for solving the problems of the explosive growth of digital resource demands and their corresponding convenience. With the exponential growth of the number of data types and data size in so-called big data work, the backbone network is under great pressure due to its transmission capacity, which is lower than the growth of the data size and would seriously hinder the development of the network without an effective approach to solve this problem. In this paper, an Intelligent Aggregation based on a Content Routing (IACR scheme for cloud computing, which could reduce the amount of data in the network effectively and play a basic supporting role in the development of cloud computing, is first put forward. All in all, the main innovations in this paper are: (1 A framework for intelligent aggregation based on content routing is proposed, which can support aggregation based content routing; (2 The proposed IACR scheme could effectively route the high aggregation ratio data to the data center through the same routing path so as to effectively reduce the amount of data that the network transmits. The theoretical analyses experiments and results show that, compared with the previous original routing scheme, the IACR scheme can balance the load of the whole network, reduce the amount of data transmitted in the network by 41.8%, and reduce the transmission time by 31.6% in the same network with a more balanced network load.

Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Roy Sohini

2015-09-01

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

On Intelligent Design and Planning Method of Process Route Based on Gun Breech Machining Process

Science.gov (United States)

Hongzhi, Zhao; Jian, Zhang

2018-03-01

The paper states an approach of intelligent design and planning of process route based on gun breech machining process, against several problems, such as complex machining process of gun breech, tedious route design and long period of its traditional unmanageable process route. Based on gun breech machining process, intelligent design and planning system of process route are developed by virtue of DEST and VC++. The system includes two functional modules--process route intelligent design and its planning. The process route intelligent design module, through the analysis of gun breech machining process, summarizes breech process knowledge so as to complete the design of knowledge base and inference engine. And then gun breech process route intelligently output. On the basis of intelligent route design module, the final process route is made, edited and managed in the process route planning module.

Junos Enterprise Routing A Practical Guide to Junos Routing and Certification

CERN Document Server

Southwick, Peter; Reynolds, Harry

2011-01-01

Considered the go-to study guide for Juniper Networks enterprise routing certification exams, this book offers you unparalleled coverage of all the services available to Junos administrators-including the most recent set of flow-based security services and design guidelines that incorporate services and features of the MX, SRX, and EX network devices. Its emphasis on practical solutions also makes this book an ideal on-the-job reference for design, maintenance, and troubleshooting issues in the enterprise. Simply put, this updated edition is the most comprehensive and authoritative resource

Reverse Flow Routing in a Bayesian Framework Using a GPU-accelerated 2D Shallow Water Model

Science.gov (United States)

D'Oria, M.; Ferrari, A.; Mignosa, P.; Tanda, M. G.; Vacondio, R.

2017-12-01

Knowledge of discharge hydrographs in specific sites of natural rivers is important for water resource management, flood frequency analysis, design of structures, etc. Many times, the flood hydrograph is needed in a river section upstream of a monitoring station; here the flood wave differs from the upstream one because of the effects of resistance, channel storage, lateral inflow, etc. Reverse flow routing is a method that allows obtaining hydrographs in upstream ungauged stations using information available at downstream monitored sites. In this study, we propose an inverse procedure, based on a Bayesian Geostatistical Approach, to solve the reverse problem. The upstream flow values over time (parameters) are considered as random variables and a-priori information about the parameters and observations (downstream discharge or water level values) are combined together in a Bayesian framework. The methodology needs a forward model of the considered open channel that includes the upstream ungauged station and the downstream gauged one and it is able to describe, with sufficient accuracy, the hydraulic routing processes. In many real cases, especially when large floodable areas are involved, a 1D hydraulic model is not able to capture the complex river hydrodynamic and a 2D model must be used. The inverse procedure requires a high number of flow model run to linearize the forward problem through multiple evaluations of a Jacobian matrix (sensitivity of each observation to each parameter) using a finite difference approach. For this reason, the computational efficiency of the forward model is a crucial element to reduce the overall computational costs. Therefore, in this work we used, in combination with the inverse procedure, a GPU-parallel numerical model for the solution of the 2D Shallow Water equations (implemented in CUDA/C++ code) that allows achieving ratio of physical to computational time of about 500-1000 (depending on the test case features). In addition

Cluster chain based energy efficient routing protocol for moblie WSN

Directory of Open Access Journals (Sweden)

WU Ziyu

2016-04-01

Full Text Available With the ubiquitous smart devices acting as mobile sensor nodes in the wireless sensor networks(WSNs to sense and transmit physical information,routing protocols should be designed to accommodate the mobility issues,in addition to conventional considerations on energy efficiency.However,due to frequent topology change,traditional routing schemes cannot perform well.Moreover,existence of mobile nodes poses new challenges on energy dissipation and packet loss.In this paper,a novel routing scheme called cluster chain based routing protocol(CCBRP is proposed,which employs a combination of cluster and chain structure to accomplish data collection and transmission and thereafter selects qualified cluster heads as chain leaders to transmit data to the sink.Furthermore,node mobility is handled based on periodical membership update of mobile nodes.Simulation results demonstrate that CCBRP has a good performance in terms of network lifetime and packet delivery,also strikes a better balance between successful packet reception and energy consumption.

A Cross-Layer Route Discovery Framework for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Wu Jieyi

2005-01-01

Full Text Available Most reactive routing protocols in MANETs employ a random delay between rebroadcasting route requests (RREQ in order to avoid "broadcast storms." However this can lead to problems such as "next hop racing" and "rebroadcast redundancy." In addition to this, existing routing protocols for MANETs usually take a single routing strategy for all flows. This may lead to inefficient use of resources. In this paper we propose a cross-layer route discovery framework (CRDF to address these problems by exploiting the cross-layer information. CRDF solves the above problems efficiently and enables a new technique: routing strategy automation (RoSAuto. RoSAuto refers to the technique that each source node automatically decides the routing strategy based on the application requirements and each intermediate node further adapts the routing strategy so that the network resource usage can be optimized. To demonstrate the effectiveness and the efficiency of CRDF, we design and evaluate a macrobian route discovery strategy under CRDF.

Metro passengers’ route choice model and its application considering perceived transfer threshold

Science.gov (United States)

Jin, Fanglei; Zhang, Yongsheng; Liu, Shasha

2017-01-01

With the rapid development of the Metro network in China, the greatly increased route alternatives make passengers’ route choice behavior and passenger flow assignment more complicated, which presents challenges to the operation management. In this paper, a path sized logit model is adopted to analyze passengers’ route choice preferences considering such parameters as in-vehicle time, number of transfers, and transfer time. Moreover, the “perceived transfer threshold” is defined and included in the utility function to reflect the penalty difference caused by transfer time on passengers’ perceived utility under various numbers of transfers. Next, based on the revealed preference data collected in the Guangzhou Metro, the proposed model is calibrated. The appropriate perceived transfer threshold value and the route choice preferences are analyzed. Finally, the model is applied to a personalized route planning case to demonstrate the engineering practicability of route choice behavior analysis. The results show that the introduction of the perceived transfer threshold is helpful to improve the model’s explanatory abilities. In addition, personalized route planning based on route choice preferences can meet passengers’ diversified travel demands. PMID:28957376

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.

A modified hydrodynamic model for routing unsteady flow in a river having piedmont zone

Directory of Open Access Journals (Sweden)

Patowary Sudarshan

2017-03-01

Full Text Available Existence of piedmont zone in a river bed is a critical parameter from among numerous variations of topographical, geological and geographical conditions that can significantly influence the river flow scenario. Downstream flow situation assessed by routing of upstream hydrograph may yield higher flow depth if existence of such high infiltration zone is ignored and therefore it is a matter of concern for water resources planning and flood management. This work proposes a novel modified hydrodynamic model that has the potential to accurately determine the flow scenario in presence of piedmont zone. The model has been developed using unsteady free surface flow equations, coupled with Green-Ampt infiltration equation as governing equation. For solution of the governing equations Beam and Warming implicit finite difference scheme has been used. The proposed model was first validated from the field data of Trout Creek River showing excellent agreement. The validated model was then applied to a hypothetical river reach commensurate with the size of major tributaries of Brahmaputra Basin of India. Results indicated a 10% and 14% difference in the maximum value of discharge and depth hydrograph in presence and absence of piedmont zone respectively. Overall this model was successfully used to accurately predict the effect of piedmont zone on the unsteady flow in a river.

Route Assessment for Unmanned Aerial Vehicle Based on Cloud Model

Directory of Open Access Journals (Sweden)

Xixia Sun

2014-01-01

Full Text Available An integrated route assessment approach based on cloud model is proposed in this paper, where various sources of uncertainties are well kept and modeled by cloud theory. Firstly, a systemic criteria framework incorporating models for scoring subcriteria is developed. Then, the cloud model is introduced to represent linguistic variables, and survivability probability histogram of each route is converted into normal clouds by cloud transformation, enabling both randomness and fuzziness in the assessment environment to be managed simultaneously. Finally, a new way to measure the similarity between two normal clouds satisfying reflexivity, symmetry, transitivity, and overlapping is proposed. Experimental results demonstrate that the proposed route assessment approach outperforms fuzzy logic based assessment approach with regard to feasibility, reliability, and consistency with human thinking.

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

Science.gov (United States)

Rachamalla, Sandhya; Kancherla, Anitha Sheela

2016-01-01

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

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

DEFF Research Database (Denmark)

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

2017-01-01

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

Modified Pagerank Algorithm Based Real-Time Metropolitan Vehicular Traffic Routing Using GPS Crowdsourcing Data

Directory of Open Access Journals (Sweden)

Adithya Guru Vaishnav.S

2015-08-01

Full Text Available This paper aims at providing a theoretical framework to find an optimized route from any source to destination considering the real-time traffic congestion issues. The distance of various possible routes from the source and destination are calculated and a PathRank is allocated in the descending order of distance to each possible path. Each intermediate locations are considered as nodes of a graph and the edges are represented by real-time traffic flow monitored using GoogleMaps GPS crowdsourcing data. The Page Rank is calculated for each intermediate node. From the values of PageRank and PathRank the minimum sum term is used to find an optimized route with minimal trade-off between shortest path and real-time traffic.

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

Directory of Open Access Journals (Sweden)

Adamu Murtala Zungeru

2013-01-01

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

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

NARCIS (Netherlands)

Westerbeek, Hans; Maes, Alfons

2013-01-01

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

Hydrologic Response Unit Routing in SWAT to Simulate Effects of Vegetated Filter Strip for South-Korean Conditions Based on VFSMOD

Directory of Open Access Journals (Sweden)

Kyoung Jae Lim

2011-08-01

Full Text Available The Soil and Water Assessment Tool (SWAT model has been used worldwide for many hydrologic and Non-Point Source (NPS Pollution analyses on a watershed scale. However, it has many limitations in simulating the Vegetative Filter Strip (VFS because it considers only ‘filter strip width’ when the model estimates sediment trapping efficiency and does not consider the routing of sediment with overland flow which is expected to maximize the sediment trapping efficiency from upper agricultural subwatersheds to lower spatially-explicit filter strips. Therefore, the SWAT overland flow option between landuse-subwatersheds with sediment routing capability was enhanced by modifying the SWAT watershed configuration and SWAT engine based on the numerical model VFSMOD applied to South-Korean conditions. The enhanced SWAT can simulate the VFS sediment trapping efficiency for South-Korean conditions in a manner similar to the desktop VFSMOD-w system. Due to this enhancement, SWAT is applicable to simulate the effects of overland flow from upper subwatersheds to reflect increased runoff volume at the lower subwatershed, which occurs in the field if no diversion channel is installed. In this study, the enhanced SWAT model was applied to small watersheds located at Jaun-ri in South-Korea to simulate a diversion channel and spatially-explicit VFS. Sediment can be reduced by 31%, 65%, and 68%, with a diversion channel, the VFS, and the VFS with diversion channel, respectively. The enhanced SWAT should be used in estimating site-specific effects on sediment reduction with diversion channels and VFS, instead of the currently available SWAT, which does not simulate sediment routing in overland flow and does not consider other sensitive factors affecting sediment reduction with VFS.

Route Selection with Unspecified Sites Using Knowledge Based Genetic Algorithm

Science.gov (United States)

Kanoh, Hitoshi; Nakamura, Nobuaki; Nakamura, Tomohiro

This paper addresses the problem of selecting a route to a given destination that traverses several non-specific sites (e.g. a bank, a gas station) as requested by a driver. The proposed solution uses a genetic algorithm that includes viral infection. The method is to generate two populations of viruses as domain specific knowledge in addition to a population of routes. A part of an arterial road is regarded as a main virus, and a road that includes a site is regarded as a site virus. An infection occurs between two points common to a candidate route and the virus, and involves the substitution of the intersections carried by the virus for those on the existing candidate route. Crossover and infection determine the easiest-to-drive and quasi-shortest route through the objective landmarks. Experiments using actual road maps show that this infection-based mechanism is an effective way of solving the problem. Our strategy is general, and can be effectively used in other optimization problems.

Routing Service Quality—Local Driver Behavior Versus Routing Services

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

2013-01-01

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

Indoor 3D Route Modeling Based On Estate Spatial Data

Science.gov (United States)

Zhang, H.; Wen, Y.; Jiang, J.; Huang, W.

2014-04-01

Indoor three-dimensional route model is essential for space intelligence navigation and emergency evacuation. This paper is motivated by the need of constructing indoor route model automatically and as far as possible. By comparing existing building data sources, this paper firstly explained the reason why the estate spatial management data is chosen as the data source. Then, an applicable method of construction three-dimensional route model in a building is introduced by establishing the mapping relationship between geographic entities and their topological expression. This data model is a weighted graph consist of "node" and "path" to express the spatial relationship and topological structure of a building components. The whole process of modelling internal space of a building is addressed by two key steps: (1) each single floor route model is constructed, including path extraction of corridor using Delaunay triangulation algorithm with constrained edge, fusion of room nodes into the path; (2) the single floor route model is connected with stairs and elevators and the multi-floor route model is eventually generated. In order to validate the method in this paper, a shopping mall called "Longjiang New City Plaza" in Nanjing is chosen as a case of study. And the whole building space is constructed according to the modelling method above. By integrating of existing path finding algorithm, the usability of this modelling method is verified, which shows the indoor three-dimensional route modelling method based on estate spatial data in this paper can support indoor route planning and evacuation route design very well.

P-bRS: A Physarum-Based Routing Scheme for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mingchuan Zhang

2014-01-01

Full Text Available Routing in wireless sensor networks (WSNs is an extremely challenging issue due to the features of WSNs. Inspired by the large and single-celled amoeboid organism, slime mold Physarum polycephalum, we establish a novel selecting next hop model (SNH. Based on this model, we present a novel Physarum-based routing scheme (P-bRS for WSNs to balance routing efficiency and energy equilibrium. In P-bRS, a sensor node can choose the proper next hop by using SNH which comprehensively considers the distance, energy residue, and location of the next hop. The simulation results show how P-bRS can achieve the effective trade-off between routing efficiency and energy equilibrium compared to two famous algorithms.

Routing in Mobile Wireless Sensor Networks: A Leader-Based Approach.

Science.gov (United States)

Burgos, Unai; Amozarrain, Ugaitz; Gómez-Calzado, Carlos; Lafuente, Alberto

2017-07-07

This paper presents a leader-based approach to routing in Mobile Wireless Sensor Networks (MWSN). Using local information from neighbour nodes, a leader election mechanism maintains a spanning tree in order to provide the necessary adaptations for efficient routing upon the connectivity changes resulting from the mobility of sensors or sink nodes. We present two protocols following the leader election approach, which have been implemented using Castalia and OMNeT++. The protocols have been evaluated, besides other reference MWSN routing protocols, to analyse the impact of network size and node velocity on performance, which has demonstrated the validity of our approach.

Location-Based Self-Adaptive Routing Algorithm for Wireless Sensor Networks in Home Automation

Directory of Open Access Journals (Sweden)

Hong SeungHo

2011-01-01

Full Text Available The use of wireless sensor networks in home automation (WSNHA is attractive due to their characteristics of self-organization, high sensing fidelity, low cost, and potential for rapid deployment. Although the AODVjr routing algorithm in IEEE 802.15.4/ZigBee and other routing algorithms have been designed for wireless sensor networks, not all are suitable for WSNHA. In this paper, we propose a location-based self-adaptive routing algorithm for WSNHA called WSNHA-LBAR. It confines route discovery flooding to a cylindrical request zone, which reduces the routing overhead and decreases broadcast storm problems in the MAC layer. It also automatically adjusts the size of the request zone using a self-adaptive algorithm based on Bayes' theorem. This makes WSNHA-LBAR more adaptable to the changes of the network state and easier to implement. Simulation results show improved network reliability as well as reduced routing overhead.

Energy Efficient Position-Based Three Dimensional Routing for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jeongdae Kim

2008-04-01

Full Text Available In this paper, we focus on an energy efficient position-based three dimensional (3D routing algorithm using distance information, which affects transmission power consumption between nodes as a metric. In wireless sensor networks, energy efficiency is one of the primary objectives of research. In addition, recent interest in sensor networks is extended to the need to understand how to design networks in a 3D space. Generally, most wireless sensor networks are based on two dimensional (2D designs. However, in reality, such networks operate in a 3D space. Since 2D designs are simpler and easier to implement than 3D designs for routing algorithms in wireless sensor networks, the 2D assumption is somewhat justified and usually does not lead to major inaccuracies. However, in some applications such as an airborne to terrestrial sensor networks or sensor networks, which are deployed in mountains, taking 3D designs into consideration is reasonable. In this paper, we propose the Minimum Sum of Square distance (MSoS algorithm as an energy efficient position-based three dimensional routing algorithm. In addition, we evaluate and compare the performance of the proposed routing algorithm with other algorithms through simulation. Finally, the results of the simulation show that the proposed routing algorithm is more energy efficient than other algorithms in a 3D space.

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

Science.gov (United States)

Wang, Changji; Shi, Dongyuan; Xu, Xilei

2015-01-01

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

Cosmic radiation exposure on Canadian-based commercial airline routes

Energy Technology Data Exchange (ETDEWEB)

Lewis, B.J.; Tume, P.; Bennett, L.G.I.; Pierre, M.; Green, A.R

1998-07-01

As a result of the recent recommendations of the ICRP-60 and in anticipation of possible regulation on occupational exposure of commercial aircrew, a two-phase investigation was carried out over a one-year period to determine the total dose equivalent on representative Canadian-based flight routes. In the first phase of the study, dedicated scientific flights on a Northern round-trip route between Ottawa and Resolute Bay provided the opportunity to characterize the complex mixed-radiation field, and to intercompare various instrumentation using both a conventional suite of powered detectors and passive dosimetry. In the second phase, volunteer aircrew carried (passive) neutron bubble detectors during their routine flight duties. From these measurements, the total dose equivalent was derived for a given route with a knowledge of the neutron fraction as determined from the scientific flights and computer code (CART-LF) calculations. This study has yielded an extensive database of over 3100 measurements providing the total dose equivalent for 385 different routes. By folding in flight frequency information and the accumulated flight hours, the annual occupational exposures of 26 flight crew have been determined. This study has indicated that most Canadian-based domestic and international aircrew will exceed the proposed annual ICRP-60 public limit of 1 mSv y{sup -1} but will be well below the occupational limit of 20 mSv y{sup -1}. (author)

Cluster Based Hierarchical Routing Protocol for Wireless Sensor Network

OpenAIRE

Rashed, Md. Golam; Kabir, M. Hasnat; Rahim, Muhammad Sajjadur; Ullah, Shaikh Enayet

2012-01-01

The efficient use of energy source in a sensor node is most desirable criteria for prolong the life time of wireless sensor network. In this paper, we propose a two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP). We introduce a new concept called head-set, consists of one active cluster head and some other associate cluster heads within a cluster. The head-set members are responsible for control and management of the network. Results show that t...

Case Study on Optimal Routing in Logistics Network by Priority-based Genetic Algorithm

Science.gov (United States)

Wang, Xiaoguang; Lin, Lin; Gen, Mitsuo; Shiota, Mitsushige

Recently, research on logistics caught more and more attention. One of the important issues on logistics system is to find optimal delivery routes with the least cost for products delivery. Numerous models have been developed for that reason. However, due to the diversity and complexity of practical problem, the existing models are usually not very satisfying to find the solution efficiently and convinently. In this paper, we treat a real-world logistics case with a company named ABC Co. ltd., in Kitakyusyu Japan. Firstly, based on the natures of this conveyance routing problem, as an extension of transportation problem (TP) and fixed charge transportation problem (fcTP) we formulate the problem as a minimum cost flow (MCF) model. Due to the complexity of fcTP, we proposed a priority-based genetic algorithm (pGA) approach to find the most acceptable solution to this problem. In this pGA approach, a two-stage path decoding method is adopted to develop delivery paths from a chromosome. We also apply the pGA approach to this problem, and compare our results with the current logistics network situation, and calculate the improvement of logistics cost to help the management to make decisions. Finally, in order to check the effectiveness of the proposed method, the results acquired are compared with those come from the two methods/ software, such as LINDO and CPLEX.

The Prohibitive Link between Position-based Routing and Planarity

Directory of Open Access Journals (Sweden)

David Cairns

2013-12-01

Full Text Available Position-based routing is touted as an ideal routing strategy for resource-constrained wireless networks. One persistent barrier to adoption is due to its recovery phase, where messages are forwarded according to leftor right-hand rule (LHR. This is often referred to as face-routing. In this paper we investigate the limits of LHR with respect to planarity.We show that the gap between non-planarity and successful delivery is a single link within a single configuration. Our work begins with an analysis to enumerate all node configurations that cause intersections in the unit-disc graph. We find that left-hand rule is able to recover from all but a single case, the ‘umbrella’ configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the ‘bad’ links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of CLDP and GDSTR.

Energy efficient SDN commodity switch based practical flow forwarding method

KAUST Repository

AlGhadhban, Amer

2016-07-04

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

Route-Based Control of Hybrid Electric Vehicles: Preprint

Energy Technology Data Exchange (ETDEWEB)

Gonder, J. D.

2008-01-01

Today's hybrid electric vehicle controls cannot always provide maximum fuel savings over all drive cycles. Route-based controls could improve HEV fuel efficiency by 2%-4% and help save nearly 6.5 million gallons of fuel annually.

Multipath diffuse routing over heterogeneous mesh networks of web devices and sensors

NARCIS (Netherlands)

Vitale, G.; Stassen, M.L.A.; Colak, S.B.; Pronk, V.; Macq, B.; Quisquater, J.-.J.

2002-01-01

In this paper we present a new data flow algorithm based on physical diffusion for dense device networks needed for future ubiquitous communications. This diffuse data routing concept is based on multi-path signal propagation aided with adaptive beam-forming methods. Adaptation for beam-forming at

Management of Energy Consumption on Cluster Based Routing Protocol for MANET

Science.gov (United States)

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

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

Effective ANT based Routing Algorithm for Data Replication in MANETs

Directory of Open Access Journals (Sweden)

N.J. Nithya Nandhini

2013-12-01

Full Text Available In mobile ad hoc network, the nodes often move and keep on change its topology. Data packets can be forwarded from one node to another on demand. To increase the data accessibility data are replicated at nodes and made as sharable to other nodes. Assuming that all mobile host cooperative to share their memory and allow forwarding the data packets. But in reality, all nodes do not share the resources for the benefits of others. These nodes may act selfishly to share memory and to forward the data packets. This paper focuses on selfishness of mobile nodes in replica allocation and routing protocol based on Ant colony algorithm to improve the efficiency. The Ant colony algorithm is used to reduce the overhead in the mobile network, so that it is more efficient to access the data than with other routing protocols. This result shows the efficiency of ant based routing algorithm in the replication allocation.

An Enhanced Hybrid Social Based Routing Algorithm for MANET-DTN

Directory of Open Access Journals (Sweden)

Martin Matis

2016-01-01

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

A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

Directory of Open Access Journals (Sweden)

Nabil Sabor

2017-01-01

Full Text Available Introducing mobility to Wireless Sensor Networks (WSNs puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs. Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

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

Directory of Open Access Journals (Sweden)

Kai Lin

2010-01-01

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

Predicting transportation routes for radioactive wastes

International Nuclear Information System (INIS)

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

1981-01-01

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

Evaluating LSM-Based Water Budgets Over a West African Basin Assisted with a River Routing Scheme

Science.gov (United States)

Getirana, Augusto C. V.; Boone, Aaron; Peugeot, Christophe

2014-01-01

Within the framework of the African Monsoon Multidisciplinary Analysis (AMMA) Land Surface Model Intercomparison Project phase 2 (ALMIP-2), this study evaluates the water balance simulated by the Interactions between Soil, Biosphere, and Atmosphere (ISBA) over the upper Oum River basin, in Benin, using a mesoscale river routing scheme (RRS). The RRS is based on the nonlinear Muskingum Cunge method coupled with two linear reservoirs that simulate the time delay of both surface runoff and base flow that are produced by land surface models. On the basis of the evidence of a deep water-table recharge in that region,a reservoir representing the deep-water infiltration (DWI) is introduced. The hydrological processes of the basin are simulated for the 2005-08 AMMA field campaign period during which rainfall and stream flow data were intensively collected over the study area. Optimal RRS parameter sets were determined for three optimization experiments that were performed using daily stream flow at five gauges within the basin. Results demonstrate that the RRS simulates stream flow at all gauges with relative errors varying from -22% to 3% and Nash-Sutcliffe coefficients varying from 0.62 to 0.90. DWI varies from 24% to 67% of the base flow as a function of the sub-basin. The relatively simple reservoir DWI approach is quite robust, and further improvements would likely necessitate more complex solutions (e.g., considering seasonality and soil type in ISBA); thus, such modifications are recommended for future studies. Although the evaluation shows that the simulated stream flows are generally satisfactory, further field investigations are necessary to confirm some of the model assumptions.

Spatial Techniques to Visualize Acoustic Comfort along Cultural and Heritage Routes for a World Heritage City

Directory of Open Access Journals (Sweden)

Ni Sheng

2015-07-01

Full Text Available This paper proposes to visualize acoustic comfort along tourist routes. Route-based tourism is crucial to the sustainability of tourism development in historic areas. Applying the concept of route-based tourism to guide tourists rambling along cultural and heritage routes can relieve overcrowded condition at hot scenic spots and increase the overall carrying capacity of the city. However, acoustic comfort along tourist routes is rarely addressed in academic studies and decision-making. Taking Macao as an example, this paper has studied pedestrian exposure to traffic noise along the cultural and heritage routes. The study is based on a GIS-based traffic noise model system with a high spatial resolution down to individual buildings along both sides of the street. Results show that tourists suffer from excessive traffic noise at certain sites, which may have negative impact on the promotion of route-based tourism in the long run. In addition, it is found that urban growth affects urban form and street layout, which in turn affect traffic flow and acoustic comfort in urban area. The present study demonstrates spatial techniques to visualize acoustic comfort along tourist routes, and the techniques are foreseen to be used more frequently to support effective tourism planning in the future.

A constrained multinomial Probit route choice model in the metro network: Formulation, estimation and application

Science.gov (United States)

Zhang, Yongsheng; Wei, Heng; Zheng, Kangning

2017-01-01

Considering that metro network expansion brings us with more alternative routes, it is attractive to integrate the impacts of routes set and the interdependency among alternative routes on route choice probability into route choice modeling. Therefore, the formulation, estimation and application of a constrained multinomial probit (CMNP) route choice model in the metro network are carried out in this paper. The utility function is formulated as three components: the compensatory component is a function of influencing factors; the non-compensatory component measures the impacts of routes set on utility; following a multivariate normal distribution, the covariance of error component is structured into three parts, representing the correlation among routes, the transfer variance of route, and the unobserved variance respectively. Considering multidimensional integrals of the multivariate normal probability density function, the CMNP model is rewritten as Hierarchical Bayes formula and M-H sampling algorithm based Monte Carlo Markov Chain approach is constructed to estimate all parameters. Based on Guangzhou Metro data, reliable estimation results are gained. Furthermore, the proposed CMNP model also shows a good forecasting performance for the route choice probabilities calculation and a good application performance for transfer flow volume prediction. PMID:28591188

Model-Checking Driven Design of QoS-Based Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhi Chen

2015-01-01

Full Text Available Accurate and reliable routing protocols with Quality of Service (QoS support determine the mission-critical application efficiency in WSNs. This paper proposes a model-checking design driven framework for designing the QoS-based routing protocols of WSNs, which involves the light-weight design process, the timed automata model, and the alternative QoS verification properties. The accurate feedback of continually model checking in the iterative design process effectively stimulates the parameter tuning of the protocols. We demonstrate the straightforward and modular characteristics of the proposed framework in designing a prototype QoS-based routing protocol. The prototype study shows that the model-checking design framework may complement other design methods and ensure the QoS implementation of the QoS-based routing protocol design for WSNs.

Particle Swarm Optimization and harmony search based clustering and routing in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Veena Anand

2017-01-01

Full Text Available Wireless Sensor Networks (WSN has the disadvantage of limited and non-rechargeable energy resource in WSN creates a challenge and led to development of various clustering and routing algorithms. The paper proposes an approach for improving network lifetime by using Particle swarm optimization based clustering and Harmony Search based routing in WSN. So in this paper, global optimal cluster head are selected and Gateway nodes are introduced to decrease the energy consumption of the CH while sending aggregated data to the Base station (BS. Next, the harmony search algorithm based Local Search strategy finds best routing path for gateway nodes to the Base Station. Finally, the proposed algorithm is presented.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2017-03-01

Full Text Available In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast, second technique is the improved Hydrocast (improved-Hydrocast, and third one is the cooperative improved Hydrocast (Co-improved Hydrocast. In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR of the received signal is not within the predefined threshold then the maximal ratio combining (MRC is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

Science.gov (United States)

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-03-19

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shujun Bi

2011-09-01

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

Integrated modeling of groundwater-surface water interactions in a tile-drained agricultural field: The importance of directly measured flow route contributions

NARCIS (Netherlands)

Rozemeijer, J.C.; Velde, Y. van der; McLaren, R.G.; Geer, F.C. van; Broers, H.P.; Bierkens, M.F.P.

2010-01-01

Understanding the dynamics of groundwater-surface water interaction is needed to evaluate and simulate water and solute transport in catchments. However, direct measurements of the contributions of different flow routes from specific surfaces within a catchment toward the surface water are rarely

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

Science.gov (United States)

Zhang, Zhengsheng; Cai, Chao

2011-12-01

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

Reliable Freestanding Position-Based Routing in Highway Scenarios

Science.gov (United States)

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

2012-01-01

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

Efficient routing on scale-free networks based on local information

International Nuclear Information System (INIS)

Yin Chuanyang; Wang Binghong; Wang Wenxu; Zhou Tao; Yang Huijie

2006-01-01

In this Letter, we propose a new routing strategy with a single tunable parameter α only based on local information of network topology. The probability that a given node i with degree k i receives packets from its neighbors is proportional to k i α . In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of α is sought out. Through investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal α. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which does not depend on α. This phenomenon suggests that the capacity of the scale-free network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion

An Ultra-Low-Latency Geo-Routing Scheme for Team-Based Unmanned Vehicular Applications

KAUST Repository

Bader, Ahmed; Alouini, Mohamed-Slim

2016-01-01

Results and lessons learned from the implementation of a novel ultra low-latency geo-routing scheme are presented in this paper. The geo-routing scheme is intended for team-based mobile systems whereby a cluster of unmanned autonomous vehicles

Iconic memory-based omnidirectional route panorama navigation.

Science.gov (United States)

Yagi, Yasushi; Imai, Kousuke; Tsuji, Kentaro; Yachida, Masahiko

2005-01-01

A route navigation method for a mobile robot with an omnidirectional image sensor is described. The route is memorized from a series of consecutive omnidirectional images of the horizon when the robot moves to its goal. While the robot is navigating to the goal point, input is matched against the memorized spatio-temporal route pattern by using dual active contour models and the exact robot position and orientation is estimated from the converged shape of the active contour models.

Architecture Design and Experimental Platform Demonstration of Optical Network based on OpenFlow Protocol

Science.gov (United States)

Xing, Fangyuan; Wang, Honghuan; Yin, Hongxi; Li, Ming; Luo, Shenzi; Wu, Chenguang

2016-02-01

With the extensive application of cloud computing and data centres, as well as the constantly emerging services, the big data with the burst characteristic has brought huge challenges to optical networks. Consequently, the software defined optical network (SDON) that combines optical networks with software defined network (SDN), has attracted much attention. In this paper, an OpenFlow-enabled optical node employed in optical cross-connect (OXC) and reconfigurable optical add/drop multiplexer (ROADM), is proposed. An open source OpenFlow controller is extended on routing strategies. In addition, the experiment platform based on OpenFlow protocol for software defined optical network, is designed. The feasibility and availability of the OpenFlow-enabled optical nodes and the extended OpenFlow controller are validated by the connectivity test, protection switching and load balancing experiments in this test platform.

Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks

Directory of Open Access Journals (Sweden)

Xu Wang

2015-01-01

Full Text Available We investigate an opportunistic routing protocol in delay/disruption tolerant networks (DTNs where the end-to-end path between source and destination nodes may not exist for most of the time. Probabilistic routing protocol using history of encounters and transitivity (PRoPHET is an efficient history-based routing protocol specifically proposed for DTNs, which only utilizes the delivery predictability of one-hop neighbors to make a decision for message forwarding. In order to further improve the message delivery rate and to reduce the average overhead of PRoPHET, in this paper we propose an improved probabilistic routing algorithm (IPRA, where the history information of contacts for the immediate encounter and two-hop neighbors has been jointly used to make an informed decision for message forwarding. Based on the Opportunistic Networking Environment (ONE simulator, the performance of IPRA has been evaluated via extensive simulations. The results show that IPRA can significantly improve the average delivery rate while achieving a better or comparable performance with respect to average overhead, average delay, and total energy consumption compared with the existing algorithms.

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

Science.gov (United States)

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

2016-01-01

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

DESIGNING DAILY PATROL ROUTES FOR POLICING BASED ON ANT COLONY ALGORITHM

Directory of Open Access Journals (Sweden)

H. Chen

2015-07-01

Full Text Available In this paper, we address the problem of planning police patrol routes to regularly cover street segments of high crime density (hotspots with limited police forces. A good patrolling strategy is required to minimise the average time lag between two consecutive visits to hotspots, as well as coordinating multiple patrollers and imparting unpredictability in patrol routes. Previous studies have designed different police patrol strategies for routing police patrol, but these strategies have difficulty in generalising to real patrolling and meeting various requirements. In this research we develop a new police patrolling strategy based on Bayesian method and ant colony algorithm. In this strategy, virtual marker (pheromone is laid to mark the visiting history of each crime hotspot, and patrollers continuously decide which hotspot to patrol next based on pheromone level and other variables. Simulation results using real data testifies the effective, scalable, unpredictable and extensible nature of this strategy.

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

Science.gov (United States)

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

2005-01-01

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

Optimization Route of Food Logistics Distribution Based on Genetic and Graph Cluster Scheme Algorithm

OpenAIRE

Jing Chen

2015-01-01

This study takes the concept of food logistics distribution as the breakthrough point, by means of the aim of optimization of food logistics distribution routes and analysis of the optimization model of food logistics route, as well as the interpretation of the genetic algorithm, it discusses the optimization of food logistics distribution route based on genetic and cluster scheme algorithm.

Cosmic Radiation Exposure on Canadian-Based Commercial Airline Routes

Energy Technology Data Exchange (ETDEWEB)

Lewis, B.J.; Tume, P.; Bennett, L.G.I.; Pierre, M.; Green, A.R.; Cousins, T.; Hoffarth, B.E.; Jones, T.A.; Brisson, J.R

1999-07-01

As a result of the recent recommendations of ICRP 60 and in anticipation of possible regulation on occupational exposure of commercial aircrew, a two-part investigation was carried out over a one-year period to determine the total dose equivalent on representative Canadian-based flight routes. As part of the study, a dedicated scientific measurement flight (using both a conventional suite of powered detectors and passive dosimetry) was used to characterise the complex mixed radiation field and to intercompare the various instrumentation. In the other part of the study, volunteer aircrew carried (passive) neutron bubble detectors during their routine flight duties. From these measurements, the total dose equivalent was derived for a given route with a knowledge of the neutron fraction as determined from the scientific flight and computer code (CARI-LF) calculations. This investigation has yielded an extensive database of over 3100 measurements providing the total dose equivalent for 385 different routes. By folding in flight frequency information and the accumulated flight hours, the annual occupational exposures of 26 flight crew have also been determined. This study has indicated that most Canadian-based domestic and international aircrew will exceed the proposed annual ICRP 60 public limit of 1 mSv.y{sup -1}, but will be below the occupational limit of 20 mSv.y{sup -1}. (author)

Two models of the capacitated vehicle routing problem

Directory of Open Access Journals (Sweden)

Zuzana Borčinova

2017-01-01

Full Text Available The aim of the Capacitated Vehicle Routing Problem (CVRP is to find a set of minimum total cost routes for a fleet of capacitated vehicles based at a single depot, to serve a set of customers. There exist various integer linear programming models of the CVRP. One of the main differences lies in the way to eliminate sub-tours, i.e. cycles that do not go through the depot. In this paper, we describe a well-known flow formulation of CVRP, where sub-tour elimination constraints have a cardinality exponentially growing with the number of customers. Then we present a mixed linear programming formulation with polynomial cardinality of sub-tour elimination constraints. Both of the models were implemented and compared on several benchmarks.

ABORt: Acknowledgement-Based Opportunistic Routing Protocol for High Data Rate Multichannel WSNs

Directory of Open Access Journals (Sweden)

Hamadoun Tall

2017-10-01

Full Text Available The ease of deployment and the auto-configuration capabilities of Wireless Sensor Networks (WSNs make them very attractive in different domains like environmental, home automation or heath care applications. The use of multichannel communications in WSNs helps to improve the overall performance of the network. However, in heavy traffic scenarios, routing protocols should be adapted to allow load balancing and to avoid losing data packets due to congestion and queue overflow. In this paper, we present an Acknowledgement-Based Opportunistic Routing (ABORt protocol designed for high data rate multichannel WSNs. It is a low overhead protocol that does not rely on synchronization for control traffic exchange during the operational phase of the network. ABORt is an opportunistic protocol that relies on link layer acknowledgements to disseminate routing metrics, which helps to reduce overhead. The performance of ABORt is evaluated using the Cooja simulator and the obtained results show that ABORt has a high packet delivery ratio with reduced packet end-to-end delay compared to two single channel routing protocols and two multichannel routing protocols that use number of hops and expected transmission count as routing metrics.

U-Access: a web-based system for routing pedestrians of differing abilities

Science.gov (United States)

Sobek, Adam D.; Miller, Harvey J.

2006-09-01

For most people, traveling through urban and built environments is straightforward. However, for people with physical disabilities, even a short trip can be difficult and perhaps impossible. This paper provides the design and implementation of a web-based system for the routing and prescriptive analysis of pedestrians with different physical abilities within built environments. U-Access, as a routing tool, provides pedestrians with the shortest feasible route with respect to one of three differing ability levels, namely, peripatetic (unaided mobility), aided mobility (mobility with the help of a cane, walker or crutches) and wheelchair users. U-Access is also an analytical tool that can help identify obstacles in built environments that create routing discrepancies among pedestrians with different physical abilities. This paper discusses the system design, including database, algorithm and interface specifications, and technologies for efficiently delivering results through the World Wide Web (WWW). This paper also provides an illustrative example of a routing problem and an analytical evaluation of the existing infrastructure which identifies the obstacles that pose the greatest discrepancies between physical ability levels. U-Access was evaluated by wheelchair users and route experts from the Center for Disability Services at The University of Utah, USA.

Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks.

Science.gov (United States)

Zeng, Feng; Zhao, Nan; Li, Wenjia

2017-05-12

In mobile opportunistic networks, the social relationship among nodes has an important impact on data transmission efficiency. Motivated by the strong share ability of "circles of friends" in communication networks such as Facebook, Twitter, Wechat and so on, we take a real-life example to show that social relationships among nodes consist of explicit and implicit parts. The explicit part comes from direct contact among nodes, and the implicit part can be measured through the "circles of friends". We present the definitions of explicit and implicit social relationships between two nodes, adaptive weights of explicit and implicit parts are given according to the contact feature of nodes, and the distributed mechanism is designed to construct the "circles of friends" of nodes, which is used for the calculation of the implicit part of social relationship between nodes. Based on effective measurement of social relationships, we propose a social-based clustering and routing scheme, in which each node selects the nodes with close social relationships to form a local cluster, and the self-control method is used to keep all cluster members always having close relationships with each other. A cluster-based message forwarding mechanism is designed for opportunistic routing, in which each node only forwards the copy of the message to nodes with the destination node as a member of the local cluster. Simulation results show that the proposed social-based clustering and routing outperforms the other classic routing algorithms.

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.

Novel routes to liquid-based self-healing polymer systems

NARCIS (Netherlands)

Mookhoek, S.D.

2010-01-01

Inspired by the current state-of-the-art and the progressing advancements in the field of self-healing materials, this thesis addresses several novel routes to advance the concept of liquid-based self-healing polymer systems. This thesis presents the concept and characterisation of a one-component

A study of routing algorithms for SCI-Based multistage networks

International Nuclear Information System (INIS)

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

1994-03-01

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

VINE ROUTES IN BULGARIA

Directory of Open Access Journals (Sweden)

Lyuben Hristov

2015-03-01

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

Distributed routing algorithms to manage power flow in agent-based active distribution network

NARCIS (Netherlands)

Nguyen, H.P.; Kling, W.L.; Georgiadis, G.; Papatriantafilou, M.; Anh-Tuan, L.; Bertling, L.

2010-01-01

The current transition from passive to active electric distribution networks comes with problems and challenges on bi-directional power flow in the network and the uncertainty in the forecast of power generation from grid-connected renewable and distributed energy sources. The power flow management

Solving Inventory Routing Problems Using Location Based Heuristics

Directory of Open Access Journals (Sweden)

Paweł Hanczar

2014-01-01

Full Text Available Inventory routing problems (IRPs occur where vendor managed inventory replenishment strategies are implemented in supply chains. These problems are characterized by the presence of both transportation and inventory considerations, either as parameters or constraints. The research presented in this paper aims at extending IRP formulation developed on the basis of location based heuristics proposed by Bramel and Simchi-Levi and continued by Hanczar. In the first phase of proposed algorithms, mixed integer programming is used to determine the partitioning of customers as well as dates and quantities of deliveries. Then, using 2-opt algorithm for solving the traveling sales-person problem the optimal routes for each partition are determined. In the main part of research the classical formulation is extended by additional constraints (visit spacing, vehicle filling rate, driver (vehicle consistency, and heterogeneous fleet of vehicles as well as the additional criteria are discussed. Then the impact of using each of proposed extensions for solution possibilities is evaluated. The results of computational tests are presented and discussed. Obtained results allow to conclude that the location based heuristics should be considered when solving real life instances of IRP. (original abstract

Collision risk-capacity tradeoff analysis of an en-route corridor model

Directory of Open Access Journals (Sweden)

Ye Bojia

2014-02-01

Full Text Available Flow corridors are a new class of trajectory-based airspace which derives from the next generation air transportation system concept of operations. Reducing the airspace complexity and increasing the capacity are the main purposes of the en-route corridor. This paper analyzes the collision risk-capacity tradeoff using a combined discrete–continuous simulation method. A basic two-dimensional en-route flow corridor with performance rules is designed as the operational environment. A second-order system is established by combining the point mass model and the proportional derivative controller together to simulate the self-separation operations of the aircrafts in the corridor and the operation performance parameters from the User Manual for the Base of Aircraft Data are used in this research in order to improve the reliability. Simulation results indicate that the aircrafts can self-separate from each other efficiently by adjusting their velocities, and rationally setting the values of some variables can improve the rate and stability of the corridor with low risks of loss of separation.

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

Directory of Open Access Journals (Sweden)

Shujuan Wang

2015-01-01

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

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

Directory of Open Access Journals (Sweden)

Ye Sun

2011-12-01

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

Research on the Method of Urban Waterlogging Flood Routing Based on Hexagonal Grid

Directory of Open Access Journals (Sweden)

LAI Guangling

2016-12-01

Full Text Available An evolution of the urban waterlogging flood routing was studied in this paper based on the method of hexagonal grid modeling. Using the method of discrete grid, established an urban geometry model on account of the regular multi-scale discrete grid. With the fusion of 3D topographic survey data and 2D building vector data, formed a regular network model of surface. This model took multi special block into account, such as urban terrain and buildings. On this basis, a method of reverse flow deduction was proposed, which was an inverse computation from the state of flood to the evolution process. That is, based on the water depth of flood, made use of the connectivity with the outfall to calculate the range of water logging, and then implemented the urban waterlogging flood simulation deduction. The test indicated that, this method can implement the evolution of urban waterlogging scenario deduction effectively. And the correlational research could provide scientific basis for urban disaster prevention and emergency decision-making.

Computer-based route-definition system for peripheral bronchoscopy.

Science.gov (United States)

Graham, Michael W; Gibbs, Jason D; Higgins, William E

2012-04-01

Multi-detector computed tomography (MDCT) scanners produce high-resolution images of the chest. Given a patient's MDCT scan, a physician can use an image-guided intervention system to first plan and later perform bronchoscopy to diagnostic sites situated deep in the lung periphery. An accurate definition of complete routes through the airway tree leading to the diagnostic sites, however, is vital for avoiding navigation errors during image-guided bronchoscopy. We present a system for the robust definition of complete airway routes suitable for image-guided bronchoscopy. The system incorporates both automatic and semiautomatic MDCT analysis methods for this purpose. Using an intuitive graphical user interface, the user invokes automatic analysis on a patient's MDCT scan to produce a series of preliminary routes. Next, the user visually inspects each route and quickly corrects the observed route defects using the built-in semiautomatic methods. Application of the system to a human study for the planning and guidance of peripheral bronchoscopy demonstrates the efficacy of the system.

A LOOP-BASED APPROACH IN CLUSTERING AND ROUTING IN MOBILE AD HOC NETWORKS

Institute of Scientific and Technical Information of China (English)

Li Yanping; Wang Xin; Xue Xiangyang; C.K. Toh

2006-01-01

Although clustering is a convenient framework to enable traffic control and service support in Mobile Ad hoc NETworks (MANETs), it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is disseminated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop suggests smart route recovery strategy. Our approach is composed of setup procedure, regular procedure and recovery procedure to achieve clustering, routing and emergent route recovering.

ADAPTIVE CLUSTER BASED ROUTING PROTOCOL WITH ANT COLONY OPTIMIZATION FOR MOBILE AD-HOC NETWORK IN DISASTER AREA

Directory of Open Access Journals (Sweden)

Enrico Budianto

2012-07-01

Full Text Available In post-disaster rehabilitation efforts, the availability of telecommunication facilities takes important role. However, the process to improve telecommunication facilities in disaster area is risky if it is done by humans. Therefore, a network method that can work efficiently, effectively, and capable to reach the widest possible area is needed. This research introduces a cluster-based routing protocol named Adaptive Cluster Based Routing Protocol (ACBRP equipped by Ant Colony Optimization method, and its implementation in a simulator developed by author. After data analysis and statistical tests, it can be concluded that routing protocol ACBRP performs better than AODV and DSR routing protocol. Pada upaya rehabilitasi pascabencana, ketersediaan fasilitas telekomunikasi memiliki peranan yang sangat penting. Namun, proses untuk memperbaiki fasilitas telekomunikasi di daerah bencana memiliki resiko jika dilakukan oleh manusia. Oleh karena itu, metode jaringan yang dapat bekerja secara efisien, efektif, dan mampu mencapai area seluas mungkin diperlukan. Penelitian ini memperkenalkan sebuah protokol routing berbasis klaster bernama Adaptive Cluster Based Routing Protocol (ACBRP, yang dilengkapi dengan metode Ant Colony Optimization, dan diimplementasikan pada simulator yang dikembangkan penulis. Setelah data dianalisis dan dilakukan uji statistik, disimpulkan bahwa protokol routing ACBRP beroperasi lebih baik daripada protokol routing AODV maupun DSR.

Static Three-Dimensional Fuzzy Routing Based on the Receiving Probability in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sohrab Khanmohammadi

2013-11-01

Full Text Available A Wireless Sensor Network (WSN is a collection of low-cost, low-power and large-scale wireless sensor nodes. Routing protocols are an important topic in WSN. Every sensor node should use a proper mechanism to transmit the generated packets to its destination, usually a base station. In previous works, routing protocols use the global information of the network that causes the redundant packets to be increased. Moreover, it leads to an increase in the network traffic, to a decrease in the delivery ratio of data packets, and to a reduction in network life. In this paper, we propose a new inferential routing protocol called SFRRP (Static Three-Dimensional Fuzzy Routing based on the Receiving Probability. The proposed protocol solves the above mentioned problems considerably. The data packets are transmitted by hop-to-hop delivery to the base station. It uses a fuzzy procedure to transmit the sensed data or the buffered data packets to one of the neighbors called selected node. In the proposed fuzzy system, the distance and number of neighbors are input variables, while the receiving probability is the output variable. SFRRP just uses the local neighborhood information to forward the packets and is not needed by any redundant packet for route discovery. The proposed protocol has some advantages such as a high delivery ratio, less delay time, high network life, and less network traffic. The performance of the proposed protocol surpasses the performance of the Flooding routing protocol in terms of delivery ratio, delay time and network lifetime.

Sensitivity Test of Parameters Influencing Flood Hydrograph Routing with a Diffusion-Wave Distributed using Distributed Hydrological Model, Wet Spa, in Ziarat Watershed

Directory of Open Access Journals (Sweden)

narges javidan

2017-02-01

Full Text Available Introduction: Flood routing is a procedure to calculate flood stage and water depth along a river or to estimate flood hydrograph at river downstream or at reservoir outlets using the upstream hydrography . In river basins, excess rainfall is routed to the basin outlet using flow routing techniques to generate flow hydrograph. A GIS-based distributed hydrological model, Wet Spa, has been under development suitable for flood prediction and watershed management on a catchment scale. The model predicts outflow hydrographs at the basin outlet or at any converging point in the watershed, and it does so in a user-specified time step. The model is physically based, spatially distributed and time-continuous, and simulates hydrological processes of precipitation, snowmelt, interception, depression, surface runoff, infiltration, evapotranspiration, percolation, interflow, groundwater flow, etc. continuously both in time and space, for which the water and energy balance are maintained on each raster cell. Surface runoff is produced using a modified coefficient method based on the cellular characteristics of slope, land use, and soil type, and allowed to vary with soil moisture, rainfall intensity and storm duration. Interflow is computed based on the Darcy’s law and the kinematic approximation as a function of the effective hydraulic conductivity and the hydraulic gradient, while groundwater flow is estimated with a linear reservoir method on a small subcatchment scale as a function of groundwater storage and a recession coefficient. Special emphasis is given to the overland flow and channel flow routing using the method of linear diffusive wave approximation, which is capable to predict flow discharge at any converging point downstream by a unit response function. The model accounts for spatially distributed hydrological and geophysical characteristics of the catchment. Determination of the river flow hydrograph is a main target in hydrology

Prediction based Greedy Perimeter Stateless Routing Protocol for Vehicular Self-organizing Network

Science.gov (United States)

Wang, Chunlin; Fan, Quanrun; Chen, Xiaolin; Xu, Wanjin

2018-03-01

PGPSR (Prediction based Greedy Perimeter Stateless Routing) is based on and extended the GPSR protocol to adapt to the high speed mobility of the vehicle auto organization network (VANET) and the changes in the network topology. GPSR is used in the VANET network environment, the network loss rate and throughput are not ideal, even cannot work. Aiming at the problems of the GPSR, the proposed PGPSR routing protocol, it redefines the hello and query packet structure, in the structure of the new node speed and direction information, which received the next update before you can take advantage of its speed and direction to predict the position of node and new network topology, select the right the next hop routing and path. Secondly, the update of the outdated node information of the neighbor’s table is deleted in time. The simulation experiment shows the performance of PGPSR is better than that of GPSR.

Practical application of game theory based production flow planning method in virtual manufacturing networks

Science.gov (United States)

Olender, M.; Krenczyk, D.

2016-08-01

Modern enterprises have to react quickly to dynamic changes in the market, due to changing customer requirements and expectations. One of the key area of production management, that must continuously evolve by searching for new methods and tools for increasing the efficiency of manufacturing systems is the area of production flow planning and control. These aspects are closely connected with the ability to implement the concept of Virtual Enterprises (VE) and Virtual Manufacturing Network (VMN) in which integrated infrastructure of flexible resources are created. In the proposed approach, the players role perform the objects associated with the objective functions, allowing to solve the multiobjective production flow planning problems based on the game theory, which is based on the theory of the strategic situation. For defined production system and production order models ways of solving the problem of production route planning in VMN on computational examples for different variants of production flow is presented. Possible decision strategy to use together with an analysis of calculation results is shown.

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

Eco-routing: More green drivers means more benefits?

Energy Technology Data Exchange (ETDEWEB)

Valdes Serrano, C.; Perez Prada, F.; Monzon de Caceres, A.

2016-07-01

Information and Communications Technology (ICT)/Information and Technology Services (ITS) can play an important role in the transport sector, helping in maintaining accessibility and contemporarily optimizing the use of the vehicles. Among these ICT measures, eco-routing seems a promising one. Drivers normally follow the route which minimizes their generalized costs, normally time and money. But environmental concern is increasing, and drivers are starting to think about the effects of their driving. This means including CO2 emissions or fuel consumption in their route choice. But is this always positive, independently of the traffic situation and the penetration level of green drivers? This articles aims to analyze what happens in terms of fuel consumption, CO2 emissions and travel time, when different penetration levels of drivers, and with different traffic situations, follow the route of minimum fuel consumption instead of the conventional generalized costs. The analysis is based on a modelling process using a transport model of the whole region of Madrid. A total of 18 scenarios are considered: 3 reference scenarios (for congested, medium and low flow traffic situations), and 5 different penetration levels of green drivers for each traffic situation. Results show how impact varies substantially with the level of traffic and, also, that the more the best is not always true. (Author)

Design of Logistics Route Planning for Printing Enterprises Based on Baidu Map

Directory of Open Access Journals (Sweden)

Da Zhong-Yue

2017-01-01

Full Text Available As traditional printing industry is facing fierce competition in the market and logistics becomes a new sources of growth, the traditional printing enterprises want to build and improve their logistics system. So in this paper, the author has designed the logistics planning system based on the Baidu map development kit. It has the function of route planning and location tracking. This system meet the printing enterprise logistics route planning and tracking demand.

Indoor Pedestrian Navigation Based on Hybrid Route Planning and Location Modeling

DEFF Research Database (Denmark)

Schougaard, Kari Rye; Grønbæk, Kaj; Scharling, Tejs

2012-01-01

This paper introduces methods and services called PerPosNav for development of custom indoor pedestrian navigation applications to be deployed on a variety of platforms. PerPosNav combines symbolic and geometry based modeling of buildings, and in turn combines graph-based and geometric route...

Vertex routing models

International Nuclear Information System (INIS)

Markovic, D; Gros, C

2009-01-01

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

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

Science.gov (United States)

Zhu, Xudong; Wang, Jinhang; Chen, Yunchao

2014-01-01

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

Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks †

Science.gov (United States)

Zeng, Feng; Zhao, Nan; Li, Wenjia

2017-01-01

In mobile opportunistic networks, the social relationship among nodes has an important impact on data transmission efficiency. Motivated by the strong share ability of “circles of friends” in communication networks such as Facebook, Twitter, Wechat and so on, we take a real-life example to show that social relationships among nodes consist of explicit and implicit parts. The explicit part comes from direct contact among nodes, and the implicit part can be measured through the “circles of friends”. We present the definitions of explicit and implicit social relationships between two nodes, adaptive weights of explicit and implicit parts are given according to the contact feature of nodes, and the distributed mechanism is designed to construct the “circles of friends” of nodes, which is used for the calculation of the implicit part of social relationship between nodes. Based on effective measurement of social relationships, we propose a social-based clustering and routing scheme, in which each node selects the nodes with close social relationships to form a local cluster, and the self-control method is used to keep all cluster members always having close relationships with each other. A cluster-based message forwarding mechanism is designed for opportunistic routing, in which each node only forwards the copy of the message to nodes with the destination node as a member of the local cluster. Simulation results show that the proposed social-based clustering and routing outperforms the other classic routing algorithms. PMID:28498309

PERFORMANCE ANALYSIS OF DSR ROUTING PROTOCOL UNDER ENERGY BASED SELFISH ATTACK IN MOBILE AD HOC NETWORKS

Directory of Open Access Journals (Sweden)

T.V.P.Sundararajan

2010-06-01

Full Text Available Mobile Ad hoc Networks (MANETs rely on the cooperation of all participating nodes to provide the fundamental operations such as routing and data forwarding. However, due to the open structure and scarcely available battery-based energy, node misbehaviors may exist.[1]. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. This paper pointed out Energy based selfish nodes (EBSN where these selfish nodes tend to use the network but do not cooperate, saving battery life for their own communications [2],[3]. We present a simulation study of the effects of Energy based selfish nodes (EBSN on DSR routing protocol and its impact over network performance in terms of throughput and delay of a mobile ad hoc network where a defined percentage of nodes were misbehaving.

Developing an eco-routing application.

Science.gov (United States)

2014-01-01

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

Research on routing algorithm based on the VANET

Directory of Open Access Journals (Sweden)

AN Li

2016-01-01

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

Placement of effective work-in-progress limits in route-specific unit-based pull systems

NARCIS (Netherlands)

Ziengs, N.; Riezebos, J.; Germs, R.

2012-01-01

Unit-based pull systems control the throughput time of orders in a production system by limiting the number of orders on the shop floor. In production systems where orders can follow different routings on the shop floor, route-specific pull systems that control the progress of orders on the shop

Routing protocol for wireless quantum multi-hop mesh backbone network based on partially entangled GHZ state

Science.gov (United States)

Xiong, Pei-Ying; Yu, Xu-Tao; Zhang, Zai-Chen; Zhan, Hai-Tao; Hua, Jing-Yu

2017-08-01

Quantum multi-hop teleportation is important in the field of quantum communication. In this study, we propose a quantum multi-hop communication model and a quantum routing protocol with multihop teleportation for wireless mesh backbone networks. Based on an analysis of quantum multi-hop protocols, a partially entangled Greenberger-Horne-Zeilinger (GHZ) state is selected as the quantum channel for the proposed protocol. Both quantum and classical wireless channels exist between two neighboring nodes along the route. With the proposed routing protocol, quantum information can be transmitted hop by hop from the source node to the destination node. Based on multi-hop teleportation based on the partially entangled GHZ state, a quantum route established with the minimum number of hops. The difference between our routing protocol and the classical one is that in the former, the processes used to find a quantum route and establish quantum channel entanglement occur simultaneously. The Bell state measurement results of each hop are piggybacked to quantum route finding information. This method reduces the total number of packets and the magnitude of air interface delay. The deduction of the establishment of a quantum channel between source and destination is also presented here. The final success probability of quantum multi-hop teleportation in wireless mesh backbone networks was simulated and analyzed. Our research shows that quantum multi-hop teleportation in wireless mesh backbone networks through a partially entangled GHZ state is feasible.

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

Science.gov (United States)

Huibin, Liu; Jun, Zhang

2016-04-01

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

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

Directory of Open Access Journals (Sweden)

Jianfeng Guan

2017-01-01

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

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

Directory of Open Access Journals (Sweden)

Xiaomei Zhang

2017-01-01

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

A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Spoorendonk, Simon; Røpke, Stefan

2013-01-01

This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow...

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

International Nuclear Information System (INIS)

Farooq, Hasan; Jung, Low Tang

2013-01-01

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

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

Science.gov (United States)

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

2014-01-01

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

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

Directory of Open Access Journals (Sweden)

Amira Y. Haikal

2014-01-01

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

Improvement In MAODV Protocol Using Location Based Routing Protocol

Directory of Open Access Journals (Sweden)

Kaur Sharnjeet

2016-01-01

Full Text Available Energy saving is difficult in wireless sensor network (WSN due to limited resources. Each node in WSN is constrained by their limited battery power for their energy. The energy is reduced as the time goes off due to the packet transmission and reception. Energy management techniques are necessary to minimize the total power consumption of all the nodes in the network in order to maximize its life span. Our proposed protocol Location based routing (LBR aimed to find a path which utilizes the minimum energy to transmit the packets between the source and the destination. The required energy for the transmission and reception of data is evaluated in MATLAB. LBR is implemented on Multicast Ad hoc On Demand Distance Vector Routing Protocol (MAODV to manage the energy consumption in the transmission and reception of data. Simulation results of LBR show the energy consumption has been reduced.

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

Science.gov (United States)

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

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

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

Science.gov (United States)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

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

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

Science.gov (United States)

Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370

Synthesis of Riboflavines, Quinoxalinones and Benzodiazepines through Chemoselective Flow Based Hydrogenations

Directory of Open Access Journals (Sweden)

Marcus Baumann

2014-07-01

Full Text Available Robust chemical routes towards valuable bioactive entities such as riboflavines, quinoxalinones and benzodiazepines are described. These make use of modern flow hydrogenation protocols enabling the chemoselective reduction of nitro group containing building blocks in order to rapidly generate the desired amine intermediates in situ. In order to exploit the benefits of continuous processing the individual steps were transformed into a telescoped flow process delivering selected benzodiazepine products on scales of 50 mmol and 120 mmol respectively.

Scheduling and Fluid Routing for Flow-Based Microfluidic Laboratories-on-a-Chip

DEFF Research Database (Denmark)

Minhass, Wajid Hassan; McDaniel, Jeffrey; Raagaard, Michael Lander

2017-01-01

Microfluidic laboratories-on-chip (LoCs) are replacing the conventional biochemical analyzers and are able to integrate the necessary functions for biochemical analysis onchip. There are several types of LoCs, each having its advantages and limitations. In this paper we are interested in flow-bas...

Novel Opportunistic Network Routing Based on Social Rank for Device-to-Device Communication

Directory of Open Access Journals (Sweden)

Tong Wang

2017-01-01

Full Text Available In recent years, there has been dramatic proliferation of research concerned with fifth-generation (5G mobile communication networks, among which device-to-device (D2D communication is one of the key technologies. Due to the intermittent connection of nodes, the D2D network topology may be disconnected frequently, which will lead to failure in transmission of large data files. In opportunistic networks, in case of encountering nodes which never meet before a flood message blindly to cause tremendous network overhead, a novel opportunistic network routing protocol based on social rank and intermeeting time (SRIT is proposed in this paper. An improved utility approach applied in utility replication based on encounter durations and intermeeting time is put forward to enhance the routing efficiency. Meanwhile, in order to select better candidate nodes in the network, a social graph among people is established when they socially relate to each other in social rank replication. The results under the scenario show an advantage of the proposed opportunistic network routing based on social rank and intermeeting time (SRIT over the compared algorithms in terms of delivery ratio, average delivery latency, and overhead ratio.

Risk Analysis of Reservoir Flood Routing Calculation Based on Inflow Forecast Uncertainty

Directory of Open Access Journals (Sweden)

Binquan Li

2016-10-01

Full Text Available Possible risks in reservoir flood control and regulation cannot be objectively assessed by deterministic flood forecasts, resulting in the probability of reservoir failure. We demonstrated a risk analysis of reservoir flood routing calculation accounting for inflow forecast uncertainty in a sub-basin of Huaihe River, China. The Xinanjiang model was used to provide deterministic flood forecasts, and was combined with the Hydrologic Uncertainty Processor (HUP to quantify reservoir inflow uncertainty in the probability density function (PDF form. Furthermore, the PDFs of reservoir water level (RWL and the risk rate of RWL exceeding a defined safety control level could be obtained. Results suggested that the median forecast (50th percentiles of HUP showed better agreement with observed inflows than the Xinanjiang model did in terms of the performance measures of flood process, peak, and volume. In addition, most observations (77.2% were bracketed by the uncertainty band of 90% confidence interval, with some small exceptions of high flows. Results proved that this framework of risk analysis could provide not only the deterministic forecasts of inflow and RWL, but also the fundamental uncertainty information (e.g., 90% confidence band for the reservoir flood routing calculation.

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

Directory of Open Access Journals (Sweden)

Dianjie Lu

2014-05-01

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

AVQS: Attack Route-Based Vulnerability Quantification Scheme for Smart Grid

Directory of Open Access Journals (Sweden)

Jongbin Ko

2014-01-01

Full Text Available A smart grid is a large, consolidated electrical grid system that includes heterogeneous networks and systems. Based on the data, a smart grid system has a potential security threat in its network connectivity. To solve this problem, we develop and apply a novel scheme to measure the vulnerability in a smart grid domain. Vulnerability quantification can be the first step in security analysis because it can help prioritize the security problems. However, existing vulnerability quantification schemes are not suitable for smart grid because they do not consider network vulnerabilities. We propose a novel attack route-based vulnerability quantification scheme using a network vulnerability score and an end-to-end security score, depending on the specific smart grid network environment to calculate the vulnerability score for a particular attack route. To evaluate the proposed approach, we derive several attack scenarios from the advanced metering infrastructure domain. The experimental results of the proposed approach and the existing common vulnerability scoring system clearly show that we need to consider network connectivity for more optimized vulnerability quantification.

AVQS: attack route-based vulnerability quantification scheme for smart grid.

Science.gov (United States)

Ko, Jongbin; Lim, Hyunwoo; Lee, Seokjun; Shon, Taeshik

2014-01-01

A smart grid is a large, consolidated electrical grid system that includes heterogeneous networks and systems. Based on the data, a smart grid system has a potential security threat in its network connectivity. To solve this problem, we develop and apply a novel scheme to measure the vulnerability in a smart grid domain. Vulnerability quantification can be the first step in security analysis because it can help prioritize the security problems. However, existing vulnerability quantification schemes are not suitable for smart grid because they do not consider network vulnerabilities. We propose a novel attack route-based vulnerability quantification scheme using a network vulnerability score and an end-to-end security score, depending on the specific smart grid network environment to calculate the vulnerability score for a particular attack route. To evaluate the proposed approach, we derive several attack scenarios from the advanced metering infrastructure domain. The experimental results of the proposed approach and the existing common vulnerability scoring system clearly show that we need to consider network connectivity for more optimized vulnerability quantification.

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks.

Science.gov (United States)

Aadil, Farhan; Raza, Ali; Khan, Muhammad Fahad; Maqsood, Muazzam; Mehmood, Irfan; Rho, Seungmin

2018-05-03

Flying ad-hoc networks (FANETs) are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs) represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR) and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks

Directory of Open Access Journals (Sweden)

Farhan Aadil

2018-05-01

Full Text Available Flying ad-hoc networks (FANETs are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

Bellman Ford algorithm - in Routing Information Protocol (RIP)

Science.gov (United States)

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

2018-04-01

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

Harmonic analysis of the stability of reverse routing in channels

Directory of Open Access Journals (Sweden)

2007-01-01

Full Text Available Normal downstream routing of a flood flow is a highly stable process for Froude numbers less than 1 and hence the results are reliable. In contrast, reverse routing in an upstream direction, which may be required for flow control, is potentially unstable. This paper reports the results of a study of the practical limits on channel lengths for reverse routing. Harmonic analysis is applied to the full non-linear solution of the St. Venant equations for three different wave patterns and two different wave periods, for a particular channel with a Froude number of 0.5. Reverse routing can be done for prismatic channels longer than 100 km. For long periods (>10 hours the shape of the upstream hydrograph is recovered well. However, when the wave period is short (<1 hour, the high frequency components of the upstream hydrograph and, thus, its shape, are not recovered. These limits are influenced by the channel morphology and shape of the wave. Further work is needed to determine how these factors interact.

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

Science.gov (United States)

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

2018-01-26

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

A Proposal for IoT Dynamic Routes Selection Based on Contextual Information

Directory of Open Access Journals (Sweden)

Harilton da Silva Araújo

2018-01-01

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

Solving Minimum Cost Multi-Commodity Network Flow Problem ...

African Journals Online (AJOL)

ADOWIE PERE

2018-03-23

Mar 23, 2018 ... network-based modeling framework for integrated fixed and mobile ... Minimum Cost Network Flow Problem (MCNFP) and some ..... Unmanned Aerial Vehicle Routing in Traffic. Incident ... Ph.D. Thesis, Dept. of Surveying &.

Identification of Robust Terminal-Area Routes in Convective Weather

Science.gov (United States)

Pfeil, Diana Michalek; Balakrishnan, Hamsa

2012-01-01

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

Understanding individual routing behaviour.

Science.gov (United States)

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

2016-03-01

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

A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

Directory of Open Access Journals (Sweden)

Xuhao Zhang

2014-01-01

Full Text Available A framing link (FL based tabu search algorithm is proposed in this paper for a large-scale multidepot vehicle routing problem (LSMDVRP. Framing links are generated during continuous great optimization of current solutions and then taken as skeletons so as to improve optimal seeking ability, speed up the process of optimization, and obtain better results. Based on the comparison between pre- and postmutation routes in the current solution, different parts are extracted. In the current optimization period, links involved in the optimal solution are regarded as candidates to the FL base. Multiple optimization periods exist in the whole algorithm, and there are several potential FLs in each period. If the update condition is satisfied, the FL base is updated, new FLs are added into the current route, and the next period starts. Through adjusting the borderline of multidepot sharing area with dynamic parameters, the authors define candidate selection principles for three kinds of customer connections, respectively. Link split and the roulette approach are employed to choose FLs. 18 LSMDVRP instances in three groups are studied and new optimal solution values for nine of them are obtained, with higher computation speed and reliability.

Elementary students' evacuation route choice in a classroom: A questionnaire-based method

Science.gov (United States)

Chen, Liang; Tang, Tie-Qiao; Huang, Hai-Jun; Song, Ziqi

2018-02-01

Children evacuation is a critical but challenging issue. Unfortunately, existing researches fail to effectively describe children evacuation, which is likely due to the lack of experimental and empirical data. In this paper, a questionnaire-based experiment was conducted with children aged 8-12 years to study children route choice behavior during evacuation from in a classroom with two exits. 173 effective questionnaires were collected and the corresponding data were analyzed. From the statistical results, we obtained the following findings: (1) position, congestion, group behavior, and backtracking behavior have significant effects on children route choice during evacuation; (2) age only affects children backtracking behavior, and (3) no prominent effects based on gender and guidance were observed. The above findings may help engineers design some effective evacuation strategies for children.

An Ultra-Low-Latency Geo-Routing Scheme for Team-Based Unmanned Vehicular Applications

KAUST Repository

Bader, Ahmed

2016-02-26

Results and lessons learned from the implementation of a novel ultra low-latency geo-routing scheme are presented in this paper. The geo-routing scheme is intended for team-based mobile systems whereby a cluster of unmanned autonomous vehicles are deployed to accomplish a critical mission under human supervision. The contention-free nature of the developed scheme lends itself to jointly achieve lower latency and higher throughput. Implementation challenges are presented and corresponding resolutions are discussed herewith. © 2015 IEEE.

Novel flow cytometric analysis of the progress and route of internalization of a monoclonal anti-carcinoembryonic antigen (CEA) antibody.

Science.gov (United States)

Ford, C H; Tsaltas, G C; Osborne, P A; Addetia, K

1996-03-01

A flow cytometric method of studying the internalization of a monoclonal antibody (Mab) directed against carcinoembryonic antigen (CEA) has been compared with Western blotting, using three human colonic cancer cell lines which express varying amounts of the target antigen. Cell samples incubated for increasing time intervals with fluoresceinated or unlabelled Mab were analyzed using flow cytometry or polyacrylamide gel electrophoresis and Western blotting. SDS/PAGE analysis of cytosolic and membrane components of solubilized cells from the cell lines provided evidence of non-degraded internalized anti-CEA Mab throughout seven half hour intervals, starting at 5 min. Internalized anti-CEA was detected in the case of high CEA expressing cell lines (LS174T, SKCO1). Very similar results were obtained with an anti-fluorescein flow cytometric assay. Given that these two methods consistently provided comparable results, use of flow cytometry for the detection of internalized antibody is suggested as a rapid alternative to most currently used methods for assessing antibody internalization. The question of the endocytic route followed by CEA-anti-CEA complexes was addressed by using hypertonic medium to block clathrin mediated endocytosis.

Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

OpenAIRE

Gelareha, Shahin; Monemic, Rahimeh Neamatian; Semetd, Frederic

2017-01-01

In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoke- to-hub allocations. We propose a mathematical model and a branch-and-cut algor...

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

Directory of Open Access Journals (Sweden)

Ayman Tajeddine

2015-02-01

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

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

Science.gov (United States)

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

2015-02-02

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

Aircraft Route Recovery Based on An Improved GRASP Method

Directory of Open Access Journals (Sweden)

Yang He

2017-01-01

Full Text Available Aircrafts maintenance, temporary airport closures are common factors that disrupt normal flight schedule. The aircraft route recovery aims to recover original schedules by some strategies, including flights swaps, and cancellations, which is a NP-hard problem. This paper proposes an improved heuristic procedure based on Greedy Random Adaptive Search Procedure (GRASP to solve this problem. The effectiveness and high global optimization capability of the heuristic is illustrated through experiments based on large-scale problems. Compared to the original one, it is shown that the improved procedure can find feasible flight recovered schedules with lower cost in a short time.

Risk Route Choice Analysis and the Equilibrium Model under Anticipated Regret Theory

Directory of Open Access Journals (Sweden)

pengcheng yuan

2014-02-01

Full Text Available The assumption about travellers’ route choice behaviour has major influence on the traffic flow equilibrium analysis. Previous studies about the travellers’ route choice were mainly based on the expected utility maximization theory. However, with the gradually increasing knowledge about the uncertainty of the transportation system, the researchers have realized that there is much constraint in expected util­ity maximization theory, because expected utility maximiza­tion requires travellers to be ‘absolutely rational’; but in fact, travellers are not truly ‘absolutely rational’. The anticipated regret theory proposes an alternative framework to the tra­ditional risk-taking in route choice behaviour which might be more scientific and reasonable. We have applied the antici­pated regret theory to the analysis of the risk route choosing process, and constructed an anticipated regret utility func­tion. By a simple case which includes two parallel routes, the route choosing results influenced by the risk aversion degree, regret degree and the environment risk degree have been analyzed. Moreover, the user equilibrium model based on the anticipated regret theory has been established. The equivalence and the uniqueness of the model are proved; an efficacious algorithm is also proposed to solve the model. Both the model and the algorithm are demonstrated in a real network. By an experiment, the model results and the real data have been compared. It was found that the model re­sults can be similar to the real data if a proper regret degree parameter is selected. This illustrates that the model can better explain the risk route choosing behaviour. Moreover, it was also found that the traveller’ regret degree increases when the environment becomes more and more risky.

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

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

Interface Assignment-Based AODV Routing Protocol to Improve Reliability in Multi-Interface Multichannel Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Won-Suk Kim

2015-01-01

Full Text Available The utilization of wireless mesh networks (WMNs has greatly increased, and the multi-interface multichannel (MIMC technic has been widely used for the backbone network. Unfortunately, the ad hoc on-demand distance vector (AODV routing protocol defined in the IEEE 802.11s standard was designed for WMNs using the single-interface single-channel technic. So, we define a problem that happens when the legacy AODV is used in MIMC WMNs and propose an interface assignment-based AODV (IA-AODV in order to resolve that problem. IA-AODV, which is based on multitarget path request, consists of the PREQ prediction scheme, the PREQ loss recovery scheme, and the PREQ sender assignment scheme. A detailed operation according to various network conditions and services is introduced, and the routing efficiency and network reliability of a network using IA-AODV are analyzed over the presented system model. Finally, after a real-world test-bed for MIMC WMNs using the IA-AODV routing protocol is implemented, the various indicators of the network are evaluated through experiments. When the proposed routing protocol is compared with the existing AODV routing protocol, it performs the path update using only 14.33% of the management frames, completely removes the routing malfunction, and reduces the UDP packet loss ratio by 0.0012%.

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.

Multiple depots vehicle routing based on the ant colony with the genetic algorithm

Directory of Open Access Journals (Sweden)

ChunYing Liu

2013-09-01

Full Text Available Purpose: the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So, it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, in order to improve the efficiency of the multiple depots vehicle routing, the paper puts forward a fusion algorithm on multiple depots vehicle routing based on the ant colony algorithm with genetic algorithm. Design/methodology/approach: to achieve this objective, the genetic algorithm optimizes the parameters of the ant colony algorithm. The fusion algorithm on multiple depots vehicle based on the ant colony algorithm with genetic algorithm is proposed. Findings: simulation experiment indicates that the result of the fusion algorithm is more excellent than the other algorithm, and the improved algorithm has better convergence effective and global ability. Research limitations/implications: in this research, there are some assumption that might affect the accuracy of the model such as the pheromone volatile factor, heuristic factor in each period, and the selected multiple depots. These assumptions can be relaxed in future work. Originality/value: In this research, a new method for the multiple depots vehicle routing is proposed. The fusion algorithm eliminate the influence of the selected parameter by optimizing the heuristic factor, evaporation factor, initial pheromone distribute, and have the strong global searching ability. The Ant Colony algorithm imports cross operator and mutation operator for operating the first best solution and the second best solution in every iteration, and reserves the best solution. The cross and mutation operator extend the solution space and improve the convergence effective and the global ability. This research shows that considering both the ant colony and genetic algorithm

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

Directory of Open Access Journals (Sweden)

Ki-Hyung Kim

2013-05-01

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

A Sociability-Based Routing Scheme for Delay-Tolerant Networks

Directory of Open Access Journals (Sweden)

Fabbri Flavio

2011-01-01

Full Text Available The problem of choosing the best forwarders in Delay-Tolerant Networks (DTNs is crucial for minimizing the delay in packet delivery and for keeping the amount of generated traffic under control. In this paper, we introduce sociable routing, a novel routing strategy that selects a subset of optimal forwarders among all the nodes and relies on them for an efficient delivery. The key idea is that of assigning to each network node a time-varying scalar parameter which captures its social behavior in terms of frequency and types of encounters. This sociability concept is widely discussed and mathematically formalized. Simulation results of a DTN of vehicles in urban environment, driven by real mobility traces, and employing sociable routing, is presented. Encouraging results show that sociable routing, compared to other known protocols, achieves a good compromise in terms of delay performance and amount of generated traffic.

Route optimisation and solving Zermelo’s navigation problem during long distance migration in cross flows

DEFF Research Database (Denmark)

Hays, Graeme C.; Christensen, Asbjørn; Fossette, Sabrina

2014-01-01

The optimum path to follow when subjected to cross flows was first considered over 80 years ago by the German mathematician Ernst Zermelo, in the context of a boat being displaced by ocean currents, and has become known as the ‘Zermelo navigation problem’. However, the ability of migrating animals...... to solve this problem has received limited consideration, even though wind and ocean currents cause the lateral displacement of flyers and swimmers, respectively, particularly during long-distance journeys of 1000s of kilometres. Here, we examine this problem by combining long-distance, open-ocean marine...... not follow the optimum (Zermelo's) route. Even though adult marine turtles regularly complete incredible long-distance migrations, these vertebrates primarily rely on course corrections when entering neritic waters during the final stages of migration. Our work introduces a new perspective in the analysis...

A Generalized Minimum Cost Flow Model for Multiple Emergency Flow Routing

Directory of Open Access Journals (Sweden)

Jianxun Cui

2014-01-01

Full Text Available During real-life disasters, that is, earthquakes, floods, terrorist attacks, and other unexpected events, emergency evacuation and rescue are two primary operations that can save the lives and property of the affected population. It is unavoidable that evacuation flow and rescue flow will conflict with each other on the same spatial road network and within the same time window. Therefore, we propose a novel generalized minimum cost flow model to optimize the distribution pattern of these two types of flow on the same network by introducing the conflict cost. The travel time on each link is assumed to be subject to a bureau of public road (BPR function rather than a fixed cost. Additionally, we integrate contraflow operations into this model to redesign the network shared by those two types of flow. A nonconvex mixed-integer nonlinear programming model with bilinear, fractional, and power components is constructed, and GAMS/BARON is used to solve this programming model. A case study is conducted in the downtown area of Harbin city in China to verify the efficiency of proposed model, and several helpful findings and managerial insights are also presented.

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

Directory of Open Access Journals (Sweden)

Shereen Omar

2017-01-01

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

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

Science.gov (United States)

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

2017-05-01

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

A network-flow based valve-switching aware binding algorithm for flow-based microfluidic biochips

DEFF Research Database (Denmark)

Tseng, Kai-Han; You, Sheng-Chi; Minhass, Wajid Hassan

2013-01-01

-flow based resource binding algorithm based on breadth-first search (BFS) and minimum cost maximum flow (MCMF) in architectural-level synthesis. The experimental results show that our methodology not only makes significant reduction of valve-switching activities but also diminishes the application completion......Designs of flow-based microfluidic biochips are receiving much attention recently because they replace conventional biological automation paradigm and are able to integrate different biochemical analysis functions on a chip. However, as the design complexity increases, a flow-based microfluidic...... biochip needs more chip-integrated micro-valves, i.e., the basic unit of fluid-handling functionality, to manipulate the fluid flow for biochemical applications. Moreover, frequent switching of micro-valves results in decreased reliability. To minimize the valve-switching activities, we develop a network...

ANALYSIS OF FREE ROUTE AIRSPACE AND PERFORMANCE BASED NAVIGATION IMPLEMENTATION IN THE EUROPEAN AIR NAVIGATION SYSTEM

Directory of Open Access Journals (Sweden)

Svetlana Pavlova

2014-12-01

Full Text Available European Air Traffic Management system requires continuous improvements as air traffic is increasingday by day. For this purpose it was developed by international organizations Free Route Airspace and PerformanceBased Navigation concepts that allow to offer a required level of safety, capacity, environmental performance alongwith cost-effectiveness. The aim of the article is to provide detailed analysis of Free Route Airspace and PerformanceBased Navigation implementation status within European region including Ukrainian air navigation system.

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.

Optimization Model for Headway of a Suburban Bus Route

Directory of Open Access Journals (Sweden)

Xiaohong Jiang

2014-01-01

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

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

Directory of Open Access Journals (Sweden)

DING Yulin

2016-12-01

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

Alternative chemical-based synthesis routes and characterization of nano-scale particles

International Nuclear Information System (INIS)

Brocchi, E.A.; Motta, M.S.; Solorzano, I.G.; Jena, P.K.; Moura, F.J.

2004-01-01

Different nano-scale particles have been synthesized by alternative routes: nitrates dehydratation and oxide, or co-formed oxides, reduction by hydrogen. Chemical-based synthesis routes are described and thermodynamics studies and kinetics data are presented to support the feasibility for obtaining single-phase oxides and co-formed two-phase oxides. In addition, the reduction reaction has been applied to successfully produce metal/ceramic nanocomposites. Structural characterization has been carried out by means of X-ray diffraction and, more extensively, transmission electron microscopy operating in conventional diffraction contrast mode (CTEM) and high-resolution mode (HRTEM). Nano-scale size distribution of oxide particles is well demonstrated together with their defect-free structure in the lower range, around 20 nm, size. Structural features related to the synthesized nano-composites are also presented

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

Science.gov (United States)

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

2012-01-01

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

Area Based Models of New Highway Route Growth

OpenAIRE

David Levinson; Wei Chen

2007-01-01

Empirical data and statistical models are used to answer the question of where new highway routes are most likely to be located. High-quality land-use, population distribution and highway network GIS data for the Twin CitiesMetropolitan Area from 1958 to 1990 are developed for this study. The highway system is classified into three levels, Interstate highways, divided highways, and secondary highways. Binary logit models estimate the new route growth probability of divided highways and second...

Asymptotic Delay Analysis for Cross-Layer Delay-Based Routing in Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Philippe Jacquet

2007-01-01

Full Text Available This paper addresses the problem of the evaluation of the delay distribution via analytical means in IEEE 802.11 wireless ad hoc networks. We show that the asymptotic delay distribution can be expressed as a power law. Based on the latter result, we present a cross-layer delay estimation protocol and we derive new delay-distribution-based routing algorithms, which are well adapted to the QoS requirements of real-time multimedia applications. In fact, multimedia services are not sensitive to average delays, but rather to the asymptotic delay distributions. Indeed, video streaming applications drop frames when they are received beyond a delay threshold, determined by the buffer size. Although delay-distribution-based routing is an NP-hard problem, we show that it can be solved in polynomial time when the delay threshold is large, because of the asymptotic power law distribution of the link delays.

Roteamento de veículos com base em sistemas de informação geográfica Vehicle routing based on geographical information systems

Directory of Open Access Journals (Sweden)

Roberto Diéguez Galvão

1997-08-01

Full Text Available Um algoritmo para roteamento de veículos é integrado a um Sistema de Informação Geográfica, de cuja base de dados obtém as informações necessárias para o roteamento e no qual mostra as rotas resultantes. O algoritmo de roteamento utilizado tem como base a metaheurística de simulated annealing, que apresenta neste caso resultados computacionais de boa qualidade. Descrevemos a interface do algoritmo com um SIG específico e a aplicação do sistema resultante a um programa de entregas simulado, no bairro de Copacabana, no Rio de Janeiro.An algorithm for vehicle routing is embedded into a Geographical Information System (GIS, from the database of which it extracts the information needed for the routing and where it displays the resulting routes. The routing algorithm is a simulated annealing metaheuristic that produces good quality routes in reduced computational times. We describe the embedding of the algorithm into a specific GIS software and the application of the routing system to a simulated delivery schedule in the neighbourhood of Copacabana, in Rio de Janeiro.

Blockchain-based Public Key Infrastructure for Inter-Domain Secure Routing

OpenAIRE

de la Rocha Gómez-Arevalillo , Alfonso; Papadimitratos , Panos

2017-01-01

International audience; A gamut of secure inter-domain routing protocols has been proposed in the literature. They use traditional PGP-like and centralized Public Key Infrastructures for trust management. In this paper, we propose our alternative approach for managing security associations, Secure Blockchain Trust Management (SBTM), a trust management system that instantiates a blockchain-based PKI for the operation of securerouting protocols. A main motivation for SBTM is to facilitate gradu...

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

Science.gov (United States)

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

2015-01-01

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

A variable neighborhood descent based heuristic to solve the capacitated location-routing problem

Directory of Open Access Journals (Sweden)

M. S. Jabal-Ameli

2011-01-01

Full Text Available Location-routing problem (LRP is established as a new research area in the context of location analysis. The primary concern of LRP is on locating facilities and routing of vehicles among established facilities and existing demand points. In this work, we address the capacitated LRP which arises in many practical applications within logistics and supply chain management. The objective is to minimize the overall system costs which include the fixed costs of opening depots and using vehicles at each depot site, and the variable costs associated with delivery activities. A novel heuristic is proposed which is based on variable neighborhood descent (VND algorithm to solve the resulted problem. The computational study indicates that the proposed VND based heuristic is highly competitive with the existing solution algorithms in terms of solution quality.

Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

OpenAIRE

Schurgot, Mary R.; Comaniciu, Cristina; Jaffrès-Runser, Katia

2011-01-01

This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance tradeoffs from a multi-objective perspective is highlighted.

A purely nonlinear route to transition approaching the edge of chaos in a boundary layer

International Nuclear Information System (INIS)

Cherubini, S; De Palma, P; Robinet, J-Ch; Bottaro, A

2012-01-01

The understanding of transition in shear flows has recently progressed along new paradigms based on the central role of coherent flow structures and their nonlinear interactions. We follow such paradigms to identify, by means of a nonlinear optimization of the energy growth at short time, the initial perturbation which most easily induces transition in a boundary layer. Moreover, a bisection procedure has been used to identify localized flow structures living on the edge of chaos, found to be populated by hairpin vortices and streaks. Such an edge structure appears to act as a relative attractor for the trajectory of the laminar base state perturbed by the initial finite-amplitude disturbances, mediating the route to turbulence of the flow, via the triggering of a regeneration cycle of Λ and hairpin structures at different space and time scales. These findings introduce a new, purely nonlinear scenario of transition in a boundary-layer flow. (paper)

Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem

Science.gov (United States)

Korayem, L.; Khorsid, M.; Kassem, S. S.

2015-05-01

The capacitated vehicle routing problem (CVRP) is a class of the vehicle routing problems (VRPs). In CVRP a set of identical vehicles having fixed capacities are required to fulfill customers' demands for a single commodity. The main objective is to minimize the total cost or distance traveled by the vehicles while satisfying a number of constraints, such as: the capacity constraint of each vehicle, logical flow constraints, etc. One of the methods employed in solving the CVRP is the cluster-first route-second method. It is a technique based on grouping of customers into a number of clusters, where each cluster is served by one vehicle. Once clusters are formed, a route determining the best sequence to visit customers is established within each cluster. The recently bio-inspired grey wolf optimizer (GWO), introduced in 2014, has proven to be efficient in solving unconstrained, as well as, constrained optimization problems. In the current research, our main contributions are: combining GWO with the traditional K-means clustering algorithm to generate the ‘K-GWO’ algorithm, deriving a capacitated version of the K-GWO algorithm by incorporating a capacity constraint into the aforementioned algorithm, and finally, developing 2 new clustering heuristics. The resulting algorithm is used in the clustering phase of the cluster-first route-second method to solve the CVR problem. The algorithm is tested on a number of benchmark problems with encouraging results.

An expeditious synthesis of imatinib and analogues utilising flow chemistry methods.

Science.gov (United States)

Hopkin, Mark D; Baxendale, Ian R; Ley, Steven V

2013-03-21

A flow-based route to imatinib, the API of Gleevec, was developed and the general procedure then used to generate a number of analogues which were screened for biological activity against Abl1. The flow synthesis required minimal manual intervention and was achieved despite the poor solubility of many of the reaction components.

An Adaptive Clustering Approach Based on Minimum Travel Route Planning for Wireless Sensor Networks with a Mobile Sink.

Science.gov (United States)

Tang, Jiqiang; Yang, Wu; Zhu, Lingyun; Wang, Dong; Feng, Xin

2017-04-26

In recent years, Wireless Sensor Networks with a Mobile Sink (WSN-MS) have been an active research topic due to the widespread use of mobile devices. However, how to get the balance between data delivery latency and energy consumption becomes a key issue of WSN-MS. In this paper, we study the clustering approach by jointly considering the Route planning for mobile sink and Clustering Problem (RCP) for static sensor nodes. We solve the RCP problem by using the minimum travel route clustering approach, which applies the minimum travel route of the mobile sink to guide the clustering process. We formulate the RCP problem as an Integer Non-Linear Programming (INLP) problem to shorten the travel route of the mobile sink under three constraints: the communication hops constraint, the travel route constraint and the loop avoidance constraint. We then propose an Imprecise Induction Algorithm (IIA) based on the property that the solution with a small hop count is more feasible than that with a large hop count. The IIA algorithm includes three processes: initializing travel route planning with a Traveling Salesman Problem (TSP) algorithm, transforming the cluster head to a cluster member and transforming the cluster member to a cluster head. Extensive experimental results show that the IIA algorithm could automatically adjust cluster heads according to the maximum hops parameter and plan a shorter travel route for the mobile sink. Compared with the Shortest Path Tree-based Data-Gathering Algorithm (SPT-DGA), the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate.

Risk assessment of alternative proliferation routes

International Nuclear Information System (INIS)

Ahmed, S.; Husseiny, A.A.

1982-01-01

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

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

Directory of Open Access Journals (Sweden)

Junwei Jin

2016-01-01

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

Data-Based Energy Efficient Clustered Routing Protocol for Wireless Sensors Networks – Tabuk Flood Monitoring System Case Study

Directory of Open Access Journals (Sweden)

Ammar Babiker

2017-10-01

Full Text Available Energy efficiency has been considered as the most important issue in wireless sensor networks. As in many applications, wireless sensors are scattered in a wide harsh area, where the battery replacement or charging will be quite difficult and it is the most important challenge. Therefore, the design of energy saving mechanism becomes mandatory in most recent research. In this paper, a new energy efficient clustered routing protocol is proposed: the proposed protocol is based on analyzing the data collected from the sensors in a base-station. Based on this analysis the cluster head will be selected as the one with the most useful data. Then, a variable time slot is specified to each sensor to minimize the transmission of repetitive and un-useful data. The proposed protocol Data-Based Energy Efficient Clustered Routing Protocol for Wireless Sensors Networks (DCRP was compared with the famous energy efficient LEACH protocol and also with one of the recent energy efficient routing protocols named Position Responsive Routing Protocol (PRRP. DCRP has been used in monitoring the floods in Tabuk area –Saudi Arabia. It shows comparatively better results.

Simulation of optimal arctic routes using a numerical sea ice model based on an ice-coupled ocean circulation method

Directory of Open Access Journals (Sweden)

Jong-Ho Nam

2013-06-01

Full Text Available Ever since the Arctic region has opened its mysterious passage to mankind, continuous attempts to take advantage of its fastest route across the region has been made. The Arctic region is still covered by thick ice and thus finding a feasible navigating route is essential for an economical voyage. To find the optimal route, it is necessary to establish an efficient transit model that enables us to simulate every possible route in advance. In this work, an enhanced algorithm to determine the optimal route in the Arctic region is introduced. A transit model based on the simulated sea ice and environmental data numerically modeled in the Arctic is developed. By integrating the simulated data into a transit model, further applications such as route simulation, cost estimation or hindcast can be easily performed. An interactive simulation system that determines the optimal Arctic route using the transit model is developed. The simulation of optimal routes is carried out and the validity of the results is discussed.

Transport Routes Optimization Model Through Application of Fuzzy Logic

Directory of Open Access Journals (Sweden)

Ivan Bortas

2018-03-01

Full Text Available The transport policy of the European Union is based on the mission of restructuring road traffic into other and energy-favourable transport modes which have not been sufficiently represented yet. Therefore, the development of the inland waterway and rail transport, and connectivity in the intermodal transport network are development planning priorities of the European transport strategy. The aim of this research study was to apply the scientific methodology and thus analyse the factors that affect the distribution of the goods flows and by using the fuzzy logic to make an optimization model, according to the criteria of minimizing the costs and negative impact on the environment, for the selection of the optimal transport route. Testing of the model by simulation, was performed on the basis of evaluating the criteria of the influential parameters with unprecise and indefinite input parameters. The testing results show that by the distribution of the goods flow from road transport network to inland waterways or rail transport, can be predicted in advance and determine the transport route with optimal characteristics. The results of the performed research study will be used to improve the process of planning the transport service, with the aim of reducing the transport costs and environmental pollution.

Proactive Routing Mutation Against Stealthy Distributed Denial of Service Attacks – Metrics, Modeling and Analysis

Energy Technology Data Exchange (ETDEWEB)

Duan, Qi; Al-Shaer, Ehab; Chatterjee, Samrat; Halappanavar, Mahantesh; Oehmen, Christopher S.

2018-04-01

The Infrastructure Distributed Denial of Service (IDDoS) attacks continue to be one of the most devastating challenges facing cyber systems. The new generation of IDDoS attacks exploit the inherent weakness of cyber infrastructure including deterministic nature of routes, skew distribution of flows, and Internet ossification to discover the network critical links and launch highly stealthy flooding attacks that are not observable at the victim end. In this paper, first, we propose a new metric to quantitatively measure the potential susceptibility of any arbitrary target server or domain to stealthy IDDoS attacks, and es- timate the impact of such susceptibility on enterprises. Second, we develop a proactive route mutation technique to minimize the susceptibility to these attacks by dynamically changing the flow paths periodically to invalidate the adversary knowledge about the network and avoid targeted critical links. Our proposed approach actively changes these network paths while satisfying security and qualify of service requirements. We present an integrated approach of proactive route mutation that combines both infrastructure-based mutation that is based on reconfiguration of switches and routers, and middle-box approach that uses an overlay of end-point proxies to construct a virtual network path free of critical links to reach a destination. We implemented the proactive path mutation technique on a Software Defined Network using the OpendDaylight controller to demonstrate a feasible deployment of this approach. Our evaluation validates the correctness, effectiveness, and scalability of the proposed approaches.

An aggregate method to calibrate the reference point of cumulative prospect theory-based route choice model for urban transit network

Science.gov (United States)

Zhang, Yufeng; Long, Man; Luo, Sida; Bao, Yu; Shen, Hanxia

2015-12-01

Transit route choice model is the key technology of public transit systems planning and management. Traditional route choice models are mostly based on expected utility theory which has an evident shortcoming that it cannot accurately portray travelers' subjective route choice behavior for their risk preferences are not taken into consideration. Cumulative prospect theory (CPT), a brand new theory, can be used to describe travelers' decision-making process under the condition of uncertainty of transit supply and risk preferences of multi-type travelers. The method to calibrate the reference point, a key parameter to CPT-based transit route choice model, determines the precision of the model to a great extent. In this paper, a new method is put forward to obtain the value of reference point which combines theoretical calculation and field investigation results. Comparing the proposed method with traditional method, it shows that the new method can promote the quality of CPT-based model by improving the accuracy in simulating travelers' route choice behaviors based on transit trip investigation from Nanjing City, China. The proposed method is of great significance to logical transit planning and management, and to some extent makes up the defect that obtaining the reference point is solely based on qualitative analysis.

Competition for order flow and smart order routing systems

OpenAIRE

Foucault, Thierry; Menkveld, Albert

2006-01-01

We study changes in liquidity following the introduction of a new electronic limit order market when, prior to its introduction, trading is centralized in a single limit order market. We also study how automation of routing decisions and trading fees affect the relative liquidity of rival markets. The theoretical analysis yields three main predictions: (i) consolidated depth is larger in the multiple limit order markets environment, (ii) consolidated bid-ask spread is smaller in the multiple ...

An Opportunistic Routing for Data Forwarding Based on Vehicle Mobility Association in Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Leilei Wang

2017-11-01

Full Text Available Vehicular ad hoc networks (VANETs have emerged as a new powerful technology for data transmission between vehicles. Efficient data transmission accompanied with low data delay plays an important role in selecting the ideal data forwarding path in VANETs. This paper proposes a new opportunity routing protocol for data forwarding based on vehicle mobility association (OVMA. With assistance from the vehicle mobility association, data can be forwarded without passing through many extra intermediate nodes. Besides, each vehicle carries the only replica information to record its associated vehicle information, so the routing decision can adapt to the vehicle densities. Simulation results show that the OVMA protocol can extend the network lifetime, improve the performance of data delivery ratio, and reduce the data delay and routing overhead when compared to the other well-known routing protocols.

An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks.

Science.gov (United States)

Hosen, A S M Sanwar; Cho, Gi Hwan

2018-05-11

Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster head's role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranks' information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime.

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

Science.gov (United States)

Hanold, Gregg T.; Hanold, David T.

2010-01-01

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

The production route selection algorithm in virtual manufacturing networks

Science.gov (United States)

Krenczyk, D.; Skolud, B.; Olender, M.

2017-08-01

The increasing requirements and competition in the global market are challenges for the companies profitability in production and supply chain management. This situation became the basis for construction of virtual organizations, which are created in response to temporary needs. The problem of the production flow planning in virtual manufacturing networks is considered. In the paper the algorithm of the production route selection from the set of admissible routes, which meets the technology and resource requirements and in the context of the criterion of minimum cost is proposed.

A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network

Science.gov (United States)

Han, Zhao; Wu, Jie; Zhang, Jie; Liu, Liefeng; Tian, Kaiyun

2014-04-01

Wireless sensor network (WSN) is a system composed of a large number of low-cost micro-sensors. This network is used to collect and send various kinds of messages to a base station (BS). WSN consists of low-cost nodes with limited battery power, and the battery replacement is not easy for WSN with thousands of physically embedded nodes, which means energy efficient routing protocol should be employed to offer a long-life work time. To achieve the aim, we need not only to minimize total energy consumption but also to balance WSN load. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. In this paper, we propose a General Self-Organized Tree-Based Energy-Balance routing protocol (GSTEB) which builds a routing tree using a process where, for each round, BS assigns a root node and broadcasts this selection to all sensor nodes. Subsequently, each node selects its parent by considering only itself and its neighbors' information, thus making GSTEB a dynamic protocol. Simulation results show that GSTEB has a better performance than other protocols in balancing energy consumption, thus prolonging the lifetime of WSN.

Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mann Raminder P

2005-01-01

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

Probabilistic Location-based Routing Protocol for Mobile Wireless Sensor Networks with Intermittent Communication

Directory of Open Access Journals (Sweden)

Sho KUMAGAI

2015-02-01

Full Text Available In a sensor network, sensor data messages reach the nearest stationary sink node connected to the Internet by wireless multihop transmissions. Recently, various mobile sensors are available due to advances of robotics technologies and communication technologies. A location based message-by-message routing protocol, such as Geographic Distance Routing (GEDIR is suitable for such mobile wireless networks; however, it is required for each mobile wireless sensor node to know the current locations of all its neighbor nodes. On the other hand, various intermittent communication methods for a low power consumption requirement have been proposed for wireless sensor networks. Intermittent Receiver-driven Data Transmission (IRDT is one of the most efficient methods; however, it is difficult to combine the location based routing and the intermittent communication. In order to solve this problem, this paper proposes a probabilistic approach IRDT-GEDIR with the help of one of the solutions of the secretaries problem. Here, each time a neighbor sensor node wakes up from its sleep mode, an intermediate sensor node determines whether it forwards its buffered sensor data messages to it or not based on an estimation of achieved pseudo speed of the messages. Simulation experiments show that IRDT-GEDIR achieves higher pseudo speed of sensor data message transmissions and shorter transmission delay than achieves shorter transmission delay than the two naive combinations of IRDT and GEDIR in sensor networks with mobile sensor nodes and a stationary sink node. In addition, the guideline of the estimated numbers of the neighbor nodes of each intermediate sensor node is provided based on the results of the simulation experiments to apply the probabilistic approach IRDT-GEDIR.

A novel power efficient location-based cooperative routing with transmission power-upper-limit for wireless sensor networks.

Science.gov (United States)

Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

2013-05-15

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.

A Novel Power Efficient Location-Based Cooperative Routing with Transmission Power-Upper-Limit for Wireless Sensor Networks

Science.gov (United States)

Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

2013-01-01

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate. PMID:23676625

Bi-objective optimization for multi-modal transportation routing planning problem based on Pareto optimality

Directory of Open Access Journals (Sweden)

Yan Sun

2015-09-01

Full Text Available Purpose: The purpose of study is to solve the multi-modal transportation routing planning problem that aims to select an optimal route to move a consignment of goods from its origin to its destination through the multi-modal transportation network. And the optimization is from two viewpoints including cost and time. Design/methodology/approach: In this study, a bi-objective mixed integer linear programming model is proposed to optimize the multi-modal transportation routing planning problem. Minimizing the total transportation cost and the total transportation time are set as the optimization objectives of the model. In order to balance the benefit between the two objectives, Pareto optimality is utilized to solve the model by gaining its Pareto frontier. The Pareto frontier of the model can provide the multi-modal transportation operator (MTO and customers with better decision support and it is gained by the normalized normal constraint method. Then, an experimental case study is designed to verify the feasibility of the model and Pareto optimality by using the mathematical programming software Lingo. Finally, the sensitivity analysis of the demand and supply in the multi-modal transportation organization is performed based on the designed case. Findings: The calculation results indicate that the proposed model and Pareto optimality have good performance in dealing with the bi-objective optimization. The sensitivity analysis also shows the influence of the variation of the demand and supply on the multi-modal transportation organization clearly. Therefore, this method can be further promoted to the practice. Originality/value: A bi-objective mixed integer linear programming model is proposed to optimize the multi-modal transportation routing planning problem. The Pareto frontier based sensitivity analysis of the demand and supply in the multi-modal transportation organization is performed based on the designed case.

A study of driver's route choice behavior based on evolutionary game theory.

Science.gov (United States)

Jiang, Xiaowei; Ji, Yanjie; Du, Muqing; Deng, Wei

2014-01-01

This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers' route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver's route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver's route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent.

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

Science.gov (United States)

Tseng, Chinyang Henry

2016-05-31

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

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

Directory of Open Access Journals (Sweden)

Liu Liu

2017-11-01

stand for their connectivity; the detailed (second level focuses on transition spaces such as openings and Spaces of Interest (SOI, and geometric networks are generated regarding these spaces. Nodes of a geometric network refers to locations of doors, windows and subspaces (SOIs inside of the larger spaces; and the edges represent detailed paths among these geometric nodes. A combination of the two levels can represent complex buildings in specified spaces, which avoids maintaining a largescale complete network. User preferences on ordered SOIs are considered in routing on the logical network, and preferences on ordered Points of Interest (POI are adopted in routing on geometric networks. In a geometric network, accessible obstacle-avoiding paths can be computed for users with different sizes. To facilitate automatic generation of the two types of network in any building, a new data model named Indoor Navigation Space Model (INSM is proposed to store connectivity, semantics and geometry of indoor spaces for buildings. Abundant semantics of building components are designed in INSM based on navigational functionalities, such as VerticalUnit(VU and HorizontalConnector(HC as vertical and horizontal passages for pedestrians. The INSM supports different subdivision ways of a building in which indoor spaces can be assigned proper semantics. A logical and geometric network can be automatically derived from INSM, and they can be used individually or together for indoor routing. Thus, different routing options are designed. Paths can be provided by using either the logical network when some users are satisfied with a rough description of the path (e.g., the name of spaces, or a geometric path is automatically computed for a user who needs only a detailed path which shows how obstacles can be avoided. The two-level routing approach integrates both logical and geometric networks to obtain paths, when a user provides her/his preferences on SOIs and POIs. For example, routing results

A decision support system for mission-based ship routing considering multiple performance criteria

International Nuclear Information System (INIS)

Dong, You; Frangopol, Dan M.; Sabatino, Samantha

2016-01-01

It is crucial to evaluate the risk associated with marine vessels subjected to inclement weather and sea conditions when developing a decision support system for ship routing. The generalized decision making framework developed in this paper performs a variety of tasks, including, but not limited to quantifying the flexural and fatigue performance of ship structures and employing multi-attribute utility theory to evaluate ship mission performance. A structural reliability approach is utilized to compute the probability of failure considering the uncertainties in structural capacity and load effects; specifically, effects of flexural and fatigue damage are investigated. The expected repair cost, cumulative fatigue damage, total travel time, and carbon dioxide emissions associated with ship routing are considered as consequences within the risk assessment procedure adopted in this paper. Additionally, the decision maker’s risk attitude is integrated into the presented approach by employing utility theory. The presented methodology can assist decision makers in making informed decisions concerning ship routing. In order to illustrate its capabilities the approach is applied to the Joint High-speed Sealift Ship. - Highlights: • Multi-attribute utility theory is proposed for the ship routing decision making. • Spectral-based fatigue damage and repair loss are computed. • Travel time and CO_2 emissions are incorporated within the decision making process. • The attitude of the decision maker has significant effects on the utility value.

Trams and roadworks on the route de Meyrin

CERN Multimedia

2007-01-01

The project to bring trams to CERN’s doorstep will require a lot of roadworks on the route de Meyrin, so traffic diversions and restrictions are to be expected. Traffic will be diverted away from the route de Meyrin as of the beginning of February 2008. Work on the future Cornavin-Meyrin-CERN tram route (TCMC) is progressing nicely. The first section up to Avanchet was inaugurated on 8 December but users will not be able to ride the tram all the way to CERN, via Meyrin Village and Cité de Meyrin, until 2010. Until then, all road users will have to be patient. To make room for the tram and to alleviate traffic flow in the centre of Meyrin Village, a 755-m long underpass will be constructed. Traffic coming from the centre of Geneva will enter the underpass at the Ecole de Golette and emerge at the Carrosserie de la Tour, having passed 15 metres below Meyrin Village centre. This "cut-and-cover" construction will entail traffic diversions via the rout...

A Secure Cluster-Based Multipath Routing Protocol for WMSNs

Directory of Open Access Journals (Sweden)

Jamal N. Al-Karaki

2011-04-01

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

Sigma Routing Metric for RPL Protocol

Directory of Open Access Journals (Sweden)

Paul Sanmartin

2018-04-01

Full Text Available This paper presents the adaptation of a specific metric for the RPL protocol in the objective function MRHOF. Among the functions standardized by IETF, we find OF0, which is based on the minimum hop count, as well as MRHOF, which is based on the Expected Transmission Count (ETX. However, when the network becomes denser or the number of nodes increases, both OF0 and MRHOF introduce long hops, which can generate a bottleneck that restricts the network. The adaptation is proposed to optimize both OFs through a new routing metric. To solve the above problem, the metrics of the minimum number of hops and the ETX are combined by designing a new routing metric called SIGMA-ETX, in which the best route is calculated using the standard deviation of ETX values between each node, as opposed to working with the ETX average along the route. This method ensures a better routing performance in dense sensor networks. The simulations are done through the Cooja simulator, based on the Contiki operating system. The simulations showed that the proposed optimization outperforms at a high margin in both OF0 and MRHOF, in terms of network latency, packet delivery ratio, lifetime, and power consumption.

Uji Performa Software-based Openflow Switch Berbasis Openwrt

OpenAIRE

Kartadie, Rikie; Suryanto, Tommy

2015-01-01

Perkembangan pesat Software-Defined Network telah dirasakan oleh vendor vendor besar. HP, Google dan IBM, mulai merubah pola routing-switching pada network mereka dari pola routingswitching tradisional ke pola infrastruktur routing-switching Software-defined Network. Untuk melakukan eksperimen tentang OpenFlow, para peneliti sering kali harus menggunakan perangkat hardware/dedicated switch OpenFlow yang dikeluarkan oleh beberapa vendor dengan harga yang tinggi. Kenyataannya, software-based sw...

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

Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem

DEFF Research Database (Denmark)

Gamst, Mette; Jensen, Peter Neergaard; Pisinger, David

2010-01-01

The multicommodity flow problem (MCFP) considers the efficient routing of commodities from their origins to their destinations subject to capacity restrictions and edge costs. Baier et al. [G. Baier, E. Köhler, M. Skutella, On the k-splittable flow problem, in: 10th Annual European Symposium...... of commodities has to be satisfied at the lowest possible cost. The problem has applications in transportation problems where a number of commodities must be routed, using a limited number of distinct transportation units for each commodity. Based on a three-index formulation by Truffot et al. [J. Truffot, C...... on Algorithms, 2002, 101–113] introduced the maximum flow multicommodity k-splittable flow problem (MCkFP) where each commodity may use at most k paths between its origin and its destination. This paper studies the -hard minimum cost multicommodity k-splittable flow problem (MCMCkFP) in which a given flow...

A flow-first route-next heuristic for liner shipping network design

DEFF Research Database (Denmark)

Krogsgaard, Alexander; Pisinger, David; Thorsen, Jesper

2018-01-01

Having a well-designed liner shipping network is paramount to ensure competitive freight rates, adequate capacity on trade-lanes, and reasonable transportation times.The most successful algorithms for liner shipping network design make use of a two-phase approach, where they first design the routes...... different operators are used to modify the network. Since each iteration of the local search method involves solving a very complex multi-commodity flow problem to route the containers through the network, the flow problem is solved heuristically by use of a fast Lagrange heuristic. Although the Lagrange...... heuristic for flowing containers is 2–5% from the optimal solution, the solution quality is sufficiently good to guide the variable neighborhood search method in designing the network. Computational results are reported, showing that the developed heuristic is able to find improved solutions for large...

Is Entrepreneurship a Route Out of Deprivation?

DEFF Research Database (Denmark)

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

2014-01-01

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

Modeling Stochastic Route Choice Behaviors with Equivalent Impedance

Directory of Open Access Journals (Sweden)

Jun Li

2015-01-01

Full Text Available A Logit-based route choice model is proposed to address the overlapping and scaling problems in the traditional multinomial Logit model. The nonoverlapping links are defined as a subnetwork, and its equivalent impedance is explicitly calculated in order to simply network analyzing. The overlapping links are repeatedly merged into subnetworks with Logit-based equivalent travel costs. The choice set at each intersection comprises only the virtual equivalent route without overlapping. In order to capture heterogeneity in perception errors of different sizes of networks, different scale parameters are assigned to subnetworks and they are linked to the topological relationships to avoid estimation burden. The proposed model provides an alternative method to model the stochastic route choice behaviors without the overlapping and scaling problems, and it still maintains the simple and closed-form expression from the MNL model. A link-based loading algorithm based on Dial’s algorithm is proposed to obviate route enumeration and it is suitable to be applied on large-scale networks. Finally a comparison between the proposed model and other route choice models is given by numerical examples.

Cross flow microfiltration of oil-water emulsions using clay based ceramic membrane support and TiO2 composite membrane

OpenAIRE

Kanchapogu Suresh; G. Pugazhenthi

2017-01-01

The main objective of this work is to study the effect of cross flow filtration conditions on the separation of oily wastewater using ceramic support and TiO2 membrane. Firstly, the low cost clay based ceramic membrane support was prepared by uniaxial compaction method using combination of pyrophyllite, quartz, feldspar, kaolin, ball clay and calcium carbonate along with PVA as a binder. Subsequently, TiO2 composite membrane was fabricated via hydrothermal route employing TiO2 sol derived fro...

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

2015-01-01

Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead. PMID:26426701

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

2015-01-01

Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

A TOTP-based enhanced route optimization procedure for mobile IPv6 to reduce handover delay and signalling overhead.

Science.gov (United States)

Shah, Peer Azmat; Hasbullah, Halabi B; Lawal, Ibrahim A; Aminu Mu'azu, Abubakar; Tang Jung, Low

2014-01-01

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node's reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node's compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6's Return-Routability-based Route Optimization (RR-RO).

A TOTP-Based Enhanced Route Optimization Procedure for Mobile IPv6 to Reduce Handover Delay and Signalling Overhead

Science.gov (United States)

Shah, Peer Azmat; Hasbullah, Halabi B.; Lawal, Ibrahim A.; Aminu Mu'azu, Abubakar; Tang Jung, Low

2014-01-01

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node's reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node's compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6's Return-Routability-based Route Optimization (RR-RO). PMID:24688398

Acoustic model optimisation for a call routing system

CSIR Research Space (South Africa)

Kleynhans, N

2012-11-01

Full Text Available Secretary system and provides background on some application-specific ASR issues. Section III details the ASR development effort as well as corpus selection and design. Our experiments are described Fig. 1. High level AutoSecretary call flow. in Section IV... and results and a discussion are presented in Section V. Lastly, the conclusion and possible future work appear in Section VI. II. BACKGROUND A. AutoSecretary IVR System Figure 1 shows the high level call flow of the AutoSecretary call routing system...

A Machine Learning Concept for DTN Routing

Science.gov (United States)

Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

2017-01-01

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

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

Directory of Open Access Journals (Sweden)

Joseph Y.J. Chow

2016-10-01

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

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

Science.gov (United States)

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

2018-05-18

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

An adversarial queueing model for online server routing

NARCIS (Netherlands)

Bonifaci, V.

2007-01-01

In an online server routing problem, a vehicle or server moves in a network in order to process incoming requests at the nodes. Online server routing problems have been thoroughly studied using competitive analysis. We propose a new model for online server routing, based on adversarial queueing

A Trust-Based Secure Routing Scheme Using the Traceback Approach for Energy-Harvesting Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jiawei Tang

2018-03-01

Full Text Available The Internet of things (IoT is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs. The main contributions of a TBSR are (a the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of

A Trust-Based Secure Routing Scheme Using the Traceback Approach for Energy-Harvesting Wireless Sensor Networks.

Science.gov (United States)

Tang, Jiawei; Liu, Anfeng; Zhang, Jian; Xiong, Neal N; Zeng, Zhiwen; Wang, Tian

2018-03-01

The Internet of things (IoT) is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR) scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs). The main contributions of a TBSR are (a) the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b) Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of battery

Flood routing in ungauged catchments using Muskingum methods ...

African Journals Online (AJOL)

Flood-routing techniques are utilised to estimate the stages, or rates of flow, in order to predict flood wave propagation along river reaches. Models can be developed for gauged catchments and their parameters related to physical characteristics such as slope, reach width, reach length so that the approach can be applied ...

Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm

OpenAIRE

Gelareh , Shahin; Neamatian Monemi , Rahimeh; Semet , Frédéric

2015-01-01

International audience; In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein eachhub acts as a transshipment node for one directed route. The number of hubs lies between a minimum anda maximum and the hub-level network is a complete subgraph. The transshipment operations take place atthe hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoketo-hub allocations. We propose a mathematical model and a b...

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

Science.gov (United States)

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

2018-01-01

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

On the Capacity of Hybrid Wireless Networks with Opportunistic Routing

Directory of Open Access Journals (Sweden)

Le Tan

2010-01-01

Full Text Available This paper studies the capacity of hybrid wireless networks with opportunistic routing (OR. We first extend the opportunistic routing algorithm to exploit high-speed data transmissions in infrastructure network through base stations. We then develop linear programming models to calculate the end-to-end throughput bounds from multiple source nodes to single as well as multiple destination nodes. The developed models are applied to study several hybrid wireless network examples. Through case studies, we investigate several factors that have significant impacts on the hybrid wireless network capacity under opportunistic routing, such as node transmission range, density and distribution pattern of base stations (BTs, and number of wireless channels on wireless nodes and base stations. Our numerical results demonstrate that opportunistic routing could achieve much higher throughput on both ad hoc and hybrid networks than traditional unicast routing (UR. Moreover, opportunistic routing can efficiently utilize base stations and achieve significantly higher throughput gains in hybrid wireless networks than in pure ad hoc networks especially with multiple-channel base stations.

Direct measurements of the tile drain and groundwater flow route contributions to surface water contamination: From field-scale concentration patterns in groundwater to catchment-scale surface water quality

International Nuclear Information System (INIS)

Rozemeijer, J.C.; Velde, Y. van der; Geer, F.C. van; Bierkens, M.F.P.; Broers, H.P.

2010-01-01

Enhanced knowledge of water and solute pathways in catchments would improve the understanding of dynamics in water quality and would support the selection of appropriate water pollution mitigation options. For this study, we physically separated tile drain effluent and groundwater discharge from an agricultural field before it entered a 43.5-m ditch transect. Through continuous discharge measurements and weekly water quality sampling, we directly quantified the flow route contributions to surface water discharge and solute loading. Our multi-scale experimental approach allowed us to relate these measurements to field-scale NO 3 concentration patterns in shallow groundwater and to continuous NO 3 records at the catchment outlet. Our results show that the tile drains contributed 90-92% of the annual NO 3 and heavy metal loads. Considering their crucial role in water and solute transport, enhanced monitoring and modeling of tile drainage are important for adequate water quality management. - Direct measurements of flow route contributions to surface water contaminant loading reveal the crucial role of tile drainage for catchment-scale water and solute transport.

Traffic Flow Management Wrap-Up

Science.gov (United States)

Grabbe, Shon

2011-01-01

Traffic Flow Management involves the scheduling and routing of air traffic subject to airport and airspace capacity constraints, and the efficient use of available airspace. Significant challenges in this area include: (1) weather integration and forecasting, (2) accounting for user preferences in the Traffic Flow Management decision making process, and (3) understanding and mitigating the environmental impacts of air traffic on the environment. To address these challenges, researchers in the Traffic Flow Management area are developing modeling, simulation and optimization techniques to route and schedule air traffic flights and flows while accommodating user preferences, accounting for system uncertainties and considering the environmental impacts of aviation. This presentation will highlight some of the major challenges facing researchers in this domain, while also showcasing recent innovations designed to address these challenges.

A Study of Driver’s Route Choice Behavior Based on Evolutionary Game Theory

Directory of Open Access Journals (Sweden)

Xiaowei Jiang

2014-01-01

Full Text Available This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers’ route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver’s route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver’s route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent.

Routing in Wireless Multimedia Home Networks

NARCIS (Netherlands)

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

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

Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach

Directory of Open Access Journals (Sweden)

Sungwook Kim

2014-01-01

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

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.

Parameterizing road construction in route-based road weather models: can ground-penetrating radar provide any answers?

International Nuclear Information System (INIS)

Hammond, D S; Chapman, L; Thornes, J E

2011-01-01

A ground-penetrating radar (GPR) survey of a 32 km mixed urban and rural study route is undertaken to assess the usefulness of GPR as a tool for parameterizing road construction in a route-based road weather forecast model. It is shown that GPR can easily identify even the smallest of bridges along the route, which previous thermal mapping surveys have identified as thermal singularities with implications for winter road maintenance. Using individual GPR traces measured at each forecast point along the route, an inflexion point detection algorithm attempts to identify the depth of the uppermost subsurface layers at each forecast point for use in a road weather model instead of existing ordinal road-type classifications. This approach has the potential to allow high resolution modelling of road construction and bridge decks on a scale previously not possible within a road weather model, but initial results reveal that significant future research will be required to unlock the full potential that this technology can bring to the road weather industry. (technical design note)

Gis-Based Route Finding Using ANT Colony Optimization and Urban Traffic Data from Different Sources

Science.gov (United States)

Davoodi, M.; Mesgari, M. S.

2015-12-01

Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD), Automatic Number Plate Recognition (ANPR), Floating Car Data (FCD), VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network) is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding

Directory of Open Access Journals (Sweden)

Srinivas Kanakala

2014-01-01

Full Text Available In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing protocol to further reduce the energy consumption. The proposed energy-efficient coding-aware cluster based routing protocol (ECCRP scheme applies network coding at cluster heads to reduce number of transmissions. We also modify the queue management procedure of COPE protocol to further improve coding opportunities. We also use an energy efficient scheme while selecting the cluster head. It helps to increase the life time of the network. We evaluate the performance of proposed energy efficient cluster based protocol using simulation. Simulation results show that the proposed ECCRP algorithm reduces energy consumption and increases life time of the network.

An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks

Science.gov (United States)

Zhong, Peijun; Ruan, Feng

2018-03-01

With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.

A TOTP-Based Enhanced Route Optimization Procedure for Mobile IPv6 to Reduce Handover Delay and Signalling Overhead

Directory of Open Access Journals (Sweden)

Peer Azmat Shah

2014-01-01

Full Text Available Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP, video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node’s reachability at the home address and at the care-of address (home test and care-of test that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO, for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP along with verification of the mobile node via direct communication and maintaining the status of correspondent node’s compatibility. The TOTP-RO was implemented in network simulator (NS-2 and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6’s Return-Routability-based Route Optimization (RR-RO.

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

Science.gov (United States)

Sheth, Kapil; Wang, Easter Mayan Chan

2016-01-01

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

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

Science.gov (United States)

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-hoon

2017-01-01

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads. PMID:28531159

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks.

Science.gov (United States)

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-Hoon

2017-05-22

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads.

Routing in Wireless Multimedia Home Networks

NARCIS (Netherlands)

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

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

Design and Evaluation of a Proxy-Based Monitoring System for OpenFlow Networks.

Science.gov (United States)

Taniguchi, Yoshiaki; Tsutsumi, Hiroaki; Iguchi, Nobukazu; Watanabe, Kenzi

2016-01-01

Software-Defined Networking (SDN) has attracted attention along with the popularization of cloud environment and server virtualization. In SDN, the control plane and the data plane are decoupled so that the logical topology and routing control can be configured dynamically depending on network conditions. To obtain network conditions precisely, a network monitoring mechanism is necessary. In this paper, we focus on OpenFlow which is a core technology to realize SDN. We propose, design, implement, and evaluate a network monitoring system for OpenFlow networks. Our proposed system acts as a proxy between an OpenFlow controller and OpenFlow switches. Through experimental evaluations, we confirm that our proposed system can capture packets and monitor traffic information depending on administrator's configuration. In addition, we show that our proposed system does not influence significant performance degradation to overall network performance.

Design and Evaluation of a Proxy-Based Monitoring System for OpenFlow Networks

Directory of Open Access Journals (Sweden)

Yoshiaki Taniguchi

2016-01-01

Full Text Available Software-Defined Networking (SDN has attracted attention along with the popularization of cloud environment and server virtualization. In SDN, the control plane and the data plane are decoupled so that the logical topology and routing control can be configured dynamically depending on network conditions. To obtain network conditions precisely, a network monitoring mechanism is necessary. In this paper, we focus on OpenFlow which is a core technology to realize SDN. We propose, design, implement, and evaluate a network monitoring system for OpenFlow networks. Our proposed system acts as a proxy between an OpenFlow controller and OpenFlow switches. Through experimental evaluations, we confirm that our proposed system can capture packets and monitor traffic information depending on administrator’s configuration. In addition, we show that our proposed system does not influence significant performance degradation to overall network performance.

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

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2017-02-01

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

Routing Optimization of Intelligent Vehicle in Automated Warehouse

Directory of Open Access Journals (Sweden)

Yan-cong Zhou

2014-01-01

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

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

Indian Academy of Sciences (India)

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

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

Science.gov (United States)

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

2018-01-01

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

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

Directory of Open Access Journals (Sweden)

Thirumoorthy Palanisamy

Full Text Available Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2014-07-01

OSPF (Open Shortest Path First and EIGRP (Enhanced Interior Gateway Routing Protocol are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost and metric compared with the simulation results. The result can be OSPF and EIGRP redistribution process. Value delay redistribution 1% better than OSPF and EIGRP 2-3% under traffic density dependent. In calculating the trace route redistribution is done 2 calculations, the cost for OSPF area and the area of the EIGRP metric. Making primary and alternate paths based on the packet delivery rate and the cost of the smallest metric, it is proved by calculation and simulation. Keywords: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.

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

Directory of Open Access Journals (Sweden)

Madhumathy Perumal

2015-01-01

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

Analyzing multiday route choice behavior of commuters using GPS data

Directory of Open Access Journals (Sweden)

Wenyun Tang

2016-02-01

Full Text Available In this study, accurate global position system and geographic information system data were employed to reveal multiday routes people used and to study multiday route choice behavior for the same origin–destination trips, from home to work. A new way of thinking about route choice modeling is provided in this study. Travelers are classified into three kinds based on the deviation between actual routes and the shortest travel time paths. Based on the classification, a two-stage route choice process is proposed, in which the first step is to classify the travelers and the second one is to model route choice behavior. After analyzing the characteristics of different types of travelers, an artificial neural network was adopted to classify travelers and model route choice behavior. An empirical study using global position systems data collected in Minneapolis–St Paul metropolitan area was carried out. It finds that most travelers follow the same route during commute trips on successive days. And different types of travelers have a significant difference in route choice property. The modeling results indicate that neural network framework can classify travelers and model route choice well.

Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Su Xia

2014-05-01

Full Text Available With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research, we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping (VHM of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network without or with one internal hole. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. For networks with multiple internal holes, a segmentation and tunnel-based routing strategy is proposed on top of VHM to support global end-to-end routing. As far as we know, this is the first work that realizes truly deterministic routing with constant-bounded storage and computation in general 3D wireless sensor networks.

A time-based admission control mechanism for IEEE 802.11 ad Hoc networks

OpenAIRE

Costa, Luís Henrique M. K.; Cerveira, Carlos Rodrigo

2006-01-01

This paper presents a time-based admission control mechanism (TAC) for IEEE 802.11 ad hoc networks. The proposed mechanism was adapted to the QoS AODV routing protocol, which takes the quality of service requirements of the data flow into account in the route discovery process. TAC-AODV estimates the idle time of the physical medium based on the frames listened. The incoming traffic is admitted according to the offered load as well as the intra-flow interference, calculated based on the numbe...

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

Science.gov (United States)

McNally, B. David; Love, John

2011-01-01

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

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.

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.

CCS-DTN: clustering and network coding-based efficient routing in social DTNs.

Science.gov (United States)

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2014-12-25

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs.

GIS-BASED ROUTE FINDING USING ANT COLONY OPTIMIZATION AND URBAN TRAFFIC DATA FROM DIFFERENT SOURCES

Directory of Open Access Journals (Sweden)

M. Davoodi

2015-12-01

Full Text Available Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD, Automatic Number Plate Recognition (ANPR, Floating Car Data (FCD, VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

HIGHWAY, a transportation routing model: program description and users' manual

International Nuclear Information System (INIS)

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

1982-12-01

A computerized transportation routing model has been developed at the Oak Ridge National Laboratory to be used for predicting likely routes for shipping radioactive materials. The HIGHWAY data base is a computerized road atlas containing descriptions of the entire interstate highway system, the federal highway system, and most of the principal state roads. In addition to its prediction of the most likely commercial route, options incorporated in the HIGHWAY model can allow for maximum use of interstate highways or routes that will bypass urbanized areas containing populations > 100,000. The user may also interactively modify the data base to predict routes that bypass any particular state, city, town, or specific highway segment

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

Indian Academy of Sciences (India)

3Department of Electronic Engineering, City University of Hong Kong, Hong Kong ... Routing strategy; network traffic flow; hysteretic loop; phase transition from ... ered from two aspects: modifying the underlying network structure or developing ... capacity corresponds to α = −1 in the case of identical nodes' delivering ability.

Location-Aided Reliable Routing for Opportunistic Networks

Institute of Scientific and Technical Information of China (English)

Yong Yang; Zhi Ren; Jibi Li

2012-01-01

In our study, we investigate the problem of location-based routing in opportunistic networks. Due to the uncertainty of end-to-end paths between sources and destinations, the classical location-based ad hoc routing protocols cannot adapt to the environment of opportunistic networks, which leads to the decrease of the delivery rate of data. To address it, we propose in this paper a novel location-aided routing protocol which is suitable for opportunistic networks. In our protocol, a node can send location information on demand by using prediction mechanism, and when sending a data packet, the node chooses multiple neighbors which are closer to the destination as next hops. If the candidate neighbors do not exist, the node carries the data till it meets a proper neighbor or the destination. Theoretical analysis and simulation results show that our proposed protocol outperforms DREAM (Distance Routing Effect Protocol Mobility) and one of its improved versions, BFDREAM (Boundary Forwarding DREAM), in terms of the delivery rate and overhead.

Innovative Sol-Gel Routes for the Bottom-up Preparation of Heterogeneous Catalysts.

Science.gov (United States)

Debecker, Damien P

2017-12-11

Heterogeneous catalysts can be prepared by different methods offering various levels of control on the final properties of the solid. In this account, we exemplify bottom-up preparation routes that are based on the sol-gel chemistry and allow to tailor some decisive properties of solid catalysts. First, an emulsion templating strategy is shown to lead to macrocellular self-standing monoliths with a macroscopic 3D structure. The latter can be used as catalyst or catalyst supports in flow chemistry, without requiring any subsequent shaping step. Second, the aerosol-assisted sol-gel process allows for the one-step and continuous production of porous mixed oxides. Tailored textural properties can be obtained together with an excellent control on composition and homogeneity. Third, the application of non-hydrolytic sol-gel routes, in the absence of water, leads to mixed oxides with outstanding textural properties and with peculiar surface chemistry. In all cases, the resulting catalytic performance can be correlated with the specificities of the preparation routes presented. This is exemplified in catalytic reactions in the fields of biomass conversion, petro chemistry, enantioselective organic synthesis, and air pollution mitigation. © 2017 The Chemical Society of Japan & Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Using Sphinx to Improve Onion Routing Circuit Construction

Science.gov (United States)

Kate, Aniket; Goldberg, Ian

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

A novel communication mechanism based on node potential multi-path routing

Science.gov (United States)

Bu, Youjun; Zhang, Chuanhao; Jiang, YiMing; Zhang, Zhen

2016-10-01

With the network scales rapidly and new network applications emerge frequently, bandwidth supply for today's Internet could not catch up with the rapid increasing requirements. Unfortunately, irrational using of network sources makes things worse. Actual network deploys single-next-hop optimization paths for data transmission, but such "best effort" model leads to the imbalance use of network resources and usually leads to local congestion. On the other hand Multi-path routing can use the aggregation bandwidth of multi paths efficiently and improve the robustness of network, security, load balancing and quality of service. As a result, multi-path has attracted much attention in the routing and switching research fields and many important ideas and solutions have been proposed. This paper focuses on implementing the parallel transmission of multi next-hop data, balancing the network traffic and reducing the congestion. It aimed at exploring the key technologies of the multi-path communication network, which could provide a feasible academic support for subsequent applications of multi-path communication networking. It proposed a novel multi-path algorithm based on node potential in the network. And the algorithm can fully use of the network link resource and effectively balance network link resource utilization.

A method for selection of spent nuclear fuel (SNF) transportation route considering socioeconomic cost based on contingent valuation method (CVM)

International Nuclear Information System (INIS)

Kim, Young Sik

2008-02-01

A transportation of SNF may cause an additional radiation exposure to human beings. It means that the radiological risk should be estimated and managed quantitatively for the public who live near the shipments route. Before the SNF transportation is performed, the route selection is concluded based on the radiological risk estimated with RADTRAN code in existing method generally. It means the existing method for route selection is based only on the radiological health risk but there are not only the impacts related to the radiological health risk but also the socioeconomic impacts related to the cost. In this study, a new method and its numerical formula for route selection on transporting SNF is proposed based on cost estimation because there are several costs in transporting SNF. The total cost consists of radiological health cost, transportation cost, and socioeconomic cost. Each cost is defined properly to the characteristics of SNF transportation and many coefficients and variables describing the meaning of each cost are obtained or estimated through many surveys. Especially to get the socioeconomic cost, contingent valuation method (CVM) is used with a questionnaire. The socioeconomic cost estimation is the most important part of the total cost originated from transporting SNF because it is a very dominant cost in the total cost. The route selection regarding SNF transportation can be supported with the proposed method reasonably and unnecessary or exhausting controversies about the shipments could be avoided

GSFLOW - Coupled Ground-Water and Surface-Water Flow Model Based on the Integration of the Precipitation-Runoff Modeling System (PRMS) and the Modular Ground-Water Flow Model (MODFLOW-2005)

Science.gov (United States)

Markstrom, Steven L.; Niswonger, Richard G.; Regan, R. Steven; Prudic, David E.; Barlow, Paul M.

2008-01-01

The need to assess the effects of variability in climate, biota, geology, and human activities on water availability and flow requires the development of models that couple two or more components of the hydrologic cycle. An integrated hydrologic model called GSFLOW (Ground-water and Surface-water FLOW) was developed to simulate coupled ground-water and surface-water resources. The new model is based on the integration of the U.S. Geological Survey Precipitation-Runoff Modeling System (PRMS) and the U.S. Geological Survey Modular Ground-Water Flow Model (MODFLOW). Additional model components were developed, and existing components were modified, to facilitate integration of the models. Methods were developed to route flow among the PRMS Hydrologic Response Units (HRUs) and between the HRUs and the MODFLOW finite-difference cells. This report describes the organization, concepts, design, and mathematical formulation of all GSFLOW model components. An important aspect of the integrated model design is its ability to conserve water mass and to provide comprehensive water budgets for a location of interest. This report includes descriptions of how water budgets are calculated for the integrated model and for individual model components. GSFLOW provides a robust modeling system for simulating flow through the hydrologic cycle, while allowing for future enhancements to incorporate other simulation techniques.

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

Directory of Open Access Journals (Sweden)

Mingchuan Zhang

2015-01-01

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

A simple urea-based route to ternary metal oxynitride nanoparticles

International Nuclear Information System (INIS)

Gomathi, A.; Reshma, S.; Rao, C.N.R.

2009-01-01

Ternary metal oxynitrides are generally prepared by heating the corresponding metal oxides with ammonia for long durations at high temperatures. In order to find a simple route that avoids use of gaseous ammonia, we have employed urea as the nitriding agent. In this method, ternary metal oxynitrides are obtained by heating the corresponding metal carbonates and transition metal oxides with excess urea. By this route, ternary metal oxynitrides of the formulae MTaO 2 N (M=Ca, Sr or Ba), MNbO 2 N (M=Sr or Ba), LaTiO 2 N and SrMoO 3-x N x have been prepared successfully. The oxynitrides so obtained were generally in the form of nanoparticles, and were characterized by various physical techniques. - Graphical abstract: Nanoparticles of ternary metal oxynitrides can be synthesized by means of urea route. Given is the TEM image of the nanoparticles of CaTaO 2 N so obtained and the insets show the SAED pattern and HREM image of the nanoparticles

Algorithm Research of Individualized Travelling Route Recommendation Based on Similarity

Directory of Open Access Journals (Sweden)

Xue Shan

2015-01-01

Full Text Available Although commercial recommendation system has made certain achievement in travelling route development, the recommendation system is facing a series of challenges because of people’s increasing interest in travelling. It is obvious that the core content of the recommendation system is recommendation algorithm. The advantages of recommendation algorithm can bring great effect to the recommendation system. Based on this, this paper applies traditional collaborative filtering algorithm for analysis. Besides, illustrating the deficiencies of the algorithm, such as the rating unicity and rating matrix sparsity, this paper proposes an improved algorithm combing the multi-similarity algorithm based on user and the element similarity algorithm based on user, so as to compensate for the deficiencies that traditional algorithm has within a controllable range. Experimental results have shown that the improved algorithm has obvious advantages in comparison with the traditional one. The improved algorithm has obvious effect on remedying the rating matrix sparsity and rating unicity.

State alternative route designations

International Nuclear Information System (INIS)

1989-07-01

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

Deflection routing scheme for GMPLS-based OBS networks

DEFF Research Database (Denmark)

Eid, Arafat; Mahmood, Waqar; Alomar, Anwar

2010-01-01

Integrating the Generalized Multi-Protocol Label Switching (GMPLS) framework into an Optical Burst Switching (OBS) Control Plane is a promising solution to alleviating most of OBS performance and design issues. However, implementing the already proposed OBS deflection routing schemes is not appli...

Energy Reduction Multipath Routing Protocol for MANET Using Recoil Technique

Directory of Open Access Journals (Sweden)

Rakesh Kumar Sahu

2018-04-01

Full Text Available In Mobile Ad-hoc networks (MANET, power conservation and utilization is an acute problem and has received significant attention from academics and industry in recent years. Nodes in MANET function on battery power, which is a rare and limited energy resource. Hence, its conservation and utilization should be done judiciously for the effective functioning of the network. In this paper, a novel protocol namely Energy Reduction Multipath Routing Protocol for MANET using Recoil Technique (AOMDV-ER is proposed, which conserves the energy along with optimal network lifetime, routing overhead, packet delivery ratio and throughput. It performs better than any other AODV based algorithms, as in AOMDV-ER the nodes transmit packets to their destination smartly by using a varying recoil off time technique based on their geographical location. This concept reduces the number of transmissions, which results in the improvement of network lifetime. In addition, the local level route maintenance reduces the additional routing overhead. Lastly, the prediction based link lifetime of each node is estimated which helps in reducing the packet loss in the network. This protocol has three subparts: an optimal route discovery algorithm amalgamation with the residual energy and distance mechanism; a coordinated recoiled nodes algorithm which eliminates the number of transmissions in order to reduces the data redundancy, traffic redundant, routing overhead, end to end delay and enhance the network lifetime; and a last link reckoning and route maintenance algorithm to improve the packet delivery ratio and link stability in the network. The experimental results show that the AOMDV-ER protocol save at least 16% energy consumption, 12% reduction in routing overhead, significant achievement in network lifetime and packet delivery ratio than Ad hoc on demand multipath distance vector routing protocol (AOMDV, Ad hoc on demand multipath distance vector routing protocol life

Differences in physical environmental characteristics between adolescents' actual and shortest cycling routes: a study using a Google Street View-based audit.

Science.gov (United States)

Verhoeven, Hannah; Van Hecke, Linde; Van Dyck, Delfien; Baert, Tim; Van de Weghe, Nico; Clarys, Peter; Deforche, Benedicte; Van Cauwenberg, Jelle

2018-05-29

The objective evaluation of the physical environmental characteristics (e.g. speed limit, cycling infrastructure) along adolescents' actual cycling routes remains understudied, although it may provide important insights into why adolescents prefer one cycling route over another. The present study aims to gain insight into the physical environmental characteristics determining the route choice of adolescent cyclists by comparing differences in physical environmental characteristics between their actual cycling routes and the shortest possible cycling routes. Adolescents (n = 204; 46.5% boys; 14.4 ± 1.2 years) recruited at secondary schools in and around Ghent (city in Flanders, northern part of Belgium) were instructed to wear a Global Positioning System device in order to identify cycling trips. For all identified cycling trips, the shortest possible route that could have been taken was calculated. Actual cycling routes that were not the shortest possible cycling routes were divided into street segments. Segments were audited with a Google Street View-based tool to assess physical environmental characteristics along actual and shortest cycling routes. Out of 160 actual cycling trips, 73.1% did not differ from the shortest possible cycling route. For actual cycling routes that were not the shortest cycling route, a speed limit of 30 km/h, roads having few buildings with windows on the street side and roads without cycle lane were more frequently present compared to the shortest possible cycling routes. A mixed land use, roads with commercial destinations, arterial roads, cycle lanes separated from traffic by white lines, small cycle lanes and cycle lanes covered by lighting were less frequently present along actual cycling routes compared to the shortest possible cycling routes. Results showed that distance mainly determines the route along which adolescents cycle. In addition, adolescents cycled more along residential streets (even if no cycle lane was

Preparation of SmBiO{sub 3} buffer layer on YSZ substrate by an improved chemical solution deposition route

Energy Technology Data Exchange (ETDEWEB)

Zhu, Xiaolei [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); Pu, Minghua, E-mail: mhpu@home.swjtu.edu.cn [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); Zhao, Yong [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); School of Materials Science and Engineering, University of New South Wale, Sydney, NSW 2052 (Australia)

2016-12-15

Highlights: • The proper conditions for SBO growth are 794 °C for 60 min in flowing Ar gas, the temperature of epitaxial growth is relatively low. • The total time by SSD technique for organic solvent removing, salts decomposition and layer growth is not up to 2 h, which are much less than that needed for traditional CSD of over 10 h. • SBO layer on YSZ prepared by SSD technique are suitable for the growth of YBCO, The results may be the usable reference for continuous preparation of SBO buffer layer on IBAD-YSZ/Ni-based alloy tapes. - Abstract: A quick route for chemical solution deposition (CSD) has been developed to prepare SmBiO{sub 3} (SBO) layers on yttria stabilized zirconia (YSZ) substrates rapidly by using of solid state decomposition (SSD) technique. The proper conditions for volatilization of lactic acid, which as solvent in precursor coated layer, and SBO growth are 115°C for 30 min and 794°C for 60 min in flowing Ar gas. The coated layers are amorphous structure of mixture oxides and quasi-crystal structure of SBO before and after growth, respectively. The total time by this quick CSD route for organic solvent volatilization, salts decomposed and layer growth is not up to 2 h, which are much less than that needed for traditional CSD of over 10 h. SBO layer is directly epitaxial growth on YSZ substrate without any lattice rotation. SBO layer prepared by this quick route as well as that by traditional route are suitable for the growth of YBCO. The superconducting transition temperature and critical current density of the coated YBCO layer on SBO/YSZ obtained by this quick route are up to 90 K and 1.66 MA/cm{sup 2}. These results may be the usable reference for continuous preparation of SBO buffer layer on IBAD-YSZ/Ni-based alloy tapes.

Route assessment using comparative risk factors integrated through a GIS

International Nuclear Information System (INIS)

Toth, D.M.; O'Connell, W.J.

1996-01-01

The assessment of potential alternative routes for the shipment of spent nuclear fuel was simplified through the use of comparative risk factors evaluated using detailed route and environmental attributes. The route characteristics, integrated into risk measures, vary strongly with location and were developed from national, state, and local sources. The route data and evaluation were managed using a geographic information system (GIS). An assessment of four real North Florida routes was performed and an interstate highway route exhibited the lowest risk based on the application of the risk factors

A Systems Approach to the Aeromedical Aircraft Routing Problem Using a Computer-Based Model.

Science.gov (United States)

1988-01-01

0: PIPP 4UaU1AOW :iuaTjPd TenVor bUTSr ’SN)OIm aISAS IU;-n aq MOq. Ul2aT 0 ’qje’_?iddp sw~isAs P 9sfl uat ay -SST.2P UT~eldsupi; TPOT -pdo~ la IC paaU...facilities. In each instance, these patterns are aligned with interregional trunk routes. • " Soja (LOWE75] developed a second method Df flow propen...a)0C 0 H)- ,,,, r,4Ca0 0’ON Ca 04 -&)W M X :: a) -41E a) u O r-O w) - *-f o UiW W Ca4-. 4-C,,z0 0 U) la )C40 r La0404 a 0 V)Ja) o a) 4-1 41) 4-1 a) a) a

Assessing the velocity of the groundwater flow in bedrock fractures

International Nuclear Information System (INIS)

Taivassalo, V.; Poteri, A.

1994-10-01

Teollisuuden Voima Oy (TVO) is studying the crystalline bedrock in Finland for the final disposal of the spent nuclear fuel from its two reactors in Olkiluoto. Preliminary site investigations for five areas were carried out during 1987-1992. One part of the investigation programme was three-dimensional groundwater flow modelling. The numerical site-specific flow simulations were based on the concept of an equivalent porous continuum. The results include hydraulic head distributions, average groundwater flow rate routes. In this study, a novel approach was developed to evaluate the velocities of the water particles flowing in the fractured bedrock. (17 refs., 15 figs., 5 tabs.)

Transportation Routing Analysis Geographic Information System (WebTRAGIS) User's Manual

International Nuclear Information System (INIS)

Michelhaugh, R.D.

2000-01-01

In the early 1980s, Oak Ridge National Laboratory (ORNL) developed two transportation routing models: HIGHWAY, which predicts truck transportation routes, and INTERLINE, which predicts rail transportation routes. Both of these models have been used by the U.S. Department of Energy (DOE) community for a variety of routing needs over the years. One of the primary uses of the models has been to determine population-density information, which is used as input for risk assessment with the RADTRAN model, which is available on the TRANSNET computer system. During the recent years, advances in the development of geographic information systems (GISs) have resulted in increased demands from the user community for a GIS version of the ORNL routing models. In April 1994, the DOE Transportation Management Division (EM-261) held a Baseline Requirements Assessment Session with transportation routing experts and users of the HIGHWAY and INTERLINE models. As a result of the session, the development of a new GIS routing model, Transportation Routing Analysis GIS (TRAGIS), was initiated. TRAGIS is a user-friendly, GIS-based transportation and analysis computer model. The older HIGHWAY and INTERLINE models are useful to calculate routes, but they cannot display a graphic of the calculated route. Consequently, many users have experienced difficulty determining the proper node for facilities and have been confused by or have misinterpreted the text-based listing from the older routing models. Some of the primary reasons for the development of TRAGIS are (a) to improve the ease of selecting locations for routing, (b) to graphically display the calculated route, and (c) to provide for additional geographic analysis of the route

Quantum chemistry-assisted synthesis route development

International Nuclear Information System (INIS)

Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

2015-01-01

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

The JGrass-NewAge system for forecasting and managing the hydrological budgets at the basin scale: models of flow generation and propagation/routing

Directory of Open Access Journals (Sweden)

G. Formetta

2011-11-01

Full Text Available This paper presents a discussion of the predictive capacity of the implementation of the semi-distributed hydrological modeling system JGrass-NewAge. This model focuses on the hydrological budgets of medium scale to large scale basins as the product of the processes at the hillslope scale with the interplay of the river network. The part of the modeling system presented here deals with the: (i estimation of the space-time structure of precipitation, (ii estimation of runoff production; (iii aggregation and propagation of flows in channel; (v estimation of evapotranspiration; (vi automatic calibration of the discharge with the method of particle swarming.

The system is based on a hillslope-link geometrical partition of the landscape, combining raster and vectorial treatment of hillslope data with vector based tracking of flow in channels. Measured precipitation are spatially interpolated with the use of kriging. Runoff production at each channel link is estimated through a peculiar application of the Hymod model. Routing in channels uses an integrated flow equation and produces discharges at any link end, for any link in the river network. Evapotranspiration is estimated with an implementation of the Priestley-Taylor equation. The model system assembly is calibrated using the particle swarming algorithm. A two year simulation of hourly discharge of the Little Washita (OK, USA basin is presented and discussed with the support of some classical indices of goodness of fit, and analysis of the residuals. A novelty with respect to traditional hydrological modeling is that each of the elements above, including the preprocessing and the analysis tools, is implemented as a software component, built upon Object Modelling System v3 and jgrasstools prescriptions, that can be cleanly switched in and out at run-time, rather than at compiling time. The possibility of creating different modeling products by the connection of modules with or without the

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

Directory of Open Access Journals (Sweden)

Jing Yang

2010-05-01

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

Urban base flow with low impact development

Science.gov (United States)

Bhaskar, Aditi; Hogan, Dianna M.; Archfield, Stacey A.

2016-01-01

A novel form of urbanization, low impact development (LID), aims to engineer systems that replicate natural hydrologic functioning, in part by infiltrating stormwater close to the impervious surfaces that generate it. We sought to statistically evaluate changes in a base flow regime because of urbanization with LID, specifically changes in base flow magnitude, seasonality, and rate of change. We used a case study watershed in Clarksburg, Maryland, in which streamflow was monitored during whole-watershed urbanization from forest and agricultural to suburban residential development using LID. The 1.11-km2 watershed contains 73 infiltration-focused stormwater facilities, including bioretention facilities, dry wells, and dry swales. We examined annual and monthly flow during and after urbanization (2004–2014) and compared alterations to nearby forested and urban control watersheds. We show that total streamflow and base flow increased in the LID watershed during urbanization as compared with control watersheds. The LID watershed had more gradual storm recessions after urbanization and attenuated seasonality in base flow. These flow regime changes may be because of a reduction in evapotranspiration because of the overall decrease in vegetative cover with urbanization and the increase in point sources of recharge. Precipitation that may once have infiltrated soil, been stored in soil moisture to be eventually transpired in a forested landscape, may now be recharged and become base flow. The transfer of evapotranspiration to base flow is an unintended consequence to the water balance of LID.

Analysis of Pervasive Mobile Ad Hoc Routing Protocols

Science.gov (United States)

Qadri, Nadia N.; Liotta, Antonio

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

Preventing Restricted Space Inference in Online Route Planning Services

Directory of Open Access Journals (Sweden)

Florian Dorfmeister

2016-03-01

Full Text Available Online route planning services compute routes from any given location to a desired destination address. Unlike offline implementations, they do so in a traffic-aware fashion by taking into consideration up-to-date map data and real-time traffic information. In return, users have to provide precise location information about a route’s endpoints to a not necessarily trusted service provider. As suchlike leakage of personal information threatens a user’s privacy and anonymity, this paper presents PrOSPR, a comprehensive approach for using current online route planning services in a privacy-preserving way, and introduces the concept of k-immune route requests to avert inference attacks based on restricted space information. Using a map-based approach for creating cloaked regions for the start and destination addresses, our solution queries the online service for routes between subsets of points from these regions. This, however, might result in the returned path deviating from the optimal route. By means of empirical evaluation on a real road network, we demonstrate the feasibility of our approach regarding quality of service and communication overhead.

Hurricane Evacuation Routes

Data.gov (United States)

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

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2016-02-01

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

Assessment of Novel Routes of Biomethane Utilization in a Life Cycle Perspective

Directory of Open Access Journals (Sweden)

Elham Ahmadi Moghaddam

2016-12-01

Full Text Available Biomethane, as a replacement for natural gas, reduces the use of fossil-based sources and supports the intended change from fossil to bio-based industry. The study assessed different biomethane utilization routes for production of methanol, dimethyl ether (DME, and ammonia, as fuel or platform chemicals, and combined heat and power (CHP. Energy efficiency and environmental impacts of the different pathways was studied in a life cycle perspective covering the technical system from biomass production to the end product. Among the routes studied, CHP had the highest energy balance and least environmental impact. DME and methanol performed competently in energy balance and environmental impacts in comparison with the ammonia route. DME had the highest total energy output, as fuel, heat, and steam, among the different routes studied. Substituting the bio-based routes for fossil-based alternatives would give a considerable reduction in environmental impacts such as global warming potential and acidification potential for all routes studied, especially CHP, DME, and methanol. Eutrophication potential was mainly a result of biomass and biomethane production, with marginal differences between the different routes.

Rigorous Progress on Algorithms Based Routing and Wavelength Assignment in Trans-Egypt Network (TEGYNET) Management

OpenAIRE

Abd El–Naser A. Mohammed; Ahmed Nabih Zaki Rashed; Osama S. Fragallah; Mohamed G. El-Abyad

2013-01-01

In simple wavelength-division multiplexed (WDM) networks, a connection must be established along a route using a common wavelength on all of the links along the route. The introduction of wavelength converters into WDM cross connects increases the hardware cost and complexity. Given a set of connection requests, the routing and wavelength assignment problem involves finding a route (routing) and assigning a wavelength to each request. This paper has presented the WDM technology is being exten...

Trust-Based Route Selection in Dynamic Source Routin

DEFF Research Database (Denmark)

Jensen, Christian D.; Connell, Paul O

2006-01-01

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

PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile Ad-hoc Networks

Directory of Open Access Journals (Sweden)

Mansour Sheikhan

2012-06-01

Full Text Available Mobile ad-hoc network (MANET is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multipath is an NP-complete problem. In this paper, Hopfield neural network (HNN which its parameters are optimized by particle swarm optimization (PSO algorithm is proposed as multipath routing algorithm. Link expiration time (LET between each two nodes is used as the link reliability estimation metric. This approach can find either node-disjoint or link-disjoint paths in singlephase route discovery. Simulation results confirm that PSO-HNN routing algorithm has better performance as compared to backup path set selection algorithm (BPSA in terms of the path set reliability and number of paths in the set.

Documentation of the Surface-Water Routing (SWR1) Process for modeling surface-water flow with the U.S. Geological Survey Modular Ground-Water Model (MODFLOW-2005)

Science.gov (United States)

Hughes, Joseph D.; Langevin, Christian D.; Chartier, Kevin L.; White, Jeremy T.

2012-01-01

A flexible Surface-Water Routing (SWR1) Process that solves the continuity equation for one-dimensional and two-dimensional surface-water flow routing has been developed for the U.S. Geological Survey three-dimensional groundwater model, MODFLOW-2005. Simple level- and tilted-pool reservoir routing and a diffusive-wave approximation of the Saint-Venant equations have been implemented. Both methods can be implemented in the same model and the solution method can be simplified to represent constant-stage elements that are functionally equivalent to the standard MODFLOW River or Drain Package boundary conditions. A generic approach has been used to represent surface-water features (reaches) and allows implementation of a variety of geometric forms. One-dimensional geometric forms include rectangular, trapezoidal, and irregular cross section reaches to simulate one-dimensional surface-water features, such as canals and streams. Two-dimensional geometric forms include reaches defined using specified stage-volume-area-perimeter (SVAP) tables and reaches covering entire finite-difference grid cells to simulate two-dimensional surface-water features, such as wetlands and lakes. Specified SVAP tables can be used to represent reaches that are smaller than the finite-difference grid cell (for example, isolated lakes), or reaches that cannot be represented accurately using the defined top of the model. Specified lateral flows (which can represent point and distributed flows) and stage-dependent rainfall and evaporation can be applied to each reach. The SWR1 Process can be used with the MODFLOW Unsaturated Zone Flow (UZF1) Package to permit dynamic simulation of runoff from the land surface to specified reaches. Surface-water/groundwater interactions in the SWR1 Process are mathematically defined to be a function of the difference between simulated stages and groundwater levels, and the specific form of the reach conductance equation used in each reach. Conductance can be

Unmanned Aerial ad Hoc Networks: Simulation-Based Evaluation of Entity Mobility Models’ Impact on Routing Performance

Directory of Open Access Journals (Sweden)

Jean-Daniel Medjo Me Biomo

2015-06-01

Full Text Available An unmanned aerial ad hoc network (UAANET is a special type of mobile ad hoc network (MANET. For these networks, researchers rely mostly on simulations to evaluate their proposed networking protocols. Hence, it is of great importance that the simulation environment of a UAANET replicates as much as possible the reality of UAVs. One major component of that environment is the movement pattern of the UAVs. This means that the mobility model used in simulations has to be thoroughly understood in terms of its impact on the performance of the network. In this paper, we investigate how mobility models affect the performance of UAANET in simulations in order to come up with conclusions/recommendations that provide a benchmark for future UAANET simulations. To that end, we first propose a few metrics to evaluate the mobility models. Then, we present five random entity mobility models that allow nodes to move almost freely and independently from one another and evaluate four carefully-chosen MANET/UAANET routing protocols: ad hoc on-demand distance vector (AODV, optimized link state routing (OLSR, reactive-geographic hybrid routing (RGR and geographic routing protocol (GRP. In addition, flooding is also evaluated. The results show a wide variation of the protocol performance over different mobility models. These performance differences can be explained by the mobility model characteristics, and we discuss these effects. The results of our analysis show that: (i the enhanced Gauss–Markov (EGM mobility model is best suited for UAANET; (ii OLSR, a table-driven proactive routing protocol, and GRP, a position-based geographic protocol, are the protocols most sensitive to the change of mobility models; (iii RGR, a reactive-geographic hybrid routing protocol, is best suited for UAANET.

A Novel CAN Tree Coordinate Routing in Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao Li

2014-09-01

Full Text Available In this paper, we propose a novel approach to improve coordination routing while minimizing the maintenance overhead during nodes churn. It bases on “CAN Tree Routing for Content- Addressable Network” 1 which is a solution for peer-to-peer routing. We concentrated on coordinate routing in this paper. The key idea of our approach is a recursion process to calculate target zone code and search in CAN tree 1. Because the hops are via long links in CAN, it enhances routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is , which is much better than a uniform greedy routing, while each node maintains two long links in average.

Evaluation of powder metallurgical processing routes for multi-component niobium silicide-based high-temperature alloys

Energy Technology Data Exchange (ETDEWEB)

Seemueller, Hans Christoph Maximilian

2016-03-22

Niobium silicide-based composites are potential candidates to replace nickel-base superalloys for turbine applications. The goal of this work was to evaluate the feasibility and differences in ensuing properties of various powder metallurgical processing techniques that are capable of manufacturing net-shape turbine components. Two routes for powder production, mechanical alloying and gas atomization were combined with compaction via hot isostatic pressing and powder injection molding.

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.

Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

DEFF Research Database (Denmark)

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

2012-01-01

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

A network flow model for load balancing in circuit-switched multicomputers

Science.gov (United States)

Bokhari, Shahid H.

1990-01-01

In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention - the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case, there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks that avoids contention. The problem is made complex by the hardwired routing on currently available machines: the user can control only which nodes communicate but not how the messages are routed. Network flow models of message flow in the mesh and the hypercube were developed to solve this problem. The crucial property of these models is the correspondence between minimum cost flows and correctly routed messages. To solve a given load balancing problem, a minimum cost flow algorithm is applied to the network. This permits one to determine efficiently a maximum contention free matching of sources to sinks which, in turn, tells one how much of the given imbalance can be eliminated without contention.

A model-based eco-routing strategy for electric vehicles in large urban networks

OpenAIRE

De Nunzio , Giovanni; Thibault , Laurent; Sciarretta , Antonio

2016-01-01

International audience; A novel eco-routing navigation strategy and energy consumption modeling approach for electric vehicles are presented in this work. Speed fluctuations and road network infrastructure have a large impact on vehicular energy consumption. Neglecting these effects may lead to large errors in eco-routing navigation, which could trivially select the route with the lowest average speed. We propose an energy consumption model that considers both accelerations and impact of the ...

Offloading IP Flows onto Lambda-Connections

NARCIS (Netherlands)

Fioreze, Tiago; Oude Wolbers, Mattijs; van de Meent, R.; Pras, Aiko

2007-01-01

Optical networks are capable of switching IP traffic via lambda connections. In this way, big IP flows that overload the regular IP routing level may be moved to the optical level, where they get better Quality of Service (QoS). At the same time, the IP routing level is off-loaded and can serve

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...... depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0....

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0.......We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...

A Routing Strategy for Non-Cooperation Wireless Multi-Hop Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Dung T. Tran

2012-01-01

Full Text Available Choosing routes such that the network lifetime is maximized in a wireless network with limited energy resources is a major routing problem in wireless multi-hop ad hoc networks. In this paper, we study the problem where participants are rationally selfish and non-cooperative. By selfish we designate the users who are ready to tamper with their source-routing (senders could choose intermediate nodes in the routing paths or next hop selection strategies in order to increase the total number of packets transmitted, but do not try to harm or drop packets of the other nodes. The problem therefore amounts to a non-cooperative game. In the works [2,6,19,23], the authors show that the game admits Nash equilibria [1]. Along this line, we first show that if the cost function is linear, this game has pure-strategy equilibrium flow even though participants have different demands. However, finding a Nash equilibrium for a normal game is computationally hard [9]. In this work, inspired by mixed-strategy equilibrium, we propose a simple local routing algorithm called MIxed Path Routing protocol (MiPR. Using analysis and simulations, we show that MiPR drives the system to an equilibrium state where selfish participants do not have incentive to deviate. Moreover, MiPR significantly improves the network lifetime as compared to original routing protocols.

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.

A Constraint-Based Model for Fast Post-Disaster Emergency Vehicle Routing

Directory of Open Access Journals (Sweden)

Roberto Amadini

2013-12-01

Full Text Available Disasters like terrorist attacks, earthquakes, hurricanes, and volcano eruptions are usually unpredictable events that affect a high number of people. We propose an approach that could be used as a decision support tool for a post-disaster response that allows the assignment of victims to hospitals and organizes their transportation via emergency vehicles. By exploiting the synergy between Mixed Integer Programming and Constraint Programming techniques, we are able to compute the routing of the vehicles so as to rescue much more victims than both heuristic based and complete approaches in a very reasonable time.

Handheld Fluorescence Microscopy based Flow Analyzer.

Science.gov (United States)

Saxena, Manish; Jayakumar, Nitin; Gorthi, Sai Siva

2016-03-01

Fluorescence microscopy has the intrinsic advantages of favourable contrast characteristics and high degree of specificity. Consequently, it has been a mainstay in modern biological inquiry and clinical diagnostics. Despite its reliable nature, fluorescence based clinical microscopy and diagnostics is a manual, labour intensive and time consuming procedure. The article outlines a cost-effective, high throughput alternative to conventional fluorescence imaging techniques. With system level integration of custom-designed microfluidics and optics, we demonstrate fluorescence microscopy based imaging flow analyzer. Using this system we have imaged more than 2900 FITC labeled fluorescent beads per minute. This demonstrates high-throughput characteristics of our flow analyzer in comparison to conventional fluorescence microscopy. The issue of motion blur at high flow rates limits the achievable throughput in image based flow analyzers. Here we address the issue by computationally deblurring the images and show that this restores the morphological features otherwise affected by motion blur. By further optimizing concentration of the sample solution and flow speeds, along with imaging multiple channels simultaneously, the system is capable of providing throughput of about 480 beads per second.

Research on distributed QOS routing algorithm based on TCP/IP

Science.gov (United States)

Liu, Xiaoyue; Chen, Yongqiang

2011-10-01

At present, network environment follow protocol standard of IPV4 is intended to do the best effort of network to provide network applied service for users, however, not caring about service quality.Thus the packet loss rate is high, it cannot reach an ideal applied results. This article through the establishment of mathematical model, put forward a new distributed multi QOS routing algorithm, given the realization process of this distributed QOS routing algorithm, and simulation was carried out by simulation software. The results show the proposed algorithm can improve the utilization rate of network resources and the service quality of network application.

A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints

Directory of Open Access Journals (Sweden)

Wei Tu

2015-10-01

Full Text Available Vehicle routing optimization (VRO designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard complexity, many VROs involved in real-world applications require too much computing effort. Shortening computing time for VRO is a great challenge for state-of-the-art spatial optimization algorithms. From a spatial-temporal perspective, this paper presents a spatial-temporal Voronoi diagram-based heuristic approach for large-scale vehicle routing problems with time windows (VRPTW. Considering time constraints, a spatial-temporal Voronoi distance is derived from the spatial-temporal Voronoi diagram to find near neighbors in the space-time searching context. A Voronoi distance decay strategy that integrates a time warp operation is proposed to accelerate local search procedures. A spatial-temporal feature-guided search is developed to improve unpromising micro route structures. Experiments on VRPTW benchmarks and real-world instances are conducted to verify performance. The results demonstrate that the proposed approach is competitive with state-of-the-art heuristics and achieves high-quality solutions for large-scale instances of VRPTWs in a short time. This novel approach will contribute to spatial decision support community by developing an effective vehicle routing optimization method for large transportation applications in both public and private sectors.

HIGHWAY, a transportation routing model: program description and revised users' manual

International Nuclear Information System (INIS)

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

1983-10-01

A computerized transportation routing model has been developed at the Oak Ridge National Laboratory to be used for predicting likely routes for shipping radioactive materials. The HIGHWAY data base is a computerized road atlas containing descriptions of the entire Interstate System, the federal highway system, and most of the principal state roads. In addition to its prediction of the most likely commercial route, options incorporated in the HIGHWAY model can allow for maximum use of Interstate highways or routes that will bypass urbanized areas containing populations greater than 100,000 persons. The user may also interactively modify the data base to predict routes that bypass any particular state, city, town, or specific highway segment

Incorporation Between AHP and N-TSP for Plant Surveillance Routing with Multiple Constraints

International Nuclear Information System (INIS)

Djoko Hari Nugroho

2002-01-01

This paper observed plant on-line surveillance routing for maintenance management with multiple constraints using TSP (Traveling Salesman Problem). In the research N-TSP (nomadic TSP) type was used. In this case, on-line surveillance could be implemented on moving robot. Route for preventive maintenance management was observed sequentially per stage using multiple constraints (a) distance between components, and (b) failure probability of components using AHP (Analytical Hierarchy Process). Simulation was observed utilizing DURESS as a complex system. The simulation result showed that the route with single constraint distance between components represents the sequence of 1 - 6 - 2 - 4 - 3 - 5. Routing for DURESS with multiple constraints using incorporation of AHP and TSP showed that the first priority in the route is flow sensor FB2 with the value of comparation of 0.1042. The next priority is sequentially FB1, FA2, FA1, FA, FB, VB, VA, VA1, VA2, VB1, VB2, pump B, pump A, FR1, FR2, reservoir 2, and reservoir 1. Numerical experiment obtained that the incorporation between AHP and N-TSP has successfully constructed the surveillance routing with multiple constraints. (author)

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

NARCIS (Netherlands)

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

2012-01-01

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

DATA-ORIENTED ALGORITHM FOR ROUTE CHOICE SET GENERATION IN A METROPOLITAN AREA WITH MOBILE PHONE GPS DATA

Directory of Open Access Journals (Sweden)

T. Nakamura

2012-07-01

Full Text Available Nowadays, for the estimation of traffic demand or people flow, modelling route choice activity in road networks is an important task and many algorithms have been developed to generate route choice sets. However, developing an algorithm based on a small amount of data that can be applied generally within a metropolitan area is difficult. This is because the characteristics of road networks vary widely. On the other hand, recently, the collection of people movement data has lately become much easier, especially through mobile phones. Lately, most mobile phones include GPS functionality. Given this background, we propose a data-oriented algorithm to generate route choice sets using mobile phone GPS data. GPS data contain a number of measurement errors; hence, they must be adjusted to account for these errors before use in advanced people movement analysis. However, this is time-consuming and expensive, because an enormous amount of daily data can be obtained. Hence, the objective of this study is to develop an algorithm that can easily manage GPS data. Specifically, at first movement data from all GPS data are selected by calculating the speed. Next, the nearest roads in the road network are selected from the GPS location and count such data for each road. Then An algorithm based on the GSP (Gateway Shortest Path algorithm is proposed, which searches the shortest path through a given gateway. In the proposed algorithm, the road for which the utilization volume calculated by GPS data is large is selected as the gateway. Thus, route choice sets that are based on trends in real GPS data are generated. To evaluate the proposed method, GPS data from 0.7 million people a year in Japan and DRM (Digital Road Map as the road network are used. DRM is one of the most detailed road networks in Japan. Route choice sets using the proposed algorithm are generated and the cover rate of the utilization volume of each road under evaluation is calculated. As a

Trajectory Based Traffic Analysis

DEFF Research Database (Denmark)

Krogh, Benjamin Bjerre; Andersen, Ove; Lewis-Kelham, Edwin

2013-01-01

We present the INTRA system for interactive path-based traffic analysis. The analyses are developed in collaboration with traffic researchers and provide novel insights into conditions such as congestion, travel-time, choice of route, and traffic-flow. INTRA supports interactive point-and-click a......We present the INTRA system for interactive path-based traffic analysis. The analyses are developed in collaboration with traffic researchers and provide novel insights into conditions such as congestion, travel-time, choice of route, and traffic-flow. INTRA supports interactive point......-and-click analysis, due to a novel and efficient indexing structure. With the web-site daisy.aau.dk/its/spqdemo/we will demonstrate several analyses, using a very large real-world data set consisting of 1.9 billion GPS records (1.5 million trajectories) recorded from more than 13000 vehicles, and touching most...

Small organic molecule based flow battery

Science.gov (United States)

Huskinson, Brian; Marshak, Michael; Aziz, Michael J.; Gordon, Roy G.; Betley, Theodore A.; Aspuru-Guzik, Alan; Er, Suleyman; Suh, Changwon

2018-05-08

The invention provides an electrochemical cell based on a new chemistry for a flow battery for large scale, e.g., gridscale, electrical energy storage. Electrical energy is stored chemically at an electrochemical electrode by the protonation of small organic molecules called quinones to hydroquinones. The proton is provided by a complementary electrochemical reaction at the other electrode. These reactions are reversed to deliver electrical energy. A flow battery based on this concept can operate as a closed system. The flow battery architecture has scaling advantages over solid electrode batteries for large scale energy storage.

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

Science.gov (United States)

Wang, Yufei; Liu, Feng

2016-04-01

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

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

Directory of Open Access Journals (Sweden)

Lin Zhang

2017-03-01

Full Text Available With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR. This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service.

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

Science.gov (United States)

Zhang, Lin; Yin, Na; Fu, Xiong; Lin, Qiaomin; Wang, Ruchuan

2017-01-01

With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service. PMID:28282894

Acquisition of business intelligence from human experience in route planning

Science.gov (United States)

Bello Orgaz, Gema; Barrero, David F.; R-Moreno, María D.; Camacho, David

2015-04-01

The logistic sector raises a number of highly challenging problems. Probably one of the most important ones is the shipping planning, i.e. plan the routes that the shippers have to follow to deliver the goods. In this article, we present an artificial intelligence-based solution that has been designed to help a logistic company to improve its routes planning process. In order to achieve this goal, the solution uses the knowledge acquired by the company drivers to propose optimised routes. Hence, the proposed solution gathers the experience of the drivers, processes it and optimises the delivery process. The solution uses data mining to extract knowledge from the company information systems and prepares it for analysis with a case-based reasoning (CBR) algorithm. The CBR obtains critical business intelligence knowledge from the drivers experience that is needed by the planner. The design of the routes is done by a genetic algorithm that, given the processed information, optimises the routes following several objectives, such as minimise the distance or time. Experimentation shows that the proposed approach is able to find routes that improve, on average, the routes made by the human experts.

Design and performance evaluation of an OpenFlow-based control plane for software-defined elastic optical networks with direct-detection optical OFDM (DDO-OFDM) transmission.

Science.gov (United States)

Liu, Lei; Peng, Wei-Ren; Casellas, Ramon; Tsuritani, Takehiro; Morita, Itsuro; Martínez, Ricardo; Muñoz, Raül; Yoo, S J B

2014-01-13

Optical Orthogonal Frequency Division Multiplexing (O-OFDM), which transmits high speed optical signals using multiple spectrally overlapped lower-speed subcarriers, is a promising candidate for supporting future elastic optical networks. In contrast to previous works which focus on Coherent Optical OFDM (CO-OFDM), in this paper, we consider the direct-detection optical OFDM (DDO-OFDM) as the transport technique, which leads to simpler hardware and software realizations, potentially offering a low-cost solution for elastic optical networks, especially in metro networks, and short or medium distance core networks. Based on this network scenario, we design and deploy a software-defined networking (SDN) control plane enabled by extending OpenFlow, detailing the network architecture, the routing and spectrum assignment algorithm, OpenFlow protocol extensions and the experimental validation. To the best of our knowledge, it is the first time that an OpenFlow-based control plane is reported and its performance is quantitatively measured in an elastic optical network with DDO-OFDM transmission.

Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sohail Jabbar

2015-01-01

Full Text Available 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 routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

Anticipatory vehicle routing using delegate multi-agent systems

OpenAIRE

Weyns, Danny; Holvoet, Tom; Helleboogh, Alexander

2007-01-01

This paper presents an agent-based approach, called delegate multi-agent systems, for anticipatory vehicle routing to avoid traffic congestion. In this approach, individual vehicles are represented by agents, which themselves issue light-weight agents that explore alternative routes in the environment on behalf of the vehicles. Based on the evaluation of the alternatives, the vehicles then issue light-weight agents for allocating road segments, spreading the vehicles’ intentions and coordi...

A Novel Algorithm for Flow-Rule Placement in SDN Switches

DEFF Research Database (Denmark)

Kentis, Angelos Mimidis; Pilimon, Artur; Soler, José

2018-01-01

power consumption and high silicon footprint. To counter this limitation, some commercial switches offer both, hardware and software flow table implementations, termed hybrid flow table architecture in this paper. The software-based tables are stored in non-TCAM memory modules, which offer higher...... flow rule should be placed in a hardware (expensive) or a software (cheap) table. The placement decisions are based on a number of criteria with the goal to increase the utilization of the software-based table, without introducing performance degradation in the network in terms of significant delay......The forwarding rules, used by the legacy and SDN network devices to perform routing/forwarding decisions, are generally stored in Ternary Content Addressable Memory (TCAM) modules, which offer constant look-up times, but have limited capacity, due to their high capital and operational costs, high...

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin Han; Naik, Sagar; Shihada, Basem

2011-01-01

This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed

2011-08-21

This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Tensile Flow Behavior of Tungsten Heavy Alloys Produced by CIPing and Gelcasting Routes

Science.gov (United States)

Panchal, Ashutosh; Ravi Kiran, U.; Nandy, T. K.; Singh, A. K.

2018-06-01

Present work describes the flow behavior of tungsten heavy alloys with nominal compositions 90W-7Ni-3Fe, 93W-4.9Ni-2.1Fe, and 95W-3.5Ni-1.5Fe (wt pct) produced by CIPing and gelcasting routes. The overall microstructural features of gelcasting are finer than those of CIPing alloys. Both the grain size of W and corresponding contiguity values increase with increase in W content in the present alloys. The volume fraction of matrix phase decreases with increase in W content in both the alloys. The lattice parameter values of the matrix phase also increase with increase in W content. The yield strength ( σ YS) continuously increases with increase in W content in both the alloys. The σ YS values of CIPing alloys are marginally higher than those of gelcasting at constant W. The ultimate tensile strength ( σ UTS) and elongation values are maximum at intermediate W content. Present alloys exhibit two slopes in true stress-true plastic strain curves in low and high strain regimes and follow a characteristic Ludwigson relation. The two slopes are associated with two deformation mechanisms that are occurring during tensile deformation. The overall nature of differential curves of all the alloys is different and these curves contain three distinctive stages of work hardening (I, II, and III). This suggests varying deformation mechanisms during tensile testing due to different volume fractions of constituent phases. The slip is the predominant deformation mechanism of the present alloys during tensile testing.

Function-Oriented Networking and On-Demand Routing System in Network Using Ant Colony Optimization Algorithm

Directory of Open Access Journals (Sweden)

Young-Bo Sim

2017-11-01

Full Text Available In this paper, we proposed and developed Function-Oriented Networking (FON, a platform for network users. It has a different philosophy as opposed to technologies for network managers of Software-Defined Networking technology, OpenFlow. It is a technology that can immediately reflect the demands of the network users in the network, unlike the existing OpenFlow and Network Functions Virtualization (NFV, which do not reflect directly the needs of the network users. It allows the network user to determine the policy of the direct network, so it can be applied more precisely than the policy applied by the network manager. This is expected to increase the satisfaction of the service users when the network users try to provide new services. We developed FON function that performs on-demand routing for Low-Delay Required service. We analyzed the characteristics of the Ant Colony Optimization (ACO algorithm and found that the algorithm is suitable for low-delay required services. It was also the first in the world to implement the routing software using ACO Algorithm in the real Ethernet network. In order to improve the routing performance, several algorithms of the ACO Algorithm have been developed to enable faster path search-routing and path recovery. The relationship between the network performance index and the ACO routing parameters is derived, and the results are compared and analyzed. Through this, it was possible to develop the ACO algorithm.

Vessels Route Planning Problem with Uncertain Data

Directory of Open Access Journals (Sweden)

Tomasz Neumann

2016-09-01

Full Text Available The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.

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

International Nuclear Information System (INIS)

Johnson, P.E.

1995-01-01

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

System-Level Modeling and Synthesis Techniques for Flow-Based Microfluidic Very Large Scale Integration Biochips

DEFF Research Database (Denmark)

Minhass, Wajid Hassan

Microfluidic biochips integrate different biochemical analysis functionalities on-chip and offer several advantages over the conventional biochemical laboratories. In this thesis, we focus on the flow-based biochips. The basic building block of such a chip is a valve which can be fabricated at very...... propose a framework for mapping the biochemical applications onto the mVLSI biochips, binding and scheduling the operations and performing fluid routing. A control synthesis framework for determining the exact valve activation sequence required to execute the application is also proposed. In order...... to reduce the macro-assembly around the chip and enhance chip scalability, we propose an approach for the biochip pin count minimization. We also propose a throughput maximization scheme for the cell culture mVLSI biochips, saving time and reducing costs. We have extensively evaluated the proposed...

Robust against route failure using power proficient reliable routing in MANET

Directory of Open Access Journals (Sweden)

M. Malathi

2018-03-01

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

Route selection for the transport of hazardous materials

Energy Technology Data Exchange (ETDEWEB)

Seiler, F A

1988-12-01

The factors governing the risk-weighted selection of routes for transport of hazardous materials are analyzed. Starting from a formulation for the total risk of these transports that assumes complete information, approximations for the more realistic case of partial and uncertain information are discussed. These approximations involve well-known risk assessment techniques and mathematical methods; among the latter, Monte Carlo calculations hold the most promise. The actual route selection is based on an index of total societal cost, evaluated for a set of potential routes. (author)

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

Science.gov (United States)

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

2018-04-02

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

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

Directory of Open Access Journals (Sweden)

Farwa Ahmed

2018-04-01

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

Topographical memory for newly-learned maps is differentially affected by route-based versus landmark-based learning

DEFF Research Database (Denmark)

Beatty, Erin L.; Muller-Gass, Alexandra; Wojtarowicz, Dorothy

2018-01-01

on their ability to distinguish previously studied 'old' maps from completely unfamiliar 'new' maps under conditions of high and low working memory load in the functional MRI scanner. Viewing old versus new maps was associated with relatively greater activation in a distributed set of regions including bilateral...... inferior temporal gyrus - an important region for recognizing visual objects. Critically, whereas the performance of participants who had followed a route-based strategy dropped to chance level under high working memory load, participants who had followed a landmark-based strategy performed at above chance...... levels under both high and low working memory load - reflected by relatively greater activation in the left inferior parietal lobule (i.e. rostral part of the supramarginal gyrus known as area PFt). Our findings suggest that landmark-based learning may buffer against the effects of working memory load...

Characteristics-based modelling of flow problems

International Nuclear Information System (INIS)

Saarinen, M.

1994-02-01

The method of characteristics is an exact way to proceed to the solution of hyperbolic partial differential equations. The numerical solutions, however, are obtained in the fixed computational grid where interpolations of values between the mesh points cause numerical errors. The Piecewise Linear Interpolation Method, PLIM, the utilization of which is based on the method of characteristics, has been developed to overcome these deficiencies. The thesis concentrates on the computer simulation of the two-phase flow. The main topics studied are: (1) the PLIM method has been applied to study the validity of the numerical scheme through solving various flow problems to achieve knowledge for the further development of the method, (2) the mathematical and physical validity and applicability of the two-phase flow equations based on the SFAV (Separation of the two-phase Flow According to Velocities) approach has been studied, and (3) The SFAV approach has been further developed for particular cases such as stratified horizontal two-phase flow. (63 refs., 4 figs.)

Space shuttle booster multi-engine base flow analysis

Science.gov (United States)

Tang, H. H.; Gardiner, C. R.; Anderson, W. A.; Navickas, J.

1972-01-01

A comprehensive review of currently available techniques pertinent to several prominent aspects of the base thermal problem of the space shuttle booster is given along with a brief review of experimental results. A tractable engineering analysis, capable of predicting the power-on base pressure, base heating, and other base thermal environmental conditions, such as base gas temperature, is presented and used for an analysis of various space shuttle booster configurations. The analysis consists of a rational combination of theoretical treatments of the prominent flow interaction phenomena in the base region. These theories consider jet mixing, plume flow, axisymmetric flow effects, base injection, recirculating flow dynamics, and various modes of heat transfer. Such effects as initial boundary layer expansion at the nozzle lip, reattachment, recompression, choked vent flow, and nonisoenergetic mixing processes are included in the analysis. A unified method was developed and programmed to numerically obtain compatible solutions for the various flow field components in both flight and ground test conditions. Preliminary prediction for a 12-engine space shuttle booster base thermal environment was obtained for a typical trajectory history. Theoretical predictions were also obtained for some clustered-engine experimental conditions. Results indicate good agreement between the data and theoretical predicitons.

Route Selection Problem Based on Hopfield Neural Network

Directory of Open Access Journals (Sweden)

N. Kojic

2013-12-01

Full Text Available Transport network is a key factor of economic, social and every other form of development in the region and the state itself. One of the main conditions for transport network development is the construction of new routes. Often, the construction of regional roads is dominant, since the design and construction in urban areas is quite limited. The process of analysis and planning the new roads is a complex process that depends on many factors (the physical characteristics of the terrain, the economic situation, political decisions, environmental impact, etc. and can take several months. These factors directly or indirectly affect the final solution, and in combination with project limitations and requirements, sometimes can be mutually opposed. In this paper, we present one software solution that aims to find Pareto optimal path for preliminary design of the new roadway. The proposed algorithm is based on many different factors (physical and social with the ability of their increase. This solution is implemented using Hopfield's neural network, as a kind of artificial intelligence, which has shown very good results for solving complex optimization problems.

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.

An Adaptive QoS Routing Solution for MANET Based Multimedia Communications in Emergency Cases

Science.gov (United States)

Ramrekha, Tipu Arvind; Politis, Christos

The Mobile Ad hoc Networks (MANET) is a wireless network deprived of any fixed central authoritative routing entity. It relies entirely on collaborating nodes forwarding packets from source to destination. This paper describes the design, implementation and performance evaluation of CHAMELEON, an adaptive Quality of Service (QoS) routing solution, with improved delay and jitter performances, enabling multimedia communication for MANETs in extreme emergency situations such as forest fire and terrorist attacks as defined in the PEACE project. CHAMELEON is designed to adapt its routing behaviour according to the size of a MANET. The reactive Ad Hoc on-Demand Distance Vector Routing (AODV) and proactive Optimized Link State Routing (OLSR) protocols are deemed appropriate for CHAMELEON through their performance evaluation in terms of delay and jitter for different MANET sizes in a building fire emergency scenario. CHAMELEON is then implemented in NS-2 and evaluated similarly. The paper concludes with a summary of findings so far and intended future work.

Secure Route Structures for Parallel Mobile Agents Based Systems Using Fast Binary Dispatch

Directory of Open Access Journals (Sweden)

Yan Wang

2005-01-01

Full Text Available In a distributed environment, where a large number of computers are connected together to enable the large-scale sharing of data and computing resources, agents, especially mobile agents, are the tools for autonomously completing tasks on behalf of their owners. For applications of large-scale mobile agents, security and efficiency are of great concern. In this paper, we present a fast binary dispatch model and corresponding secure route structures for mobile agents dispatched in parallel to protect the dispatch routes of agents while ensuring the dispatch efficiency. The fast binary dispatch model is simple but efficient with a dispatch complexity of O(log2n. The secure route structures adopt the combination of public-key encryption and digital signature schemes and expose minimal route information to hosts. The nested structure can help detect attacks as early as possible. We evaluated the various models both analytically and empirically.

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

Science.gov (United States)

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

2003-08-01

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

Improved Efficient Routing Strategy on Scale-Free Networks

Science.gov (United States)

Jiang, Zhong-Yuan; Liang, Man-Gui

Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási-Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

Routing of Electric Vehicles: City Distribution in Copenhagen

DEFF Research Database (Denmark)

Linde, Esben; Larsen, Allan; Nørrelund, Anders Vedsted

In this work, a Vehicle Routing Problem with Time Windows considering EV constraints of limited driving range and freight capacity is addressed (EVRPTW). The EVs are allowed to recharge at certain locations, and aspects of intelligent location of these recharging points are considered....... The objective is to find the least cost plan for EV routing and compare this to conventional routing. A heuristic method is developed and tested on data based on real-life collected data on distribution vehicles in central Copenhagen, Denmark. The EVRPTW has so far received little attention in the literature...

Routing protocols for wireless sensor networks: What the literature says?

Directory of Open Access Journals (Sweden)

Amit Sarkar

2016-12-01

Full Text Available Routing in Wireless Sensor Networks (WSNs plays a significant role in the field of environment-oriented monitoring, traffic monitoring, etc. Here, wide contributions that are made toward routing in WSN are explored. The paper mainly aims to categorize the routing problems and examines the routing-related optimization problems. For achieving the motive, 50 papers from the standard journals are collected and primarily reviewed in a chronological way. Later, various features that are related to energy, security, speed and reliability problems of routing are discussed. Subsequently, the literature is analyzed based on the simulation environment and experimental setup, awareness over the Quality of Service (QoS and the deployment against various applications. In addition, the optimization of the routing algorithms and the meta-heuristic study of routing optimization are explored. Routing is a vast area with numerous unsolved issues and hence, various research gaps along with future directions are also presented.

New Hybrid Route to Biomimetic Synthesis

National Research Council Canada - National Science Library

Morse, Daniel

2003-01-01

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

Chemical Routes to Colloidal Chalcogenide Nanosheets

Energy Technology Data Exchange (ETDEWEB)

Schaak, Raymond E. [Pennsylvania State Univ., University Park, PA (United States)

2014-11-25

This project began with an emphasis on developing new low-­temperature synthetic routes to intermetallic alloys in order to advance the synthesis and processing science of superconducting materials, as well as to potentially discover new materials that would be inaccessible using more traditional higher-­temperature methods. Our initial target materials, chosen as model systems for developing new low-­temperature solution-­based synthetic platforms, were based on well known superconducting alloys, including Nb₃M (M = Ga, Ge, Sn), Bi-­M (M = In, Cu), and MgCNi₃. Several key, fundamental synthetic challenges that underpinned the formation of these materials using solution chemistry routes were identified and investigated.

Application of cloud computing in power routing for clusters of microgrids using oblivious network routing algorithm

DEFF Research Database (Denmark)

Amini, M. Hadi; Broojeni, Kianoosh G.; Dragicevic, Tomislav

2017-01-01

of microgrid while preventing congestion as well as minimizing the power loss. Then, we present a two-layer simulation platform which considers both communication layer and physical layer of the microgrids' cluster. In order to improve the security of communication network, we perform the computations...... regarding the oblivious power routing via a cloud-based network. The proposed framework can be used for further studies that deal with the real-time simulation of the clusters of microgrids. In order to validate the effectiveness of the proposed framework, we implement our proposed oblivious routing scheme...

Mean Velocity Prediction Information Feedback Strategy in Two-Route Systems under ATIS

Directory of Open Access Journals (Sweden)

Jianqiang Wang

2015-02-01

Full Text Available Feedback contents of previous information feedback strategies in advanced traveler information systems are almost real-time traffic information. Compared with real-time information, prediction traffic information obtained by a reliable and effective prediction algorithm has many undisputable advantages. In prediction information environment, a traveler is prone to making a more rational route-choice. For these considerations, a mean velocity prediction information feedback strategy (MVPFS is presented. The approach adopts the autoregressive-integrated moving average model (ARIMA to forecast short-term traffic flow. Furthermore, prediction results of mean velocity are taken as feedback contents and displayed on a variable message sign to guide travelers' route-choice. Meanwhile, discrete choice model (Logit model is selected to imitate more appropriately travelers' route-choice behavior. In order to investigate the performance of MVPFS, a cellular automaton model with ARIMA is adopted to simulate a two-route scenario. The simulation shows that such innovative prediction feedback strategy is feasible and efficient. Even more importantly, this study demonstrates the excellence of prediction feedback ideology.

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

Science.gov (United States)

Robinson, Y Harold; Rajaram, M

2015-01-01

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

Be-safe travel, a web-based geographic application to explore safe-route in an area

Science.gov (United States)

Utamima, Amalia; Djunaidy, Arif

2017-08-01

In large cities in developing countries, the various forms of criminality are often found. For instance, the most prominent crimes in Surabaya, Indonesia is 3C, that is theft with violence (curas), theft by weighting (curat), and motor vehicle theft (curanmor). 3C case most often occurs on the highway and residential areas. Therefore, new entrants in an area should be aware of these kind of crimes. Route Planners System or route planning system such as Google Maps only consider the shortest distance in the calculation of the optimal route. The selection of the optimal path in this study not only consider the shortest distance, but also involves other factors, namely the security level. This research considers at the need for an application to recommend the safest road to be passed by the vehicle passengers while drive an area. This research propose Be-Safe Travel, a web-based application using Google API that can be accessed by people who like to drive in an area, but still lack of knowledge of the pathways which are safe from crime. Be-Safe Travel is not only useful for the new entrants, but also useful for delivery courier of valuables goods to go through the safest streets.

Design and Operational Evaluation of the Traffic Management Advisor at the Ft. Worth Air Route Traffic Control Center

Science.gov (United States)

Swenson, Harry N.; Vincent, Danny; Tobias, Leonard (Technical Monitor)

1997-01-01

NASA and the FAA have designed and developed and an automation tool known as the Traffic Management Advisor (TMA). The system was operationally evaluated at the Ft. Worth Air Route Traffic Control Center (ARTCC). The TMA is a time-based strategic planning tool that provides Traffic Management Coordinators and En Route Air Traffic Controllers the ability to efficiently optimize the capacity of a demand impacted airport. The TMA consists of trajectory prediction, constraint-based runway scheduling, traffic flow visualization and controllers advisories. The TMA was used and operationally evaluated for forty-one rush traffic periods during a one month period in the Summer of 1996. The evaluations included all shifts of air traffic operations as well as periods of inclement weather. Performance data was collected for engineering and human factor analysis and compared with similar operations without the TMA. The engineering data indicates that the operations with the TMA show a one to two minute per aircraft delay reduction during rush periods. The human factor data indicate a perceived reduction in en route controller workload as well as an increase in job satisfaction. Upon completion of the evaluation, the TMA has become part of the normal operations at the Ft. Worth ARTCC.

Fuzzy Weight Cluster-Based Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Teng Gao

2015-01-01

Full Text Available Cluster-based protocol is a kind of important routing in wireless sensor networks. However, due to the uneven distribution of cluster heads in classical clustering algorithm, some nodes may run out of energy too early, which is not suitable for large-scale wireless sensor networks. In this paper, a distributed clustering algorithm based on fuzzy weighted attributes is put forward to ensure both energy efficiency and extensibility. On the premise of a comprehensive consideration of all attributes, the corresponding weight of each parameter is assigned by using the direct method of fuzzy engineering theory. Then, each node works out property value. These property values will be mapped to the time axis and be triggered by a timer to broadcast cluster headers. At the same time, the radio coverage method is adopted, in order to avoid collisions and to ensure the symmetrical distribution of cluster heads. The aggregated data are forwarded to the sink node in the form of multihop. The simulation results demonstrate that clustering algorithm based on fuzzy weighted attributes has a longer life expectancy and better extensibility than LEACH-like algorithms.

NQAR: Network Quality Aware Routing in Error-Prone Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jaewon Choi

2010-01-01

Full Text Available We propose a network quality aware routing (NQAR mechanism to provide an enabling method of the delay-sensitive data delivery over error-prone wireless sensor networks. Unlike the existing routing methods that select routes with the shortest arrival latency or the minimum hop count, the proposed scheme adaptively selects the route based on the network qualities including link errors and collisions with minimum additional complexity. It is designed to avoid the paths with potential noise and collision that may cause many non-deterministic backoffs and retransmissions. We propose a generic framework to select a minimum cost route that takes the packet loss rate and collision history into account. NQAR uses a data centric approach to estimate a single-hop delay based on processing time, propagation delay, packet loss rate, number of backoffs, and the retransmission timeout between two neighboring nodes. This enables a source node to choose the shortest expected end-to-end delay path to send a delay-sensitive data. The experiment results show that NQAR reduces the end-to-end transfer delay up to approximately 50% in comparison with the latency-based directed diffusion and the hop count-based directed diffusion under the error-prone network environments. Moreover, NQAR shows better performance than those routing methods in terms of jitter, reachability, and network lifetime.

Improvement of Network Performance by In-Vehicle Routing Using Floating Car Data

Directory of Open Access Journals (Sweden)

Gerdien A. Klunder

2017-01-01

Full Text Available This paper describes a study which gives insight into the size of improvement that is possible with individual in-car routing advice based on the actual traffic situation derived from floating car data (FCD. It also gives an idea about the required penetration rate of floating car data needed to achieve a certain degree of improvement. The study uses real loop detector data from the region of Amsterdam collected for over a year, a route generating algorithm for in-car routing advice, and emulated floating car data to generate the routing advice. The case with in-car routing advice has been compared to the base case, where drivers base their routing decisions on average knowledge of travel times in the network. The improvement in total delay using the in-vehicle system is dependent on penetration rate and accuracy of the floating car data and varies from 2.0% to 3.4% for 10% penetration rate. This leads to yearly savings of about 15 million euros if delay is monetarised using standard prices for value of time (VOT.

Modeling and Performance Analysis of Route-Over and Mesh-Under Routing Schemes in 6LoWPAN under Error-Prone Channel Condition

Directory of Open Access Journals (Sweden)

Tsung-Han Lee

2013-01-01

Full Text Available 6LoWPAN technology has attracted extensive attention recently. It is because 6LoWPAN is one of Internet of Things standard and it adapts to IPv6 protocol stack over low-rate wireless personal area network, such as IEEE 802.15.4. One view is that IP architecture is not suitable for low-rate wireless personal area network. It is a challenge to implement the IPv6 protocol stack into IEEE 802.15.4 devices due to that the size of IPv6 packet is much larger than the maximum packet size of IEEE 802.15.4 in data link layer. In order to solve this problem, 6LoWPAN provides header compression to reduce the transmission overhead for IP packets. In addition, two selected routing schemes, mesh-under and route-over routing schemes, are also proposed in 6LoWPAN to forward IP fragmentations under IEEE 802.15.4 radio link. The distinction is based on which layer of the 6LoWPAN protocol stack is in charge of routing decisions. In route-over routing scheme, the routing distinction is taken at the network layer and, in mesh-under, is taken by the adaptation layer. Thus, the goal of this research is to understand the performance of two routing schemes in 6LoWPAN under error-prone channel condition.

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

NARCIS (Netherlands)

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

2016-01-01

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

The Architecture of WiFi-Based WSN for AMR System and E-HWMP Routing Protocol

Directory of Open Access Journals (Sweden)

Li LI

2014-02-01

Full Text Available With the development of SoC technology in recent years, the ultra-low power WiFi System on SoC Chip has emerged. As a result, WiFi-based Wireless Sensor Networks come into use, especially used in Automatic Meter Reading. While because the nodes of Wireless Sensor Networks have limited energy supply, smaller storage capability and slower calculation ability, the current WiFi technology cannot be directly applied to WiFi-based Wireless Sensor Networks. The protocols should be upgraded and the security algorithms should be improved to meet the new requests. Firstly, this article describes the network architecture of WiFi-based WSN for AMR system and discusses the reason for using this analogous Mesh architecture. Secondly, the new Hardware architecture of WiFi-based WSN node is designed to realize the AMR system and verify the research work. The node can collect the data of power meter by WiFi and can be powered by a Lithium Battery. Thirdly, on the basis of study work of WiFi original routing protocol HWMP, a new method on improving the energy saving ability of HWMP to adapt the new features of WiFi-based WSN is proposed. And the simulation work on the new routing protocol E-HWMP has been done with NS2 and the simulation results show that the life cycle of the network has been extended to some degree.

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

Science.gov (United States)

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

2018-01-01

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

ROUTING DEMAND CHANGES TO USERS ON THE WM LATERAL CANAL WITH SACMAN

Science.gov (United States)

Most canals have either long travel times or insufficient in-canal storage to operate on-demand. Thus, most flow changes must be routed through the canal. Volume compensation has been proposed as a method for easily applying feedforward control to irrigation canals. SacMan (Software for Automated Ca...

Application of MIKE21 Software in Flood Routing of Tidal Rivers: A Case Study of the Zohre River

Directory of Open Access Journals (Sweden)

Ali Karami Khaniki

2007-01-01

Full Text Available Flood routing is of special importance from different aspects of river engineering such as flood zoning, flood forecasting, etc. There are two methods employed in river flood routing, hydraulic and hydrological. Hydrological methods are used when the river is at low tide and, hence, cannot be employed to analyze floods caused by the tide. Hydraulic methods must be employed in tidal rivers when the direction of the current reverses at high tide. In this research,MIKE21 modeling software was used for the flood routing of the Zohreh tidal river. The model was calibrated by surveying the river, taking samples form the river bed, measuring sea water level and the velocity of the river flow. Analyzing the sensitivity of the model showed that the coefficient of determination, root mean square error and relative error were 0.95, 0.032, and 0.27, respectively, all indicating the efficacy of the model in simulating different parameters such as velocity, flow rate, and water surface profile. The flood routing results of the tidal currents showed that the hydrograph of the influent and effluent to the reach at high tide (when the current direction is from sea to the river was similar to the normal flood routing of the river, but at low tide (when the current direction is from the sea to the river influent and effluent hydrograph would not follow the laws of normal flood routing.

A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Huang Qiong

2014-01-01

Full Text Available Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

Neighboring and Connectivity-Aware Routing in VANETs

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2014-01-01

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

QoS Supported IPTV Service Architecture over Hybrid-Tree-Based Explicit Routed Multicast Network

Directory of Open Access Journals (Sweden)

Chih-Chao Wen

2012-01-01

Full Text Available With the rapid advance in multimedia streaming and multicast transport technology, current IP multicast protocols, especially PIM-SM, become the major channel delivery mechanism for IPTV system over Internet. The goals for IPTV service are to provide two-way interactive services for viewers to select popular program channel with high quality for watching during fast channel surfing period. However, existing IP multicast protocol cannot meet above QoS requirements for IPTV applications between media server and subscribers. Therefore, we propose a cooperative scheme of hybrid-tree based on explicit routed multicast, called as HT-ERM to combine the advantages of shared tree and source tree for QoS-supported IPTV service. To increase network utilization, the constrained shortest path first (CSPF routing algorithm is designed for construction of hybrid tree to deliver the high-quality video stream over watching channel and standard quality over surfing channel. Furthermore, the Resource Reservation Protocol- Traffic Engineering (RSVP-TE is used as signaling mechanism to set up QoS path for multicast channel admission control. Our simulation results demonstrated that the proposed HT-ERM scheme outperforms other multicast QoS-based delivery scheme in terms of channel switching delay, resource utilization, and blocking ratio for IPTV service.

Transformation of Commercial Flows into Physical Flows of Electricity – Flow Based Method

Directory of Open Access Journals (Sweden)

M. Adamec

2009-01-01

Full Text Available We are witnesses of large – scale electricity transport between European countries under the umbrella of the UCTE organization. This is due to the inabilyof generators to satisfy the growing consumption in some regions. In this content, we distinguish between two types of flow. The first type is physical flow, which causes costs in the transmission grid, whilst the second type is commercial flow, which provides revenues for the market participants. The old methods for allocating transfer capacity fail to take this duality into account. The old methods that allocate transmission border capacity to “virtual” commercial flows which, in fact, will not flow over this border, do not lead to optimal allocation. Some flows are uselessly rejected and conversely, some accepted flows can cause congestion on another border. The Flow Based Allocation method (FBA is a method which aims to solve this problem.Another goal of FBA is to ensure sustainable development of expansion of transmission capacity. Transmission capacity is important, because it represents a way to establish better transmission system stability, and it provides a distribution channel for electricity to customers abroad. For optimal development, it is necessary to ensure the right division of revenue allocation among the market participants.This paper contains a brief description of the FBA method. Problems of revenue maximization and optimal revenue distribution are mentioned. 

Game-Theory-Based Approach for Energy Routing in a Smart Grid Network

Directory of Open Access Journals (Sweden)

June S. Hong

2016-01-01

Full Text Available Small power plants and buildings with renewable power generation capability have recently been added to traditional central power plants. Through these facilities, prosumers appear to have a concurrent role in both energy production and consumption. Based on bidirectional power transfers by large numbers of prosumers, a smart microgrid has become an important factor in efficiently controlling the microgrids used in power markets and in conducting effective power trades among grids. In this paper, we present an approach utilizing the game theory for effective and efficient energy routing, which is a novel and challenging procedure for a smart microgrid network. First, we propose strategies for choosing the desired transaction price for both electricity surpluses and shortages to maximize profits through energy transactions. An optimization scheme is utilized to search for an energy route with minimum cost using the solving method used in a traditional transportation problem by treating the sale and purchase quantities as transportation supply and demand, respectively. To evaluate the effect of the proposed decision strategies, we simulated our mechanism, and the results proved that our mechanism yields results pursued by each strategy. Our proposed strategies will contribute to spreading a smart microgrid for enhancing the utilization of microgrids.

AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Farzad Kiani

2016-01-01

Full Text Available Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase, the sensors are placed into virtual layers. The second phase (data transmission is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

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

Science.gov (United States)

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

2013-02-04

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

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

Directory of Open Access Journals (Sweden)

Antonio A. F. Loureiro

2013-02-01

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

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

Science.gov (United States)

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

2013-01-01

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

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

Route planning of raw materials transportation in the industrial hub of Mariupol city

Directory of Open Access Journals (Sweden)

Юлія Вікторівна Булгакова

2017-07-01

Full Text Available The multi-modal freight transportation routes planning problem is viewed in this paper. The case study of iron ore deliveries to the metallurgical enterprises of Mariupol from Kryvyi Rih is presented. Based on the analysis of Ukrainian railroads and sea ports infrastructures six possible routes of multi-modal iron ore transportation are built. The paper presents a short review of route planning problem in multi-modal freight transportations, which are use sea and land parts together, regarding decision support methods of routes evaluation and selection. The lack of studies dedicated to fuzzy logic theory application for solving the stated problems is identified. The relevance of fuzzy set application to the route planning problem is proved. Taking into account the peculiarities of iron ore transportations technology, the following criterions of routes evaluation are chosen: «transportation costs», «delivery times», «transportation risks». The model of multicriterion decision-making of routes evaluation and the optimal route selection, based on fuzzy logic theory, is developed. Criteria of routes evaluation are set by three terms Gaussian and sigmoidal membership functions. The approach to each function construction is practice-based and executed together with iron ore supply chain manager. The model is created in MATLAB Fuzzy Logic Tool Box environment using Mamdani’s fuzzy inference

THE METHODS OF TRAFFIC ENGINEERING’S OPTIMIZATION IN CASE OF DATA TRANSFER BY TWO ROUTS

Directory of Open Access Journals (Sweden)

Vera Petrovna Khoborova

2018-05-01

Full Text Available To prevent congestion in certain sections of multi-service networks, data flow management, which leads to a more proportional distribution of resources and improved network functioning, is implemented. The task of selecting routes for individual data streams (traffic class, taking into account requirements of QoS, is solved by the methods of traffic engineering. With the help of these methods, it is strived to load all the network resources maximally and balanced, so that the network, with a given level of service quality, has high total capacity as much as possible. However, at the present time, there are no rigorous well-founded solutions for the problem of distributing data flows between the selected routes, taking into account the possibility of additional control over their capacity. The article proposes a method for optimizing the distribution of data flows and the bandwidth of the channels (routes used in each separate information direction, with different coordination of control actions at adjacent levels of the network architecture. We consider scientific and technical proposals for the implementation of the developed method as part of the mechanisms that implement the traffic engineering in modern multiservice networks. Purpose: increasing the efficiency of the multiservice network by optimizing the traffic engineering. Methodology in article analytical methods for solving optimization problems with a non-linear objective function and linear constraints are used. Results: analytical expressions were obtained for the optimal distribution of data flows and bandwidth of the used channels, which provides the minimum values of delay indicators, and the use of these expressions in calculations in the mechanisms of traffic engineering was suggested. Practical implications: the obtained results should be used in modern multiservice networks, which are implemented data flow management through the traffic engineering in order to improve the

Performance analysis of routing protocols for IoT

Science.gov (United States)

Manda, Sridhar; Nalini, N.

2018-04-01

Internet of Things (IoT) is an arrangement of advancements that are between disciplinary. It is utilized to have compelling combination of both physical and computerized things. With IoT physical things can have personal virtual identities and participate in distributed computing. Realization of IoT needs the usage of sensors based on the sector for which IoT is integrated. For instance, in healthcare domain, IoT needs to have integration with wearable sensors used by patients. As sensor devices produce huge amount of data, often called big data, there should be efficient routing protocols in place. To the extent remote systems is worried there are some current protocols, for example, OLSR, DSR and AODV. It additionally tosses light into Trust based routing protocol for low-power and lossy systems (TRPL) for IoT. These are broadly utilized remote directing protocols. As IoT is developing round the corner, it is basic to investigate routing protocols that and evaluate their execution regarding throughput, end to end delay, and directing overhead. The execution experiences can help in settling on very much educated choices while incorporating remote systems with IoT. In this paper, we analyzed different routing protocols and their performance is compared. It is found that AODV showed better performance than other routing protocols aforementioned.