WorldWideScience

Sample records for dynamic routing based

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

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

  3. A Simulation-Based Dynamic Stochastic Route Choice Model for Evacuation

    Directory of Open Access Journals (Sweden)

    Xing Zhao

    2012-01-01

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

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

  5. Dynamic Weather Routes Architecture Overview

    Science.gov (United States)

    Eslami, Hassan; Eshow, Michelle

    2014-01-01

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

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

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

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

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

  10. Dynamic Routing during Disaster Events

    NARCIS (Netherlands)

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

    2015-01-01

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

  11. Dynamic route guidance algorithm based algorithm based on artificial immune system

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    To improve the performance of the K-shortest paths search in intelligent traffic guidance systems,this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the memphor mechanism of vertebrate immune systems.This algorithm,applied to the urban traffic network model established by the node-expanding method,can expediently realize K-shortest paths search in the urban traffic guidance systems.Because of the immune memory and global parallel search ability from artificial immune systems,K shortest paths can be found without any repeat,which indicates evidently the superiority of the algorithm to the conventional ones.Not only does it perform a better parallelism,the algorithm also prevents premature phenomenon that often occurs in genetic algorithms.Thus,it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications.A case study verifies the efficiency and the practicability of the algorithm aforementioned.

  12. Classification of Dynamic Vehicle Routing Systems

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

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

  15. Dynamic Escape Routes for Naval Ships

    National Research Council Canada - National Science Library

    Villalonga, Francisco J

    2005-01-01

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

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

  17. Phone Routing using the Dynamic Memory Model

    DEFF Research Database (Denmark)

    Bendtsen, Claus Nicolaj; Krink, Thiemo

    2002-01-01

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

  18. Benefits Analysis of Multi-Center Dynamic Weather Routes

    Science.gov (United States)

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

    2014-01-01

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

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

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

  1. A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications

    Directory of Open Access Journals (Sweden)

    Jisheng Zhang

    2015-06-01

    Full Text Available It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs’ route planning for small and medium-scale networks.

  2. Congested Link Inference Algorithms in Dynamic Routing IP Network

    Directory of Open Access Journals (Sweden)

    Yu Chen

    2017-01-01

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

  3. Dynamic Routing of Short Transfer Baggage

    DEFF Research Database (Denmark)

    Clausen, Tommy; Pisinger, David

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

  4. Analysis Evacuation Route for KM Zahro Express on Fire Condition using Agent Based Modeling and Fire Dynamics Simulatior

    Directory of Open Access Journals (Sweden)

    Trika Pitana

    2017-09-01

    Full Text Available Safety is the thing that needs to be preferred by users of transport, passengers should also understand about safety procedures and evacuation procedures in the means of transport. There have been many accidents that happen in the world of transport, particularly in the shipping world, from 2010 to 2016 is no more than 50 accidents of ships in accordance with the cause recorded by KNKT (Komisi Nasional Keselamatan Transportasi. On this research was discussed the evacuation time on the ship KM Zahro express that occurred earlier in the year 2017 in the Kepulauan Seribu, DKI Jakarta. Almost all passenger dead caused by fire from power source in engine room. This thesis will explaine about evacuation time and dangers from fire that interfere the process of evacuation. The methods used are Agent Based Modeling and Simulation (ABMS and Fire Dynamics Simulator (FDS for modeling fire simulation. Agent-Based Modeling software (pathfinder and Fire Dynamics Simulator software (pyrosim are used to calculate time evacuation in normal condition and fire condition of KM Zahro Express. Agent-Based Modeling and Simulator (ABMS is a modeling method that aims to model complex problems based on real cases. Agent-Based Modeling and Simulator (ABMS is designed to model a place that has a seat, path, exit door, humans, and others. Pyrosim is a graphical user interface for the Fire Dynamics Simulator (FDS. FDS models can predict smoke, temperature, carbon monoxide, and other substances during fires.  In this case the existing models can be used to plan and prepare an emergency if unwanted things happen. As well as using basic rules which refer to the Safety Of Life At Sea (SOLAS and International Maritime Organization (IMO. Result of Evacuation simulation calculation on emergency conditions (two rear exit doors will be closed that match at actually condition is 29,783 minutes (respon is not taken in this simulation, calculation results obtained from simulation of

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

    Science.gov (United States)

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

    2015-01-01

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

  6. Vehicle routing with dynamic travel times : a queueing approach

    NARCIS (Netherlands)

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

    2008-01-01

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

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

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

    DEFF Research Database (Denmark)

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

    2009-01-01

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

  9. SDN-enabled dynamic WDM networks to address routing information inaccuracy

    CSIR Research Space (South Africa)

    Ravhuanzwo, Lusani

    2016-11-01

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

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

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

    Science.gov (United States)

    Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

    2016-05-01

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

  12. FPGA Dynamic Power Minimization through Placement and Routing Constraints

    Directory of Open Access Journals (Sweden)

    Deepak Agarwal

    2006-08-01

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

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

  14. Multicast routing for wavelength-routed WDM networks with dynamic membership

    Science.gov (United States)

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

    2000-09-01

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

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

    Directory of Open Access Journals (Sweden)

    Francisco José Estévez

    2016-06-01

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

  16. A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Shifeng Chen

    2017-09-01

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

  17. Dynamic multicast routing scheme in WDM optical network

    Science.gov (United States)

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

    2007-11-01

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

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

  19. Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks

    Science.gov (United States)

    Wang, Fu; Liu, Bo; Zhang, Lijia; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun

    2017-07-01

    Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.

  20. Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

    Directory of Open Access Journals (Sweden)

    Yingcheng Xu

    2013-01-01

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

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

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

  3. Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Sunil Kumar

    2013-01-01

    Full Text Available Node mobility in mobile ad hoc networks (MANETs causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU, for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI for discovery of reliable routes; (ii a local path update mechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii a keep alive mechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv a packet salvaging scheme to improve packet delivery in the event of a route breakage; and (v low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.

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

    Institute of Scientific and Technical Information of China (English)

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

    2003-01-01

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

  5. DTN routing in body sensor networks with dynamic postural partitioning.

    Science.gov (United States)

    Quwaider, Muhannad; Biswas, Subir

    2010-11-01

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

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

  7. The Dynamic Multi-Period Vehicle Routing Problem

    DEFF Research Database (Denmark)

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Dongshuang Li

    2018-05-01

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

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

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

  12. Dynamic vehicle routing problems: Three decades and counting

    DEFF Research Database (Denmark)

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

    2016-01-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

  15. Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

    Science.gov (United States)

    Burleigh, Scott C.

    2008-01-01

    Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.

  16. Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Haitao Xu

    2018-01-01

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

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    H. Goelzer

    2012-05-01

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

  2. Energy Efficiency Analysis for Dynamic Routing in Optical Transport Networks

    DEFF Research Database (Denmark)

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

    2012-01-01

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

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

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    B. Narasimhan

    2015-03-01

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

  9. Dynamic Routing and Coordination in Multi-Agent Networks

    Science.gov (United States)

    2016-06-10

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

  10. On a New Route to Chaos in Railway Dynamics

    DEFF Research Database (Denmark)

    True, Hans; Jensen, Carsten Nordstroem

    1997-01-01

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

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

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

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

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

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

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

  17. Route constraints model based on polychromatic sets

    Science.gov (United States)

    Yin, Xianjun; Cai, Chao; Wang, Houjun; Li, Dongwu

    2018-03-01

    With the development of unmanned aerial vehicle (UAV) technology, the fields of its application are constantly expanding. The mission planning of UAV is especially important, and the planning result directly influences whether the UAV can accomplish the task. In order to make the results of mission planning for unmanned aerial vehicle more realistic, it is necessary to consider not only the physical properties of the aircraft, but also the constraints among the various equipment on the UAV. However, constraints among the equipment of UAV are complex, and the equipment has strong diversity and variability, which makes these constraints difficult to be described. In order to solve the above problem, this paper, referring to the polychromatic sets theory used in the advanced manufacturing field to describe complex systems, presents a mission constraint model of UAV based on polychromatic sets.

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

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

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

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

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

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

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

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

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

    NARCIS (Netherlands)

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

    2014-01-01

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

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

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

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

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

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

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

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

  14. SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs.

    Science.gov (United States)

    Aslam, Muhammad; Hu, Xiaopeng; Wang, Fan

    2017-12-13

    Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN). Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs) utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR) routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR's routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS). This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR) to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime and stability

  15. SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs

    Directory of Open Access Journals (Sweden)

    Muhammad Aslam

    2017-12-01

    Full Text Available Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN. Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR’s routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS. This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime

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

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

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

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

  20. Short Term Strategies for a Dynamic Multi-Period Routing Problem

    NARCIS (Netherlands)

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

    2009-01-01

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

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

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  2. Diagrammatic routes to nonlocal correlations beyond dynamical mean field theory

    Science.gov (United States)

    Rohringer, G.; Hafermann, H.; Toschi, A.; Katanin, A. A.; Antipov, A. E.; Katsnelson, M. I.; Lichtenstein, A. I.; Rubtsov, A. N.; Held, K.

    2018-04-01

    Strong electronic correlations pose one of the biggest challenges to solid state theory. Recently developed methods that address this problem by starting with the local, eminently important correlations of dynamical mean field theory (DMFT) are reviewed. In addition, nonlocal correlations on all length scales are generated through Feynman diagrams, with a local two-particle vertex instead of the bare Coulomb interaction as a building block. With these diagrammatic extensions of DMFT long-range charge, magnetic, and superconducting fluctuations as well as (quantum) criticality can be addressed in strongly correlated electron systems. An overview is provided of the successes and results achieved, mainly for model Hamiltonians, and an outline is given of future prospects for realistic material calculations.

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

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

    NARCIS (Netherlands)

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

    2012-01-01

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

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

    Science.gov (United States)

    Davis, L. C.

    2017-07-01

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Fangfang Wei

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Ying Zhang

    2016-01-01

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

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

    Science.gov (United States)

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

    2016-01-29

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

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

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

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

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Maksim Kitsak

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

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

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

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

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

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

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

    DEFF Research Database (Denmark)

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

    2006-01-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Yulia Shichkina

    2017-01-01

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

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

  8. Fabrication routes for Thorium and Uranium233 based AHWR fuel

    International Nuclear Information System (INIS)

    Danny, K.M.; Saraswat, Anupam; Chakraborty, S.; Somayajulu, P.S.; Kumar, Arun

    2011-01-01

    India's economic growth is on a fast growth track. The growth in population and economy is creating huge demand for energy which has to be met with environmentally benign technologies. Nuclear Energy is best suited to meet this demand without causing undue environmental impact. Considering the large thorium reserves in India, the future nuclear power program will be based on Thorium- Uranium 233 fuel cycle. The major characteristic of thorium as the fuel of future comes from its superior fuel utilization. 233 U produced in a reactor is always contaminated with 232 U. This 232 U undergoes a decay to produce 228 Th and it is followed by decay chain including 212 Bi and 208 Tl. Both 212 Bi and 208 Tl are hard gamma emitters ranging from 0.6 MeV-1.6 MeV and 2.6 MeV respectively, which necessitates its handling in hot cell. The average concentration of 232 U is expected to exceed 1000 ppm after a burn-up of 24,000 MWD/t. Work related to developing the fuel fabrication technology including automation and remotization needed for 233 U based fuels is in progress. Various process for fuel fabrication have been developed i.e. Coated Agglomerate Pelletisation (CAP), impregnation technique (Pellet/Gel), Sol Gel Micro-sphere Pelletisation (SGMP) apart from Powder to Pellet (POP) route. This paper describes each process with respect to its advantages, disadvantages and its amenability to automation and remotisation. (author)

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

    DEFF Research Database (Denmark)

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

    2010-01-01

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

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

    International Nuclear Information System (INIS)

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

    2015-01-01

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

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

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

  13. A Dynamic Travel Time Estimation Model Based on Connected Vehicles

    Directory of Open Access Journals (Sweden)

    Daxin Tian

    2015-01-01

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

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

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

    DEFF Research Database (Denmark)

    Zach, Florian; Gretzel, Ulrike

    2011-01-01

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

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

    International Nuclear Information System (INIS)

    Johansson, Ola M.

    2006-01-01

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

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

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

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

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

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

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

    International Nuclear Information System (INIS)

    Comellas, Francesc; Miralles, Alicia

    2011-01-01

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

  3. Energy Efficient Routing in Wireless Sensor Networks based on Ant ...

    African Journals Online (AJOL)

    PROF. O. E. OSUAGWU

    2013-09-01

    Sep 1, 2013 ... improved Ant System and their application in WSN routing process. The simulation results show ... and Mobile ad-hoc networks (MANETs) are inappropriate for ... Dorigo in 1992 in his PhD thesis, the first algorithm was aiming ...

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

  5. Strategic Air Traffic Planning Using Eulerian Route Based Modeling and Optimization

    Science.gov (United States)

    Bombelli, Alessandro

    Due to a soaring air travel growth in the last decades, air traffic management has become increasingly challenging. As a consequence, planning tools are being devised to help human decision-makers achieve a better management of air traffic. Planning tools are divided into two categories, strategic and tactical. Strategic planning generally addresses a larger planning domain and is performed days to hours in advance. Tactical planning is more localized and is performed hours to minutes in advance. An aggregate route model for strategic air traffic flow management is presented. It is an Eulerian model, describing the flow between cells of unidirectional point-to-point routes. Aggregate routes are created from flight trajectory data based on similarity measures. Spatial similarity is determined using the Frechet distance. The aggregate routes approximate actual well-traveled traffic patterns. By specifying the model resolution, an appropriate balance between model accuracy and model dimension can be achieved. For a particular planning horizon, during which weather is expected to restrict the flow, a procedure for designing airborne reroutes and augmenting the traffic flow model is developed. The dynamics of the traffic flow on the resulting network take the form of a discrete-time, linear time-invariant system. The traffic flow controls are ground holding, pre-departure rerouting and airborne rerouting. Strategic planning--determining how the controls should be used to modify the future traffic flow when local capacity violations are anticipated--is posed as an integer programming problem of minimizing a weighted sum of flight delays subject to control and capacity constraints. Several tests indicate the effectiveness of the modeling and strategic planning approach. In the final, most challenging, test, strategic planning is demonstrated for the six western-most Centers of the 22-Center national airspace. The planning time horizon is four hours long, and there is

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

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

  8. A Comparison of Routing Protocol for WSNs: Redundancy Based Approach A Comparison of Routing Protocol for WSNs: Redundancy Based Approach

    Directory of Open Access Journals (Sweden)

    Anand Prakash

    2014-03-01

    Full Text Available Wireless Sensor Networks (WSNs with their dynamic applications gained a tremendous attention of researchers. Constant monitoring of critical situations attracted researchers to utilize WSNs at vast platforms. The main focus in WSNs is to enhance network localization as much as one could, for efficient and optimal utilization of resources. Different approaches based upon redundancy are proposed for optimum functionality. Localization is always related with redundancy of sensor nodes deployed at remote areas for constant and fault tolerant monitoring. In this work, we propose a comparison of classic flooding and the gossip protocol for homogenous networks which enhances stability and throughput quiet significantly.  

  9. Power Management Based Grid Routing Protocol for IEEE 802.11 Based MANET

    Institute of Scientific and Technical Information of China (English)

    XU Li; ZHENG Bao-yu; YANG Zhen

    2004-01-01

    MANET ( Mobile Ad Hoc Network ) is a collection of wireless mobile nodes forming a temporary communication network without the aid of any established infrastructure or centralized administration. The lifetime of a MANET depends on the battery resources of the mobile nodes. So energy consumption may one of important design criterions for MANET. With changing the idle model to sleep model in the grid environment, this paper proposes a new energy-aware routing protocol. Performance simulation results show that the proposed strategy can dynamic balance the traffic load inside the whole network, extend the lifetime of a MANET, and without decreasing the throughput ratio.

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

    DEFF Research Database (Denmark)

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

    2009-01-01

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

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

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

  13. Opportunity costs calculation in agent-based vehicle routing and scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

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

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2007-07-01

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

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

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

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

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

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

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

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

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

  6. Microneedle-based drug delivery systems for transdermal route.

    Science.gov (United States)

    Pierre, Maria Bernadete Riemma; Rossetti, Fabia Cristina

    2014-03-01

    Transdermal delivery offers an attractive, noninvasive administration route but it is limited by the skin's barrier to penetration. Minimally invasive techniques, such as the use of microneedles (MNs), bypass the stratum corneum (SC) barrier to permit the drug's direct access to the viable epidermis. These novel micro devices have been developed to puncture the skin for the transdermal delivery of hydrophilic drugs and macromolecules, including peptides, DNA and other molecules, that would otherwise have difficulty passing the outermost layer of the skin, the SC. Using the tools of the microelectronics industry, MNs have been fabricated with a range of sizes, shapes and materials. MNs have been shown to be robust enough to penetrate the skin and dramatically increase the skin permeability of several drugs. Moreover, MNs have reduced needle insertion pain and tissue trauma and provided controlled delivery across the skin. This review focuses on the current state of the art in the transdermal delivery of drugs using various types of MNs and developments in the field of microscale devices, as well as examples of their uses and clinical safety.

  7. DEADS: Depth and Energy Aware Dominating Set Based Algorithm for Cooperative Routing along with Sink Mobility in Underwater WSNs

    Directory of Open Access Journals (Sweden)

    Amara Umar

    2015-06-01

    Full Text Available Performance enhancement of Underwater Wireless Sensor Networks (UWSNs in terms of throughput maximization, energy conservation and Bit Error Rate (BER minimization is a potential research area. However, limited available bandwidth, high propagation delay, highly dynamic network topology, and high error probability leads to performance degradation in these networks. In this regard, many cooperative communication protocols have been developed that either investigate the physical layer or the Medium Access Control (MAC layer, however, the network layer is still unexplored. More specifically, cooperative routing has not yet been jointly considered with sink mobility. Therefore, this paper aims to enhance the network reliability and efficiency via dominating set based cooperative routing and sink mobility. The proposed work is validated via simulations which show relatively improved performance of our proposed work in terms the selected performance metrics.

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

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

  10. Dynamic Routing of Aircraft in the Presence of Adverse Weather Using a POMDP Framework

    Science.gov (United States)

    Balaban, Edward; Roychoudhury, Indranil; Spirkovska, Lilly; Sankararaman, Shankar; Kulkarni, Chetan; Arnon, Tomer

    2017-01-01

    Each year weather-related airline delays result in hundreds of millions of dollars in additional fuel burn, maintenance, and lost revenue, not to mention passenger inconvenience. The current approaches for aircraft route planning in the presence of adverse weather still mainly rely on deterministic methods. In contrast, this work aims to deal with the problem using a Partially Observable Markov Decision Processes (POMDPs) framework, which allows for reasoning over uncertainty (including uncertainty in weather evolution over time) and results in solutions that are more robust to disruptions. The POMDP-based decision support system is demonstrated on several scenarios involving convective weather cells and is benchmarked against a deterministic planning system with functionality similar to those currently in use or under development.

  11. Dynamic Request Routing for Online Video-on-Demand Service: A Markov Decision Process Approach

    Directory of Open Access Journals (Sweden)

    Jianxiong Wan

    2014-01-01

    Full Text Available We investigate the request routing problem in the CDN-based Video-on-Demand system. We model the system as a controlled queueing system including a dispatcher and several edge servers. The system is formulated as a Markov decision process (MDP. Since the MDP formulation suffers from the so-called “the curse of dimensionality” problem, we then develop a greedy heuristic algorithm, which is simple and can be implemented online, to approximately solve the MDP model. However, we do not know how far it deviates from the optimal solution. To address this problem, we further aggregate the state space of the original MDP model and use the bounded-parameter MDP (BMDP to reformulate the system. This allows us to obtain a suboptimal solution with a known performance bound. The effectiveness of two approaches is evaluated in a simulation study.

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

    Directory of Open Access Journals (Sweden)

    Jincheng Jiang

    2017-05-01

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Matteo Mallus

    2017-02-01

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

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

    Directory of Open Access Journals (Sweden)

    Haibin Yu

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

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

    Science.gov (United States)

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

    2016-03-31

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

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

    Science.gov (United States)

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

    2016-01-01

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

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

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

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

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

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

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

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

  6. Advanced flooding-based routing protocols for underwater sensor networks

    OpenAIRE

    Isufi, E.; Dol, H.; Leus, G.J.T.

    2016-01-01

    Flooding-based protocols are a reliable solution to deliver packets in underwater sensor networks. However, these protocols potentially involve all the nodes in the forwarding process. Thus, the performance and energy efficiency are not optimal. In this work, we propose some advances of a flooding-based protocol with the goal to improve the performance and the energy efficiency. The first idea considers the node position information in order to reduce the number of relays that may apply flood...

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

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

    CERN Document Server

    Markiewicz, Michal

    2017-01-01

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

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

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

  11. Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

    Directory of Open Access Journals (Sweden)

    M. E. Migabo

    2017-01-01

    Full Text Available Despite its low computational cost, the Gradient Based Routing (GBR broadcast of interest messages in Wireless Sensor Networks (WSNs causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2S at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC techniques.

  12. Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

    Science.gov (United States)

    Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

    2017-07-19

    Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

  13. In-route skyline querying for location-based services

    DEFF Research Database (Denmark)

    Xuegang, Huang; Jensen, Kristian S.

    2005-01-01

    With the emergence of an infrastructure for location-aware mobile services, the processing of advanced, location-based queries that are expected to underlie such services is gaining in relevance, While much work has assumed that users move in Euclidean space, this paper assumes that movement...... their efficient computation. The queries take into account several spatial preferences. and they intuitively return a set of most interesting results for each result returned by the corresponding non-skyline queries. The paper also covers a performance study of the proposed techniques based on real point...

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

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

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

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

  18. ARBR: Adaptive reinforcement-based routing for DTN

    KAUST Repository

    Elwhishi, Ahmed; Pin-Han Ho; Naik, K.; Shihada, Basem

    2010-01-01

    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

  19. based dynamic voltage restorer

    African Journals Online (AJOL)

    HOD

    operation due to presence of increased use of nonlinear loads (computers, microcontrollers ... simulations of a dynamic voltage restorer (DVR) was achieved using MATLAB/Simulink. ..... using Discrete PWM generator, then the IGBT inverter.

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

    Directory of Open Access Journals (Sweden)

    Ivanov Nikola V.

    2016-01-01

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

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

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

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

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

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

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

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

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Kashif Saleem

    2016-03-01

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

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

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

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

    Science.gov (United States)

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

    2018-01-03

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

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

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

    NARCIS (Netherlands)

    De Moraes Ramos, G.

    2015-01-01

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

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

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

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

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

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

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

  4. The Dynamics of Lateral Gene Transfer in Genus Leishmania - A Route for Adaptation and Species Diversification.

    Science.gov (United States)

    Vikeved, Elisabet; Backlund, Anders; Alsmark, Cecilia

    2016-01-01

    The genome of Leishmania major harbours a comparably high proportion of genes of prokaryote origin, acquired by lateral gene transfer (LGT). Some of these are present in closely related trypanosomatids, while some are detected in Leishmania only. We have evaluated the impact and destiny of LGT in genus Leishmania. To study the dynamics and fate of LGTs we have performed phylogenetic, as well as nucleotide and amino acid composition analyses within orthologous groups of LGTs detected in Leishmania. A set of universal trypanosomatid LGTs was added as a reference group. Both groups of LGTs have, to some extent, ameliorated to resemble the recipient genomes. However, while virtually all of the universal trypanosomatid LGTs are distributed and conserved in the entire genus Leishmania, the LGTs uniquely present in genus Leishmania are more prone to gene loss and display faster rates of evolution. Furthermore, a PCR based approach has been employed to ascertain the presence of a set of twenty LGTs uniquely present in genus Leishmania, and three universal trypanosomatid LGTs, in ten additional strains of Leishmania. Evolutionary rates and predicted expression levels of these LGTs have also been estimated. Ten of the twenty LGTs are distributed and conserved in all species investigated, while the remainder have been subjected to modifications, or undergone pseudogenization, degradation or loss in one or more species. LGTs unique to the genus Leishmania have been acquired after the divergence of Leishmania from the other trypanosomatids, and are evolving faster than their recipient genomes. This implies that LGT in genus Leishmania is a continuous and dynamic process contributing to species differentiation and speciation. This study also highlights the importance of carefully evaluating these dynamic genes, e.g. as LGTs have been suggested as potential drug targets.

  5. The Dynamics of Lateral Gene Transfer in Genus Leishmania - A Route for Adaptation and Species Diversification.

    Directory of Open Access Journals (Sweden)

    Elisabet Vikeved

    2016-01-01

    Full Text Available The genome of Leishmania major harbours a comparably high proportion of genes of prokaryote origin, acquired by lateral gene transfer (LGT. Some of these are present in closely related trypanosomatids, while some are detected in Leishmania only. We have evaluated the impact and destiny of LGT in genus Leishmania.To study the dynamics and fate of LGTs we have performed phylogenetic, as well as nucleotide and amino acid composition analyses within orthologous groups of LGTs detected in Leishmania. A set of universal trypanosomatid LGTs was added as a reference group. Both groups of LGTs have, to some extent, ameliorated to resemble the recipient genomes. However, while virtually all of the universal trypanosomatid LGTs are distributed and conserved in the entire genus Leishmania, the LGTs uniquely present in genus Leishmania are more prone to gene loss and display faster rates of evolution. Furthermore, a PCR based approach has been employed to ascertain the presence of a set of twenty LGTs uniquely present in genus Leishmania, and three universal trypanosomatid LGTs, in ten additional strains of Leishmania. Evolutionary rates and predicted expression levels of these LGTs have also been estimated. Ten of the twenty LGTs are distributed and conserved in all species investigated, while the remainder have been subjected to modifications, or undergone pseudogenization, degradation or loss in one or more species.LGTs unique to the genus Leishmania have been acquired after the divergence of Leishmania from the other trypanosomatids, and are evolving faster than their recipient genomes. This implies that LGT in genus Leishmania is a continuous and dynamic process contributing to species differentiation and speciation. This study also highlights the importance of carefully evaluating these dynamic genes, e.g. as LGTs have been suggested as potential drug targets.

  6. The Dynamics of Lateral Gene Transfer in Genus Leishmania - A Route for Adaptation and Species Diversification

    Science.gov (United States)

    Vikeved, Elisabet; Backlund, Anders; Alsmark, Cecilia

    2016-01-01

    Background The genome of Leishmania major harbours a comparably high proportion of genes of prokaryote origin, acquired by lateral gene transfer (LGT). Some of these are present in closely related trypanosomatids, while some are detected in Leishmania only. We have evaluated the impact and destiny of LGT in genus Leishmania. Methodology/Principal Findings To study the dynamics and fate of LGTs we have performed phylogenetic, as well as nucleotide and amino acid composition analyses within orthologous groups of LGTs detected in Leishmania. A set of universal trypanosomatid LGTs was added as a reference group. Both groups of LGTs have, to some extent, ameliorated to resemble the recipient genomes. However, while virtually all of the universal trypanosomatid LGTs are distributed and conserved in the entire genus Leishmania, the LGTs uniquely present in genus Leishmania are more prone to gene loss and display faster rates of evolution. Furthermore, a PCR based approach has been employed to ascertain the presence of a set of twenty LGTs uniquely present in genus Leishmania, and three universal trypanosomatid LGTs, in ten additional strains of Leishmania. Evolutionary rates and predicted expression levels of these LGTs have also been estimated. Ten of the twenty LGTs are distributed and conserved in all species investigated, while the remainder have been subjected to modifications, or undergone pseudogenization, degradation or loss in one or more species. Conclusions/Significance LGTs unique to the genus Leishmania have been acquired after the divergence of Leishmania from the other trypanosomatids, and are evolving faster than their recipient genomes. This implies that LGT in genus Leishmania is a continuous and dynamic process contributing to species differentiation and speciation. This study also highlights the importance of carefully evaluating these dynamic genes, e.g. as LGTs have been suggested as potential drug targets. PMID:26730948

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

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

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

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

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

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

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

    OpenAIRE

    Srinivas Kanakala; Venugopal Reddy Ananthula; Prashanthi Vempaty

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Abbas Mahmoudabadi

    2015-01-01

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

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

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

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

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

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

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

  1. Particle impact damage in the gamma based TiAl alloy TNBV3B produced via three different processing routes

    International Nuclear Information System (INIS)

    Gebhard, S.; Peters, P.W.M.; Roth-Fagaraseanu, D.; Turley, F.; Voggenreiter, H.

    2010-01-01

    The impact resistance of the TiAl alloy TNBV3B produced via three processing routes - cast, forged and extruded - has been studied on flat and airfoil-like shaped specimens making use of ballistic impact experiments. Several factors influencing the damage behaviour were investigated. The evolution of centre and edge impact induced damage in flat specimens is characterized for different energy levels. Additionally, edge impact was studied for airfoil-like shaped specimens. The results indicate that it is necessary to differentiate between the properties influencing the impact crack initiation and the impact induced crack growth. For the former, strength and ductility appear to have an important influence. A dynamic fracture toughness is probably adequate to describe impact induced crack growth. As such a property was not available an analogy is sought with crack growth behaviour under monotonic and cyclic loading based on microstructural influences found investigating the cracked surfaces after impact.

  2. High-efficiency dynamic routing architecture for the readout of single photon avalanche diode arrays in time-correlated measurements

    Science.gov (United States)

    Cominelli, A.; Acconcia, G.; Peronio, P.; Rech, I.; Ghioni, M.

    2017-05-01

    transfer rate towards the elaboration unit. We developed a novel readout architecture, starting from a completely different perspective: considering the maximum data rate we can manage with a PC, a limited set of conversion data is selected and transferred to the elaboration unit during each excitation period, in order to take full advantage of the bus bandwidth toward the PC. In particular, we introduce a smart routing logic, able to dynamically connect a large number of SPAD detectors to a limited set of high-performance external acquisition chains, paving the way for a more efficient use of resources and allowing us to effectively break the tradeoff between integration and performance, which affects the solutions proposed so far. The routing electronic features a pixelated architecture, while 3D-stacking techniques are exploited to connect each SPAD to its dedicated electronic, leading to a minimization of the overall number of interconnections crossing the integrated system, which is one of the main issues in high-density arrays.

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

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

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

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

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

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

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

  10. Heterogeneous beliefs and routes to complex dynamics in asset pricing models with price contingent contracts

    NARCIS (Netherlands)

    Brock, W.A.; Hommes, C.H.

    2001-01-01

    This paper discusses dynamic evolutionary multi-agent systems, as introduced by Brock and Hommes (1997). In particular the heterogeneous agent dynamic asset pricing model of Brock and Hommes (1998) is extended by introducing derivative securities by means of price contingent contracts. Numerical

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

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

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

  14. Routes to chaos in continuous mechanical systems: Part 2. Modelling transitions from regular to chaotic dynamics

    International Nuclear Information System (INIS)

    Krysko, A.V.; Awrejcewicz, J.; Papkova, I.V.; Krysko, V.A.

    2012-01-01

    In second part of the paper both classical and novel scenarios of transition from regular to chaotic dynamics of dissipative continuous mechanical systems are studied. A detailed analysis allowed us to detect the already known classical scenarios of transition from periodic to chaotic dynamics, and in particular the Feigenbaum scenario. The Feigenbaum constant was computed for all continuous mechanical objects studied in the first part of the paper. In addition, we illustrate and discuss different and novel scenarios of transition of the analysed systems from regular to chaotic dynamics, and we show that the type of scenario depends essentially on excitation parameters.

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

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

  17. Using Approximate Dynamic Programming to Solve the Military Inventory Routing Problem with Direct Delivery

    Science.gov (United States)

    2015-03-26

    Appendix C. Computational Example: 3-COP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94 Appendix D. Storyboard ...COP myopic policy. 105 Appendix D. Storyboard 106 Bibliography 1. Barnes-Schuster, Dawn, & Bassok, Yehuda. 1997. Direct shipping and the dynamic

  18. Energy Threshold-based Cluster Head Rotation for Routing Protocol in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hadi Raheem Ali

    2018-05-01

    Full Text Available Energy efficiency represents a fundamental issue in WSNs, since the network lifetime period entirely depends on the energy of sensor nodes, which are usually battery-operated. In this article, an unequal clustering-based routing protocol has been suggested, where parameters of energy, distance, and density are involved in the cluster head election. Besides, the sizes of clusters are unequal according to distance, energy, and density. Furthermore, the cluster heads are not changed every round unless the residual energy reaches a specific threshold of energy. The outcomes of the conducted simulation confirmed that the performance of the suggested protocol achieves improvement in energy efficiency.

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

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

  1. Toward personalised and dynamic cultural routing: a three-level approach

    NARCIS (Netherlands)

    Aksenov, P.; Kemperman, A.D.A.M.; Arentze, T.A.

    2014-01-01

    This paper introduces the concept of “smart routing” as a recommender system for tourists that takes into account the dynamics of their personal user profiles. The concept relies on three levels of support: 1) programming the tour, i.e. selecting a set of relevant points of interests (POIs) to be

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

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

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

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

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

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

  8. K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.

    Directory of Open Access Journals (Sweden)

    Yunyue He

    Full Text Available Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model's objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX. The second one is a heuristic algorithm that uses a police resource utilization efficiency index to directly solve the original model. This police resource utilization efficiency index significantly aids in the evaluation of road links from an evacuation throughput perspective. The proposed algorithms are tested with a number of examples based on real data from cities of different sizes. The computational results show that the police resource utilization efficiency index is very helpful in finding near-optimal solutions. Additionally, comparing the performance of the heuristic algorithm and the linearization method by using randomly generated examples indicates that the efficiency of the heuristic algorithm is superior.

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

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

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

  12. Coexistence of multiple attractors and crisis route to chaos in a novel memristive diode bidge-based Jerk circuit

    International Nuclear Information System (INIS)

    Njitacke, Z.T.; Kengne, J.; Fotsin, H.B.; Negou, A. Nguomkam; Tchiotsop, D.

    2016-01-01

    In the present paper, a new memristor based oscillator is obtained from the autonomous Jerk circuit [Kengne et al., Nonlinear Dynamics (2016) 83: 751̶765] by substituting the nonlinear element of the original circuit with a first order memristive diode bridge. The model is described by a continuous time four-dimensional autonomous system with smooth nonlinearities. Various nonlinear analysis tools such as phase portraits, time series, bifurcation diagrams, Poincaré section and the spectrum of Lyapunov exponents are exploited to characterize different scenarios to chaos in the novel circuit. It is found that the system experiences period doubling and crisis routes to chaos. One of the major results of this work is the finding of a window in the parameters’ space in which the circuit develops hysteretic behaviors characterized by the coexistence of four different (periodic and chaotic) attractors for the same values of the system parameters. Basins of attractions of various coexisting attractors are plotted showing complex basin boundaries. As far as the authors’ knowledge goes, the novel memristive jerk circuit represents one of the simplest electrical circuits (no analog multiplier chip is involved) capable of four disconnected coexisting attractors reported to date. Both PSpice simulations of the nonlinear dynamics of the oscillator and laboratory experimental measurements are carried out to validate the theoretical analysis.

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

  14. Facile Route to Vertically Aligned High-Aspect Ratio Block Copolymer Films via Dynamic Zone Annealing

    Science.gov (United States)

    Singh, Gurpreet; Kulkarni, Manish; Yager, Kevin; Smilgies, Detlef; Bucknall, David; Karim, Alamgir

    2012-02-01

    Directed assembly of block copolymers (BCP) can be used to fabricate a diversity of nanostructures useful for nanotech applications. The ability to vertically orient etchable high aspect ratio (˜30) ordered BCP domains on flexible substrates via continuous processing methods are particularly attractive for nanomanufacturing. We apply sharp dynamic cold zone annealing (CZA-S) to create etchable, and predominantly vertically oriented 30nm cylindrical domains in 1 μm thick poly(styrene-b-methylmethacrylate) films on low thermal conductivity rigid (quartz) and flexible (PDMS & Kapton) substrates. Under similar static conditions, temporally stable vertical cylinders form within a narrow zone above a critical temperature gradient. Primary ordering mechanism of CZA-S involves sweeping this vertically orienting zone created at maximum thermal gradient. An optimal speed is needed since the process competes with preferential surface wetting dynamics that favors parallel orientation. GISAXS of etched BCP films confirms internal morphology.

  15. The excitonic insulator route through a dynamical phase transition induced by an optical pulse

    Energy Technology Data Exchange (ETDEWEB)

    Brazovskii, S., E-mail: brazov@lptms.u-psud.fr [Université Paris-Saclay, LPTMS, CNRS, Univ. Paris-sud (France); Kirova, N. [Université Paris-Saclay, LPS, CNRS, Univ. Paris-sud (France)

    2016-03-15

    We consider a dynamical phase transition induced by a short optical pulse in a system prone to thermodynamical instability. We address the case of pumping to excitons whose density contributes directly to the order parameter. To describe both thermodynamic and dynamic effects on equal footing, we adopt a view of the excitonic insulator for the phase transition and suggest a formation of the Bose condensate for the pumped excitons. The work is motivated by experiments in donor–acceptor organic compounds with a neutral- ionic phase transition coupled to the spontaneous lattice dimerization and to charge transfer excitons. The double nature of the ensemble of excitons leads to an intricate time evolution, in particular, to macroscopic quantum oscillations from the interference between the Bose condensate of excitons and the ground state of the excitonic insulator. The coupling of excitons and the order parameter also leads to self-trapping of their wave function, akin to self-focusing in optics. The locally enhanced density of excitons can surpass a critical value to trigger the phase transformation, even if the mean density is below the required threshold. The system is stratified in domains that evolve through dynamical phase transitions and sequences of merging. The new circumstances in experiments and theory bring to life, once again, some remarkable inventions made by L.V. Keldysh.

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

  17. A Routing Protocol Based on Received Signal Strength for Underwater Wireless Sensor Networks (UWSNs

    Directory of Open Access Journals (Sweden)

    Meiju Li

    2017-11-01

    Full Text Available Underwater wireless sensor networks (UWSNs are featured by long propagation delay, limited energy, narrow bandwidth, high BER (Bit Error Rate and variable topology structure. These features make it very difficult to design a short delay and high energy-efficiency routing protocol for UWSNs. In this paper, a routing protocol independent of location information is proposed based on received signal strength (RSS, which is called RRSS. In RRSS, a sensor node firstly establishes a vector from the node to a sink node; the length of the vector indicates the RSS of the beacon signal (RSSB from the sink node. A node selects the next-hop along the vector according to RSSB and the RSS of a hello packet (RSSH. The node nearer to the vector has higher priority to be a candidate next-hop. To avoid data packets being delivered to the neighbor nodes in a void area, a void-avoiding algorithm is introduced. In addition, residual energy is considered when selecting the next-hop. Meanwhile, we establish mathematic models to analyze the robustness and energy efficiency of RRSS. Lastly, we conduct extensive simulations, and the simulation results show RRSS can save energy consumption and decrease end-to-end delay.

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

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

  20. Dynamics of the Uranian and Saturnian satellite systems - a chaotic route to melting Miranda?

    International Nuclear Information System (INIS)

    Dermott, S.F.; Malhotra, R.B; Murray, C.D.

    1988-01-01

    Miranda's anomalously large inclination, in conjunction with the postaccretional resurfacing of both Miranda and Ariel and anomalously large eccentricities characterizing the inner Uranian satellites, are presently held to suggest the disruption of resonant configurations that once existed in this satellite system. Classical analytical methods for the dynamics of resonance are here used to demonstrate how temporary capture into a second- or higher-order resonance can generate large increases in eccentricity and inclination on comparatively short time-scales. Such capture into resonance may result in chaotic motion. 66 references

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

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

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

  4. Necessity and complexity of order picking routing optimisation based on pallet loading features

    Directory of Open Access Journals (Sweden)

    Bódis Tamás

    2017-12-01

    Full Text Available Order picking is the most labour-intensive and costly activity of warehouses. The main challenges of its improvement are the synchronisation of warehouse layout, storage assignment policy, routing, zoning, and batching. Furthermore, the competitiveness of the warehouse depends on how it adapts to the unique customer demands and product parameters and the changes. The operators usually have to manage the picking sequence based on best practices taking into consideration the product stacking factors and minimising the lead time. It is usually necessary to support the operators by making e ective decisions. Researchers of the pallet loading problem, bin packing problem, and order picking optimisation provide a wide horizon of solutions but their results are rarely synchronised.

  5. A Hybrid Node Scheduling Approach Based on Energy Efficient Chain Routing for WSN

    Directory of Open Access Journals (Sweden)

    Yimei Kang

    2014-04-01

    Full Text Available Energy efficiency is usually a significant goal in wireless sensor networks (WSNs. In this work, an energy efficient chain (EEC data routing approach is first presented. The coverage and connectivity of WSNs are discussed based on EEC. A hybrid node scheduling approach is then proposed. It includes sleep scheduling for cyclically monitoring regions of interest in time-driven modes and wakeup scheduling for tracking emergency events in event-driven modes. A failure rate is introduced to the sleep scheduling to improve the reliability of the system. A wakeup sensor threshold and a sleep time threshold are introduced in the wakeup scheduling to reduce the consumption of energy to the possible extent. The results of the simulation show that the proposed algorithm can extend the effective lifetime of the network to twice that of PEAS. In addition, the proposed methods are computing efficient because they are very simple to implement.

  6. Canadian-based aircrew exposure from cosmic radiation on commercial airline routes

    Energy Technology Data Exchange (ETDEWEB)

    McCall, M.J.; Green, A.R.; Lewis, B.J.; Bennett, L.G.I.; Pierre, M. [Royal Military College of Canada, Kingston, Ontario (Canada); Schrewe, U. [Physikalisch Technische Bundesanstalt, Braunschweig (Germany); O' Brien, K. [Northern Arizona Univ., Flagstaff, Arizona (United States); Feldsberger, E. [University of Graz (Austria)

    2000-07-01

    As part of a continuing study on the occupational exposure of Canadian-based aircrew, a Tissue Equivalent Proportional Counter (TEPC) was used to monitor this exposure on 64 flight routes spanning a range of geomagnetic latitudes between 40{sup o}S and 85{sup o}N. The microdosimetric data obtained from these flights were compared to that obtained from several terrestrial sources and were used to characterize the radiation field at jet altitudes. From 20 000 ambient dose equivalent rates obtained at various altitudes and geomagnetic latitudes, a correlation was developed to allow for the interpolation of the dose rate for any global position, altitude and date. By integration of this dose rate function over a great circle flight path, a predictive code was developed to provide a total ambient dose equivalent prediction for a given flight. (author)

  7. Nonlinear dynamics based digital logic and circuits.

    Science.gov (United States)

    Kia, Behnam; Lindner, John F; Ditto, William L

    2015-01-01

    We discuss the role and importance of dynamics in the brain and biological neural networks and argue that dynamics is one of the main missing elements in conventional Boolean logic and circuits. We summarize a simple dynamics based computing method, and categorize different techniques that we have introduced to realize logic, functionality, and programmability. We discuss the role and importance of coupled dynamics in networks of biological excitable cells, and then review our simple coupled dynamics based method for computing. In this paper, for the first time, we show how dynamics can be used and programmed to implement computation in any given base, including but not limited to base two.

  8. An auxiliary optimization method for complex public transit route network based on link prediction

    Science.gov (United States)

    Zhang, Lin; Lu, Jian; Yue, Xianfei; Zhou, Jialin; Li, Yunxuan; Wan, Qian

    2018-02-01

    Inspired by the missing (new) link prediction and the spurious existing link identification in link prediction theory, this paper establishes an auxiliary optimization method for public transit route network (PTRN) based on link prediction. First, link prediction applied to PTRN is described, and based on reviewing the previous studies, the summary indices set and its algorithms set are collected for the link prediction experiment. Second, through analyzing the topological properties of Jinan’s PTRN established by the Space R method, we found that this is a typical small-world network with a relatively large average clustering coefficient. This phenomenon indicates that the structural similarity-based link prediction will show a good performance in this network. Then, based on the link prediction experiment of the summary indices set, three indices with maximum accuracy are selected for auxiliary optimization of Jinan’s PTRN. Furthermore, these link prediction results show that the overall layout of Jinan’s PTRN is stable and orderly, except for a partial area that requires optimization and reconstruction. The above pattern conforms to the general pattern of the optimal development stage of PTRN in China. Finally, based on the missing (new) link prediction and the spurious existing link identification, we propose optimization schemes that can be used not only to optimize current PTRN but also to evaluate PTRN planning.

  9. Improvement of routes and production of CaSO4-based dosimeters with unusual doping

    International Nuclear Information System (INIS)

    Junot, Danilo Oliveira

    2017-01-01

    The widespread use of ionizing radiation in medicine and industry, associated with the known risks that this type of radiation can cause, has motivated the search for new radiation detectors, seeking improvements in the dosimetric characteristics and in the cost of production in comparison with commercial dosimeters disseminated. The motivation of this work is, therefore, to produce new thermoluminescent detectors through improved routes. Unusual elements in CaSO 4 matrix doping, such as terbium (Tb) and ytterbium (Yb), were used as dopants in this matrix, as well as the europium (Eu), the thulium (Tm) and the silver (Ag), resulting in samples of CaSO 4 :Eu,Tb, CaSO 4 :Tb,Yb, CaSO 4 :Tm,Ag and CaSO 4 :Eu,Ag that were prepared by means of an adaptation of the method developed by Yamashita (1971). The route of synthesis is based on the mixture of calcium carbonate (CaCO 3 ) and dopant oxide (except for silver, incorporated in the form of metallic nanoparticles) in a solution of sulfuric acid. The mixture is heated until all the acid evaporates and only the powder of the material remains. In this route, the sulfuric acid is collected and can be reused. The phosphors produced were characterized by X-ray diffraction and radioluminescence techniques. The silver particles, produced by the polyol method, were characterized by scanning electron microscopy. Composites were obtained from the addition of Teflon to the phosphors. The thermoluminescence (TL) and the optically stimulated luminescence (OSL) of the new materials produced were investigated. Thermoluminescent characteristics such as sensitivity, linearity, reproducibility, minimum detectable dose, kinetic order and fading were evaluated and discussed. The CaSO 4 :Tb,Eu composites showed TL glow curves with peaks at temperatures of 170 °C, 270 °C and 340 °C. The CaSO 4 :Tb,Yb composites presented TL glow curves with peaks at temperatures of 90 °C, 160 °C, 240 °C and 340 °C. CaSO 4 :Tm showed peaks at

  10. Experimental study of dynamic behaviors and routes to chaos in DC-DC boost converters

    International Nuclear Information System (INIS)

    Cafagna, D.; Grassi, G.

    2005-01-01

    This paper illustrates an experimental study of a current-programmed DC-DC boost converter, with the aim of investigating possible pathways through which the converter may enter chaos. In particular, based on experimental measurements, it is shown that variations of input voltage and reference current can generate periodic, subharmonic, quasi-periodic and chaotic behaviors

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

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

  13. Optimized Routing of Intelligent, Mobile Sensors for Dynamic, Data-Driven Sampling

    Science.gov (United States)

    2016-09-27

    a. REPORT b. ABSTRACT c. THIS PAGE 17. LIMITATION OF ABSTRACT Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std. Z39.18 Adobe Professional 7.0...in the domain, as further illustrated in [58, 53]. Traveling as fast as possible may not be the best solu- tion, however, for a nonstationary field...Application I: Wake Estimation and Formation Control 3.1 Aerodynamic Model This section illustrates the DDDAS concept using an observability-based sensor

  14. Potential air pollutant emission from private vehicles based on vehicle route

    Science.gov (United States)

    Huboyo, H. S.; Handayani, W.; Samadikun, B. P.

    2017-06-01

    Air emissions related to the transportation sector has been identified as the second largest emitter of ambient air quality in Indonesia. This is due to large numbers of private vehicles commuting within the city as well as inter-city. A questionnaire survey was conducted in Semarang city involving 711 private vehicles consisting of cars and motorcycles. The survey was conducted in random parking lots across the Semarang districts and in vehicle workshops. Based on the parking lot survey, the average distance private cars travelled in kilometers (VKT) was 17,737 km/year. The machine start-up number of cars during weekdays; weekends were on average 5.19 and 3.79 respectively. For motorcycles the average of kilometers travelled was 27,092 km/year. The machine start-up number of motorcycles during weekdays and weekends were on average 5.84 and 3.98, respectively. The vehicle workshop survey showed the average kilometers travelled to be 9,510 km/year for motorcycles, while for private cars the average kilometers travelled was 21,347 km/year. Odometer readings for private cars showed a maximum of 3,046,509 km and a minimum of 700 km. Meanwhile, for motorcycles, odometer readings showed a maximum of 973,164 km and a minimum of roughly 54.24 km. Air pollutant emissions on East-West routes were generally higher than those on South-North routes. Motorcycles contribute significantly to urban air pollution, more so than cars. In this study, traffic congestion and traffic volume contributed much more to air pollution than the impact of fluctuating terrain.

  15. Alternative electro-chemically based processing routes for joining of plasma facing components

    Energy Technology Data Exchange (ETDEWEB)

    Krauss, Wolfgang, E-mail: wolfgang.krauss@kit.edu [Karlsruhe Institute of Technology (KIT), Institute for Materials Research III, Hermann-von-Helmholtz-Platz 1 76344 Eggenstein-Leopoldshafen (Germany); Lorenz, Julia; Holstein, Nils; Konys, Juergen [Karlsruhe Institute of Technology (KIT), Institute for Materials Research III, Hermann-von-Helmholtz-Platz 1 76344 Eggenstein-Leopoldshafen (Germany)

    2011-10-15

    Tungsten is considered in fusion technology as functional and structural material in the area of blanket and divertor for future application in DEMO. The KIT design of a He-cooled divertor includes joints between W and W-alloys as well as of W with Eurofer-steel. The main challenges range from expansion mismatch problem for tungsten/steel joints over metallurgical reactions with brittle phase formation to crack stopping ability and excellent surface wetting. These requirements were only met partly and insufficiently in the past e.g. by direct Cu-casting of tungsten onto steel. Both, the joining needs and the observed failure scenarios of conventionally joined components initiated the development of improved joining technologies based on electro-chemical processing routes. As electrolytes aqueous and aprotic, water free, system are integrated into this development line. In the first step principle requirements are presented to guarantee a reproducible and adherent deposition of scales based on Ni and Cu acting as inter layers and filler, respectively, to generate a real metallurgical bonding as demonstrate by 1100 deg. C joining tests. The development field aprotic systems based on ionic liquids is discussed with respect to enable development of refractory metal based fillers with focus high temperature W-W brazing.

  16. New routes to the functionalization patterning and manufacture of graphene-based materials for biomedical applications.

    Science.gov (United States)

    De Sanctis, A; Russo, S; Craciun, M F; Alexeev, A; Barnes, M D; Nagareddy, V K; Wright, C D

    2018-06-06

    Graphene-based materials are being widely explored for a range of biomedical applications, from targeted drug delivery to biosensing, bioimaging and use for antibacterial treatments, to name but a few. In many such applications, it is not graphene itself that is used as the active agent, but one of its chemically functionalized forms. The type of chemical species used for functionalization will play a key role in determining the utility of any graphene-based device in any particular biomedical application, because this determines to a large part its physical, chemical, electrical and optical interactions. However, other factors will also be important in determining the eventual uptake of graphene-based biomedical technologies, in particular the ease and cost of manufacture of proposed device and system designs. In this work, we describe three novel routes for the chemical functionalization of graphene using oxygen, iron chloride and fluorine. We also introduce novel in situ methods for controlling and patterning such functionalization on the micro- and nanoscales. Our approaches are readily transferable to large-scale manufacturing, potentially paving the way for the eventual cost-effective production of functionalized graphene-based materials, devices and systems for a range of important biomedical applications.

  17. Prediction-based Dynamic Energy Management in Wireless Sensor Networks

    Science.gov (United States)

    Wang, Xue; Ma, Jun-Jie; Wang, Sheng; Bi, Dao-Wei

    2007-01-01

    Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

  18. Prediction-based Dynamic Energy Management in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Dao-Wei Bi

    2007-03-01

    Full Text Available Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

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

  20. A WEB-BASED FRAMEWORK FOR VISUALIZING INDUSTRIAL SPATIOTEMPORAL DISTRIBUTION USING STANDARD DEVIATIONAL ELLIPSE AND SHIFTING ROUTES OF GRAVITY CENTERS

    Directory of Open Access Journals (Sweden)

    Y. Song

    2017-09-01

    Full Text Available Analysing spatiotemporal distribution patterns and its dynamics of different industries can help us learn the macro-level developing trends of those industries, and in turn provides references for industrial spatial planning. However, the analysis process is challenging task which requires an easy-to-understand information presentation mechanism and a powerful computational technology to support the visual analytics of big data on the fly. Due to this reason, this research proposes a web-based framework to enable such a visual analytics requirement. The framework uses standard deviational ellipse (SDE and shifting route of gravity centers to show the spatial distribution and yearly developing trends of different enterprise types according to their industry categories. The calculation of gravity centers and ellipses is paralleled using Apache Spark to accelerate the processing. In the experiments, we use the enterprise registration dataset in Mainland China from year 1960 to 2015 that contains fine-grain location information (i.e., coordinates of each individual enterprise to demonstrate the feasibility of this framework. The experiment result shows that the developed visual analytics method is helpful to understand the multi-level patterns and developing trends of different industries in China. Moreover, the proposed framework can be used to analyse any nature and social spatiotemporal point process with large data volume, such as crime and disease.

  1. a Web-Based Framework for Visualizing Industrial Spatiotemporal Distribution Using Standard Deviational Ellipse and Shifting Routes of Gravity Centers

    Science.gov (United States)

    Song, Y.; Gui, Z.; Wu, H.; Wei, Y.

    2017-09-01

    Analysing spatiotemporal distribution patterns and its dynamics of different industries can help us learn the macro-level developing trends of those industries, and in turn provides references for industrial spatial planning. However, the analysis process is challenging task which requires an easy-to-understand information presentation mechanism and a powerful computational technology to support the visual analytics of big data on the fly. Due to this reason, this research proposes a web-based framework to enable such a visual analytics requirement. The framework uses standard deviational ellipse (SDE) and shifting route of gravity centers to show the spatial distribution and yearly developing trends of different enterprise types according to their industry categories. The calculation of gravity centers and ellipses is paralleled using Apache Spark to accelerate the processing. In the experiments, we use the enterprise registration dataset in Mainland China from year 1960 to 2015 that contains fine-grain location information (i.e., coordinates of each individual enterprise) to demonstrate the feasibility of this framework. The experiment result shows that the developed visual analytics method is helpful to understand the multi-level patterns and developing trends of different industries in China. Moreover, the proposed framework can be used to analyse any nature and social spatiotemporal point process with large data volume, such as crime and disease.

  2. Multi-Gateway-Based Energy Holes Avoidance Routing Protocol for WSN

    Directory of Open Access Journals (Sweden)

    Rohini Sharma

    2016-04-01

    Full Text Available In wireless sensor networks (WSNs, efficient energy conservation is required to prolong the lifetime of the network. In this work, we have given emphasis on balanced energy consumption and energy holes avoidance. This paper proposes a multi-gateway-based approach to reduce the transmission distance between the sender and the sink node. The area to be monitored is divided into regions and gateway nodes are deployed at optimal positions. We have designed a transmission scheme, in which sensors in the sink region communicate directly to the sink, sensors in the gateway region communicate directly to the gateway, and sensors in the cluster region transmit their data directly to their respective cluster head which transmits data to the gateway in its region. If the distance between a cluster head and the sink is less than the distance between the cluster head and the gateway node, the cluster head transmits data to the sink instead of the gateway node. We have compared the proposed protocol with Low-Energy Adaptive Clustering Hierarchy (LEACH, Gateway Based Energy Aware Multi-Hop Routing (M-GEAR, and Gateway Based Stable Election Protocol (GSEP protocols. The protocol performs better than other protocols in terms of throughput, stability period, lifetime, residual energy, and the packet transmitted to the sink.

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

  4. Investigation of flood routing by a dynamic wave model in trapezoidal channels

    Science.gov (United States)

    Sulistyono, B. A.; Wiryanto, L. H.

    2017-08-01

    The problems of flood wave propagation, in bodies of waters, cause by intense rains or breaking of control structures, represent a great challenge in the mathematical modeling processes. This research concerns about the development and application of a mathematical model based on the Saint Venant's equations, to study the behavior of the propagation of a flood wave in trapezoidal channels. In these equations, the momentum equation transforms to partial differential equation which has two parameters related to cross-sectional area and discharge of the channel. These new formulas have been solved by using an explicit finite difference scheme. In computation procedure, after computing the discharge from the momentum equation, the cross-sectional area will be obtained from the continuity equation for a given point of channel. To evaluate the behavior of the control variables, several scenarios for the main channel as well as for flood waves are considered and different simulations are performed. The simulations demonstrate that for the same bed width, the peak discharge in trapezoidal channel smaller than in rectangular one at a specific distance along the channel length and so, that roughness coefficient and bed slope of the channel play a strong game on the behavior of the flood wave propagation.

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

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

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

  8. OceanRoute: Vessel Mobility Data Processing and Analyzing Model Based on MapReduce

    Science.gov (United States)

    Liu, Chao; Liu, Yingjian; Guo, Zhongwen; Jing, Wei

    2018-06-01

    The network coverage is a big problem in ocean communication, and there is no low-cost solution in the short term. Based on the knowledge of Mobile Delay Tolerant Network (MDTN), the mobility of vessels can create the chances of end-to-end communication. The mobility pattern of vessel is one of the key metrics on ocean MDTN network. Because of the high cost, few experiments have focused on research of vessel mobility pattern for the moment. In this paper, we study the traces of more than 4000 fishing and freight vessels. Firstly, to solve the data noise and sparsity problem, we design two algorithms to filter the noise and complement the missing data based on the vessel's turning feature. Secondly, after studying the traces of vessels, we observe that the vessel's traces are confined by invisible boundary. Thirdly, through defining the distance between traces, we design MR-Similarity algorithm to find the mobility pattern of vessels. Finally, we realize our algorithm on cluster and evaluate the performance and accuracy. Our results can provide the guidelines on design of data routing protocols on ocean MDTN.

  9. SPRINT-SELF: Social-Based Routing and Selfish Node Detection in Opportunistic Networks

    Directory of Open Access Journals (Sweden)

    Radu Ioan Ciobanu

    2015-01-01

    Full Text Available Since mobile devices nowadays have become ubiquitous, several types of networks formed over such devices have been proposed. One such approach is represented by opportunistic networking, which is based on a store-carry-and-forward paradigm, where nodes store data and carry it until they reach a suitable node for forwarding. The problem in such networks is how to decide what the next hop will be, since nodes do not have a global view of the network. We propose using the social network information of a node when performing routing, since a node is more likely to encounter members of its own social community than other nodes. In addition, we approximate a node’s contact as a Poisson distribution and show that we can predict its future behavior based on the contact history. Furthermore, since opportunistic network nodes may be selfish, we improve our solution by adding a selfish node detection and avoidance mechanism, which can help reduce the number of unnecessary messages sent in the network, and thus avoid congestion and decrease battery consumption. We show that our algorithm outperforms existing solutions such as BUBBLE Rap and Epidemic in terms of delivery cost and hit rate, as well as the rate of congestion introduced in the network, by testing in various realistic scenarios.

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

  11. Novel route of synthesis for cellulose fiber-based hybrid polyurethane

    Science.gov (United States)

    Ikhwan, F. H.; Ilmiati, S.; Kurnia Adi, H.; Arumsari, R.; Chalid, M.

    2017-07-01

    Polyurethanes, obtained by the reaction of a diisocyanate compound with bifunctional or multifunctional reagent such as diols or polyols, have been studied intensively and well developed. The wide range modifier such as chemical structures and molecular weight to build polyurethanes led to designs of materials that may easily meet the functional product demand and to the extraordinary spreading of these materials in market. Properties of the obtained polymer are related to the chemical structure of polyurethane backbone. A number polyurethanes prepared from biomass-based monomers have been reported. Cellulose fiber, as a biomass material is containing abundant hydroxyl, promising material as chain extender for building hybrid polyurethanes. In previous researches, cellulose fiber was used as filler in synthesis of polyurethane composites. This paper reported a novel route of hybrid polyurethane synthesis, which a cellulose fiber was used as chain extender. The experiment performed by reacting 4,4’-Methylenebis (cyclohexyl isocyanate) (HMDI) and polyethylene glycol with variation of molecular weight to obtained pre-polyurethane, continued by adding micro fiber cellulose (MFC) with variation of type and composition in the mixture. The experiment was evaluated by NMR, FTIR, SEM and STA measurement. NMR and FTIR confirmed the reaction of the hybrid polyurethane. STA showed hybrid polyurethane has good thermal stability. SEM showed good distribution and dispersion of sorghum-based MFC.

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

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

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    A.V. Sutagundar

    2013-03-01

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

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

  20. Multicolor Tunable Luminescence Based on Tb3+/Eu3+ Doping through a Facile Hydrothermal Route.

    Science.gov (United States)

    Wang, Chao; Zhou, Ting; Jiang, Jing; Geng, Huiyuan; Ning, Zhanglei; Lai, Xin; Bi, Jian; Gao, Daojiang

    2017-08-09

    Ln 3+ -doped fluoride is a far efficient material for realizing multicolor emission, which plays an important part in full-color displays, biolabeling, and MRI. However, studies on the multicolor tuning properties of Ln 3+ -doped fluoride are mainly concentrated on a complicated process using three or more dopants, and the principle of energy transfer mechanism is still unclear. Herein, multicolor tunable emission is successfully obtained only by codoping with Tb 3+ and Eu 3+ ions in β-NaGdF 4 submicrocrystals via a facile hydrothermal route. Our work reveals that various emission colors can be obtained and tuned from red, orange-red, pink, and blue-green to green under single excitation energy via codoping Tb 3+ and Eu 3+ with rationally changed Eu 3+ /Tb 3+ molar ratio due to the energy transfer between Tb 3+ and Eu 3+ ions in the β-NaGdF 4 host matrix. Meanwhile, the energy transfer mechanism in β-NaGdF 4 : x Eu 3+ /y Tb 3+ (x + y = 5 mol %) submicrocrystals is investigated. Our results evidence the potential of the dopants' distribution density as an effective way for analyzing energy transfer and multicolor-controlled mechanism in other rare earth fluoride luminescence materials. Discussions on the multicolor luminescence under a certain dopant concentration based on single host and wavelength excitation are essential toward the goal of the practical applications in the field of light display systems and optoelectronic devices.

  1. An Energy Efficient Stable Election-Based Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Weiwei Yuan

    2013-10-01

    Full Text Available Sensor nodes usually have limited energy supply and they are impractical to recharge. How to balance traffic load in sensors in order to increase network lifetime is a very challenging research issue. Many clustering algorithms have been proposed recently for wireless sensor networks (WSNs. However, sensor networks with one fixed sink node often suffer from a hot spots problem since nodes near sinks have more traffic burden to forward during a multi-hop transmission process. The use of mobile sinks has been shown to be an effective technique to enhance network performance features such as latency, energy efficiency, network lifetime, etc. In this paper, a modified Stable Election Protocol (SEP, which employs a mobile sink, has been proposed for WSNs with non-uniform node distribution. The decision of selecting cluster heads by the sink is based on the minimization of the associated additional energy and residual energy at each node. Besides, the cluster head selects the shortest path to reach the sink between the direct approach and the indirect approach with the use of the nearest cluster head. Simulation results demonstrate that our algorithm has better performance than traditional routing algorithms, such as LEACH and SEP.

  2. Capacitated vehicle routing problem for PSS uses based on ubiquitous computing: An emerging markets approach

    Directory of Open Access Journals (Sweden)

    Alberto Ochoa-Ortíz

    2015-01-01

    Full Text Available El problema de ruteo de vehículos bajo las limitaciones de capacidad y basado en computación ubicua desde una perspectiva relacionada con PSS (Producto-Servicio de Sistemas para desarrollar configuraciones para el transporte urbano de mercancías es abordado. Éste trabajo considera las especificidades de la logística urbana bajo un contexto de mercados emergentes. En este caso, involucra: i bajas competencias logísticas de los tomadores de decisiones; ii la limitada disponibilidad de datos; y iii restringido acceso a tecnología de alto desempeño para calcular rutas de transporte óptimas. Por lo tanto, se propone el uso de un software libre que proporciona soluciones de bajo costo (en tiempo y recursos. El artículo muestra la aplicación de los resultados de una herramienta de software basado en la Teoría de Grafos utilizado para analizar y resolver un CVRP (Capacitated Vehicle Routing Problem. Se utilizó el caso de una empresa local de distribución de alimentos situada en una gran ciudad de México. Sobre la base de una flora de vehículos pequeños, todos con las mismas especificaciones técnicas y una capacidad de carga comparable.

  3. An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks

    Directory of Open Access Journals (Sweden)

    Naixue Xiong

    2017-06-01

    Full Text Available A social network is a social structure, which is organized by the relationships or interactions between individuals or groups. Humans link the physical network with social network, and the services in the social world are based on data and analysis, which directly influence decision making in the physical network. In this paper, we focus on a routing optimization algorithm, which solves a well-known and popular problem. Ant colony algorithm is proposed to solve this problem effectively, but random selection strategy of the traditional algorithm causes evolution speed to be slow. Meanwhile, positive feedback and distributed computing model make the algorithm quickly converge. Therefore, how to improve convergence speed and search ability of algorithm is the focus of the current research. The paper proposes the improved scheme. Considering the difficulty about searching for next better city, new parameters are introduced to improve probability of selection, and delay convergence speed of algorithm. To avoid the shortest path being submerged, and improve sensitive speed of finding the shortest path, it updates pheromone regulation formula. The results show that the improved algorithm can effectively improve convergence speed and search ability for achieving higher accuracy and optimal results.

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

  5. Dynamic airspace configuration method based on a weighted graph model

    Directory of Open Access Journals (Sweden)

    Chen Yangzhou

    2014-08-01

    Full Text Available This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent those key points such as airports, waypoints, and the edges represent those air routes. Those vertices are used as the sites of Voronoi diagram, which divides the airspace into units called as cells. Then, aircraft counts of both each cell and of each air-route are computed. Thus, by assigning both the vertices and the edges with those aircraft counts, a weighted graph model comes into being. Accordingly the airspace configuration problem is described as a weighted graph partitioning problem. Then, the problem is solved by a graph partitioning algorithm, which is a mixture of general weighted graph cuts algorithm, an optimal dynamic load balancing algorithm and a heuristic algorithm. After the cuts algorithm partitions the model into sub-graphs, the load balancing algorithm together with the heuristic algorithm transfers aircraft counts to balance workload among sub-graphs. Lastly, airspace configuration is completed by determining the sector boundaries. The simulation result shows that the designed sectors satisfy not only workload balancing condition, but also the constraints such as convexity, connectivity, as well as minimum distance constraint.

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

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

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

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

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

  11. Energy neutral protocol based on hierarchical routing techniques for energy harvesting wireless sensor network

    Science.gov (United States)

    Muhammad, Umar B.; Ezugwu, Absalom E.; Ofem, Paulinus O.; Rajamäki, Jyri; Aderemi, Adewumi O.

    2017-06-01

    Recently, researchers in the field of wireless sensor networks have resorted to energy harvesting techniques that allows energy to be harvested from the ambient environment to power sensor nodes. Using such Energy harvesting techniques together with proper routing protocols, an Energy Neutral state can be achieved so that sensor nodes can run perpetually. In this paper, we propose an Energy Neutral LEACH routing protocol which is an extension to the traditional LEACH protocol. The goal of the proposed protocol is to use Gateway node in each cluster so as to reduce the data transmission ranges of cluster head nodes. Simulation results show that the proposed routing protocol achieves a higher throughput and ensure the energy neutral status of the entire network.

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

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

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

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

  16. Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows

    OpenAIRE

    Sala Reixach, Joan

    2012-01-01

    El projecte es centra en el "Vehicle Routing Problem with Time Windows". Explora i testeja un mètode basat en una formulació del problema en termes de programació de restriccions. Implementa un mètode de cerca local amb la capacitat de fer grans moviments anomenat "Large Neighbourhood Search".

  17. A rational route to SCM materials based on a 1-D cobalt selenocyanato coordination polymer.

    Science.gov (United States)

    Boeckmann, Jan; Näther, Christian

    2011-07-07

    Thermal annealing of a discrete complex with terminal SeCN anions and monodentate coligands enforces the formation of a 1D cobalt selenocyanato coordination polymer that shows slow relaxation of the magnetization. Therefore, this approach offers a rational route to 1D materials that might show single chain magnetic behaviour. This journal is © The Royal Society of Chemistry 2011

  18. Analysis of inertia thresholds based on real-world route choice data

    NARCIS (Netherlands)

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

    2014-01-01

    In the context of route choice, inertial behaviour shows that drivers make choices that are satisfactory rather than optimal. Consequently, drivers may not necessarily alter their choice when confronted with a travel time increase on the current choice or a travel time decrease of a choice

  19. Development of Fe/Nb-based solar photocatalysts for water treatment: impact of different synthesis routes on materials properties.

    Science.gov (United States)

    Ribeiro, Marília C M; Amorim, Camila C; Moreira, Regina F P M; Oliveira, Luiz C A; Henriques, Andréia B; Leão, Mônica M D

    2018-04-27

    Semiconductors based on Fe/Nb oxides can present both solar sensitivity and high catalytic activity. However, there is still a lack regarding the comparison between different routes to produce Fe/Nb-based solar photocatalysts and the evaluation of the impact of the synthesis operating conditions on the material properties. In this work, Fe/Nb 2 O 5 ratio, type of precipitating agent, presence/absence of washing stage, and temperature of calcination were verified to be the most relevant parameters in the synthesis by the co-precipitation method. These factors led to remarkable differences in the properties and performance of the photocatalysts produced by each distinct synthesis route. Composition, iron species present in the materials, crystallinity characteristics, and pH of the catalysts were affected, leading to different photocatalytic activities under UV-Vis light. Due to their characteristics, the synthesized materials are potential photocatalysts for application in solar processes. Graphical abstract ᅟ.

  20. "I CAMMINI DELLA REGINA" - Open Source based tools for preserving and culturally exploring historical traffic routes.

    Science.gov (United States)

    Cannata, Massimiliano; Colombo, Massimo; Antonovic, Milan; Cardoso, Mirko; Delucchi, Andrea; Gianocca, Giancarlo; Brovelli, Maria Antonia

    2015-04-01

    "I CAMMINI DELLA REGINA" (The Via Regina Paths) is an Interreg project funded within the transnational cooperation program between Italy and Switzerland 2007-2013. The aim of this project is the preservation and valorization of the cultural heritage linked to the walking historically paths crossing, connecting and serving the local territories. With the approach of leveraging the already existing tools, which generally consist of technical descriptions of the paths, the project uses the open source geospatial technologies to deploy innovative solutions which can fill some of the gaps in historical-cultural tourism offers. The Swiss part, and particularly the IST-SUPSI team, has been focusing its activities in the realization of two innovative solutions: a mobile application for the survey of historical paths and a storytelling system for immersive cultural exploration of the historical paths. The former, based on Android, allows to apply in a revised manner a consolidated and already successfully used methodology of survey focused on the conservation of the historical paths (Inventory of historical traffic routes in Switzerland). Up to now operators could rely only on hand work based on a combination of notes, pictures and GPS devices synthesized in manually drawn maps; this procedure is error prone and shows many problems both in data updating and extracting for elaborations. Thus it has been created an easy to use interface which allows to map, according to a newly developed spatially enabled data model, paths, morphological elements, and multimedia notes. When connected to the internet the application can send the data to a web service which, after applying linear referencing and further elaborating the data, makes them available using open standards. The storytelling system has been designed to provide users with cultural insights embedded in a multimedial and immersive geospatial portal. Whether the tourist is exploring physically or virtually the desired

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

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

    NARCIS (Netherlands)

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

    2012-01-01

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

  3. Personal computer based decision support system for routing nuclear spent fuel

    International Nuclear Information System (INIS)

    Chin, Shih-Miao; Joy, D.S.; Johnson, P.E.; Bobic, S.M.; Miaou, Shaw-Pin

    1989-01-01

    An approach has been formulated to route nuclear spent fuel over the US Interstate highway network. This approach involves the generation of alternative routes so that any potential adverse impacts will not only concentrate on regions along the shortest path between the nuclear power plant and repository. Extensive literature research on the shortest path finding algorithms has been carried out. Consequently, an extremely efficient shortest path algorithm has been implemented and significantly increases the overall system performance. State-of-the-art interactive computer graphics is used. In addition to easy-to-use pop-up menus, full color mapping and display capabilities are also incorporated. All of these features have been implemented on commonly available personal computers. 6 figs., 2 tabs

  4. Comparison of MANET Routing Protocols in Different Traffic and Mobility Models

    Directory of Open Access Journals (Sweden)

    J. Baraković

    2010-06-01

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

  5. Thermosensitive PLA based nanodispersion for targeting brain tumor via intranasal route

    International Nuclear Information System (INIS)

    Jain, Darshana S.; Bajaj, Amrita N.; Athawale, Rajani B.; Shikhande, Shruti S.; Pandey, Abhijeet; Goel, Peeyush N.; Gude, Rajiv P.; Patil, Satish; Raut, Preeti

    2016-01-01

    Delivery of drugs to the brain via nasal route has been studied by many researchers. However, low residence time, mucociliary clearance and enzymatically active environment of nasal cavity pose many challenges to successful nasal delivery of drugs. We aim to deliver methotrexate by designing thermosensitive nanodispersion exhibiting enhanced residence time in nasal cavity and bypassing the blood brain barrier (BBB). PLA nanoparticles were developed using solvent evaporation technique. The developed nanoparticles were further dispersed in prepared thermosensitive vehicle of poloxamer 188 and Carbopol 934 to impart the property of increased residence time. The formulated nanoparticles demonstrated no interaction with the simulated nasal fluids (SNF), mucin, serum proteins and erythrocytes which demonstrate the safety of developed formulation for nasal administration. The penetration property of nanoparticles though the nasal mucosa was higher than the pure drug due to low mucociliary clearance. The developed nanoparticles diffused though the membrane pores and rapidly distributed into the brain portions compared to the pure drug. There was detectable and quantifiable amount of drug seen in the brain as demonstrated by in vivo brain distribution studies with considerably low amount of drug deposition in the lungs. The pharmacokinetic parameters demonstrated the enhancement in circulation half life, area under curve (AUC) and Cmax of the drug when administered intranasal in encapsulated form. Thus, the thermosensitive nanodispersions are surely promising delivery systems for delivering anticancer agents though the nasal route for potential treatment of brain tumors. - Highlights: • The present investigation explores intra-nasal route as potential route for targeting brain tumor. • Thermosensitive nanodispersion has been formulated for enhancing nasal residence time. • PLA nanoparticles enhance penetration into the brain owing to hydrophobic nature and small size

  6. Thermosensitive PLA based nanodispersion for targeting brain tumor via intranasal route

    Energy Technology Data Exchange (ETDEWEB)

    Jain, Darshana S., E-mail: darshanaj_cup@yahoo.com [C.U. Shah College of Pharmacy, S.N.D.T Women' s University, Juhu Tara Road, Santacruz (West), Mumbai 400 049 (India); Bajaj, Amrita N. [C.U. Shah College of Pharmacy, S.N.D.T Women' s University, Juhu Tara Road, Santacruz (West), Mumbai 400 049 (India); Athawale, Rajani B., E-mail: rajani.athawale@gmail.com [C.U. Shah College of Pharmacy, S.N.D.T Women' s University, Juhu Tara Road, Santacruz (West), Mumbai 400 049 (India); Shikhande, Shruti S. [C.U. Shah College of Pharmacy, S.N.D.T Women' s University, Juhu Tara Road, Santacruz (West), Mumbai 400 049 (India); Pandey, Abhijeet [H. R Patel Institute of Pharmaceutical Education and Research, Shirpur, Maharashtra (India); Goel, Peeyush N.; Gude, Rajiv P. [Gude Lab, Advanced Centre for Treatment, Research & Education in Cancer (ACTREC), Tata Memorial Centre, Kharghar, Navi Mumbai 410 210 (India); Patil, Satish; Raut, Preeti [Cipla Pvt. Ltd., Vikhroli (West), Mumbai (India)

    2016-06-01

    Delivery of drugs to the brain via nasal route has been studied by many researchers. However, low residence time, mucociliary clearance and enzymatically active environment of nasal cavity pose many challenges to successful nasal delivery of drugs. We aim to deliver methotrexate by designing thermosensitive nanodispersion exhibiting enhanced residence time in nasal cavity and bypassing the blood brain barrier (BBB). PLA nanoparticles were developed using solvent evaporation technique. The developed nanoparticles were further dispersed in prepared thermosensitive vehicle of poloxamer 188 and Carbopol 934 to impart the property of increased residence time. The formulated nanoparticles demonstrated no interaction with the simulated nasal fluids (SNF), mucin, serum proteins and erythrocytes which demonstrate the safety of developed formulation for nasal administration. The penetration property of nanoparticles though the nasal mucosa was higher than the pure drug due to low mucociliary clearance. The developed nanoparticles diffused though the membrane pores and rapidly distributed into the brain portions compared to the pure drug. There was detectable and quantifiable amount of drug seen in the brain as demonstrated by in vivo brain distribution studies with considerably low amount of drug deposition in the lungs. The pharmacokinetic parameters demonstrated the enhancement in circulation half life, area under curve (AUC) and Cmax of the drug when administered intranasal in encapsulated form. Thus, the thermosensitive nanodispersions are surely promising delivery systems for delivering anticancer agents though the nasal route for potential treatment of brain tumors. - Highlights: • The present investigation explores intra-nasal route as potential route for targeting brain tumor. • Thermosensitive nanodispersion has been formulated for enhancing nasal residence time. • PLA nanoparticles enhance penetration into the brain owing to hydrophobic nature and small size

  7. Opinion dynamics model based on quantum formalism

    Energy Technology Data Exchange (ETDEWEB)

    Artawan, I. Nengah, E-mail: nengahartawan@gmail.com [Theoretical Physics Division, Department of Physics, Udayana University (Indonesia); Trisnawati, N. L. P., E-mail: nlptrisnawati@gmail.com [Biophysics, Department of Physics, Udayana University (Indonesia)

    2016-03-11

    Opinion dynamics model based on quantum formalism is proposed. The core of the quantum formalism is on the half spin dynamics system. In this research the implicit time evolution operators are derived. The analogy between the model with Deffuant dan Sznajd models is discussed.

  8. An IPv6 routing lookup algorithm using weight-balanced tree based on prefix value for virtual router

    Science.gov (United States)

    Chen, Lingjiang; Zhou, Shuguang; Zhang, Qiaoduo; Li, Fenghua

    2016-10-01

    Virtual router enables the coexistence of different networks on the same physical facility and has lately attracted a great deal of attention from researchers. As the number of IPv6 addresses is rapidly increasing in virtual routers, designing an efficient IPv6 routing lookup algorithm is of great importance. In this paper, we present an IPv6 lookup algorithm called weight-balanced tree (WBT). WBT merges Forwarding Information Bases (FIBs) of virtual routers into one spanning tree, and compresses the space cost. WBT's average time complexity and the worst case time complexity of lookup and update process are both O(logN) and space complexity is O(cN) where N is the size of routing table and c is a constant. Experiments show that WBT helps reduce more than 80% Static Random Access Memory (SRAM) cost in comparison to those separation schemes. WBT also achieves the least average search depth comparing with other homogeneous algorithms.

  9. An Investigation of Immunogenicity of Chitosan-Based Botulinum Neurotoxin E Binding Domain Recombinant Candidate Vaccine via Mucosal Route

    Directory of Open Access Journals (Sweden)

    Mohammad Javad Bagheripour

    2017-01-01

    Full Text Available Background and Objectives: Botulism syndrome is caused by serotypes A-G of neurotoxins of Clostridium genus. Neurotoxin binding domain is an appropriate vaccine candidate due to its immunogenic activity. In this study, the immunogenicity of chitosan-based botulinum neurotoxin E binding domain recombinant candidate vaccine was investigated via mucosal route of administration. Methods: In this experimental study, chitosan nanoparticles containing rBoNT/E protein were synthesized by ionic gelation method and were administered orally and intranasally to mice. After each administration, IgG antibody titer was measured by ELISA method. Finally, all groups were challenged with active botulinum neurotoxin type E. Data were analyzed using Duncan and repeated ANOVA tests. The significance level was considered as p0.05, even intranasal route reduced the immunogenicity.

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

  11. Distribution Route Planning of Clean Coal Based on Nearest Insertion Method

    Science.gov (United States)

    Wang, Yunrui

    2018-01-01

    Clean coal technology has made some achievements for several ten years, but the research in its distribution field is very small, the distribution efficiency would directly affect the comprehensive development of clean coal technology, it is the key to improve the efficiency of distribution by planning distribution route rationally. The object of this paper was a clean coal distribution system which be built in a county. Through the surveying of the customer demand and distribution route, distribution vehicle in previous years, it was found that the vehicle deployment was only distributed by experiences, and the number of vehicles which used each day changed, this resulted a waste of transport process and an increase in energy consumption. Thus, the mathematical model was established here in order to aim at shortest path as objective function, and the distribution route was re-planned by using nearest-insertion method which been improved. The results showed that the transportation distance saved 37 km and the number of vehicles used had also been decreased from the past average of 5 to fixed 4 every day, as well the real loading of vehicles increased by 16.25% while the current distribution volume staying same. It realized the efficient distribution of clean coal, achieved the purpose of saving energy and reducing consumption.

  12. Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jianpo Li

    2014-01-01

    Full Text Available Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

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

  14. Optimization of the Municipal Waste Collection Route Based on the Method of the Minimum Pairing

    Directory of Open Access Journals (Sweden)

    Michal Petřík

    2016-01-01

    Full Text Available In the present article is shown the use of Maple program for processing of data describing the position of municipal waste sources and topology of collecting area. The data are further processed through the use of graph theory algorithms, which enable creation of collection round proposal. In this case study is described method of waste pick-up solution in a certain village of approx. 1,600 inhabitants and built-up area of approx. 30 hectares. Village has approx. 11.5 kilometers of ride able routes, with approx. 1 kilometer without waste source. The first part shows topology of the village in light of location of waste sources and capacity of the routes. In the second part are topological data converted into data that can be processed by use of the Graph Theory and the correspondent graph is shown. Optimizing collection route in a certain graph means to find the Euler circle. However, this circle can be constructed only on condition that all the vertices of the graph are of an even degree. Practically this means that is necessary to introduce auxiliary edges – paths that will be passed twice. These paths will connect vertices with odd values. The optimal solution then requires that the total length of the inserted edges was minimal possible, which corresponds to the minimum pairing method. As it is a problem of exponential complexity, it is necessary to make some simplifications. These simplifications are depicted graphically and the results are displayed in the conclusion. The resulting graph with embedded auxiliary edges can be used as a basic decision making material for creation of real collection round that respects local limitations such as one way streets or streets where is the waste collection is not possible from both sides at the same time.

  15. A generic methodology for processing route synthesis and design based on superstructure optimization

    DEFF Research Database (Denmark)

    Bertran, Maria-Ona; Frauzem, Rebecca; Sanchez-Arcilla, Ana Sofia

    2017-01-01

    a specially developed knowledge representation system, and (2) Super-O, a software interface that guides users through the formulation and solution of synthesis problems. Super-O transfers data between the different tools, including a library of generic models, representing a wide range of processing options...... are resolved and targets for improvement are identified through the use of integrated tools. In Stage 3, new alternatives are generated using the selected route and the previously identified targets. In addition to the various computer-aided tools, two special tools are presented: (1) a database employing...

  16. On Reliable and Efficient Data Gathering Based Routing in Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Tayyaba Liaqat

    2016-08-01

    Full Text Available This paper presents cooperative routing scheme to improve data reliability. The proposed protocol achieves its objective, however, at the cost of surplus energy consumption. Thus sink mobility is introduced to minimize the energy consumption cost of nodes as it directly collects data from the network nodes at minimized communication distance. We also present delay and energy optimized versions of our proposed RE-AEDG to further enhance its performance. Simulation results prove the effectiveness of our proposed RE-AEDG in terms of the selected performance matrics.

  17. On Reliable and Efficient Data Gathering Based Routing in Underwater Wireless Sensor Networks.

    Science.gov (United States)

    Liaqat, Tayyaba; Akbar, Mariam; Javaid, Nadeem; Qasim, Umar; Khan, Zahoor Ali; Javaid, Qaisar; Alghamdi, Turki Ali; Niaz, Iftikhar Azim

    2016-08-30

    This paper presents cooperative routing scheme to improve data reliability. The proposed protocol achieves its objective, however, at the cost of surplus energy consumption. Thus sink mobility is introduced to minimize the energy consumption cost of nodes as it directly collects data from the network nodes at minimized communication distance. We also present delay and energy optimized versions of our proposed RE-AEDG to further enhance its performance. Simulation results prove the effectiveness of our proposed RE-AEDG in terms of the selected performance matrics.

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

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

  20. Wake-based ship route estimation in high-resolution SAR images

    Science.gov (United States)

    Graziano, M. Daniela; Rufino, Giancarlo; D'Errico, Marco

    2014-10-01

    This paper presents a novel algorithm for wake detection in Synthetic Aperture Radar images of the sea. The algorithm has been conceived as part of a ship traffic monitoring system, in charge of ship detection validation and to estimate ship route features, such as heading and ground speed. In addition, it has been intended to be adequate for inclusion in an automatic procedure without human operator supervision. The algorithm exploits the Radon transform to identify the images ship wake on the basis of the well known theoretical characteristics of the wakes' geometry and components, that are the turbulent wake, the narrow-V wakes, and the Kelvin arms, as well as the typical appearance of such components in Synthetic Aperture Radar images of the sea as bright or dark linear feature. Examples of application to high-resolution X-band Synthetic Aperture Radar products (COSMOSkymed and TerraSAR-X) are reported, both for wake detection and ship route estimation, showing the achieved quality and reliability of wake detection, adequacy to automatic procedures, as well as speed measure accuracy.

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

  2. Electrohydrodynamic bubbling: an alternative route to fabricate porous structures of silk fibroin based materials.

    Science.gov (United States)

    Ekemen, Zeynep; Ahmad, Zeeshan; Stride, Eleanor; Kaplan, David; Edirisinghe, Mohan

    2013-05-13

    Conventional fabrication techniques and structures employed in the design of silk fibroin (SF) based porous materials provide only limited control over pore size and require several processing stages. In this study, it is shown that, by utilizing electrohydrodynamic bubbling, not only can new hollow spherical structures of SF be formed in a single step by means of bubbles, but the resulting bubbles can serve as pore generators when dehydrated. The bubble characteristics can be controlled through simple adjustments to the processing parameters. Bubbles with diameters in the range of 240-1000 μm were fabricated in controlled fashion. FT-IR characterization confirmed that the rate of air infused during processing enhanced β-sheet packing in SF at higher flow rates. Dynamic mechanical analysis also demonstrated a correlation between air flow rate and film tensile strength. Results indicate that electrohydrodynamically generated SF and their composite bubbles can be employed as new tools to generate porous structures in a controlled manner with a range of potential applications in biocoatings and tissue engineering scaffolds.

  3. A Dynamic Probabilistic Based Broadcasting Scheme for MANETs

    Science.gov (United States)

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

    2016-01-01

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

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

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

  6. Multilevel QoS-policy-based routing management architecture appropriate for heterogeneous network environments

    Science.gov (United States)

    Chatzaki, Magda; Sartzetakis, Stelios

    1998-09-01

    As telecom providers introduce new and more sophisticated services the necessity of a global, unified view of the network infrastructure becomes demanding. Today, heterogenous backbone networks are interconnected in order to provide global connectivity. Due to technological impairments the cost of network operation, the maintenance complexity and the overuse of resources are extremely high under the goal of supporting the diverting customer requirements. We propose a scheme for ATM QoS support in such heterogenous, multi-domain, multi-technology network environment. The objective is to optimize users' and networks' profits by giving them the opportunity to satisfy their requirements. Our approach introduces a manager able to take routing decisions supporting quality of service guarantees for the customers, while making efficient use of network resources.

  7. A dewetting route to grow heterostructured nanoparticles based on thin film heterojunctions.

    Science.gov (United States)

    Li, Junjie; Yin, Deqiang; Li, Qiang; Chen, Chunlin; Huang, Sumei; Wang, Zhongchang

    2015-12-21

    Heterostructured nanoparticles have received considerable attention for their various applications due to their unique and tunable functionalities with respect to their individual bulk constituents. However, the current wet chemical synthesis of multicomponent heterostructured nanoparticles is rather complicated. Here, we report a simple and quick method to fabricate Co-Au dumbbell arrays by dewetting Co/Au heterojunctions on a Si substrate and demonstrate that the Co-Au dumbbells vary in size from 2 to 28 nm. We further show by chemical mapping that Co bells are covered by a pseudomorphic Au wetting layer of ∼4 Å, preventing the bells from oxidation. By controlling the thickness of metal heterojunctions and the annealing time, the morphology of the Co-Au nanoparticle is found to be transformed from the dumbbell to the core shell. This facile route is demonstrated to be useful for fabricating other metal-metal and metal-oxide heterostructures and hence holds technological promise for functional applications.

  8. CREATING A RISK-BASED NETWORK FOR HAZMAT LOGISTICS BY ROUTE PRIORITIZATION WITH AHP

    Directory of Open Access Journals (Sweden)

    Watchara SATTAYAPRASERT

    2008-01-01

    A mathematical model, formulated by the criteria priority of each factor and its risk level was used for the prioritization. The results show that participants rank the risk of having a road accident as the top priority, followed by the risk of carriage unit explosion and the consequences of an incident (47.8%, 27.4% and 24.8% respectively. To examine this model, data for logistics of gasoline and diesel fuel in Rayong Province (Thailand were used for the model application. From the calculation, it was possible to reduce the risk of road accidents and the consequences by approximately 6.8% and 38.5% respectively by choosing the best alternative route instead of the current one.

  9. Similarity-Based Prediction of Travel Times for Vehicles Traveling on Known Routes

    DEFF Research Database (Denmark)

    Tiesyte, Dalia; Jensen, Christian Søndergaard

    2008-01-01

    , historical data in combination with real-time data may be used to predict the future travel times of vehicles more accurately, thus improving the experience of the users who rely on such information. We propose a Nearest-Neighbor Trajectory (NNT) technique that identifies the historical trajectory......The use of centralized, real-time position tracking is proliferating in the areas of logistics and public transportation. Real-time positions can be used to provide up-to-date information to a variety of users, and they can also be accumulated for uses in subsequent data analyses. In particular...... of vehicles that travel along known routes. In empirical studies with real data from buses, we evaluate how well the proposed distance functions are capable of predicting future vehicle movements. Second, we propose a main-memory index structure that enables incremental similarity search and that is capable...

  10. Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sarvesh Varatharajan

    2009-10-01

    Full Text Available We consider the problem of all-to-one selfish routing in the absence of a payment scheme in wireless sensor networks, where a natural model for cost is the power required to forward, referring to the resulting game as a Locally Minimum Cost Forwarding (LMCF. Our objective is to characterize equilibria and their global costs in terms of stretch and diameter, in particular finding incentive compatible algorithms that are also close to globally optimal. We find that although social costs for equilibria of LMCF exhibit arbitrarily bad worst-case bounds and computational infeasibility of reaching optimal equilibria, there exist greedy and local incentive compatible heuristics achieving near-optimal global costs.

  11. Robustness of airline route networks

    Science.gov (United States)

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

    2016-03-01

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

  12. Vehicular Networking Enhancement And Multi-Channel Routing Optimization, Based on Multi-Objective Metric and Minimum Spanning Tree

    Directory of Open Access Journals (Sweden)

    Peppino Fazio

    2013-01-01

    Full Text Available Vehicular Ad hoc NETworks (VANETs represent a particular mobile technology that permits the communication among vehicles, offering security and comfort. Nowadays, distributed mobile wireless computing is becoming a very important communications paradigm, due to its flexibility to adapt to different mobile applications. VANETs are a practical example of data exchanging among real mobile nodes. To enable communications within an ad-hoc network, characterized by continuous node movements, routing protocols are needed to react to frequent changes in network topology. In this paper, the attention is focused mainly on the network layer of VANETs, proposing a novel approach to reduce the interference level during mobile transmission, based on the multi-channel nature of IEEE 802.11p (1609.4 standard. In this work a new routing protocol based on Distance Vector algorithm is presented to reduce the delay end to end and to increase packet delivery ratio (PDR and throughput in VANETs. A new metric is also proposed, based on the maximization of the average Signal-to-Interference Ratio (SIR level and the link duration probability between two VANET nodes. In order to relieve the effects of the co-channel interference perceived by mobile nodes, transmission channels are switched on a basis of a periodical SIR evaluation. A Network Simulator has been used for implementing and testing the proposed idea.

  13. An efficient routing algorithm for event based monitoring in a plant using virtual sink nodes in a wireless sensor network

    International Nuclear Information System (INIS)

    Jain, Sanjay Kumar; Vietla, Srinivas; Roy, D.A.; Biswas, B.B.; Pithawa, C.K.

    2010-01-01

    A Wireless Sensor Network is a collection of wireless sensor nodes arranged in a self-forming network without aid of any infrastructure or administration. The individual nodes have limited resources and hence efficient communication mechanisms between the nodes have to be devised for continued operation of the network in a plant environment. In wireless sensor networks a sink node or base station at one end acts as the recipient of information gathered by all other sensor nodes in the network and the information arrives at the sink through multiple hops across the nodes of the network. A routing algorithm has been developed in which a virtual sink node is generated whenever hop count of an ordinary node crosses a certain specified value. The virtual sink node acts as a recipient node for data of all neighboring nodes. This virtual sink helps in reducing routing overhead, especially when the sensor network is scaled to a larger network. The advantages with this scheme are less energy consumption, reduced congestion in the network and longevity of the network. The above algorithm is suitable for event based or interval based monitoring systems in nuclear plants. This paper describes the working of the proposed algorithm and provides its implementation details. (author)

  14. A Data-Gathering Scheme with Joint Routing and Compressive Sensing Based on Modified Diffusion Wavelets in Wireless Sensor Networks.

    Science.gov (United States)

    Gu, Xiangping; Zhou, Xiaofeng; Sun, Yanjing

    2018-02-28

    Compressive sensing (CS)-based data gathering is a promising method to reduce energy consumption in wireless sensor networks (WSNs). Traditional CS-based data-gathering approaches require a large number of sensor nodes to participate in each CS measurement task, resulting in high energy consumption, and do not guarantee load balance. In this paper, we propose a sparser analysis that depends on modified diffusion wavelets, which exploit sensor readings' spatial correlation in WSNs. In particular, a novel data-gathering scheme with joint routing and CS is presented. A modified ant colony algorithm is adopted, where next hop node selection takes a node's residual energy and path length into consideration simultaneously. Moreover, in order to speed up the coverage rate and avoid the local optimal of the algorithm, an improved pheromone impact factor is put forward. More importantly, theoretical proof is given that the equivalent sensing matrix generated can satisfy the restricted isometric property (RIP). The simulation results demonstrate that the modified diffusion wavelets' sparsity affects the sensor signal and has better reconstruction performance than DFT. Furthermore, our data gathering with joint routing and CS can dramatically reduce the energy consumption of WSNs, balance the load, and prolong the network lifetime in comparison to state-of-the-art CS-based methods.

  15. Optimizing well intervention routes

    Energy Technology Data Exchange (ETDEWEB)

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

    2000-07-01

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

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

    OpenAIRE

    Jong-Ho Nam; Inha Park; Ho Jin Lee; Mi Ok Kwon; Kyungsik Choi; Young-Kyo Seo

    2013-01-01

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

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

  18. Dynamic Control Based Photovoltaic Illuminating System

    Directory of Open Access Journals (Sweden)

    Zhang Chengkai

    2016-01-01

    Full Text Available Smart LED illumination system can use the power from whether the photovoltaic cell or the power grid automatically based on the SOC (State Of Charge of the photovoltaic cell. This paper proposes a feedback control of the photovoltaic cells and a dynamic control strategy for the Energy system. The dynamic control strategy is used to determine the switching state of the photovoltaic cell based on the illumination load in the past one hour and the battery capacity. These controls are manifested by experimental prototype that the control scheme is correct and effective.

  19. Applying self-organizing map and modified radial based neural network for clustering and routing optimal path in wireless network

    Science.gov (United States)

    Hoomod, Haider K.; Kareem Jebur, Tuka

    2018-05-01

    Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network research and consist of active nodes that can be in motion freely. Because it consider very important problem in this network, we suggested proposed method based on modified radial basis function networks RBFN and Self-Organizing Map SOM. These networks can be improved by the use of clusters because of huge congestion in the whole network. In such a system, the performance of MANET is improved by splitting the whole network into various clusters using SOM. The performance of clustering is improved by the cluster head selection and number of clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. Proposed routing algorithm depends on the group of factors and parameters to select the path between two points in the wireless network. The SOM clustering average time (1-10 msec for stall nodes) and (8-75 msec for mobile nodes). While the routing time range (92-510 msec).The proposed system is faster than the Dijkstra by 150-300%, and faster from the RBFNN (without modify) by 145-180%.

  20. Diesel supply planning for offshore platforms by a mathematical model based on the vehicle routing problem with replenishment

    Energy Technology Data Exchange (ETDEWEB)

    Fiorot Astoures, H.; Alvarenga Rosa, R. de; Silva Rosa, A.

    2016-07-01

    Oil exploration in Brazil is mainly held by offshore platforms which require the supply of several products, including diesel to maintain its engines. One strategy to supply diesel to the platforms is to keep a vessel filled with diesel nearby the exploration basin. An empty boat leaves the port and goes directly to this vessel, then it is loaded with diesel. After that, it makes a trip to supply the platforms and when the boat is empty, it returns to the vessel to be reloaded with more diesel going to another trip. Based on this description, this paper proposes a mathematical model based on the Vehicle Routing Problem with Intermediate Replenishment Facilities (VRPIRF) to solve the problem. The purpose of the model is to plan the routes for the boats to meet the diesel requests of the platform. Given the fact that in the literature, papers about the VRPIRF are scarce and papers about the VRPIRF applied to offshore platforms were not found in the published papers, this paper is important to contribute with the evolution of this class of problem, bringing also a solution for a real application that is very important for the oil and gas business. The mathematical model was tested using the CPLEX 12.6. In order to assess the mathematical model, tests were done with data from the major Brazilian oil and gas company and several strategies were tested. (Author)

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

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

    Science.gov (United States)

    2009-11-01

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

  3. submitter Development of a processing route for carbon allotrope-based TiC porous nanocomposites

    CERN Document Server

    Ramos, J P; Stora, T; Fernandes, C M; Bowen, P

    2017-01-01

    Ti-foils are currently used as a spallation target material to produce radioisotopes for physics research at the ISOLDE facility at CERN. However, radioisotope production rates often decrease over time due to material degradation from high operation temperatures. Due to enhanced release rates, porous nanomaterials are being studied as spallation target materials for isotope production. TiC is a material with a very high melting point making it an interesting material to replace the Ti-foils. However, in its nanometric form it sinters readily at high temperatures. To overcome this, a new processing route was developed where TiC was co-milled with graphite, carbon black or multi-wall carbon nanotubes in order to hinder the sintering of TiC. The obtained nanocomposite particle sizes, density, specific surface area and porosity were characterized and compared using ANOVA. All carbon allotropes mixed with the TiC, were able to successfully stabilize the nanometric TiC, hindering its sintering up to 1500 °C for 10...

  4. Security-Based Mechanism for Proactive Routing Schema Using Game Theory Model

    Directory of Open Access Journals (Sweden)

    Hicham Amraoui

    2016-01-01

    Full Text Available Game theory may offer a useful mechanism to address many problems in mobile ad hoc networks (MANETs. One of the key concepts in the research field of such networks with Optimized Link State Routing Protocol (OLSR is the security problem. Relying on applying game theory to study this problem, we consider two strategies during this suggested model: cooperate and not-cooperate. However, in such networks, it is not easy to identify different actions of players. In this paper, we have essentially been inspired from recent advances provided in game theory to propose a new model for security in MANETs. Our proposal presents a powerful tool with a large number of players where interactions are played multiple times. Moreover, each node keeps a cooperation rate (CR record of other nodes to cope with the behaviors and mitigate aggregate effect of other malicious devices. Additionally, our suggested security mechanism does not only take into consideration security requirements, but also take into account system resources and network performances. The simulation results using Network Simulator 3 are presented to illustrate the effectiveness of the proposal.

  5. A Localization Based Cooperative Routing Protocol for Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Nadeem Javaid

    2017-01-01

    Full Text Available Localization is one of the major aspects in underwater wireless sensor networks (UWSNs. Therefore, it is important to know the accurate position of the sensor node in large scale applications like disaster prevention, tactical surveillance, and monitoring. Due to the inefficiency of the global positioning system (GPS in UWSN, it is very difficult to localize a node in underwater environment compared to terrestrial networks. To minimize the localization error and enhance the localization coverage of the network, two routing protocols are proposed; the first one is mobile autonomous underwater vehicle (MobiL-AUV and the second one is cooperative MobiL (CO-MobiL. In MobiL-AUV, AUVs are deployed and equipped with GPS and act as reference nodes. These reference nodes are used to localize all the nonlocalized ordinary sensor nodes in order to reduce the localization error and maximize the network coverage. CO-MobiL is presented in order to improve the network throughput by using the maximal ratio combining (MRC as diversity technique which combines both signals, received from the source and received from the relay at the destination. It uses amplify-and-forward (AF mechanism to improve the signal between the source and the destination. To support our claims, extensive simulations are performed.

  6. Dendrimer-based dynamic combinatorial libraries

    NARCIS (Netherlands)

    Chang, T.; Meijer, E.W.

    2005-01-01

    The aim of this project is to create water-sol. dynamic combinatorial libraries based upon dendrimer-guest complexes. The guest mols. are designed to bind to dendrimers using multiple secondary interactions, such as electrostatics and hydrogen bonding. We have been able to incorporate various guest

  7. Self-Adapting Routing Overlay Network for Frequently Changing Application Traffic in Content-Based Publish/Subscribe System

    Directory of Open Access Journals (Sweden)

    Meng Chi

    2014-01-01

    Full Text Available In the large-scale distributed simulation area, the topology of the overlay network cannot always rapidly adapt to frequently changing application traffic to reduce the overall traffic cost. In this paper, we propose a self-adapting routing strategy for frequently changing application traffic in content-based publish/subscribe system. The strategy firstly trains the traffic information and then uses this training information to predict the application traffic in the future. Finally, the strategy reconfigures the topology of the overlay network based on this predicting information to reduce the overall traffic cost. A predicting path is also introduced in this paper to reduce the reconfiguration numbers in the process of the reconfigurations. Compared to other strategies, the experimental results show that the strategy proposed in this paper could reduce the overall traffic cost of the publish/subscribe system in less reconfigurations.

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

    Science.gov (United States)

    Mao, Yuxin; Zhu, Ping

    2013-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Huayong Zhang

    2018-01-01

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

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

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

  12. A hybrid particle–field molecular dynamics approach: a route toward efficient coarse-grained models for biomembranes

    International Nuclear Information System (INIS)

    Milano, Giuseppe; De Nicola, Antonio; Kawakatsu, Toshihiro

    2013-01-01

    This paper gives an overview of the coarse-grained models of phospholipids recently developed by the authors in the frame of a hybrid particle–field molecular dynamics technique. This technique employs a special class of coarse-grained models that are gaining popularity because they allow simulations of large scale systems and, at the same time, they provide sufficiently detailed chemistry for the mapping scheme adopted. The comparison of the computational costs of our approach with standard molecular dynamics simulations is a function of the system size and the number of processors employed in the parallel calculations. Due to the low amount of data exchange, the larger the number of processors, the better are the performances of the hybrid particle–field models. This feature makes these models very promising ones in the exploration of several problems in biophysics. (paper)

  13. Seismic constraints on dynamic links between geomorphic processes and routing of sediment in a steep mountain catchment

    Science.gov (United States)

    Burtin, A.; Hovius, N.; McArdell, B. W.; Turowski, J. M.; Vergne, J.

    2014-01-01

    Landscape dynamics are determined by interactions amongst geomorphic processes. These interactions allow the effects of tectonic, climatic and seismic perturbations to propagate across topographic domains, and permit the impacts of geomorphic process events to radiate from their point of origin. Visual remote sensing and in situ observations do not fully resolve the spatiotemporal patterns of surface processes in a landscape. As a result, the mechanisms and scales of geomorphic connectivity are poorly understood. Because many surface processes emit seismic signals, seismology can determine their type, location and timing with a resolution that reveals the operation of integral landscapes. Using seismic records, we show how hillslopes and channels in an Alpine catchment are interconnected to produce evolving, sediment-laden flows. This is done for a convective storm, which triggered a sequence of hillslope processes and debris flows. We observe the evolution of these process events and explore the operation of two-way links between mass wasting and channel processes, which are fundamental to the dynamics of most erosional landscapes. We also track the characteristics and propagation of flows along the debris flow channel, relating changes of observed energy to the deposition/mobilization of sediments, and using the spectral content of debris flow seismic signals to qualitatively infer sediment characteristics and channel abrasion potential. This seismological approach can help to test theoretical concepts of landscape dynamics and yield understanding of the nature and efficiency of links between individual geomorphic processes, which is required to accurately model landscape dynamics under changing tectonic or climatic conditions and to anticipate the natural hazard risk associated with specific meteorological events.

  14. Towards the Engineering of Dependable P2P-Based Network Control — The Case of Timely Routing Control Messages

    Science.gov (United States)

    Tutschku, Kurt; Nakao, Akihiro

    This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.

  15. Design of the smart home system based on the optimal routing algorithm and ZigBee network.

    Directory of Open Access Journals (Sweden)

    Dengying Jiang

    Full Text Available To improve the traditional smart home system, its electric wiring, networking technology, information transmission and facility control are studied. In this paper, we study the electric wiring, networking technology, information transmission and facility control to improve the traditional smart home system. First, ZigBee is used to replace the traditional electric wiring. Second, a network is built to connect lots of wireless sensors and facilities, thanks to the capability of ZigBee self-organized network and Genetic Algorithm-Particle Swarm Optimization Algorithm (GA-PSOA to search for the optimal route. Finally, when the smart home system is connected to the internet based on the remote server technology, home environment and facilities could be remote real-time controlled. The experiments show that the GA-PSOA reduce the system delay and decrease the energy consumption of the wireless system.

  16. Design of the smart home system based on the optimal routing algorithm and ZigBee network.

    Science.gov (United States)

    Jiang, Dengying; Yu, Ling; Wang, Fei; Xie, Xiaoxia; Yu, Yongsheng

    2017-01-01

    To improve the traditional smart home system, its electric wiring, networking technology, information transmission and facility control are studied. In this paper, we study the electric wiring, networking technology, information transmission and facility control to improve the traditional smart home system. First, ZigBee is used to replace the traditional electric wiring. Second, a network is built to connect lots of wireless sensors and facilities, thanks to the capability of ZigBee self-organized network and Genetic Algorithm-Particle Swarm Optimization Algorithm (GA-PSOA) to search for the optimal route. Finally, when the smart home system is connected to the internet based on the remote server technology, home environment and facilities could be remote real-time controlled. The experiments show that the GA-PSOA reduce the system delay and decrease the energy consumption of the wireless system.

  17. Dynamic reliability of digital-based transmitters

    Energy Technology Data Exchange (ETDEWEB)

    Brissaud, Florent, E-mail: florent.brissaud.2007@utt.f [Institut National de l' Environnement Industriel et des Risques (INERIS), Parc Technologique Alata, BP 2, 60550 Verneuil-en-Halatte (France) and Universite de Technologie de Troyes - UTT, Institut Charles Delaunay - ICD and UMR CNRS 6279 STMR, 12 rue Marie Curie, BP 2060, 10010 Troyes Cedex (France); Smidts, Carol [Ohio State University (OSU), Nuclear Engineering Program, Department of Mechanical Engineering, Scott Laboratory, 201 W 19th Ave, Columbus OH 43210 (United States); Barros, Anne; Berenguer, Christophe [Universite de Technologie de Troyes (UTT), Institut Charles Delaunay (ICD) and UMR CNRS 6279 STMR, 12 rue Marie Curie, BP 2060, 10010 Troyes Cedex (France)

    2011-07-15

    Dynamic reliability explicitly handles the interactions between the stochastic behaviour of system components and the deterministic behaviour of process variables. While dynamic reliability provides a more efficient and realistic way to perform probabilistic risk assessment than 'static' approaches, its industrial level applications are still limited. Factors contributing to this situation are the inherent complexity of the theory and the lack of a generic platform. More recently the increased use of digital-based systems has also introduced additional modelling challenges related to specific interactions between system components. Typical examples are the 'intelligent transmitters' which are able to exchange information, and to perform internal data processing and advanced functionalities. To make a contribution to solving these challenges, the mathematical framework of dynamic reliability is extended to handle the data and information which are processed and exchanged between systems components. Stochastic deviations that may affect system properties are also introduced to enhance the modelling of failures. A formalized Petri net approach is then presented to perform the corresponding reliability analyses using numerical methods. Following this formalism, a versatile model for the dynamic reliability modelling of digital-based transmitters is proposed. Finally the framework's flexibility and effectiveness is demonstrated on a substantial case study involving a simplified model of a nuclear fast reactor.

  18. Towards the molecular bases of polymerase dynamics

    International Nuclear Information System (INIS)

    Chela Flores, J.

    1991-03-01

    One aspect of the strong relationship that is known to exist between the processes of DNA replication and transcription is manifest in the coupling of the rates of movement of the replication fork (r f ) and RNA polymerase (r t ). We address two issues concerning the largely unexplored area of polymerase dynamics: (i) The validity of an approximate kinematic formula linking r f and r t suggested by experiments in which transcription is initiated in some prokaryotes with the antibiotic streptolydigin, and (ii) What are the molecular bases of the kinematic formula? An analysis of the available data suggests possible molecular bases for polymerase dynamics. In particular, we are led to a hypothesis: In active chromatin r t may depend on the length (λ t ) of the transcript of the primary messenger RNA (pre-mRNA). This new effect is subject to experimental verification. We discuss possible experiments that may be performed in order to test this prediction. (author). Refs, 6 tabs

  19. Keystroke Dynamics-Based Credential Hardening Systems

    Science.gov (United States)

    Bartlow, Nick; Cukic, Bojan

    abstract Keystroke dynamics are becoming a well-known method for strengthening username- and password-based credential sets. The familiarity and ease of use of these traditional authentication schemes combined with the increased trustworthiness associated with biometrics makes them prime candidates for application in many web-based scenarios. Our keystroke dynamics system uses Breiman’s random forests algorithm to classify keystroke input sequences as genuine or imposter. The system is capable of operating at various points on a traditional ROC curve depending on application-specific security needs. As a username/password authentication scheme, our approach decreases the system penetration rate associated with compromised passwords up to 99.15%. Beyond presenting results demonstrating the credential hardening effect of our scheme, we look into the notion that a user’s familiarity to components of a credential set can non-trivially impact error rates.

  20. SLAM - Based Approach to Dynamic Ship Positioning

    Directory of Open Access Journals (Sweden)

    Krzysztof Wrobel

    2014-03-01

    Full Text Available Dynamically positioned vessels, used by offshore industry, use not only satellite navigation but also different positioning systems, often referred to as reference' systems. Most of them use multiple technical devices located outside the vessel which creates some problems with their accessibility and performance. In this paper, a basic concept of reference system independent from any external device is presented, basing on hydroacoustics and Simultaneous Localization and Mapping (SLAM method. Theoretical analysis of its operability is also performed.

  1. Easy route to superhydrophobic copper-based wire-guided droplet microfluidic systems.

    Science.gov (United States)

    Mumm, Florian; van Helvoort, Antonius T J; Sikorski, Pawel

    2009-09-22

    Droplet-based microfluidic systems are an expansion of the lab on a chip concept toward flexible, reconfigurable setups based on the modification and analysis of individual droplets. Superhydrophobic surfaces are one suitable candidate for the realization of droplet-based microfluidic systems as the high mobility of aqueous liquids on such surfaces offers possibilities to use novel or more efficient approaches to droplet movement. Here, copper-based superhydrophobic surfaces were produced either by the etching of polycrystalline copper samples along the grain boundaries using etchants common in the microelectronics industry, by electrodeposition of copper films with subsequent nanowire decoration based on thermal oxidization, or by a combination of both. The surfaces could be easily hydrophobized with thiol-modified fluorocarbons, after which the produced surfaces showed a water contact angle as high as 171 degrees +/- 2 degrees . As copper was chosen as the base material, established patterning techniques adopted from printed circuit board fabrication could be used to fabricate macrostructures on the surfaces with the intention to confine the droplets and, thus, to reduce the system's sensitivity to tilting and vibrations. A simple droplet-based microfluidic chip with inlets, outlets, sample storage, and mixing areas was produced. Wire guidance, a relatively new actuation method applicable to aqueous liquids on superhydrophobic surfaces, was applied to move the droplets.

  2. Exploring Young Children's Performance on and Acceptance of an Educational Scenario-Based Digital Game for Teaching Route-Planning Strategies: A Case Study

    Science.gov (United States)

    Lin, Yi-Hui; Hou, Huei-Tse

    2016-01-01

    Researchers suggest that game-based learning (GBL) can be used to facilitate mathematics learning. However, empirical GBL research that targets young children is still limited. The purposes of the study is to develop a scenario-based digital game to promote children's route-planning ability, to empirically explore children's learning performance…

  3. A Routing Algorithm for WiFi-Based Wireless Sensor Network and the Application in Automatic Meter Reading

    Directory of Open Access Journals (Sweden)

    Li Li

    2013-01-01

    Full Text Available The Automatic Meter Reading (AMR network for the next generation Smart Grid is required to possess many essential functions, such as data reading and writing, intelligent power transmission, and line damage detection. However, the traditional AMR network cannot meet the previous requirement. With the development of the WiFi sensor node in the low power cost, a new kind of wireless sensor network based on the WiFi technology can be used in application. In this paper, we have designed a new architecture of WiFi-based wireless sensor network, which is suitable for the next generation AMR system. We have also proposed a new routing algorithm called Energy Saving-Based Hybrid Wireless Mesh Protocol (E-HWMP on the premise of current algorithm, which can improve the energy saving of the HWMP and be suitable for the WiFi-based wireless sensor network. The simulation results show that the life cycle of network is extended.

  4. Congestion based mechanism for route discovery in a V2I-V2V system applying smart devices and IoT.

    Science.gov (United States)

    Parrado, Natalia; Donoso, Yezid

    2015-03-31

    The Internet of Things is a new paradigm in which objects in a specific context can be integrated into traditional communication networks to actively participate in solving a determined problem. The Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) technologies are specific cases of IoT and key enablers for Intelligent Transportation Systems (ITS). V2V and V2I have been widely used to solve different problems associated with transportation in cities, in which the most important is traffic congestion. A high percentage of congestion is usually presented by the inappropriate use of resources in vehicular infrastructure. In addition, the integration of traffic congestion in decision making for vehicular traffic is a challenge due to its high dynamic behavior. In this paper, an optimization model over the load balancing in the congestion percentage of the streets is formulated. Later, we explore a fully congestion-oriented route discovery mechanism and we make a proposal on the communication infrastructure that should support it based on V2I and V2V communication. The mechanism is also compared with a modified Dijkstra's approach that reacts at congestion states. Finally, we compare the results of the efficiency of the vehicle's trip with the efficiency in the use of the capacity of the vehicular network.

  5. Congestion Based Mechanism for Route Discovery in a V2I-V2V System Applying Smart Devices and IoT

    Directory of Open Access Journals (Sweden)

    Natalia Parrado

    2015-03-01

    Full Text Available The Internet of Things is a new paradigm in which objects in a specific context can be integrated into traditional communication networks to actively participate in solving a determined problem. The Vehicle-to-Vehicle (V2V and Vehicle-to-Infrastructure (V2I technologies are specific cases of IoT and key enablers for Intelligent Transportation Systems (ITS. V2V and V2I have been widely used to solve different problems associated with transportation in cities, in which the most important is traffic congestion. A high percentage of congestion is usually presented by the inappropriate use of resources in vehicular infrastructure. In addition, the integration of traffic congestion in decision making for vehicular traffic is a challenge due to its high dynamic behavior. In this paper, an optimization model over the load balancing in the congestion percentage of the streets is formulated. Later, we explore a fully congestion-oriented route discovery mechanism and we make a proposal on the communication infrastructure that should support it based on V2I and V2V communication. The mechanism is also compared with a modified Dijkstra’s approach that reacts at congestion states. Finally, we compare the results of the efficiency of the vehicle’s trip with the efficiency in the use of the capacity of the vehicular network.

  6. An Erbium-Based Bifuctional Heterogeneous Catalyst: A Cooperative Route Towards C-C Bond Formation

    Directory of Open Access Journals (Sweden)

    Manuela Oliverio

    2014-07-01

    Full Text Available Heterogeneous bifuctional catalysts are multifunctional synthetic catalysts enabling efficient organic transformations by exploiting two opposite functionalities without mutual destruction. In this paper we report the first Er(III-based metallorganic heterogeneous catalyst, synthesized by post-calcination MW-assisted grafting and modification of the natural aminoacid L-cysteine. The natural acid–base distance between sites was maintained to assure the cooperation. The applicability of this new bifunctional heterogeneous catalyst to C-C bond formation and the supposed mechanisms of action are discussed as well.

  7. Memory-Aware Query Routing in Interactive Web-based Information Systems

    NARCIS (Netherlands)

    F. Waas; M.L. Kersten (Martin)

    2001-01-01

    textabstractQuery throughput is one of the primary optimization goals in interactive web-based information systems in order to achieve the performance necessary to serve large user communities. Queries in this application domain differ significantly from those in traditional database applications:

  8. A Novel Cloud-Based Platform for Implementation of Oblivious Power Routing for Clusters of Microgrids

    DEFF Research Database (Denmark)

    Broojeni, Kianoosh; Amini, M. Hadi; Nejadpak, Arash

    2016-01-01

    is verified by MATLAB simulation. We also present a comprehensive cloud-based platform for further implementation of the proposed algorithm on the OPAL-RT real-time digital simulation system. The communication paths between the microgrids and the cloud environment can be emulated by OMNeT++....

  9. A Unified Algebraic and Logic-Based Framework Towards Safe Routing Implementations

    Science.gov (United States)

    2015-08-13

    Software - defined Networks ( SDN ). We developed a declarative platform for implementing SDN protocols using declarative...and debugging several SDN applications. Example-based SDN synthesis. Recent emergence of software - defined networks offers an opportunity to design...domain of Software - defined Networks ( SDN ). We developed a declarative platform for implementing SDN protocols using declarative networking

  10. GIS-Based Railway Route Selection for the Proposed Kenya-Sudan ...

    African Journals Online (AJOL)

    This paper describes a procedure developed for automated railway feasibility analysis based on GIS and Multi-Criteria analysis. Good engineering railway alignment requirements are assessed and suitable factors and constraints for feasibility analysis derived. Relevant digital map layers are then prepared and reclassified ...

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

  12. Design and evaluation of overloaded service systems with skill based routing, under FCFS policies

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Boon, M.A.A.; Weiss, G.

    2013-01-01

    We study an overloaded service system with servers of types S={s1,…,sJ}, serving customers of types C={c1,…,cI} under FCFS. Customers arrive in Poisson streams, join the queue and then abandon or get served. Service is skill based, which is described by a compatibility graph G, where (i,j)¿G if

  13. Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions

    OpenAIRE

    Roos, Stefanie; Moreno-Sanchez, Pedro; Kate, Aniket; Goldberg, Ian

    2017-01-01

    Path-based transaction (PBT) networks, which settle payments from one user to another via a path of intermediaries, are a growing area of research. They overcome the scalability and privacy issues in cryptocurrencies like Bitcoin and Ethereum by replacing expensive and slow on-chain blockchain operations with inexpensive and fast off-chain transfers. In the form of credit networks such as Ripple and Stellar, they also enable low-price real-time gross settlements across different currencies. F...

  14. Hydrazine-based deposition route for device-quality CIGS films

    International Nuclear Information System (INIS)

    Mitzi, David B.; Yuan, Min; Liu, Wei; Kellock, Andrew J.; Chey, S. Jay; Gignac, Lynne; Schrott, Alex G.

    2009-01-01

    A simple solution-based approach for depositing CIGS (Cu-In-Ga-Se/S) absorber layers is discussed, with an emphasis on film characterization, interfacial properties and integration into photovoltaic devices. The process involves incorporating all metal and chalcogenide components into a single hydrazine-based solution, spin coating a precursor film, and heat treating in an inert atmosphere, to form the desired CIGS film with up to micron-scaled film thickness and grain size. PV devices (glass/Mo/CIGS/CdS/i-ZnO/ITO) employing the spin-coated CIGS and using processing temperatures below 500 deg. C have yielded power conversion efficiencies of up to 10% (AM 1.5 illumination), without the need for a post-CIGS-deposition treatment in a gaseous Se source or a cyanide-based bath etch. Short-duration low-temperature (T < 200 deg. C ) oxygen treatment of completed devices is shown to have a positive impact on the performance of initially underperforming cells, thereby enabling better performance in devices prepared at temperatures below 500 deg. C

  15. Hydrazine-based deposition route for device-quality CIGS films

    Energy Technology Data Exchange (ETDEWEB)

    Mitzi, David B. [IBM T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY 10598 (United States)], E-mail: dmitzi@us.ibm.com; Yuan, Min; Liu, Wei [IBM T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY 10598 (United States); Kellock, Andrew J [IBM Almaden Research Center, 650 Harry Rd, San Jose, CA 95120 (United States); Chey, S Jay; Gignac, Lynne; Schrott, Alex G [IBM T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY 10598 (United States)

    2009-02-02

    A simple solution-based approach for depositing CIGS (Cu-In-Ga-Se/S) absorber layers is discussed, with an emphasis on film characterization, interfacial properties and integration into photovoltaic devices. The process involves incorporating all metal and chalcogenide components into a single hydrazine-based solution, spin coating a precursor film, and heat treating in an inert atmosphere, to form the desired CIGS film with up to micron-scaled film thickness and grain size. PV devices (glass/Mo/CIGS/CdS/i-ZnO/ITO) employing the spin-coated CIGS and using processing temperatures below 500 deg. C have yielded power conversion efficiencies of up to 10% (AM 1.5 illumination), without the need for a post-CIGS-deposition treatment in a gaseous Se source or a cyanide-based bath etch. Short-duration low-temperature (T < 200 deg. C ) oxygen treatment of completed devices is shown to have a positive impact on the performance of initially underperforming cells, thereby enabling better performance in devices prepared at temperatures below 500 deg. C.

  16. A Decentralized Fuzzy C-Means-Based Energy-Efficient Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Osama Moh’d Alia

    2014-01-01

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

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

    Science.gov (United States)

    Alia, Osama Moh'd

    2014-01-01

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

  18. A Decentralized Fuzzy C-Means-Based Energy-Efficient Routing Protocol for Wireless Sensor Networks

    Science.gov (United States)

    2014-01-01

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

  19. Study on Triopoly Dynamic Game Model Based on Different Demand Forecast Methods in the Market

    Directory of Open Access Journals (Sweden)

    Junhai Ma

    2017-01-01

    Full Text Available The impact of inaccurate demand beliefs on dynamics of a Triopoly game is studied. We suppose that all the players make their own estimations on possible demand with errors. A dynamic Triopoly game with such demand belief is set up. Based on this model, existence and local stable region of the equilibriums are investigated by 3D stable regions of Nash equilibrium point. The complex dynamics, such as bifurcation scenarios and route to chaos, are displayed in 2D bifurcation diagrams, in which e1 and α are negatively related to each other. Basins of attraction are investigated and we found that the attraction domain becomes smaller with the increase in price modification speed, which indicates that all the players’ output must be kept within a certain range so as to keep the system stable. Feedback control method is used to keep the system at an equilibrium state.

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

  1. Cobalt-based orthopaedic alloys: Relationship between forming route, microstructure and tribological performance

    Energy Technology Data Exchange (ETDEWEB)

    Patel, Bhairav [Department of Mechanical Engineering, University College London, Torrington Place, London WC1E 7JE (United Kingdom); Favaro, Gregory [CSM Instruments SA, Rue de la Gare 4, Galileo Center, CH-2034 Peseux (Switzerland); Inam, Fawad [Advanced Composite Training and Development Centre and School of Mechanical and Aeronautical Engineering, Glyndwr University, Mold Road, Wrexham LL11 2AW (United Kingdom); School of Engineering and Materials Science and Nanoforce Technology Ltd, Queen Mary University of London, London E1 4NS (United Kingdom); Reece, Michael J. [School of Engineering and Materials Science and Nanoforce Technology Ltd, Queen Mary University of London, London E1 4NS (United Kingdom); Angadji, Arash [Orthopaedic Research UK, Furlong House, 10a Chandos Street, London W1G 9DQ (United Kingdom); Bonfield, William [Department of Materials Science and Metallurgy, University of Cambridge, Pembroke Street, Cambridge CB2 3QZ (United Kingdom); Huang, Jie [Department of Mechanical Engineering, University College London, Torrington Place, London WC1E 7JE (United Kingdom); Edirisinghe, Mohan, E-mail: m.edirisinghe@ucl.ac.uk [Department of Mechanical Engineering, University College London, Torrington Place, London WC1E 7JE (United Kingdom)

    2012-07-01

    The average longevity of hip replacement devices is approximately 10-15 years, which generally depends on many factors. But for younger generation patients this would mean that revisions may be required at some stage in order to maintain functional activity. Therefore, research is required to increase the longevity to around 25-30 years; a target that was initially set by John Charnley. The main issues related to metal-on-metal (MoM) hip replacement devices are the high wear rates when malpositioned and the release of metallic ions into the blood stream and surrounding tissues. Work is required to reduce the wear rates and limit the amount of metallic ions being leached out of the current MoM materials, to be able to produce an ideal hip replacement material. The most commonly used MoM material is the cobalt-based alloys, more specifically ASTM F75, due to their excellent wear and corrosion resistance. They are either fabricated using the cast or wrought method, however powder processing of these alloys has been shown to improve the properties. One powder processing technique used is spark plasma sintering, which utilises electric current Joule heating to produce high heating rates to sinter powders to form an alloy. Two conventionally manufactured alloys (ASTM F75 and ASTM F1537) and a spark plasma sintered (SPS) alloy were evaluated for their microstructure, hardness, tribological performance and the release of metallic content. The SPS alloy with oxides and not carbides in its microstructure had the higher hardness, which resulted in the lowest wear and friction coefficient, with lower amounts of chromium and molybdenum detected from the wear debris compared to the ASTM F75 and ASTM F1537. In addition the wear debris size and size distribution of the SPS alloy generated were considerably small, indicating a material that exhibits excellent performance and more favourable compared to the current conventional cobalt based alloys used in orthopaedics. - Highlights

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

  3. Graphene-Au nanoparticle based vertical heterostructures: a novel route towards high- ZT Thermoelectric devices

    KAUST Repository

    Juang, Zhen-Yu; Tseng, Chien-Chih; Shi, Yumeng; Hsieh, Wen-Pin; Ryuzaki, Sou; Saito, Noboru; Hsiung, Chia-En; Chang, Wen-Hao; Hernandez, Yenny; Han, Yu; Tamada, Kaoru; Li, Lain-Jong

    2017-01-01

    Monolayer graphene exhibits impressive in-plane thermal conductivity (>1000Wm–1 K–1). However, the out-of-plane thermal transport is limited due to the weak van der Waals interaction, indicating the possibility of constructing a vertical thermoelectric (TE) device. Here, we propose a cross-plane TE device based on the vertical heterostructures of few-layer graphene and gold nanoparticles (AuNPs) on Si substrates, where the incorporation of AuNPs further inhibits the phonon transport and enhances the electrical conductivity along vertical direction. A measurable Seebeck voltage is produced vertically between top graphene and bottom Si when the device is put on a hot surface and the figure of merit ZT is estimated as 1 at room temperature from the transient Harman method. The polarity of the output voltage is determined by the carrier polarity of the substrate. The device concept is also applicable to a flexible and transparent substrate as demonstrated.

  4. Optimization model of conventional missile maneuvering route based on improved Floyd algorithm

    Science.gov (United States)

    Wu, Runping; Liu, Weidong

    2018-04-01

    Missile combat plays a crucial role in the victory of war under high-tech conditions. According to the characteristics of maneuver tasks of conventional missile units in combat operations, the factors influencing road maneuvering are analyzed. Based on road distance, road conflicts, launching device speed, position requirements, launch device deployment, Concealment and so on. The shortest time optimization model was built to discuss the situation of road conflict and the strategy of conflict resolution. The results suggest that in the process of solving road conflict, the effect of node waiting is better than detour to another way. In this study, we analyzed the deficiency of the traditional Floyd algorithm which may limit the optimal way of solving road conflict, and put forward the improved Floyd algorithm, meanwhile, we designed the algorithm flow which would be better than traditional Floyd algorithm. Finally, throgh a numerical example, the model and the algorithm were proved to be reliable and effective.

  5. Graphene-Au nanoparticle based vertical heterostructures: a novel route towards high- ZT Thermoelectric devices

    KAUST Repository

    Juang, Zhen-Yu

    2017-06-03

    Monolayer graphene exhibits impressive in-plane thermal conductivity (>1000Wm–1 K–1). However, the out-of-plane thermal transport is limited due to the weak van der Waals interaction, indicating the possibility of constructing a vertical thermoelectric (TE) device. Here, we propose a cross-plane TE device based on the vertical heterostructures of few-layer graphene and gold nanoparticles (AuNPs) on Si substrates, where the incorporation of AuNPs further inhibits the phonon transport and enhances the electrical conductivity along vertical direction. A measurable Seebeck voltage is produced vertically between top graphene and bottom Si when the device is put on a hot surface and the figure of merit ZT is estimated as 1 at room temperature from the transient Harman method. The polarity of the output voltage is determined by the carrier polarity of the substrate. The device concept is also applicable to a flexible and transparent substrate as demonstrated.

  6. Selective Area Sublimation: A Simple Top-down Route for GaN-Based Nanowire Fabrication.

    Science.gov (United States)

    Damilano, B; Vézian, S; Brault, J; Alloing, B; Massies, J

    2016-03-09

    Post-growth in situ partial SiNx masking of GaN-based epitaxial layers grown in a molecular beam epitaxy reactor is used to get GaN selective area sublimation (SAS) by high temperature annealing. Using this top-down approach, nanowires (NWs) with nanometer scale diameter are obtained from GaN and InxGa1-xN/GaN quantum well epitaxial structures. After GaN regrowth on InxGa1-xN/GaN NWs resulting from SAS, InxGa1-xN quantum disks (QDisks) with nanometer sizes in the three dimensions are formed. Low temperature microphotoluminescence experiments demonstrate QDisk multilines photon emission around 3 eV with individual line widths of 1-2 meV.

  7. Dynamics-based centrality for directed networks.

    Science.gov (United States)

    Masuda, Naoki; Kori, Hiroshi

    2010-11-01

    Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.

  8. Orthonormal Wavelet Bases for Quantum Molecular Dynamics

    International Nuclear Information System (INIS)

    Tymczak, C.; Wang, X.

    1997-01-01

    We report on the use of compactly supported, orthonormal wavelet bases for quantum molecular-dynamics (Car-Parrinello) algorithms. A wavelet selection scheme is developed and tested for prototypical problems, such as the three-dimensional harmonic oscillator, the hydrogen atom, and the local density approximation to atomic and molecular systems. Our method shows systematic convergence with increased grid size, along with improvement on compression rates, thereby yielding an optimal grid for self-consistent electronic structure calculations. copyright 1997 The American Physical Society

  9. Excited state dynamics of DNA bases

    Czech Academy of Sciences Publication Activity Database

    Kleinermanns, K.; Nachtigallová, Dana; de Vries, M. S.

    2013-01-01

    Roč. 32, č. 2 (2013), s. 308-342 ISSN 0144-235X R&D Projects: GA ČR GAP208/12/1318 Grant - others:National Science Foundation(US) CHE-0911564; NASA (US) NNX12AG77G; Deutsche Forschungsgemeinschaft(DE) SFB 663; Deutsche Forschungsgemeinschaft(DE) KI 531-29 Institutional support: RVO:61388963 Keywords : DNA bases * nucleobases * excited state * dynamics * computations * gas phase * conical intersections Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 4.920, year: 2013

  10. Agent-based modeling and network dynamics

    CERN Document Server

    Namatame, Akira

    2016-01-01

    The book integrates agent-based modeling and network science. It is divided into three parts, namely, foundations, primary dynamics on and of social networks, and applications. The book begins with the network origin of agent-based models, known as cellular automata, and introduce a number of classic models, such as Schelling’s segregation model and Axelrod’s spatial game. The essence of the foundation part is the network-based agent-based models in which agents follow network-based decision rules. Under the influence of the substantial progress in network science in late 1990s, these models have been extended from using lattices into using small-world networks, scale-free networks, etc. The book also shows that the modern network science mainly driven by game-theorists and sociophysicists has inspired agent-based social scientists to develop alternative formation algorithms, known as agent-based social networks. The book reviews a number of pioneering and representative models in this family. Upon the gi...

  11. Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel Queues

    OpenAIRE

    Lloret-Batlle, Roger; Jayakrishnan, R.

    2018-01-01

    This article explores the coalitional stability of a new cooperative control policy for freeways and parallel queuing facilities with multiple servers. Based on predicted future delays per queue or lane, a VOT-heterogeneous population of agents can agree to switch lanes or queues and transfer payments to each other in order to minimize the total cost of the incoming platoon. The strategic interaction is captured by an n-level Stackelberg model with coalitions, while the cooperative structure ...

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

    Directory of Open Access Journals (Sweden)

    PAPAJ Ján

    2013-05-01

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

  13. En Route: next-generation laser-plasma-based electron accelerators

    International Nuclear Information System (INIS)

    Hidding, Bernhard

    2008-05-01

    Accelerating electrons to relativistic energies is of fundamental interest, especially in particle physics. Today's accelerator technology, however, is limited by the maximum electric fields which can be created. This thesis presents results on various mechanisms aiming at exploiting the fields in focussed laser pulses and plasma waves for electron acceleration, which can be orders of magnitude higher than with conventional accelerators. With relativistic, underdense laser-plasma-interaction, quasimonoenergetic electron bunches with energies up to ∼50 MeV and normalized emittances of the order of 5mmmrad have been generated. This was achieved by focussing the ∼80 fs, 1 J pulses of the JETI-laser at the FSU Jena to intensities of several 10 19 W=cm 2 into gas jets. The experimental observations could be explained via ''bubble acceleration'', which is based on self-injection and acceleration of electrons in a highly nonlinear breaking plasma wave. For the rst time, this bubble acceleration was achieved explicitly in the self-modulated laser wakefield regime (SMLWFA). This quasimonoenergetic SMLWFA-regime stands out by relaxing dramatically the requirements on the driving laser pulse necessary to trigger bubble acceleration. This is due to self-modulation of the laser pulse in high-density gas jets, leading to ultrashort laser pulse fragments capable of initiating bubble acceleration. Electron bunches with durations < or similar 5 fs can thus be created, which is at least an order of magnitude shorter than with conventional accelerator technology. In addition, more than one laser pulse fragment can be powerful enough to drive a bubble. Distinct double peaks have been observed in the electron spectra, indicating that two quasimonoenergetic electron bunches separated by only few tens of fs have formed. This is backed up by PIC-Simulations (Particle-in-Cell). These results underline the feasibility of the construction of small table-top accelerators, while at the

  14. Synthesis of encapsulated pigments based on Fe, Co and Si by route of polymeric precursors

    International Nuclear Information System (INIS)

    Macedo, D.S.S.M.; Macedo Neto, O.C.; Paskocimas, C.A.; Varela, M.L.N.

    2012-01-01

    The objective is to apply the polymeric precursor method to obtain encapsulated pigments, the basis of oxides of iron and cobalt deposited on silica. The method has advantages such as reduction of time and reproducibility in the conventional methods, and also improves optical properties, thermal stability and morphology. The synthesis was based on the dissolution of the citric acid (complexing agent), addition of oxides of iron and cobalt (ions chromophores) polymerization of ethylene glycol and silica coating. The mixture was pre-calcined to form the precursor powder was analyzed by TG and DTA. Was then split, and calcined at different temperatures (700 ° C - 900 ° C) and analyzed by BET, DRX, MEV and UV-Visible. The pigments were stable thermally, with surface area ranging between 3,09 and 7,65 m² / g, formation of crystalline phases of cobalt ferrite (CoFe 2 O 4 ) and Cristobalite (SiO 2 ) and agglomerates of particles slightly rounded. (author)

  15. "We Brought It upon Ourselves": University-Based Teacher Education and the Emergence of Boot-Camp-Style Routes to Teacher Certification

    Science.gov (United States)

    Friedrich, Daniel

    2014-01-01

    The proliferation of boot-camp-style routes to teacher certification in the last two decades is seen by many university-based teacher educators as the result of the advancement of conservative interests aimed at de-professionalizing teaching. This essay argues that this view only accounts for one piece of the answer, the other one being that some…

  16. Nationwide genetic surveillance of Plasmodium vivax in Papua New Guinea reveals heterogeneous transmission dynamics and routes of migration amongst subdivided populations.

    Science.gov (United States)

    Fola, Abebe A; Nate, Elma; Abby Harrison, G L; Barnadas, Céline; Hetzel, Manuel W; Iga, Jonah; Siba, Peter; Mueller, Ivo; Barry, Alyssa E

    2018-03-01

    The Asia Pacific Leaders in Malaria Alliance (APLMA) have committed to eliminate malaria from the region by 2030. Papua New Guinea (PNG) has the highest malaria burden in the Asia-Pacific region but with the intensification of control efforts since 2005, transmission has been dramatically reduced and Plasmodium vivax is now the dominant malaria infection in some parts of the country. To gain a better understanding of the transmission dynamics and migration patterns of P. vivax in PNG, here we investigate population structure in eight geographically and ecologically distinct regions of the country. A total of 219 P. vivax isolates (16-30 per population) were successfully haplotyped using 10 microsatellite markers. A wide range of genetic diversity (H e =0.37-0.87, R s =3.60-7.58) and significant multilocus linkage disequilibrium (LD) was observed in six of the eight populations (I A S =0.08-0.15 p-value<0.05) reflecting a spectrum of transmission intensities across the country. Genetic differentiation between regions was evident (Jost's D=0.07-0.72), with increasing divergence of populations with geographic distance. Overall, P. vivax isolates clustered into three major genetic populations subdividing the Mainland lowland and coastal regions, the Islands and the Highlands. P. vivax gene flow follows major human migration routes, and there was higher gene flow amongst Mainland parasite populations than among Island populations. The Central Province (samples collected in villages close to the capital city, Port Moresby), acts as a sink for imported infections from the three major endemic areas. These insights into P. vivax transmission dynamics and population networks will inform targeted strategies to contain malaria infections and to prevent the spread of drug resistance in PNG. Copyright © 2017 Elsevier B.V. All rights reserved.

  17. DLTS Analysis and Interface Engineering of Solution Route Fabricated Zirconia Based MIS Devices Using Plasma Treatment

    Science.gov (United States)

    Kumar, Arvind; Mondal, Sandip; Koteswara Rao, K. S. R.

    2018-02-01

    In this work, we have fabricated low-temperature sol-gel spin-coated and oxygen (O2) plasma treated ZrO2 thin film-based metal-insulator-semiconductor devices. To understand the impact of plasma treatment on the Si/ZrO2 interface, deep level transient spectroscopy measurements were performed. It is reported that the interface state density ( D it) comes down to 7.1 × 1010 eV-1 cm-2 from 4 × 1011 eV-1 cm-2, after plasma treatment. The reduction in D it is around five times and can be attributed to the passivation of oxygen vacancies near the Si/ZrO2 interface, as they try to relocate near the interface. The energy level position ( E T) of interfacial traps is estimated to be 0.36 eV below the conduction band edge. The untreated ZrO2 film displayed poor leakage behavior due to the presence of several traps within the film and at the interface; O2 plasma treated films show improved leakage current density as they have been reduced from 5.4 × 10-8 A/cm2 to 1.98 × 10-9 A/cm2 for gate injection mode and 6.4 × 10-8 A/cm2 to 6.3 × 10-10 A/cm2 for substrate injection mode at 1 V. Hence, we suggest that plasma treatment might be useful in future device fabrication technology.

  18. Chaotic systems are dynamically random

    International Nuclear Information System (INIS)

    Svozil, K.

    1988-01-01

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

  19. Synthesis route and three different core-shell impacts on magnetic characterization of gadolinium oxide-based nanoparticles as new contrast agents for molecular magnetic resonance imaging

    Science.gov (United States)

    Azizian, Gholamreza; Riyahi-Alam, Nader; Haghgoo, Soheila; Moghimi, Hamid Reza; Zohdiaghdam, Reza; Rafiei, Behrooz; Gorji, Ensieh

    2012-10-01

    Despite its good resolution, magnetic resonance imaging intrinsically has low sensitivity. Recently, contrast agent nanoparticles have been used as sensitivity and contrast enhancer. The aim of this study was to investigate a new controlled synthesis method for gadolinium oxide-based nanoparticle preparation. For this purpose, diethyleneglycol coating of gadolinium oxide (Gd2O3-DEG) was performed using new supervised polyol route, and small particulate gadolinium oxide (SPGO) PEGylation was obtained with methoxy-polyethylene-glycol-silane (550 and 2,000 Da) coatings as SPGO-mPEG-silane550 and 2,000, respectively. Physicochemical characterization and magnetic properties of these three contrast agents in comparison with conventional Gd-DTPA were verified by dynamic light scattering transmission electron microscopy, Fourier transform infrared spectroscopy, inductively coupled plasma, X-ray diffraction, vibrating sample magnetometer, and the signal intensity and relaxivity measurements were performed using 1.5-T MRI scanner. As a result, the nanoparticle sizes of Gd2O3-DEG, SPGO-mPEG-silane550, and SPGO-mPEG-silane2000 could be reached to 5.9, 51.3, 194.2 nm, respectively. The image signal intensity and longitudinal ( r 1) and transverse relaxivity ( r 2) measurements in different concentrations (0.3 to approximately 2.5 mM), revealed the r 2/ r 1 ratios of 1.13, 0.89, 33.34, and 33.72 for Gd-DTPA, Gd2O3-DEG, SPGO-mPEG-silane550, and SPGO-mPEG-silane2000, respectively. The achievement of new synthesis route of Gd2O3-DEG resulted in lower r 2/ r 1 ratio for Gd2O3-DEG than Gd-DTPA and other previous synthesized methods by this and other groups. The smaller r 2/ r 1 ratios of two PEGylated-SPGO contrast agents in our study in comparison with r 2/ r 1 ratio of previous PEGylation ( r 2/ r 1 = 81.9 for mPEG-silane 6,000 MW) showed that these new three introduced contrast agents could potentially be proper contrast enhancers for cellular and molecular MR imaging.

  20. Self-assembling organomodified Co/Al based layered double hydroxides (LDH) via one-step route

    Institute of Scientific and Technical Information of China (English)

    WANG De-yi; A.LEUTERITZ; U.WAGENKNECHT; G.HEINRICH

    2009-01-01

    The preparation of self-assembling organomodified Co/Al-layered double hydroxide (LDH) via one-step route was studied.A common surfactant,sodium dodecylbenzenesulfonate (DBS),was employed as an organic modifier.The behavior and structure of self-assembled intercalated organic Co/Al-LDH were investigated by FTIR,SEM,WAXS,element analysis and TGA.Based upon the WAXS results and calculation by Bragg equation,the interlayer distance (d value) for organic Co/Al-LDH is enlarged from 0.75 nm to 3.10 nm,showing that the self-assembling behavior has been carried out successfully.Considering the observation from SEM,the product shows the morphology of organic Co/Al-LDH of a layered structure.In addition,FTIR,element analysis and TGA analysis show that the modifier is intercalated into the gallery of the Co/Al-LDH.Since organic modification for nanofiller is deemed to be necessary before applying it into polymer,the successful preparation of organomodified Co/Al-LDH will be significantly beneficial to the preparation and investigation of novel polymer/LDH nanocomposite.

  1. Pedestrian Dead Reckoning Navigation with the Help of A⁎-Based Routing Graphs in Large Unconstrained Spaces

    Directory of Open Access Journals (Sweden)

    F. Taia Alaoui

    2017-01-01

    Full Text Available An A⁎-based routing graph is proposed to assist PDR indoor and outdoor navigation with handheld devices. Measurements are provided by inertial and magnetic sensors together with a GNSS receiver. The novelty of this work lies in providing a realistic motion support that mitigates the absence of obstacles and enables the calibration of the PDR model even in large spaces where GNSS signal is unavailable. This motion support is exploited for both predicting positions and updating them using a particle filter. The navigation network is used to correct for the gyro drift, to adjust the step length model and to assess heading misalignment between the pedestrian’s walking direction and the pointing direction of the handheld device. Several datasets have been tested and results show that the proposed model ensures a seamless transition between outdoor and indoor environments and improves the positioning accuracy. The drift is almost cancelled thanks to heading correction in contrast with a drift of 8% for the nonaided PDR approach. The mean error of filtered positions ranges from 3 to 5 m.

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

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

  4. En Route: next-generation laser-plasma-based electron accelerators; En Route: Elektronenbeschleuniger der naechsten Generation auf Laser-Plasma-Basis

    Energy Technology Data Exchange (ETDEWEB)

    Hidding, Bernhard

    2008-05-15

    Accelerating electrons to relativistic energies is of fundamental interest, especially in particle physics. Today's accelerator technology, however, is limited by the maximum electric fields which can be created. This thesis presents results on various mechanisms aiming at exploiting the fields in focussed laser pulses and plasma waves for electron acceleration, which can be orders of magnitude higher than with conventional accelerators. With relativistic, underdense laser-plasma-interaction, quasimonoenergetic electron bunches with energies up to {approx}50 MeV and normalized emittances of the order of 5mmmrad have been generated. This was achieved by focussing the {approx}80 fs, 1 J pulses of the JETI-laser at the FSU Jena to intensities of several 10{sup 19}W=cm{sup 2} into gas jets. The experimental observations could be explained via 'bubble acceleration', which is based on self-injection and acceleration of electrons in a highly nonlinear breaking plasma wave. For the rst time, this bubble acceleration was achieved explicitly in the self-modulated laser wakefield regime (SMLWFA). This quasimonoenergetic SMLWFA-regime stands out by relaxing dramatically the requirements on the driving laser pulse necessary to trigger bubble acceleration. This is due to self-modulation of the laser pulse in high-density gas jets, leading to ultrashort laser pulse fragments capable of initiating bubble acceleration. Electron bunches with durations

  5. Dynamic social networks based on movement

    Science.gov (United States)

    Scharf, Henry; Hooten, Mevin B.; Fosdick, Bailey K.; Johnson, Devin S.; London, Joshua M.; Durban, John W.

    2016-01-01

    Network modeling techniques provide a means for quantifying social structure in populations of individuals. Data used to define social connectivity are often expensive to collect and based on case-specific, ad hoc criteria. Moreover, in applications involving animal social networks, collection of these data is often opportunistic and can be invasive. Frequently, the social network of interest for a given population is closely related to the way individuals move. Thus, telemetry data, which are minimally invasive and relatively inexpensive to collect, present an alternative source of information. We develop a framework for using telemetry data to infer social relationships among animals. To achieve this, we propose a Bayesian hierarchical model with an underlying dynamic social network controlling movement of individuals via two mechanisms: an attractive effect and an aligning effect. We demonstrate the model and its ability to accurately identify complex social behavior in simulation, and apply our model to telemetry data arising from killer whales. Using auxiliary information about the study population, we investigate model validity and find the inferred dynamic social network is consistent with killer whale ecology and expert knowledge.

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

    Directory of Open Access Journals (Sweden)

    Arafatur RAHMAN

    2009-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Liu Liu

    2017-11-01

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

  8. Assessing the environmental characteristics of cycling routes to school: a study on the reliability and validity of a Google Street View-based audit.

    Science.gov (United States)

    Vanwolleghem, Griet; Van Dyck, Delfien; Ducheyne, Fabian; De Bourdeaudhuij, Ilse; Cardon, Greet

    2014-06-10

    Google Street View provides a valuable and efficient alternative to observe the physical environment compared to on-site fieldwork. However, studies on the use, reliability and validity of Google Street View in a cycling-to-school context are lacking. We aimed to study the intra-, inter-rater reliability and criterion validity of EGA-Cycling (Environmental Google Street View Based Audit - Cycling to school), a newly developed audit using Google Street View to assess the physical environment along cycling routes to school. Parents (n = 52) of 11-to-12-year old Flemish children, who mostly cycled to school, completed a questionnaire and identified their child's cycling route to school on a street map. Fifty cycling routes of 11-to-12-year olds were identified and physical environmental characteristics along the identified routes were rated with EGA-Cycling (5 subscales; 37 items), based on Google Street View. To assess reliability, two researchers performed the audit. Criterion validity of the audit was examined by comparing the ratings based on Google Street View with ratings through on-site assessments. Intra-rater reliability was high (kappa range 0.47-1.00). Large variations in the inter-rater reliability (kappa range -0.03-1.00) and criterion validity scores (kappa range -0.06-1.00) were reported, with acceptable inter-rater reliability values for 43% of all items and acceptable criterion validity for 54% of all items. EGA-Cycling can be used to assess physical environmental characteristics along cycling routes to school. However, to assess the micro-environment specifically related to cycling, on-site assessments have to be added.

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

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

  11. Digital Communication Devices Based on Nonlinear Dynamics and Chaos

    National Research Council Canada - National Science Library

    Larson, Lawrence

    2003-01-01

    The final report of the ARO MURI "Digital Communications Based on Chaos and Nonlinear Dynamics" contains research results in the areas of chaos and nonlinear dynamics applied to wireless and optical communications...

  12. A new route for preparation of sodium-silicate-based hydrophobic silica aerogels via ambient-pressure drying

    International Nuclear Information System (INIS)

    Bangi, Uzma K H; Rao, A Venkateswara; Rao, A Parvathy

    2008-01-01

    An in-depth investigation into the synthesis of hydrophobic silica aerogels prepared by the surface derivatization of wet gels followed by subsequent drying at ambient pressure is reported. The following sol-gel parameters were examined for their effect on the physical properties of the derived aerogels: number of gel washings with water, percentage of hexane or methanol in silylating mixture, molar ratio of tartaric acid: Na 2 SiO 3 , gel aging period, weight% of silica, trimethylchlorosilane (TMCS) percentage, and silylation period. These parameters were varied from 1 to 4, 0 to 100%, 0.27 to 1.2, 0 to 4 h, 1.5 to 8 wt.%, 20 to 40% and 6 to 24 h, respectively. The properties of hydrophobic silica aerogels synthesized by this new route were investigated in terms of bulk density, percentage volume shrinkage, percentage porosity, thermal conductivity and contact angle with water, and by Fourier transform infrared spectroscopy (FTIR). The as-prepared hydrophobic silica aerogels exhibited high temperature stability (up to approximately 435 0 C) as measured by thermogravimetric/differential thermal analysis (TGA-DTA). The optimal sol-gel parameters were found to be a molar ratio of Na 2 SiO 3 :H 2 O : tartaric acid : TMCS of 1 : 146.67 : 0.86 : 9.46, an aging period of 3 h, four washings with water in 24 h and the use of a 50% hexane- or methanol-based silylating mixture. Aerogels prepared with these optimal parameters were found to exhibit 50% optical transparency in the visible range, 84 kg m -3 density, 0.090 W mK -1 thermal conductivity, 95% porosity and a contact angle of 146 0 with water

  13. Dynamics based alignment of proteins: an alternative approach to quantify dynamic similarity

    Directory of Open Access Journals (Sweden)

    Lyngsø Rune

    2010-04-01

    Full Text Available Abstract Background The dynamic motions of many proteins are central to their function. It therefore follows that the dynamic requirements of a protein are evolutionary constrained. In order to assess and quantify this, one needs to compare the dynamic motions of different proteins. Comparing the dynamics of distinct proteins may also provide insight into how protein motions are modified by variations in sequence and, consequently, by structure. The optimal way of comparing complex molecular motions is, however, far from trivial. The majority of comparative molecular dynamics studies performed to date relied upon prior sequence or structural alignment to define which residues were equivalent in 3-dimensional space. Results Here we discuss an alternative methodology for comparative molecular dynamics that does not require any prior alignment information. We show it is possible to align proteins based solely on their dynamics and that we can use these dynamics-based alignments to quantify the dynamic similarity of proteins. Our method was tested on 10 representative members of the PDZ domain family. Conclusions As a result of creating pair-wise dynamics-based alignments of PDZ domains, we have found evolutionarily conserved patterns in their backbone dynamics. The dynamic similarity of PDZ domains is highly correlated with their structural similarity as calculated with Dali. However, significant differences in their dynamics can be detected indicating that sequence has a more refined role to play in protein dynamics than just dictating the overall fold. We suggest that the method should be generally applicable.

  14. Towards heterogeneous robot team path planning: acquisition of multiple routes with a modified spline-based algorithm

    Directory of Open Access Journals (Sweden)

    Lavrenov Roman

    2017-01-01

    Full Text Available Our research focuses on operation of a heterogeneous robotic group that carries out point-to point navigation in GPS-denied dynamic environment, applying a combined local and global planning approach. In this paper, we introduce a homotopy-based high-level planner, which uses a modified splinebased path-planning algorithm. The algorithm utilizes Voronoi graph for global planning and a set of optimization criteria for local improvements of selected paths. The simulation was implemented in Matlab environment.

  15. Selective epidemic vaccination under the performant routing algorithms

    Science.gov (United States)

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

    2018-04-01

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

  16. Installation of dynamic travel time signs and efforts to obtain and test a graphical route information panel (GRIP) sign in Austin.

    Science.gov (United States)

    2016-08-01

    Graphic Route Information Panel (GRIP) signs use a combination of text, colors, and representative maps of : the roadway system to convey real-time roadway congestion location and severity information. The intent of : this project was to facilitate t...

  17. An Adaptive Large Neighborhood Search-based Three-Stage Matheuristic for the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Christensen, Jonas Mark; Røpke, Stefan

    that serves all the customers. The second stage usesan Adaptive Large Neighborhood Search (ALNS) algorithm to minimise the travel distance, during the second phase all of the generated routes are considered by solving a set cover problem. The ALNS algorithm uses 4 destroy operators, 2 repair operators...

  18. Geographic information system-based healthcare waste management planning for treatment site location and optimal transportation routeing.

    Science.gov (United States)

    Shanmugasundaram, Jothiganesh; Soulalay, Vongdeuane; Chettiyappan, Visvanathan

    2012-06-01

    In Lao People's Democratic Republic (Lao PDR), a growth of healthcare centres, and the environmental hazards and public health risks typically accompanying them, increased the need for healthcare waste (HCW) management planning. An effective planning of an HCW management system including components such as the treatment plant siting and an optimized routeing system for collection and transportation of waste is deemed important. National government offices at developing countries often lack the proper tools and methodologies because of the high costs usually associated with them. However, this study attempts to demonstrate the use of an inexpensive GIS modelling tool for healthcare waste management in the country. Two areas were designed for this study on HCW management, including: (a) locating centralized treatment plants and designing optimum travel routes for waste collection from nearby healthcare facilities; and (b) utilizing existing hospital incinerators and designing optimum routes for collecting waste from nearby healthcare facilities. Spatial analysis paved the way to understand the spatial distribution of healthcare wastes and to identify hotspots of higher waste generating locations. Optimal route models were designed for collecting and transporting HCW to treatment plants, which also highlights constraints in collecting and transporting waste for treatment and disposal. The proposed model can be used as a decision support tool for the efficient management of hospital wastes by government healthcare waste management authorities and hospitals.

  19. Analysis of inertial choice behaviour based expected and experienced savings from a real-world route choice experiment

    NARCIS (Netherlands)

    Vreeswijk, J.D.; Rakha, H.; Van Berkum, E.; Van Arem, B.

    2014-01-01

    In the context of route choice, inertial behaviour shows that drivers make choices that are satisfactory rather than optimal. Consequently, drivers may not necessarily alter their choice when confronted with a travel time increase on the current choice or a travel time decrease of a choice

  20. Role of Travel Time Information on Day-to-Day Route Choice Behavior Based on Real-World Experiments

    NARCIS (Netherlands)

    van Essen, Mariska; Thomas, Tom; Chorus, Caspar; van Berkum, Eric C.

    2016-01-01

    It is widely believed that travel time information leads to reductions in traffic congestion and thereby improves network efficiency. An important research topic within travel behavior research is therefore how car drivers choose their routes, specifically when they receive travel time information.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2010-05-15

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

  2. Beyond Problem-Based Learning: Using Dynamic PBL in Chemistry

    Science.gov (United States)

    Overton, Tina L.; Randles, Christopher A.

    2015-01-01

    This paper describes the development and implementation of a novel pedagogy, dynamic problem-based learning. The pedagogy utilises real-world problems that evolve throughout the problem-based learning activity and provide students with choice and different data sets. This new dynamic problem-based learning approach was utilised to teach…

  3. Supply based on demand dynamical model

    Science.gov (United States)

    Levi, Asaf; Sabuco, Juan; Sanjuán, Miguel A. F.

    2018-04-01

    We propose and numerically analyze a simple dynamical model that describes the firm behaviors under uncertainty of demand. Iterating this simple model and varying some parameter values, we observe a wide variety of market dynamics such as equilibria, periodic, and chaotic behaviors. Interestingly, the model is also able to reproduce market collapses.

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

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

    Directory of Open Access Journals (Sweden)

    Mahyar Amirgholy

    2017-12-01

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

  6. DS-ARP: a new detection scheme for ARP spoofing attacks based on routing trace for ubiquitous environments.

    Science.gov (United States)

    Song, Min Su; Lee, Jae Dong; Jeong, Young-Sik; Jeong, Hwa-Young; Park, Jong Hyuk

    2014-01-01

    Despite the convenience, ubiquitous computing suffers from many threats and security risks. Security considerations in the ubiquitous network are required to create enriched and more secure ubiquitous environments. The address resolution protocol (ARP) is a protocol used to identify the IP address and the physical address of the associated network card. ARP is designed to work without problems in general environments. However, since it does not include security measures against malicious attacks, in its design, an attacker can impersonate another host using ARP spoofing or access important information. In this paper, we propose a new detection scheme for ARP spoofing attacks using a routing trace, which can be used to protect the internal network. Tracing routing can find the change of network movement path. The proposed scheme provides high constancy and compatibility because it does not alter the ARP protocol. In addition, it is simple and stable, as it does not use a complex algorithm or impose extra load on the computer system.

  7. Development of a hybrid genetic algorithm based decision support system for vehicle routing and scheduling in supply chain logistics managment

    OpenAIRE

    Khanian, Seyed Mohammad Shafi

    2007-01-01

    Vehicle Routing and Scheduling (VRS) constitute an important part of logistics management. Given the fact that the worldwide cost on physical distribution is evermore increasing, the global competition and the complex nature of logistics problems, one area, which determines the efficiency of all others, is the VRS activities. The application of Decision Support Systems (DSS) to assist logistics management with an efficient VRS could be of great benefit. Although the benefits of DSS in VRS are...

  8. A GIS-based decision support system for determining the shortest and safest route to forest fires: a case study in Mediterranean Region of Turkey.

    Science.gov (United States)

    Akay, Abdullah E; Wing, Michael G; Sivrikaya, Fatih; Sakar, Dursun

    2012-03-01

    The ability of firefighting vehicles and staff to reach a fire area as quickly as possible is critical in fighting against forest fires. In this study, a Geographical Information System-based decision support system was developed to assist fire managers in determining the fastest and the safest or more reliable access routes from firefighting headquarters to fire areas. The decision support system was tested in the Kahramanmaras Forestry Regional Directoratein the Mediterranean region of Turkey. The study area consisted of forested lands which had been classified according to fire sensitivity. The fire response routing simulations considered firefighting teams located in 20 firefighting headquarter locations. The road network, the locations of the firefighting headquarters, and possible fire locations were mapped for simulation analysis. In alternative application simulations, inaccessible roads which might be closed due to fire or other reasons were indicated in the network analysis so that the optimum route was not only the fastest but also the safest and most reliable path. The selection of which firefighting headquarters to use was evaluated by considering critical response time to potential fire areas based on fire sensitivity levels. Results indicated that new firefighting headquarters should be established in the region in order to provide sufficient firefighting response to all forested lands. In addition, building new fire access roads and increasing the design speed on current roads could also increase firefighting response capabilities within the study area.

  9. Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Marco Antonio Cruz-Chávez

    2016-01-01

    Full Text Available A stochastic algorithm for obtaining feasible initial populations to the Vehicle Routing Problem with Time Windows is presented. The theoretical formulation for the Vehicle Routing Problem with Time Windows is explained. The proposed method is primarily divided into a clustering algorithm and a two-phase algorithm. The first step is the application of a modified k-means clustering algorithm which is proposed in this paper. The two-phase algorithm evaluates a partial solution to transform it into a feasible individual. The two-phase algorithm consists of a hybridization of four kinds of insertions which interact randomly to obtain feasible individuals. It has been proven that different kinds of insertions impact the diversity among individuals in initial populations, which is crucial for population-based algorithm behavior. A modification to the Hamming distance method is applied to the populations generated for the Vehicle Routing Problem with Time Windows to evaluate their diversity. Experimental tests were performed based on the Solomon benchmarking. Experimental results show that the proposed method facilitates generation of highly diverse populations, which vary according to the type and distribution of the instances.

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

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

  12. VLSI implementation of a 2.8 Gevent/s packet based AER interface with routing and event sorting functionality

    Directory of Open Access Journals (Sweden)

    Stefan eScholze

    2011-10-01

    Full Text Available State-of-the-art large scale neuromorphic systems require sophisticated spike event communication between units of the neural network. We present a high-speed communication infrastructure for a waferscale neuromorphic system, based on application-specific neuromorphic communication ICs in an FPGA-maintained environment. The ICs implement configurable axonal delays, as required for certain types of dynamic processing or for emulating spike based learning among distant cortical areas. Measurements are presented which show the efficacy of these delays in influencing behaviour of neuromorphic benchmarks. The specialized, dedicated AER communication in most current systems requires separate, low-bandwidth configuration channels. In contrast, the configuration of the waferscale neuromorphic system is also handled by the digital packet-based pulse channel, which transmits configuration data at the full bandwidth otherwise used for pulse transmission. The overall so-called pulse communication subgroup (ICs and FPGA delivers a factor 25-50 more event transmission rate than other current neuromorphic communication infrastructures.

  13. Dynamic summarization of bibliographic-based data

    Directory of Open Access Journals (Sweden)

    Hurdle John F

    2011-02-01

    Full Text Available Abstract Background Traditional information retrieval techniques typically return excessive output when directed at large bibliographic databases. Natural Language Processing applications strive to extract salient content from the excessive data. Semantic MEDLINE, a National Library of Medicine (NLM natural language processing application, highlights relevant information in PubMed data. However, Semantic MEDLINE implements manually coded schemas, accommodating few information needs. Currently, there are only five such schemas, while many more would be needed to realistically accommodate all potential users. The aim of this project was to develop and evaluate a statistical algorithm that automatically identifies relevant bibliographic data; the new algorithm could be incorporated into a dynamic schema to accommodate various information needs in Semantic MEDLINE, and eliminate the need for multiple schemas. Methods We developed a flexible algorithm named Combo that combines three statistical metrics, the Kullback-Leibler Divergence (KLD, Riloff's RlogF metric (RlogF, and a new metric called PredScal, to automatically identify salient data in bibliographic text. We downloaded citations from a PubMed search query addressing the genetic etiology of bladder cancer. The citations were processed with SemRep, an NLM rule-based application that produces semantic predications. SemRep output was processed by Combo, in addition to the standard Semantic MEDLINE genetics schema and independently by the two individual KLD and RlogF metrics. We evaluated each summarization method using an existing reference standard within the task-based context of genetic database curation. Results Combo asserted 74 genetic entities implicated in bladder cancer development, whereas the traditional schema asserted 10 genetic entities; the KLD and RlogF metrics individually asserted 77 and 69 genetic entities, respectively. Combo achieved 61% recall and 81% precision, with an F

  14. DYNAMICS OF Cercospora zeina POPULATIONS IN MAIZE-BASED ...

    African Journals Online (AJOL)

    ACSS

    DYNAMICS OFCercospora zeina POPULATIONS IN MAIZE-BASED AGRO- ..... Population differentiation of Cercospora zeina in three districts of Uganda based on analysis of molecular variance ..... interactions: The example of the Erysiphe.

  15. A Mobile Information System Based on Crowd-Sensed and Official Crime Data for Finding Safe Routes: A Case Study of Mexico City

    Directory of Open Access Journals (Sweden)

    Félix Mata

    2016-01-01

    Full Text Available Mobile information systems agendas are increasingly becoming an essential part of human life and they play an important role in several daily activities. These have been developed for different contexts such as public facilities in smart cities, health care, traffic congestions, e-commerce, financial security, user-generated content, and crowdsourcing. In GIScience, problems related to routing systems have been deeply explored by using several techniques, but they are not focused on security or crime rates. In this paper, an approach to provide estimations defined by crime rates for generating safe routes in mobile devices is proposed. It consists of integrating crowd-sensed and official crime data with a mobile application. Thus, data are semantically processed by an ontology and classified by the Bayes algorithm. A geospatial repository was used to store tweets related to crime events of Mexico City and official reports that were geocoded for obtaining safe routes. A forecast related to crime events that can occur in a certain place with the collected information was performed. The novelty is a hybrid approach based on semantic processing to retrieve relevant data from unstructured data sources and a classifier algorithm to collect relevant crime data from official government reports with a mobile application.

  16. A Rule-Based Spatial Reasoning Approach for OpenStreetMap Data Quality Enrichment; Case Study of Routing and Navigation

    Science.gov (United States)

    2017-01-01

    Finding relevant geospatial information is increasingly critical because of the growing volume of geospatial data available within the emerging “Big Data” era. Users are expecting that the availability of massive datasets will create more opportunities to uncover hidden information and answer more complex queries. This is especially the case with routing and navigation services where the ability to retrieve points of interest and landmarks make the routing service personalized, precise, and relevant. In this paper, we propose a new geospatial information approach that enables the retrieval of implicit information, i.e., geospatial entities that do not exist explicitly in the available source. We present an information broker that uses a rule-based spatial reasoning algorithm to detect topological relations. The information broker is embedded into a framework where annotations and mappings between OpenStreetMap data attributes and external resources, such as taxonomies, support the enrichment of queries to improve the ability of the system to retrieve information. Our method is tested with two case studies that leads to enriching the completeness of OpenStreetMap data with footway crossing points-of-interests as well as building entrances for routing and navigation purposes. It is concluded that the proposed approach can uncover implicit entities and contribute to extract required information from the existing datasets. PMID:29088125

  17. Eavesdropping-aware routing and spectrum allocation based on multi-flow virtual concatenation for confidential information service in elastic optical networks

    Science.gov (United States)

    Bai, Wei; Yang, Hui; Yu, Ao; Xiao, Hongyun; He, Linkuan; Feng, Lei; Zhang, Jie

    2018-01-01

    The leakage of confidential information is one of important issues in the network security area. Elastic Optical Networks (EON) as a promising technology in the optical transport network is under threat from eavesdropping attacks. It is a great demand to support confidential information service (CIS) and design efficient security strategy against the eavesdropping attacks. In this paper, we propose a solution to cope with the eavesdropping attacks in routing and spectrum allocation. Firstly, we introduce probability theory to describe eavesdropping issue and achieve awareness of eavesdropping attacks. Then we propose an eavesdropping-aware routing and spectrum allocation (ES-RSA) algorithm to guarantee information security. For further improving security and network performance, we employ multi-flow virtual concatenation (MFVC) and propose an eavesdropping-aware MFVC-based secure routing and spectrum allocation (MES-RSA) algorithm. The presented simulation results show that the proposed two RSA algorithms can both achieve greater security against the eavesdropping attacks and MES-RSA can also improve the network performance efficiently.

  18. Economic and Environmental Evaluation of a Brick Delivery System Based on Multi-Trip Vehicle Loader Routing Problem for Small Construction Sites

    Directory of Open Access Journals (Sweden)

    Heungjo An

    2018-05-01

    Full Text Available While large construction sites have on-site loaders to handle heavy and large packages of bricks, small brick manufacturers employ a truck-mounted loader or sometimes deploy a loader truck to accompany normal brick delivery trucks to small construction sites lacking on-site loaders. It may be very challenging for small contractors to manage a sustainable delivery system that is both cost-effective and environmentally friendly. To address this issue, this paper proposes to solve a multi-trip vehicle loader routing problem by uniquely planning routes and schedules of several types of vehicles considering their synchronized operations at customer sites and multi trips. This paper also evaluates the sustainability of the developed model from both economic and environmental perspectives. Case studies based on small construction sites in the Middle East demonstrate applications of the proposed model to make the most economical plans for delivering bricks. Compared to the single-trip vehicle loader routing problem, the proposed model reduces, on average, 18.7% of the total delivery cost while increasing CO2 emission negligibly. The economic benefit is mainly achieved by reducing the required number of vehicles. Brick plant managers can use the proposed mathematical model to plan the most cost-effective delivery schedules sustainably while minimizing negative environmental effects.

  19. A Rule-Based Spatial Reasoning Approach for OpenStreetMap Data Quality Enrichment; Case Study of Routing and Navigation

    Directory of Open Access Journals (Sweden)

    Amin Mobasheri

    2017-10-01

    Full Text Available Finding relevant geospatial information is increasingly critical because of the growing volume of geospatial data available within the emerging “Big Data” era. Users are expecting that the availability of massive datasets will create more opportunities to uncover hidden information and answer more complex queries. This is especially the case with routing and navigation services where the ability to retrieve points of interest and landmarks make the routing service personalized, precise, and relevant. In this paper, we propose a new geospatial information approach that enables the retrieval of implicit information, i.e., geospatial entities that do not exist explicitly in the available source. We present an information broker that uses a rule-based spatial reasoning algorithm to detect topological relations. The information broker is embedded into a framework where annotations and mappings between OpenStreetMap data attributes and external resources, such as taxonomies, support the enrichment of queries to improve the ability of the system to retrieve information. Our method is tested with two case studies that leads to enriching the completeness of OpenStreetMap data with footway crossing points-of-interests as well as building entrances for routing and navigation purposes. It is concluded that the proposed approach can uncover implicit entities and contribute to extract required information from the existing datasets.

  20. An Overlay Architecture for Throughput Optimal Multipath Routing

    Science.gov (United States)

    2017-01-14

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

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

    Science.gov (United States)

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

    2017-11-01

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

  2. Hazmat Routes (National)

    Data.gov (United States)

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

  3. Congestion control and routing over satellite networks

    Science.gov (United States)

    Cao, Jinhua

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

  4. Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO

    Directory of Open Access Journals (Sweden)

    Xiaobing Gan

    2012-01-01

    Full Text Available This paper considers two additional factors of the widely researched vehicle routing problem with time windows (VRPTW. The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To solve the problem, an efficient multiswarm cooperative particle swarm optimization (MCPSO algorithm is applied. And a new encoding method is proposed for the extension VRPTW. Finally, comparing with genetic algorithm (GA and particle swarm optimization (PSO algorithm, the MCPSO algorithm performs best for solving this problem.

  5. The QKD network: model and routing scheme

    Science.gov (United States)

    Yang, Chao; Zhang, Hongqi; Su, Jinhai

    2017-11-01

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

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

  7. Microneedle-mediated immunization of an adenovirus-based malaria vaccine enhances antigen-specific antibody immunity and reduces anti-vector responses compared to the intradermal route.

    Science.gov (United States)

    Carey, John B; Vrdoljak, Anto; O'Mahony, Conor; Hill, Adrian V S; Draper, Simon J; Moore, Anne C

    2014-08-21

    Substantial effort has been placed in developing efficacious recombinant attenuated adenovirus-based vaccines. However induction of immunity to the vector is a significant obstacle to its repeated use. Here we demonstrate that skin-based delivery of an adenovirus-based malaria vaccine, HAdV5-PyMSP1₄₂, to mice using silicon microneedles induces equivalent or enhanced antibody responses to the encoded antigen, however it results in decreased anti-vector responses, compared to intradermal delivery. Microneedle-mediated vaccine priming and resultant induction of low anti-vector antibody titres permitted repeated use of the same adenovirus vaccine vector. This resulted in significantly increased antigen-specific antibody responses in these mice compared to ID-treated mice. Boosting with a heterologous vaccine; MVA-PyMSP1₄₂ also resulted in significantly greater antibody responses in mice primed with HAdV5-PyMSP1₄₂ using MN compared to the ID route. The highest protection against blood-stage malaria challenge was observed when a heterologous route of immunization (MN/ID) was used. Therefore, microneedle-mediated immunization has potential to both overcome some of the logistic obstacles surrounding needle-and-syringe-based immunization as well as to facilitate the repeated use of the same adenovirus vaccine thereby potentially reducing manufacturing costs of multiple vaccines. This could have important benefits in the clinical ease of use of adenovirus-based immunization strategies.

  8. Microneedle-mediated immunization of an adenovirus-based malaria vaccine enhances antigen-specific antibody immunity and reduces anti-vector responses compared to the intradermal route

    Science.gov (United States)

    Carey, John B.; Vrdoljak, Anto; O'Mahony, Conor; Hill, Adrian V. S.; Draper, Simon J.; Moore, Anne C.

    2014-01-01

    Substantial effort has been placed in developing efficacious recombinant attenuated adenovirus-based vaccines. However induction of immunity to the vector is a significant obstacle to its repeated use. Here we demonstrate that skin-based delivery of an adenovirus-based malaria vaccine, HAdV5-PyMSP142, to mice using silicon microneedles induces equivalent or enhanced antibody responses to the encoded antigen, however it results in decreased anti-vector responses, compared to intradermal delivery. Microneedle-mediated vaccine priming and resultant induction of low anti-vector antibody titres permitted repeated use of the same adenovirus vaccine vector. This resulted in significantly increased antigen-specific antibody responses in these mice compared to ID-treated mice. Boosting with a heterologous vaccine; MVA-PyMSP142 also resulted in significantly greater antibody responses in mice primed with HAdV5-PyMSP142 using MN compared to the ID route. The highest protection against blood-stage malaria challenge was observed when a heterologous route of immunization (MN/ID) was used. Therefore, microneedle-mediated immunization has potential to both overcome some of the logistic obstacles surrounding needle-and-syringe-based immunization as well as to facilitate the repeated use of the same adenovirus vaccine thereby potentially reducing manufacturing costs of multiple vaccines. This could have important benefits in the clinical ease of use of adenovirus-based immunization strategies. PMID:25142082

  9. Trip Energy Estimation Methodology and Model Based on Real-World Driving Data for Green Routing Applications: Preprint

    Energy Technology Data Exchange (ETDEWEB)

    Holden, Jacob [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Van Til, Harrison J [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Wood, Eric W [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Gonder, Jeffrey D [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhu, Lei [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

    2018-02-09

    A data-informed model to predict energy use for a proposed vehicle trip has been developed in this paper. The methodology leverages nearly 1 million miles of real-world driving data to generate the estimation model. Driving is categorized at the sub-trip level by average speed, road gradient, and road network geometry, then aggregated by category. An average energy consumption rate is determined for each category, creating an energy rates look-up table. Proposed vehicle trips are then categorized in the same manner, and estimated energy rates are appended from the look-up table. The methodology is robust and applicable to almost any type of driving data. The model has been trained on vehicle global positioning system data from the Transportation Secure Data Center at the National Renewable Energy Laboratory and validated against on-road fuel consumption data from testing in Phoenix, Arizona. The estimation model has demonstrated an error range of 8.6% to 13.8%. The model results can be used to inform control strategies in routing tools, such as change in departure time, alternate routing, and alternate destinations to reduce energy consumption. This work provides a highly extensible framework that allows the model to be tuned to a specific driver or vehicle type.

  10. Poster abstract: A decentralized routing scheme based on a zero-sum game to optimize energy in solar powered sensor networks

    KAUST Repository

    Dehwah, Ahmad H.

    2014-04-01

    This poster is aimed at solving the problem of maximizing the energy margin of a solar-powered sensor network at a fixed time horizon, to maximize the network performance during an event to monitor. Using a game theoretic approach, the optimal routing maximizing the energy margin of the network at a given time under solar power forcing can be computed in a decentralized way and solved exactly through dynamic programming with a low overall complexity. We also show that this decentralized algorithm is simple enough to be implemented on practical sensor nodes. Such an algorithm would be very useful whenever the energy margin of a solar-powered sensor network has to be maximized at a specific time. © 2014 IEEE.

  11. Poster abstract: A decentralized routing scheme based on a zero-sum game to optimize energy in solar powered sensor networks

    KAUST Repository

    Dehwah, Ahmad H.; Tembine, Hamidou; Claudel, Christian G.

    2014-01-01

    This poster is aimed at solving the problem of maximizing the energy margin of a solar-powered sensor network at a fixed time horizon, to maximize the network performance during an event to monitor. Using a game theoretic approach, the optimal routing maximizing the energy margin of the network at a given time under solar power forcing can be computed in a decentralized way and solved exactly through dynamic programming with a low overall complexity. We also show that this decentralized algorithm is simple enough to be implemented on practical sensor nodes. Such an algorithm would be very useful whenever the energy margin of a solar-powered sensor network has to be maximized at a specific time. © 2014 IEEE.

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

  13. Arresting Strategy Based on Dynamic Criminal Networks Changing over Time

    Directory of Open Access Journals (Sweden)

    Junqing Yuan

    2013-01-01

    Full Text Available We investigate a sequence of dynamic criminal networks on a time series based on the dynamic network analysis (DNA. According to the change of networks’ structure, networks’ variation trend is analyzed to forecast its future structure. Finally, an optimal arresting time and priority list are designed based on our analysis. Better results can be expected than that based on social network analysis (SNA.

  14. High dynamic range image acquisition based on multiplex cameras

    Science.gov (United States)

    Zeng, Hairui; Sun, Huayan; Zhang, Tinghua

    2018-03-01

    High dynamic image is an important technology of photoelectric information acquisition, providing higher dynamic range and more image details, and it can better reflect the real environment, light and color information. Currently, the method of high dynamic range image synthesis based on different exposure image sequences cannot adapt to the dynamic scene. It fails to overcome the effects of moving targets, resulting in the phenomenon of ghost. Therefore, a new high dynamic range image acquisition method based on multiplex cameras system was proposed. Firstly, different exposure images sequences were captured with the camera array, using the method of derivative optical flow based on color gradient to get the deviation between images, and aligned the images. Then, the high dynamic range image fusion weighting function was established by combination of inverse camera response function and deviation between images, and was applied to generated a high dynamic range image. The experiments show that the proposed method can effectively obtain high dynamic images in dynamic scene, and achieves good results.

  15. Cluster-based Dynamic Energy Management for Collaborative Target Tracking in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Dao-Wei Bi

    2007-07-01

    Full Text Available A primary criterion of wireless sensor network is energy efficiency. Focused onthe energy problem of target tracking in wireless sensor networks, this paper proposes acluster-based dynamic energy management mechanism. Target tracking problem isformulated by the multi-sensor detection model as well as energy consumption model. Adistributed adaptive clustering approach is investigated to form a reasonable routingframework which has uniform cluster head distribution. Dijkstra’s algorithm is utilized toobtain optimal intra-cluster routing. Target position is predicted by particle filter. Thepredicted target position is adopted to estimate the idle interval of sensor nodes. Hence,dynamic awakening approach is exploited to prolong sleep time of sensor nodes so that theoperation energy consumption of wireless sensor network can be reduced. The sensornodes around the target wake up on time and act as sensing candidates. With the candidatesensor nodes and predicted target position, the optimal sensor node selection is considered.Binary particle swarm optimization is proposed to minimize the total energy consumptionduring collaborative sensing and data reporting. Experimental results verify that theproposed clustering approach establishes a low-energy communication structure while theenergy efficiency of wireless sensor networks is enhanced by cluster-based dynamic energymanagement.

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

  17. Dynamics-based sequential memory: Winnerless competition of patterns

    International Nuclear Information System (INIS)

    Seliger, Philip; Tsimring, Lev S.; Rabinovich, Mikhail I.

    2003-01-01

    We introduce a biologically motivated dynamical principle of sequential memory which is based on winnerless competition (WLC) of event images. This mechanism is implemented in a two-layer neural model of sequential spatial memory. We present the learning dynamics which leads to the formation of a WLC network. After learning, the system is capable of associative retrieval of prerecorded sequences of patterns

  18. Likelihood-based Dynamic Factor Analysis for Measurement and Forecasting

    NARCIS (Netherlands)

    Jungbacker, B.M.J.P.; Koopman, S.J.

    2015-01-01

    We present new results for the likelihood-based analysis of the dynamic factor model. The latent factors are modelled by linear dynamic stochastic processes. The idiosyncratic disturbance series are specified as autoregressive processes with mutually correlated innovations. The new results lead to

  19. Dynamic market behaviour of autonomous network based power systems

    NARCIS (Netherlands)

    Jokic, A.; Wittebol, E.H.M.; Bosch, van den P.P.J.

    2006-01-01

    Dynamic models of real-time markets are important since they lead to additional insights of the behavior and stability of power system markets. The main topic of this paper is the analysis of real-time market dynamics in a novel power system structure that is based on the concept of autonomous

  20. A dynamic usage based perspective on L2 writing

    NARCIS (Netherlands)

    Verspoor, M.H.; Schmid, M.S.; Xu, X.

    The goal of this study was to explore the contribution that a dynamic usage based (DUB) perspective can bring to the establishment of objective measures to assess L2 learners' written texts and at the same time to gain insight into the dynamic process of language development. Four hundred and thirty