WorldWideScience

Sample records for policy based routing

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

  2. Implementasi Policy Base Routing dan Failover Menggunakan Router Mikrotik untuk Membagi Jalur Akses Internet di FMIPA Unnes

    Directory of Open Access Journals (Sweden)

    Ryo Pambudi

    2017-05-01

    Full Text Available Increasing requirement for information in every year become an important requirement for every society, organizations, and others institution. Semarang State University (Unnes had using online information systems in every aspect. It needs high speed and reliable internet connection, so the using of two Internet Service Provider (ISP or public pathways are highly commended. Internet access point density due to the number of users such as students, faculty, and employees to be one of the factors that can interfere with such information systems. Routing settings on Mikrotik router become one of the solutions to reduce density access of internet. The useful of policy-base routing is to separate the path which will be passed when the accessing the Internet and the useful of failover technique is to move path automatically if one access point (ISP impaired / down. Comparison before and after applying these two techniques while accessing the Unnes information systems results increasing access speed with 4 ms response time faster than before used policy base routing. Pertumbuhan dan kebutuhan akan informasi semakin tahun menjadi sebuah kebutuhan vital bagi setiap masyarakat pada umumnya dan bagi organisasi maupun lembaga pendidikan pada khususnya. Universitas Negeri Semarang (Unnes yang telah lama menggunakan sistem informasi secara online dalam setiap aspek, membutuhkan internet yang cepat dan handal sehingga penggunaan dua Internet Service Provider (ISP atau jalur publik sangat dianjurkan. Kepadatan jalur akses internet akibat banyaknya pengguna yaitu mahasiswa, dosen, dan karyawan menjadi salah satu faktor yang dapat mengganggu sistem-sistem informasi tersebut. Pengaturan routing pada router Mikrotik menjadi salah satu solusi untuk mengurangi kepadatan jalur akses internet. Policy base routing dapat berguna untuk memisahkan jalur mana yang akan dilewati pengguna saat mengakses internet dan teknik failover berguna untuk memindahkan jalur otomatis jika

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

  4. Improving routing efficiency through intermediate target based geographic routing

    Directory of Open Access Journals (Sweden)

    Zongming Fei

    2015-08-01

    Full Text Available The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR to solve the long detour path problem. The basic idea is to use previous experience to determine the destination areas that are shaded by the holes. The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes. We design an efficient method for the source to find out whether a destination node belongs to a shaded area. The source then selects an intermediate node as the tentative target and greedily forwards packets to it, which in turn forwards the packet to the final destination by greedy routing. ITGR can combine multiple shaded areas to improve the efficiency of representation and routing. We perform simulations and demonstrate that ITGR significantly reduces the routing path length, compared with existing geographic routing protocols.

  5. The Route Analysis Based On Flight Plan

    Science.gov (United States)

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

    2016-02-01

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

  6. Container Swap Trailer Transportation Routing Problem Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Hua-wei Ma

    2018-01-01

    Full Text Available In swap trailer transportation routing problems, trucks and trailers conduct swap operations at special positions called trailer points. The parallelization of stevedoring and transportation can be achieved by means of these trailer points. This logistics organization mode can be more effective than the others. In this paper, an integer programming model with capacity and time-window constraints was established. A repairing strategy is embedded in the genetic algorithm (GA to solve the model. The repairing strategy is executed after the crossover and mutation operation to eliminate the illegal routes. Furthermore, a parameter self-adaptive adjustment policy is designed to improve the convergence. Then numerical experiments are implemented based on the generated datasets; the performance and robustness of the algorithm parameter self-adaptive adjustment policy are discussed. Finally, the results show that the improved algorithm performs better than elementary GA.

  7. ROUTING BASE CONGESTION CONTROL METRICS IN MANETS

    Directory of Open Access Journals (Sweden)

    Sandeep Dalal

    2014-09-01

    Full Text Available Mobile adhoc network is self-configurable and adaptive. Due to node mobility we cannot predict load on the network which leads to congestion, one of the widely researched area in manets. A lot of congestion control techniques and metrics have been proposed to overcome it before its occurrence or after it has occurred. In this survey we identify the currently used congestion control metrics. Through this survey we also propose a congestion control metric RFR(resource free ratio which considers three most important parameters to provide congestion free route discovery. Further we show the results of node selection based on fuzzy logic calculations using the proposed metric.

  8. Forks in the Road. Alternative Routes for International Climate Policies and their Implications for the Netherlands

    International Nuclear Information System (INIS)

    Slingerland, S.; Meyer, L.; Van Vuuren, D.; Den Elzen, M.

    2011-11-01

    Several scenarios are possible for future international climate policies, each with a different role in the climate negotiations under the United Nations Framework Convention on Climate Change (UNFCCC). These scenarios assume policies that are comparable to the current policies, as well as more fragmented and more integrated international climate policies. The various alternative routes have been assessed with respect to their potential consequences. These assessments showed that none of the proposed routes could fully replace the current negotiation process under the UNFCCC, but rather that they could contribute to generating societal support for future climate policies. In addition, the report presents an analysis of how the Netherlands could use this development of alternative routes for international climate policy. Possible responses by the Netherlands to each of these scenarios would depend on the degree to which climate change as a policy topic is considered a priority in the Netherlands.

  9. The Efficiency of Constraint Based Routing in MPLS Networks

    Directory of Open Access Journals (Sweden)

    Martin Medvecky

    2011-01-01

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

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

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

  12. Policy Route Map for Academic Libraries' Digital Content

    Science.gov (United States)

    Koulouris, Alexandros; Kapidakis, Sarantos

    2012-01-01

    This paper presents a policy decision tree for digital information management in academic libraries. The decision tree is a policy guide, which offers alternative access and reproduction policy solutions according to the prevailing circumstances (for example acquisition method, copyright ownership). It refers to the digital information life cycle,…

  13. ACO Agent Based Routing in AOMDV Environment

    Directory of Open Access Journals (Sweden)

    Kaur Amanpreet

    2016-01-01

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

  14. Selection of optimal variant route based on dynamic fuzzy GRA

    Directory of Open Access Journals (Sweden)

    Jalil Heidary Dahooie

    2018-09-01

    Full Text Available Given the high costs of construction and maintenance, an optimum design methodology is one of the most important steps towards the development of transportation infrastructure, especially freeways. However, the effects of different variables on the decision-making process to find an optimal variant have caused the choice to become a very difficult and professional task for decision makers. So, the current paper aims to determine the optimal variant route for Isfahan-Shiraz freeway through MADM approaches. First, evaluation indices for an optimal route variant are derived through literature review and expert panel assessment. Then, a dynamic fuzzy GRA method is used for weightings and optimal route selection. Bases on the results, the road longevity, views of NGOs and route integration are identified as the highest-weighted criteria in route variant prioritization. Further, Route 3 is defined as the priority for the optimal variant for Isfahan–Shiraz freeway, which is the main basis in practice.

  15. Big Data and Dementia: Charting the Route Ahead for Research, Ethics, and Policy

    Directory of Open Access Journals (Sweden)

    Marcello Ienca

    2018-02-01

    Full Text Available Emerging trends in pervasive computing and medical informatics are creating the possibility for large-scale collection, sharing, aggregation and analysis of unprecedented volumes of data, a phenomenon commonly known as big data. In this contribution, we review the existing scientific literature on big data approaches to dementia, as well as commercially available mobile-based applications in this domain. Our analysis suggests that big data approaches to dementia research and care hold promise for improving current preventive and predictive models, casting light on the etiology of the disease, enabling earlier diagnosis, optimizing resource allocation, and delivering more tailored treatments to patients with specific disease trajectories. Such promissory outlook, however, has not materialized yet, and raises a number of technical, scientific, ethical, and regulatory challenges. This paper provides an assessment of these challenges and charts the route ahead for research, ethics, and policy.

  16. Big Data and Dementia: Charting the Route Ahead for Research, Ethics, and Policy.

    Science.gov (United States)

    Ienca, Marcello; Vayena, Effy; Blasimme, Alessandro

    2018-01-01

    Emerging trends in pervasive computing and medical informatics are creating the possibility for large-scale collection, sharing, aggregation and analysis of unprecedented volumes of data, a phenomenon commonly known as big data. In this contribution, we review the existing scientific literature on big data approaches to dementia, as well as commercially available mobile-based applications in this domain. Our analysis suggests that big data approaches to dementia research and care hold promise for improving current preventive and predictive models, casting light on the etiology of the disease, enabling earlier diagnosis, optimizing resource allocation, and delivering more tailored treatments to patients with specific disease trajectories. Such promissory outlook, however, has not materialized yet, and raises a number of technical, scientific, ethical, and regulatory challenges. This paper provides an assessment of these challenges and charts the route ahead for research, ethics, and policy.

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

    African Journals Online (AJOL)

    PROF. O. E. OSUAGWU

    2013-09-01

    Sep 1, 2013 ... Ant Colony Optimization, a swarm intelligence based optimization technique, has been successfully used in network routing. In this paper, we introduce a heuristic way to reduce energy consumption in WSNs routing process using Ant Colony Optimization. We introduce three Ant Colony Optimization ...

  18. 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...... the client to perform certain actions. Generally, these mechanisms require some underlying infrastructure, e.g., a public key infrastructure (PKI). However, we cannot assume such infrastructures to be in place in an ad hoc network. In this paper we propose an extension to an existing ad hoc routing protocols......, which selects the route based on a local evaluation of the trustworthiness of all known intermediary nodes (routers) on the route to the destination. We have implemented this mechanism in an existing ad hoc routing protocol, and we show how trust can be built from previous experience and how trust can...

  19. An Alternative Route of Legal Integration: The Community's Railways Policy

    Directory of Open Access Journals (Sweden)

    Christoph Knill

    1998-05-01

    Full Text Available The process of European integration and policy-making is sometimes rather puzzling. On the one hand, it is well documented that with respect to the implementation of European legislation member states tend to do less than they are supposed to do. On the other hand, it is striking that with respect to the implementation of the Council Directive 91/440 on the development of the Community's railways many member states went far beyond the minimum required by the European legislation. We argue that these differing evaluations of implementation success can be traced to different implementation approaches, which may be termed the ‘compliance approach’ and the ‘support-building approach’. While the first is directed at prescribing domestic reforms "from above", the latter aims at triggering European integration within the existing political context at the national level. Here, successful implementation refers to the extent to which European legislation triggers domestic changes by stimulating and strengthening support for European reform ideas at the national level. In this respect, European legislation can influence the domestic arenas in basically three ways: by providing legitimisation for political leadership, concepts for the solution of national problems, and strategic constraints for domestic actors opposing domestic reforms.

  20. 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...... of virtual devices and allow the droplets to move on the chip on any route during operation execution. Thus, the synthesis problem is transformed into a routing problem. We develop an algorithm based on a Greedy Randomized Adaptive Search Procedure (GRASP) and we show that routing-based synthesis leads...

  1. Deadlock Avoidance Policy in Mobile Wireless Sensor Networks with Free Choice Resource Routing

    Directory of Open Access Journals (Sweden)

    Prasanna Ballal

    2008-11-01

    Full Text Available Efficient control schemes are required for effective cooperation of robot teams in a mobile wireless sensor network. If the robots (resources are also in charge of executing multiple simultaneous missions, then risks of deadlocks due to the presence of shared resources among different missions increase and have to be tackled. Discrete event control with deadlock avoidance has been used in the past for robot team coordination for the case of multi reentrant flowline models with shared resources. In this paper we present an analysis of deadlock avoidance for a generalized case of multi reentrant flow line systems (MRF called the Free Choice Multi Reentrant Flow Line systems (FMRF. In FMRF, some tasks have multiple resource choices; hence routing decisions have to be made and current results in deadlock avoidance for MRF do not hold. This analysis is based on the so-called Circular Waits (CW of the resources in the system. For FMRF, the well known notions of Critical Siphons and Critical Subsystems must be generalized and we redefine these objects for such systems. Our second contribution provides a matrix formulation that efficiently computes the objects required for deadlock avoidance in FMRF systems. A MAXWIP dispatching policy is formulated for deadlock avoidance in FMRF systems. According to this policy, deadlock in FMRF is avoided by limiting the work in progress (WIP in the critical subsystems of each CW. Implemented results of the proposed scheme in a WSN test-bed is presented in the paper.

  2. Deadlock Avoidance Policy in Mobile Wireless Sensor Networks with Free Choice Resource Routing

    Directory of Open Access Journals (Sweden)

    Prasanna Ballal

    2008-09-01

    Full Text Available Efficient control schemes are required for effective cooperation of robot teams in a mobile wireless sensor network. If the robots (resources are also in charge of executing multiple simultaneous missions, then risks of deadlocks due to the presence of shared resources among different missions increase and have to be tackled. Discrete event control with deadlock avoidance has been used in the past for robot team coordination for the case of multi reentrant flowline models with shared resources. In this paper we present an analysis of deadlock avoidance for a generalized case of multi reentrant flow line systems (MRF called the Free Choice Multi Reentrant Flow Line systems (FMRF. In FMRF, some tasks have multiple resource choices; hence routing decisions have to be made and current results in deadlock avoidance for MRF do not hold. This analysis is based on the so-called Circular Waits (CW of the resources in the system. For FMRF, the well known notions of Critical Siphons and Critical Subsystems must be generalized and we redefine these objects for such systems. Our second contribution provides a matrix formulation that efficiently computes the objects required for deadlock avoidance in FMRF systems. A MAXWIP dispatching policy is formulated for deadlock avoidance in FMRF systems. According to this policy, deadlock in FMRF is avoided by limiting the work in progress (WIP in the critical subsystems of each CW. Implemented results of the proposed scheme in a WSN test-bed is presented in the paper.

  3. Evidence-based policy

    DEFF Research Database (Denmark)

    Vohnsen, Nina Holm

    2013-01-01

    A current ambition in welfare states as diverse as Denmark, the UK, and in the USA is to base political decision making on rigorous research (Cartwright et al 2009; Mulgan 2009; Bason 2010). Sound as this might seem the ambition has nevertheless been problematized by both policy-makers and the re......A current ambition in welfare states as diverse as Denmark, the UK, and in the USA is to base political decision making on rigorous research (Cartwright et al 2009; Mulgan 2009; Bason 2010). Sound as this might seem the ambition has nevertheless been problematized by both policy......-makers and the research community (e.g. Boden & Epstein 2006; House of Commons 2006; Cartwright et al 2009; Rod 2010; Vohnsen 2011). This article intends to draw out some general pitfalls in the curious meeting of science and politics by focusing on a particular attempt to make evidence-based legislation in Denmark (for...... a full account, see Vohnsen 2011). These insights will be relevant for the anthropological researcher of legislative processes who wishes to move beyond a merely discursive approach to the study of policy and politics....

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

  5. A network coding based routing protocol for underwater sensor networks.

    Science.gov (United States)

    Wu, Huayang; Chen, Min; Guan, Xin

    2012-01-01

    Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime.

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

  7. A native Bayesian classifier based routing protocol for VANETS

    Science.gov (United States)

    Bao, Zhenshan; Zhou, Keqin; Zhang, Wenbo; Gong, Xiaolei

    2016-12-01

    Geographic routing protocols are one of the most hot research areas in VANET (Vehicular Ad-hoc Network). However, there are few routing protocols can take both the transmission efficient and the usage of ratio into account. As we have noticed, different messages in VANET may ask different quality of service. So we raised a Native Bayesian Classifier based routing protocol (Naive Bayesian Classifier-Greedy, NBC-Greedy), which can classify and transmit different messages by its emergency degree. As a result, we can balance the transmission efficient and the usage of ratio with this protocol. Based on Matlab simulation, we can draw a conclusion that NBC-Greedy is more efficient and stable than LR-Greedy and GPSR.

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

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

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

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

  12. Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

    Science.gov (United States)

    Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

    2010-11-23

    A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

  13. Genetic based optimization for multicast routing algorithm for MANET

    Indian Academy of Sciences (India)

    In this paper, a Hybrid Genetic Based Optimization for Multicast Routing algorithm is proposed. The proposed algorithm uses the best features of Genetic Algorithm (GA) and particle swarm optimization (PSO) to improve the solution. Simulations were conducted by varying number of mobile nodes and results compared with ...

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

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

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

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

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

  19. Deflection routing scheme for GMPLS-based OBS networks

    DEFF Research Database (Denmark)

    Eid, Arafat; Mahmood, Waqar; Alomar, Anwar

    2010-01-01

    is not applicable in such an integrated solution. This is due to the existence of already established Label Switched Paths (LSPs) between edge nodes in a GMPLS-based OBS network which guide the Data Burst Headers (DBHs) through the network. In this paper we propose a novel deflection routing scheme which can...... be implemented in GMPLS-based OBS Control Plane. In this scheme, deflection routes or LSPs are designed and pre-established for the whole network. The ingress nodes are responsible for enabling DBHs for deflection at contending core ports prior to DBHs transmission. Moreover, we propose an object extension...... for Path and Resv messages of the RSVP-TE protocol to be able to utilize both messages for deflection labels dissemination. The scheme simulation results show reduction in data bursts blocking probability....

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

  1. VANET Clustering Based Routing Protocol Suitable for Deserts

    Science.gov (United States)

    Mohammed Nasr, Mohammed Mohsen; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

    2016-01-01

    In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms. PMID:27058539

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

  3. Cosmic Radiation Exposure on Canadian-Based Commercial Airline Routes

    International Nuclear Information System (INIS)

    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-01-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 -1 , but will be below the occupational limit of 20 mSv.y -1 . (author)

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

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

  6. Routing Based on Information about the Routes of Fixed-Route Traveling Nodes and on Destination Areas Aimed at Reducing the Load on the DTN

    Directory of Open Access Journals (Sweden)

    Kazuaki Okamoto

    2016-04-01

    Full Text Available In recent years, the interest in delay/disruption tolerant networking (DTN is growing as a means of communication in times of disaster. To ensure that a DTN works well in an emergency, it is desirable to promote general use of the DTN, so that it will also be used in normal times. Since the DTN uses mobile terminals and vehicles, which are not dedicated network devices, as relay nodes, the routing method should be such that it does not impose a large processing load on relay nodes. This paper considers use of a DTN for a day-to-day service of delivering content to a specific area and proposes a new routing method that is based on information about the routes of fixed-route traveling nodes, such as public transportation vehicles. The destination of a bundle is specified not by a terminal identifier, but by an area, which is identified by its location information. This paper presents an outbound-type bundle protocol, which is used by relay nodes when they have received a forwarding-bundle request from a sending terminal and try to determine whether the bundle can reach its destination area. Using simulation, the superiority of the proposed routing was confirmed by comparing it to existing routing methods in terms of the bundle arrival rate and factors that affect the network load, such as the number of bundle copies, the number of hops and the maximum required buffer size.

  7. The route to a national health policy lies through the states.

    Science.gov (United States)

    Silver, G A

    1991-01-01

    National health program legislation has been becalmed in the Congress for almost 80 years. Despite periodic cries of "crisis," legislation never emerges from committee. Periodically, campaigns have been mounted without success. Tactical efforts to circumvent direct action by legislating bits and pieces of related programs, Medicare and Medicaid, health maintenance organization support, and pre-budgeting, have complicated operation of the medical care system and stimulated intractable cost inflation. For the first 150 years of American history, responsibility for public health and welfare legislation rested with the states. Most public health policies originated in a state or a few states and then later became national legislation. The state efforts were, in effect, natural experiments. After the Depression and the flood of funding from the federal government in subsequent years, the states faded as innovators. It is proposed that funding a few state models to restimulate state initiative in this regard will provide a more effective route to a national health program.

  8. Climate policy decisions require policy-based lifecycle analysis.

    Science.gov (United States)

    Bento, Antonio M; Klotz, Richard

    2014-05-20

    Lifecycle analysis (LCA) metrics of greenhouse gas emissions are increasingly being used to select technologies supported by climate policy. However, LCAs typically evaluate the emissions associated with a technology or product, not the impacts of policies. Here, we show that policies supporting the same technology can lead to dramatically different emissions impacts per unit of technology added, due to multimarket responses to the policy. Using a policy-based consequential LCA, we find that the lifecycle emissions impacts of four US biofuel policies range from a reduction of 16.1 gCO2e to an increase of 24.0 gCO2e per MJ corn ethanol added by the policy. The differences between these results and representative technology-based LCA measures, which do not account for the policy instrument driving the expansion in the technology, illustrate the need for policy-based LCA measures when informing policy decision making.

  9. Policy implications of Iran's Nuclear Deal in technical terms for the plutonium route, uranium route, covert options, inspections, monitoring and verifications

    Energy Technology Data Exchange (ETDEWEB)

    Pinheiro, Andre Ricardo M., E-mail: andrericardopinheiro@usp.br [Universidade de São Paulo (USP), SP (Brazil). Departamento de Engenharia Naval; Guimarães, Leonam dos Santos, E-mail: leonam@eletronuclear.gov.br [Eletrobrás Termonuclear S.A. (ELETRONUCLEAR), Rio de Janeiro, RJ (Brazil)

    2017-07-01

    The present Paper addresses the policy implications of Joint Comprehensive Plan of Action (JCPOA) known as 'Ian Nuclear Deal', implemented on 16{sup th} January of 2016 between the Iran and the P5+1 countries (the U.S., U.K. France, Germany, Russia, and China), along with the EU in technical terms to analyze the Plutonium Route, Uranium Route and the Covert options and Inspections, Monitoring and Verifications. A historical review is presented to understand how the Iranian Nuclear Program is formed. Following is shown the current nuclear facilities in Iran and its capacity to process nuclear materials. It is analyzed the impact of JCPOA in Uranium and Plutonium routes. Covert Options always will be an option, so the most sensitive impact is related to the new monitoring and verification policies that must ensure real control of illegal procedures. The main conclusion is that the deal postpones the Iran's nuclear program for more than a decade (15 years), delaying Iran's nuclear bomb time from a few months to at least one year, although there is a current latent capacity to develop a nuclear bomb in Uranium route. It also gives IAEA inspectors capability to monitor nuclear activities and prevent to possible development to a nuclear bomb. To arrive in this conclusion an extensive technical analyze of impact of JCPOA in Iran's nuclear capabilities was made to discover how effective is the deal to prevent Iran to build, or acquire a nuclear weapon. (author)

  10. Policy implications of Iran's Nuclear Deal in technical terms for the plutonium route, uranium route, covert options, inspections, monitoring and verifications

    International Nuclear Information System (INIS)

    Pinheiro, Andre Ricardo M.

    2017-01-01

    The present Paper addresses the policy implications of Joint Comprehensive Plan of Action (JCPOA) known as 'Ian Nuclear Deal', implemented on 16 th January of 2016 between the Iran and the P5+1 countries (the U.S., U.K. France, Germany, Russia, and China), along with the EU in technical terms to analyze the Plutonium Route, Uranium Route and the Covert options and Inspections, Monitoring and Verifications. A historical review is presented to understand how the Iranian Nuclear Program is formed. Following is shown the current nuclear facilities in Iran and its capacity to process nuclear materials. It is analyzed the impact of JCPOA in Uranium and Plutonium routes. Covert Options always will be an option, so the most sensitive impact is related to the new monitoring and verification policies that must ensure real control of illegal procedures. The main conclusion is that the deal postpones the Iran's nuclear program for more than a decade (15 years), delaying Iran's nuclear bomb time from a few months to at least one year, although there is a current latent capacity to develop a nuclear bomb in Uranium route. It also gives IAEA inspectors capability to monitor nuclear activities and prevent to possible development to a nuclear bomb. To arrive in this conclusion an extensive technical analyze of impact of JCPOA in Iran's nuclear capabilities was made to discover how effective is the deal to prevent Iran to build, or acquire a nuclear weapon. (author)

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

  15. A secure cluster-based multipath routing protocol for WMSNs.

    Science.gov (United States)

    Almalkawi, Islam T; Zapata, Manel Guerrero; Al-Karaki, Jamal N

    2011-01-01

    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.

  16. COSR: A Reputation-Based Secure Route Protocol in MANET

    Directory of Open Access Journals (Sweden)

    Yang LaurenceT

    2010-01-01

    Full Text Available Now, the route protocols defined in the Mobile Ad Hoc Network (MANET are constructed in a common assumption which all nodes contained in such networks are trustworthy and cooperative. Once malicious or selfish nodes exist, all route paths built by these protocols must be broken immediately. According to the secure problems within MANET, this paper proposes Cooperative On-demand Secure Route (COSR, a novel secure source route protocol, against malicious and selfish behaviors. COSR measures node reputation (NR and route reputation (RR by contribution, Capability of Forwarding (CoF and recommendation upon Dynamic Source Route (DSR and uses RR to balance load to avoid hotpoint. Furthermore, COSR defines path collection algorithm by NR to enhance efficiency of protocol. At last, we verify COSR through GloMoSim. Results show that COSR is secure and stable.

  17. Environment based innovation: policy questions

    Directory of Open Access Journals (Sweden)

    Mario Rui Silva

    2009-12-01

    Full Text Available Natural resources and physical cultural resources, referred to in this paper as “Environmental Resources”, can be important assets for regional competitiveness and innovation. In recent years, these types of assets have been increasingly taken into consideration in the design and implementation of regional development strategies, as a consequence of their potential role as a source of differentiation and of new competitive advantages. However, in contrast to environmental policies, which usually focus on the protection of the environment, innovation policies and their instruments are largely shaped by, and geared towards, knowledge-based innovation.In this paper, we discuss the role played by environmental resources in the context of regional innovation policies. We begin by discussing the relationship between environmental resources and regional development, and by emphasizing some contrasting views with regard to the function of environmental resources in regional development. Then, we address the relationship between regional competitive advantages and innovation strategies. The specific issues and problems that arise whenever the aim is to attain competitive advantages through the valorisation of environmental resources constitute the core of section III. In that section, we highlight the specific characteristics of environmental resources and we discuss the applicability of the “natural resource curse” argument to the dynamics based on the valorisation of environmental resources. The reasons that justify public interventionas well as the difficulties concerning the adequate level of intervention (local / regional / national are also examined. The paper ends with some conclusions and policy implications.

  18. Context sensitive trust based geographic opportunistic routing in ...

    Indian Academy of Sciences (India)

    The coarse-grained trust measure includes positive progress per hop and behavioral attribute of the nodes in terms of routing service. The fine-grained trust evaluation differs the opportunistic routing environment from the adverse scenarios and aids the source node such that it builds a highly trusted positive progress set ...

  19. Threshold based AntNet algorithm for dynamic traffic routing of road networks

    Directory of Open Access Journals (Sweden)

    Ayman M. Ghazy

    2012-07-01

    Full Text Available Dynamic routing algorithms play an important role in road traffic routing to avoid congestion and to direct vehicles to better routes. AntNet routing algorithms have been applied, extensively and successfully, in data communication network. However, its application for dynamic routing on road networks is still considerably limited. This paper presents a modified version of the AntNet routing algorithm, called “Threshold based AntNet”, that has the ability to efficiently utilize a priori information of dynamic traffic routing, especially, for road networks. The modification exploits the practical and pre-known information for most road traffic networks, namely, the good travel times between sources and destinations. The values of those good travel times are manipulated as threshold values. This approach has proven to conserve tracking of good routes. According to the dynamic nature of the problem, the presented approach guards the agility of rediscovering a good route. Attaining the thresholds (good reported travel times, of a given source to destination route, permits for a better utilization of the computational resources, that, leads to better accommodation for the network changes. The presented algorithm introduces a new type of ants called “check ants”. It assists in preserving good routes and, better yet, exposes and discards the degraded ones. The threshold AntNet algorithm presents a new strategy for updating the routing information, supported by the backward ants.

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

  1. Ciclovía initiatives: engaging communities, partners, and policy makers along the route to success.

    Science.gov (United States)

    Zieff, Susan G; Hipp, J Aaron; Eyler, Amy A; Kim, Mi-Sook

    2013-01-01

    Recent efforts to increase physical activity through changes to the built environment have led to strategies and programs that use existing public space, including bicycle lanes, temporary parks, and the ciclovia initiative (scheduled events in which streets are closed to motorized vehicles and opened for recreational activities) popularized in South America. This article describes and compares the processes and structures involved in developing and implementing a ciclovia-type program in 2 US urban contexts: San Francisco, California, and St Louis, Missouri. Considering the current growth of and interest in ciclovia initiatives, important outcomes, lessons learned are offered for application in other, similar settings. Primary sources from both initiatives and from published research on ciclovias constitute the body of evidence and include year-end reports, grant applications, meeting minutes, budgets, published ciclovia guidelines, evaluation studies and Web sites, media sources, and interviews and personal communication with the organizers. Primary source documents were reviewed and included in this analysis if they offered information on 3 grounded questions: What processes were used in developing the initiative? What are the current structures and practices used in implementation of initiatives? What are important lessons learned and best practices from initiatives for recommendations to stakeholders and policy makers in other contexts? Among the categories compared, the structures and processes for implementation regarding buy-in and city department collaboration, route selection, programming, partnerships, media promotion, community outreach, and merchant support were relatively similar among the 2 initiatives. The categories that differed included staffing and volunteer engagement and funding. Buy-in from community partners, merchants, residents, and city agencies is critical for a positive experience in developing and implementing ciclovia-type initiatives

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

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

  4. Impact of mobility models on clustering based routing protocols in mobile WSNs

    OpenAIRE

    Khan, Atta ur Rehman; Ali, Shahzad; Mustafa, Saad; Othman, Mazliza

    2013-01-01

    This paper presents comparison of different hierarchical (position and non-position based) protocols with respect to different mobility models. Previous work mainly focuses on static networks or at most a single mobility model. Using only one mobility model may not predict the behavior of routing protocol accurately. Simulation results show that mobility has large impact on the behavior of WSN routing protocols. Also, position based routing protocols performs better in terms of packet deliver...

  5. Microcomputer-based vehicle routing and scheduling: An overview

    Energy Technology Data Exchange (ETDEWEB)

    Klein, A.J.

    1987-08-01

    Commercially available vehicle-routing and scheduling packages were surveyed to assess capabilities, categorize key characteristics, compare individual packages, and select candidate software for additional testing. Among the key characteristics addressed were backhauling, distance and vehicle travel-time calculation, geocoding, speed zones, natural barriers, time-window constraints, vehicle/stop matching constraints, and other constraints such as vehicle/driver operating costs. The survey included review of vendor literature, telephone interviews, site visits to review software, and the testing of demonstration packages on a set of sample distribution networks. Thirteen packages were reviewed; these were categorized by price and performance as follows; (1) inexpensive packages (costing $2000 or less), which solve the basic vehicle-routing problem but are somewhat limited in their ability to handle large numbers of vehicles and stops; (2) medium-priced systems (from $5000 to $20,000), which offer more capability to handle constraints such as multiple pickup and delivery, time windows, and multiple depots and provide manual intervention capability and enhanced graphics; (3) very expensive systems (from $50,000 to about $150,000), which can handle real-time situations in scheduling last-minute route changes and employ sophisticated graphics tools to change route schedules interactively. Out of the 13 packages, four demonstration vehicle-routing packages were obtained for testing of 4 sample networks; two of the packages were found to be capable of solving most vehicle-routing problem constraints for two versions of 21-city and 30-city networks.

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

  7. Mobility based multicast routing in wireless mesh networks

    Science.gov (United States)

    Jain, Sanjeev; Tripathi, Vijay S.; Tiwari, Sudarshan

    2013-01-01

    There exist two fundamental approaches to multicast routing namely minimum cost trees and shortest path trees. The (MCT's) minimum cost tree is one which connects receiver and sources by providing a minimum number of transmissions (MNTs) the MNTs approach is generally used for energy constraint sensor and mobile ad hoc networks. In this paper we have considered node mobility and try to find out simulation based comparison of the (SPT's) shortest path tree, (MST's) minimum steiner trees and minimum number of transmission trees in wireless mesh networks by using the performance metrics like as an end to end delay, average jitter, throughput and packet delivery ratio, average unicast packet delivery ratio, etc. We have also evaluated multicast performance in the small and large wireless mesh networks. In case of multicast performance in the small networks we have found that when the traffic load is moderate or high the SPTs outperform the MSTs and MNTs in all cases. The SPTs have lowest end to end delay and average jitter in almost all cases. In case of multicast performance in the large network we have seen that the MSTs provide minimum total edge cost and minimum number of transmissions. We have also found that the one drawback of SPTs, when the group size is large and rate of multicast sending is high SPTs causes more packet losses to other flows as MCTs.

  8. Implementing risk-based policies

    International Nuclear Information System (INIS)

    Barill, T.

    1992-01-01

    The principle of risk-based policy is that the protection of human health and the environment is best determined on a case-by-case basis, rather than by a set level of contamination. This paper discusses common techniques used by environmental professionals to effectively implement risk-based policy. Once understood, these principles can be easily applied to provide flexibility in terms of cleanup levels, operations levels and permitting/reporting requirements. Regulations at all levels currently refer to or require assessments of health risk. including RCRA Corrective Action, the Clean Air Act, the Clean Water Act and the Toxics Substances Control Act. A fundamental problem with quantitative risk assessments is that they are based on extrapolating data from a set of laboratory conditions to the real world. A set limit, while easier to handle, allows less contaminated areas to become more contaminated and may require an excessively low cleanup level for more contaminated areas. By using relative risk in assessing a site, factors such as background levels, current and future land use, and health risk can be taken into account

  9. Improved routing strategy based on gravitational field theory

    Science.gov (United States)

    Song, Hai-Quan; Guo, Jin

    2015-10-01

    Routing and path selection are crucial for many communication and logistic applications. We study the interaction between nodes and packets and establish a simple model for describing the attraction of the node to the packet in transmission process by using the gravitational field theory, considering the real and potential congestion of the nodes. On the basis of this model, we propose a gravitational field routing strategy that considers the attractions of all of the nodes on the travel path to the packet. In order to illustrate the efficiency of proposed routing algorithm, we introduce the order parameter to measure the throughput of the network by the critical value of phase transition from a free flow phase to a congested phase, and study the distribution of betweenness centrality and traffic jam. Simulations show that, compared with the shortest path routing strategy, the gravitational field routing strategy considerably enhances the throughput of the network and balances the traffic load, and nearly all of the nodes are used efficiently. Project supported by the Technology and Development Research Project of China Railway Corporation (Grant No. 2012X007-D) and the Key Program of Technology and Development Research Foundation of China Railway Corporation (Grant No. 2012X003-A).

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

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

  12. A route-based decomposition for the Multi-Commodity k-splittable Maximum Flow Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    2012-01-01

    The Multi-Commodity k-splittable Maximum Flow Problem routes flow through a capacitated graph such that each commodity uses at most k paths and such that the total amount of routedflow is maximized. This paper proposes a branch-and-price algorithm based on a route-based Dantzig-Wolfe decomposition...

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

  14. 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...... the concept of virtual modules and allow the droplets to move on the chip on any route during operation execution. Thus, the synthesis problem is transformed into a routing problem. We propose an approach derived from a Greedy Randomized Adaptive Search Procedure (GRASP) and we show that by considering...

  15. LMOP Based Hybrid Routing Strategy for Delay/Disruption Tolerant Networks

    Directory of Open Access Journals (Sweden)

    Qian Liu

    2014-07-01

    Full Text Available In this paper, routing problem of Delay Tolerant Networks (DTN was investigated and a new routing scheme was proposed based on the Epidemic routing. By combining the advantage of a variety of related routing algorithm, a Limited Multi-copy Optimal Path-Hybrid Routing (LMOP-HR) was put forward belonging to the flooding message copies strategy. An optimal tree mixed strategy based on priority was proposed for the message distribution. Further, this strategy adopted priority-based cache management mechanism. It was proved that the proposed scheme could guarantee the optimal message delivery rate and reduce node energy consumptions. Numerical results showed that system performance could be effectively improved based on the proposed algorithm.

  16. Polyoxometalate based soft chemical route for preparation of Pt ...

    Indian Academy of Sciences (India)

    Unknown

    2005-01-17

    Jan 17, 2005 ... A soft chemical route is described for the preparation of platinum nanorods and self-assemblies over photochemically reduced polyoxometalate (silicotungstate) containing .... Beck et al (2000) reported a controlled growth of palladium particles at the solid/liquid interface on silica. The formation of aniso-.

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

  18. Selection of optimal variant route based on dynamic fuzzy GRA

    OpenAIRE

    Jalil Heidary Dahooie; Amir Salar Vanaki; Navid Mohammadi; Hamid Reza Firoozfar

    2018-01-01

    Given the high costs of construction and maintenance, an optimum design methodology is one of the most important steps towards the development of transportation infrastructure, especially freeways. However, the effects of different variables on the decision-making process to find an optimal variant have caused the choice to become a very difficult and professional task for decision makers. So, the current paper aims to determine the optimal variant route for Isfahan-Shiraz freeway through MAD...

  19. A Neural Networks-Based Hybrid Routing Protocol for Wireless Mesh Networks

    Science.gov (United States)

    Kojić, Nenad; Reljin, Irini; Reljin, Branimir

    2012-01-01

    The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic—i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance. PMID:22969360

  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 hop count based heuristic routing protocol for mobile delay tolerant networks.

    Science.gov (United States)

    You, Lei; Li, Jianbo; Wei, Changjiang; Dai, Chenqu; Xu, Jixing; Hu, Lejuan

    2014-01-01

    Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

  2. A Socially Aware Routing Based on Local Contact Information in Delay-Tolerant Networks

    Directory of Open Access Journals (Sweden)

    Chan-Myung Kim

    2014-01-01

    Full Text Available In delay-tolerant networks, network topology changes dynamically and there is no guarantee of continuous connectivity between any two nodes. These features make DTN routing one of important research issues, and the application of social network metrics has led to the design of recent DTN routing schemes. In this paper, we propose an efficient routing scheme by using a node’s local contact history and social network metrics. Each node first chooses a proper relay node based on the closeness to the destination node. A locally computed betweenness centrality is additionally utilized to enhance the routing efficiency. Through intensive simulation, we finally demonstrate that our algorithm performs efficiently compared to the existing epidemic or friendship routing scheme.

  3. Performance on the Athletic Training Certification Examination Based on Candidates' Routes to Eligibility

    OpenAIRE

    Starkey, Chad; Henderson, James

    1995-01-01

    The National Athletic Trainers' Association Board of Certification initiated a task force whose purpose is to evaluate the criteria that determine eligibility for the athletic training certification examination. Candidates may qualify to take the examination through one of two routes: an academic-based curriculum program or the practical education, work-experience-based internship route. The certification examination is comprised of three sections: a written examination, a written simulation,...

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

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

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

    Directory of Open Access Journals (Sweden)

    Unai Burgos

    2017-07-01

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

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

  8. Multiobjective Optimization of Evacuation Routes in Stadium Using Superposed Potential Field Network Based ACO

    Directory of Open Access Journals (Sweden)

    Jialiang Kou

    2013-01-01

    Full Text Available Multiobjective evacuation routes optimization problem is defined to find out optimal evacuation routes for a group of evacuees under multiple evacuation objectives. For improving the evacuation efficiency, we abstracted the evacuation zone as a superposed potential field network (SPFN, and we presented SPFN-based ACO algorithm (SPFN-ACO to solve this problem based on the proposed model. In Wuhan Sports Center case, we compared SPFN-ACO algorithm with HMERP-ACO algorithm and traditional ACO algorithm under three evacuation objectives, namely, total evacuation time, total evacuation route length, and cumulative congestion degree. The experimental results show that SPFN-ACO algorithm has a better performance while comparing with HMERP-ACO algorithm and traditional ACO algorithm for solving multi-objective evacuation routes optimization problem.

  9. An agenda-based routing protocol in delay tolerant mobile sensor networks.

    Science.gov (United States)

    Wang, Xiao-Min; Zhu, Jin-Qi; Liu, Ming; Gong, Hai-Gang

    2010-01-01

    Routing in delay tolerant mobile sensor networks (DTMSNs) is challenging due to the networks' intermittent connectivity. Most existing routing protocols for DTMSNs use simplistic random mobility models for algorithm design and performance evaluation. In the real world, however, due to the unique characteristics of human mobility, currently existing random mobility models may not work well in environments where mobile sensor units are carried (such as DTMSNs). Taking a person's social activities into consideration, in this paper, we seek to improve DTMSN routing in terms of social structure and propose an agenda based routing protocol (ARP). In ARP, humans are classified based on their agendas and data transmission is made according to sensor nodes' transmission rankings. The effectiveness of ARP is demonstrated through comprehensive simulation studies.

  10. Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Husam Kareem Farhan

    2017-01-01

    Full Text Available Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs. A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorithm that combines the full advantages of both cluster and chain techniques such as CCM (Chain-Cluster based Mixed routing. In this paper, introduce a routing algorithm relying on CCM algorithm called (Enhanced Chain-Cluster based Mixed routing algorithm E-CCM. Simulation results show that E-CCM algorithm improves the performance of CCM algorithm in terms of three performance metrics which are: energy consumption, network lifetime, and (FND and LND. MATLAB program is used to develop and test the simulation process in a computer with the following specifications: windows 7 (32-operating system, core i5, RAM 4 GB, hard 512 GB.

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

    International Nuclear Information System (INIS)

    Huibin, Liu; Jun, Zhang

    2016-01-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. (paper)

  12. Formal Approach For Resilient Reachability based on End-System Route Agility

    Energy Technology Data Exchange (ETDEWEB)

    Rauf, Usman; Gillani, Fida; Al-Shaer, Ehab; Halappanavar, Mahantesh; Chatterjee, Samrat; Oehmen, Christopher S.

    2016-12-28

    The deterministic nature of existing routing protocols has resulted into an ossified Internet with static and predictable network routes. This gives persistent attackers (e.g. eavesdroppers and DDoS attackers) plenty of time to study the network and identify the vulnerable links (critical) to plan a devastating and stealthy attack. Recently, route mutation approaches have been proposed to address such issues. However, these approaches incur significantly high overhead and depend upon the availability of disjoint routes in the network, which inherently limit their use for mission critical services. To cope with these issues, we extend the current routing architecture to consider end-hosts as routing elements, and present a formal method based agile defense mechanism to increase resiliency of the existing cyber infrastructure. The major contributions of this paper include: (1) formalization of efficient and resilient End to End (E2E) reachability problem as a constraint satisfaction problem, which identifies the potential end-hosts to reach a destination while satisfying resilience and QoS constraints, (2) design and implementation of a novel decentralized End Point Route Mutation (EPRM) protocol, and (3) design and implementation of planning algorithm to minimize the overlap between multiple flows, for the sake of maximizing the agility in the system. Our implementation and evaluation validates the correctness, effectiveness and scalability of the proposed approach.

  13. Characterizing Deficiencies of Path-Based Routing for Wireless Multi-Hop Networks

    Science.gov (United States)

    2017-05-01

    how effective routing is for reliably and efficiently delivering data in a wireless network. With the emergence of the Internet of Things , there is a...But with the advent of the Internet of Things , the number of wireless networked devices is expected to reach into the billions [1–3]. To support this...of the wireless environ- ment inherently make link-based routing unsuitable for wireless networking. Requirements for the future Internet of Things are

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

  15. The roots and routes of environmental and sustainability education policy research

    DEFF Research Database (Denmark)

    Lysgaard, Jonas Andreasen; Van Poeck, Katrien

    2016-01-01

    Environmental Education Research has developed a Virtual Special Issue (VSI) (http://explore.tandfonline.com/content/ed/ceer-vsi) focusing on studies of environmental and sustainability education (ESE) policy. The VSI draws on key examples of research on this topic published in the Journal from...

  16. Directory Enabled Policy Based Networking; TOPICAL

    International Nuclear Information System (INIS)

    KELIIAA, CURTIS M.

    2001-01-01

    This report presents a discussion of directory-enabled policy-based networking with an emphasis on its role as the foundation for securely scalable enterprise networks. A directory service provides the object-oriented logical environment for interactive cyber-policy implementation. Cyber-policy implementation includes security, network management, operational process and quality of service policies. The leading network-technology vendors have invested in these technologies for secure universal connectivity that transverses Internet, extranet and intranet boundaries. Industry standards are established that provide the fundamental guidelines for directory deployment scalable to global networks. The integration of policy-based networking with directory-service technologies provides for intelligent management of the enterprise network environment as an end-to-end system of related clients, services and resources. This architecture allows logical policies to protect data, manage security and provision critical network services permitting a proactive defense-in-depth cyber-security posture. Enterprise networking imposes the consideration of supporting multiple computing platforms, sites and business-operation models. An industry-standards based approach combined with principled systems engineering in the deployment of these technologies allows these issues to be successfully addressed. This discussion is focused on a directory-based policy architecture for the heterogeneous enterprise network-computing environment and does not propose specific vendor solutions. This document is written to present practical design methodology and provide an understanding of the risks, complexities and most important, the benefits of directory-enabled policy-based networking

  17. Optimization for Service Routes of Pallet Service Center Based on the Pallet Pool Mode

    Directory of Open Access Journals (Sweden)

    Kang Zhou

    2016-01-01

    Full Text Available Service routes optimization (SRO of pallet service center should meet customers’ demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP and Chinese postman problem (CPP, but it has its own characteristics. Based on the relevant research results, the conditions of determining the number of vehicles, the one way of the route, the constraints of loading, and time windows are fully considered, and a chance constrained programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling operation as an objective. For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. Finally, the validity and rationality of the optimization model and algorithm are verified by the case.

  18. A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks

    Directory of Open Access Journals (Sweden)

    Jose Aguilar

    2007-08-01

    Full Text Available In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented. In the proposed algorithm, the solution space of the dynamic combinatorial optimization problem is mapped into the space where the ants will walk, and the transition probability and the pheromone update formula of the Ant System is defined according to the objective function of the communication problem. The general nature of the approach allows for the optimization of the routing function to be applied in different types of networks just changing the performance criteria to be optimized. In fact, we test and compare the performance of our routing algorithm against well-known routing schemes for wired and wireless networks, and show its superior performance in terms throughput, delay and energy efficiency.

  19. Genetic Algorithm-based Dynamic Vehicle Route Search using Car-to-Car Communication

    Directory of Open Access Journals (Sweden)

    KIM, J.

    2010-11-01

    Full Text Available Suggesting more efficient driving routes generate benefits not only for individuals by saving commute time, but also for society as a whole by reducing accident rates and social costs by lessening traffic congestion. In this paper, we suggest a new route search algorithm based on a genetic algorithm which is more easily installable into mutually communicating car navigation systems, and validate its usefulness through experiments reflecting real-world situations. The proposed algorithm is capable of searching alternative routes dynamically in unexpected events of system malfunctioning or traffic slow-downs due to accidents. Experimental results demonstrate that our algorithm searches the best route more efficiently and evolves with universal adaptability.

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

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

  2. Pilot projects in Evidence Based Policy Making

    NARCIS (Netherlands)

    Vreugdenhil, H.S.I.; Ker Rault, P.A.

    2010-01-01

    In Evidence Based Policy Making, pilot projects have been recognized as important tools to develop ‘evidence’ of policy innovations. This paper presents a theoretical and empirical study of three water management pilot projects in the Rhine basin to deepen understanding of how they can contri-bute

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

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

  5. A heuristic algorithm based on tabu search for vehicle routing problems with backhauls

    Directory of Open Access Journals (Sweden)

    Jhon Jairo Santa Chávez

    2017-07-01

    Full Text Available In this paper, a heuristic algorithm based on Tabu Search Approach for solving the Vehicle Routing Problem with Backhauls (VRPB is proposed. The problem considers a set of customers divided in two subsets: Linehaul and Backhaul customers. Each Linehaul customer requires the delivery of a given quantity of product from the depot, whereas a given quantity of product must be picked up from each Backhaul customer and transported to the depot. In the proposed algorithm, each route consists of one sub-route in which only the delivery task is done, and one sub-route in which only the collection process is performed. The search process allows obtaining a correct order to visit all the customers on each sub-route. In addition, the proposed algorithm determines the best connections among the sub-routes in order to obtain a global solution with the minimum traveling cost. The efficiency of the algorithm is evaluated on a set of benchmark instances taken from the literature. The results show that the computing times are greatly reduced with a high quality of solutions. Finally, conclusions and suggestions for future works are presented.

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

  7. UPM: unified policy-based network management

    Science.gov (United States)

    Law, Eddie; Saxena, Achint

    2001-07-01

    Besides providing network management to the Internet, it has become essential to offer different Quality of Service (QoS) to users. Policy-based management provides control on network routers to achieve this goal. The Internet Engineering Task Force (IETF) has proposed a two-tier architecture whose implementation is based on the Common Open Policy Service (COPS) protocol and Lightweight Directory Access Protocol (LDAP). However, there are several limitations to this design such as scalability and cross-vendor hardware compatibility. To address these issues, we present a functionally enhanced multi-tier policy management architecture design in this paper. Several extensions are introduced thereby adding flexibility and scalability. In particular, an intermediate entity between the policy server and policy rule database called the Policy Enforcement Agent (PEA) is introduced. By keeping internal data in a common format, using a standard protocol, and by interpreting and translating request and decision messages from multi-vendor hardware, this agent allows a dynamic Unified Information Model throughout the architecture. We have tailor-made this unique information system to save policy rules in the directory server and allow executions of policy rules with dynamic addition of new equipment during run-time.

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

    Directory of Open Access Journals (Sweden)

    Chen Min

    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.

  9. Genetic based optimization for multicast routing algorithm for MANET

    Indian Academy of Sciences (India)

    Algorithm (GA) and particle swarm optimization (PSO) to improve the solution. Sim- ulations were conducted by varying number of mobile nodes and results compared with Multicast AODV (MAODV) protocol, PSO based and GA based solution. The proposed optimization improves jitter, end to end delay and Packet Delivery ...

  10. Context sensitive trust based geographic opportunistic routing in ...

    Indian Academy of Sciences (India)

    A Rajesh

    volume safety roadways. Thus, the proposed work ... on the context, and it utilizes the knowledge base to extract the importance of a message ... A trust-based decentralized security archi- tecture meets the challenges of security management and context awareness computation [11]. This security archi- tecture establishes ...

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

  12. Road Risk Modeling and Cloud-Aided Safety-Based Route Planning.

    Science.gov (United States)

    Li, Zhaojian; Kolmanovsky, Ilya; Atkins, Ella; Lu, Jianbo; Filev, Dimitar P; Michelini, John

    2016-11-01

    This paper presents a safety-based route planner that exploits vehicle-to-cloud-to-vehicle (V2C2V) connectivity. Time and road risk index (RRI) are considered as metrics to be balanced based on user preference. To evaluate road segment risk, a road and accident database from the highway safety information system is mined with a hybrid neural network model to predict RRI. Real-time factors such as time of day, day of the week, and weather are included as correction factors to the static RRI prediction. With real-time RRI and expected travel time, route planning is formulated as a multiobjective network flow problem and further reduced to a mixed-integer programming problem. A V2C2V implementation of our safety-based route planning approach is proposed to facilitate access to real-time information and computing resources. A real-world case study, route planning through the city of Columbus, Ohio, is presented. Several scenarios illustrate how the "best" route can be adjusted to favor time versus safety metrics.

  13. An Eccentricity Based Data Routing Protocol with Uniform Node Distribution in 3D WSN.

    Science.gov (United States)

    Hosen, A S M Sanwar; Cho, Gi Hwan; Ra, In-Ho

    2017-09-16

    Due to nonuniform node distribution, the energy consumption of nodes are imbalanced in clustering-based wireless sensor networks (WSNs). It might have more impact when nodes are deployed in a three-dimensional (3D) environment. In this regard, we propose the eccentricity based data routing (EDR) protocol in a 3D WSN with uniform node distribution. It includes network partitions called 3D subspaces/clusters of equal member nodes, an energy-efficient routing centroid (RC) nodes election and data routing algorithm. The RC nodes election conducts in a quasi-static nature until a certain period unlike the periodic cluster heads election of typical clustering-based routing. It not only reduces the energy consumption of nodes during the election phase, but also in intra-communication. At the same time, the routing algorithm selects a forwarding node in such a way that balances the energy consumption among RC nodes and reduces the number of hops towards the sink. The simulation results validate and ensure the performance supremacy of the EDR protocol compared to existing protocols in terms of various metrics such as steady state and network lifetime in particular. Meanwhile, the results show the EDR is more robust in uniform node distribution compared to nonuniform.

  14. DCBRP: a deterministic chain-based routing protocol for wireless sensor networks.

    Science.gov (United States)

    Marhoon, Haydar Abdulameer; Mahmuddin, M; Nor, Shahrudin Awang

    2016-01-01

    Wireless sensor networks (WSNs) are a promising area for both researchers and industry because of their various applications The sensor node expends the majority of its energy on communication with other nodes. Therefore, the routing protocol plays an important role in delivering network data while minimizing energy consumption as much as possible. The chain-based routing approach is superior to other approaches. However, chain-based routing protocols still expend substantial energy in the Chain Head (CH) node. In addition, these protocols also have the bottleneck issues. A novel routing protocol which is Deterministic Chain-Based Routing Protocol (DCBRP). DCBRP consists of three mechanisms: Backbone Construction Mechanism, Chain Head Selection (CHS), and the Next Hop Connection Mechanism. The CHS mechanism is presented in detail, and it is evaluated through comparison with the CCM and TSCP using an ns-3 simulator. It show that DCBRP outperforms both CCM and TSCP in terms of end-to-end delay by 19.3 and 65%, respectively, CH energy consumption by 18.3 and 23.0%, respectively, overall energy consumption by 23.7 and 31.4%, respectively, network lifetime by 22 and 38%, respectively, and the energy*delay metric by 44.85 and 77.54%, respectively. DCBRP can be used in any deterministic node deployment applications, such as smart cities or smart agriculture, to reduce energy depletion and prolong the lifetimes of WSNs.

  15. Comparison of the sustainability metrics of the petrochemical and biomass-based routes to methionine

    NARCIS (Netherlands)

    Sanders, J.P.M.; Sheldon, R.A.

    2015-01-01

    Sustainability metrics, based on material efficiency, energy input, land use and costs, of three processesfor the manufacture of methionine are compared. The petrochemical process affords dl-methionine whilethe two biomass-based routes afford the l-enantiomer. From the point of view of the major

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

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

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

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

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

    NARCIS (Netherlands)

    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

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

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

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

  4. A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks.

    Science.gov (United States)

    Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

    2017-01-01

    Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole.

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

  6. The Single Row Routing Problem Revisited: A Solution Based on Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Albert Y. Zomaya

    2002-01-01

    Full Text Available With the advent of VLSI technology, circuits with more than one million transistors have been integrated onto a single chip. As the complexity of ICs grows, the time and money spent on designing the circuits become more important. A large, often dominant, part of the cost and time required to design an IC is consumed in the routing operation. The routing of carriers, such as in IC chips and printed circuit boards, is a classical problem in Computer Aided Design. With the complexity inherent in VLSI circuits, high performance routers are necessary. In this paper, a crucial step in the channel routing technique, the single row routing (SRR problem, is considered. First, we discuss the relevance of SRR in the context of the general routing problem. Secondly, we show that heuristic algorithms are far from solving the general problem. Next, we introduce evolutionary computation, and, in particular, genetic algorithms (GAs as a justifiable method in solving the SRR problem. Finally, an efficient O (nk complexity technique based on GAs heuristic is obtained to solve the general SRR problem containing n nodes. Experimental results show that the algorithm is faster and can often generate better results than many of the leading heuristics proposed in the literature.

  7. WEAMR-a weighted energy aware multipath reliable routing mechanism for hotline-based WSNs.

    Science.gov (United States)

    Tufail, Ali; Qamar, Arslan; Khan, Adil Mehmood; Baig, Waleed Akram; Kim, Ki-Hyung

    2013-05-13

    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.

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

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

    Directory of Open Access Journals (Sweden)

    Abdulaziz Al-Nahari

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

  10. Minimum expected delay-based routing protocol (MEDR) for Delay Tolerant Mobile Sensor Networks.

    Science.gov (United States)

    Feng, Yong; Liu, Ming; Wang, Xiaomin; Gong, Haigang

    2010-01-01

    It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing performance by finding and using the connected paths formed dynamically by mobile sensors. In MEDR, each sensor maintains two important parameters: Minimum Expected Delay (MED) and its expiration time. According to MED, messages will be delivered to the sensor that has at least a connected path with their hosting nodes, and has the shortest expected delay to communication directly with the sink node. Because of the changing network topology, the path is fragile and volatile, so we use the expiration time of MED to indicate the valid time of the path, and avoid wrong transmissions. Simulation results show that the proposed MEDR achieves a higher message delivery ratio with lower transmission overhead and data delivery delay than other DTMSN routing approaches.

  11. A Novel Cross-Layer Routing Protocol Based on Network Coding for Underwater Sensor Networks.

    Science.gov (United States)

    Wang, Hao; Wang, Shilian; Bu, Renfei; Zhang, Eryang

    2017-08-08

    Underwater wireless sensor networks (UWSNs) have attracted increasing attention in recent years because of their numerous applications in ocean monitoring, resource discovery and tactical surveillance. However, the design of reliable and efficient transmission and routing protocols is a challenge due to the low acoustic propagation speed and complex channel environment in UWSNs. In this paper, we propose a novel cross-layer routing protocol based on network coding (NCRP) for UWSNs, which utilizes network coding and cross-layer design to greedily forward data packets to sink nodes efficiently. The proposed NCRP takes full advantages of multicast transmission and decode packets jointly with encoded packets received from multiple potential nodes in the entire network. The transmission power is optimized in our design to extend the life cycle of the network. Moreover, we design a real-time routing maintenance protocol to update the route when detecting inefficient relay nodes. Substantial simulations in underwater environment by Network Simulator 3 (NS-3) show that NCRP significantly improves the network performance in terms of energy consumption, end-to-end delay and packet delivery ratio compared with other routing protocols for UWSNs.

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

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

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

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

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

  18. An adaptive density-based routing protocol for flying Ad Hoc networks

    Science.gov (United States)

    Zheng, Xueli; Qi, Qian; Wang, Qingwen; Li, Yongqiang

    2017-10-01

    An Adaptive Density-based Routing Protocol (ADRP) for Flying Ad Hoc Networks (FANETs) is proposed in this paper. The main objective is to calculate forwarding probability adaptively in order to increase the efficiency of forwarding in FANETs. ADRP dynamically fine-tunes the rebroadcasting probability of a node for routing request packets according to the number of neighbour nodes. Indeed, it is more interesting to privilege the retransmission by nodes with little neighbour nodes. We describe the protocol, implement it and evaluate its performance using NS-2 network simulator. Simulation results reveal that ADRP achieves better performance in terms of the packet delivery fraction, average end-to-end delay, normalized routing load, normalized MAC load and throughput, which is respectively compared with AODV.

  19. An energy-aware routing protocol for query-based applications in wireless sensor networks.

    Science.gov (United States)

    Ahvar, Ehsan; Ahvar, Shohreh; Lee, Gyu Myoung; Crespi, Noel

    2014-01-01

    Wireless sensor network (WSN) typically has energy consumption restriction. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saving protocols are used to minimize the overall energy consumed by a WSN, while energy balancing protocols attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP) for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

  20. A Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems

    Directory of Open Access Journals (Sweden)

    Yucheng Kao

    2012-01-01

    Full Text Available The vehicle routing problem (VRP is a well-known combinatorial optimization problem. It has been studied for several decades because finding effective vehicle routes is an important issue of logistic management. This paper proposes a new hybrid algorithm based on two main swarm intelligence (SI approaches, ant colony optimization (ACO and particle swarm optimization (PSO, for solving capacitated vehicle routing problems (CVRPs. In the proposed algorithm, each artificial ant, like a particle in PSO, is allowed to memorize the best solution ever found. After solution construction, only elite ants can update pheromone according to their own best-so-far solutions. Moreover, a pheromone disturbance method is embedded into the ACO framework to overcome the problem of pheromone stagnation. Two sets of benchmark problems were selected to test the performance of the proposed algorithm. The computational results show that the proposed algorithm performs well in comparison with existing swarm intelligence approaches.

  1. A Stable TORA Based for Routing in Mobile Ad Ηoc Networks

    Directory of Open Access Journals (Sweden)

    S. Jahanbakhsh Gudakahriz

    2018-02-01

    Full Text Available A mobile ad hoc network (MANET is defined as a set of mobile nodes which communicate through wireless links with no central infrastructure. In these networks nodes are always moving and could enter to or exit from the network at any time. Therefore, network topology is completely dynamic. Another characteristic of these networks is the low node energy level, resulting from inherent node limitations. Stable routing is one method to face routing challenges in mobile ad hoc networks. The objective of this study is to stabilize TORA protocol which is a distributed routing protocol, with high adaptation, efficiency, and suitability for large and dense mobile ad hoc networks and thus to provide a new high efficiency protocol. The proposed protocol introduced as Stable-TORA has been compared with base protocol TORA in different scenarios via NS-2 simulator environment and its efficiency is evaluated.

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

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

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

  5. Policy administration in tag-based authorization

    NARCIS (Netherlands)

    Etalle, Sandro; Hinrichs, Timothy L.; Lee, Adam J.; Trivellato, Daniel; Zannone, Nicola

    2013-01-01

    Tag-Based Authorization (TBA) is a hybrid access control model that combines the ease of use of extensional access control models with the expressivity of logic-based formalisms. The main limitation of TBA is that it lacks support for policy administration. More precisely, it does not allow

  6. Policy-Based Management Natural Language Parser

    Science.gov (United States)

    James, Mark

    2009-01-01

    The Policy-Based Management Natural Language Parser (PBEM) is a rules-based approach to enterprise management that can be used to automate certain management tasks. This parser simplifies the management of a given endeavor by establishing policies to deal with situations that are likely to occur. Policies are operating rules that can be referred to as a means of maintaining order, security, consistency, or other ways of successfully furthering a goal or mission. PBEM provides a way of managing configuration of network elements, applications, and processes via a set of high-level rules or business policies rather than managing individual elements, thus switching the control to a higher level. This software allows unique management rules (or commands) to be specified and applied to a cross-section of the Global Information Grid (GIG). This software embodies a parser that is capable of recognizing and understanding conversational English. Because all possible dialect variants cannot be anticipated, a unique capability was developed that parses passed on conversation intent rather than the exact way the words are used. This software can increase productivity by enabling a user to converse with the system in conversational English to define network policies. PBEM can be used in both manned and unmanned science-gathering programs. Because policy statements can be domain-independent, this software can be applied equally to a wide variety of applications.

  7. Time dependent policy-based access control

    DEFF Research Database (Denmark)

    Vasilikos, Panagiotis; Nielson, Flemming; Nielson, Hanne Riis

    2017-01-01

    Access control policies are essential to determine who is allowed to access data in a system without compromising the data's security. However, applications inside a distributed environment may require those policies to be dependent on the actual content of the data, the flow of information, while...... also on other attributes of the environment such as the time. In this paper, we use systems of Timed Automata to model distributed systems and we present a logic in which one can express time-dependent policies for access control. We show how a fragment of our logic can be reduced to a logic...... that current model checkers for Timed Automata such as UPPAAL can handle and we present a translator that performs this reduction. We then use our translator and UPPAAL to enforce time-dependent policy-based access control on an example application from the aerospace industry....

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

  9. A game theory-based obstacle avoidance routing protocol for wireless sensor networks.

    Science.gov (United States)

    Guan, Xin; Wu, Huayang; Bi, Shujun

    2011-01-01

    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.

  10. Performance on the Athletic Training Certification Examination Based on Candidates' Routes to Eligibility

    Science.gov (United States)

    Starkey, Chad; Henderson, James

    1995-01-01

    The National Athletic Trainers' Association Board of Certification initiated a task force whose purpose is to evaluate the criteria that determine eligibility for the athletic training certification examination. Candidates may qualify to take the examination through one of two routes: an academic-based curriculum program or the practical education, work-experience-based internship route. The certification examination is comprised of three sections: a written examination, a written simulation, and a practical examination. We retrospectively examined certification examination scores during a 2-year period to determine whether a significant difference existed between the two groups of candidates. Test results for first-time candidates sitting for one of the nine examinations administered during 1992 and 1993 were extracted from the data base maintained by Columbia Assessment Services, Inc (Raleigh, NC) and grouped according to the candidates' route to eligibility. Curriculum candidates had significantly greater scores than did internship candidates on each of the three parts of the examination. Although the test analysis yields strong statistical power in interpreting these results, examination outcomes may also be influenced by the structure and content of the academic program followed, the quality of the clinical experience, the heterogeneity of each of the routes, and the psychosocial rigors of the examination process. PMID:16558313

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

  12. A Distance-based Energy Aware Routing algorithm for wireless sensor networks.

    Science.gov (United States)

    Wang, Jin; Kim, Jeong-Uk; Shu, Lei; Niu, Yu; Lee, Sungyoung

    2010-01-01

    Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs) since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR) algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms.

  13. A Distance-Based Energy Aware Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sungyoung Lee

    2010-10-01

    Full Text Available Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms.

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

  15. Performance Evaluation of Location-Based Geocast Routing using Directed Flooding Rectangular Forwarding Zone in City VANET

    Directory of Open Access Journals (Sweden)

    Akhtar Husain

    2015-10-01

    Full Text Available Vehicular ad hoc network (VANET is an application of mobile ad hoc network (MANET where vehicular nodes are integrated with GPS and other controlling devices to communicate among each other. Because of predefined structure of roads as well as very high moving speed of vehicles, routing becomes an extremely challenging issue in VANET. In literature, authors in research papers related to vehicular communication evaluate mostly the performance of topology or position-based routing protocols. This article implements a geocast approach called directed flooding rectangular forwarding zone in distance-effect routing algorithm for mobility (DREAM, location aided routing (LAR and zone routing protocol (ZRP for city vehicular environment. Packet delivery ratio normalized routing load, delay, throughput, dropped packet ratio and bandwidth wastage parameters are evaluated using NS-2.33 integrated with IEEE802.11p and IDM_IM based VanetMobiSim. The impact of mobility on these parameters is also analyzed.

  16. A Centralized Energy Efficient Distance Based Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Rohit D. Gawade

    2016-01-01

    Full Text Available Wireless sensor network (WSN typically consists of a large number of low cost wireless sensor nodes which collect and send various messages to a base station (BS. WSN nodes are small battery powered devices having limited energy resources. Replacement of such energy resources is not easy for thousands of nodes as they are inaccessible to users after their deployment. This generates a requirement of energy efficient routing protocol for increasing network lifetime while minimizing energy consumption. Low Energy Adaptive Clustering Hierarchy (LEACH is a widely used classic clustering algorithm in WSNs. In this paper, we propose a Centralized Energy Efficient Distance (CEED based routing protocol to evenly distribute energy dissipation among all sensor nodes. We calculate optimum number of cluster heads based on LEACH’s energy dissipation model. We propose a distributed cluster head selection algorithm based on dissipated energy of a node and its distance to BS. Moreover, we extend our protocol by multihop routing scheme to reduce energy dissipated by nodes located far away from base station. The performance of CEED is compared with other protocols such as LEACH and LEACH with Distance Based Thresholds (LEACH-DT. Simulation results show that CEED is more energy efficient as compared to other protocols. Also it improves the network lifetime and stability period over the other protocols.

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Hiroshi Ishii

    2012-05-01

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

  3. Feature Selection for Natural Language Call Routing Based on Self-Adaptive Genetic Algorithm

    Science.gov (United States)

    Koromyslova, A.; Semenkina, M.; Sergienko, R.

    2017-02-01

    The text classification problem for natural language call routing was considered in the paper. Seven different term weighting methods were applied. As dimensionality reduction methods, the feature selection based on self-adaptive GA is considered. k-NN, linear SVM and ANN were used as classification algorithms. The tasks of the research are the following: perform research of text classification for natural language call routing with different term weighting methods and classification algorithms and investigate the feature selection method based on self-adaptive GA. The numerical results showed that the most effective term weighting is TRR. The most effective classification algorithm is ANN. Feature selection with self-adaptive GA provides improvement of classification effectiveness and significant dimensionality reduction with all term weighting methods and with all classification algorithms.

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

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

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

  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. Impact of LQI-Based Routing Metrics on the Performance of a One-to-One Routing Protocol for IEEE 802.15.4 Multihop Networks

    Directory of Open Access Journals (Sweden)

    Boix Antoni

    2010-01-01

    Full Text Available The quality of an IEEE 802.15.4 link can be estimated on the basis of the Link Quality Indication (LQI, which is a parameter offered by the IEEE 802.15.4 physical layer. The LQI has been recommended by organizations such as the ZigBee Alliance and the IETF as an input to routing metrics for IEEE 802.15.4 multihop networks. As these networks evolve, one-to-one communications gain relevance in many application areas. In this paper, we present an in-depth, experimental study on the impact of LQI-based routing metrics on the performance of a one-to-one routing protocol for IEEE 802.15.4 multihop networks. We conducted our experiments in a 60-node testbed. Experiments show the spectrum of performance results that using (or not the LQI may yield. Results also highlight the importance of the additive or multiplicative nature of the routing metrics and its influence on performance.

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

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

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Brocchi, E.A. [Department of Material Science and Metallurgy, Catholic University of Rio de Janeiro, DCMM-PUC-RIO, R. Margues de S. Vicente 225, C.P 3890-Gavea, 22451-970 Rio de Janeiro (Brazil); Motta, M.S. [Department of Material Science and Metallurgy, Catholic University of Rio de Janeiro, DCMM-PUC-RIO, R. Margues de S. Vicente 225, C.P 3890-Gavea, 22451-970 Rio de Janeiro (Brazil); Solorzano, I.G. [Department of Material Science and Metallurgy, Catholic University of Rio de Janeiro, DCMM-PUC-RIO, R. Margues de S. Vicente 225, C.P 3890-Gavea, 22451-970 Rio de Janeiro (Brazil)]. E-mail: guilsol@dcmm.puc-rio.br; Jena, P.K. [Department of Material Science and Metallurgy, Catholic University of Rio de Janeiro, DCMM-PUC-RIO, R. Margues de S. Vicente 225, C.P 3890-Gavea, 22451-970 Rio de Janeiro (Brazil); Moura, F.J. [Department of Material Science and Metallurgy, Catholic University of Rio de Janeiro, DCMM-PUC-RIO, R. Margues de S. Vicente 225, C.P 3890-Gavea, 22451-970 Rio de Janeiro (Brazil)

    2004-09-25

    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.

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

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

  16. Residual energy level based clustering routing protocol for wireless sensor networks

    Science.gov (United States)

    Yuan, Xu; Zhong, Fangming; Chen, Zhikui; Yang, Deli

    2015-12-01

    The wireless sensor networks, which nodes prone to premature death, with unbalanced energy consumption and a short life time, influenced the promotion and application of this technology in internet of things in agriculture. This paper proposes a clustering routing protocol based on the residual energy level (RELCP). RELCP includes three stages: the selection of cluster head, establishment of cluster and data transmission. RELCP considers the remaining energy level and distance to base station, while election of cluster head nodes and data transmitting. Simulation results demonstrate that the protocol can efficiently balance the energy dissipation of all nodes, and prolong the network lifetime.

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

    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.

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

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

  20. IJS: An Intelligent Junction Selection Based Routing Protocol for VANET to Support ITS Services.

    Science.gov (United States)

    Bhoi, Sourav Kumar; Khilar, Pabitra Mohan

    2014-01-01

    Selecting junctions intelligently for data transmission provides better intelligent transportation system (ITS) services. The main problem in vehicular communication is high disturbances of link connectivity due to mobility and less density of vehicles. If link conditions are predicted earlier, then there is a less chance of performance degradation. In this paper, an intelligent junction selection based routing protocol (IJS) is proposed to transmit the data in a quickest path, in which the vehicles are mostly connected and have less link connectivity problem. In this protocol, a helping vehicle is set at every junction to control the communication by predicting link failures or network gaps in a route. Helping vehicle at the junction produces a score for every neighboring junction to forward the data to the destination by considering the current traffic information and selects that junction which has minimum score. IJS protocol is implemented and compared with GyTAR, A-STAR, and GSR routing protocols. Simulation results show that IJS performs better in terms of average end-to-end delay, network gap encounter, and number of hops.

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

  2. Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks.

    Science.gov (United States)

    Lee, JeongCheol; Park, HoSung; Kang, SeokYoon; Kim, Ki-Il

    2015-06-05

    Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols.

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

    Directory of Open Access Journals (Sweden)

    Y. Harold Robinson

    2015-01-01

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

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

  5. A set-covering based heuristic algorithm for the periodic vehicle routing problem.

    Science.gov (United States)

    Cacchiani, V; Hemmelmayr, V C; Tricoire, F

    2014-01-30

    We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.

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

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

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

  9. Unmanned Aerial Vehicle Route Planning in the Presence of a Threat Environment Based on a Virtual Globe Platform

    OpenAIRE

    Ming Zhang; Chen Su; Yuan Liu; Mingyuan Hu; Yuesheng Zhu

    2016-01-01

    Route planning is a key technology for an unmanned aerial vehicle (UAV) to fly reliably and safely in the presence of a threat environment. Existing route planning methods are mainly based on the simulation scene, whereas approaches based on the virtual globe platform have rarely been reported. In this paper, a new planning space for the virtual globe and the planner is proposed and a common threat model is constructed for threats including a no-fly zone, hazardous weather, radar coverage are...

  10. Maximum Power Plus RSSI Based Routing Protocol for Bluetooth Low Energy Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Changsu Jung

    2017-01-01

    Full Text Available This paper proposes a novel energy-conserving multihop routing protocol to maximize network lifetime and consume the battery in a distributed manner during route discovery in energy-constrained Bluetooth Low Energy ad hoc networks. Furthermore, a flooding avoidance approach is adopted by the proposed scheme to minimize the number of route request packets flooded. In addition, the proposed scheme maximizes network lifetime by using residual battery and RSSI as a route metric. The simulation results confirm that our proposed scheme has a surpassing performance with regard to network lifetime, evenly distributed battery consumption, and route discovery latency compared with the traditional on-demand routing protocol.

  11. Flagellin Encoded in Gene-Based Vector Vaccines Is a Route-Dependent Immune Adjuvant.

    Directory of Open Access Journals (Sweden)

    Hamada F Rady

    Full Text Available Flagellin has been tested as a protein-based vaccine adjuvant, with the majority of studies focused on antibody responses. Here, we evaluated the adjuvant activity of flagellin for both cellular and humoral immune responses in BALB/c mice in the setting of gene-based immunization, and have made several novel observations. DNA vaccines and adenovirus (Ad vectors were engineered to encode mycobacterial protein Ag85B, with or without flagellin of Salmonella typhimurium (FliC. DNA-encoded flagellin given IM enhanced splenic CD4+ and CD8+ T cell responses to co-expressed vaccine antigen, including memory responses. Boosting either IM or intranasally with Ad vectors expressing Ag85B without flagellin led to durable enhancement of Ag85B-specific antibody and CD4+ and CD8+ T cell responses in both spleen and pulmonary tissues, correlating with significantly improved protection against challenge with pathogenic aerosolized M. tuberculosis. However, inclusion of flagellin in both DNA prime and Ad booster vaccines induced localized pulmonary inflammation and transient weight loss, with route-dependent effects on vaccine-induced T cell immunity. The latter included marked reductions in levels of mucosal CD4+ and CD8+ T cell responses following IM DNA/IN Ad mucosal prime-boosting, although antibody responses were not diminished. These findings indicate that flagellin has differential and route-dependent adjuvant activity when included as a component of systemic or mucosally-delivered gene-based prime-boost immunization. Clear adjuvant activity for both T and B cell responses was observed when flagellin was included in the DNA priming vaccine, but side effects occurred when given in an Ad boosting vector, particularly via the pulmonary route.

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

  13. An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ehsan Ahvar

    2014-01-01

    attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

  14. Constructing regional advantage: platform policies based on related variety and differentiated knowledge bases.

    NARCIS (Netherlands)

    Asheim, B.T.; Boschma, R.A.; Cooke, P.

    2011-01-01

    Constructing regional advantage: platform policies based on related variety and differentiated knowledge bases, Regional Studies. This paper presents a regional innovation policy model based on the idea of constructing regional advantage. This policy model brings together concepts like related

  15. Implementing evidence-based policy in a network setting: road safety policy in the Netherlands.

    Science.gov (United States)

    Bax, Charlotte; de Jong, Martin; Koppenjan, Joop

    2010-01-01

    In the early 1990s, in order to improve road safety in The Netherlands, the Institute for Road Safety Research (SWOV) developed an evidence-based "Sustainable Safety" concept. Based on this concept, Dutch road safety policy, was seen as successful and as a best practice in Europe. In The Netherlands, the policy context has now changed from a sectoral policy setting towards a fragmented network in which safety is a facet of other transport-related policies. In this contribution, it is argued that the implementation strategy underlying Sustainable Safety should be aligned with the changed context. In order to explore the adjustments needed, two perspectives of policy implementation are discussed: (1) national evidence-based policies with sectoral implementation; and (2) decentralized negotiation on transport policy in which road safety is but one aspect. We argue that the latter approach matches the characteristics of the newly evolved policy context best, and conclude with recommendations for reformulating the implementation strategy.

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

    In this paper, a systematic framework for novel and sustainable synthesis-design of processing routes is presented along with the associated computer-aided methods and tools. In Stage 1, superstructure optimization is used to determine the optimal processing route(s). In Stage 2, the design issue...

  17. Integrating policy-based management and SLA performance monitoring

    Science.gov (United States)

    Liu, Tzong-Jye; Lin, Chin-Yi; Chang, Shu-Hsin; Yen, Meng-Tzu

    2001-10-01

    Policy-based management system provides the configuration capability for the system administrators to focus on the requirements of customers. The service level agreement performance monitoring mechanism helps system administrators to verify the correctness of policies. However, it is difficult for a device to process the policies directly because the policies are the management concept. This paper proposes a mechanism to decompose a policy into rules that can be efficiently processed by a device. Thus, the device may process the rule and collect the performance statistics information efficiently; and the policy-based management system may collect these performance statistics information and report the service-level agreement performance monitoring information to the system administrator. The proposed policy-based management system achieves both the policy configuration and service-level agreement performance monitoring requirements. A policy consists of a condition part and an action part. The condition part is a Boolean expression of a source host IP group, a destination host IP group, etc. The action part is the parameters of services. We say that an address group is compact if it only consists of a range of IP address that can be denoted by a pair of IP address and corresponding IP mask. If the condition part of a policy only consists of the compact address group, we say that the policy is a rule. Since a device can efficiently process a compact address and a system administrator prefers to define a range of IP address, the policy-based management system has to translate policy into rules and supplements the gaps between policy and rules. The proposed policy-based management system builds the relationships between VPN and policies, policy and rules. Since the system administrator wants to monitor the system performance information of VPNs and policies, the proposed policy-based management system downloads the relationships among VPNs, policies and rules to the

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

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

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

  1. A Tree Based Self-routing Scheme for Mobility Support in Wireless Sensor Networks

    Science.gov (United States)

    Kim, Young-Duk; Yang, Yeon-Mo; Kang, Won-Seok; Kim, Jin-Wook; An, Jinung

    Recently, WSNs (Wireless Sensor Networks) with mobile robot is a growing technology that offer efficient communication services for anytime and anywhere applications. However, the tiny sensor node has very limited network resources due to its low battery power, low data rate, node mobility, and channel interference constraint between neighbors. Thus, in this paper, we proposed a tree based self-routing protocol for autonomous mobile robots based on beacon mode and implemented in real test-bed environments. The proposed scheme offers beacon based real-time scheduling for reliable association process between parent and child nodes. In addition, it supports smooth handover procedure by reducing flooding overhead of control packets. Throughout the performance evaluation by using a real test-bed system and simulation, we illustrate that our proposed scheme demonstrates promising performance for wireless sensor networks with mobile robots.

  2. Estimation of the acute inhalation hazards of chemicals based on route-to-route and local endpoint extrapolation: experience from bulk maritime transport.

    Science.gov (United States)

    Höfer, Thomas; James, Derek; Syversen, Tore; Bowmer, Tim

    2011-12-01

    Data on acute lethal inhalation toxicity from animal studies are commonly required for assessing the hazards to human health of volatile, gaseous and dusty chemicals or their mixtures. The International Maritime Organisation (IMO) made the provision of acute inhalation toxicity data a mandatory requirement for the carriage of bulk liquid chemicals transported by sea in tank ships, thereby creating the need for inhalation data on many hundreds of chemicals in bulk maritime transport. Taking note of previously published proposals for estimating acute inhalation toxicity hazards for chemicals, and the paucity of measured experimental data, an extrapolation method has been developed by the Group of Experts on the Scientific Aspects of Marine Environmental Protection (GESAMP) to partly fulfil this need. This method should be seen as a pragmatic approach to the challenge of missing measured experimental test data, with the added benefit of reducing tests in experimental animals. The method is based on a route-to-route (i.e. between-route) extrapolation of information on acute oral and/or dermal toxicity, in combination with data on the potential for irritation and/or corrosion to skin and eyes. The validation of this method was based on the individual evaluation of inhalation toxicity studies for 330 chemicals, including mixtures and many important chemical groups, for which the IMO holds public and industry-confidential data. The authors contend that this extrapolation method offers a reliable basis for hazard evaluation in the context of bulk maritime transport, and the 'GESAMP inhalation toxicity extrapolation method' has become part of the IMO regulatory system for the carriage of bulk liquids (i.e. noxious liquid substances) on board tank ships.

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

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

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

  6. A hybrid ACO/PSO based algorithm for QoS multicast routing problem

    Directory of Open Access Journals (Sweden)

    Manoj Kumar Patel

    2014-03-01

    Full Text Available Many Internet multicast applications such as videoconferencing, distance education, and online simulation require to send information from a source to some selected destinations. These applications have stringent Quality-of-Service (QoS requirements that include delay, loss rate, bandwidth, and delay jitter. This leads to the problem of routing multicast traffic satisfying QoS requirements. The above mentioned problem is known as the QoS constrained multicast routing problem and is NP Complete. In this paper, we present a swarming agent based intelligent algorithm using a hybrid Ant Colony Optimization (ACO/Particle Swarm Optimization (PSO technique to optimize the multicast tree. The algorithm starts with generating a large amount of mobile agents in the search space. The ACO algorithm guides the agents’ movement by pheromones in the shared environment locally, and the global maximum of the attribute values are obtained through the random interaction between the agents using PSO algorithm. The performance of the proposed algorithm is evaluated through simulation. The simulation results reveal that our algorithm performs better than the existing algorithms.

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

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

  9. Address allocation for MANET merge and partition using cluster based routing.

    Science.gov (United States)

    Singh, Sugandha; Rajpal, Navin; Sharma, Ashok

    2014-01-01

    Network merges and partitions occur quite often in MANET wherein address auto-configuration is a critical requirement. There are various approaches for address auto-configuration in MANETs which allocate address to the nodes in a dynamic and distributed manner in which HOST ID and MANET ID are assigned on the basis of their Base value. MANET merges and partitions employing Cluster Based Routing Protocol require a node to be assigned as the Cluster Head (CH). This paper presents the Election Algorithm which assigns a node as the Cluster Head on the basis of its weight. Through simulation using the NS-2, it has been shown that the Election Algorithm improves the packet delivery ratio (PDR) significantly and decreases the packet delay to a great extent in comparison to the existing AODV protocol.

  10. Unmanned Aerial Vehicle Route Planning in the Presence of a Threat Environment Based on a Virtual Globe Platform

    Directory of Open Access Journals (Sweden)

    Ming Zhang

    2016-10-01

    Full Text Available Route planning is a key technology for an unmanned aerial vehicle (UAV to fly reliably and safely in the presence of a threat environment. Existing route planning methods are mainly based on the simulation scene, whereas approaches based on the virtual globe platform have rarely been reported. In this paper, a new planning space for the virtual globe and the planner is proposed and a common threat model is constructed for threats including a no-fly zone, hazardous weather, radar coverage area, missile killing zone and dynamic threats. Additionally, an improved ant colony optimization (ACO algorithm is developed to enhance route planning efficiency and terrain masking ability. Our route planning methods are optimized on the virtual globe platform for practicability. A route planning system and six types of planners were developed and implemented on the virtual globe platform. Finally, our evaluation results demonstrate that our optimum planner has better performance in terms of fuel consumption, terrain masking, and risk avoidance. Experiments also demonstrate that the method and system described in this paper can be used to perform global route planning and mission operations.

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

    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. PMID:28445434

  12. Optimization-Based Channel Constrained Data Aggregation Routing Algorithms in Multi-Radio Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hong-Hsu Yen

    2009-06-01

    Full Text Available In wireless sensor networks, data aggregation routing could reduce the number of data transmissions so as to achieve energy efficient transmission. However, data aggregation introduces data retransmission that is caused by co-channel interference from neighboring sensor nodes. This kind of co-channel interference could result in extra energy consumption and significant latency from retransmission. This will jeopardize the benefits of data aggregation. One possible solution to circumvent data retransmission caused by co-channel interference is to assign different channels to every sensor node that is within each other’s interference range on the data aggregation tree. By associating each radio with a different channel, a sensor node could receive data from all the children nodes on the data aggregation tree simultaneously. This could reduce the latency from the data source nodes back to the sink so as to meet the user’s delay QoS. Since the number of radios on each sensor node and the number of non-overlapping channels are all limited resources in wireless sensor networks, a challenging question here is to minimize the total transmission cost under limited number of non-overlapping channels in multi-radio wireless sensor networks. This channel constrained data aggregation routing problem in multi-radio wireless sensor networks is an NP-hard problem. I first model this problem as a mixed integer and linear programming problem where the objective is to minimize the total transmission subject to the data aggregation routing, channel and radio resources constraints. The solution approach is based on the Lagrangean relaxation technique to relax some constraints into the objective function and then to derive a set of independent subproblems. By optimally solving these subproblems, it can not only calculate the lower bound of the original primal problem but also provide useful information to get the primal feasible solutions. By incorporating these

  13. GRACO: a geographic GReedy routing with an ACO-based void handling technique

    OpenAIRE

    REKIK, Mouna; MITTON, Nathalie; CHTOUROU, Zied

    2017-01-01

    International audience; Geographic routing has gained much attention as a basic routing primitive inwireless sensor networks due to its memory-less, scalability, efficiency and low overheadfeatures. Greedy forwarding is the simplest geographic routing scheme, it uses the distanceas a forwarding criterion. Nevertheless, it may suffer from communication holes, whereno next hop candidate is closer to the destination than the node currently holding thepacket. For this purpose, a void handling tec...

  14. A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Mehdi Alinaghian

    2015-08-01

    Full Text Available A significant portion of Gross Domestic Production (GDP in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG. In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (GCW for Vehicle Routing Problem regarding to fuel consumption is presented. The objective function is fuel consumption, drivers, and the usage of vehicles. Being compared to exact methods solutions for small-sized problems and to Differential Evolution (DE algorithm solutions for large-scaled problems, the results show efficient performance of the proposed GCW algorithm.

  15. Therapeutic biomaterials based on extracellular vesicles: classification of bio-engineering and mimetic preparation routes.

    Science.gov (United States)

    García-Manrique, Pablo; Matos, María; Gutiérrez, Gemma; Pazos, Carmen; Blanco-López, María Carmen

    2018-01-01

    Extracellular vesicles (EVs) are emerging as novel theranostic tools. Limitations related to clinical uses are leading to a new research area on design and manufacture of artificial EVs. Several strategies have been reported in order to produce artificial EVs, but there has not yet been a clear criterion by which to differentiate these novel biomaterials. In this paper, we suggest for the first time a systematic classification of the terms used to build up the artificial EV landscape, based on the preparation method. This could be useful to guide the derivation to clinical trial routes and to clarify the literature. According to our classification, we have reviewed the main strategies reported to date for their preparation, including key points such as: cargo loading, surface targeting strategies, purification steps, generation of membrane fragments for the construction of biomimetic materials, preparation of synthetic membranes inspired in EV composition and subsequent surface decoration.

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

  17. Nonlinear relative-proportion-based route adjustment process for day-to-day traffic dynamics: modeling, equilibrium and stability analysis

    Science.gov (United States)

    Zhu, Wenlong; Ma, Shoufeng; Tian, Junfang; Li, Geng

    2016-11-01

    Travelers' route adjustment behaviors in a congested road traffic network are acknowledged as a dynamic game process between them. Existing Proportional-Switch Adjustment Process (PSAP) models have been extensively investigated to characterize travelers' route choice behaviors; PSAP has concise structure and intuitive behavior rule. Unfortunately most of which have some limitations, i.e., the flow over adjustment problem for the discrete PSAP model, the absolute cost differences route adjustment problem, etc. This paper proposes a relative-Proportion-based Route Adjustment Process (rePRAP) maintains the advantages of PSAP and overcomes these limitations. The rePRAP describes the situation that travelers on higher cost route switch to those with lower cost at the rate that is unilaterally depended on the relative cost differences between higher cost route and its alternatives. It is verified to be consistent with the principle of the rational behavior adjustment process. The equivalence among user equilibrium, stationary path flow pattern and stationary link flow pattern is established, which can be applied to judge whether a given network traffic flow has reached UE or not by detecting the stationary or non-stationary state of link flow pattern. The stability theorem is proved by the Lyapunov function approach. A simple example is tested to demonstrate the effectiveness of the rePRAP model.

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

  19. The Impact of European Traffic Policy and Traffic Routes on the Development of the Ports of Rijeka and Place

    Directory of Open Access Journals (Sweden)

    Čedomir Ivaković

    2006-03-01

    Full Text Available Sea ports are the key segment of the traffic and economicdevelopment of maritime countries. Pan-European transportcorridors include the most important sea pmts and sea routes.They are an extension of the existing land corridors.The most important and the most promising crossings oftraffic corridors between the Central European, Pannonianand Adriatic areas, with the naturally shortest traffic routes directedtowards the Croatian sea ports are Corridor 58 ( Rijeka-Zagreb-Budapest and Corridor 5c (Ploce-Sarajevo-Osijek--Budapest. The primary purpose of this work is to study the importanceof the existing trading conditions and new investmentundertakings in the context of increase in competitiveness of theports of Rijeka and Place.The authors' attention is particularly directed to the constructionof new port terminals to increase the traffic potentialsof the Croatian sea ports. The formed conception with its characteristics,the methodology applied, and research results representthe quality starting points in determining a uniform portpolicy of the Republic of Croatia within the European trafficsystem.

  20. Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments

    Science.gov (United States)

    Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

    2018-01-01

    Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio. PMID:29438438

  1. Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments.

    Directory of Open Access Journals (Sweden)

    Qaisar Ayub

    Full Text Available Delay Tolerant Network (DTN multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.

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

  3. Structuring AHP-based maintenance policy selection

    NARCIS (Netherlands)

    Goossens, Adriaan; Basten, Robertus Johannes Ida; Hummel, J. Marjan; van der Wegen, Leonardus L.M.

    2015-01-01

    We aim to structure the maintenance policy selection process for ships, using the Analytic Hierarchy Process (AHP). Maintenance is an important contributor to reach the intended life-time of capital technical assets, and it is gaining increasing interest and relevance. A maintenance policy is a

  4. Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy

    Science.gov (United States)

    Jiang, Zhong-Yuan; Ma, Jian-Feng; Jing, Xu

    2015-03-01

    Based on the consideration of easy implementation of new routing strategies on many real complex networks such as the Internet, we propose a hybrid routing mechanism composed of the shortest path routing and the global dynamic routing strategy to improve the network traffic capacity. Under the background of current routing policy and network structure, packets can be sent along the shortest paths or by using source routing information. In this work, a global dynamic source routing strategy is employed as a supplementary routing mechanism to bypass central nodes and increase the delivery capacity utilization of all nodes significantly in the network. The traffic capacity of networked complex systems can be enhanced tens of times at the cost of a little average path lengthening. This hybrid routing method is very useful to network service providers and can be constitutionally supported on several networked complex systems such as the Internet and wireless ad hoc networks.

  5. Population resizing on fitness improvement genetic algorithm to optimize promotion visit route based on android and google maps API

    Science.gov (United States)

    Listyorini, Tri; Muzid, Syafiul

    2017-06-01

    The promotion team of Muria Kudus University (UMK) has done annual promotion visit to several senior high schools in Indonesia. The visits were done to numbers of schools in Kudus, Jepara, Demak, Rembang and Purwodadi. To simplify the visit, each visit round is limited to 15 (fifteen) schools. However, the team frequently faces some obstacles during the visit, particularly in determining the route that they should take toward the targeted school. It is due to the long distance or the difficult route to reach the targeted school that leads to elongated travel duration and inefficient fuel cost. To solve these problems, the development of a certain application using heuristic genetic algorithm method based on the dynamic of population size or Population Resizing on Fitness lmprovement Genetic Algorithm (PRoFIGA), was done. This android-based application was developed to make the visit easier and to determine a shorter route for the team, hence, the visiting period will be effective and efficient. The result of this research was an android-based application to determine the shortest route by combining heuristic method and Google Maps Application Programming lnterface (API) that display the route options for the team.

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

    Science.gov (United States)

    Perumal, Madhumathy; Dhandapani, Sivakumar

    2015-01-01

    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.

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

  8. The roots and routes of environmental and sustainability education policy research – an introduction to a virtual special issue

    DEFF Research Database (Denmark)

    Lysgaard, Jonas Andreasen; Van Poeck, Katrien; Reid, Alan

    2016-01-01

    This article introduces the themes of a virtual special issue (VSI) of Environmental Education Research (http://explore.tandfonline.com/content/ed/ceer-vsi) focused on policy research in environmental and sustainability education (ESE). The broad purpose behind preparing the VSI was to consider...... the challenges involved in linking particular concepts of environment and sustainability with key themes in educational policy, and how this remains a heavily contested practice. Examples drawn from two decades of studies published in the journal show how these might be illustrated, addressed, problematized...

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

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

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

  12. Solving the Tractor and Semi-Trailer Routing Problem Based on a Heuristic Approach

    OpenAIRE

    Li, Hongqi; Lu, Yue; Zhang, Jun; Wang, Tianyi

    2012-01-01

    We study the tractor and semi-trailer routing problem (TSRP), a variant of the vehicle routing problem (VRP). In the TSRP model for this paper, vehicles are dispatched on a trailer-flow network where there is only one main depot, and all tractors originate and terminate in the main depot. Two types of decisions are involved: the number of tractors and the route of each tractor. Heuristic algorithms have seen widespread application to various extensions of the VRP. However, this approach has n...

  13. Network Coding Based Security for Routing Attacks in WRN: Frechet Interference and Rayleigh Outage Evaluation

    Directory of Open Access Journals (Sweden)

    R. Villalpando-Hernández

    2011-08-01

    Full Text Available We present a network coding security method capable of detecting several routing attacks in wireless reconfigurablenetworks. Routing security attacks include selective forwarding, black holes, and wormholes. The proposed methodperforms linear network coding over intermediate nodes composing a given route, not only to distribute content, butalso to provide data confidentiality by cooperation as a mechanism of detection. The method presents a robust,accurate and fast response under security attacks for varying network conditions, such as interference and outagedue to channel fading. It also provides a gain in network throughput by increasing the number of successfully receivedpackets without a significant increase of the bandwidth usage.

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

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

  16. Illicit Drugs, Policing and the Evidence-Based Policy Paradigm

    Science.gov (United States)

    Ritter, Alison; Lancaster, Kari

    2013-01-01

    The mantra of evidence-based policy (EBP) suggests that endeavours to implement evidence-based policing will produce better outcomes. However there is dissonance between the rhetoric of EBP and the actuality of policing policy. This disjuncture is critically analysed using the case study of illicit drugs policing. The dissonance may be ameliorated…

  17. Base stock policies with degraded service to large orders

    DEFF Research Database (Denmark)

    Du, Bisheng; Larsen, Christian

    2011-01-01

    We study an inventory system controlled by a base stock policy assuming a compound renewal demand process. We extend the base stock policy by incorporating rules for degrading the service of larger orders. Two specific rules are considered, denoted as Postpone(q,t) and Split(q), respectively...

  18. Base stock policies with degraded service to larger orders

    DEFF Research Database (Denmark)

    Du, Bisheng; Larsen, Christian

    We study an inventory system controlled by a base stock policy assuming a compound renewal demand process. We extend the base stock policy by incorporating rules for degrading the service of larger orders. Two specific rules are considered, denoted Postpone(q,t) and Split(q), respectively. The aim...

  19. A comprehensive cloud-based real-time simulation framework for oblivious power routing in clusters of DC microgrids

    DEFF Research Database (Denmark)

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

    2017-01-01

    In this paper, we propose a novel cloud-based approach for solving the optimal power routing problem in clusters of DC microgrids. To this end, we deploy oblivious network routing design. Each cluster includes multiple microgrids which are connected via DC links in a multi-terminal DC system...... cluster are unaware of the current cluster status. Furthermore, each microgrid does not need to have the access to the current flows through the multi-terminal DC system as well as the generation capacity and load demand of other microgrids. The optimal routing strategy considers two main objectives: 1...... of microgrids. The effectiveness of the proposed algorithm has been verified in MATLAB simulation. Furthermore, we propose a comprehensive simulation platform for further implementation of the proposed strategy on OPAL-RT real-time simulator system (RTDS). In our proposed platform, the communication path...

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

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

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

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

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

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

  6. Adaptive MANET multipath routing algorithm based on the simulated annealing approach.

    Science.gov (United States)

    Kim, Sungwook

    2014-01-01

    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.

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

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

  9. An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor Networks

    OpenAIRE

    Ehsan Ahvar; Shohreh Ahvar; Gyu Myoung Lee; Noel Crespi

    2014-01-01

    Wireless sensor network (WSN) typically has energy consumption restriction. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saving protocols are used to minimize the overall energy consumed by a WSN, while energy balancing protocols attempt to efficiently distribute the consumption of energy throughout the network. In general terms, ener...

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

  11. A programming environment to control switching networks based on STC104 packet routing chip

    Science.gov (United States)

    Legrand, I. C.; Schwendicke, U.; Leich, H.; Medinnis, M.; Koehler, A.; Wegner, P.; Sulanke, K.; Dippel, R.; Gellrich, A.

    1997-02-01

    The software environment used to control a large switching architecture based on SGS-Thomson STC104 (an asynchronous 32-way dynamic packet routing chip) is presented. We are evaluating this switching technology for large scale, real-time parallel systems. A Graphical User Interface (GUI) written as a multi-thread application in Java allows to set the switch configuration and to continuously monitor the state of each link. This GUI connects to a multi-thread server via TCP/IP sockets. The server is running on a PC-Linux system and implements the virtual channel protocol in communicating with the STC104 switching units using the Data Strobe link or the VME bus. Linux I/O drivers to control the Data Strobe link parallel adaptor (STC101) were developed. For each client the server creates a new thread and allocates a new socket for communications. The Java code of the GUI may be transferred to any client using the http protocol providing a user friendly interface to the system with real-time monitoring which is also platform independent.

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

  13. Efficient shortest-path-tree computation in network routing based on pulse-coupled neural networks.

    Science.gov (United States)

    Qu, Hong; Yi, Zhang; Yang, Simon X

    2013-06-01

    Shortest path tree (SPT) computation is a critical issue for routers using link-state routing protocols, such as the most commonly used open shortest path first and intermediate system to intermediate system. Each router needs to recompute a new SPT rooted from itself whenever a change happens in the link state. Most commercial routers do this computation by deleting the current SPT and building a new one using static algorithms such as the Dijkstra algorithm at the beginning. Such recomputation of an entire SPT is inefficient, which may consume a considerable amount of CPU time and result in a time delay in the network. Some dynamic updating methods using the information in the updated SPT have been proposed in recent years. However, there are still many limitations in those dynamic algorithms. In this paper, a new modified model of pulse-coupled neural networks (M-PCNNs) is proposed for the SPT computation. It is rigorously proved that the proposed model is capable of solving some optimization problems, such as the SPT. A static algorithm is proposed based on the M-PCNNs to compute the SPT efficiently for large-scale problems. In addition, a dynamic algorithm that makes use of the structure of the previously computed SPT is proposed, which significantly improves the efficiency of the algorithm. Simulation results demonstrate the effective and efficient performance of the proposed approach.

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

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

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

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

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

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

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

  1. CCS-DTN: Clustering and Network Coding-Based Efficient Routing in Social DTNs

    Directory of Open Access Journals (Sweden)

    Zhenjing Zhang

    2014-12-01

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

  2. Policy-Based Negotiation Engine for Cross-Domain Interoperability

    Science.gov (United States)

    Vatan, Farrokh; Chow, Edward T.

    2012-01-01

    A successful policy negotiation scheme for Policy-Based Management (PBM) has been implemented. Policy negotiation is the process of determining the "best" communication policy that all of the parties involved can agree on. Specifically, the problem is how to reconcile the various (and possibly conflicting) communication protocols used by different divisions. The solution must use protocols available to all parties involved, and should attempt to do so in the best way possible. Which protocols are commonly available, and what the definition of "best" is will be dependent on the parties involved and their individual communications priorities.

  3. The Knowledge Base for State Policy: Status, Needs, and Trends.

    Science.gov (United States)

    Tushnet, Naida C.

    A task of regional educational laboratories is to provide information to state and local education policy makers. The new focus on policy reflects a change in the labs' knowledge base and audience. The subsequent move into the political arena has created risks for the labs, which have responded to the new task in different ways. The nature of the…

  4. Strengthening Research Capacity and Evidence-Based Policy ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    ... wider Central Asian region lack capacity to conduct empirical analysis and create policies based on research evidence. To address government priorities, the region needs quality research driven by local demands and analytical skills that can inform effective development responses through policy. This 39-month project, ...

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

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

  7. An efficient and reliable geographic routing protocol based on partial network coding for underwater sensor networks.

    Science.gov (United States)

    Hao, Kun; Jin, Zhigang; Shen, Haifeng; Wang, Ying

    2015-05-28

    Efficient routing protocols for data packet delivery are crucial to underwater sensor networks (UWSNs). However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. Network coding is a promising technique for efficient data packet delivery thanks to the broadcast nature of acoustic channels and the relatively high computation capabilities of the sensor nodes. In this work, we present GPNC, a novel geographic routing protocol for UWSNs that incorporates partial network coding to encode data packets and uses sensor nodes' location information to greedily forward data packets to sink nodes. GPNC can effectively reduce network delays and retransmissions of redundant packets causing additional network energy consumption. Simulation results show that GPNC can significantly improve network throughput and packet delivery ratio, while reducing energy consumption and network latency when compared with other routing protocols.

  8. Label-based routing for a family of small-world Farey graphs.

    Science.gov (United States)

    Zhai, Yinhu; Wang, Yinhe

    2016-05-11

    We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product of two Fibonacci numbers, are determined only by their labels, and the time complexity of the algorithm is O(n). It is the first algorithm to figure out all the shortest paths between any pair of vertices in a kind of deterministic graphs. For Farey networks, the existence of an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization and structural controllability) and also to understand the underlying mechanisms that have shaped their particular structure.

  9. Efficient and Secure Routing Protocol for Wireless Sensor Networks through Optimal Power Control and Optimal Handoff-Based Recovery Mechanism

    Directory of Open Access Journals (Sweden)

    S. Ganesh

    2012-01-01

    Full Text Available Advances in wireless sensor network (WSN technology have provided the availability of small and low-cost sensor with capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In WSN, the sensor nodes have a limited transmission range, and their processing and storage capabilities as well as their energy resources are also limited. Modified triple umpiring system (MTUS has already proved its better performance in Wireless Sensor Networks. In this paper, we extended the MTUS by incorporating optimal signal to noise ratio (SNR-based power control mechanism and optimal handoff-based self-recovery features to form an efficient and secure routing for WSN. Extensive investigation studies using Glomosim-2.03 Simulator show that efficient and secure routing protocol (ESRP with optimal power control mechanism, and handoff-based self-recovery can significantly reduce the power usage.

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

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

  12. Vehicle Routing Problem with Soft Time Windows Based on Improved Genetic Algorithm for Fruits and Vegetables Distribution

    Directory of Open Access Journals (Sweden)

    Peiqing Li

    2015-01-01

    Full Text Available Fresh fruits and vegetables, perishable by nature, are subject to additional deterioration and bruising in the distribution process due to vibration and shock caused by road irregularities. A nonlinear mathematical model was developed that considered not only the vehicle routing problem with time windows but also the effect of road irregularities on the bruising of fresh fruits and vegetables. The main objective of this work was to obtain the optimal distribution routes for fresh fruits and vegetables considering different road classes with the least amount of logistics costs. An improved genetic algorithm was used to solve the problem. A fruit delivery route among the 13 cities in Jiangsu Province was used as a real analysis case. The simulation results showed that the vehicle routing problem with time windows, considering road irregularities and different classes of toll roads, can significantly influence total delivery costs compared with traditional VRP models. The comparison between four models to predict the total cost and actual total cost in distribution showed that the improved genetic algorithm is superior to the Group-based pattern, CW pattern, and O-X type cross pattern.

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

    Science.gov (United States)

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

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

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

  15. Comparing the efficiency of transport routes and corridors

    Directory of Open Access Journals (Sweden)

    Liviu Gabriel GHIŢULEASA

    2011-03-01

    Full Text Available In the broader context of the importance granted to accessibility by the European spatial planning policies, comparing the efficiency of European and national transportation routes and corridors constitutes an issue of particular relevance for Romania. In order to resolve it, this paper proposes a methodology based on potential accessibility, determined by the total population served, and the efficiency of the path, by analogy with the least squares method. Both approaches were applied to internal and European routes.

  16. Contact Graph Routing

    Science.gov (United States)

    Burleigh, Scott C.

    2011-01-01

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

  17. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

    NARCIS (Netherlands)

    Nagata, Yuichi; Bräysy, Olli; Dullaert, Wout

    In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator and the introduction of a novel penalty function

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

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

  20. A node-disjoint multi-path routing protocol based on location ...

    African Journals Online (AJOL)

    user

    control message overhead. Keywords: Multi-path Routing Protocol, Mobile Ad hoc Networks, Location Prediction, Node Disjoint, Simulation. 1. Introduction ..... synchronization algorithms (example: Naumov et al., 2006; Sheu et al., 2007) have been proposed for wireless ad hoc networks. The destination node computes and ...

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

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

  3. A RESOURCE-BASED VIEW OF NEW FIRM SURVIVAL: NEW PERSPECTIVES ON THE ROLE OF INDUSTRY AND EXIT ROUTE

    OpenAIRE

    SUSAN COLEMAN; CARMEN COTEI; JOSEPH FARHAT

    2013-01-01

    This article explores factors affecting the survival and exit routes of new firms created in 2004 using data from the Kauffman Firm Survey. We draw upon the Resource-Based View to test several hypotheses regarding the impact of both tangible and intangible resources on new firm survival in both service and non-service firms. We also distinguish between two types of exit: closures (permanently stopped operations) and mergers or acquisitions. Our results reveal that, although service and non-se...

  4. Operating Policies and Procedures of Computer Data-Base Systems.

    Science.gov (United States)

    Anderson, David O.

    Speaking on the operating policies and procedures of computer data bases containing information on students, the author divides his remarks into three parts: content decisions, data base security, and user access. He offers nine recommended practices that should increase the data base's usefulness to the user community: (1) the cost of developing…

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

    There has been an increasing demand for connectivity of the clusters of microgrids to increase their flexibility and security. This paper presents a framework for implementation, simulation, and evaluation of a novel power routing algorithm for clusters of microgrids. The presumed cluster....... The key contribution of this paper is that each microgrid in the cluster is unaware of the current state and other flows of the cluster. In this approach, the optimal power flow problem is solved for the system while managing congestion and mitigating power losses. The proposed methodology works for both...... radial and non-radial networks regardless of the network topology, scale, and number of microgrids involved in the cluster. Therefore, it is also well suited for large-scale optimal power routing problems that will emerge in the future clusters of microgrids. The effectiveness of the proposed algorithm...

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

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

    OpenAIRE

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

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

  8. Quality of Service Issues for Reinforcement Learning Based Routing Algorithm for Ad-Hoc Networks

    OpenAIRE

    Kulkarni, Shrirang Ambaji; Rao, G. Raghavendra

    2012-01-01

    Mobile ad-hoc networks are dynamic networks which are decentralized and autonomous in nature. Many routing algorithms have been proposed for these dynamic networks. It is an important problem to model Quality of Service requirements on these types of algorithms which traditionally have certain limitations. To model this scenario we have considered a reinforcement learning algorithm SAMPLE. SAMPLE promises to deal effectively with congestion and under high traffic load. As it is natural for ad...

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

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

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

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

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

  14. Router Agent Technology for Policy-Based Network Management

    Science.gov (United States)

    Chow, Edward T.; Sudhir, Gurusham; Chang, Hsin-Ping; James, Mark; Liu, Yih-Chiao J.; Chiang, Winston

    2011-01-01

    This innovation can be run as a standalone network application on any computer in a networked environment. This design can be configured to control one or more routers (one instance per router), and can also be configured to listen to a policy server over the network to receive new policies based on the policy- based network management technology. The Router Agent Technology transforms the received policies into suitable Access Control List syntax for the routers it is configured to control. It commits the newly generated access control lists to the routers and provides feedback regarding any errors that were faced. The innovation also automatically generates a time-stamped log file regarding all updates to the router it is configured to control. This technology, once installed on a local network computer and started, is autonomous because it has the capability to keep listening to new policies from the policy server, transforming those policies to router-compliant access lists, and committing those access lists to a specified interface on the specified router on the network with any error feedback regarding commitment process. The stand-alone application is named RouterAgent and is currently realized as a fully functional (version 1) implementation for the Windows operating system and for CISCO routers.

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

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

  17. DCAR: DTN Congestion Avoidance Routing Algorithm Based on Tokens in an Urban Environment

    Directory of Open Access Journals (Sweden)

    Hezhe Wang

    2017-01-01

    Full Text Available When a delay/disruption tolerant network (DTN is applied in an urban scenario, the network is mainly composed of mobile devices carried by pedestrians, cars, and other vehicles, and the node’s movement trajectory is closely related to its social relationships and regular life; thus, most existing DTN routing algorithms cannot show efficient network performance in urban scenarios. In this paper, we propose a routing algorithm, called DCRA, which divides the urban map into grids; fixed sink stations are established in specific grids such that the communication range of each fixed sink station can cover a specific number of grids; these grids are defined as a cluster and allocated a number of tokens in each cluster; the tokens in the cluster are controlled by the fixed sink station. A node will transmit messages to a relay node that has a larger remaining buffer size and encounters fixed sink stations or the destination node more frequently after it obtains a message transmit token. Simulation experiments are carried out to verify the performance of the DCAR under an urban scenario, and results show that the DCAR algorithm is superior to existing routing algorithms in terms of delivery ratio, average delay, and network overhead.

  18. Age replacement policy based on imperfect repair with random probability

    International Nuclear Information System (INIS)

    Lim, J.H.; Qu, Jian; Zuo, Ming J.

    2016-01-01

    In most of literatures of age replacement policy, failures before planned replacement age can be either minimally repaired or perfectly repaired based on the types of failures, cost for repairs and so on. In this paper, we propose age replacement policy based on imperfect repair with random probability. The proposed policy incorporates the case that such intermittent failure can be either minimally repaired or perfectly repaired with random probabilities. The mathematical formulas of the expected cost rate per unit time are derived for both the infinite-horizon case and the one-replacement-cycle case. For each case, we show that the optimal replacement age exists and is finite. - Highlights: • We propose a new age replacement policy with random probability of perfect repair. • We develop the expected cost per unit time. • We discuss the optimal age for replacement minimizing the expected cost rate.

  19. Worship Discourse and White Race-based Policy Attitudes

    Science.gov (United States)

    Brown, R. Khari; Kaiser, Angela; Jackson, James S.

    2014-01-01

    The current study relies upon the 2004 National Politics Study to examine the association between exposure to race-based messages within places of worship and White race-based policy attitudes. The present study challenges the notion that, for White Americans, religiosity inevitably leads to racial prejudice. Rather, we argue, as others have, that religion exists on a continuum that spans from reinforcing to challenging the status quo of social inequality. Our findings suggests that the extent to which Whites discuss race along with the potential need for public policy solutions to address racial inequality within worship spaces, worship attendance contributes to support for public policies aimed at reducing racial inequality. On the other hand, apolitical and non-structural racial discussions within worship settings do seemingly little to move many Whites to challenge dominant idealistic perceptions of race that eschews public policy interventions as solutions to racial inequality. PMID:25324579

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

  1. An empirical evaluation of lightweight random walk based routing protocol in duty cycle aware wireless sensor networks.

    Science.gov (United States)

    Mian, Adnan Noor; Fatima, Mehwish; Khan, Raees; Prakash, Ravi

    2014-01-01

    Energy efficiency is an important design paradigm in Wireless Sensor Networks (WSNs) and its consumption in dynamic environment is even more critical. Duty cycling of sensor nodes is used to address the energy consumption problem. However, along with advantages, duty cycle aware networks introduce some complexities like synchronization and latency. Due to their inherent characteristics, many traditional routing protocols show low performance in densely deployed WSNs with duty cycle awareness, when sensor nodes are supposed to have high mobility. In this paper we first present a three messages exchange Lightweight Random Walk Routing (LRWR) protocol and then evaluate its performance in WSNs for routing low data rate packets. Through NS-2 based simulations, we examine the LRWR protocol by comparing it with DYMO, a widely used WSN protocol, in both static and dynamic environments with varying duty cycles, assuming the standard IEEE 802.15.4 in lower layers. Results for the three metrics, that is, reliability, end-to-end delay, and energy consumption, show that LRWR protocol outperforms DYMO in scalability, mobility, and robustness, showing this protocol as a suitable choice in low duty cycle and dense WSNs.

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

  3. Market-Based Policies for Pollution Control in Latin America

    OpenAIRE

    Sarah West; Ann Wolverton

    2003-01-01

    Rapid urbanization and increased industrialization have led to high pollution levels throughout Latin America. Economists tout policies based on market-based economic incentives as the most cost-effective methods for addressing a wide variety of environmental problems. This chapter examines market-based incentives and their applicability to Latin America. We first review the market-based incentives traditionally used to address pollution – emissions taxes, environmental subsidies, tax and sub...

  4. NP-ZBR: An Improved ZBR Routing Algorithm Based on Neighbors Perception

    Directory of Open Access Journals (Sweden)

    Jianli Zhao

    2014-06-01

    Full Text Available ZBR is the most popular routing protocol in ZigBee network currently, but in some cases, it is not very efficient. In this paper a new improved ZBR is proposed which add the network address range field of neighbor node in the neighbor table. So the node can distinguish whether the destination node is the descendants of its neighbor. Compared with the previous protocols OI-ZBR, NI- ZBR and ZBR in NS-2, NP-ZBR shows its merits in the average hop, end to end delay and the first packet delay.

  5. A condition-based maintenance policy for stochastically deteriorating systems

    International Nuclear Information System (INIS)

    Grall, A.; Berenguer, C.; Dieulle, L.

    2002-01-01

    We focus on the analytical modeling of a condition-based inspection/replacement policy for a stochastically and continuously deteriorating single-unit system. We consider both the replacement threshold and the inspection schedule as decision variables for this maintenance problem and we propose to implement the maintenance policy using a multi-level control-limit rule. In order to assess the performance of the proposed maintenance policy and to minimize the long run expected maintenance cost per unit time, a mathematical model for the maintained system cost is derived, supported by the existence of a stationary law for the maintained system state. Numerical experiments illustrate the performance of the proposed policy and confirm that the maintenance cost rate on an infinite horizon can be minimized by a joint optimization of the maintenance structure thresholds, or equivalently by a joint optimization of a system replacement threshold and the aperiodic inspection schedule

  6. School Improvement Policy--Site-Based Management

    Directory of Open Access Journals (Sweden)

    C. Kenneth Tanner

    1998-03-01

    Full Text Available Have administrative functions of principals changed in schools practicing site-based management (SBM with shared governance? To deal with this issue we employed the Delphi technique and a panel of 24 experts from 14 states. The experts, which included educational specialists, researchers, writers, and elementary school principals, agreed that the implementation of SBM dramatically influences the roles of the principal in management/administration and leadership. Data revealed that the elementary principal's leadership role requires specialized skills to support shared governance, making it necessary to form professional development programs that adapt to innovations evolving from the implementation of SBM.

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

  8. SDP Policy Iteration-Based Energy Management Strategy Using Traffic Information for Commuter Hybrid Electric Vehicles

    Directory of Open Access Journals (Sweden)

    Xiaohong Jiao

    2014-07-01

    Full Text Available This paper demonstrates an energy management method using traffic information for commuter hybrid electric vehicles. A control strategy based on stochastic dynamic programming (SDP is developed, which minimizes on average the equivalent fuel consumption, while satisfying the battery charge-sustaining constraints and the overall vehicle power demand for drivability. First, according to the sample information of the traffic speed profiles, the regular route is divided into several segments and the statistic characteristics in the different segments are constructed from gathered data on the averaged vehicle speeds. And then, the energy management problem is formulated as a stochastic nonlinear and constrained optimal control problem and a modified policy iteration algorithm is utilized to generate a time-invariant state-dependent power split strategy. Finally, simulation results over some driving cycles are presented to demonstrate the effectiveness of the proposed energy management strategy.

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Xiangping Gu

    2018-02-01

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

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

  16. Robustness of airline route networks

    Science.gov (United States)

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

    2016-03-01

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

  17. A dual justification for science-based policy-making

    DEFF Research Database (Denmark)

    Pedersen, David Budtz

    2014-01-01

    Science-based policy-making has grown ever more important in recent years, in parallel with the dramatic increase in the complexity and uncertainty of the ways in which science and technology interact with society and economy at the national, regional and global level. Installing a proper framewo...

  18. Strengthening Science-based Environmental Policy Development in ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    Strengthening Science-based Environmental Policy Development in Burma's Democratic Transition. For decades, it was very difficult to complete, share or access development research in Burma. However, in the past two years, the Burmese political landscape has seen far-reaching changes. The military junta has ...

  19. Survey-Based Measurement of Public Management and Policy Networks

    Science.gov (United States)

    Henry, Adam Douglas; Lubell, Mark; McCoy, Michael

    2012-01-01

    Networks have become a central concept in the policy and public management literature; however, theoretical development is hindered by a lack of attention to the empirical properties of network measurement methods. This paper compares three survey-based methods for measuring organizational networks: the roster, the free-recall name generator, and…

  20. Evidence-based ICT Policy for Development and Innovation | CRDI ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    Evidence-based ICT Policy for Development and Innovation. The cost of access to information and communication technologies (ITCs) in Africa remains the major impediment to the participation of Africans in the networked society. While Africa is the region with the fastest growing number of mobile phone subscribers in the ...

  1. Application of a relational data base for documenting the ground test accelerator cable routing and wiring interconnections

    International Nuclear Information System (INIS)

    Blackwell, D.B.; Rogers, W.L.; Brown, V.W.; Ekeroth, G.A.; McGill, T.O.

    1991-01-01

    The Ground Test Accelerator (GTA) has many different types of equipment and interconnections to support the operation. Various functions are performed by these equipments such as signal generation, instrument control, and diagnostics. All of the thousands of signals must be routed from the protected tunnel area into the operational control area of the building. Tabulating the routing of these cables, interconnections, terminations, and even the installation status, results in an enormous amount of data collection and maintenance. A relational data base program called Wireflex was written to allow real-time storage, instant recall, and reporting of this information. The operational environment is the VAX network with password security to protect the integrity of the stored data. The format of the program data bases, with the relationships and interchange of information, is described. Examples of input forms show the type of information being stored and the indexing for searching specific entries. Reports are also included displaying the flexibility of types as well as the ability to recover specific entries or ranges of information

  2. PROSPECTS OF THE REGIONAL INTEGRATION POLICY BASED ON CLUSTER FORMATION

    Directory of Open Access Journals (Sweden)

    Elena Tsepilova

    2018-01-01

    Full Text Available The purpose of this article is to develop the theoretical foundations of regional integration policy and to determine its prospects on the basis of cluster formation. The authors use such research methods as systematization, comparative and complex analysis, synthesis, statistical method. Within the framework of the research, the concept of regional integration policy is specified, and its integration core – cluster – is allocated. The authors work out an algorithm of regional clustering, which will ensure the growth of economy and tax income. Measures have been proposed to optimize the organizational mechanism of interaction between the participants of the territorial cluster and the authorities that allow to ensure the effective functioning of clusters, including taxation clusters. Based on the results of studying the existing methods for assessing the effectiveness of cluster policy, the authors propose their own approach to evaluating the consequences of implementing the regional integration policy, according to which the list of quantitative and qualitative indicators is defined. The present article systematizes the experience and results of the cluster policy of certain European countries, that made it possible to determine the prospects and synergetic effect from the development of clusters as an integration foundation of regional policy in the Russian Federation. The authors carry out the analysis of activity of cluster formations using the example of the Rostov region – a leader in the formation of conditions for the cluster policy development in the Southern Federal District. 11 clusters and cluster initiatives are developing in this region. As a result, the authors propose measures for support of the already existing clusters and creation of the new ones.

  3. An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Eighth Revision

    Science.gov (United States)

    Abbott, Terence S.; Swieringa, Kurt S.

    2017-01-01

    This paper presents an overview of the eighth revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This paper supersedes the previous documentation and presents a modification to the algorithm referred to as the Airborne Spacing for Terminal Arrival Routes version 13 (ASTAR13). This airborne self-spacing concept contains both trajectory-based and state-based mechanisms for calculating the speeds required to achieve or maintain a precise spacing interval with another aircraft. The trajectory-based capability allows for spacing operations prior to the aircraft being on a common path. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft. This current revision to the algorithm supports the evolving industry standards relating to airborne self-spacing.

  4. INVESTIGATION OF FISCAL AND BUDGETARY POLICIES BASED ON ECONOMIC THEORIES

    Directory of Open Access Journals (Sweden)

    EMILIA CAMPEANU

    2011-04-01

    Full Text Available Empirical analysis of fiscal and budgetary policies cannot be achieved without first knowing how they are viewed in the economic theories. This approach is important to indicate the position and implications of fiscal and budgetary policy tools in the economic theory considering their major differences. Therefore, the paper aims is to investigate the fiscal and budgetary policies based on economic theories such as neoclassical, Keynesian and neo-Keynesian theory in order to indicate their divergent points. Once known these approaches at the economic theory level is easier to establish the appropriate measures taking into consideration the framing of a country economy in a certain pattern. This work was supported from the European Social Fund through Sectoral Operational Programme Human Resources Development 2007-2013, project number POSDRU/89/1.5/S/59184 „Performance and excellence in postdoctoral research in Romanian economics science domain” (contract no. 0501/01.11.2010.

  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. Sustainable development based energy policy making frameworks, a critical review

    International Nuclear Information System (INIS)

    Meyar-Naimi, H.; Vaez-Zadeh, S.

    2012-01-01

    This paper, in the first step, presents an overview of the origination and formulation of sustainable development (SD) concept and the related policy making frameworks. The frameworks include Pressure–State–Response (PSR), Driving Force–State–Response (DSR), Driving Force–Pressure–State–Impact–Response (DPSIR), Driving Force–Pressure–State–Effect–Action (DPSEA) and Driving Force-Pressure-State-Exposure-Effect-Action (DPSEEA). In this regard, 40 case studies using the reviewed frameworks reported during 1994–2011 are surveyed. Then, their application area and application intensity are investigated. It is concluded that PSR, and DPSEA and DPSEEA have the higher and lower application intensities, respectively. Moreover, using Analytical Hierarchy Process (AHP) with a set of criteria, it is shown that PSR and DPSIR have the highest and lowest priorities. Finally, the shortcomings of frameworks applications are discussed. The paper is helpful in selecting appropriate policy making frameworks and presents some hints for future research in the area for developing more comprehensive models especially for sustainable electric energy policy making. - Highlights: ► The origination and formulation of sustainable development (SD) concept is reviewed. ► SD based frameworks (PSR, DSR, DPSIR, DPSEA and DPSEEA) are also reviewed. ► Then, the frameworks application area and intensity in recent years are investigated. ► Finally, the SD concept and the SD based frameworks are criticized. ► It will be helpful for developing more comprehensive energy policy making models.

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

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

    Science.gov (United States)

    Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

    2015-06-12

    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.

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

  10. Decolonizing the Evidence-Based Education and Policy Movement: Revealing the Colonial Vestiges in Educational Policy, Research, and Neoliberal Reform

    Science.gov (United States)

    Shahjahan, Riyad Ahmed

    2011-01-01

    There is a growing body of literature discussing evidence-based education, practice, policy, and decision-making from a critical perspective. In this article, drawing on the literature and policy documents related to evidence-based education in the USA, Britain, and Canada, I join this critique and offer an anticolonial perspective. I argue that…

  11. The cell based therapy and the policy implications in India.

    Science.gov (United States)

    Mukhopadhyay, Bratati; Basak, Saroj K; Ganguly, Nirmal K

    2011-01-01

    The recent scientific development using stem or other differentiated cells has generated great hopes for treatment of various diseases. Major thrust has been given to formulate country specific laws and regulations considering international guidelines to conduct research and clinical applications of "Cell Based Therapy" (CBT) all over the world. Attempts have made in this review to discuss the current policies that are practiced by various countries in the areas related to CBT with special emphasis on CBT related research and development in India. The two major funding agencies of Government of India e.g. Department of Biotechnology (DBT) and Indian Council of Medical Research (ICMR), have jointly formulated the "Guidelines for Stem Cell Research and Therapy" in 2007 which requires update and revision. Based on the review of the current world scenario of CBT research and development, suggestions have been made for the development of a new CBT policy that will help in progress of research and patient treatment in India.

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

  13. Confidence-Based Robot Policy Learning from Demonstration

    Science.gov (United States)

    2009-03-05

    Development of a small biped entertainment robot QRIO. In Micro- Nanomechatronics and Human Science, 2004, pages 23–28, 2004. [45] Odest Chadwicke Jenkins...adaptation of biped locomotion. Robotics and Autonomous Systems, 47:79–91, 2004. [60] Ulrich Nehmzow, Otar Akanyeti, Cristoph Weinrich, Theocharis...Confidence-Based Robot Policy Learning from Demonstration Sonia Chernova CMU-CS-09-105 March 5, 2009 School of Computer Science Computer Science

  14. Assessing of energy policies based on Turkish agriculture:

    International Nuclear Information System (INIS)

    Sayin, Cengiz; Nisa Mencet, M.; Ozkan, Burhan

    2005-01-01

    In this study, the current energy status of Turkey and the effects of national energy policies on Turkish agricultural support policies are discussed for both current and future requirements. Turkey is an energy-importing country producing 30 mtoe (million tons of oil equivalent) energy but consuming 80 mtoe. The energy import ratio of Turkey is 65-70% and the majority of this import is based on petroleum and natural gas. Furthermore, while world energy demand increases by 1.8% annually, Turkey's energy demand increases by about 8%. Although energy consumption in agriculture is much lower than the other sectors in Turkey, energy use as both input and output of agricultural sector is a very important issue due to its large agricultural potential and rural area. Total agricultural land area is 27.8 million hectares and about 66.5% of this area is devoted for cereal production. On the other hand, Turkey has over 4 million agricultural farm holdings of which 70-75% is engaged in cereal production. Machinery expenses, mainly diesel, constitute 30-50% of total variable expenses in cereal production costs. It is observed that energy policies pursued in agriculture have been directly affected by diesel prices in Turkey. Therefore, support policy tools for using diesel and electricity in agriculture are being pursued by the Turkish government

  15. One-sided time constraints routing problem in supply chain management- An Ant colony optimization based heuristic

    OpenAIRE

    Tiwari, Dr. Sandeep Kumar; Acharya, Sopnamayee

    2013-01-01

    Transportation costs constitute a significant fraction of total logistics cost in Supply Chain Management (SCM). To reduce transportation costs, improve customer service and to achieve maximum customer satisfaction, the optimal selection of the vehicle route is a frequent decision problem and this is commonly known as vehicle routing problem. Vehicle routing problem with one-sided time constraint, where the delivery of products from depots to distribution centers has to take place within the ...

  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. R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mingchuan Zhang

    2016-01-01

    Full Text Available Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs, especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

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

  19. Real-Time Global Flood Estimation Using Satellite-Based Precipitation and a Coupled Land Surface and Routing Model

    Science.gov (United States)

    Wu, Huan; Adler, Robert F.; Tian, Yudong; Huffman, George J.; Li, Hongyi; Wang, JianJian

    2014-01-01

    A widely used land surface model, the Variable Infiltration Capacity (VIC) model, is coupled with a newly developed hierarchical dominant river tracing-based runoff-routing model to form the Dominant river tracing-Routing Integrated with VIC Environment (DRIVE) model, which serves as the new core of the real-time Global Flood Monitoring System (GFMS). The GFMS uses real-time satellite-based precipitation to derive flood monitoring parameters for the latitude band 50 deg. N - 50 deg. S at relatively high spatial (approximately 12 km) and temporal (3 hourly) resolution. Examples of model results for recent flood events are computed using the real-time GFMS (http://flood.umd.edu). To evaluate the accuracy of the new GFMS, the DRIVE model is run retrospectively for 15 years using both research-quality and real-time satellite precipitation products. Evaluation results are slightly better for the research-quality input and significantly better for longer duration events (3 day events versus 1 day events). Basins with fewer dams tend to provide lower false alarm ratios. For events longer than three days in areas with few dams, the probability of detection is approximately 0.9 and the false alarm ratio is approximately 0.6. In general, these statistical results are better than those of the previous system. Streamflow was evaluated at 1121 river gauges across the quasi-global domain. Validation using real-time precipitation across the tropics (30 deg. S - 30 deg. N) gives positive daily Nash-Sutcliffe Coefficients for 107 out of 375 (28%) stations with a mean of 0.19 and 51% of the same gauges at monthly scale with a mean of 0.33. There were poorer results in higher latitudes, probably due to larger errors in the satellite precipitation input.

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

  1. Delivery route, MyD88 signaling and cross-priming events determine the anti-tumor efficacy of an adenovirus based melanoma vaccine.

    NARCIS (Netherlands)

    Hangalapura, B.N.; Oosterhoff, D.; Gupta, T.; Groot, J. de; Wijnands, P.G.J.T.B.; Beusechem, V.W. van; Haan, J.; Tuting, T.; Eertwegh, A.J. van den; Curiel, D.T.; Scheper, R.J.; Gruijl, T.D. de

    2011-01-01

    Adenovirus (Ad)-based vaccines are considered for cancer immunotherapy, yet, detailed knowledge on their mechanism of action and optimal delivery route for anti-tumor efficacy is lacking. Here, we compared the anti-tumor efficacy of an Ad-based melanoma vaccine after intradermal, intravenous,

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

  3. An unusual route to develop poly(lactic acid) based materials with deformation-recovery properties

    Science.gov (United States)

    Rathi, Sahas; Ng, David; Coughlin, E. Bryan; Hsu, Shaw; Golub, Charles; Ling, Gerald; Tzivanis, Mike

    2013-03-01

    A novel method based on co-crystallizing polymer blends was developed to obtain Poly(lactic acid) (PLA) based materials with deformation recovery properties. Two sets of blends were studied. One based on the PDLA-soft polymer-PDLA triblock copolymer and PLLA, where D and L refer to the two chiral isomers of PLA, while the other was based on homopolymer blends of PDLA/soft polymer/PLLA having identical chemical composition. The mechanical properties and morphological features of the two sets of blends were completely different. The triblock copolymer/ PLLA blends gave rise to flexible, tough semicrystalline materials while the corresponding homopolymer blends exhibited very low strains at break and high dissipative/dampening properties. The drastically different stereocomplex crystallization kinetics in the two sets of blends led to interspherulitic segregation of the amorphous chains in the triblock blends while intraspherulitic segregation occurred in the homopolymer blends. The presence of significant connectivity between the stereocomplex crystallites formed, in the triblock copolymer/ PLLA blends, was important for the deformation shape recovery characteristics observed. In addition, it was found that the use of ether-ester based plasticizers significantly reduced the glass transition temperature and enhanced the recovery property of the triblock copolymer based PLA blends.

  4. A communication model based on n-dimensional Torus Architecture using dead-lock-free wormhole routing

    NARCIS (Netherlands)

    Holzenspies, P.K.F.; Schepers, Erik; Bach, Wouter; Jonker, Mischa; Sikkes, Bart; Smit, Gerardus Johannes Maria; Havinga, Paul J.M.

    2003-01-01

    Routing on a two-dimensional torus architecture by means of the wormhole routing algorithm is introduced and extended to an n-dimensional torus model. To prevent blocking deadlocks caused by this algorithm, a multiple virtual channel solution is introduced. An implementation of virtual channels is

  5. The productive techniques and constitutive effects of 'evidence-based policy' and 'consumer participation' discourses in health policy processes.

    Science.gov (United States)

    Lancaster, K; Seear, K; Treloar, C; Ritter, A

    2017-03-01

    For over twenty years there have been calls for greater 'consumer' participation in health decision-making. While it is recognised by governments and other stakeholders that 'consumer' participation is desirable, barriers to meaningful involvement nonetheless remain. It has been suggested that the reifying of 'evidence-based policy' may be limiting opportunities for participation, through the way this discourse legitimates particular voices to the exclusion of others. Others have suggested that assumptions underpinning the very notion of the 'affected community' or 'consumers' as fixed and bounded 'policy publics' need to be problematised. In this paper, drawing on interviews (n = 41) with individuals closely involved in Australian drug policy discussions, we critically interrogate the productive techniques and constitutive effects of 'evidence-based policy' and 'consumer participation' discourses in the context of drug policy processes. To inform our analysis, we draw on and combine a number of critical perspectives including Foucault's concept of subjugated knowledges, the work of feminist theorists, as well as recent work regarding conceptualisations of emergent policy publics. First, we explore how the subject position of 'consumer' might be seen as enacted in the material-discursive practices of 'evidence-based policy' and 'consumer participation' in drug policy processes. Secondly, we consider the centralising power-effects of the dominant 'evidence-based policy' paradigm, and how resistance may be thought about in this context. We suggest that such interrogation has potential to recast the call for 'consumer' participation in health policy decision-making and drug policy processes. Copyright © 2017 Elsevier Ltd. All rights reserved.

  6. To what extent are Canadian second language policies evidence-based? Reflections on the intersections of research and policy.

    Science.gov (United States)

    Cummins, Jim

    2014-01-01

    THE PAPER ADDRESSES THE INTERSECTIONS BETWEEN RESEARCH FINDINGS AND CANADIAN EDUCATIONAL POLICIES FOCUSING ON FOUR MAJOR AREAS: (a) core and immersion programs for the teaching of French to Anglophone students, (b) policies concerning the learning of English and French by students from immigrant backgrounds, (c) heritage language teaching, and (d) the education of Deaf and hard-of hearing students. With respect to the teaching of French, policy-makers have largely ignored the fact that most core French programs produce meager results for the vast majority of students. Only a small proportion of students (languages, preferring instead to leave uncorrected the proposition that acquisition of languages such as American Sign Language by young children (with or without cochlear implants) will impede children's language and academic development. The paper reviews the kinds of policies, programs, and practices that could be implemented (at no additional cost) if policy-makers and educators pursued evidence-based educational policies.

  7. To what extent are Canadian second language policies evidence-based? Reflections on the intersections of research and policy

    Science.gov (United States)

    Cummins, Jim

    2014-01-01

    The paper addresses the intersections between research findings and Canadian educational policies focusing on four major areas: (a) core and immersion programs for the teaching of French to Anglophone students, (b) policies concerning the learning of English and French by students from immigrant backgrounds, (c) heritage language teaching, and (d) the education of Deaf and hard-of hearing students. With respect to the teaching of French, policy-makers have largely ignored the fact that most core French programs produce meager results for the vast majority of students. Only a small proportion of students (languages, preferring instead to leave uncorrected the proposition that acquisition of languages such as American Sign Language by young children (with or without cochlear implants) will impede children’s language and academic development. The paper reviews the kinds of policies, programs, and practices that could be implemented (at no additional cost) if policy-makers and educators pursued evidence-based educational policies. PMID:24847289

  8. Valorization of Humin-Based Byproducts from Biomass Processing - A Route to Sustainable Hydrogen

    NARCIS (Netherlands)

    Hoang, Thi Minh Chau; Lefferts, Leonardus; Seshan, Kulathuiyer

    2013-01-01

    The synthesis of biomass-based top value-added chemical platforms, for example, 5-hydroxymethyl furfural, furfural, or levulinic acid from the acid-catalyzed dehydration of sugars results in high yields of insoluble by-products, referred to as humin. Valorization of humin by steam reforming for H2

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

    DEFF Research Database (Denmark)

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

    2017-01-01

    -based LoCs, in which a continuous flow of liquid is manipulated using integrated microvalves. By combining several microvalves, more complex units, such as micropumps, switches, mixers and multiplexers, can be built. We consider that the architecture of the LoC is given, and we are interested...

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

  11. Effective synthesis route for red-brown pigments based on Ce – Pr ...

    Indian Academy of Sciences (India)

    New cerium-based ceramic pigments, displaying Ce2Pr0.2FexO4.3+y stoichiometry, were obtained .... Obtained gel was centrifuged (5000 rpm, 10 min) and washed thrice with milli-Q H2O and finally with ethanol. The material free of unreacted impurities was air dried at ..... neral turpentine, isopropyl alcohol, methanol and.

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

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

    Directory of Open Access Journals (Sweden)

    Wen-Chen Hu

    2014-12-01

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

  14. Providing Climate Policy Makers With a Strong Scientific Base (Invited)

    Science.gov (United States)

    Struzik, E.

    2009-12-01

    Scientists can and should inform public policy decisions in the Arctic. But the pace of climate change in the polar world has been occurring far more quickly than most scientists have been able to predict. This creates problems for decision-makers who recognize that difficult management decisions have to be made in matters pertaining to wildlife management, cultural integrity and economic development. With sea ice melting, glaciers receding, permafrost thawing, forest fires intensifying, and disease and invasive species rapidly moving north, the challenge for scientists to provide climate policy makers with a strong scientific base has been daunting. Clashing as this data sometimes does with the “traditional knowledge” of indigenous peoples in the north, it can also become very political. As a result the need to effectively communicate complex data is more imperative now than ever before. Here, the author describes how the work of scientists can often be misinterpreted or exploited in ways that were not intended. Examples include the inappropriate use of scientific data in decision-making on polar bears, caribou and other wildlife populations; the use of scientific data to debunk the fact that greenhouse gases are driving climate change, and the use of scientific data to position one scientist against another when there is no inherent conflict. This work will highlight the need for climate policy makers to increase support for scientists working in the Arctic, as well as illustrate why it is important to find new and more effective ways of communicating scientific data. Strategies that might be considered by granting agencies, scientists and climate policy decision-makers will also be discussed.

  15. The viability of developing the Northern Sea Route for international shipping : understanding Russian Arctic policies in Arctic security and resource management

    OpenAIRE

    Son, Huijeong

    2017-01-01

    Challenges and opportunities are continuing to emerge in the Arctic Region. As the Arctic sea ice is decreasing due to climate change, exploration and development in the region has become more accessible. This phenomenon has also opened up the Arctic shipping lanes. Russia, a member state of the Arctic Council (AC), has the longest of the Arctic coastlines. Historically, Russia has exclusively controlled the Northern Sea Route (NSR). In utilizing the NSR for shipping and developing the Arctic...

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

    Science.gov (United States)

    2015-08-13

    two years in the domain of Software-defined Networks ( SDN ). We developed a declarative platform for implementing SDN protocols using declarative...synthesizing SDN protocols from example scenarios. Declarative network verification. Networks are complex systems that unfortunately are ridden with errors...and debugging several SDN applications. Example-based SDN synthesis. Recent emergence of software-defined networks offers an opportunity to design

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

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

  19. Constitutionally-Legal Policy as Base Type of Legal Policy of Russia

    Science.gov (United States)

    Anichkin, Eugene S.

    2016-01-01

    The article deals with reasons for formation, nature and specifics of the constitutionally legal policy of modern Russia. The special attention is spared to the exposure of the aim, long-term and short-term tasks, and principles of national constitutionally legal policy. The functions of constitutionally legal policy are separately considered:…

  20. Black Box Traceable Ciphertext Policy Attribute-Based Encryption Scheme

    Directory of Open Access Journals (Sweden)

    Xingbing Fu

    2015-08-01

    Full Text Available In the existing attribute-based encryption (ABE scheme, the authority (i.e., private key generator (PKG is able to calculate and issue any user’s private key, which makes it completely trusted, which severely influences the applications of the ABE scheme. To mitigate this problem, we propose the black box traceable ciphertext policy attribute-based encryption (T-CP-ABE scheme in which if the PKG re-distributes the users’ private keys for malicious uses, it might be caught and sued. We provide a construction to realize the T-CP-ABE scheme in a black box model. Our scheme is based on the decisional bilinear Diffie-Hellman (DBDH assumption in the standard model. In our scheme, we employ a pair (ID, S to identify a user, where ID denotes the identity of a user and S denotes the attribute set associated with her.

  1. Area-based initiatives - Engines of planning and policy innovation?

    DEFF Research Database (Denmark)

    Agger, Annika; Norvig Larsen, Jacob

    a broader perspective on the achievements and outcomes of place-based initiatives. Many of these have functioned as important experimental seedbeds in which innovations in urban policy and organization of public decision-making have been tested. The papers seeks to clarify whether, in the long run, change......Area-based initiatives addressing issues of physical degradation, social exclusion, economic deprivation and lack of cohesion in urban regeneration areas have been promoted widely across Europe in the past two or three decades. Following this many evaluation studies have been completed....... Nevertheless, there is still considerable uncertainty as to the most important outcomes of place-based initiatives. Evaluations have mostly focussed on direct quantitative socio-economic indicators. These have often been quite insignificant, while other effects have been largely neglected. This paper proposes...

  2. In vivo vascular flow profiling combined with optical tweezers based blood routing

    Science.gov (United States)

    Meissner, Robert; Sugden, Wade W.; Siekmann, Arndt F.; Denz, Cornelia

    2017-07-01

    In vivo wall shear rate is quantified during zebrafish development using particle image velocimetry for biomedical diagnosis and modeling of artificial vessels. By using brightfield microscopy based high speed video tracking we can resolve single heart-beat cycles of blood flow in both space and time. Maximum blood flow velocities and wall shear rates are presented for zebrafish at two and three days post fertilization. By applying biocompatible optical tweezers as an Optical rail we present rerouting of red blood cells in vivo. With purely light-driven means we are able to compensate the lack of proper red blood cell blood flow in so far unperfused capillaries.

  3. Valorization of humin-based byproducts from biomass processing-a route to sustainable hydrogen.

    Science.gov (United States)

    Hoang, Thi Minh Chau; Lefferts, Leon; Seshan, K

    2013-09-01

    The synthesis of biomass-based top value-added chemical platforms, for example, 5-hydroxymethyl furfural, furfural, or levulinic acid from the acid-catalyzed dehydration of sugars results in high yields of insoluble by-products, referred to as humin. Valorization of humin by steam reforming for H2 is discussed. Both thermal and catalytic steam gasification were investigated systematically. Humin undergoes drastic changes under thermal pre-treatment to the gasification temperature. Alkali-metal-based catalysts were screened for the reactions. Na2 CO3 showed the highest activity and was selected for further study. The presence of Na2 CO3 enhances the gasification rate drastically, and gas-product analysis shows that the selectivity to CO and CO2 is 75% and 25%, respectively, which is a H2 /CO ratio of 2 (corresponding to 81.3% H2 as compared to the thermodynamic equilibrium). A possible process for the complete, efficient conversion of humin is outlined. Copyright © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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

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

  6. An Efficient Data Collection Protocol Based on Multihop Routing and Single-Node Cooperation in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Guoqiang Zheng

    2014-01-01

    Full Text Available Considering the constrained resource and energy in wireless sensor networks, an efficient data collection protocol named ESCDD which adopts the multihop routing technology and the single-node selection cooperative communication is proposed to make the communication protocol more simple and easy to realize for the large-scale multihop wireless sensor networks. ESCDD uses the greedy strategy and the control information based on RTS/CTS to select forwarding nodes. Then, the hops in the multihop data transmission are reduced. Based on the power control in physical layer and the control frame called CoTS in MAC layer, ESCDD chooses a single cooperative node to perform cooperative transmission. The receiving node adopts maximal ratio combining (MRC to recover original data. The energy consumption per hop is reduced. Furthermore, the total energy consumption in data collection process is shared by more nodes and the network lifetime is extended. Compared with GeRaF, EERNFS, and REEFG protocol, the simulation results show that ESCDD can effectively reduce the average delay of multihop data transmission, improve the successful delivery rate of data packets, significantly save the energy consumption of network nodes, and make the energy consumption more balanced.

  7. Conducting Polymer-Based Nanohybrid Transducers: A Potential Route to High Sensitivity and Selectivity Sensors

    Directory of Open Access Journals (Sweden)

    Seon Joo Park

    2014-02-01

    Full Text Available The development of novel sensing materials provides good opportunities to realize previously unachievable sensor performance. In this review, conducting polymer-based nanohybrids are highlighted as innovative transducers for high-performance chemical and biological sensing devices. Synthetic strategies of the nanohybrids are categorized into four groups: (1 impregnation, followed by reduction; (2 concurrent redox reactions; (3 electrochemical deposition; (4 seeding approach. Nanocale hybridization of conducting polymers with inorganic components can lead to improved sorption, catalytic reaction and/or transport behavior of the material systems. The nanohybrids have thus been used to detect nerve agents, toxic gases, volatile organic compounds, glucose, dopamine, and DNA. Given further advances in nanohybrids synthesis, it is expected that sensor technology will also evolve, especially in terms of sensitivity and selectivity.

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

  9. Nanoscaled tin dioxide films processed from organotin-based hybrid materials: an organometallic route toward metal oxide gas sensors

    Science.gov (United States)

    Renard, Laetitia; Babot, Odile; Saadaoui, Hassan; Fuess, Hartmut; Brötz, Joachim; Gurlo, Aleksander; Arveux, Emmanuel; Klein, Andreas; Toupance, Thierry

    2012-10-01

    Nanocrystalline tin dioxide (SnO2) ultra-thin films were obtained employing a straightforward solution-based route that involves the calcination of bridged polystannoxane films processed by the sol-gel process from bis(triprop-1-ynylstannyl)alkylene and -arylene precursors. These films have been thoroughly characterized by FTIR, contact angle measurements, X-ray diffraction (XRD), X-ray photoelectron spectroscopy (XPS), atomic force (AFM) and scanning electron (SEM) microscopies. Annealing at a high temperature gave 30-35 nm thick cassiterite SnO2 films with a mean crystallite size ranging from 4 to 7 nm depending on the nature of the organic linker in the distannylated compound used as a precursor. In the presence of H2 and CO gases, these layers led to highly sensitive, reversible and reproducible responses. The sensing properties were discussed in regard to the crystallinity and porosity of the sensing body that can be tuned by the nature of the precursor employed. Organometallic chemistry combined with the sol-gel process therefore offers new possibilities toward metal oxide nanostructures for the reproducible and sensitive detection of combustible and toxic gases.Nanocrystalline tin dioxide (SnO2) ultra-thin films were obtained employing a straightforward solution-based route that involves the calcination of bridged polystannoxane films processed by the sol-gel process from bis(triprop-1-ynylstannyl)alkylene and -arylene precursors. These films have been thoroughly characterized by FTIR, contact angle measurements, X-ray diffraction (XRD), X-ray photoelectron spectroscopy (XPS), atomic force (AFM) and scanning electron (SEM) microscopies. Annealing at a high temperature gave 30-35 nm thick cassiterite SnO2 films with a mean crystallite size ranging from 4 to 7 nm depending on the nature of the organic linker in the distannylated compound used as a precursor. In the presence of H2 and CO gases, these layers led to highly sensitive, reversible and reproducible

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

  11. Inventory routing for dynamic waste collection

    NARCIS (Netherlands)

    Mes, Martijn R.K.; Schutten, Johannes M.J.; Perez Rivera, Arturo Eduardo

    2014-01-01

    We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense

  12. Highly Scalable, UDP-Based Network Transport Protocols for Lambda Grids and 10 GE Routed Networks

    Energy Technology Data Exchange (ETDEWEB)

    PI: Robert Grossman Co-PI: Stephen Eick

    2009-08-04

    Summary of Report In work prior to this grant, NCDM developed a high performance data transport protocol called SABUL. During this grant, we refined SABUL’s functionality, and then extended both the capabilities and functionality and incorporated them into a new protocol called UDP-based Data transport Protocol, or UDT. We also began preliminary work on Composable UDT, a version of UDT that allows the user to choose among different congestion control algorithms and implement the algorithm of his choice at the time he compiles the code. Specifically, we: · Investigated the theoretical foundations of protocols similar to SABUL and UDT. · Performed design and development work of UDT, a protocol that uses UDP in both the data and control channels. · Began design and development work of Composable UDT, a protocol that supports the use of different congestion control algorithms by simply including the appropriate library when compiling the code. · Performed experimental studies using UDT and Composable UDT using real world applications such as the Sloan Digital Sky Survey (SDSS) astronomical data sets. · Released several versions of UDT and Composable, the most recent being v3.1.

  13. WDM cross-connect cascade based on all-optical wavelength converters for routing and wavelength slot interchanging using a reduced number of internal wavelengths

    DEFF Research Database (Denmark)

    Pedersen, Rune Johan Skullerud; Mikkelsen, Benny; Jørgensen, Bo Foged

    1998-01-01

    Optical transport layers need rearrangeable wavelength-division multiplexing optical cross-connects (OXCs) to increase the capacity and flexibility of the network. It has previously been shown that a cross-connect based on all-optical wavelength converters for routing as well as wavelength slot...

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

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

    The Vehicle Routing Problem with Time Windows (VRPTW) consist of determining a set of feasible vehicle routes to deliver goods to a set of customers using a hierarchical objective; first minimising the number of vehicles used and, second, the total driving distance. A three-stage method is proposed...... for the VRPTW. The first stage aims at minimising the number of vehicle used, whereas the second and third phase aims at minimising the travel distance. The first stage maintains an ejection pool with temporarily unserved customers, and tries to insert these customer into the existing solution. If a new...... candidate solution for the minimum number of vehicles is found, a route is removed and the customers from the route is placed in the ejection pool. If the heuristic terminates without finding a new candidate solution where all customers are served, the first stage returns the last found candidate solution...

  16. Plant-based vaccines: novel and low-cost possible route for Mediterranean innovative vaccination strategies.

    Science.gov (United States)

    Aboul-Ata, Aboul-Ata E; Vitti, Antonella; Nuzzaci, Maria; El-Attar, Ahmad K; Piazzolla, Giuseppina; Tortorella, Cosimo; Harandi, Ali M; Olson, Olof; Wright, Sandra A; Piazzolla, Pasquale

    2014-01-01

    A plant bioreactor has enormous capability as a system that supports many biological activities, that is, production of plant bodies, virus-like particles (VLPs), and vaccines. Foreign gene expression is an efficient mechanism for getting protein vaccines against different human viral and nonviral diseases. Plants make it easy to deal with safe, inexpensive, and provide trouble-free storage. The broad spectrum of safe gene promoters is being used to avoid risk assessments. Engineered virus-based vectors have no side effect. The process can be manipulated as follows: (a) retrieve and select gene encoding, use an antigenic protein from GenBank and/or from a viral-genome sequence, (b) design and construct hybrid-virus vectors (viral vector with a gene of interest) eventually flanked by plant-specific genetic regulatory elements for constitutive expression for obtaining chimeric virus, (c) gene transformation and/or transfection, for transient expression, into a plant-host model, that is, tobacco, to get protocols processed positively, and then moving into edible host plants, (d) confirmation of protein expression by bioassay, PCR-associated tests (RT-PCR), Northern and Western blotting analysis, and serological assay (ELISA), (e) expression for adjuvant recombinant protein seeking better antigenicity, (f) extraction and purification of expressed protein for identification and dosing, (g) antigenicity capability evaluated using parental or oral delivery in animal models (mice and/or rabbit immunization), and (h) growing of construct-treated edible crops in protective green houses. Some successful cases of heterologous gene-expressed protein, as edible vaccine, are being discussed, that is, hepatitis C virus (HCV). R9 mimotope, also named hypervariable region 1 (HVR1), was derived from the HVR1 of HCV. It was used as a potential neutralizing epitope of HCV. The mimotope was expressed using cucumber mosaic virus coat protein (CP), alfalfa mosaic virus CP P3/RNA3, and

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

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

  19. CRT--Cascade Routing Tool to define and visualize flow paths for grid-based watershed models

    Science.gov (United States)

    Henson, Wesley R.; Medina, Rose L.; Mayers, C. Justin; Niswonger, Richard G.; Regan, R.S.

    2013-01-01

    The U.S. Geological Survey Cascade Routing Tool (CRT) is a computer application for watershed models that include the coupled Groundwater and Surface-water FLOW model, GSFLOW, and the Precipitation-Runoff Modeling System (PRMS). CRT generates output to define cascading surface and shallow subsurface flow paths for grid-based model domains. CRT requires a land-surface elevation for each hydrologic response unit (HRU) of the model grid; these elevations can be derived from a Digital Elevation Model raster data set of the area containing the model domain. Additionally, a list is required of the HRUs containing streams, swales, lakes, and other cascade termination features along with indices that uniquely define these features. Cascade flow paths are determined from the altitudes of each HRU. Cascade paths can cross any of the four faces of an HRU to a stream or to a lake within or adjacent to an HRU. Cascades can terminate at a stream, lake, or HRU that has been designated as a watershed outflow location.

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

  1. Empty Container Management in Cyclic Shipping Routes

    OpenAIRE

    Dong-Ping Song; Jing-Xin Dong

    2008-01-01

    This paper considers the empty container management problem in a cyclic shipping route. The objective is to seek the optimal empty container repositioning policy in a dynamic and stochastic situation by minimising the expected total costs consisting of inventory holding costs, demand lost-sale costs, lifting-on and lifting-off charges, and container transportation costs. A three-phase threshold control policy is developed to reposition empty containers in cyclic routes. The threshold values a...

  2. Monitoring transmission routes of Listeria spp. in smoked salmon production with repetitive element sequence-based PCR techniques.

    Science.gov (United States)

    Zunabovic, M; Domig, K J; Pichler, I; Kneifel, W

    2012-03-01

    Various techniques have been used for tracing the transmission routes of Listeria species and for the assessment of hygiene standards in food processing plants. The potential of repetitive element sequence-based PCR (Rep-PCR) methods (GTG₅ and REPI + II) for the typing of Listeria isolates (n = 116), including Listeria monocytogenes (n = 46), was evaluated in a particular situation arising from the relocation of a company producing cold-smoked salmon. Pulsed-field gel electrophoresis (PFGE) using three restriction enzymes (ApaI, AscI, and SmaI) was used for comparison. Identical transmission scenarios among two companies could be identified by cluster analysis of L. monocytogenes isolates that were indistinguishable by both Rep-PCR and PFGE. The calculated diversity index (DI) indicates that Rep-PCR subtyping of Listeria species with primer sets GTG₅ and REPI + II has a lower discrimination power than does PFGE. When concatenated Rep-PCR cluster analysis was used, the DI increased from 0.934 (REPI + II) and 0.923 (GTG₅) to 0.956. The discrimination power of this method was similar to that of PFGE typing based on restriction enzyme Apa I (DI = 0.955). Listeria welshimeri may be useful as an indicator for monitoring smoked salmon processing environments. Rep-PCR meets the expectations of a reasonable, fast, and low-cost molecular subtyping method for the routine monitoring of Listeria species. The discriminatory power as characterized by the DI sufficiently quantifies the probability of unrelated isolates being characterized as different subtypes. Therefore, Rep-PCR typing based on two primer systems (GTG₅ and REPI + II) may be a useful tool for monitoring industrial hygiene.

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

  4. The Evolution of Policy Enactment on Gender-Based Violence in Schools

    Science.gov (United States)

    Parkes, Jenny

    2016-01-01

    This article examines how policies and strategies to address school-related gender-based violence have evolved since 2000, when gender-based violence within education was largely invisible. Through an exploration of policy enactment in three countries--Liberia, South Africa, and Brazil--it traces remarkable progress in policy, programmes, and…

  5. The institutional economics of market-based climate policy

    International Nuclear Information System (INIS)

    Woerdman, E.

    2005-01-01

    The objective of this book is to analyze the institutional barriers to implementing market-based climate policy, as well as to provide some opportunities to overcome them. The approach is that of institutional economics, with special emphasis on political transaction costs and path dependence. Instead of rejecting the neoclassical approach, this book uses it where fruitful and shows when and why it is necessary to employ a new or neo-institutionalist approach. The result is that equity is considered next to efficiency, that the evolution and possible lock-in of both formal and informal climate institutions are studied, and that attention is paid to the politics and law of economic instruments for climate policy, including some new empirical analyses. The research topics of this book include the set-up costs of a permit trading system, the risk that credit trading becomes locked-in, the potential legal problem of grandfathering in terms of actional subsidies under WTO law or state aid under EC law, and the changing attitudes of various European officials towards restricting the use of the Kyoto Mechanisms

  6. Econometric Model of Rice Policy Based On Presidential Instruction

    Science.gov (United States)

    Abadi Sembiring, Surya; Hutauruk, Julia

    2018-01-01

    The objective of research is to build an econometric model based on Presidential Instruction rice policy. The data was monthly time series from March 2005 to September 2009. Rice policy model specification using simultaneous equation, consisting of 14 structural equations and four identity equation, which was estimated using Two Stages Least Squares (2SLS) method. The results show that: (1) an increase of government purchasing price of dried harvest paddy has a positive impact on to increase in total rice production and community rice stock, (2) an increase community rice stock lead to decrease the rice imports, (3) an increase of the realization of the distribution of subsidized ZA fertilizers and the realization of the distribution of subsidized NPK fertilizers has a positive impact on to increase in total rice production and community rice stock and to reduce rice imports, (4) the price of the dried harvest paddy is highly responsive to the water content of dried harvest paddy both the short run and long run, (5) the quantity of rice imported is highly responsive to the imported rice price, both short run and long run.

  7. Combining Correlation-Based and Reward-Based Learning in Neural Control for Policy Improvement

    DEFF Research Database (Denmark)

    Manoonpong, Poramate; Kolodziejski, Christoph; Wörgötter, Florentin

    2013-01-01

    associations. Based on these biological findings, we propose a new learning model to achieve successful control policies for artificial systems. This model combines correlation-based learning using input correlation learning (ICO learning) and reward-based learning using continuous actor–critic reinforcement...... learning (RL), thereby working as a dual learner system. The model performance is evaluated by simulations of a cart-pole system as a dynamic motion control problem and a mobile robot system as a goal-directed behavior control problem. Results show that the model can strongly improve pole balancing control...... policy, i.e., it allows the controller to learn stabilizing the pole in the largest domain of initial conditions compared to the results obtained when using a single learning mechanism. This model can also find a successful control policy for goal-directed behavior, i.e., the robot can effectively learn...

  8. Snow route optimization.

    Science.gov (United States)

    2016-01-01

    Route optimization is a method of creating a set of winter highway treatment routes to meet a range of targets, including : service level improvements, resource reallocation and changes to overriding constraints. These routes will allow the : operato...

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

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

  11. Opportunity-based age replacement policy with minimal repair

    International Nuclear Information System (INIS)

    Jhang, J.P.; Sheu, S.H.

    1999-01-01

    This paper proposes an opportunity-based age replacement policy with minimal repair. The system has two types of failures. Type I failures (minor failures) are removed by minimal repairs, whereas type II failures are removed by replacements. Type I and type II failures are age-dependent. A system is replaced at type II failure (catastrophic failure) or at the opportunity after age T, whichever occurs first. The cost of the minimal repair of the system at age z depends on the random part C(z) and the deterministic part c(z). The opportunity arises according to a Poisson process, independent of failures of the component. The expected cost rate is obtained. The optimal T * which would minimize the cost rate is discussed. Various special cases are considered. Finally, a numerical example is given

  12. Policy-Based mobility Management for Heterogeneous Networks

    DEFF Research Database (Denmark)

    Mihovska, Albena D.

    2007-01-01

    Next generation communications will be composed of flexible, scalable and context-aware, secure and resilient architectures and technologies that allow full mobility of the user and enable dynamic management policies that ensure end-to-end secure transmission of data and services across...... heterogeneous infrastructures and networks. This paper investigates the policybased mobility management scheme proposed for the WINNER system. The scheme is based on previously developed cooperation radio resource management (RRM) algorithms including mobility management, for the successful interworking...... of WINNER with new and legacy systems. The paper describes the cooperation architecture and mobility management functionalities and the rules that are applied for the support of mobility within the above scenarios. The rules are applied to solve problems such as: who and what can access which resources...

  13. Designing and implementing science-based methane policies

    Science.gov (United States)

    George, F.

    2017-12-01

    The phenomenal growth in shale gas production across the U.S. has significantly improved the energy security and economic prospects of the country. Natural gas is a "versatile" fuel that has application in every major end-use sector of the economy, both as a fuel and a feedstock. Natural gas has also played a significant role in reducing CO2 emissions from the power sector by displacing more carbon intensive fossil fuels. However, emissions of natural gas (predominantly methane) from the wellhead to the burner tip can erode this environmental benefit. Preserving the many benefits of America's natural gas resources requires smart, science-based policies to optimize the energy delivery efficiency of the natural gas supply chain and ensure that natural gas remains a key pillar in our transition to a low-carbon economy. Southwestern Energy (SWN) is the third largest natural gas producer in the United States. Over the last several years, SWN has participated in a number of scientific studies with regulatory agencies, academia and non-governmental entities that have led to over a dozen peer-reviewed papers on methane emissions from oil and gas operations. This presentation will review how our participation in these studies has informed our internal policies and procedures, as well as our external programs, including the ONE Future coalition (ONE Future). In particular, the presentation will highlight the impact of such studies on our Leak Detection and Repair (LDAR) program, designing new methane research and on the ONE Future initiatives - all with the focus of improving the delivery efficiency of oil and gas operations. Our experience supports continued research in the detection and mitigation of methane emissions, with emphasis on longer duration characterization of methane emissions from oil and gas facilities and further development of cost-effective methane detection and mitigation techniques. We conclude from our scientific and operational experiences that a

  14. A Study on the Optimization of Chain Supermarkets’ Distribution Route Based on the Quantum-Inspired Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Bi Liang

    2017-01-01

    Full Text Available The chain supermarket has become a major part of China’s retail industry, and the optimization of chain supermarkets’ distribution route is an important issue that needs to be considered for the distribution center, because for a chain supermarket it affects the logistics cost and the competition in the market directly. In this paper, analyzing the current distribution situation of chain supermarkets both at home and abroad and studying the quantum-inspired evolutionary algorithm (QEA, we set up the mathematical model of chain supermarkets’ distribution route and solve the optimized distribution route throughout QEA. At last, we take Hongqi Chain Supermarket in Chengdu as an example to perform the experiment and compare QEA with the genetic algorithm (GA in the fields of the convergence, the optimal solution, the search ability, and so on. The experiment results show that the distribution route optimized by QEA behaves better than that by GA, and QEA has stronger global search ability for both a small-scale chain supermarket and a large-scale chain supermarket. Moreover, the success rate of QEA in searching routes is higher than that of GA.

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

    2014-01-01

    Background 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. Methods 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. Results 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. Conclusions 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. PMID:24913256

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

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

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

    Directory of Open Access Journals (Sweden)

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

    2008-01-01

    Full Text Available 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: Na2SiO3, 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 °C as measured by thermogravimetric/differential thermal analysis (TGA-DTA. The optimal sol-gel parameters were found to be a molar ratio of Na2SiO3:H2O : 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° with water.

  19. Mini-grid based off-grid electrification to enhance electricity access in developing countries: What policies may be required?

    International Nuclear Information System (INIS)

    Bhattacharyya, Subhes C.; Palit, Debajit

    2016-01-01

    With 1.2 billion people still lacking electricity access by 2013, electricity access remains a major global challenge. Although mini-grid based electrification has received attention in recent times, their full exploitation requires policy support covering a range of areas. Distilling the experience from a five year research project, OASYS South Asia, this paper presents the summary of research findings and shares the experience from four demonstration activities. It suggests that cost-effective universal electricity service remains a challenge and reaching the universal electrification target by 2030 will remain a challenge for the less developed countries. The financial, organisational and governance weaknesses hinder successful implementation of projects in many countries. The paper then provides 10 policy recommendations to promote mini-grids as a complementary route to grid extension to promote electricity access for successful outcomes. - Highlights: •The academic and action research activities undertaken through OASYS South Asia Project are reported. •Evidence produced through a multi-dimensional participatory framework supplemented by four demonstration projects. •Funding and regulatory challenges militate against universal electrification objectives by 2030. •Innovative business approaches linking local mini-grids and livelihood opportunities exist. •Enabling policies are suggested to exploit such options.

  20. Model-based inflation forecasts and monetary policy rules

    OpenAIRE

    Wouters, Raf; Dombrecht, Michel

    2000-01-01

    In this paper, the interaction between inflation and monetary policy rules is analysed within the framework of a dynamic general equilibrium model derived from optimising behaviour and rational expectations. Using model simulations, it is illustrated that the control of monetary policy over the inflation process is strongly dependent on the role of forward looking expectations in the price and wage setting process and on the credibility of monetary policy in the expectation formation process ...

  1. Evidence based educational policy and practice: the case of applying the educational effectiveness knowledge base

    NARCIS (Netherlands)

    Scheerens, Jaap

    2014-01-01

    Evidence based educational policy and practice means, first of all, that new programs use relevant scientific knowledge for design purposes, or for critical review of initial program ideas (ex ante evaluation). Secondly, before programs are implemented on a large scale it is considered desirable to

  2. To What Extent Are Canadian Second Language Policies Evidence-Based? Reflections on the Intersections of Research and Policy

    Directory of Open Access Journals (Sweden)

    Jim eCummins

    2014-05-01

    Full Text Available The paper addresses the intersections between research, ideology, and Canadian educational policies focusing on four major areas: (a core and immersion programs for the teaching of French to Anglophone students, (b policies concerning the learning of English and French by students from immigrant backgrounds, (c heritage language teaching, and (d the education of Deaf and hard-of hearing students. With respect to the teaching of French, policy-makers have largely ignored the fact that most core French programs produce meager results for the vast majority of students. Only a small proportion of students (< 10% attend more effective alternatives (e.g. French immersion and Intensive French programs. With respect to immigrant-background students, a large majority of teachers and administrators have not had opportunities to access the knowledge base regarding effective instruction for these students nor have they had opportunities for pre-service or in-service professional development regarding effective instructional practices. Educational policies have also treated the linguistic resources that children bring to school with, at best, benign neglect. In some cases (e.g., Ontario school systems have been explicitly prohibited from instituting enrichment bilingual programs that would promote students’ bilingualism and biliteracy. Finally, with respect to Deaf students, policy-makers have ignored overwhelming research on the positive relationship between academic success and the development of proficiency in natural sign languages, preferring instead to perpetuate the falsehood that acquisition of languages such as American Sign Language by young children (with or without cochlear implants will impede children’s language and academic development. The paper reviews the kinds of policies, programs, and practices that could be implemented (at no additional cost if policy-makers and educators pursued evidence-based educational policies.

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

  4. Optimization of Simple Monetary Policy Rules on the Base of Estimated DSGE-model

    OpenAIRE

    Shulgin, A.

    2015-01-01

    Optimization of coefficients in monetary policy rules is performed on the base of the DSGE-model with two independent monetary policy instruments estimated on the Russian data. It was found that welfare maximizing policy rules lead to inadequate result and pro-cyclical monetary policy. Optimal coefficients in Taylor rule and exchange rate rule allow to decrease volatility estimated on Russian data of 2001-2012 by about 20%. The degree of exchange rate flexibility parameter was found to be low...

  5. Agile: a problem-based model of regulatory policy making

    NARCIS (Netherlands)

    Boer, A.; van Engers, T.

    2013-01-01

    We understand regulatory policy problems against the backdrop of existing implementations of a regulatory framework. There are argument schemes for proposing a policy and for criticising a proposal, rooted in a shared understanding that there is an existing regulatory framework which is implemented

  6. Route optimization.

    Science.gov (United States)

    2016-11-01

    For winter maintenance purposes, the Ohio Department of Transportation (ODOT) deploys a fleet of : approximately 1,600 snow plow trucks that maintain 43,000 lane miles of roadway. These trucks are based out : of 200 garages, yards, and outposts that ...

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

  8. BASES OF PUBLIC POLICY FORMATION DIRECTED AT ENSURING BUDGET SECURITY

    Directory of Open Access Journals (Sweden)

    S. Onishchenko

    2015-03-01

    Full Text Available In the article the priorities and public policies that can improve the safety level of the budget of Ukraine have been grounded. Attention on the problems of imbalance and deficiency trends accumulation of public debt has been focused. The detailed analysis of the budget deficit of the European community to further research the main problems of fiscal security has been carried out. The formation of the concept of budget policy should include long-term and medium-term priorities of the state priorities areas have been concluded. Budget policy on public debt must deal with interrelated issues of debt bondage and effective use of public credit, promote economic growth with respect safe level and structure of public debt have been emphasized by author. Debt policy as part of fiscal policy under certain conditions can be a powerful tool to intensify investment and innovation processes in society, promote economic and social development. The reorientation of fiscal policy to address current problems through debt and use it as the basis of investment and innovation development provides an effective public debt management is designed to reduce state budget expenditures on its servicing and repayment, optimizing the scope and structure of debt according to economic growth. The role of debt policy in modern terms increases is clearly subordinate to and consistent with long-term goals and priorities of fiscal policy. There is an urgent development and implementation of effective mechanisms for investing borrowed resources, increasing the efficiency of public investment, including the improvement of organizational, financial, legal and controls. Strategically budget security guarantees only competitive economy, which can be constructed only by recovery and accelerated development of promising sectors of the national economy in the presence of a balanced budget policy. Now there is a tendency to implement only measures to stabilize the political and socio

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

  10. Proposal and Performance Evaluation of a Multicast Routing Protocol for Wireless Mesh Networks Based on Network Load

    Directory of Open Access Journals (Sweden)

    Kiyotaka Oe

    2015-01-01

    Full Text Available Wireless Mesh Networks (WMNs can provide wide range Wireless Local Area Networks (WLANs area by connecting Access Points (APs of WLANs with each other using radio communications. A routing protocol is very important to keep communication quality over radio multihop communications because radio waves are impacted much by surrounding environment. When we use multiuser shared applications like a video conference and an IP phone, it is predicted that large amount of traffic flows on network. Therefore, we should consider network loads to use these applications. In this paper, we propose a multicast routing protocol for WMNs which considers network loads and hop count. Furthermore, we evaluate performance by simulation. In the simulation results, we show that the proposed protocol has better performance than a conventional protocol (MAODV at high loaded scenario.

  11. Supporting Evidence-Based Policy on Biodiversity and Ecosystem Services: Recommendations for Effective Policy Briefs

    Science.gov (United States)

    Balian, Estelle V.; Drius, Liza; Eggermont, Hilde; Livoreil, Barbara; Vandewalle, Marie; Vandewoestjine, Sofie; Wittmer, Heidi; Young, Juliette

    2016-01-01

    Knowledge brokerage on biodiversity and ecosystem services can apply communication tools such as policy briefs to facilitate the dialogue between scientists and policymakers. There is currently considerable debate on how to go beyond the linear communication model, outdated in theoretical debate but still often implicitly leading interaction with…

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

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

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

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

  16. Critical Routes: Women Facing Violence

    Directory of Open Access Journals (Sweden)

    Stela Nazareth Meneghel

    2008-11-01

    Full Text Available This paper presents the Critical Routes International Seminar – Women Facing Violence , which took place in Porto Alegre in 2008. The seminar was promoted by the Graduate Program on Collective Health at Unisinos and by the Public Health School/RS and was supported by outstanding researchers working in the fields of collective health, and social and human sciences. Initially, we discuss some conceptual aspects about gender violence, its dimensions and its consequences for the health and the life quality of the affected women. Our understanding is that violence is one of the most effective methods of controlling women in societies scarred with gender hierarchies. The structure of the seminar focused on three main discussion themes: breaking up with the violence, mechanisms for working with gender and hearing the services. These themes were chosen aiming at looking for ways to help the women and to explore efficient mechanisms to combat, reduce and, if possible, eliminate the violence perpetrated against women. At the end of the seminar, we reiterate the political commitment on the accomplishment of the public policies to face violence and the fight against all inequality, discrimination and violence forms based on gender.

  17. Advancing team-based primary health care: a comparative analysis of policies in western Canada.

    Science.gov (United States)

    Suter, Esther; Mallinson, Sara; Misfeldt, Renee; Boakye, Omenaa; Nasmith, Louise; Wong, Sabrina T

    2017-07-17

    We analyzed and compared primary health care (PHC) policies in British Columbia, Alberta and Saskatchewan to understand how they inform the design and implementation of team-based primary health care service delivery. The goal was to develop policy imperatives that can advance team-based PHC in Canada. We conducted comparative case studies (n = 3). The policy analysis included: Context review: We reviewed relevant information (2007 to 2014) from databases and websites. Policy review and comparative analysis: We compared and contrasted publically available PHC policies. Key informant interviews: Key informants (n = 30) validated narratives prepared from the comparative analysis by offering contextual information on potential policy imperatives. Advisory group and roundtable: An expert advisory group guided this work and a key stakeholder roundtable event guided prioritization of policy imperatives. The concept of team-based PHC varies widely across and within the three provinces. We noted policy gaps related to team configuration, leadership, scope of practice, role clarity and financing of team-based care; few policies speak explicitly to monitoring and evaluation of team-based PHC. We prioritized four policy imperatives: (1) alignment of goals and policies at different system levels; (2) investment of resources for system change; (3) compensation models for all members of the team; and (4) accountability through collaborative practice metrics. Policies supporting team-based PHC have been slow to emerge, lacking a systematic and coordinated approach. Greater alignment with specific consideration of financing, reimbursement, implementation mechanisms and performance monitoring could accelerate systemic transformation by removing some well-known barriers to team-based care.

  18. Enacting Sustainable School-Based Health Initiatives: A Communication-Centered Approach to Policy and Practice

    Science.gov (United States)

    Canary, Heather E.

    2011-01-01

    Communication plays an important role in all aspects of the development and use of policy. We present a communication-centered perspective on the processes of enacting public health policies. Our proposed conceptual framework comprises 4 communication frames: orientation, amplification, implementation, and integration. Empirical examples from 2 longitudinal studies of school-based health policies show how each frame includes different communication processes that enable sustainable public health policy practices in school-based health initiatives. These 4 frames provide unique insight into the capacity of school-based public health policy to engage youths, parents, and a broader community of stakeholders. Communication is often included as an element of health policy; however, our framework demonstrates the importance of communication as a pivotal resource in sustaining changes in public health practices. PMID:21233442

  19. Support Mechanisms for Evidence-Based Policy-Making in Education. Eurydice Report

    Science.gov (United States)

    Riiheläinen, Jari Matti; Böhm, Franziska

    2017-01-01

    The report describes the mechanisms and practices that support evidence-based policy-making in the education sector in Europe. It comparatively looks at institutions and practices in evidence-based policy-making, as well as the accessibility, and mediation, of evidence. The report presents more detailed information on each individual country, with…

  20. Evidence-based policy? The use of mobile phones in hospital

    NARCIS (Netherlands)

    Ettelt, Stefanie; Nolte, Ellen; McKee, Martin; Haugen, Odd Arild; Karlberg, Ingvar; Klazinga, Niek; Ricciardi, Walter; Teperi, Juha

    2006-01-01

    BACKGROUND: Evidence-based policies have become increasingly accepted in clinical practice. However, policies on many of the non-clinical activities that take place in health care facilities may be less frequently evidence based. METHODS: We carried out a review of literature on safety of mobile

  1. Consulting, Mediating, Conducting, and Supporting: How Community-Based Organizations Engage with Research to Influence Policy

    Science.gov (United States)

    Winton, Sue; Evans, Michael P.

    2016-01-01

    Grounded in critical policy theories and democratic conceptions of research, case studies of three community-based organizations, one in Canada and two in the U.S., were analyzed to determine if and how the groups engaged with research in their efforts to influence education policy. The findings demonstrate that the community-based organizations…

  2. Base-stock policies for lost-sales models: Aggregation and asymptotics

    NARCIS (Netherlands)

    J.J. Arts (Joachim); R. Levi (Retsef); G.J.J.A.N. van Houtum (Geert-Jan); A.P. Zwart (Bert)

    2015-01-01

    textabstractThis paper considers the optimization of the base-stock level for the classical periodic review lost-sales inventory system. The optimal policy for this system is not fully understood and computationally expensive to obtain. Base-stock policies for this system are asymptotically

  3. Models of perceived cycling risk and route acceptability.

    Science.gov (United States)

    Parkin, John; Wardman, Mark; Page, Matthew

    2007-03-01

    Perceived cycling risk and route acceptability to potential users are obstacles to policy support for cycling and a better understanding of these issues will assist planners and decision makers. Two models of perceived risk, based on non-linear least squares, and a model of acceptability, based on the logit model, have been estimated for whole journeys based on responses from a sample of 144 commuters to video clips of routes and junctions. The risk models quantify the effect of motor traffic volumes, demonstrate that roundabouts add more to perceived risk than traffic signal controlled junctions and show that right turn manoeuvres increase perceived risk. Facilities for bicycle traffic along motor trafficked routes and at junctions are shown to have little effect on perceived risk and this brings into question the value of such facilities in promoting bicycle use. These models would assist in specifying infrastructure improvements, the recommending of least risk advisory routes and assessing accessibility for bicycle traffic. The acceptability model confirms the effect of reduced perceived risk in traffic free conditions and the effects of signal controlled junctions and right turns. The acceptability models, which may be used at an area wide level, would assist in assessing the potential demand for cycling and in target setting.

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

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

  6. Bi-Objective Modelling for Hazardous Materials Road-Rail Multimodal Routing Problem with Railway Schedule-Based Space-Time Constraints.

    Science.gov (United States)

    Sun, Yan; Lang, Maoxiang; Wang, Danzhu

    2016-07-28

    The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing-Tianjin-Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study.

  7. Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints

    Science.gov (United States)

    Sun, Yan; Lang, Maoxiang; Wang, Danzhu

    2016-01-01

    The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing–Tianjin–Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294

  8. On the Implications of Knowledge Bases for Regional Innovation Policies in Germany

    Directory of Open Access Journals (Sweden)

    Hassink Robert

    2014-12-01

    Full Text Available Regional innovation policies have been criticised for being too standardised, one-size-fits-all and place-neutral in character. Embedded in these debates, this paper has two aims: first, to analyse whether industries with different knowledge bases in regions in Germany have different needs for regional innovation policies, and secondly, to investigate whether knowledge bases can contribute to the fine-tuning of regional innovation policies in particular and to a modern, tailor-made, place-based regional innovation policy in general. It concludes that although needs differ due to differences in knowledge bases, those bases are useful only to a limited extent in fine-tuning regional innovation policies

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

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

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

  12. Predictors of HIV infection and prevalence for syphilis infection among injection drug users in China: community-based surveys along major drug trafficking routes.

    Science.gov (United States)

    Jia, Yujiang; Lu, Fan; Zeng, Gang; Sun, Xinhua; Xiao, Yan; Lu, Lin; Liu, Wei; Ni, Mingjian; Qu, Shuquan; Li, Chunmei; Liu, Jianbo; Wu, Pingsheng; Vermund, Sten H

    2008-08-25

    To assess the predictors and prevalence of HIV infection among injection drug users in highly endemic regions along major drug trafficking routes in three Chinese provinces. We enrolled participants using community outreach and peer referrals. Questionnaire-based interviews provided demographic, drug use, and sexual behavior information. HIV was tested via ELISA and syphilis by RPR. Of the 689 participants, 51.8% were HIV-infected, with persons living in Guangxi having significantly lower prevalence (16.4%) than those from Xinjiang and Yunnan (66.8% and 67.1%, respectively). Syphilis seropositivity was noted in 5.4%. Longer duration of IDU, greater awareness of HIV transmission routes, and living in Xinjiang or Yunnan were associated with HIV seropositivity on multivariable analysis. Independent risk factors differed between sites. In Guangxi, being male and having a longer duration of IDU were independent risk factors for HIV infection; in Xinjiang, older age and sharing needles and/or syringes were independent factors; in Yunnan, more frequent drug injection, greater awareness of HIV transmission routes, and higher income were independent predictors of HIV seropositivity. Prevalence rates of HIV among IDUs in China are more than two out of three in some venues. Risk factors include longer duration of IDU and needle sharing. Also associated with HIV were factors that may indicate some success in education in higher risk persons, such as higher knowledge. A systemic community-level intervention with respect to evidenced-based, population-level interventions to stem the spread of HIV from IDU in China should include needle exchange, opiate agonist-based drug treatment, condom distribution along with promotion, and advocacy for community-based VCT with bridges to HIV preventive services and care.

  13. Strengthening Science-based Environmental Policy Development in ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    Given this new and rapidly evolving situation, IDRC is providing funding to Simon Fraser University to support a network of young Burmese environmentalists to complete research that contributes to development policy and environmental practice in the ... IDRC and DHSC partner to fight antimicrobial resistance in animals.

  14. A Semantic Based Policy Management Framework for Cloud Computing Environments

    Science.gov (United States)

    Takabi, Hassan

    2013-01-01

    Cloud computing paradigm has gained tremendous momentum and generated intensive interest. Although security issues are delaying its fast adoption, cloud computing is an unstoppable force and we need to provide security mechanisms to ensure its secure adoption. In this dissertation, we mainly focus on issues related to policy management and access…

  15. The power and pain of market-based carbon policies

    NARCIS (Netherlands)

    Henderson, B.; Golub, A.; Pambudi, D.; Hertel, T.; Godde, C.; Herrero, M.; Cacho, O.; Gerber, P.

    2018-01-01

    The objectives of this research are to assess the greenhouse gas mitigation potential of carbon policies applied to the ruminant livestock sector [inclusive of the major ruminant species—cattle (Bos Taurus and Bos indicus), sheep (Ovis aries), and goats (Capra hircus)]—with particular emphasis on

  16. Strengthening Evidence-based Policy Research and Advocacy for ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    The Alliance for a Green Revolution in Africa (AGRA) has launched a vast program for increasing agricultural productivity and improving food security in Africa. To have a sustainable impact on food and nutritional security, however, agricultural technologies must be accompanied by appropriate and equitable policies.

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

  18. A Model-Based Exploration and Policy Analysis Related to Prostitution and Human Trafficking

    OpenAIRE

    András Kővári; Erik Pruyt

    2014-01-01

    This paper presents a model-based exploration and policy analysis related to prostitution and prostitution-related human trafficking. After a brief introduction to prostitution and prostitution-related human trafficking, the paper zooms in on the Dutch situation. A System Dynamics simulation model related to the Dutch situation developed to explore and provide policy insights is subsequently presented. Using the simulation model, policies are first of all tested, and preliminary conclusions a...

  19. A social relational approach to community-based ecotourism development: Policy intervention strategies

    OpenAIRE

    Rith, Sam Ol

    2010-01-01

    This study examines how policy intervention strategies facilitate or constrain the construction of positive social capital in a community-based ecotourism (CBET) context. It investigates CBET development policies in a specific Cambodian case study, explores implementation processes, assesses the level of social capital created, identifies the connections between social capital construction and development outcomes, and suggests how the policies contribute to social capital construction. The ...

  20. An Agenda for a Reformed Cohesion Policy A place-based approach to meeting European Union challenges and expectations

    OpenAIRE

    Fabrizio Barca

    2008-01-01

    EU regional policy is an investment policy. It supports job creation, competitiveness, economic growth, improved quality of life and sustainable development. These investments support the delivery of the Europe 2020 strategy. The present paper analysis two strategically different options of EU regional policy: place-neutral versus place-based policies for economic development. Our results suggest that in many EU regions the place-neutral policies may no be the best policy response to facing n...

  1. Towards Proactive Policies supporting Event-based Task Delegation

    OpenAIRE

    Gaaloul, Khaled; Miseldine, Philip; Charoy, François

    2009-01-01

    International audience; Delegation mechanisms are receiving increasing interest from the research community. Task delegation is a mechanism that supports organisational flexibility in the human-centric workflow systems, and ensures delegation of authority in access control systems. In this paper, we consider task delegation as an advanced security mechanism supporting policy decision. We define an approach to support dynamic delegation of authority within an access control framework. The nove...

  2. Do PISA data justify PISA-based education policy?

    OpenAIRE

    DE SOUSA LOBO BORGES DE ARAUJO LUISA; SALTELLI ANDREA; SCHNEPF SYLKE

    2015-01-01

    Purpose – Since the publication of its first results in 2000, the Programme for International Student Assessment (PISA) implemented by the OECD has repeatedly been the subject of heated debate. In late 2014 controversy flared up anew, with the most severe critics going so far as to call for a halt to the programme. The purpose of this paper is to discuss the methodological design of PISA and the ideological basis of scientific and policy arguments invoked for and against it. De...

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

  4. Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

    Science.gov (United States)

    Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

    2010-11-16

    A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

  5. Elucidation of Listeria monocytogenes contamination routes in cold-smoked salmon processing plants detected by DNA-based typing methods

    DEFF Research Database (Denmark)

    Vogel, Birte Fonnesbech; Huss, Hans Henrik; Ojeniyi, B.

    2001-01-01

    The contamination routes of Listeria monocytogenes in cold- smoked salmon processing plants were investigated by analyzing 3,585 samples from products (produced in 1995, 1996, 1998, and 1999) and processing environments (samples obtained in 1998 and 1999) of two Danish smokehouses. The level...... of product contamination in plant I varied from 31 to 85%, and no L. monocytogenes was found on raw fish (30 fish were sampled). In plant II, the levels of both raw fish and product contamination varied from 0 to 25% (16 of 185 raw fish samples and 59 of 1,000 product samples were positive for L......, suggesting that contamination of the final product (cold-smoked salmon) in both plants (but primarily in plant I) was due to contamination during processing rather than to contamination from raw fish. However, the possibility that raw fish was an important source of contamination of the processing equipment...

  6. A Rights-Based Approach to Internet Policy and Governance for the ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    A Rights-Based Approach to Internet Policy and Governance for the Advancement of Economic, Social, and Cultural Rights. The debate on Internet freedom has intensified over the last few years as governments and civil society organizations explore policies to safeguard online civil liberties and online security. Civil society ...

  7. Policy based traffic light control – Balancing weights of user groups

    NARCIS (Netherlands)

    Vreeswijk, Jacob Dirk; Wismans, Luc Johannes Josephus; Tutert, Bas

    2013-01-01

    On the basis of policy-based target groups, we developed a prioritization strategy for traffic streams and applied it with the adaptive urban traffic control (UTC) ImFlow. Our main aim was to gain understanding of the possibilities of a policy driven prioritization in an urban context. We conclude

  8. Data-Based Decision Making at the Policy, Research, and Practice Levels

    NARCIS (Netherlands)

    Schildkamp, Kim; Ebbeler, J.

    2015-01-01

    Data-based decision making (DBDM) can lead to school improvement. However, schools struggle with the implementation of DBDM. In this symposium, we will discuss research and the implementation of DBDM at the national and regional policy level and the classroom level. We will discuss policy issues

  9. Nudging socially isolated people towards well-being with the 'Happiness Route': design of a randomized controlled trial for the evaluation of a happiness-based intervention.

    Science.gov (United States)

    Weiss, Laura A; Westerhof, Gerben J; Bohlmeijer, Ernst T

    2013-09-20

    The Happiness Route is an innovative intervention that uses a happiness-based approach for people with an accumulation of risk factors for low well-being: socially isolated people with health impairments and a low socioeconomic status. The goal of this intervention is to improve well-being by engaging participants in intrinsically motivated activities with methods from positive psychology. We hypothesize that the primary outcome measure, emotional, social and psychological well-being of participants of the Happiness Route, will increase in comparison to the traditional and commonly-used problem-based approach. Secondary outcome measures are health-related quality of life, psychosocial functioning and health care consumption. Participants will be socially isolated people with health problems and a low socioeconomic status. Participants will be recruited in ten Dutch communities and candidates will be signed up by intermediaries, professionals from the health and social sector. Randomly assigned, half of the participants will follow the Happiness Route and half of the participants will follow the active, problem-focused control group 'Customized Care'. In total, 256 participants will be included. In both conditions, participants will receive counseling sessions from trained counselors. In the control group, participants will talk about their problems and the care they get and counselors help to optimize their care. In the Happiness Route, the counselor ask questions such as "How do you want to live your life?". The intervention helps people to find their 'passion', i.e., a positive goal-engaged and intrinsically motivated activity. It enables them to follow their passion through by a once-only personal happiness budget (maximal €500). We use well-validated and reliable questionnaires to measure primary and secondary outcome measures at baseline, directly after the intervention and at a nine-month follow-up. Shortcomings of earlier intervention studies in positive

  10. Towards a Demand-Driven Agenda for Place-Based Policies in the EU

    DEFF Research Database (Denmark)

    Jensen, Camilla

    This policy study is the second report on the policy implications of the EU funded project Policy Incentives for the Creation of Knowledge – Methods and Evidence (PICK-ME). All contributions in the project related with place-based policy and cluster building are summarized and reviewed (Work......-term viability through the emergence of new and related industries over time. Labor market policies are an important area of research with respect to the study of innovation in clusters and how to create incentives for clusters that combine related types of knowledge. The policy review also showed...... and creating institutions to achieve coordination mechanisms that use principles of market forces and lead firms towards creating the same ends....

  11. Research-Based Knowledge: Researchers' Contribution to Evidence-Based Practice and Policy Making in Career Guidance

    Science.gov (United States)

    Haug, Erik Hagaseth; Plant, Peter

    2016-01-01

    To present evidence for the outcomes of career guidance is increasingly seen as pivotal for a further professionalization of policy making and service provision. This paper puts an emphasis on researchers' contribution to evidence-based practice and policy making in career guidance. We argue for a broader and more pluralistic research strategy to…

  12. The MRSD web server for metabolic route search and design

    OpenAIRE

    sprotocols

    2015-01-01

    Authors: yong cao, Deguo Xia & Haoran Zheng ### Abstract The Metabolic Route Search and Design (MRSD) server is an integrated platform for metabolic route search (MRS) and metabolic route design (MRD) based on the data from KEGG. MRS computes metabolic routes between the source metabolite and the product metabolite on the weighted compound transforming graph. Each graph represents a metabolic network. The output from a typical server run contains graphic illustrating metabolic routes ...

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

    Science.gov (United States)

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

    2015-06-01

    Active commuting offers the potential to increase physical activity among adults by being built into daily routines. Characteristics of the route to work may influence propensity to walk or cycle. Geographic information system (GIS) software is often used to explore this by modelling routes between home and work. However, if the validity of modelled routes depends on the mode of travel used, studies of environmental determinants of travel may be biased. We aimed to understand how well modelled routes reflect those actually taken, and what characteristics explain these differences. We compared modelled GIS shortest path routes with actual routes measured using QStarz BT-Q1000X Global Positioning System (GPS) devices in a free-living sample of adults working in Cambridge and using varying travel modes. Predictors of differences, according to length and percentage overlap, between the two route sets were assessed using multilevel regression models and concordance coefficients. The 276 trips, made by 51 participants, were on average 27% further than modelled routes, with an average geographical overlap of 39%. However, predictability of the route depended on travel mode. For route length, there was moderate-to-substantial agreement for journeys made on foot and by bicycle. Route overlap was lowest for trips made by car plus walk (22%). The magnitude of difference depended on other journey characteristics, including travelling via intermediate destinations, distance, and use of busy roads. In conclusion, GIS routes may be acceptable for distance estimation and to explore potential routes, particularly active commuting. However, GPS should be used to obtain accurate estimates of environmental contexts in which commuting behaviour actually occurs. Public health researchers should bear these considerations in mind when studying the geographical determinants and health implications of commuting behaviour, and when recommending policy changes to encourage active travel.

  14. A controlled community-based trial to promote smoke-free policy in rural communities.

    Science.gov (United States)

    Hahn, Ellen J; Rayens, Mary Kay; Adkins, Sarah; Begley, Kathy; York, Nancy

    2015-01-01

    Rural, tobacco-growing areas are disproportionately affected by tobacco use, secondhand smoke, and weak tobacco control policies. The purpose was to test the effects of a stage-specific, tailored policy-focused intervention on readiness for smoke-free policy, and policy outcomes in rural underserved communities. A controlled community-based trial including 37 rural counties. Data were collected annually with community advocates (n = 330) and elected officials (n = 158) in 19 intervention counties and 18 comparison counties over 5 years (average response rate = 68%). Intervention communities received policy development strategies from community advisors tailored to their stage of readiness and designed to build capacity, build demand, and translate and disseminate science. Policy outcomes were tracked over 5 years. Communities receiving the stage-specific, tailored intervention had higher overall community readiness scores and better policy outcomes than the comparison counties, controlling for county-level smoking rate, population size, and education. Nearly one-third of the intervention counties adopted smoke-free laws covering restaurants, bars, and all workplaces compared to none of the comparison counties. The stage-specific, tailored policy-focused intervention acted as a value-added resource to local smoke-free campaigns by promoting readiness for policy, as well as actual policy change in rural communities. Although actual policy change and percent covered by the policies were modest, these areas need additional resources and efforts to build capacity, build demand, and translate and disseminate science in order to accelerate smoke-free policy change and reduce the enormous toll from tobacco in these high-risk communities. © 2014 National Rural Health Association.

  15. Analyzing Walking Route Choice through Built Environments using Random Forests and Discrete Choice Techniques.

    Science.gov (United States)

    Tribby, Calvin P; Miller, Harvey J; Brown, Barbara B; Werner, Carol M; Smith, Ken R

    2017-11-01

    Walking is a form of active transportation with numerous benefits, including better health outcomes, lower environmental impacts and stronger communities. Understanding built environmental associations with walking behavior is a key step towards identifying design features that support walking. Human mobility data available through GPS receivers and cell phones, combined with high resolution walkability data, provide a rich source of georeferenced data for analyzing environmental associations with walking behavior. However, traditional techniques such as route choice models have difficulty with highly dimensioned data. This paper develops a novel combination of a data-driven technique with route choice modeling for leveraging walkability audits. Using data from a study in Salt Lake City, Utah, USA, we apply the data-driven technique of random forests to select variables for use in walking route choice models. We estimate data-driven route choice models and theory-driven models based on predefined walkability dimensions. Results indicate that the random forest technique selects variables that dramatically improve goodness of fit of walking route choice models relative to models based on predefined walkability dimensions. We compare the theory-driven and data-driven walking route choice models based on interpretability and policy relevance.

  16. Science-based regulatory and policy considerations in nutrition.

    Science.gov (United States)

    Schneeman, Barbara

    2015-05-01

    Scientific evidence is necessary for the development of effective and enforceable regulations and government policy. To use scientific information appropriately, a systematic approach is needed for review and evaluation of the evidence. Federal agencies in the United States have developed useful approaches for such a review and evaluation to develop nutrition labeling, including health claims, and for updating of the Dietary Guidelines for Americans. The WHO is using a systematic evaluation process to update its recommendations on diet and health. The results of such reviews also highlight research needs to address relevant gaps in our knowledge. © 2015 American Society for Nutrition.

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

    Directory of Open Access Journals (Sweden)

    Kyoung Jae Lim

    2011-08-01

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

  18. Analysis of a hydrometallurgical route to recover base metals from spent rechargeable batteries by liquid-liquid extraction with Cyanex 272

    Science.gov (United States)

    Mantuano, Danuza Pereira; Dorella, Germano; Elias, Renata Cristina Alves; Mansur, Marcelo Borges

    A hydrometallurgical route is proposed to recover zinc and manganese from spent alkaline batteries in order to separate base metals such as nickel, copper, aluminium, cadmium, lithium and cobalt which constitute the main metallic species of spent NiCd, NiMH and Li-ion rechargeable batteries. The route comprises the following main steps: (1) sorting batteries by type, (2) battery dismantling to separate the spent battery dust from plastic, iron scrap and paper, (3) leaching of the dust with sulphuric acid and (4) metal separation by a liquid-liquid extraction using Cyanex 272 (bis-2,4,4-trimethylpentyl phosphinic acid) as extractant. The metal content of NiCd, NiMH and Li-ion batteries from three distinct manufacturers has been evaluated. A factorial design of experiments was used to investigate the leaching step using operational variables such as temperature, H 2SO 4 concentration, S/L ratio and H 2O 2 concentration. Analysis of metal separation by the liquid-liquid extraction with Cyanex 272 identified a pH 1/2 2.5-3.0 for zinc and aluminium, pH 1/2 4.0-4.5 for manganese, cadmium, copper and cobalt, pH 1/2 6.5 for nickel and pH 1/2 8.0 for lithium. These results indicate that batteries must be previously sorted by type and treated separately. In addition, data fitting to an equilibrium model proposed for the reactive test system by the European Federation of Chemical Engineering (EFChE) have indicated that MR 2(RH) 2 and MR 2 complexes (where M = Zn, Mn, Co, Cd and Cu) co-exist in the organic phase with Cyanex 272 depending on the loading conditions. The route has been found technically viable to separate the main metallic species of all batteries considered in this study.

  19. Tobacco plain packaging: Evidence based policy or public health advocacy?

    Science.gov (United States)

    McKeganey, Neil; Russell, Christopher

    2015-06-01

    In December 2012, Australia became the first country to require all tobacco products be sold solely in standardised or 'plain' packaging, bereft of the manufacturers' trademarked branding and colours, although retaining large graphic and text health warnings. Following the publication of Sir Cyril Chantler's review of the evidence on the effects of plain tobacco packaging, the Ministers of the United Kingdom Parliament voted in March 2015 to implement similar legislation. Support for plain packaging derives from the belief that tobacco products sold in plain packs have reduced appeal and so are more likely to deter young people and non-smokers from starting tobacco use, and more likely to motivate smokers to quit and stay quit. This article considers why support for the plain packaging policy has grown among tobacco control researchers, public health advocates and government ministers, and reviews Australian survey data that speak to the possible introductory effect of plain packaging on smoking prevalence within Australia. The article concludes by emphasising the need for more detailed research to be undertaken before judging the capacity of the plain packaging policy to deliver the multitude of positive effects that have been claimed by its most ardent supporters. Copyright © 2015 Elsevier B.V. All rights reserved.

  20. Dog ownership has unknown risks but known health benefits: we need evidence based policy

    OpenAIRE

    Orritt, Rachel

    2014-01-01

    Politically driven UK legislation that targets “dangerous dogs” has not been shown to reduce dog bites, writes Rachel Orritt, who calls for policy to be based on robust evidence of incidence and risk assessment of ownership

  1. A Machine Learning Concept for DTN Routing

    Science.gov (United States)

    Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

    2017-01-01

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

  2. Study on Logistics Industry Development Policy of Beijing Based on System Dynamic

    Directory of Open Access Journals (Sweden)

    Shuihai Dou

    2014-05-01

    Full Text Available Purpose: This paper is committed to design a logistics industry development policy model based on system dynamic to simulate the policy measures which promote region economic and logistics efficiency. The interaction between logistic industry development policy and economy needs to be investigated and the influence degree of logistic efficiency affected by industry policy needs to be identified too. Design/methodology/approach: In order to achieve the objective, it makes a system analysis from industry perspective to divide system into economic growth subsystem, logistics demand subsystem and logistics supply subsystem. Then the hypothesis and the boundaries are defined, and the causal diagram and system flow diagrams are drawn. The paper designs parameters and structural equation by the sample of Beijing using the econometrics model and takes model validation. Taking Beijing as an example, logistics industry development policy is simulated from the aspect of technological progress, increasing fixed assets investment, adjusting the industrial structure proportion and comprehensive policy by changing the parameters using Vensim-PLE. Findings?After logistics development policy is highly simulated by system dynamic model of logistics industry development policy, it is found that the policies of technological progress, fixed assets investment increasing, the industrial structure proportion adjustment and the comprehensive policy have different function to affect GDP, logistics demand, supply capacity and actual logistics costs. Originality/value: Compared with the previous research, this paper analyzes the interactive mechanism between logistics industry policy and region economy from a system perspective and establishes system dynamics model of logistics industry development policy to make up for the limitation of previous research.

  3. School-based obesity policy, social capital, and gender differences in weight control behaviors.

    Science.gov (United States)

    Zhu, Ling; Thomas, Breanca

    2013-06-01

    We examined the associations among school-based obesity policies, social capital, and adolescents' self-reported weight control behaviors, focusing on how the collective roles of community and adopted policies affect gender groups differently. We estimated state-level ecologic models using 1-way random effects seemingly unrelated regressions derived from panel data for 43 states from 1991 to 2009, which we obtained from the Centers for Disease Control and Prevention's Youth Risk Behavior Surveillance System. We used multiplicative interaction terms to assess how social capital moderates the effects of school-based obesity policies. School-based obesity policies in active communities were mixed in improving weight control behaviors. They increased both healthy and unhealthy weight control behaviors among boys but did not increase healthy weight control behaviors among girls. Social capital is an important contextual factor that conditions policy effectiveness in large contexts. Heterogeneous behavioral responses are associated with both school-based obesity policies and social capital. Building social capital and developing policy programs to balance outcomes for both gender groups may be challenging in managing childhood obesity.

  4. Realizing IoT service's policy privacy over publish/subscribe-based middleware.

    Science.gov (United States)

    Duan, Li; Zhang, Yang; Chen, Shiping; Wang, Shiyao; Cheng, Bo; Chen, Junliang

    2016-01-01

    The publish/subscribe paradigm makes IoT service collaborations more scalable and flexible, due to the space, time and control decoupling of event producers and consumers. Thus, the paradigm can be used to establish large-scale IoT service communication infrastructures such as Supervisory Control and Data Acquisition systems. However, preserving IoT service's policy privacy is difficult in this paradigm, because a classical publisher has little control of its own event after being published; and a subscriber has to accept all the events from the subscribed event type with no choice. Few existing publish/subscribe middleware have built-in mechanisms to address the above issues. In this paper, we present a novel access control framework, which is capable of preserving IoT service's policy privacy. In particular, we adopt the publish/subscribe paradigm as the IoT service communication infrastructure to facilitate the protection of IoT services policy privacy. The key idea in our policy-privacy solution is using a two-layer cooperating method to match bi-directional privacy control requirements: (a) data layer for protecting IoT events; and (b) application layer for preserving the privacy of service policy. Furthermore, the anonymous-set-based principle is adopted to realize the functionalities of the framework, including policy embedding and policy encoding as well as policy matching. Our security analysis shows that the policy privacy framework is Chosen-Plaintext Attack secure. We extend the open source Apache ActiveMQ broker by building into a policy-based authorization mechanism to enforce the privacy policy. The performance evaluation results indicate that our approach is scalable with reasonable overheads.

  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. Moving an Evidence-Based Policy Agenda Forward: Leadership Tips From the Field.

    Science.gov (United States)

    Garrett, Teresa

    2018-05-01

    Advancing evidence-based policy change is a leadership challenge that nurses should embrace. Key tips to ensure that evidence-based policy changes are successful at the individual, community, and population levels are offered to help nurses through the change process. The public trust in the nursing profession is a leverage point that should be used to advance the use of evidence, expedite change, and improve health for students and across communities.

  7. Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

    Directory of Open Access Journals (Sweden)

    Majid Yousefikhoshbakht

    2016-07-01

    Full Text Available The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The objective is to minimize the total distance traveled by the salesman.  Because this problem is a non-deterministic polynomial (NP-hard problem in nature, a hybrid meta-heuristic algorithm called REACSGA is used for solving the TSP. In REACSGA, a reactive bone route algorithm that uses the ant colony system (ACS for generating initial diversified solutions and the genetic algorithm (GA as an improved procedure are applied. Since the performance of the Metaheuristic algorithms is significantly influenced by their parameters, Taguchi Method is used to set the parameters of the proposed algorithm. The proposed algorithm is tested on several standard instances involving 24 to 318 nodes from the literature. The computational result shows that the results of the proposed algorithm are competitive with other metaheuristic algorithms for solving the TSP in terms of better quality of solution and computational time respectively. In addition, the proposed REACSGA is significantly efficient and finds closely the best known solutions for most of the instances in which thirteen best known solutions are also found.

  8. Bicriterion a priori route choice in stochastic time-dependent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Pretolani, D; Andersen, K A

    2006-01-01

    In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path...... route choice in STD networks, i.e. the problem of finding the set of efficient paths. Both expectation and min-max criteria are considered and a solution method based on the two-phase approach is devised. Experimental results reveal that the full set of efficient solutions can be determined on rather...

  9. Route Availabililty Planning Tool -

    Data.gov (United States)

    Department of Transportation — The Route Availability Planning Tool (RAPT) is a weather-assimilated decision support tool (DST) that supports the development and execution of departure management...

  10. Increasing the Intensity over Time of an Electric-Assist Bike Based on the User and Route: The Bike Becomes the Gym.

    Science.gov (United States)

    De La Iglesia, Daniel H; De Paz, Juan F; Villarrubia González, Gabriel; Barriuso, Alberto L; Bajo, Javier; Corchado, Juan M

    2018-01-14

    Nowadays, many citizens have busy days that make finding time for physical activity difficult. Thus, it is important to provide citizens with tools that allow them to introduce physical activity into their lives as part of the day's routine. This article proposes an app for an electric pedal-assist-system (PAS) bicycle that increases the pedaling intensity so the bicyclist can achieve higher and higher levels of physical activity. The app includes personalized assist levels that have been adapted to the user's strength/ability and a profile of the route, segmented according to its slopes. Additionally, a social component motivates interaction and competition between users based on a scoring system that shows the level of their performances. To test the training module, a case study in three different European countries lasted four months and included nine people who traveled 551 routes. The electric PAS bicycle with the app that increases intensity of physical activity shows promise for increasing levels of physical activity as a regular part of the day.

  11. Increasing the Intensity over Time of an Electric-Assist Bike Based on the User and Route: The Bike Becomes the Gym

    Directory of Open Access Journals (Sweden)

    Daniel H. De La Iglesia

    2018-01-01

    Full Text Available Nowadays, many citizens have busy days that make finding time for physical activity difficult. Thus, it is important to provide citizens with tools that allow them to introduce physical activity into their lives as part of the day’s routine. This article proposes an app for an electric pedal-assist-system (PAS bicycle that increases the pedaling intensity so the bicyclist can achieve higher and higher levels of physical activity. The app includes personalized assist levels that have been adapted to the user’s strength/ability and a profile of the route, segmented according to its slopes. Additionally, a social component motivates interaction and competition between users based on a scoring system that shows the level of their performances. To test the training module, a case study in three different European countries lasted four months and included nine people who traveled 551 routes. The electric PAS bicycle with the app that increases intensity of physical activity shows promise for increasing levels of physical activity as a regular part of the day.

  12. Topographical Memory for newly-learned maps is differentially affected by route- vs. landmark-based learning: An fMRI study

    DEFF Research Database (Denmark)

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

    2018-01-01

    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......Humans rely on topographical memory to encode information about spatial aspects of environments. However, even though people adopt different strategies when learning new maps, little is known about the impact of those strategies on topographical memory, and their neural correlates. To examine...... 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...

  13. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

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

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

  14. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

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

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

  15. Intervention in gene regulatory networks via greedy control policies based on long-run behavior

    Directory of Open Access Journals (Sweden)

    Ghaffari Noushin

    2009-06-01

    Full Text Available Abstract Background A salient purpose for studying gene regulatory networks is to derive intervention strategies, the goals being to identify potential drug targets and design gene-based therapeutic intervention. Optimal stochastic control based on the transition probability matrix of the underlying Markov chain has been studied extensively for probabilistic Boolean networks. Optimization is based on minimization of a cost function and a key goal of control is to reduce the steady-state probability mass of undesirable network states. Owing to computational complexity, it is difficult to apply optimal control for large networks. Results In this paper, we propose three new greedy stationary control policies by directly investigating the effects on the network long-run behavior. Similar to the recently proposed mean-first-passage-time (MFPT control policy, these policies do not depend on minimization of a cost function and avoid the computational burden of dynamic programming. They can be used to design stationary control policies that avoid the need for a user-defined cost function because they are based directly on long-run network behavior; they can be used as an alternative to dynamic programming algorithms when the latter are computationally prohibitive; and they can be used to predict the best control gene with reduced computational complexity, even when one is employing dynamic programming to derive the final control policy. We compare the performance of these three greedy control policies and the MFPT policy using randomly generated probabilistic Boolean networks and give a preliminary example for intervening in a mammalian cell cycle network. Conclusion The newly proposed control policies have better performance in general than the MFPT policy and, as indicated by the results on the mammalian cell cycle network, they can potentially serve as future gene therapeutic intervention strategies.

  16. [Diffusing information to promote population policies based on N'Djamena's Plan of Action].

    Science.gov (United States)

    Gueye, M

    1990-03-01

    From November 28-30, 1989, the Centre D'Etudes et de Recherche sur la Population pour le Developpement (CERPOD) sponsored the Selingue Retreat (SR), outside of Bamako, Mali to discuss the role of population policy development among the 9 Sahelian countries following the adoption of the N'Djamena Program of Action (PAN) the year before. The key questions discussed were: 1) state of the art regarding implementation of population policy development among Sahelian countries; 2) strategies of technical assistance to support CERPOD for population policy development; 3) organizational matters; and 4) evaluation strategies to evaluate population policy development and CERPOD's programs. The SR recommended that due to the lack of an adequate information base for population policy development that collaboration continue between CERPOD and the Futures Group. The new project will begin with a detailed plan of action for Mali and Guinee-Bissau, followed by Niger and Burkina Faso.

  17. Evidence-Based Policy Making and the Implementation of Regulatory Impact Assessment in Croatia

    Directory of Open Access Journals (Sweden)

    Zdravko Petak

    2015-06-01

    Full Text Available Purpose: This study is dealing with the application of evidence-based policy-making in Croatian public administration and the general role of applied policy analysis in the Croatian system of governance. Methodology: This development is illustrated by the peculiarities of introducing regulatory impact assessment (RIA tools in Croatian public administrative structures. Findings: The author is pointing out various limitations in the usage of policy analysis tools in formulating, implementing and evaluating public policies in Croatia. The crucial role of RIA for enhancing executive capacity of governance structures is particularly stressed in the study. The final part of the article is devoted to the prospects of further development of RIA as an applied policy analysis tool within the Croatian system of governance.

  18. Cryptography, Information Operations and the Industrial Base: A Policy Dilemma

    National Research Council Canada - National Science Library

    Horner, Stephen

    1997-01-01

    .... The explosive force of information technology places the Global Information Infrastructure, the worldwide industrial base and the various world governments in both mutually supporting and somewhat adversarial positions...

  19. Shutdown Policies for MEMS-Based Storage Devices -- Analytical Models

    NARCIS (Netherlands)

    Khatib, M.G.; Engelen, Johannes Bernardus Charles; Hartel, Pieter H.

    MEMS-based storage devices should be energy ecient for deployment in mobile systems. Since MEMS-based storage devices have a moving me- dia sled, they should be shut down during periods of inactivity. However, shutdown costs energy, limiting the applicability of aggressive shutdown decisions. The

  20. Community-Based Wildlife Management In Tanzania: The Policy ...

    African Journals Online (AJOL)

    Community-based wildlife management (CWM) approach – known to others as community-based conservation – was first introduced in Tanzania in 1987/88. The approach intends to reconcile wildlife conservation and rural economic development. In the 1990s Tanzanians witnessed a rush by government Ministries and ...

  1. Using knowledge brokering to promote evidence-based policy-making: The need for support structures.

    Science.gov (United States)

    van Kammen, Jessika; de Savigny, Don; Sewankambo, Nelson

    2006-08-01

    Knowledge brokering is a promising strategy to close the "know-do gap" and foster greater use of research findings and evidence in policy-making. It focuses on organizing the interactive process between the producers and users of knowledge so that they can co-produce feasible and research-informed policy options. We describe a recent successful experience with this novel approach in the Netherlands and discuss the requirements for effective institutionalization of knowledge brokering. We also discuss the potential of this approach to assist health policy development in low-income countries based on the experience of developing the Regional East-African Health (REACH)-Policy Initiative. We believe that intermediary organizations, such as regional networks, dedicated institutional mechanisms and funding agencies, can play key roles in supporting knowledge brokering. We recommend the need to support and learn from the brokerage approach to strengthen the relationship between the research and policy communities and hence move towards a stronger culture of evidence-based policy and policy-relevant research.

  2. Impact of emergency medical services stroke routing protocols on Primary Stroke Center certification in California.

    Science.gov (United States)

    Schuberg, Sam; Song, Sarah; Saver, Jeffrey L; Mack, William J; Cen, Steven Y; Sanossian, Nerses

    2013-12-01

    Organized stroke systems of care include Primary Stroke Center (PSC) certification and preferential emergency medical services (EMS) routing of suspected patients with stroke to designated PSCs. Stroke EMS routing is not nationally governed; in California, routing is determined by county. EMS routing policies might provide an incentive for PSC accreditation. We evaluated the relationship between independent adoption of EMS routing protocols and PSC designation acquisition in California. Dates of PSC certification were obtained through The Joint Commissions Website and confirmatory calls to stroke coordinators. Starting date of county EMS PSC routing policies was obtained from county EMS agencies. We provide descriptive analysis of number of hospitals achieving PSC designation relative to implementation of EMS routing policies for all counties with PSCs. By June 2012, there were 131 California PSCs in 27 counties, and 22 of 58 counties had implemented EMS routing policies. The greatest number of PSCs was in Los Angeles (30) followed by San Diego (11), Orange (9), and Santa Clara (9) counties. Achievement of PSC designation occurred more frequently immediately before and after EMS routing: 51 PSCs (39%) within 1 year; 85 PSCs (65%) within 2 years. The yearly rate of eligible hospital conversion to PSC designation accelerated concurrent with EMS diversion policy adoption from 3.8% before to 16.2% during and decelerated afterward to 7.6%. Implementation of EMS routing policies may be an important factor driving PSC certification. National adoption of stroke routing policies may lead to more PSCs, positively impacting patient care.

  3. Combining rate-based and cap-and-trade emissions policies

    International Nuclear Information System (INIS)

    Fischer, Carolyn

    2003-12-01

    Rate-based emissions policies (like tradable performance standards, TPS) fix average emissions intensity, while cap-and-trade (CAT) policies fix total emissions. This paper shows that unfettered trade between rate-based and cap-and-trade programs always raises combined emissions, except when product markets are related in particular ways. Gains from trade are fully passed on to consumers in the rate-based sector, resulting in more output and greater emissions allocations. We consider several policy options to offset the expansion, including a tax, an 'exchange rate' to adjust for relative permit values, output-based allocation (OBA) for the rate-based sector, and tightening the cap. A range of combinations of tighter allocations could improve situations in both sectors with trade while holding emissions constant

  4. Elucidation of Listeria monocytogenes Contamination Routes in Cold-Smoked Salmon Processing Plants Detected by DNA-Based Typing Methods

    Science.gov (United States)

    Fonnesbech Vogel, Birte; Huss, Hans Henrik; Ojeniyi, Bente; Ahrens, Peter; Gram, Lone

    2001-01-01

    The contamination routes of Listeria monocytogenes in cold-smoked salmon processing plants were investigated by analyzing 3,585 samples from products (produced in 1995, 1996, 1998, and 1999) and processing environments (samples obtained in 1998 and 1999) of two Danish smokehouses. The level of product contamination in plant I varied from 31 to 85%, and no L. monocytogenes was found on raw fish (30 fish were sampled). In plant II, the levels of both raw fish and product contamination varied from 0 to 25% (16 of 185 raw fish samples and 59 of 1,000 product samples were positive for L. monocytogenes). A total of 429 strains of L. monocytogenes were subsequently compared by random amplified polymorphic DNA (RAPD) profiling, and 55 different RAPD types were found. The RAPD types detected on the products were identical to types found on the processing equipment and in the processing environment, suggesting that contamination of the final product (cold-smoked salmon) in both plants (but primarily in plant I) was due to contamination during processing rather than to contamination from raw fish. However, the possibility that raw fish was an important source of contamination of the processing equipment and environment could not be excluded. Contamination of the product occurred in specific areas (the brining and slicing areas). In plant I, the same RAPD type (RAPD type 12) was found over a 4-year period, indicating that an established in-house flora persisted and was not eliminated by routine hygienic procedures. In plant II, where the prevalence of L. monocytogenes was much lower, no RAPD type persisted over long periods of time, and several different L. monocytogenes RAPD types were isolated. This indicates that persistent strains may be avoided by rigorous cleaning and sanitation; however, due to the ubiquitous nature of the organism, sporadic contamination occurred. A subset of strains was also typed by using pulsed-field gel electrophoresis and amplified fragment length

  5. Secure Communication and Information Exchange using Authenticated Ciphertext Policy Attribute-Based Encryption in Mobile Ad-hoc Network

    Directory of Open Access Journals (Sweden)

    Samsul Huda

    2016-08-01

    Full Text Available MANETs are considered as suitable for commercial applications such as law enforcement, conference meeting, and sharing information in a student classroom and critical services such as military operations, disaster relief, and rescue operations. Meanwhile, in military operation especially in the battlefield in freely medium which naturally needs high mobility and flexibility. Thus, applying MANETs make these networks vulnerable to various types of attacks such aspacket eavesdropping, data disseminating, message replay, message modification, and especially privacy issue. In this paper, we propose a secure communication and information exchange in MANET with considering secure adhoc routing and secure information exchange. Regarding privacy issue or anonymity, we use a reliable asymmetric encryption which protecting user privacy by utilizing insensitive user attributes as user identity, CP-ABE (Ciphertext-Policy Attribute-Based Encryption cryptographic scheme. We also design protocols to implement the proposed scheme for various battlefied scenarios in real evironment using embedded devices. Our experimental results showed that the additional of HMAC (Keyed-Hash Message Authentication Code and AES (Advanced Encryption standard schemes using processor 1.2GHz only take processing time about 4.452 ms,  we can confirm that our approach by using CP-ABE with added HMAC and AES schemes make low overhead.

  6. Food Availability in School Stores in Seoul, South Korea after Implementation of Food- and Nutrient-Based Policies

    Science.gov (United States)

    Choi, Seul Ki; Frongillo, Edward A.; Blake, Christine E.; Thrasher, James F.

    2017-01-01

    Background: To improve school store food environments, the South Korean government implemented 2 policies restricting unhealthy food sales in school stores. A food-based policy enacted in 2007 restricts specific food sales (soft drinks); and a nutrient-based policy enacted in 2009 restricts energy-dense and nutrient-poor (EDNP) food sales. The…

  7. NEBULAS a high performance data-driven event-building architecture based on an asynchronous self-routing packet-switching network

    CERN Document Server

    Christiansen, J; Letheren, M F; Marchioro, A; Tenhunen, H; Nummela, A; Nurmi, J; Gomes, P; Mandjavidze, I D; CERN. Geneva. Detector Research and Development Committee

    1992-01-01

    We propose a new approach to event building in future high rate experiments such as those at the LHC. We use a real-time, hierarchical event filtering paradigm based on pipelined triggering and data buffering at level 1, followed by farms of several hundreds of independent processors operating at level 2 and level 3. In view of the uncertainty in the rates and event sizes expected after the first level trigger in LHC experiments, it is important that data acquisition architectures can be open- endedly scaled to handle higher global bandwidths and accommodate more processors. We propose to apply the principle of self-routing packet-switching networks (currently under industrial development for telecommunications and multi-processor applications) to event building. We plan to implement a conceptually simple, distributed, asynchronous, data-driven, scalable, bottleneck-free architecture. An important feature of the architecture is that it can satisfy the data acquisition system's performance requirements using o...

  8. Informing principal policy reforms in South Africa through data-based evidence

    OpenAIRE

    Gabrielle Wills

    2015-01-01

    In the past decade there has been a notable shift in South African education policy that raises the value of school leadership as a lever for learning improvements. Despite a growing discourse on school leadership, there has been a lack of empirical based evidence on principals to inform, validate or debate the efficacy of proposed policies in raising the calibre of school principals. Drawing on findings from a larger study to understand the labour market for school principals in South Africa...

  9. Economic transition policies in Chinese resource-based cities: An overview of government efforts

    International Nuclear Information System (INIS)

    Li, Huijuan; Long, Ruyin; Chen, Hong

    2013-01-01

    Resource-based cities in China have made momentous contributions to the development of the national economy for decades. However, with the depletion of natural resources, their sustainable development is challenging and transition is important. The Chinese government has made great efforts to help resource-based cities. The purpose of this study is to investigate transition policies and their implementation. Firstly, we reviewed previous studies and summarized the essential elements of some successful resource-based cities, which are useful experiences for Chinese resource-based cities. Secondly, we studied the development of resource-based cities over the past 10 years with a focus on economic development, industrial structure, government revenue and environmental conditions. We found that resource-based cities were less developed compared to other cities. The main reasons are the after-effects of a planned economy, an unreasonable tax system, planning mistakes and misguided resources exploitation policies. Thirdly, we analyzed several aspects of the policy responses after the introduction of transition policies, including designating 69 resource-exhausted cities, supporting cities with funds and projects, formulating transition plans and evaluating transition performance. However, there are some deficiencies in the process of policy implementation. Finally, some recommendations were provided to improve transition performance and sustainable development for resource-based cities. - Highlights: ► Analyze the development of Chinese resource-based cities from four aspects. ► Analyze the causes of less development in resource-based cities. ► Investigate policies and their responses to transformation. ► Provide recommendations to improve transformation performance and sustainable development

  10. Developing Moral Sport Policies Through Act-Utilitarianism Based on Bentham’s Hedonic Calculus

    Directory of Open Access Journals (Sweden)

    ROBERT C. SCHNEIDER

    2010-01-01

    Full Text Available Moral policy can be developed and maintained in sport organizations through an approach that incorporates act-utilitarianism (AU based on Jeremy Bentham’s hedonic calculus (HC. Sport managers’ effective application of AU based on HC takes on the form of a holistic approach to moral policy development and maintenance and requires an under-standing of the parts and process of a strict adherence to AU based on HC. The traits of common sense, habits, and past experience are supported by the utilitarian views held by Bentham and Mill to accurately predict happiness and un-happiness that result from actions (Beauchamp, 1982 and are also necessary to drive a holistic approach of AU based on HC that develops and maintains moral policy in sport organizations.

  11. Route assessment using comparative risk factors integrated through a GIS

    International Nuclear Information System (INIS)

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

    1996-01-01

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

  12. Policy-Aware Sender Anonymity in Location-Based Services

    Science.gov (United States)

    Vyas, Avinash

    2011-01-01

    Sender anonymity in Location-based services (LBS) refers to hiding the identity of a mobile device user who sends requests to the LBS provider for services in her proximity (e.g. "find the nearest gas station etc."). The goal is to keep the requester's interest private even from attackers who (via hacking or subpoenas) gain access to the LBS…

  13. HIV testing for pregnant women: a rights-based analysis of national policies.

    Science.gov (United States)

    King, Elizabeth J; Maman, Suzanne; Wyckoff, Sarah C; Pierce, Matthew W; Groves, Allison K

    2013-01-01

    Ethical and human rights concerns have been expressed regarding the global shift in policies on HIV testing of pregnant women. The main purpose of this research was to conduct a policy analysis using a human rights-based approach of national policies for HIV testing of pregnant women. We collected HIV testing policies from 19 countries including: Cambodia, China, Guyana, Haiti, India, Jamaica, Kenya, Moldova, Papua New Guinea, Russian Federation, South Africa, Sudan, Swaziland, Tanzania, Ukraine, United States, Uzbekistan, Zambia and Zimbabwe. We analysed the HIV testing policies using a standardised framework that focused on government obligations to respect, protect and fulfil. Our results highlight the need for more attention to issues of pregnant women's autonomy in consenting to HIV testing, confidentiality in antenatal care settings and provision of counselling and care services. We conclude with a discussion about potential implications of the current testing policies and provide recommendations for ways that HIV testing policies can more effectively uphold the human rights of pregnant women.

  14. Policy design and performance of emissions trading markets: an adaptive agent-based analysis.

    Science.gov (United States)

    Bing, Zhang; Qinqin, Yu; Jun, Bi

    2010-08-01

    Emissions trading is considered to be a cost-effective environmental economic instrument for pollution control. However, the pilot emissions trading programs in China have failed to bring remarkable success in the campaign for pollution control. The policy design of an emissions trading program is found to have a decisive impact on its performance. In this study, an artificial market for sulfur dioxide (SO2) emissions trading applying the agent-based model was constructed. The performance of the Jiangsu SO2 emissions trading market under different policy design scenario was also examined. Results show that the market efficiency of emissions trading is significantly affected by policy design and existing policies. China's coal-electricity price system is the principal factor influencing the performance of the SO2 emissions trading market. Transaction costs would also reduce market efficiency. In addition, current-level emissions discharge fee/tax and banking mechanisms do not distinctly affect policy performance. Thus, applying emissions trading in emission control in China should consider policy design and interaction with other existing policies.

  15. The Effects of Teacher Efficacy, Teacher Certification Route, Content Hours in the Sciences, Field-Based Experiences and Class Size on Middle School Student Achievement

    Science.gov (United States)

    Salgado, Robina

    No Child Left Behind Act (NCLB) was signed into law in 2002 with the idea that all students, no matter the circumstances can learn and that highly qualified teachers should be present in every classrooms (United Stated Department of Education, 2011). The mandates of NCLB also forced states to begin measuring the progress of science proficiency beginning in 2007. The study determined the effects of teacher efficacy, the type of certification route taken by individuals, the number of content hours taken in the sciences, field-based experience and class size on middle school student achievement as measured by the 8th grade STAAR in a region located in South Texas. This data provides knowledge into the effect different teacher training methods have on secondary school science teacher efficacy in Texas and how it impacts student achievement. Additionally, the results of the study determined if traditional and alternative certification programs are equally effective in properly preparing science teachers for the classroom. The study described was a survey design comparing nonequivalent groups. The study utilized the Science Teaching Efficacy Belief Instrument (STEBI). A 25-item efficacy scale made up of two subscales, Personal Science Teaching Efficacy Belief (PSTE) and Science Teaching Outcome Expectancy (STOE) (Bayraktar, 2011). Once the survey was completed a 3-Way ANOVA, MANOVA, and Multiple Linear Regression were performed in SPSS to calculate the results. The results from the study indicated no significant difference between route of certification on student achievement, but a large effect size was reported, 17% of the variances in student achievement can be accounted for by route of certification. A MANOVA was conducted to assess the differences between number of science content hours on a linear combination of personal science teacher efficacy, science teaching outcome expectancy and total science teacher efficacy as measured by the STEBI. No significant

  16. An Object-Oriented Information Model for Policy-based Management of Distributed Applications

    NARCIS (Netherlands)

    Diaz, G.; Gay, V.C.J.; Horlait, E.; Hamza, M.H.

    2002-01-01

    This paper presents an object-oriented information model to support a policy-based management for distributed multimedia applications. The information base contains application-level information about the users, the applications, and their profile. Our Information model is described in details and

  17. Effects-based integrated assessment modelling for the support of European air pollution abatement policies

    NARCIS (Netherlands)

    Hettelingh, J.P.; Posch, M.; Slootweg, J.; Reinds, G.J.; Vries, de W.; Gall, Le A.; Maas, R.

    2015-01-01

    Critical load and exceedance based indicators for effects of air pollution are used to define and compare air pollution abatement scenarios, thus assisting in the framing of policies and strategies, of emission abatement options. In this chapter the effects-based support of European air pollution

  18. IMPACTS OF GROUP-BASED SIGNAL CONTROL POLICY ON DRIVER BEHAVIOR AND INTERSECTION SAFETY

    Directory of Open Access Journals (Sweden)

    Keshuang TANG

    2008-01-01

    Full Text Available Unlike the typical stage-based policy commonly applied in Japan, the group-based control (often called movement-based in the traffic control industry in Japan refers to such a control pattern that the controller is capable of separately allocating time to each signal group instead of stage based on traffic demand. In order to investigate its applicability at signalized intersections in Japan, an intersection located in Yokkaichi City of Mie Prefecture was selected as an experimental application site by the Japan Universal Traffic Management Society (UTMS. Based on the data collected at the intersection before and after implementing the group-based control policy respectively, this study evaluated the impacts of such a policy on driver behavior and intersection safety. To specify those impacts, a few models utilizing cycle-based data were first developed to interpret the occurrence probability and rate of red-light-running (RLR. Furthermore, analyses were performed on the yellow-entry time (Ye of the last cleared vehicle and post encroachment time (PET during the phase switching. Conclusions supported that the group-based control policy, along with certain other factors, directly or indirectly influenced the RLR behavior of through and right-turn traffics. Meanwhile, it has potential safety benefits as well, indicated by the declined Ye and increased PET values.

  19. Robust Allocation of Reserve Policies for a Multiple-Cell Based Power System

    DEFF Research Database (Denmark)

    Hu, Junjie; Lan, Tian; Heussen, Kai

    2018-01-01

    This paper applies a robust optimization technique for coordinating reserve allocations in multiple-cell based power systems. The linear decision rules (LDR)-based policies were implemented to achieve the reserve robustness, and consist of a nominal power schedule with a series of linear modifica...... in real time operation to make a trade off....

  20. Globalization, migration and labour: imperatives for a rights based policy

    OpenAIRE

    Taran, Patrick

    2011-01-01

    Migration has always been an essential component of economic development and social progress in many countries. Labour migration becomes one of the most important sources of regional integration, where regulation of labour migration is implemented at the regional level, for only such large integration unions that exploit the advantages of markets, resource bases and labour potentials amalgamation, can hold out against increasing competition within globalizing world. However, if migration is n...