WorldWideScience

Sample records for non-permit access routes

  1. An evaluation of rail access routes to Yucca Mountain

    Energy Technology Data Exchange (ETDEWEB)

    Sathisan, S.K.; Parentela, E.M. [Univ. of Nevada, Las Vegas, NV (United States)

    1994-12-31

    This paper provides a preliminary evaluation and characterization of potential rail routes for the transport of high level radioactive waste from their current storage locations (76 power plants and 4 federal facilities) to the proposed geologic repository at Yucca Mountain, Nevada. Individual routes were determined for shipments from each origin using the INTERLINE model. They were characterized in terms of shipment distance, number of transfers and states transversed. Additionally, specific routing constraints were imposed for a selected subset of the origins to address policy and operational alternatives such as minimizing shipment distance, number of transfers or number of states traversed. Results of the analysis indicate that the imposition of the routing constraint count result in reducing shipment distances, and the number of states traversed. But a tradeoff between these factors and the number of transfers exists.

  2. WIRELESS ADHOC MULTI ACCESS NETWORKS OPTIMIZATION USING OSPF ROUTING PROTOCOL BASED ON CISCO DEVICES

    Directory of Open Access Journals (Sweden)

    Mohamed E. Khedr

    2015-03-01

    Full Text Available One of the most attractive field for research for researchers and authors so the Wireless adhoc networks. So, this paper will describe the background and basic features of Open Short Path First (OSPF routing protocol due to multi-access networks. Explaining and practice on the OSPF configuration commands. Describe, modify and calculate the metric (Cost used by OSPF due to adhoc networks. Illustrating the Election parameters made by DR/BDR (Designated and Back Designated Routers used in multi-access wireless networks. This paper will use OSPF routing protocol because of its average administrative distance with all routing protocols.

  3. A routing-based solution to simulating an access point

    OpenAIRE

    Collins, Wayne E.

    1999-01-01

    Military environments require flexible network configurations that must adapt under dynamic and mobile operating conditions. Wireless data networks offer some solutions. A wireless network typically requires an access point to bridge network traffic between wireless and wired media. These devices though are often too inflexible for use in such dynamic conditions. One major problem is that they are dedicated to a single type of wired network, usually Ethernet, which prevents them from being us...

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

    Science.gov (United States)

    Sobek, Adam D.; Miller, Harvey J.

    2006-09-01

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

  5. 49 CFR 37.185 - Fleet accessibility requirement for OTRB fixed-route systems of large operators.

    Science.gov (United States)

    2010-10-01

    ... 49 Transportation 1 2010-10-01 2010-10-01 false Fleet accessibility requirement for OTRB fixed....185 Fleet accessibility requirement for OTRB fixed-route systems of large operators. Each large... percent of the buses in its fleet with which it provides fixed-route service are readily accessible to...

  6. Vascular access in resuscitation: is there a role for the intraosseous route?

    Science.gov (United States)

    Anson, Jonathan A

    2014-04-01

    Intraosseous vascular access is a time-tested procedure which has been incorporated into the 2010 American Heart Association Guidelines for Cardiopulmonary Resuscitation. Intravenous access is often difficult to achieve in shock patients, and central line placement can be time consuming. Intraosseous vascular access, however, can be achieved quickly with minimal disruption of chest compressions. Newer insertion devices are easy to use, making the intraosseous route an attractive alternative for venous access during a resuscitation event. It is critical that anesthesiologists, who are often at the forefront of patient resuscitation, understand how to properly use this potentially life-saving procedure.

  7. DataBus-based hybrid routing approach for orbit access networks in lunar exploration

    Science.gov (United States)

    Zeng, Hui; Meng, Ke; Deng, Julia

    2012-06-01

    One of the major challenges for lunar exploration missions is how to achieve dynamic and robust routing. To reduce the development cost, it is desirable to leverage existing technologies, such as routing in mobile ad hoc networks (MANETs) and delay tolerant networks (DTN). However, these technologies are developed for the Earth environment and hence need further investigation for the lunar environment. To support robust access and dynamic mission operations, we propose a DataBus-based Hybrid Routing (DBHR) approach that combines MANET reactive routing protocol (such as AODV) and DTN-based bundle delivery. Our DBHR approach is designed for a tiered architecture where remote nodes communicate with upper-tier gateways through data carriers (DataBus) using short-range radio interfaces. Our scheme explores the (non)availability of the end-to-end path between two peers using MANET routing and provides diverse route options based upon different parameters. This interaction between hop-by-hop DTN technologies and end-to-end MANET protocol will result in a reliable and robust routing protocol for orbit access and improve the overall communication capabilities. To evaluate its performance, we implemented our proposed scheme on commercial-off-theshelf (COTS) routers with the custom OpenWRT and tailored IBR-DTN bundle protocol distribution. The on-demand service request and grant mechanisms are also developed in our implementation to allow certain DTN nodes to reserve the future access opportunities. Finally, we demonstrate the achieved capabilities and performance gains through experiments on a hardware test bed that consists of several COTS routers with our implementation.

  8. 76 FR 76927 - Port Access Route Study: The Atlantic Coast From Maine to Florida

    Science.gov (United States)

    2011-12-09

    ... enclose a stamped, self-addressed postcard or envelope. We will consider all comments and material... SECURITY Coast Guard 33 CFR Part 167 Port Access Route Study: The Atlantic Coast From Maine to Florida AGENCY: Coast Guard, DHS. ACTION: Notice of study; reopening of the comment period. SUMMARY: The U.S...

  9. 76 FR 27288 - Port Access Route Study: The Atlantic Coast From Maine to Florida

    Science.gov (United States)

    2011-05-11

    ... enclose a stamped, self-addressed postcard or envelope. We will consider all comments and material... SECURITY Coast Guard 33 CFR Part 167 Port Access Route Study: The Atlantic Coast From Maine to Florida AGENCY: Coast Guard, DHS. ACTION: Notice of study; request for comments. SUMMARY: In order to provide...

  10. Analyzing the effect of routing protocols on media access control protocols in radio networks

    Energy Technology Data Exchange (ETDEWEB)

    Barrett, C. L. (Christopher L.); Drozda, M. (Martin); Marathe, A. (Achla); Marathe, M. V. (Madhav V.)

    2002-01-01

    We study the effect of routing protocols on the performance of media access control (MAC) protocols in wireless radio networks. Three well known MAC protocols: 802.11, CSMA, and MACA are considered. Similarly three recently proposed routing protocols: AODV, DSR and LAR scheme 1 are considered. The experimental analysis was carried out using GloMoSim: a tool for simulating wireless networks. The main focus of our experiments was to study how the routing protocols affect the performance of the MAC protocols when the underlying network and traffic parameters are varied. The performance of the protocols was measured w.r.t. five important parameters: (i) number of received packets, (ii) average latency of each packet, (iii) throughput (iv) long term fairness and (v) number of control packets at the MAC layer level. Our results show that combinations of routing and MAC protocols yield varying performance under varying network topology and traffic situations. The result has an important implication; no combination of routing protocol and MAC protocol is the best over all situations. Also, the performance analysis of protocols at a given level in the protocol stack needs to be studied not locally in isolation but as a part of the complete protocol stack. A novel aspect of our work is the use of statistical technique, ANOVA (Analysis of Variance) to characterize the effect of routing protocols on MAC protocols. This technique is of independent interest and can be utilized in several other simulation and empirical studies.

  11. IMS接入网关智能路由%IMS Access Gateway Intelligent Routing

    Institute of Scientific and Technical Information of China (English)

    马跃; 宋超

    2015-01-01

    在数字电话交换系统中设计IMS接入网关以解决目前将语音应用接入到CM-IMS网络中等问题,其中设计接入网关的智能路由支持在IP或TDM中继故障后自动重选,根据实际需求配置中继选路的策略以达到局间通信的可靠性和费用最低的要求。介绍了IMS接入网关的应用及研究现状,阐述Asterisk的具体情况,描述了IMS接入网关智能路由的功能,并给出智能路由的详细设计,路由的属性及数据结构的定义,最后结合 Asterisk 开源项目,实现了智能路由的功能,通过实验成功验证了智能路由按费率、优先级、轮转策略选择中继及号码变换的功能,达到了通信的可靠性及低费用的要求。%In the digital telephone switching system, designing an IMS access gateway is to solve the applications of voice access to the CM-IMS network. When IP or the TDM relay failed, the IMS access gateway intelligent routing can reconnect automatically. According to the actual configuration, the routing strategy can meet the reliability of communication and lowest cost. This paper introduces the application and research of IMS access gateway and expounds the situation of Asterisk. It describes the function of IMS access gateway intelligent routing and analyzes the design in detail, including the attributes of the routing and the definition of data structure. Finally, I realize the function of intelligent routing in combination with the Asterisk open source project. Choosing relay and number transform are verified by experiments. And the intelligent routing has reached the requirement of reliability and low cost.

  12. [Evaluation of the cost of home enteral nutrition in relation to different access routes].

    Science.gov (United States)

    Castillo Rabaneda, R M; Gómez Candela, C; de Cos Blanco, A I; González Fernández, B; Iglesias Rosado, C

    1998-01-01

    When home enteral nutrition is needed, there is still, despite the undisputed increase in the quality of life that can be achieved with a Percutaneous Endoscopic Gastrostomy (PEG), a reservation in its use because this technique and its maintenance is considered to be very costly. We aim to assess the true cost of home enteral nutrition using the oral route, a nasogastric tube, and PEG. The data of 65 patients who required home enteral nutrition during 1996, were analyzed retrospectively. The access route was a nasogastric tube in 20 cases, 18 patients had PEG, and 27 candidates used an oral route. The average age was 56 years. 50% were men and 50% were women. The most common diagnoses that led to the indication were oropharyngeal-maxillofacial neoplasms and neurological disorders. In all cases the material and formula used was assessed, as were the associated complications and the cost of the at home enteral nutrition. The average duration of the treatment was 175 +/- 128 days, and this was similar in all three groups. The average formula/day cost was slightly higher in the patients using the oral access route. The average total day cost and the average material/day cost was slightly higher in patients with a PEG. Patients with a PEG presented fewer complications than those with a nasogastric tube. The cost derived from possible complications must be higher in the nasogastric tube group, especially considering the repeated tube changes due to obstruction or loss. The cost of home enteral nutrition is slightly lower if one uses a nasogastric tube. The greater incidence of complications that were mild but required a tube change, in this case a nasogastric tube, suggests higher indirect costs. The oral route is associated with the need for special formulae that are more expensive.

  13. POSTEROSUPERIOR SURGICAL ACCESS ROUTE FOR TREATMENT OF ACROMIOCLAVICULAR DISLOCATIONS: RESULTS FROM 84 SURGICAL CASES.

    Science.gov (United States)

    Dal Molin, Danilo Canesin; Ribeiro, Fabiano Rebouças; Filho, Rômulo Brasil; Filardi, Cantídio Salvador; Tenor, Antonio Carlos; Stipp, Willian Nandi; Petros, Rodrigo Souto Borges

    2012-01-01

    To evaluate the results from surgical treatment of 84 cases of acute acromioclavicular dislocation, using a posterosuperior access route. Eighty-four cases of acute acromioclavicular dislocation (grade III in the Allman-Tossy classification) operated between November 2002 and May 2010 were evaluated. The patients' mean age was 34 years. The diagnoses were made using clinical and radiographic evaluations. The patients were operated by the same surgical team, within three weeks of the date of the trauma, using a posterosuperior approach to the shoulder to access the top of the base of the coracoid process for placement of two anchors, which were used in reducing the dislocation. The minimum follow-up was 12 months. The postoperative clinical-radiographic evaluation was done using the modified Karlsson criteria and the University of California at Los Angeles (UCLA) score. 92.8% of the 84 patients treated presented good or excellent results, and 7.2% presented fair or poor results, using the UCLA assessment score. According to the modified Karlsson criteria, 76.2% were assessed as grade A, 17.9% as grade B and 5.9% as grade C. The posterosuperior access route to the shoulder is a new option for accessing the coracoid process and treating acromioclavicular dislocation, with clinical and radiographic results equivalent to those in the literature.

  14. Accessibility of a cadeirante in a public institution of higher education: routes and routines

    Directory of Open Access Journals (Sweden)

    Rita de Cássia Silveira Cambruzzi

    2013-06-01

    Full Text Available The physical disability is group is heterogeneous, even within a “category”, since that covers a diversity, because each has a mechanism to organize in spaces in which attends but all participate of the same challenges. However, due to the challenges encountered by persons with disabilities in establishing routes and routines within a University is that we have developed this research. We chose search access of physically disabled person in your external displacement of student housing to the classroom and the classroom until the Secretariat Department that frequents. Research whose goal is the identification and analysis of routes as its accessibility, on the campus of a public institution of higher education. The survey was submitted to the Ethics Committee that approves their implementation. Direct observations were performed, as well as records via photos and footage, which were authorized by the University. The information collected were analyzed qualitatively as the standards of the Brazilian Association of technical norms and the guiding document for the Regional Council of engineering and architecture, Rio Grande do Sul, titled: Roadmap survey. In data analysis, we see that there are needs for providing accessibility with safety and convenience, as well as establish mechanisms for the community library and the University restaurant part of living as part of the University community and also, in the exercise of their constitutional rights.

  15. An accessibility graph-based model to optimize tsunami evacuation sites and routes in Martinique, France

    Science.gov (United States)

    Péroche, M.; Leone, F.; Gutton, R.

    2014-01-01

    The risk of tsunami threatens the whole Caribbean coastline especially the Lesser Antilles. The first available models of tsunami propagation estimate that the travel time from the closest seismic sources would only take few minutes to impact the Martinique Island. Considering this threat, the most effective measure is a planned and organized evacuation of the coastal population. This requires an efficient regional warning system, estimation of the maximum expected tsunami flood height, preparation of the population to evacuate, and drawing up of local and regional emergency plans. In order to produce an efficient evacuation plan, we have to assess the number of people at risk, the potential evacuation routes, the safe areas and the available time to evacuate. However, this essential information is still lacking in the French West Indies emergency plans. This paper proposes a model of tsunami evacuation sites accessibility for Martinique directly addressed to decision makers. It is based on a population database at a local scale, the development of connected graphs of roads, the identification of potential safe areas and the velocity setting for pedestrians. Evacuation routes are calculated using the Dijkstra's algorithm which gives the shortest path between areas at risk and designated evacuation sites. The first results allow us to map the theoretical times and routes to keep the exposed population safe and to compare these results with a tsunami travel time scenario.

  16. A Reinforcement Routing Algorithm with Access Selection in the Multi-Hop Multi-Interface Networks

    Science.gov (United States)

    Jafari, Amir Hosein; Shahhoseini, Hadi Shahriar

    2015-03-01

    In this paper, a routing algorithm is proposed for access selection in a network to find the optimal paths among intermediate nodes with multiple interfaces. Markov Decision Process is applied in each node to find optimal policy and select proper paths to the best access point in a dynamic environment. A reward function is defined as environment feedback to optimize and adapt routing behavior of nodes based on the local information. Selection metrics in each node are interface load, link quality and destination condition. It is shown, by using the proposed algorithm, there are better management in the node which decreases interference and collision and selects links with better quality toward the best possible destination. The performance of the method is exemplified and it is shown how the throughput and average delay of the network with more interface in its nodes, improved while packet loss degrades. As an example a two-interface and a one-interface network are studied. It is shown when network load is increased, interface management will improve the throughput, in the network with two-interface nodes. Also, by considering the link quality factor in the reward function, packet dropping becomes less but average delay increases.

  17. A Combined Solution for Routing and Medium Access Control Layer Attacks in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    R. Murugan

    2010-01-01

    Full Text Available Problem statement: In Mobile Ad hoc Network (MANET, both the routing layer and the Medium Access Control (MAC layer are vulnerable to several attacks. There are very few techniques to detect and isolate the attacks of both these layers simultaneously. In this study, we developed a combined solution for routing and MAC layer attacks. Approach: Our approach, makes use of three techniques simultaneously which consists of a cumulative frequency based detection technique for detecting MAC layers attacks, data forwarding behavior based detection technique for detecting packet drops and message authentication code based technique for packet modification. Results: Our combined solution presents a reputation value for detecting the malicious nodes and isolates them from further network participation till its revocation. Our approach periodically checks all nodes, including the isolated nodes, at regular time period λ. A node which recovers from its misbehaving condition is revoked to its normal condition after the time period λ. Conclusion/Recommendations: By simulation results, we show that our combined solution provides more security by increased packet delivery ratio and reduced packet drops. We also shown that our approach has less overhead compared to the existing technique.

  18. Sleeping Cluster based Medium Access Control Layer Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    T. R. Rangaswamy

    2012-01-01

    Full Text Available Wireless sensor networks play a vital role in remote area applications, where human intervention is not possible. In a Wireless Sensor Network (WSN each and every node is strictly an energy as well as bandwidth constrained one. Problem statement: In a standard WSN, most of the routing techniques, move data from multiple sources to a single fixed base station. Because of the greater number of computational tasks, the existing routing protocol did not address the energy efficient problem properly. In order to overcome the problem of energy consumption due to more number of computational tasks, a new method is developed. Approach: The proposed algorithm divides the sensing field into three active clusters and one sleeping cluster. The cluster head selection is based on the distance between the base station and the normal nodes. The Time Division Multiple Access (TDMA mechanism is used to make the cluster remain in the active state as well as the sleeping state. In an active cluster 50% of nodes will be made active and the remaining 50% be in sleep state. A sleeping cluster will be made active after a period of time and periodically changes its functionality. Results: Due to this periodic change of state, energy consumption is minimized. The performance of the Low Energy Adaptive and Clustering Hierarchy (LEACH algorithm is also analyzed, using a network simulator NS2 based on the number of Cluster Heads (CH, Energy consumption, Lifetime and the number of nodes alive. Conclusion: The simulation studies were carried out using a network simulation tool NS2, for the proposed method and this is compared with the performance of the existing protocol. The superiority of the proposed method is highlighted.

  19. Comparison of routes for achieving parenteral access with a focus on the management of patients with Ebola virus disease

    DEFF Research Database (Denmark)

    Ker, Katharine; Tansley, Gavin; Beecher, Deirdre

    2015-01-01

    BACKGROUND: Dehydration is an important cause of death in patients with Ebola virus disease (EVD). Parenteral fluids are often required in patients with fluid requirements in excess of their oral intake. The peripheral intravenous route is the most commonly used method of parenteral access......, but inserting and maintaining an intravenous line can be challenging in the context of EVD. Therefore it is important to consider the advantages and disadvantages of different routes for achieving parenteral access (e.g. intravenous, intraosseous, subcutaneous and intraperitoneal). OBJECTIVES: To compare......-Process & Other Non-Indexed Citations, Ovid MEDLINE(R) Daily, Ovid MEDLINE(R) and Ovid OLDMEDLINE(R), Embase Classic + Embase (OvidSP), CINAHL (EBSCOhost), clinicaltrials.gov and screened reference lists. SELECTION CRITERIA: Randomised controlled trials comparing different parenteral routes for the infusion...

  20. Impairments Computation for Routing Purposes in a Transparent-Access Optical Network Based on Optical CDMA and WDM

    Science.gov (United States)

    Musa, Ahmed

    2016-06-01

    Optical access networks are becoming more widespread and the use of multiple services might require a transparent optical network (TON). Multiplexing and privacy could benefit from the combination of wavelength division multiplexing (WDM) and optical coding (OC) and wavelength conversion in optical switches. The routing process needs to be cognizant of different resource types and characteristics such as fiber types, fiber linear impairments such as attenuation, dispersion, etc. as well as fiber nonlinear impairments such as four-wave mixing, cross-phase modulation, etc. Other types of impairments, generated by optical nodes or photonic switches, also affect the signal quality (Q) or the optical signal to noise ratio (OSNR), which is related to the bit error rate (BER). Therefore, both link and switch impairments must be addressed and somehow incorporated into the routing algorithm. However, it is not practical to fully integrate all photonic-specific attributes in the routing process. In this study, new routing parameters and constraints are defined that reflect the distinct characteristics of photonic networking. These constraints are applied to the design phase of TON and expressed as a cost or metric form that will be used in the network routing algorithm.

  1. A solvent evaporation route towards fabrication of hierarchically porous ZSM-11 with highly accessible mesopores

    DEFF Research Database (Denmark)

    Song, Wen; Liu, Zhiting; Liu, Liping

    2015-01-01

    A route to generate hierarchically porous zeolite ZSM-11 has been paved via solvent evaporation induced self-assembly assisted by hexadecyltrimethoxysilane to produce a preformed dry gel, followed by its subsequent transformation into zeolite via steam-assisted-crystallization. The crystallization...

  2. Symptomatic radial artery thrombosis successfully treated with endovascular approach via femoral access route

    Energy Technology Data Exchange (ETDEWEB)

    Pasha, Ahmed Khurshid [Department of Internal Medicine, University of Arizona (United States); Elder, Mahir D. [Heart and Vascular Institute, Detroit, MI (United States); Division of Cardiology, Wayne State University, Detroit, MI (United States); Malik, Umer Ejaz [Department of Internal Medicine, Texas Tech University Health Science Center at Permian Basin, TX (United States); Khalid, Abdullah Mian [Department of Internal Medicine, University of Pittsburg Medical Center, Mercy Hospital, Pittsburg, PA (United States); Noor, Zeeshan [Department of Internal Medicine, St. Joseph Mercy Hospital, Ann Arbor, MI (United States); Movahed, Mohammad Reza, E-mail: rmova@aol.com [Department of Internal Medicine, University of Arizona (United States); Sarver Heart Center, University of Arizona (United States); CareMore HealthCare, AZ (United States)

    2014-09-15

    Radial access has been increasingly utilized for coronary intervention due to higher safety profile in comparison to femoral access site with lower bleeding rate. Radial artery occlusion is not uncommon with radial access site. This usually does not lead to any harm due to ulnar artery collaterals that are sufficient to prevent hand ischemia and is usually left alone. However, in the case of significant hand ischemia, treatment is often necessary. We are reporting an interesting case of symptomatic radial artery thrombosis leading to arm ischemia that was successfully treated percutaneously using femoral access. Using femoral access for radial artery intervention has not been reported previously. This case is followed by review of the literature.

  3. Unsynchronized Energy-Efficient Medium Access Control and Routing in Wireless Sensor Networks

    Science.gov (United States)

    Hurni, Philipp

    This master thesis investigates optimizations on recently proposed fully unsynchronized power saving sensor MAC protocols. In contrast to many other sensor MAC protocols, unsynchronized sensor MAC protocols renounce on any kind of network- or cluster-wide synchronization for channel access coordination and maintenance of a common wake-sleep pattern, because in wireless sensor networks with low traffic requirements, the overhead for maintaining synchronization is likely to exceed the energy spent for the actual data traffic.

  4. The internal mammary vein: an alternate route for central venous access with an implantable port.

    Science.gov (United States)

    Jaime-Solis, E; Anaya-Ortega, M; Moctezuma-Espinosa, J

    1994-10-01

    Central venous catheterization in pediatric patients has, among other risks, flebitis and thrombosis, and finally occlusion of the superior and inferior venae cavae, making long-term catheterization and multiple venous cutdown more difficult. Use of the internal mammary vein might be an alternative procedure to provide sure and easy access to the central venous circulation. The authors report on a patient with multiple venous cutdown and thrombosis of the inferior vena cava, in whom the internal mammary vein was used for placement of a vascular device. The procedure is technically easy, and no special positioning of the patient is required.

  5. Fertility tourism: circumventive routes that enable access to reproductive technologies and substances.

    Science.gov (United States)

    Bergmann, Sven

    2011-01-01

    “Fertility tourism” is a journalistic eye‐catcher focusing on the phenomenon of patients who search for a reproductive treatment in another country in order to circumvent laws, access restrictions, or waiting lists in their home country. In Europe, the reasons why people seek reproductive treatments outside their national boundaries are quite diverse, in part because regulations differ so much among countries. Beginning with four examples of people who crossed borders for an in vitro fertilization (IVF) treatment with gamete donation, this article provides some insight into these transnational circumvention practices based on material from ethnographic fieldwork and interviews in Spain, Denmark, and the Czech Republic. In all three countries, gamete donation is made strictly anonymous. Clinical practices such as egg donor recruitment and phenotypical matching between donors and recipients serve to naturalize the substitution of gametes and to install social legitimacy through resemblance markers with the prospective child. In comparison to other areas of medical tourism, which are subjects of debate as a consequence of neoliberal health politics and international medical competition, mobility in the area of reproductive technologies is deeply intertwined with new forms of doing kinship. For prospective parents, it holds a promise of generating offspring who could pass as biogenetically conceived children. Therefore, IVF with gamete donation is mostly modeled after conceptions of nature. Through anonymity and concealment it creates forms of nonrelatedness that leave space for future imaginings and traces of transnational genetic creators.

  6. Useful access to enantiomerically pure protected inositols from carbohydrates: the aldohexos-5-uloses route

    Directory of Open Access Journals (Sweden)

    Felicia D’Andrea

    2016-11-01

    Full Text Available The intramolecular aldol condensation of aldohexos-5-ulose derivatives of the D-xylo and L-ribo stereoseries has been studied. Only one of the four possible inososes was isolated from both stereoseries in reasonable yields (30–38%. The results obtained, together with the previous findings for the L-arabino and L-lyxo stereoseries, allowed for the rationalisation of a mechanism of the reaction based on open-transition-state models and electron-withdrawing inductive effects. Complementary reductions of the intermediate inososes were possible by changing the reaction conditions, and two isomeric inositol derivatives were obtained with complete stereoselection from each inosose. The presented approach permits us to control the configuration of three out of the six stereocentres of the inositol frame and gives access to seven of the nine inositols. Noteworthy, for the D-xylo derivative, the two-step sequence (condensation followed by reduction with NaBH(OAc3 represents the biomimetic synthesis of myo-inositol. Furthermore, the sugar-based pathway leads directly to enantiomerically pure selectively protected inositols and does not require any desymmetrisation procedure which is needed when myo-inositol and other achiral precursors are employed as starting materials. As an example of application of the method, the indirect selective protection of secondary inositols’ hydroxy functions, by placing specific protecting groups on the aldohexos-5-ulose precursor has been presented.

  7. Design of Intelligent Cross-Layer Routing Protocols for Airborne Wireless Networks Under Dynamic Spectrum Access Paradigm

    Science.gov (United States)

    2011-05-01

    routing protocols require link layer detection and hello message to maintain multiple routes . Various single and multipath protocols , like AODV ... protocols (e.g., AODV , DSR, Optimized Link State Routing (OLSR) etc.) with and without link layer detection. The protocols with link layer detection...Reactive protocols like AODV tend to reduce the control traffic messages overhead at the cost of increased latency in finding new routes . AODV has a

  8. Qualitative identification of permitted and non-permitted color additives in cosmetics.

    Science.gov (United States)

    Miranda-Bermudez, Enio; Harp, Bhakti Petigara; Barrows, Julie N

    2014-01-01

    Color additives are dyes, pigments, or other substances that can impart color when added or applied to foods, drugs, cosmetics, medical devices, or the human body. These substances must be pre-approved by the U.S. Food and Drug Administration (FDA) and listed in the Code of Federal Regulations before they may be used in FDA-regulated products. Both domestic and imported cosmetic products sold in interstate commerce fall under FDA jurisdiction, and FDA's district laboratories use a combination of analytical methods for identifying or confirming the presence of potentially violative color additives. We have developed a qualitative method for identifying 29 water- and methanol-soluble color additives in various types of cosmetic products. The color additives are extracted with combinations of methylene chloride, methanol, acetic acid, and water and are identified by LC with photodiode array detection. Estimated LOD values ranged from 0.1 to 1.5 mg/L. A survey of lip products, nail polishes, eye products, blushes, body glitter, face paints, bath products, creams, and toothpastes identified permitted and non-permitted color additives. Our new LC method is intended to supplement the visible spectrophotometry and TLC methods currently used by FDA's district laboratories and will help optimize the use of time, labor, and solvents.

  9. Qualitative identification of permitted and non-permitted colour additives in food products.

    Science.gov (United States)

    Harp, Bhakti Petigara; Miranda-Bermudez, Enio; Baron, Carolina I; Richard, Gerald I

    2012-01-01

    Colour additives are dyes, pigments or other substances that can impart colour when added or applied to food, drugs, cosmetics, medical devices, or the human body. The substances must be pre-approved by the US Food and Drug Administration (USFDA) and listed in Title 21 of the US Code of Federal Regulations before they may be used in products marketed in the United States. Some also are required to be batch certified by the USFDA prior to their use. Both domestic and imported products sold in interstate commerce fall under USFDA jurisdiction, and the USFDA's district laboratories use a combination of analytical methods for identifying or confirming the presence of potentially violative colour additives. We have developed a qualitative method for identifying 17 certifiable, certification exempt, and non-permitted colour additives in various food products. The method involves extracting the colour additives from a product and isolating them from non-coloured components with a C(18) Sep-Pak cartridge. The colour additives are then separated and identified by liquid chromatography (LC) with photodiode array detection, using an Xterra RP18 column and gradient elution with aqueous ammonium acetate and methanol. Limits of detection (LODs) ranged from 0.02 to 1.49 mg/l. This qualititative LC method supplements the visible spectrophotometric and thin-layer chromatography methods currently used by the USFDA's district laboratories and is less time-consuming and requires less solvent compared to the other methods. The extraction step in the new LC method is a simple and an efficient process that can be used for most food types.

  10. 考虑设计规则的引脚分配算法%DRC-aware Pin Access Planning for Detailed Routing

    Institute of Scientific and Technical Information of China (English)

    王雨田; 贾小涛; 蔡懿慈; 周强

    2016-01-01

    详细布线是集成电路物理设计的关键步骤之一,引脚分配是影响详细布线质量和减少设计规则违反的关键因素,为此提出一种基于最小费用最大流的考虑设计规则的引脚分配算法。首先构建详细布线图和相应的网格图;然后在网格图上搜索布线区域内总费用最小的最大流,为所有线网的引脚同时分配pin点;在引脚分配的基础上提出一种拆线重布算法,针对引脚分配中不合理的pin点位置进行拆线重布,为其分配新的pin点,同时对设计规则违反从代价函数定义、拆线重布顺序、布线方式3个方面进行优化。实验结果表明,应用文中的引脚分配算法后,详细布线结果中的设计规则违反数平均减少了24%。%Detailed routing is one of the key steps in integrated circuit physical design. Pin access planning is a key factor affecting the quality of detailed routing result and reducing design rule check (DRC) violations. A pin access planning algorithm based on minimum cost maximum flow (MCMF) and taking DRC violations into ac-count is proposed. Firstly, it constructed detailed routing graph and corresponding grid graph. Then, all the pin access positions were assigned by searching MCMF of the routing area on the grid graph. On the basis of the above pin access planning algorithm, a rip-up and rerouting algorithm is proposed. New pin access positions were reassigned for the unreasonable ones when ripping-up and rerouting. DRC violation was taken into account as well. Algorithm was optimized with three aspects: the definition of cost function, the order of ripping-up and re-routing and the routing method. Experimental results show that DRC violations are decreased by 24% in average after using the algorithm.

  11. 76 FR 47529 - Port Access Route Study: In the Waters of Montauk Channel and Block Island Sound

    Science.gov (United States)

    2011-08-05

    ..., Long Island Sound, New York. This recommended route was subsequently incorporated on nautical charts by.... A navigation chart with the proposed recommendations plotted is included in the docket at...

  12. Performance assessment of flexible time-wavelength routing for a self-aggregating transparent Metro-access interface

    DEFF Research Database (Denmark)

    Wieckowski, M.; Osadchiy, Alexey Vladimirovich; Turkiewicz, J. P.;

    2009-01-01

    A time-WDM architecture with on-the-fly wavelength routing and traffic self-aggregation is proposed. Metro-accesss ligthpaths are established using ONUs with reflective modulators. Simulations results show the advantages of the proposed architecture......A time-WDM architecture with on-the-fly wavelength routing and traffic self-aggregation is proposed. Metro-accesss ligthpaths are established using ONUs with reflective modulators. Simulations results show the advantages of the proposed architecture...

  13. Performance assessment of flexible time-wavelength routing for a self-aggregating transparent Metro-access interface

    DEFF Research Database (Denmark)

    Wieckowski, M.; Osadchiy, Alexey Vladimirovich; Turkiewicz, J. P.

    2009-01-01

    A time-WDM architecture with on-the-fly wavelength routing and traffic self-aggregation is proposed. Metro-accesss ligthpaths are established using ONUs with reflective modulators. Simulations results show the advantages of the proposed architecture......A time-WDM architecture with on-the-fly wavelength routing and traffic self-aggregation is proposed. Metro-accesss ligthpaths are established using ONUs with reflective modulators. Simulations results show the advantages of the proposed architecture...

  14. 基于业务的光接入网路由选择算法%Algorithm of optical access network routing selection based on transmission business

    Institute of Scientific and Technical Information of China (English)

    孙立炜; 林峰

    2012-01-01

    Unlike optical backbone network, optical access network has its own characteristics and routing algorithms. An optical access network routing algorithm based on transmission business is proposed. Weighted graph model and sub-algorithm are made according to the style and importance of transmission business, by which the network resources is deployed appropriately. The results of engineering application demonstrate that the algorithm can enhance transmission quality.%光接入网有着不同于光骨干网的特点和问题,不能直接套用光骨干网的路由选择算法.提出了一种基于业务的光接入网的路由选择算法.其思想是根据业务类型和重要性构建不同的带权图模型,每一种模型采用相应的子算法,使整体资源得到合理配置.实践证明,该算法能够改善网络的传输质量.

  15. [Long-term development of Permacath Quinton catheters used as a vascular access route for extra-renal detoxification].

    Science.gov (United States)

    Dupont, D; Morinière, P; Pourchez, T; el Esper, N; Fournier, A

    1994-01-01

    Between July 1984 and July 1991, we have inserted surgically 147 Permcath Quinton catheters in 126 uremic patients for the following reasons: group I: necessity of hemodialysis without vascular access for acute (group Ia: 44 patients) or chronic renal failure (group Ib: 11 patients); group II: difficulty of creation or loss of vascular access (group II: 45 patients); group III: hemodialysis for patients with short life expectation or contraindications for vascular access on their limbs (group III: 26 patients). The duration of use (+/- SD and range) were respectively for each group: 1.6 +/- 2 (0-10); 3.4 +/- 2.8 (1-11); 7.4 +/- 11 (0-50); 6.7 +/- 8.7 (0.1-34.5) months. Seventeen patients (group IV) coming from groups Ib and II preferred to go on with the use of their catheter for 10.5 +/- 13.5 (0.1-50) months rather than to use their arteriovenous fistula. The complications observed on whole population were: 11 septicemia responsible of 2 deaths, 9 cutaneous local infections, 28 total obstructions of the catheter, 17 partial obstructions with insufficient flow; 10 destructions of the catheter. In conclusion the Permcath Quinton catheter is an adequate long term vascular access for hemodialysis. It is well tolerated since it is preferred to the usual arteriovenous fistula by many patients who have both. The incidence of infection is low. However, obstruction (partial ou total) is frequent (29%), necessitating local fibrinolytic treatment.

  16. Effect of Poor Access to Water and Sanitation As Risk Factors for Soil-Transmitted Helminth Infection: Selectiveness by the Infective Route.

    Directory of Open Access Journals (Sweden)

    Adriana Echazú

    2015-09-01

    Full Text Available Soil-transmitted helminth (STH infections are a public health problem in resource-limited settings worldwide. Chronic STH infection impairs optimum learning and productivity, contributing to the perpetuation of the poverty-disease cycle. Regular massive drug administration (MDA is the cardinal recommendation for its control; along with water, sanitation and hygiene (WASH interventions. The impact of joint WASH interventions on STH infections has been reported; studies on the independent effect of WASH components are needed to contribute with the improvement of current recommendations for the control of STH. The aim of this study is to assess the association of lacking access to water and sanitation with STH infections, taking into account the differences in route of infection among species and the availability of adequate water and sanitation at home.Cross-sectional study, conducted in Salta province, Argentina. During a deworming program that enrolled 6957 individuals; 771 were randomly selected for stool/serum sampling for parasitological and serological diagnosis of STH. Bivariate stratified analysis was performed to explore significant correlations between risk factors and STH infections grouped by mechanism of entry as skin-penetrators (hookworms and Strongyloides stercoralis vs. orally-ingested (Ascaris lumbricoides and Trichuris trichiura. After controlling for potential confounders, unimproved sanitation was significantly associated with increased odds of infection of skin-penetrators (adjusted odds ratio [aOR] = 3.9; 95% CI: 2.6-5.9. Unimproved drinking water was significantly associated with increased odds of infection of orally-ingested (aOR = 2.2; 95% CI: 1.3-3.7.Lack of safe water and proper sanitation pose a risk of STH infections that is distinct according to the route of entry to the human host used by each of the STH species. Interventions aimed to improve water and sanitation access should be highlighted in the recommendations

  17. Acesso vascular por via intraóssea em emergências pediátricas Vascular access through the intraosseous route in pediatric emergencies

    Directory of Open Access Journals (Sweden)

    Ricardo Américo Ribeiro de Sá

    2012-12-01

    Full Text Available A obtenção do acesso venoso em crianças gravemente enfermas é um procedimento essencial para o restabelecimento da volemia e a administração de fármacos nas emergências pediátricas. A primeira opção para obtenção de acesso vascular é pela punção de uma veia periférica. Quando essa via não pode ser utilizada ou sua obtenção se torna demorada, a via intraóssea consiste em efetiva opção para obtenção de um acesso venoso rápido e seguro. O presente estudo possui caráter descritivo e exploratório, realizado por meio de pesquisa bibliográfica, com o objetivo de descrever os princípios técnicos, as atribuições profissionais e os cuidados relacionados à obtenção do acesso venoso pela via intraóssea em emergências pediátricas. Foram selecionados 22 artigos disponibilizados nas bases de dados LILACS e MEDLINE e na biblioteca eletrônica SciELO, publicados entre o período de 2000 a 2011, além do protocolo vigente de ressuscitação cardiopulmonar da American Heart Association, de 2010. Após a leitura das publicações, os dados foram agrupados, possibilitando a construção de cinco categorias de análise: aspectos históricos e princípios fisiológicos; indicações, vantagens e contraindicações; atribuições dos profissionais; princípios técnicos; cuidados com o acesso; e possíveis complicações. Os resultados desse estudo mostraram que a via intraóssea consolida-se, hoje, como uma segunda opção de acesso vascular no atendimento a emergências, por ser uma técnica de fácil e rápida execução, apresentar vários sítios de punção não colapsáveis e permitir que a administração de fármacos e a reposição volêmica sejam rápidas e eficazes.Obtaining venous access in critically ill children is an essential procedure to restore blood volume and administer drugs during pediatric emergencies. The first option for vascular access is through a peripheral vein puncture. If this route cannot be used

  18. Hardware Routing Lookup with SDRAMT

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The authors present a routing lookup architecture, SDIR(SDRAM based Direct Index Routing). With pipeline and interleaving access technique, SDIR can provide scalable lookup speed from 16.7 MPPS(megapacket per second) to 133 MPPS with SDRAM running at 133MHz frequency.

  19. 76 FR 67395 - Port Access Route Study: In the Approaches to Los Angeles-Long Beach and in the Santa Barbara...

    Science.gov (United States)

    2011-11-01

    ... Pacific Ocean, particularly the area south of San Miguel, Santa Rosa, Santa Cruz, and Anacapa Islands; and north of San Nicolas, Santa Barbara, and Santa Catalina Islands where an increase in vessel traffic has..., precautionary areas, and deep-water routes. SUPPLEMENTARY INFORMATION: Background and Purpose The Coast...

  20. Optimising locational access of deprived populations to farmers’ markets at a national scale: one route to improved fruit and vegetable consumption?

    Directory of Open Access Journals (Sweden)

    Amber L. Pearson

    2013-07-01

    Full Text Available Background. Evidence suggests that improved locational access to farmers’ markets increases fruit and vegetable (FV consumption, particularly for low-income groups. Therefore, we modelled potential alternative distributions of farmers’ markets in one country (New Zealand to explore the potential impact for deprived populations and an indigenous population (Māori. Methods. Data were collected on current farmers’ markets (n = 48, population distributions, area deprivation, and roads. Geographic analyses were performed to optimize market locations for the most deprived populations. Results. We found that, currently, farmers’ markets provided fairly poor access for the total population: 7% within 12.5 km (15 min driving time; 5% within 5 km; and 3% within 2 km. Modelling the optimal distribution of the 48 markets substantially improved access for the most deprived groups: 9% (vs 2% currently within 12.5 km; 5% (vs 1% within 5 km; and 3% (vs 1% within 2 km. Access for Māori also improved: 22% (vs 7% within 12.5 km; 12% (vs 4% within 5 km; and 6% (vs 2% within 2 km. Smaller pro-equity results arose from optimising the locations of the 18 least pro-equity markets or adding 10 new markets. Conclusion. These results highlight the potential for improving farmers’ market locations to increase accessibility for groups with low FV consumption. Given that such markets are easily established and relocated, local governments could consider these results to inform decisions, including subsidies for using government land and facilities. Such results can also inform central governments planning around voucher schemes for such markets and exempting them from taxes (e.g., VAT/GST.

  1. Preferential use of unobstructed lateral portals as the access route to the pore of human ATP-gated ion channels (P2X receptors).

    Science.gov (United States)

    Samways, Damien S K; Khakh, Baljit S; Dutertre, Sébastien; Egan, Terrance M

    2011-08-16

    P2X receptors are trimeric cation channels with widespread roles in health and disease. The recent crystal structure of a P2X4 receptor provides a 3D view of their topology and architecture. A key unresolved issue is how ions gain access to the pore, because the structure reveals two different pathways within the extracellular domain. One of these is the central pathway spanning the entire length of the extracellular domain and covering a distance of ≈70 Å. The second consists of three lateral portals, adjacent to the membrane and connected to the transmembrane pore by short tunnels. Here, we demonstrate the preferential use of the lateral portals. Owing to their favorable diameters and equivalent spacing, the lateral portals split the task of ion supply threefold and minimize an ion's diffusive path before it succumbs to transmembrane electrochemical gradients.

  2. Via de acesso cirúrgico posterossuperior para o tratamento das luxações acromioclaviculares: resultados de 84 casos operados Posterosuperior surgical access route for treatment of acromioclavicular dislocations: results from 84 surgical cases

    Directory of Open Access Journals (Sweden)

    Danilo Canesin Dal Molin

    2012-10-01

    Full Text Available OBJETIVO: Avaliar os resultados do tratamento cirúrgico de 84 luxações acromioclaviculares agudas com a utilização da via de acesso posterossuperior do ombro. MÉTODOS: Foram avaliados 84 casos de luxações acromioclaviculares agudas grau III da classificação de Allman-Tossy operados de novembro de 2002 a maio de 2010. A média de idade dos pacientes foi de 34 anos. O diagnóstico foi realizado por avaliação clínica e radiográfica. Os pacientes foram operados pela mesma equipe cirúrgica em até três semanas da data do trauma realizando-se a via de acesso posterossuperior do ombro com acesso ao topo da base do processo coracoide para colocação de duas âncoras utilizadas na redução da luxação. O seguimento mínimo foi de 12 meses. A avaliação clínica-radiográfica pós-operatória foi realizada pelos critérios de Karlsson modificados e do escore da Universidade da Califórnia em Los Angeles (UCLA. RESULTADOS: Dos 84 pacientes operados, 92,8% apresentavam resultados bons ou excelentes e 7,2% de resultados regulares ou fracos pelo escore de avaliação da UCLA. Pelos critérios de Karlsson modificados 76,2% foram avaliados como grau A, 17,9% como grau B e 5,9% como grau C. CONCLUSÃO: A VIA de acesso posterossuperior do ombro é uma nova opção para acesso ao processo coracoide e tratamento das luxações acromioclaviculares, com resultados clínicos e radiográficos equivalentes aos da literatura.OBJECTIVE: To evaluate the results from surgical treatment of 84 cases of acute acromioclavicular dislocation, using a posterosuperior access route. METHODS: Eighty-four cases of acute acromioclavicular dislocation (grade III in the Allman-Tossy classification operated between November 2002 and May 2010 were evaluated. The patients' mean age was 34 years. The diagnoses were made using clinical and radiographic evaluations. The patients were operated by the same surgical team, within three weeks of the date of the trauma, using a

  3. Hurricane Evacuation Routes

    Data.gov (United States)

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

  4. Lateralization of route continuation and route order

    NARCIS (Netherlands)

    Van Der Ham, Ineke J M; Van Den Hoven, Jacco

    2014-01-01

    Navigation is a complex cognitive ability and its structure is still poorly understood. Memory for route continuation and route order are hypothesized to be at least partially separate components of navigation ability. In the current experiment, participants studied a route in virtual reality. The d

  5. Wireless Mesh Network Routing Under Uncertain Demands

    Science.gov (United States)

    Wellons, Jonathan; Dai, Liang; Chang, Bin; Xue, Yuan

    Traffic routing plays a critical role in determining the performance of a wireless mesh network. Recent research results usually fall into two ends of the spectrum. On one end are the heuristic routing algorithms, which are highly adaptive to the dynamic environments of wireless networks yet lack the analytical properties of how well the network performs globally. On the other end are the optimal routing algorithms that are derived from the optimization problem formulation of mesh network routing. They can usually claim analytical properties such as resource use optimality and throughput fairness. However, traffic demand is usually implicitly assumed as static and known a priori in these problem formulations. In contrast, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, to apply the optimization-based routing solution in practice, one must take into account the dynamic and uncertain nature of wireless traffic demand. There are two basic approaches to address the traffic uncertainty in optimal mesh network routing (1) predictive routing that infers the traffic demand with maximum possibility based in its history and optimizes the routing strategy based on the predicted traffic demand and (2) oblivious routing that considers all the possible traffic demands and selects the routing strategy where the worst-case network performance could be optimized. This chapter provides an overview of the optimal routing strategies for wireless mesh networks with a focus on the above two strategies that explicitly consider the traffic uncertainty. It also identifies the key factors that affect the performance of each routing strategy and provides guidelines towards the strategy selection in mesh network routing under uncertain traffic demands.

  6. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...... of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...

  7. Visualizing Internet routing changes.

    Science.gov (United States)

    Lad, Mohit; Massey, Dan; Zhang, Lixia

    2006-01-01

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

  8. Routing in opportunistic networks

    CERN Document Server

    Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

    2013-01-01

    This book provides a comprehensive guide to selected topics, both ongoing and emerging, in routing in OppNets. The book is edited by worldwide technical leaders, prolific researchers and outstanding academics, Dr. Isaac Woungang and co-editors, Dr. Sanjay Kumar Dhurandher, Prof. Alagan Anpalagan and Prof. Athanasios Vasilakos. Consisting of contributions from well known and high profile researchers and scientists in their respective specialties, the main topics that are covered in this book include mobility and routing, social-aware routing, context-based routing, energy-aware routing, incentive-aware routing, stochastic routing, modeling of intermittent connectivity, in both infrastructure and infrastructure-less OppNets. Key Features: Discusses existing and emerging techniques for routing in infrastructure and infrastructure-less OppNets. Provides a unified covering of otherwise disperse selected topics on routing in infrastructure and infrastructure-less OppNets.  Includes a set of PowerPoint slides and g...

  9. 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 on Metacyclic Graphs

    Institute of Scientific and Technical Information of China (English)

    Wenjun Xiao

    2002-01-01

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

  11. Intraosseous (IO) route .

    African Journals Online (AJOL)

    All drugs and fluids given via intravenous route were safely given through IO route with superior to ... was used widely during the Korean War, In 1950-1960. Intravenous ... In this article a brief review and analysis of cases managed by IO route ...

  12. Secure Routing and Identifying Hacking In P2p System

    Directory of Open Access Journals (Sweden)

    Gowsiga Subramaniam

    2014-08-01

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

  13. Route Scherrer and Route Einstein closed for construction work

    CERN Multimedia

    2015-01-01

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

  14. Route Scherrer and Route Einstein closed for construction work

    CERN Multimedia

    2015-01-01

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

  15. IPv6 Network Mobility Route Optimization Survey

    Directory of Open Access Journals (Sweden)

    Samer S. Hassan

    2011-01-01

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

  16. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

  17. Vehicle Routing in Practice

    OpenAIRE

    Hasle, Geir

    2010-01-01

    Solving the Vehicle Routing Problem (VRP) is a key to efficiency in transportation and supply chain management. The VRP is a computationally hard problem that comes in many guises. The VRP literature contains thousands of papers, and VRP research is regarded as one of the great successes of OR. In industry and the public sector, vehicle routing tools provide substantial savings every day. An industry of routing tool vendors has emerged. Exact optimization methods of today cannot consistently ...

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

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

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2005-01-01

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

  2. A New Route Maintenance in Dynamic Source Routing Protocol

    CERN Document Server

    Shukla, Ashish

    2010-01-01

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

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

  4. IP Routing Protocols

    Science.gov (United States)

    Nolasco Pinto, Armando

    2002-03-01

    Uyless Black is a widely known expert in computer networks and data communications. He is author of more than ten books in the communication technologies field, which puts him in a good position to address this topic. In IP Routing Protocols he starts by providing the background and concepts required for understanding TCP/IP technology. This is done clearly and assumes little prior knowledge of the area. As might be expected, he emphasizes the IP route discovery problem. Later he details several routing protocols.

  5. Cumulative Vehicle Routing Problems

    OpenAIRE

    Kara, &#;mdat; Kara, Bahar Yeti&#;; Yeti&#;, M. Kadri

    2008-01-01

    This paper proposes a new objective function and corresponding formulations for the vehicle routing problem. The new cost function defined as the product of the distance of the arc and the flow on that arc. We call a vehicle routing problem with this new objective function as the Cumulative Vehicle Routing Problem (CumVRP). Integer programming formulations with O(n2) binary variables and O(n2) constraints are developed for both collection and delivery cases. We show that the CumVRP is a gener...

  6. Class network routing

    Science.gov (United States)

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

    2009-09-08

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

  7. Integrated route analysis

    National Research Council Canada - National Science Library

    1981-01-01

    The integrated route analysis provides a data base for the second phase of the Arctic Pilot Project, the selection of a shipping corridor over which LNG icebreaking carriers will transport liquified...

  8. Routes and Stations

    Data.gov (United States)

    Department of Homeland Security — he Routes_Stations table is composed of fixed rail transit systems within the Continental United States, Alaska, Hawaii, the District of Columbia, and Puerto Rico....

  9. Routed planar networks

    Directory of Open Access Journals (Sweden)

    David J. Aldous

    2016-04-01

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

  10. Industrial Vehicle Routing

    OpenAIRE

    Hasle, Geir

    2008-01-01

    Solving the Vehicle Routing Problem (VRP) is a key to efficiency in transportation and supply chain management. The VRP is a computationally hard problem that comes in many guises. The VRP literature contains thousands of papers, and VRP research is regarded as one of the great successes of OR. An industry of routing tool vendors has emerged. Exact optimization methods of today cannot consistently solve VRP instances with more than 50-100 customers in reasonable time, which is generally a sma...

  11. GIS for the Valorization of Hardly Accessible Alpine Areas with Complex Potentials for Tourism, with a View to Their Inclusion in Tourist Routes. Development of the Valleys of Lotru and Olteţ

    Directory of Open Access Journals (Sweden)

    OANA POPESCU

    2008-01-01

    Full Text Available VALOT originates in the experience of European countries from the Alpine Space that succeeded to establish three top priorities for hardly accessible mountain areas based on communitarian programs (Natura 2000, Interreg IIIB – AlpNa Tour, VIADVENTURE, RegioMarket, etc.: competitiveness and attractiveness of the Alpine Space, accessibility and connectivity between high altitude settlements, environmental protection and prevention of natural hazards and disasters (snow falls, land slides, etc.. Starting from the project of Law on Approving the National Spatial Plan – Section VI – Tourism, the project aims at evaluating the current resources of hardly accessible mountain areas with complex potentials for tourism according to the experience of the European Union. GIS analysis will underline national/regional disparities of these areas, leading to conclusions on their typology and intervention proposals. The second part will focus on a case study of a hardly accessible area with a high landscape value and still un-valorized potentials for tourism. The existing situation of the area between the Lotru and Parâng mountains, consisting of the territories of four communes and a city, belonging to the counties of Vâlcea and Gorj, will be analyzed. Based on a spatial development scenario using selected statistical and geographic indicators, intervention priorities will be analyzed with the SPATIAL ANALYST, as well as funding possibilities for the creation of a cluster of mountain resorts (Rânca, Vidra, Voineasa in order to valorize the recreational and balneary patrimony of the area, observing principles and objectives of sustainable development in mountain areas. The project will create a methodology for diagnosing problems and dysfunctions of such areas, development possibilities based on the experience of the pilot study, proposals for improving the institutional framework for implementing, monitoring and evaluating the results and (last but not

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

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    2013-01-01

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

  13. Modeling Routing Overhead Generated by Wireless Reactive Routing Protocols

    CERN Document Server

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

    2011-01-01

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

  14. Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols

    CERN Document Server

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

    2011-01-01

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

  15. 23 CFR 658.19 - Reasonable access.

    Science.gov (United States)

    2010-04-01

    ... 23 Highways 1 2010-04-01 2010-04-01 false Reasonable access. 658.19 Section 658.19 Highways... AND WEIGHT, ROUTE DESIGNATIONS-LENGTH, WIDTH AND WEIGHT LIMITATIONS § 658.19 Reasonable access. (a) No State may enact or enforce any law denying reasonable access to vehicles with dimensions authorized...

  16. Advanced routing protocols for wireless networks

    CERN Document Server

    Campista , Miguel Elias Mitre

    2014-01-01

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

  17. Location-routing problems

    Energy Technology Data Exchange (ETDEWEB)

    Laporte, G.

    1987-01-01

    Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. This paper presents a survey of such problems. It includes some applications and examples of location-routing problems, a description of the main heuristics that have been developed for such problems, and reviews of various formulations and algorithms used in solving these problems. A more detailed review is given of exact algorithms for the vehicle routing problem, three-index vehicle flow formulations, and two-index vehicle flow formulations and algorithms for symmetrical and non-symmetrical problems. It is concluded that location-routing problem research is a fast-growing area, with most developments occurring over the past few years; however, research is relatively fragmented, often addresses problems which are too specific and contains several voids which have yet to be filled. A number of promising research areas are identified. 137 refs., 3 figs.

  18. Multihop Wireless Networks Opportunistic Routing

    CERN Document Server

    Zeng, Kai; Li, Ming

    2011-01-01

    This book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the technological challenges lying behind opportunistic routing. The authors cover many fundamental research issues for this new concept, including the basic principles, performance limit and performance improvement of opportunistic routing compared to traditional routing, energy efficiency and distributed opportunistic routing protocol desig

  19. Optimizing well intervention routes

    Energy Technology Data Exchange (ETDEWEB)

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

    2000-07-01

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

  20. Collective network routing

    Science.gov (United States)

    Hoenicke, Dirk

    2014-12-02

    Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

  1. Efficient Load Balancing Routing Technique for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Mahdi Abdulkader Salem

    2016-05-01

    Full Text Available The mobile ad hoc network (MANET is nothing but the wireless connection of mobile nodes which provides the communication and mobility among wireless nodes without the need of any physical infrastructure or centralized devices such as access point or base station. The communication in MANET is done by routing protocols. There are different categories of routing protocols introduced with different goals and objectives for MANETs such as proactive routing protocols (e.g. DSDV, reactive routing protocols (e.g. ADOV, geographic routing protocols (e.g. GRP, hybrid routing protocols etc. There are two important research problems with such routing protocols to address such as efficient load balancing and energy efficiency. In this paper, we are focusing on evaluation and analysis of efficient load balancing protocol design for MANET. Inefficient load balancing technique results in increasing routing overhead, poor packet delivery ratio, and other Quality of Service (QoS parameters. In literature, there are a number of different methods proposed for improving the performance of routing protocols by efficient load balancing among mobile nodes communication. However, most of the methods suffer from various limitations. In this paper, we propose a novel technique for improved the QoS performance of load balancing approach as well as increasing the network lifetime. Evaluation of Network lifetime is out of scope of this paper.

  2. SET-Routes programme

    CERN Document Server

    CERN audiovisual service

    2009-01-01

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

  3. SET-Routes programme

    CERN Multimedia

    Marietta Schupp, EMBL Photolab

    2008-01-01

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

  4. Whirlpool routing for mobility

    KAUST Repository

    Lee, Jung Woo

    2010-01-01

    We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP\\'s design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP\\'s behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP\\'s packet drop rate is up to 90% lower while sending up to 90% fewer packets.

  5. Vehicle Routing Problem Models

    Directory of Open Access Journals (Sweden)

    Tonči Carić

    2004-01-01

    Full Text Available The Vehicle Routing Problem cannot always be solved exactly,so that in actual application this problem is solved heuristically.The work describes the concept of several concrete VRPmodels with simplified initial conditions (all vehicles are ofequal capacity and start from a single warehouse, suitable tosolve problems in cases with up to 50 users.

  6. Reliable Internet Routing

    Science.gov (United States)

    2011-09-01

    reconfigurations. Proposals that optimize OSPF or IS-IS link weights with failures in mind, such as [34] and [72], must rely on shortest path IGP routing...tolerant layer 2 data center network fabric. In Proc. of ACM SIGCOMM, pages 39–50, 2009. [72] A. Nucci, S. Bhattacharyya, N. Taft, and C. Diot. IGP link

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

    Directory of Open Access Journals (Sweden)

    Jan Malte Wiener

    2012-05-01

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

  8. Increasingly minimal bias routing

    Energy Technology Data Exchange (ETDEWEB)

    Bataineh, Abdulla; Court, Thomas; Roweth, Duncan

    2017-02-21

    A system and algorithm configured to generate diversity at the traffic source so that packets are uniformly distributed over all of the available paths, but to increase the likelihood of taking a minimal path with each hop the packet takes. This is achieved by configuring routing biases so as to prefer non-minimal paths at the injection point, but increasingly prefer minimal paths as the packet proceeds, referred to herein as Increasing Minimal Bias (IMB).

  9. Electronic route information panels (DRIPs).

    NARCIS (Netherlands)

    2008-01-01

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

  10. A Survey of Unipath Routing Protocols for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    M.Barveen Banu

    2013-12-01

    Full Text Available A MANET (Mobile Ad hoc NETwork is an interconnection of mobile devices by wireless links forming a dynamic topology without much physical network infrastructure such as routers, servers, access points/cables or centralized administration. Routing is a mechanism of exchanging data between the source node and the destination node. Several protocols are used to perform routing the information from the source node to the destination node. The main aim of this paper is to explore the working principles of each unipath routing protocol. The unipath routing protocols are divided into Table-Driven (Proactive, On-demand (Reactive, Hybrid routing protocols.

  11. Effective local dynamic routing strategy for air route networks

    Institute of Scientific and Technical Information of China (English)

    Wu Wenjun; Zhao Lingxi

    2015-01-01

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

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

  13. Personal continuous route pattern mining

    Institute of Scientific and Technical Information of China (English)

    Qian YE; Ling CHEN; Gen-cai CHEN

    2009-01-01

    In the daily life, people often repeat regular routes in certain periods. In this paper, a mining system is developed to find the continuous route patterns of personal past trips. In order to count the diversity of personal moving status, the mining system employs the adaptive GPS data recording and five data filters to guarantee the clean trips data. The mining system uses a client/server architecture to protect personal privacy and to reduce the computational load. The server conducts the main mining procedure but with insufficient information to recover real personal routes. In order to improve the scalability of sequential pattern mining, a novel pattern mining algorithm, continuous route pattern mining (CRPM), is proposed. This algorithm can tolerate the different disturbances in real routes and extract the frequent patterns. Experimental results based on nine persons' trips show that CRPM can extract more than two times longer route patterns than the traditional route pattern mining algorithms.

  14. Storage and flood routing

    Science.gov (United States)

    Carter, R.W.; Godfrey, R.G.

    1960-01-01

    The basic equations used in flood routing are developed from the law of continuity. In each method the assumptions are discussed to enable the user to select an appropriate technique. In the stage-storage method the storage is related to the mean gage height in the reach under consideration. In the discharge-storage method the storage is determined, from weighted values of inflow and outflow discharge. In the reservoir-storage method the storage is considered as a function of outflow discharge alone. A detailed example is given for each method to illustrate that particular technique.

  15. Instability Free Routing: Beyond One Protocol Instance

    Science.gov (United States)

    2008-12-01

    assigned a Rout- ing Information Base (RIB) [13]. This database is used to store the routing information related to the routing process (e.g., routes...presents routing anomalies that can derive from route selection by itself, i.e., without any route redis - tribution configured between the routing... redis - tributed into the RIP protocol, all RIP messages received from the neighbors are in fact discarded independently of the AD values. This

  16. New Routing Metrics for ADHOC Network Routing Protocols

    Science.gov (United States)

    Reddy, P. C.

    2014-12-01

    The performance and reliability of Internet is measured using different quantities. When the quantities measured are essential and have wide range of acceptance then they are called metrics. Performance metrics enable comparison and selection among the alternatives. In computer networks, metrics are used to evaluate an application, protocol etc. Routing in adhoc networks is nontrivial. Routing protocols for adhoc networks are still evolving and there is need for continuous evaluation of them. In the literature existing, several routing protocols are evaluated using standard metrics under different conditions. This paper proposes new metrics for evaluation of routing protocols and uses them to evaluate the adhoc network routing protocols AODV, DSR, DSDV and TORA. Simulation environment is created using NS-2 simulator. Typical range of speeds, pause times and data rates are used. The results provide new insights in to the working of the routing protocols.

  17. 14 CFR 121.115 - Route width.

    Science.gov (United States)

    2010-01-01

    ... Route width. (a) Routes and route segments over Federal airways, foreign airways, or advisory routes have a width equal to the designated width of those airways or advisory routes. Whenever the... clearance. (2) Minimum en route altitudes. (3) Ground and airborne navigation aids. (4) Air traffic density...

  18. An overview of smart grid routing algorithms

    Science.gov (United States)

    Wang, Junsheng; OU, Qinghai; Shen, Haijuan

    2017-08-01

    This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.

  19. Reverse flood routing with the inverted Muskingum storage routing scheme

    OpenAIRE

    A. D. Koussis; K. Mazi; S. Lykoudis; Argiriou, A. A.

    2012-01-01

    This work treats reverse flood routing aiming at signal identification: inflows are inferred from observed outflows by orienting the Muskingum scheme against the wave propagation direction. Routing against the wave propagation is an ill-posed, inverse problem (small errors amplify, leading to large spurious responses); therefore, the reverse solution must be smoothness-constrained towards stability and uniqueness (regularised). Theoretical constrains on the coefficients of the reverse routing...

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

  1. Acesso venoso trans-hepático percutâneo para hemodiálise: uma alternativa para pacientes portadores de insuficiência renal crônica Percutaneous transhepatic venous access for hemodialysis: an alternative route for patients with end-stage renal failure

    Directory of Open Access Journals (Sweden)

    Joaquim Maurício da Motta-Leal-Filho

    2010-09-01

    . OBJECTIVES: To present a small sample regarding the possibility and the functionality of transhepatic implantation of long-term catheters for hemodialysis in patients with no other possible access routes. METHODS: Retrospective observational analysis was made of the charts of six patients in which nine tunneled dialysis catheters were implanted by the percutaneous transhepatic route. Transhepatic catheters were placed in the absence of an available peripheral venous site. Patients were monitored to evaluate technical success, the complication rate, the infection rate and the duration of catheter patency. RESULTS: Four men and two women aged 31 to 85 years (mean age: 55 years. Technical success was 100%. The mean duration of catheter function was 300.5 days (range: 2 to 814 days. Means of primary and secondary patency were 179.60 and 328.33 days, respectively. The catheter thrombosis rate was 0.05 per 100 catheter-days as the infection rate. There were three early complications (within the first 30 days of catheter implantation: two catheter displacement and one infection. Two late complications were observed: one thrombosis and one migration. Three patients (50% needed to have their catheters changed. The 30-day mortality rate was 33% but with no relation to the procedure. CONCLUSION: It may be suggested that this technique is safe, however transhepatic hemodialysis catheters may be used in patients with no other options for deep venous access for hemodialysis, albeit as a last resort access route.

  2. The Adversarial Route Analysis Tool: A Web Application

    Energy Technology Data Exchange (ETDEWEB)

    Casson, William H. Jr. [Los Alamos National Laboratory

    2012-08-02

    The Adversarial Route Analysis Tool is a type of Google maps for adversaries. It's a web-based Geospatial application similar to Google Maps. It helps the U.S. government plan operations that predict where an adversary might be. It's easily accessible and maintainble and it's simple to use without much training.

  3. Degree 3 Networks Topological Routing

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Pedersen, Jens Myrup;

    2009-01-01

    Topological routing is a table free alternative to traditional routing methods. It is specially well suited for organized network interconnection schemes. Topological routing algorithms correspond to the type O(1), constant complexity, being very attractive for large scale networks. It has been...... proposed for many topologies and this work compares the algorithms for three degree three topologies using a more analytical approach than previous studies....

  4. UML modelling of geographic routing protocol "Greedy Perimeter Stateless Routing" for its integration into the "Java Network Simulator"

    CERN Document Server

    Erritali, Mohammed; Ouahidi, Bouabid El

    2012-01-01

    In this work we propose an UML modeling of the "Greedy Perimeter Stateless Routing" (GPSR) protocol that integrate this geographic routing protocol, into "JavaNetwork Simulator" to simulate and study this protocol in a first time and offer some improvement in these features. Java Network Simulator (JNS) is a project of "translation" of Network Simulator (NS) in Java initiated by "the UCL Department of Computer Science". This simulator is not as complete as ns-2, but it is much more accessible to programmers unfamiliar with Tcl. Java Network Simulator does not support so far, no routing protocol for vehicular ad hoc networks and all the routing decisions are made statically or using RIP and OSPF. By modeling and integrating the routing protocol GPSR to JNS, users will be able to understand the concept of the geographic routing and how the routing information is transmitted and updated between nodes in vehicular ad hoc network. The article first examines the architecture of the Java Network Simulator, then give...

  5. Evaluation of Integrated Routing/MAC Solutions for the Diffusion of Warning Messages in VANETs

    Directory of Open Access Journals (Sweden)

    Luca Campelli

    2007-12-01

    Full Text Available The efficiency of routing protocols in general mobile ad hoc networks may be highly affected by the specific Medium Access Control scheme the routing relies upon and by the mobility of the wireless nodes. In this work, we address the design of position based routing solutions for the support of safety oriented applications in Vehicular Ad hoc NETworks (VANETs by focusing on the impact of the MAC layer on the performances of the routing strategies. Namely, we propose a simulation analysis in highway scenarios to assess the routing performance in the two cases where standard IEEE 802.11 technology and a dynamic TDMA scheme are adopted at layer 2 respectively. We discuss on the dimensioning of the routing parameters in both cases and we provide a comparative analysis of the two MAC/routing integrated solutions.

  6. Alternative routes of insulin delivery

    Institute of Scientific and Technical Information of China (English)

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

    2009-01-01

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

  7. A Primer of Multicast Routing

    CERN Document Server

    Rosenberg, Eric

    2012-01-01

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

  8. Alternative routes of insulin delivery.

    Science.gov (United States)

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

    2009-10-01

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

  9. Open access

    NARCIS (Netherlands)

    Valkenburg, P.M.

    2015-01-01

    Open access week Van 19 tot en met 25 oktober 2015 vond wereldwijd de Open Access Week plaats. Tijdens deze week werden er over de hele wereld evenementen georganiseerd waar open access een rol speelt. Ook in Nederland zijn er diverse symposia, workshops en debatten georganiseerd zoals het debat in

  10. [Surgical access routes to the hip joint in the elderly].

    Science.gov (United States)

    Nogler, M; Thaler, M

    2017-01-01

    There are a large number of different approaches to the hip joint. Several conventional and minimally invasive portals exist and numerous technical variations with different instrument sets are available. All approaches can be regarded as standard and can be utilized lege artis. The main differences between approaches are their potential to preserve muscles and avoid damage which would slow down rehabilitation and mobilization. In the elderly the preservation of abductor function is, in the authors' opinion, of utmost importance. A well-functioning gluteal system provides a limp-free gait, supports joint stability and reduces the probability of dislocations. The direct anterior approach has some advantages; however, minimally invasive approaches should be used with care. Surgical experience, experience with a specific approach and the availability of specialized instruments as well as sufficient training are mandatory for a successful performance. A surgeon should always choose the approach with which he has most experience.

  11. Partial differential equations an accessible route through theory and applications

    CERN Document Server

    Vasy, András

    2015-01-01

    This text on partial differential equations is intended for readers who want to understand the theoretical underpinnings of modern PDEs in settings that are important for the applications without using extensive analytic tools required by most advanced texts. The assumed mathematical background is at the level of multivariable calculus and basic metric space material, but the latter is recalled as relevant as the text progresses. The key goal of this book is to be mathematically complete without overwhelming the reader, and to develop PDE theory in a manner that reflects how researchers would think about the material. A concrete example is that distribution theory and the concept of weak solutions are introduced early because while these ideas take some time for the students to get used to, they are fundamentally easy and, on the other hand, play a central role in the field. Then, Hilbert spaces that are quite important in the later development are introduced via completions which give essentially all the fea...

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

    Directory of Open Access Journals (Sweden)

    Patrick Booz

    2016-06-01

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

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

    Directory of Open Access Journals (Sweden)

    Sándor Csiszár

    2005-11-01

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

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

    NARCIS (Netherlands)

    Westerbeek, Hans; Maes, Alfons

    2013-01-01

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

  15. Perception bias in route choice

    NARCIS (Netherlands)

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

    2014-01-01

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

  16. Perception bias in route choice

    NARCIS (Netherlands)

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

    2014-01-01

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

  17. An enzymatic route to selenazolines.

    Science.gov (United States)

    Koehnke, Jesko; Morawitz, Falk; Bent, Andrew F; Houssen, Wael E; Shirran, Sally L; Fuszard, Matthew A; Smellie, Iain A; Botting, Catherine H; Smith, Margaret C M; Jaspars, Marcel; Naismith, James H

    2013-03-18

    Ringing the changes: Selenazolines have applications in medicinal chemistry, but their synthesis is challenging. We report a new convenient and less toxic route to these heterocycles that starts from commercially available selenocysteine. The new route depends on a heterocyclase enzyme that creates oxazolines and thiazolines from serines/threonines and cysteines.

  18. Perception bias in route choice

    NARCIS (Netherlands)

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

    2014-01-01

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

  19. Fatigue mitigation effects of en-route napping on commercial airline pilots flying international routes

    Science.gov (United States)

    Baldwin, Jarret Taylor

    The introduction of ultra-long range commercial aircraft and the evolution of the commercial airline industry has provided new opportunities for air carriers to fly longer range international route segments while deregulation, industry consolidation, and the constant drive to reduce costs wherever possible has pressured airline managements to seek more productivity from their pilots. At the same time, advancements in the understanding of human physiology have begun to make their way into flight and duty time regulations and airline scheduling practices. In this complex and ever changing operating environment, there remains an essential need to better understand how these developments, and other daily realities facing commercial airline pilots, are affecting their fatigue management strategies as they go about their rituals of getting to and from their homes to work and performing their flight assignments. Indeed, the need for commercial airline pilots to have access to better and more effective fatigue mitigation tools to combat fatigue and insure that they are well rested and at the top of their game when flying long-range international route segments has never been greater. This study examined to what extent the maximum fatigue states prior to napping, as self-accessed by commercial airline pilots flying international route segments, were affected by a number of other common flight assignment related factors. The study also examined to what extent the availability of scheduled en-route rest opportunities, in an onboard crew rest facility, affected the usage of en-route napping as a fatigue mitigation strategy, and to what extent the duration of such naps affected the perceived benefits of such naps as self-accessed by commercial airline pilots flying international route segments. The study utilized an online survey tool to collect data on crew position, prior flight segments flown in the same duty period, augmentation, commuting, pre-flight rest obtained in the

  20. Stochastic Vehicle Routing with Recourse

    CERN Document Server

    Goertz, Inge Li; Saket, Rishi

    2012-01-01

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage optimization problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand instantiations, a recourse route is computed -- but costs here become more expensive by a factor lambda. We present an O(log^2 n log(n lambda))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular orienteering, called knapsack rank-function orienteering. We also give a better approximation ratio for knapsack rank-function orienteering than what follows from prior work. Finally, we provide a Unique Games Conjecture based omega(1) hardness of approximation for StochVRP, even on star-like metrics on which our algorithm achieves a logarithmic approximation.

  1. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

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

    2012-01-01

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand...... instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...... orienteering, called knapsack rank-function orienteering. We also give a better approximation ratio for knapsack rank-function orienteering than what follows from prior work. Finally, we provide a Unique Games Conjecture based ω(1) hardness of approximation for StochVRP, even on star-like metrics on which our...

  2. KAUST Open Access policy

    KAUST Repository

    Baessa, Mohamed A.

    2017-03-07

    The transition to open access (OA) is being driven by funders, libraries, researchers and publishers around the world, and is having an impact on us all. It is inevitable that different countries, organisations and disciplines are moving at different rates towards an OA model, and it is this that we will focus on in this session. Drawing on experiences from across Europe and the Middle East we will provide perspectives from both a global publisher and institutions based in the region. Taylor & Francis take a flexible, evidence-based approach to open access, providing a choice of publication routes for our authors, and a choice of agreements for our library customers. Carolyn will outline some of the open access developments, opportunities and challenges at Taylor & Francis. The library plays a critical role in facilitating open access for their researchers, from managing a repository to providing support and information on the OA publication process to their authors. Janis Tyhurst and Dr Imad Bachir will each give an overview of how this is being managed by their institution. There will be an opportunity for questions and discussion with the panel.

  3. 14 CFR 121.95 - Route width.

    Science.gov (United States)

    2010-01-01

    .... (a) Approved routes and route segments over U.S. Federal airways or foreign airways (and advisory... designated width of those airways or routes. Whenever the Administrator finds it necessary to determine the width of other approved routes, he considers the following: (1) Terrain clearance. (2) Minimum en route...

  4. Reliable Point to Multipoint Hierarchical Routing in Scatternet Sensor Network

    Directory of Open Access Journals (Sweden)

    R.Dhaya

    2011-01-01

    Full Text Available In the recent development of communication, Bluetooth Scatternet wireless is a technology developed for wideband local accesses. Bluetooth technology is very popular because of its low cost and easy deployment which is based on IEEE 802.11standards. On the other hand Wireless Sensor Network (WSN consists of large number of sensor nodes distributed to monitor an environment and each node in a WSN consists of a small CPU, a sensing device and battery. Mostly, the sensor networks are distributed in an inconvenient location and it is difficult to recharge often. So routing in WSN is an important issue to consume energy and as well as to increase the life of the network, since a routing protocol finds the path between sources and sink. Moreover it is a challenging task to schedule the data between nodes in a scatternet in a congestive environment. Here this paper presents a new scheduling method for point to multi- point routing in Scatternet sensor network and the new dynamic routing method designed is cluster-based with hierarchical routing. The efficiency of this method is also compared in terms of energy consumption and the results show that the proposed routing is an energy efficient one which simultaneously increases the lifetime of the network.

  5. QUANTIFIED COST-BALANCED ROUTING SCHEME FOR OVERLAY MULTICAST

    Institute of Scientific and Technical Information of China (English)

    Lu Jun; Ruan Qiuqi

    2006-01-01

    This paper focuses on the quantitative analysis issue of the routing metrics tradeoff problem, and presents a Quantified Cost-Balanced overlay multicast routing scheme (QCost-Balanced) to the metric tradeoff problem between overlay path delay and access bandwidth at Multicast Server Nodes (MSN) for real-time applications over Internet. Besides implementing a dynamic priority to MSNs by weighing the size of its service clients for better efficiency, QCost-Balanced tradeoffs these two metrics by a unified tradeoff metric based on quantitative analysis. Simulation experiments demonstrate that the scheme achieves a better tradeoff gain in both two metrics, and effective performance in metric quantitative control.

  6. Road Routes for Waste Disposal - MDC_RecyclingRoute

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This CURBSIDE RECYCLING ROUTES BOUNDARIES LAYER IS A polygon feature class created for the Miami-Dade Department of Solid Waste Management (DSWM). It contains the...

  7. Electric Vehicle Green Routing with Possible En-Route Recharging

    OpenAIRE

    BAOUCHE, Fouad; BILLOT, Romain; Trigui, Rochdi; EL FAOUZI, Nour Eddin

    2014-01-01

    The deployment of Electric Vehicles (EVs) is constrained mainly by the restricted autonomy, the lack of charging stations, the battery recharge time and recuperation capability (e.g. braking phases or downhill). In this study we aim to develop a green routing tool to encourage the use of EV. To overcome the autonomy limitation we propose a methodology for the EV that includes a charging stations location model, an energy graph construction for EV routing and a resolution scheme for the routin...

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

  9. Millimeter Wave Alternate Route Study.

    Science.gov (United States)

    1981-04-01

    A0-AI02 303 HARRIS CORP MELBOURNE FL GOVERNMENT COMMUNICATION ST--ETC FIG 17/2.1 MILLIMETER WAVE ALENT ROUTE STUDT.(U) APR W C ADAMS J J PAN, W C...481-487. 4-7 abm ADAOO0 303 HARRIS CORP MELBOURNE FL GOVERNMENT COMMUNICATION S -ETC F/G 17/2.1 MILLIMETER WAVE ALTERNATE ROUTE STUDY.(U) APR 81 W C...7-21L’j r AD-A102 303 HARRIS CORP MELBOURNE FL GOVERNMENT COMMUNICATION ST--ETC F/A 17/2.1 MILLIMETER WAVE ALTERNATE ROUTE STUDY(U) APR 81 W C ADAMS

  10. Port Authority of Allegheny County Transit Routes

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Shapefile of Transit Routes - Please refer to each resource for active dates of the route information. Routes change over time,

  11. Access Denied

    Science.gov (United States)

    Villano, Matt

    2008-01-01

    Building access control (BAC)--a catchall phrase to describe the systems that control access to facilities across campus--has traditionally been handled with remarkably low-tech solutions: (1) manual locks; (2) electronic locks; and (3) ID cards with magnetic strips. Recent improvements have included smart cards and keyless solutions that make use…

  12. Open Access

    Science.gov (United States)

    Suber, Peter

    2012-01-01

    The Internet lets us share perfect copies of our work with a worldwide audience at virtually no cost. We take advantage of this revolutionary opportunity when we make our work "open access": digital, online, free of charge, and free of most copyright and licensing restrictions. Open access is made possible by the Internet and copyright-holder…

  13. Open Access

    Science.gov (United States)

    Suber, Peter

    2012-01-01

    The Internet lets us share perfect copies of our work with a worldwide audience at virtually no cost. We take advantage of this revolutionary opportunity when we make our work "open access": digital, online, free of charge, and free of most copyright and licensing restrictions. Open access is made possible by the Internet and copyright-holder…

  14. Reverse flood routing with the inverted Muskingum storage routing scheme

    Directory of Open Access Journals (Sweden)

    A. D. Koussis

    2012-01-01

    Full Text Available This work treats reverse flood routing aiming at signal identification: inflows are inferred from observed outflows by orienting the Muskingum scheme against the wave propagation direction. Routing against the wave propagation is an ill-posed, inverse problem (small errors amplify, leading to large spurious responses; therefore, the reverse solution must be smoothness-constrained towards stability and uniqueness (regularised. Theoretical constrains on the coefficients of the reverse routing scheme assist in error control, but optimal grids are derived by numerical experimentation. Exact solutions of the convection-diffusion equation, for a single and a composite wave, are reverse-routed and in both instances the wave is backtracked well for a range of grid parameters. In the arduous test of a square pulse, the result is comparable to those of more complex methods. Seeding outflow data with random errors enhances instability; to cope with the spurious oscillations, the reversed solution is conditioned by smoothing via low-pass filtering or optimisation. Good-quality inflow hydrographs are recovered with either smoothing treatment, yet the computationally demanding optimisation is superior. Finally, the reverse Muskingum routing method is compared to a reverse-solution method of the St. Venant equations of flood wave motion and is found to perform equally well, at a fraction of the computing effort. This study leads us to conclude that the efficiently attained good inflow identification rests on the simplicity of the Muskingum reverse routing scheme that endows it with numerical robustness.

  15. Reverse flood routing with the inverted Muskingum storage routing scheme

    Science.gov (United States)

    Koussis, A. D.; Mazi, K.; Lykoudis, S.; Argiriou, A. A.

    2012-01-01

    This work treats reverse flood routing aiming at signal identification: inflows are inferred from observed outflows by orienting the Muskingum scheme against the wave propagation direction. Routing against the wave propagation is an ill-posed, inverse problem (small errors amplify, leading to large spurious responses); therefore, the reverse solution must be smoothness-constrained towards stability and uniqueness (regularised). Theoretical constrains on the coefficients of the reverse routing scheme assist in error control, but optimal grids are derived by numerical experimentation. Exact solutions of the convection-diffusion equation, for a single and a composite wave, are reverse-routed and in both instances the wave is backtracked well for a range of grid parameters. In the arduous test of a square pulse, the result is comparable to those of more complex methods. Seeding outflow data with random errors enhances instability; to cope with the spurious oscillations, the reversed solution is conditioned by smoothing via low-pass filtering or optimisation. Good-quality inflow hydrographs are recovered with either smoothing treatment, yet the computationally demanding optimisation is superior. Finally, the reverse Muskingum routing method is compared to a reverse-solution method of the St. Venant equations of flood wave motion and is found to perform equally well, at a fraction of the computing effort. This study leads us to conclude that the efficiently attained good inflow identification rests on the simplicity of the Muskingum reverse routing scheme that endows it with numerical robustness.

  16. Phases and Steps in the Access to Data in Information Tools

    DEFF Research Database (Denmark)

    Bergenholtz, Henning; Bothma, Theo; Gouws, Rufus

    2015-01-01

    the term “access process” is used (Bergenholtz and Gouws 2010). It can be shown that this process beginning with the “origin of the problem” leading to an “information source usage situation” contains different parts, and that each part can contain different steps. The most important terms here are access...... route and access time, but not access structure. This term is not only ill defined – it is less relevant, because each user has different access routes, and also the same user makes use of different routes in different cases. We describe four experiments in a case study with one test person how...

  17. Implementation of a Locator-Based Route Switching Scheme for Improved Routing in Proxy Mobile IPv6

    Directory of Open Access Journals (Sweden)

    M. Okwori

    2014-11-01

    Full Text Available Proxy Mobile IPv6 (PMIPv6 is a promising IP mobility protocols that is being deployed in emerging wireless technologies. This however has a non-optimal packet route as a result of the triangular routing problem. This creates a bottle neck at the Local Mobility Anchor (LMA thereby increasing packet delays. This paper presents the implementation of a locator-based route switching scheme on OPNET Modeler. The Mobility Access Gateway (MAG and the LMA were enhanced by making them intelligent. This enables them to be able to check the position of the Corresponding Node (CN with respect to the Mobile Node (MN and also determine the available bandwidth on each link. From the checks made, a three-stage decision process is used to switch routing to the most optimal route that guarantees the best QoS. Node Models were developed for the MAG and LMA, network models were deployed and simulation tests were carried out. The results show that the developed scheme switched packets to a more optimal route according to the designed algorithm. The impact of this switching on differences between transmitted throughput at MN and the received throughput at CN was also evaluated. The receiver activity result shows a reduction in the bottleneck at the LMA-MAG link. The end-to-end delay results show over 50 milliseconds drop in packet delay as a result of the switching to a more optimal route. This shows that the packet delays result from the congestion at the LMA-MAG interface due to suboptimal routing.

  18. Topological Routing in Large-Scale Networks

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun

    2004-01-01

    A new routing scheme, Topological Routing, for large-scale networks is proposed. It allows for efficient routing without large routing tables as known from traditional routing schemes. It presupposes a certain level of order in the networks, known from Structural QoS. The main issues in applying...... Topological Routing to large-scale networks are discussed. Hierarchical extensions are presented along with schemes for shortest path routing, fault handling and path restoration. Further reserach in the area is discussed and perspectives on the prerequisites for practical deployment of Topological Routing...

  19. Topological Routing in Large-Scale Networks

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun

    A new routing scheme, Topological Routing, for large-scale networks is proposed. It allows for efficient routing without large routing tables as known from traditional routing schemes. It presupposes a certain level of order in the networks, known from Structural QoS. The main issues in applying...... Topological Routing to large-scale networks are discussed. Hierarchical extensions are presented along with schemes for shortest path routing, fault handling and path restoration. Further reserach in the area is discussed and perspectives on the prerequisites for practical deployment of Topological Routing...

  20. Local Routing in Convex Subdivisions

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  1. Route Optimization in Network Mobility

    Directory of Open Access Journals (Sweden)

    Md. Hasan Tareque

    2013-01-01

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

  2. New TPG bus route 28

    CERN Multimedia

    2003-01-01

    Geneva's Public Transport services (TPG) have recently inaugurated a new bus line 28, connecting the La Tour Hospital in Meyrin to the international organisations in Geneva, via the airport. All signs associated with this route will be yellow in colour. Timetables and route details can be found at http://www.tpg.ch. Relations with the Host States Service http://www.cern.ch/relations/ Tel. 72848

  3. Robust message routing for mobile (wireless) ad hoc networks.

    Energy Technology Data Exchange (ETDEWEB)

    Goldsby, Michael E.; Johnson, Michael M.; Kilman, Dominique Marie (Sandia National Laboratories, Albuquerque, NM); Bierbaum, Neal Robert; Chen, Helen Y.; Ammerlahn, Heidi R.; Tsang, Rose P.; Nicol, David M. (University of Illinois, Urbana, IL)

    2004-01-01

    This report describes the results of research targeting improvements in the robustness of message transport in wireless ad hoc networks. The first section of the report provides an analysis of throughput and latency in the wireless medium access control (MAC) layer and relates the analysis to the commonly used 802.11 protocol. The second section describes enhancements made to several existing models of wireless MAC and ad hoc routing protocols; the models were used in support of the work described in the following section. The third section of the report presents a lightweight transport layer protocol that is superior to TCP for use in wireless networks. In addition, it introduces techniques that improve the performance of any ad hoc source routing protocol. The fourth section presents a novel, highly scalable ad hoc routing protocol that is based on geographic principles but requires no localization hardware.

  4. Secure Multicast Routing Algorithm for Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Rakesh Matam

    2016-01-01

    Full Text Available Multicast is an indispensable communication technique in wireless mesh network (WMN. Many applications in WMN including multicast TV, audio and video conferencing, and multiplayer social gaming use multicast transmission. On the other hand, security in multicast transmissions is crucial, without which the network services are significantly disrupted. Existing secure routing protocols that address different active attacks are still vulnerable due to subtle nature of flaws in protocol design. Moreover, existing secure routing protocols assume that adversarial nodes cannot share an out-of-band communication channel which rules out the possibility of wormhole attack. In this paper, we propose SEMRAW (SEcure Multicast Routing Algorithm for Wireless mesh network that is resistant against all known active threats including wormhole attack. SEMRAW employs digital signatures to prevent a malicious node from gaining illegitimate access to the message contents. Security of SEMRAW is evaluated using the simulation paradigm approach.

  5. Reverse flood routing with the inverted Muskingum storage routing scheme

    Science.gov (United States)

    Koussis, A. D.; Mazi, K.; Lykoudis, S.; Argyriou, A.

    2010-09-01

    Motivation On occasion, flood related questions are posed in the reverse from the conventional sense, e.g.: Which inflow created the flow observed at cross-section X, or the flood profile observed along reach Y? This is a signal identification type problem (hydrologic forensics). A related question concerns the operation of a reservoir, via optimal outflow control, so as to minimise downstream flood damage. Solution of the aforementioned problems requires routing of floods in the upstream direction. This is an inverse problem, and as such it is not well posed. In routing against the wave propagation, small errors in the flow measurements, or rounding errors, are amplified leading to instability, i.e., to spurious, large changes in the response (inflow hydrograph). Therefore, for the reverse solution to be stable it must be constrained by a smoothness condition; this however does not ensure its uniqueness. Storage routing models as approximate diffusion wave models By appropriate choice of their parameter values, storage routing models approximate closely diffusion-wave (DW) behaviour, if dominant flood propagation mode is that of kinematic waves (KW), which is very often true. We solve the flood signal identification problem by reversing the Muskingum routing scheme. The Muskingum routing scheme derives from a first-order accurate FD discretisation of the KW equation yet yields second-order accurate DW solutions by matching the numerical diffusion coefficient of that KW equation solution scheme to the DW equation’s hydraulic diffusion coefficient. Formulation and testing of a reverse routing scheme based on Muskingum routing Theoretical analysis of the reversed Muskingum routing scheme yields nominal grid design rules; however, we study optimal grid design mainly by numerical experimentation. First, we reverse an exact outflow hydrograph (a single-wave solution of the convection-diffusion equation), and then demonstrate the scheme’s ability to reverse

  6. Destination and route attributes associated with adults' walking: a review.

    Science.gov (United States)

    Sugiyama, Takemi; Neuhaus, Maike; Cole, Rachel; Giles-Corti, Billie; Owen, Neville

    2012-07-01

    Increasing adults' physical activity through environmental initiatives that promote walking as a public health priority. To this end, evidence relevant to the urban planning and transport sectors is required. This review synthesized findings on destination and route attributes associated with utilitarian and recreational walking. A literature search was conducted in April 2011 using Web of Science, PubMed, Transport Research Information Services, GEOBASE, and SPORTDiscus. Environmental attributes were classified into the domains of utilitarian and recreational destinations (presence, proximity, quality) and route (sidewalks, connectivity, aesthetics, traffic, safety). Forty-six studies examining associations of these attributes with utilitarian and/or recreational walking were identified. Specific destination and route attributes associated with each type of walking were summarized. Adults' utilitarian walking was consistently associated with presence and proximity of retail and service destinations (in 80% of the studies reviewed). It was also associated with functional aspects of routes (sidewalks and street connectivity) in 50% of studies. Recreational walking was associated with presence, proximity, and quality of recreational destinations (35% of studies) and route aesthetic (35% of studies). Both types of walking were found unrelated to route safety and traffic in most studies. There is consistent evidence that better access to relevant neighborhood destinations (e.g., local stores, services, transit stops) can be conducive to adults' utilitarian walking. Some evidence also suggests that availability of sidewalks and well-connected streets can facilitate utilitarian walking. To better inform initiatives to promote adults' walking in the planning and transport sectors, future studies need to examine how accessible such destinations should be, as well as the effect of the quality of recreational destinations.

  7. An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks

    Directory of Open Access Journals (Sweden)

    Poonam kori

    2012-01-01

    Full Text Available Routing is one of the most significant challenges in Vehicular ad hoc networks and is critical for the basic network operations. Nodes (vehicles in a Vehicular ad hoc network are allowed to move in anuncontrolled manner. Such node mobility results in a highly dynamic network with rapid topological changes. Caching the routing information can significantly improve the efficiency of routing mechanism in a wireless ad hoc network by reducing the access latency and bandwidth usage. Our work presents an analysis of the effects of route cache for this caching in on-demand routing protocols in Vehicular ad hoc networks. Our analysis is based on the Dynamic Source Routing protocol (DSR, which operates entirely on-demand. Using detailed simulations of Vehicular ad hoc networks, we studied a caching algorithm that utilize cache size as a design choice, and simulated each cache primarily over different movement scenarios drawn from various mobility models. We also evaluated a set of mobility metrics that allow accurate characterization of the relative difficulty that a given movement scenario presents to a Vehicularad hoc network routing protocol, and we analyze each mobility metric’s ability to predict the actual difficulty in terms of routing overhead and packet delivery ratio experienced by the routing protocolacross the highway and city traffic scenarios in our study. Finally we have shown that caching the routing data is beneficial.

  8. Celestial data routing network

    Science.gov (United States)

    Bordetsky, Alex

    2000-11-01

    Imagine that information processing human-machine network is threatened in a particular part of the world. Suppose that an anticipated threat of physical attacks could lead to disruption of telecommunications network management infrastructure and access capabilities for small geographically distributed groups engaged in collaborative operations. Suppose that small group of astronauts are exploring the solar planet and need to quickly configure orbital information network to support their collaborative work and local communications. The critical need in both scenarios would be a set of low-cost means of small team celestial networking. To the geographically distributed mobile collaborating groups such means would allow to maintain collaborative multipoint work, set up orbital local area network, and provide orbital intranet communications. This would be accomplished by dynamically assembling the network enabling infrastructure of the small satellite based router, satellite based Codec, and set of satellite based intelligent management agents. Cooperating single function pico satellites, acting as agents and personal switching devices together would represent self-organizing intelligent orbital network of cooperating mobile management nodes. Cooperative behavior of the pico satellite based agents would be achieved by comprising a small orbital artificial neural network capable of learning and restructing the networking resources in response to the anticipated threat.

  9. Route Scherrer closed for construction work

    CERN Multimedia

    2015-01-01

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

  10. Dynamic Routing in Translucent WDM Optical Networks: The Intradomain Case

    Science.gov (United States)

    Yang, Xi; Ramamurthy, Byrav

    2005-03-01

    Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes,allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters,receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.

  11. A SURVEY ON PROTOCOLS & ATTACKS IN MANET ROUTING

    OpenAIRE

    Meenakshi; Rishabh Jain; Charul Deewan

    2012-01-01

    A mobile ad hoc network (MANET) is a dynamic wirelessnetwork that can be formed without any pre-existinginfrastructure in which each node can act as a router.MANET has no clear line of defense, so, it is accessible toboth legitimate network users and malicious attackers. Inthe presence of malicious nodes, one of the main challengesin MANET is to design the robust security solution that canprotect MANET from various routing attacks. Differentmechanisms have been proposed using variouscryptogra...

  12. A High-Speed Active Switch Routing Architecture

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In this paper, combining with active networks, we design a new kind of programmable routing switch architecture to provide a common intelligent switch platform for multi-protocol switching and multi-service accessing. We elaborate how programmable switch and network intelligence are achieved, and how packets are classified, queued and scheduled. We point out that edge intelligence and network software are the tendency for the development of future networks.

  13. Using Correspondent Information for Route Optimization Scheme on Proxy Mobile IPv6

    Directory of Open Access Journals (Sweden)

    Young-Hyun Choi

    2010-08-01

    Full Text Available Proxy Mobile IPv6 outperforms previous mobilityprotocols have been standardized by the InternetEngineering Task Force. However, Proxy Mobile IPv6 stillinvolves the triangle routing problem in where data packetsfor the mobile node are delivered throughout inefficientrouting paths. To address the triangle routing problem, twodifferent Route Optimization schemes proposed that excludethe inefficient routing paths by creating the shortest routingpath. In this paper, we proposed Correspondent InformationRoute Optimization scheme solves the problem by inefficientsignaling cost of Dutta’s route optimization. Using CorrespondentInformation for Correspondent binding updatesprocess between the mobile access gateways which arecaused by bi-path data communication of the mobile entitiesof different the mobile access gateway on the same localmobility anchor. The results of signaling cost performanceevaluation show that performance of our proposed usingcorrespondent information route optimization scheme isbetter than Liebsch’s route optimization scheme as 45%for mobility of the data packets sender and Dutta’s routeoptimization scheme as 20% for mobility of the data packetssender.

  14. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neithe...

  15. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neithe...

  16. Accessible Knowledge - Knowledge on Accessibility

    DEFF Research Database (Denmark)

    Kirkeby, Inge Mette

    2015-01-01

    Although serious efforts are made internationally and nationally, it is a slow process to make our physical environment accessible. In the actual design process, architects play a major role. But what kinds of knowledge, including research-based knowledge, do practicing architects make use of when...... designing accessible environments? The answer to the question is crucially important since it affects how knowledge is distributed and how accessibility can be ensured. In order to get first-hand knowledge about the design process and the sources from which they gain knowledge, 11 qualitative interviews...... were conducted with architects with experience of designing for accessibility. The analysis draws on two theoretical distinctions. The first is research-based knowledge versus knowledge used by architects. The second is context-independent knowledge versus context-dependent knowledge. The practitioners...

  17. Scalable Lunar Surface Networks and Adaptive Orbit Access

    Science.gov (United States)

    Wang, Xudong

    2015-01-01

    Teranovi Technologies, Inc., has developed innovative network architecture, protocols, and algorithms for both lunar surface and orbit access networks. A key component of the overall architecture is a medium access control (MAC) protocol that includes a novel mechanism of overlaying time division multiple access (TDMA) and carrier sense multiple access with collision avoidance (CSMA/CA), ensuring scalable throughput and quality of service. The new MAC protocol is compatible with legacy Institute of Electrical and Electronics Engineers (IEEE) 802.11 networks. Advanced features include efficiency power management, adaptive channel width adjustment, and error control capability. A hybrid routing protocol combines the advantages of ad hoc on-demand distance vector (AODV) routing and disruption/delay-tolerant network (DTN) routing. Performance is significantly better than AODV or DTN and will be particularly effective for wireless networks with intermittent links, such as lunar and planetary surface networks and orbit access networks.

  18. Qos Failover Routing In Tethernet

    Directory of Open Access Journals (Sweden)

    Ankita Goswami

    2015-07-01

    Full Text Available Abstarct Tethering is a concept of sharing of internet of a device with other devices. Its a low-cost short-distance wireless technology which employs the frequency hopping practice in the globally available ISM band to keep away from interference. In the tethering to form a network there is a concept of piconet containing master and slaves. These piconets are connected together to establish a big network called scatternet. There are several aspects on which scatternet working depends like the piconets numbers and bridges the bridge role etc. Already established routes consume much more energy for the maintenance hence instead of this routes can be created on-demand. Thus consumption can be altered and routes flexibility will inclined. Failover is an another concept that I have included. Its about transferring ones control to the other device whenever first device is failed. In this thesis I have proposed a QoS failover routing that will proficiently form the routes with the QoS desires and will prevent the stoppage of transmission if the transmitting node fails. It will pass its control to another node and allow it to transmit instead of it.

  19. The Consistent Vehicle Routing Problem

    Energy Technology Data Exchange (ETDEWEB)

    Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University

    2009-01-01

    In the small package shipping industry (as in other industries), companies try to differentiate themselves by providing high levels of customer service. This can be accomplished in several ways, including online tracking of packages, ensuring on-time delivery, and offering residential pickups. Some companies want their drivers to develop relationships with customers on a route and have the same drivers visit the same customers at roughly the same time on each day that the customers need service. These service requirements, together with traditional constraints on vehicle capacity and route length, define a variant of the classical capacitated vehicle routing problem, which we call the consistent VRP (ConVRP). In this paper, we formulate the problem as a mixed-integer program and develop an algorithm to solve the ConVRP that is based on the record-to-record travel algorithm. We compare the performance of our algorithm to the optimal mixed-integer program solutions for a set of small problems and then apply our algorithm to five simulated data sets with 1,000 customers and a real-world data set with more than 3,700 customers. We provide a technique for generating ConVRP benchmark problems from vehicle routing problem instances given in the literature and provide our solutions to these instances. The solutions produced by our algorithm on all problems do a very good job of meeting customer service objectives with routes that have a low total travel time.

  20. Open access

    CERN Document Server

    Suber, Peter

    2012-01-01

    The Internet lets us share perfect copies of our work with a worldwide audience at virtually no cost. We take advantage of this revolutionary opportunity when we make our work "open access": digital, online, free of charge, and free of most copyright and licensing restrictions. Open access is made possible by the Internet and copyright-holder consent, and many authors, musicians, filmmakers, and other creators who depend on royalties are understandably unwilling to give their consent. But for 350 years, scholars have written peer-reviewed journal articles for impact, not for money, and are free to consent to open access without losing revenue. In this concise introduction, Peter Suber tells us what open access is and isn't, how it benefits authors and readers of research, how we pay for it, how it avoids copyright problems, how it has moved from the periphery to the mainstream, and what its future may hold. Distilling a decade of Suber's influential writing and thinking about open access, this is the indispe...

  1. Optimization of OSPF Routing in IP Networks

    Science.gov (United States)

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

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

  2. Evaluation of Crosstalk Attacks in Access Networks

    DEFF Research Database (Denmark)

    Wagner, Christoph; Eiselt, Michael; Grobe, Klaus

    2016-01-01

    WDM-PON systems regained interest as low-cost solution for metro and access networks. We present a comparative analysis of resilience of wavelength-selective and wavelength-routed architectures against crosstalk attackers. We compare the vulnerability of these architectures against attacks with c...... with cascaded Erbium-doped fiber amplifiers and a comb laser....

  3. ACO based routing for MANETs

    CERN Document Server

    Arif, Mohammad

    2012-01-01

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

  4. Access French

    CERN Document Server

    Grosz, Bernard

    2014-01-01

    Access is the major new language series designed with the needs of today's generation of students firmly in mind. Whether learning for leisure or business purposes or working towards a curriculum qualification, Access French is specially designed for adults of all ages and gives students a thorough grounding in all the skills required to understand, speak, read and write contemporary French from scratch. The coursebook consists of 10 units covering different topic areas, each of which includes Language Focus panels explaining the structures covered and a comprehensive glossary. Learning tips

  5. Routing Algorithm Exploits Spatial Relations

    Science.gov (United States)

    Okino, Clayton; Jennings, Esther

    2004-01-01

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

  6. le programme SET-Routes

    CERN Multimedia

    CERN Audiovisual Service

    2009-01-01

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

  7. [Intraosseous vascular access, a technic previously underestimated in France].

    Science.gov (United States)

    Oriot, D; Cardona, J; Berthier, M; Nasimi, A; Boussemart, T

    1994-07-01

    Intraosseous vascular access is a simple and very efficient technique for fluid and drug administration in any pediatric emergencies where the intravenous route is impossible or inadequate. Yet it remains unrecognized in France. Its pharmacokinetics is close to that of peripheral intravenous route, but it allows much greater infusion flow rates. In pediatric resuscitation it must be considered as the number one technique of intravascular access in infants, and rapidly as the first alternative after failure of attempt of intravenous route in children under 6. Provided that the technique is performed with careful asepsis, the risk of infectious complications is very low. However the intraosseous route must remain a transitory vascular access, and has to be stopped as soon as possible, its use never exceeding 24 hours.

  8. Hemodialysis access - self care

    Science.gov (United States)

    Kidney failure - chronic-hemodialysis access; Renal failure - chronic-hemodialysis access; Chronic renal insufficiency - hemodialysis access; Chronic kidney failure - hemodialysis access; Chronic renal failure - ...

  9. Naval Battleforce Networks Composite Routing

    Science.gov (United States)

    2007-11-02

    fashion by DHCP), restarts or recontigures the OSPi" daemon, starts advertising the attached subnet in its new wireless subnet, and data transfer starts...Policy Manager. studying extcnsions to PlM or source specific multicast pro,i,,.:als to enable dynamic policy based routing based on DS(’P or other

  10. The routed inventory pooling problem

    NARCIS (Netherlands)

    Bouma, Harmen Willem

    2013-01-01

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

  11. Vehicle Routing with Uncertain Demand

    NARCIS (Netherlands)

    R. Spliet (Remy)

    2013-01-01

    textabstractIn distribution networks a supplier transports goods from a distribution center to customers by means of vehicles with limited capacity. Drivers will drive routes on which they visit multiple customers to make deliveries. Typically, deliveries are made regularly and a fixed schedule is m

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

  13. A route towards immune protection

    NARCIS (Netherlands)

    Groot Nibbelink, Milou

    2016-01-01

    This work describes a route towards an immune protective device for islet of Langerhans transplantation. We developed a protocol to use MIN6 β cells aggregates as pseudo-islets to overcome the donor shortage issue (chapter 3). In this thesis we explored two different immune protective strategies; a

  14. Dynamic Routing during Disaster Events

    NARCIS (Netherlands)

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

    2015-01-01

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

  15. How to choose the route.

    Science.gov (United States)

    Grecu, Irina

    2013-01-01

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

  16. Genetic algorithms for route discovery.

    Science.gov (United States)

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

    2006-12-01

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

  17. Arctic Routes to Fabled Lands

    NARCIS (Netherlands)

    Spies, Marijke

    1997-01-01

    Four hundred years ago Willem Barents set sail with two ships for the north via the Pole. Apart from this expedition, numerous other attempts were made by Dutch and Flemish mariners to find a northern trade route to China and Cathay. In this book, Marijke Spies relates the story of Olivier Brunel, t

  18. Construction of a new wastewater treatment plant, building 676, route Maxwell

    CERN Document Server

    SC Unit

    2008-01-01

    A new wastewater treatment plant is being constructed on Route Maxwell to treat the effluents from the TS/MME/CCS surface treatment workshops. For this purpose, excavation work is being performed in two separate locations along Route Maxwell, causing a slight disruption to traffic in these areas. Site access through Gate C should, however, be maintained. The work is scheduled to continue through until February 2009.

  19. Construction of a new waste-water treatment plant, building 676, route Maxwell

    CERN Multimedia

    TS Department

    2008-01-01

    A new waste-water treatment plant is being constructed on Route Maxwell to treat the effluents from the TS/MME/CCS surface treatment workshops. For this purpose, excavation work is being performed in two separate locations along Route Maxwell, causing a slight disruption to traffic in these areas. Site access through Gate C should, however, be maintained. The work is scheduled to continue until February 2009.

  20. High throughput route selection in multi-rate wireless mesh networks

    Institute of Scientific and Technical Information of China (English)

    WEI Yi-fei; GUO Xiang-li; SONG Mei; SONG Jun-de

    2008-01-01

    Most existing Ad-hoc routing protocols use the shortest path algorithm with a hop count metric to select paths. It is appropriate in single-rate wireless networks, but has a tendency to select paths containing long-distance links that have low data rates and reduced reliability in multi-rate networks. This article introduces a high throughput routing algorithm utilizing the multi-rate capability and some mesh characteristics in wireless fidelity (WiFi) mesh networks. It uses the medium access control (MAC) transmission time as the routing metric, which is estimated by the information passed up from the physical layer. When the proposed algorithm is adopted, the Ad-hoc on-demand distance vector (AODV) routing can be improved as high throughput AODV (HT-AODV). Simulation results show that HT-AODV is capable of establishing a route that has high data-rate, short end-to-end delay and great network throughput.

  1. Performance Evaluation of Unicast and Broadcast Mobile Ad hoc Network Routing Protocols

    CERN Document Server

    Debnath, Sumon Kumar; Islam, Nayeema

    2010-01-01

    Efficient routing mechanism is a challenging issue for group oriented computing in Mobile Ad Hoc Networks (MANETs). The ability of MANETs to support adequate Quality of Service (QoS) for group communication is limited by the ability of the underlying ad-hoc routing protocols to provide consistent behavior despite the dynamic properties of mobile computing devices. In MANET QoS requirements can be quantified in terms of Packet Delivery Ratio (PDR), Data Latency, Packet Loss Probability, Routing Overhead, Medium Access Control (MAC) Overhead and Data Throughput etc. This paper presents an in depth study of one to many and many to many communications in MANETs and provides a comparative performance evaluation of unicast and broadcast routing protocols. Dynamic Source Routing protocol (DSR) is used as unicast protocol and BCAST is used to represent broadcast protocol. The performance differentials are analyzed using ns2 network simulator varying multicast group size (number of data senders and data receivers). Bo...

  2. Routing Protocols to Minimize the Number of Route Disconnections for Communication in Mobile Ad Hoc Networks

    Science.gov (United States)

    2009-09-01

    Routing Protocol MAODV [5] is the multicast extension of the well-known Ad hoc On-demand Distance Vector ( AODV ...extensions of the Dynamic Source Routing (DSR) protocol [4] or the Ad hoc On-demand Distance Vector ( AODV ) routing protocol [5]. The multi-path routing ...Multi-path Distance Vector (AOMDV) routing protocol [7], an extension of AODV to compute multiple loop-free link- disjoint routes ; (iii) AODV

  3. Optimum Route Selection for Vehicle Navigation

    Directory of Open Access Journals (Sweden)

    Dalip

    2016-02-01

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

  4. Automated Computer Access Request System

    Science.gov (United States)

    Snook, Bryan E.

    2010-01-01

    The Automated Computer Access Request (AutoCAR) system is a Web-based account provisioning application that replaces the time-consuming paper-based computer-access request process at Johnson Space Center (JSC). Auto- CAR combines rules-based and role-based functionality in one application to provide a centralized system that is easily and widely accessible. The system features a work-flow engine that facilitates request routing, a user registration directory containing contact information and user metadata, an access request submission and tracking process, and a system administrator account management component. This provides full, end-to-end disposition approval chain accountability from the moment a request is submitted. By blending both rules-based and rolebased functionality, AutoCAR has the flexibility to route requests based on a user s nationality, JSC affiliation status, and other export-control requirements, while ensuring a user s request is addressed by either a primary or backup approver. All user accounts that are tracked in AutoCAR are recorded and mapped to the native operating system schema on the target platform where user accounts reside. This allows for future extensibility for supporting creation, deletion, and account management directly on the target platforms by way of AutoCAR. The system s directory-based lookup and day-today change analysis of directory information determines personnel moves, deletions, and additions, and automatically notifies a user via e-mail to revalidate his/her account access as a result of such changes. AutoCAR is a Microsoft classic active server page (ASP) application hosted on a Microsoft Internet Information Server (IIS).

  5. Technical Report: Sleep-Route - Routing through Sleeping Sensors

    OpenAIRE

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

    2014-01-01

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

  6. Capacity Constrained Routing Algorithms for Evacuation Route Planning

    Science.gov (United States)

    2006-05-04

    April 30, 2006 DRAFT 9 D. Scope and Outline of the Paper The main focus of the paper is on the analysis of a heuristic algorithm which effectively...CCRP Algorithms In this section, we present a generic description of the Capacity Constrained Route Planner (CCRP). CCRP is a heuristic algorithm which...qualifies to be a candidate algorithm. E. Solution Quality of CCRP Since CCRP is a heuristic algorithm , it does not produce optimal solutions for all

  7. Analytical Analysis of Vehicle Routing and Inventory Routing Problems

    Science.gov (United States)

    2007-11-02

    The objective of the project is to perform analytical analyses of heuristics for the Vehicle Routing Problem ( VRP ) and apply the results in models...asymptotic optimal solution value of the VRP with capacity and time window constraints and used it to develop a new and efficient algorithm. (2) Obtained a...characterization of the effectiveness of set partitioning formulations for VRPs . (3) Characterized the worst case behavior of the linear programming

  8. Implementation of direct routing mobile IP for solving triangular routing

    Science.gov (United States)

    Jang, Jongwook; Jang, SeongHo; Park, Miri; Lee, Dae-bong

    2001-10-01

    Mobility support on the network layer is of special importance, as the network layer holds together the huge Internet with common protocol IP. Although based on possibility different wireless or wired technologies, all nodes of the network should be able to communicate. Therefore, mobile IP(an extension of the classical IP) has been designed which enablemobility in the Internet without changing existing wired systems. However, mobile IP leaves some points unsolved. Especially, if it comes to security, efficiency of the packet flow that is called triangular routing. Especially triangular routing can cause unnecessary overhead for the network. Furthermore latency can increase dramatically. This is particularly unfortunate if two communicating hosts are separated by transatlantic links. In order to this problem, many methods like IPv6 and ROMIP are proposed. But these methods have limitation. In other words, they have not compatibility because of needing modification of original IP scheme. Especially ROMIP is very complex and the overhead of control message and processing are serious. The problem of inconsistency of Binding caches may occur too. We therefore propose and analyze the performance of the DRMIP (Direct Routing Mobile IP) which do not modify IP source needed in the sender, is compatible with IP and Mobile IP.

  9. Energy Efficient Location Aided Routing Protocol for Wireless MANETs

    CERN Document Server

    Mikki, Mohammad A

    2009-01-01

    A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation...

  10. Route activity tracking and management using available technology

    Directory of Open Access Journals (Sweden)

    Sam Yousef Khoury

    2012-01-01

    Full Text Available Small organizations that maintain their own fleet and make their own deliveries are responsible for ensuring their drivers are utilizing the most efficient routes while delivering products to their customers. Furthermore, efficient delivery requires that drivers spend as little time as possible dropping off and picking up products, since these activities are referred to as “non-value added activities,” although they are necessary tasks in the order cycle process. To aid in reducing order cycle times, large organizations that can afford it have employed transportation management systems. Unfortunately, small organizations with limited resources are less likely to adopt transportation management systems, despite the need for such automation. One solution is to use available productivity software to track and manage driver route activity in an effort to improve and maintain driver productivity by reducing non-value time and identifying optimal routes. This paper will outline how office productivity software such as Microsoft® Access can meet the needs of small organizations with limited resources by describing the development and use of a route activity database that employs an easy-to-use multi-user interface. This paper also includes the details of the underlying infrastructure and the user interface.

  11. A dual-route approach to orthographic processing

    Directory of Open Access Journals (Sweden)

    Jonathan eGrainger

    2011-04-01

    Full Text Available In the present theoretical note we examine how different learning constraints, thought to be involved in optimizing the mapping of print to meaning during reading acquisition, might shape the nature of the orthographic code involved in skilled reading. On the one hand, optimization is hypothesized to involve selecting combinations of letters that are the most informative with respect to word identity (diagnosticity constraint, and on the other hand to involve the detection of letter combinations that correspond to pre-existing sublexical phonological and morphological representations (chunking constraint. These two constraints give rise to two different kinds of prelexical orthographic code, a coarse-grained and a fine-grained code, associated with the two routes of a dual-route architecture. Processing along the coarse-grained route optimizes fast access to semantics by using minimal subsets of letters that maximize information with respect to word identity, while coding for approximate within-word letter position independently of letter contiguity. Processing along the fined-grained route, on the other hand, is sensitive to the precise ordering of letters, as well as to position with respect to word beginnings and endings. This enables the chunking of frequently co-occurring contiguous letter combinations that form relevant units for morpho-orthographic processing (prefixes and suffixes and for the sublexical translation of print to sound (multi-letter graphemes.

  12. An Efficient Agent-Based AODV Routing Protocol in MANET

    Directory of Open Access Journals (Sweden)

    Preeti Bhati,

    2011-07-01

    Full Text Available A MANET (Mobile Adhoc Network consists of a collection of mobile nodes communicating with each other without any fixed infrastructure such as access points or base stations. MANETS are self organizing or self restoring. Network topology in MANETS is subject to continuous and precipitous (unpredictable change. The limited bandwidth availability, energy constraints and highly dynamic topology make the routing process as exigent. The routing process in MANET relies (based on the cooperation of individual nodes which constitute the network. In this paper, we have tried to remove the existence of misbehaving nodes that may paralyze or slows down the routing operation in MANET. This increases the efficiency of a network. Efficiency can be calculated by the parameters or factors such astransmission capacity, battery power and scalability. Here we are considering the most crucial factor named as transmission capacity of a node. In MANET, as the network size increases complexity of anetwork also increases. To overcome this we make network as modular. So the network becomes task specific which refer to a particular work only. This is the reason of infusing the concept of agents in anefficient network. This proposed protocol provides the most efficient and reliable route which may or may not be minimum hop count.

  13. Scripted Mobile Network Routing in a Contested Environment

    Science.gov (United States)

    2008-03-01

    Protocol Comparisons Iwata measures on-demand routing , such as AODV , Fisheye State Routing (FSR...comparison between DSDV, CGSR, The Wireless Routing Protocol (WRP), AODV , DSR, TORA, Associativity-Based Routing (ABR) and Signal Stability Routing (SSR...with AODV . The modified routing does not change AODV , and can be used with any routing protocol . AODV is tested with and without the plan

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

    Directory of Open Access Journals (Sweden)

    S. K. Srivatsa

    2012-01-01

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

  15. Comparison of on Demand Routing Protocols

    Directory of Open Access Journals (Sweden)

    Bharat Bhushan

    2013-02-01

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

  16. Underwater acoustic wireless sensor networks: advances and future trends in physical, MAC and routing layers.

    Science.gov (United States)

    Climent, Salvador; Sanchez, Antonio; Capella, Juan Vicente; Meratnia, Nirvana; Serrano, Juan Jose

    2014-01-01

    This survey aims to provide a comprehensive overview of the current research on underwater wireless sensor networks, focusing on the lower layers of the communication stack, and envisions future trends and challenges. It analyzes the current state-of-the-art on the physical, medium access control and routing layers. It summarizes their security threads and surveys the currently proposed studies. Current envisioned niches for further advances in underwater networks research range from efficient, low-power algorithms and modulations to intelligent, energy-aware routing and medium access control protocols.

  17. QAODV: Improved Security Routing Protocol of AODV

    OpenAIRE

    Ruihui Mu; Wuqiang Zhang

    2013-01-01

    Network control system (NCS) has higher requirements on QoS index of the network, but MANET can hardly meet the demands of control systems because of its own characteristics. The paper improves AODV and proposes AODV routing protocol QAODV with certain QoS security in combination with NCS and MANET, and expounds routing detection, routing register and routing maintenance. Simulation results show that end-to-end delay and packet loss of QAODV reduces evidently compared with AODV, and the proto...

  18. How Effective is Routing for Wireless Networking

    Science.gov (United States)

    2016-03-05

    novel techniques for data- dissemination are being considered, such as efficient flooding [39, 40] or opportunistic routing [41]. Whether it be one of...schemes: control information is disseminated throughout the network to identify a set of links to route data across. This technique for routing in wireless...user only when it has data destined for that user. To find a route , a control packet is flooded across the network that identifies a path towards the

  19. Model multivehicle routing dengan persaingan pasar

    OpenAIRE

    2011-01-01

    Multiple vehicle routing problem has potential real-word applications as it enables the study of strategic competition among private trucking companies in such ar- eas as the transportation of aggregates to construction sites. The multiple vehicle routing problem with profits and competition (MVRPPC) represents an extension of the vehicle routing problem in that it: incorporates competition into the routing process, maximizes profits rather than minimizes costs, and assumes that truc...

  20. Routing Data Authentication in Wireless Networks

    Energy Technology Data Exchange (ETDEWEB)

    TORGERSON, MARK D.; VAN LEEUWEN, BRIAN P.

    2001-10-01

    In this paper, we discuss several specific threats directed at the routing data of an ad hoc network. We address security issues that arise from wrapping authentication mechanisms around ad hoc routing data. We show that this bolt-on approach to security may make certain attacks more difficult, but still leaves the network routing data vulnerable. We also show that under a certain adversarial model, most existing routing protocols cannot be secured with the aid of digital signatures.

  1. Chemical Routes to Colloidal Chalcogenide Nanosheets

    Energy Technology Data Exchange (ETDEWEB)

    Schaak, Raymond

    2015-02-19

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

  2. A New Distributed Routing Protocol.

    Science.gov (United States)

    1984-01-01

    Kindm ’[t., BMnclh CntMU Consider a attuatJion in %, Adhd them am n n es0 ndh lidkd to at least ne &her node sudh that all moe a wwmwted. either...distributed Itn r that is cpable, of failsafe distributed routing. 37 ~L MANHATAN %SQ.ARE GP :,!: NETWORK, - CONNECTTVY S . .. . I ip p- t 0 4 Figure 4-3

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

    Directory of Open Access Journals (Sweden)

    Nenad Kojić

    2012-06-01

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

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

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

  6. Cultural Routes and Intangible Heritage

    Directory of Open Access Journals (Sweden)

    Enza Zabbini

    2012-08-01

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

  7. A Survey on Distance Vector Routing Protocols

    CERN Document Server

    Tang, Linpeng

    2011-01-01

    In this paper we give a brief introduction to five different distance vector routing protocols (RIP, AODV, EIGRP, RIP-MTI and Babel) and give some of our thoughts on how to solve the count to infinity problem. Our focus is how distance vector routing protocols, based on limited information, can prevent routing loops and the count to infinity problem.

  8. On line routing per mobile phone

    DEFF Research Database (Denmark)

    Bieding, Thomas; Görtz, Simon; Klose, Andreas

    2009-01-01

    On-line routing is concerned with building vehicle routes in an ongoing fashion in such a way that customer requests arriving dynamically in time are efficiently and effectively served. An indispensable prerequisite for applying on-line routing methods is mobile communication technology. Addition...

  9. The pyramidal capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    2010-01-01

    This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal...

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

    NARCIS (Netherlands)

    2008-01-01

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

  11. Classification of Dynamic Vehicle Routing Systems

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  12. Quantitative analysis of access strategies to remoteinformation in network services

    DEFF Research Database (Denmark)

    Olsen, Rasmus Løvenstein; Schwefel, Hans-Peter; Hansen, Martin Bøgsted

    2006-01-01

    Remote access to dynamically changing information elements is a required functionality for various network services, including routing and instances of context-sensitive networking. Three fundamentally different strategies for such access are investigated in this paper: (1) a reactive approach......, network delay characterization) and specific requirements on mismatch probability, traffic overhead, and access delay. Finally, the analysis is applied to the use-case of context-sensitive service discovery....

  13. Quantitative analysis of access strategies to remoteinformation in network services

    DEFF Research Database (Denmark)

    Olsen, Rasmus Løvenstein; Schwefel, Hans-Peter; Hansen, Martin Bøgsted

    2006-01-01

    Remote access to dynamically changing information elements is a required functionality for various network services, including routing and instances of context-sensitive networking. Three fundamentally different strategies for such access are investigated in this paper: (1) a reactive approach......, network delay characterization) and specific requirements on mismatch probability, traffic overhead, and access delay. Finally, the analysis is applied to the use-case of context-sensitive service discovery....

  14. Speed limit on the Route de l’Europe

    CERN Multimedia

    2016-01-01

    Construction work to create a cycle path is under way on the Route de l’Europe, between CERN’s Meyrin and Prévessin sites. The new cycle path is expected to be ready for use in August.   On the part of the road under construction, only one lane is open and the speed limit is 30 km/h. Unfortunately, drivers frequently exceed this limit. Those who drive too fast put their own lives at risk as well as those of the people working on the site.  Please respect the speed limit.  In addition, access to the Route de l’Europe from the SM18, SM19 and BA1 areas and from the tunnel may be in the part of the road where only one lane is open. In this case, please join the road only when the traffic lights allow travel in the relevant direction.

  15. Roman digit naming: evidence for a semantic route.

    Science.gov (United States)

    Duyck, Wouter; Lagrou, Evelyne; Gevers, Wim; Fias, Wim

    2008-01-01

    Earlier research with monolinguals and bilinguals showed that numbers may be named through both a semantic and a phonological route, depending on the number's language and format (Arabic or verbal), task demands, and naming language. The present study investigated the importance of the semantic route for the processing of a third representation of magnitude, namely Roman digits. Using an interference paradigm, we showed that the processing of Roman target digits is influenced by Arabic digit distractors, both in a naming task and a parity judgment task. Roman digits were processed faster if the target and distractor were of the same magnitude. If this was not the case, processing speed slowed down as the numerical distance between target and distractor increased. This strongly suggests that semantic access is mandatory when naming Roman digits. Implications are discussed for the number processing domain and for models of translation in bilinguals.

  16. A SURVEY ON PROTOCOLS & ATTACKS IN MANET ROUTING

    Directory of Open Access Journals (Sweden)

    Meenakshi

    2012-09-01

    Full Text Available A mobile ad hoc network (MANET is a dynamic wirelessnetwork that can be formed without any pre-existinginfrastructure in which each node can act as a router.MANET has no clear line of defense, so, it is accessible toboth legitimate network users and malicious attackers. Inthe presence of malicious nodes, one of the main challengesin MANET is to design the robust security solution that canprotect MANET from various routing attacks. Differentmechanisms have been proposed using variouscryptographic techniques to countermeasure the routingattacks against MANET. However, these mechanisms arenot suitable for MANET resource constraints, i.e., limitedbandwidth and battery power, because they introduce heavytraffic load to exchange and verifying keys. In this paper,the current security issues in MANET are investigated.Particularly, we have examined different routing attacks,such as flooding, blackhole, link spoofing, wormhole, andcolluding misrelay attacks, as well as existing solutions toprotect MANET protocols.

  17. Easing access for lifelong learners

    DEFF Research Database (Denmark)

    Müller, Romina; Remdisch, Sabine; Köhler, Katharina

    2015-01-01

    Easing access to higher education (HE) for those engaging in lifelong learning has been a common policy objective across the European Union since the late 1990s. To reach this goal, the transition between vocational and academic routes must be simplified, but European countries are at different...... developmental stages. This article maps the development in Denmark, Finland, Germany and England using a case study approach deploying data triangulation from a national and institutional perspective. It explores the extent/commonality of structural factors for easing access for students engaging in lifelong...... learning. The cases are at widely different stages, but the following factors were considered essential in all countries for opening universities: the establishment of transition paths from secondary education and working life into HE and links between HE, businesses and adult education from a national...

  18. GIS model to evaluate the accessibility to major transport ways

    Directory of Open Access Journals (Sweden)

    Antonio Tache

    2015-03-01

    Full Text Available In order to ensure a balanced accessibility to major transport ways, supporting spatial development and economic growth, a GIS model to assess accessibility it was proposed. The model is measuring the average cost of travel (by car, usually from a point to a predetermined number of destinations measured in units of time (minutes. Using the ARCGIS Spatial Analyst module, accessibility territorial indicators were calculated and presented as cartograms and maps that are outlining the accessibility to major transportation routes and to major cities. The proposed model to assess accessibility was tested for Tulcea county (NUTS III level and for the South East region (NUTS II level.

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

    Institute of Scientific and Technical Information of China (English)

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

    2016-01-01

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

  20. Route selection for vehicle navigation and control

    OpenAIRE

    G. Pang; Chu, MH

    2007-01-01

    This paper presents an application of neural-fuzzy methodology for the problem of route selection in a typical vehicle navigation and control system. The idea of the primary attributes of a route is discussed, and a neural-fuzzy system is developed to help a user to select a route out of the many possible routes from an origin to the destination. The user may not adopt the recommendation provided by the system and choose an alternate route. One novel feature of the system is that the neural-f...

  1. Routing for wireless multi-hop networks

    CERN Document Server

    Hamid, Sherin Abdel; Takahara, Glen

    2013-01-01

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

  2. Submarine Pipeline Routing Risk Quantitative Analysis

    Institute of Scientific and Technical Information of China (English)

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

    2004-01-01

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

  3. Dynamic information routing in complex networks

    Science.gov (United States)

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

    2016-01-01

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

  4. MILITARY MULTI-HOP ROUTING PROTOCOL

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

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

  5. A Genetic Algorithm on Inventory Routing Problem

    Directory of Open Access Journals (Sweden)

    Nevin Aydın

    2014-03-01

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

  6. Dynamic information routing in complex networks

    Science.gov (United States)

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

    2016-04-01

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

  7. VANET Routing Protocols: Pros and Cons

    CERN Document Server

    Paul, Bijan; Bikas, Md Abu Naser

    2012-01-01

    VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol has taken significant attention. So, it is very necessary to identify the pros and cons of routing protocols which can be used for further improvement or development of any new routing protocol. This paper presents the pros and cons of VANET routing protocols for inter vehicle communication.

  8. LINK STABILITY WITH ENERGY AWARE AD HOC ON DEMAND MULTIPATH ROUTING PROTOCOL IN MOBILE AD HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    Senthil Murugan Tamilarasan

    2013-01-01

    Full Text Available Mobile Ad Hoc Network is one of the wireless network in which mobile nodes are communicate with each other and have no infrastructure because no access point. The MANET protocols can be classified as proactive and reactive routing protocol. The proactive routing protocols, all nodes which participated in network have routing table. This table updated periodically and is used to find the path between source and destination. The reactive routing protocol, nodes are initiate route discovery procedure when on-demand routes. In order to find the better route in MANET, many routing protocols are designed in the recent years. But those protocols are not concentrating about communication links and battery energy. Communication links between nodes and energy of nodes are very important factor for improving quality of routing protocols. This study presents innovative Link Stability with Energy Aware (LSEA multipath routing protocol. The key idea of the protocol is find the link quality, maximum remaining energy and lower delay. Reflections of these factors are increasing the qualities like packet delivery ratio, throughputs and reduce end-to-end delay. The LSEAMRP was simulated on NS-2 and evaluation results also shown.

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

    Science.gov (United States)

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

    2016-01-01

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

  10. Hybrid internet access

    Science.gov (United States)

    Arora, Vivek; Baras, John S.; Dillon, Douglas; Falk, Aaron; Suphasindhu, Narin

    1995-01-01

    Access to the Internet is either too slow (dial-up SLIP) or too expensive (switched 56 kbps, frame relay) for the home user or small enterprise. The Center for Satellite and Hybrid Communication Networks and Hughes Network Systems have collaborated using systems integration principles to develop a prototype of a low-cost hybrid (dial-up and satellite) newtork terminal which can deliver data from the Internet to the user at rates up to 160 kbps. An asymmetric TCP/IP connection is used breaking the network link into two physical channels: a terrestrial dial-up for carrying data from the terminal into the Internet and a receive-only satellite link carrying IP packets from the Internet to the user. With a goal of supporting bandwidth hungry Internet applications such as Mosaic, Gopher, and FTP, this system has been designed to support any Intel 80386/486 PC, any commercial TCP/IP package, any unmodified host on the Internet, and any of the routers, etc., within the Internet. The design exploits the following three observations: 1) satellites are able to offer high bandwidth connections to a large geographical area, 2) a receive-only VSAT is cheap to manufacture and easier to install than one which can also transmit, and 3) most computer users, especially those in a home environment, will want to consume much more information than they generate. IP encapsulation, or tunneling, issued to manipulate the TCP/IP protocols to route packets asymmetrically.

  11. Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis.

    Science.gov (United States)

    Alanazi, Adwan; Elleithy, Khaled

    2015-09-02

    Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.

  12. Endoscopic approach-routes in the posterior fossa cisterns through the retrosigmoid keyhole craniotomy: an anatomical study.

    Science.gov (United States)

    Kurucz, Peter; Baksa, Gabor; Patonay, Lajos; Thaher, Firas; Buchfelder, Michael; Ganslandt, Oliver

    2016-11-10

    Endoscopy in cerebellopontine angle surgery is an increasingly used technique. Despite of its advantages, the shortcomings arising from the complex anatomy of the posterior fossa are still preventing its widespread use. To overcome these drawbacks, the goal of this study was to define the anatomy of different endoscopic approaches through the retrosigmoid craniotomy and their limitations by surgical windows. Anatomical dissections were performed on 25 fresh human cadavers to describe the main approach-routes. Surgical windows are spaces surrounded by neurovascular structures acting as a natural frame and providing access to deeper structures. The approach-routes are trajectories starting at the craniotomy and pointing to the lesion, passing through certain windows. Twelve different windows could be identified along four endoscopic approach-routes. The superior route provides access to the structures of the upper pons, lower mesencephalon, and the upper neurovascular complex through the suprameatal, superior cerebellar, and infratrigeminal windows. The supratentorial route leads to the basilar tip and some of the suprasellar structures via the ipsi- and contralateral oculomotor and dorsum sellae windows. The central endoscopic route provides access to the middle pons and the middle neurovascular complex through the inframeatal, AICA, and basilar windows. The inferior endoscopic route is the pathway to the medulla oblongata and the lower neurovascular complex through the accessory, hypoglossal, and foramen magnum windows. The anatomy and limitations of each surgical windows were described in detail. These informations are essential for safe application of endoscopy in posterior fossa surgery through the retrosigmoid approach.

  13. Dialysis Catheter Placement in Patients With Exhausted Access.

    Science.gov (United States)

    Rahman, Syed; Kuban, Joshua D

    2017-03-01

    Patients with end-stage renal disease undergo renal transplant, peritoneal dialysis, or intermittent hemodialysis for renal replacement therapy. For hemodialysis, native fistulas or grafts are preferred but hemodialysis catheters are often necessary. Per KDOQI, the right jugular vein is the preferred vessel of access for these catheters. However, in patients with long-standing end-stage renal disease vein thrombosis, stenosis and occlusion occurs. In these patients with end-stage vascular access, unconventional routes of placement of dialysis catheters are needed. These methods include placing them by means of sharp recanalization, via a translumbar route directly into the inferior vena cava, and via transhepatic and transrenal routes. These difficult, but potentially lifesaving methods of gaining vascular access are reviewed in this article. Copyright © 2017 Elsevier Inc. All rights reserved.

  14. Enhancing Route Maintenance in RS-AODV

    Directory of Open Access Journals (Sweden)

    Gaurav J. Bhatt*,

    2014-05-01

    Full Text Available Mobile Ad hoc Networks (MANETs are temporary formed, infrastructure-less networks. The performance metrics degrades due to the unstable channel conditions, network connectivity, and mobility and resource limitations. To improve different performance metrics, various cross-layering techniques are used where different layers from protocol stack communications with each other via exchange of information. Ad hoc on demand Routing Protocol (AODV is a well reactive ad hoc routing protocol. We proposed RS-AODV (Route Stability based AODV, a modified version of AODV routing protocol, based on route discovery by utilizing Physical Layer information instead of the minimum hop count approach of the default distance vector algorithm. Our research will also elaborate how the proposed model uses the received Signal Strength (RSSI to find its route. We will focus on parameters like traffic throughput, response, time, packet loss, delay, link stability, optimal usage of battery resource to increase overall lifetime of a network. And also use novel approach "make before break" that starts finding alternate route when it seems link failure due to mobility of node. Simulation results show that RS-AODV has performance better that AODV routing protocol in terms of the metrics: End-to-End delay, Packet Delivery Ratio, Network Routing Load and number of route repairs.

  15. A Study Issues Related To Improve Route Stability In AODY Routing Protocol In VANET

    Directory of Open Access Journals (Sweden)

    Annu Mor

    2013-01-01

    Full Text Available Vehicular Ad Hoc Network (VANET is a sub class of mobile ad hoc networks. VANET provides wireless communication among vehicles and vehicle to road side equipments, according to IEEE 802.11 p standard for end to end communication between vehicles . For end to end communication between vehicles a routing protocols is used to find a route based on link properties. One of the most important routing protocols used in ad hoc networks is AODV. This protocol is connectivity based reactive protocol that searches routes only when they are needed. It always exchanges control packets between neighbor nodes for routing. In this article author present cross layer technique that find channel security at link layer to AODV routing protocol to improve the communication in vehicles for safety purpose. To eliminate route discovery routers, propose PAODV as routing protocol. It improves AODV control overhead and makes routes more stable.

  16. A simulation based QoS review of multipath routing protocols for MANET

    Directory of Open Access Journals (Sweden)

    P.Periyasamy

    2012-11-01

    Full Text Available A MANET is an interconnection of mobile devices by wireless links forming a dynamic topology without much physical network infrastructure such as routers, servers, access points/cables or centralized administration. The multipath routing protocols establish efficient communication within the network by discovering multiple routes between a pair of source and destination in order to have load balancing to satisfy Quality of Service (QoS requirements. In this paper, the QoS comparison of three multipath routing protocols are carried out in terms of five scenario patterns such as RWM, RPGM, MGM, GMM, and PMM in two different traffic patterns such as CBR and TCP using NS2 and Bonn Motion. The multipath routing protocols AOMDV, OLSR and ZRP have been selected for simulation due to their edges over other protocols in various aspects.

  17. Wine routes as an element of the regional development of borderline regions

    Directory of Open Access Journals (Sweden)

    Vladimir Drozg

    1993-12-01

    Full Text Available The article examines the role of winw routes in promoting the development of wine-growing regions. It focuses both on the criteria for tracing wine routes (landscape value of a region, distribution of tourist supply settlements and events, natural and cultural monuments, existing road netivorks and transport accessibility, supplemenlary activities along the wine routes and on the impact that wine exert on the landscape/region (an increased income of individual households, better infrastructure equipment, recuttivation ol desert land lots, decreasing depopulalion and development of supplementary activities. The wine route through the Svečinske gorice region is presented as an example of countryside regulation.

  18. Smart Order Routing Technology in the New European Equity Trading Landscape

    Science.gov (United States)

    Ende, Bartholomäus; Gomber, Peter; Lutat, Marco

    In Europe, fragmentation of execution venues has been triggered by increasing competition among markets and a new regulatory environment set up by MiFID. Against this background, IT-based sophisticated order routing systems (Smart Order Routing systems) promise to assure efficiency despite fragmented markets. This raises the question on the relevance and economic value of this technology in European equity trading. Based on order book data for EURO STOXX 50 securities of ten European electronic execution venues, this paper assesses the potential of Smart Order Routing technology by measuring the performance of actual executions in European order book trading relative to a Smart Order Router implementation that detects and accesses best European prices. We identify 6.71% full trade troughs and 6.45% partial trade-throughs in our dataset enabling for significant absolute and relative savings. This indicates that Smart Order Routing technology can provide business value by improving order executions in European cross-tradable equities.

  19. The Edge Set Cost of the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Jepsen, Mads Kehlet; Pisinger, David

    2016-01-01

    We consider an important generalization of the vehicle routing problem with time windows in which a fixed cost must be paid for accessing a set of edges. This fixed cost could reflect payment for toll roads, investment in new facilities, the need for certifications, and other costly investments...

  20. COMPUTER REALIZATION OF SEARCH TASK OF THE SHORTEST ROUTE WITH THE HELP OF EXCEL AND VBA

    OpenAIRE

    2008-01-01

    The necessity of the development of simple and accessible to the final users of the applied software for the decision of local optimization tasks of transport technologies has been grounded with the help of the Excel and VBA facilities. The computer task decision and search of the shortest route has been described.

  1. Closure of the Route de Meyrin as of 11 February 2008

    CERN Multimedia

    In the framework of the work on the new Cornavin-Meyrin-CERN tramline, an underpass is to be cut into the hill of Meyrin village where the Route de Meyrin meets the Avenue de Vaudagne and the Avenue Virginio-Malnati. As a result, the Route de Meyrin will be closed to through traffic for a period of two years, starting on Monday 11 February 2008. The following traffic diversions will be in operation: - Traffic travelling in the Geneva-France direction will be diverted along the Avenue de Mategnin and the Avenue Louis-Rendu or the Route du Nant-d'Avril and the Route du Mandement, - Traffic travelling in the France-Geneva direction will be diverted along the Route du Mandement and the Route du Nant-d'Avril. There will also be special diversion routes in the centre of Meyrin reserved for access to shops, houses and flats and the La Tour hospital. The map is available at the following link. Relations with the Host States Service Tel. 72848

  2. Closure of the Route de Meyrin as of 11 February 2008

    CERN Multimedia

    DSU Department

    2008-01-01

    In the framework of the work on the new Cornavin-Meyrin-CERN tramline, an underpass is to be cut into the hill of Meyrin village where the Route de Meyrin meets the Avenue de Vaudagne and the Avenue Virginio-Malnati. As a result, the Route de Meyrin will be closed to through traffic for a period of two years, starting on Monday 11 February 2008. The following traffic diversions will be in operation: Traffic travelling in the Geneva-France direction will be diverted along the Avenue de Mategnin and the Avenue Louis-Rendu or the Route du Nant-d’Avril and the Route du Mandement, Traffic travelling in the France-Geneva direction will be diverted along the Route du Mandement and the Route du Nant-d’Avril. There will also be special diversion routes in the centre of Meyrin reserved for access to shops, houses and flats and the La Tour hospital. Full details of the project (in French) can be consulted on the following website: http://w...

  3. CluLoR: Clustered Localized Routing for FiWi Networks

    Directory of Open Access Journals (Sweden)

    Yousef Dashti

    2014-04-01

    Full Text Available The integration of passive optical networks (PONs and wireless mesh networks (WMNs into Fiber- Wireless (FiWi networks can lead to effective access networks. Existing routing schemes for FiWi networks consider mainly hop-count and delay metrics over a flat WMN node topology and do not specifically prioritize the local network structure, i.e., the local wireless-optical network gateway. In this study, we explore a simple, yet effective routing algorithm for FiWi networks with a WMN organized into zones operating on different radio channels. We examine the effects of routing the traffic into and out of a zone through one or more cluster heads. We investigate the effectiveness of localized routing that prioritizes transmissions over the local gateway to the optical network and avoids wireless packet transmissions in zones that do not contain the packet source or destination. We find that this combination of clustered and localized routing (CluLoR gives good throughput-delay performance compared to routing schemes that transmit packets wirelessly through “transit zones” (that do not contain the packet source or destination following minimum hop-count routing.

  4. DYNAMIC K-MEANS ALGORITHM FOR OPTIMIZED ROUTING IN MOBILE AD HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    Zahra Zandieh Shirazi

    2016-04-01

    Full Text Available In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks (MANETs is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can operate without using focal access points, pre-existing infrastructures, or a centralized management point. In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead to various problems in the routing process such as increase of the overhead massages and inefficient routing between nodes of network. A large variety of clustering methods have been developed for establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having significant impact on MANETs performance. The K-means algorithm is one of the effective clustering methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption. This paper proposed a new K-means clustering algorithm to find out optimal path from source node to destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the performance of routing process in Mobile ad-hoc networks.

  5. Deterministic 1-k routing on meshes with applications to worm-hole routing

    OpenAIRE

    Sibeyn, J.; Kaufmann, M.

    1993-01-01

    In $1$-$k$ routing each of the $n^2$ processing units of an $n \\times n$ mesh connected computer initially holds $1$ packet which must be routed such that any processor is the destination of at most $k$ packets. This problem reflects practical desire for routing better than the popular routing of permutations. $1$-$k$ routing also has implications for hot-potato worm-hole routing, which is of great importance for real world systems. We present a near-optimal deterministic algorithm running in...

  6. Using Crowdsourced Indoor Geodata for the Creation of a Three-Dimensional Indoor Routing Web Application

    Directory of Open Access Journals (Sweden)

    Marcus Goetz

    2012-06-01

    Full Text Available Routing services for outdoor areas are omnipresent and also three-dimensional (3D visualization is quite common within this area. Recent research efforts are now trying to adapt well known outdoor routing services to complex indoor environments. However, most of the current indoor routing systems only focus on two-dimensional visualization, thus only one level can be depicted. Especially multi-level routes therefore lack visualization. Also, most of the (few existing 3D indoor routing services utilize proprietary software or plugins, thus a widespread accessibility for those services by using common computers or mobile devices is not feasible. Therefore this paper describes the development of a web-based 3D routing system based on a new HTML extension. The visualization of rooms as well as the computed routes is realized with XML3D. Since this emerging technology is based on WebGL and will likely be integrated into the HTML5 standard, the developed system is already compatible with most common browsers such as Google Chrome or Firefox. Another key difference of the approach presented in this paper is that all utilized data is actually crowdsourced geodata from OpenStreetMap (OSM. Such data is collaboratively collected by both amateurs and professionals and can be used at no charge under the Open Data Commons Open Database License (ODbL. Our research combines user-generated geo content of the Web 2.0 with future Internet technology for the provision of a ubiquitously accessible 3D indoor routing application.

  7. Distributed multiple path routing in complex networks

    Science.gov (United States)

    Chen, Guang; Wang, San-Xiu; Wu, Ling-Wei; Mei, Pan; Yang, Xu-Hua; Wen, Guang-Hui

    2016-12-01

    Routing in complex transmission networks is an important problem that has garnered extensive research interest in the recent years. In this paper, we propose a novel routing strategy called the distributed multiple path (DMP) routing strategy. For each of the O-D node pairs in a given network, the DMP routing strategy computes and stores multiple short-length paths that overlap less with each other in advance. And during the transmission stage, it rapidly selects an actual routing path which provides low transmission cost from the pre-computed paths for each transmission task, according to the real-time network transmission status information. Computer simulation results obtained for the lattice, ER random, and scale-free networks indicate that the strategy can significantly improve the anti-congestion ability of transmission networks, as well as provide favorable routing robustness against partial network failures.

  8. Vehicle routing problem in investment fund allocation

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Mohd, Ismail

    2013-04-01

    Since its introduction by Dantzig and Ramser in 1959, vehicle routing problem keeps evolving in theories, applications and variability. The evolution in computing and technology are also important contributors to research in solving vehicle routing problem. The main sectors of interests among researchers and practitioners for vehicle routing problem are transportation, distribution and logistics. However, literature found that concept and benefits of vehicle routing problem are not taken advantages of by researchers in the field of investment. Other methods found used in investment include multi-objective programming, linear programming, goal programming and integer programming. Yet the application of vehicle routing problem is not fully explored. A proposal on a framework of the fund allocation optimization using vehicle routing problem is presented here. Preliminary results using FTSE Bursa Malaysia data testing the framework are also given.

  9. Dynamic information routing in complex networks

    CERN Document Server

    Kirst, Christoph; Battaglia, Demian

    2015-01-01

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

  10. Zone routing in a torus network

    Science.gov (United States)

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

    A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

  11. The Pyramidal Capacitated Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal...... found in many optimal solutions to CVRP instances. An optimal solution to the PCVRP may therefore be useful in itself as a heuristic solution to the CVRP. Further, an attempt can be made to find an even better CVRP solution by solving a TSP, possibly leading to a non-pyramidal route, for each...... of the routes in the PCVRP solution. This paper develops an exact branch-and-cut-and-price (BCP) algorithm for the PCVRP. At the pricing stage, elementary routes can be computed in pseudo-polynomial time in the PCVRP, unlike in the CVRP. We have therefore implemented pricing algorithms that generate only...

  12. Security Verification of Secure MANET Routing Protocols

    Science.gov (United States)

    2012-03-22

    the destination. The route discovery phase is complete upon receipt of the RREP at the requesting node. The DYMO protocol is a simpler version of AODV ...described in this appendix. The protocols are Secure AODV (SAODV), Secure Efficient Distance Vector (SEAD), and Secure Link State Routing Protocol (SLSP...SECURITY VERIFICATION OF SECURE MANET ROUTING PROTOCOLS THESIS Matthew F. Steele, Captain, USAF AFIT/GCS/ENG/12-03 DEPARTMENT OF THE AIR FORCE AIR

  13. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    OpenAIRE

    1990-01-01

    Approved for public release; distribution unlimited. In this thesis we study the Marine Corps Tactical Aerial Reconnaissance Vehicle routing and scheduling problem. the present method of routing and scheduling is presented, along with possible implications for routing and scheduling when future expansion of vehicle assets becomes available. A review of current literature is given and comparisons are drawn between our problem and recent work. A model for the problem, which we call the Multi...

  14. Distributed algorithms for resource allocation and routing

    OpenAIRE

    Hu, Zengjian

    2007-01-01

    In this thesis, we study distributed algorithms in the context of two fundamental problems in distributed systems, resource allocation and routing. Resource allocation studies how to distribute workload evenly to resources. We consider two different resource allocation models, the diffusive load balancing and the weighted balls-into-bins games. Routing studies how to deliver messages from source to estination efficiently. We design routing algorithms for broadcasting and gossiping in ad hoc n...

  15. Gossip Based Ad-Hoc Routing

    OpenAIRE

    Haas, Zygmunt; Halpern, Joseph Y.; Li, Erran L.

    2002-01-01

    Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fr...

  16. Assessing Routing Strategies for Cognitive Radio Sensor Networks

    Science.gov (United States)

    Zubair, Suleiman; Fisal, Norsheila; Baguda, Yakubu S.; Saleem, Kashif

    2013-01-01

    Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area. PMID:24077319

  17. Synthetic Routes to Methylerythritol Phosphate Pathway Intermediates and Downstream Isoprenoids

    Science.gov (United States)

    Jarchow-Choy, Sarah K; Koppisch, Andrew T; Fox, David T

    2014-01-01

    Isoprenoids constitute the largest class of natural products with greater than 55,000 identified members. They play essential roles in maintaining proper cellular function leading to maintenance of human health, plant defense mechanisms against predators, and are often exploited for their beneficial properties in the pharmaceutical and nutraceutical industries. Most impressively, all known isoprenoids are derived from one of two C5-precursors, isopentenyl diphosphate (IPP) or dimethylallyl diphosphate (DMAPP). In order to study the enzyme transformations leading to the extensive structural diversity found within this class of compounds there must be access to the substrates. Sometimes, intermediates within a biological pathway can be isolated and used directly to study enzyme/pathway function. However, the primary route to most of the isoprenoid intermediates is through chemical catalysis. As such, this review provides the first exhaustive examination of synthetic routes to isoprenoid and isoprenoid precursors with particular emphasis on the syntheses of intermediates found as part of the 2C-methylerythritol 4-phosphate (MEP) pathway. In addition, representative syntheses are presented for the monoterpenes (C10), sesquiterpenes (C15), diterpenes (C20), triterpenes (C30) and tetraterpenes (C40). Finally, in some instances, the synthetic routes to substrate analogs found both within the MEP pathway and downstream isoprenoids are examined. PMID:25009443

  18. ANALYSIS OF ROUTING IN MOBILE AD-HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    Shweta

    2012-09-01

    Full Text Available An ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any standalone infrastructure or centralized administration. Routing in Ad hoc networks is a challenging problem because nodes are mobile and links are continuously being created and broken.In this model we not only improves the reputation of the network but also provide a routing approach for reliable data transmission and also avoid the loop occurs in the communication. The mobile network is the dynamicnetwork that provides the solution for the inclusion and exclusion of dynamic nodes in the network. AODV and DSR are the two most popular routing protocols for ad-hoc network that we discussed here. In this paper we describe the way to find the node having packet loss and to perform the elimination of node from the network withoutperforming the rerouting and provide the reliable data transfer over the network. In this paper, we design and evaluate cooperative caching techniques to efficiently support data access in the ad-hoc network.

  19. Civil engineering work to raise the level of Route Goward

    CERN Multimedia

    2013-01-01

    Civil engineering work to raise the level of Route Goward will take place during Long Shutdown 1. The work will begin on 18 March 2013 and is expected to last around 5 months.   Route Goward runs over the top of the PS tunnel and is the only access route to the inside of the ring. The layer of shielding backfill beneath this road is the thinnest anywhere on the PS ring. As the purpose of this shielding is to protect against the ionising radiation emitted by the accelerator when in operation, this road has been classified as a “supervised radiation area” according to radiation protection regulations. This classification was merely a temporary solution and, on the recommendation of the PS Radiation Working Group (PSRWG), the decision has been taken to raise the surface level permanently by around 2 m in order to increase the thickness of the shielding and thus lower the dose rate to that of a non-designated area. As the PS tunnel itself is unable to withstand the weight of t...

  20. Administrator and Fidelity Based Secure Routing (AFSR Protocol in MANET

    Directory of Open Access Journals (Sweden)

    Rohit Singh

    2016-03-01

    Full Text Available The proliferation of mobile computing and communication devices are driving a revolutionary change in our information society. Among all the applications and services run by mobile devices, network connections and corresponding data services are without doubt the most demanded services by mobile users. A MANET is a continuously self-configuring, infrastructure-less network of mobile devices connected without wires, which makes it ideal for the present scenario. But, due to lack of any centralized infrastructure and access to trusted authorities, the security in MANET poses a huge threat. The prominent routing protocols we know are generally designed for environments where the nodes within a network are non-malicious. Due to the vulnerable nature of the mobile ad hoc network, there are numerous security threats that disturb its development. We propose a protocol for MANETs named “Administrator and Fidelity Based Secure Routing Protocol” (AFSR, which ensures secure routing through the network: by electing an Administrator node on the basis of Willingness and Fidelity, after which a node only communicates to that secure Admin node. This selection of secured admin nodes results in mitigation of various threats. We have evaluated our proposed protocol by simulating and comparing in GloMoSim.

  1. Assessing Routing Strategies for Cognitive Radio Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kashif Saleem

    2013-09-01

    Full Text Available Interest in the cognitive radio sensor network (CRSN paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs, cognitive radio ad-hoc networks (CRAHNs and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area.

  2. Assessing routing strategies for cognitive radio sensor networks.

    Science.gov (United States)

    Zubair, Suleiman; Fisal, Norsheila; Baguda, Yakubu S; Saleem, Kashif

    2013-09-26

    Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area.

  3. An Analysis of ASRP Secure Routing Protocol for MANET

    Directory of Open Access Journals (Sweden)

    Tarun Dalal

    2012-04-01

    Full Text Available Mobile ad hoc networks (MANET can be defined as a collection of large number of mobile nodes that form temporary network without aid of any existing network infrastructure or central access point. Each node participating in the network, acts both as host and a router and must therefore is willing to forward packets for other nodes. The characteristics of MANET provides large amount of degree of freedom and self-organizing capability that make it completely different from other network. Due to this nature of MANET, design and development of secure routing is challenging task for researcher in an open and distributed communication environments. The main work of this paper is to address the security issue, because MANET is generally more vulnerable to various attacks, so we proposed a secure routing protocol for MANET, named ASRP (Authenticate Secure Routing Protocol based on DSDV (Destination- sequence distance vector. This protocol is designed to protect the network from malicious and selfish nodes. We are implementing Extended Public key Cryptography mechanism in ASRP in order to achieve security goals.

  4. Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus

    CERN Document Server

    Fraser, Maia

    2012-01-01

    We present a local routing algorithm which guarantees delivery in all connected graphs embedded on a known surface of genus $g$. The algorithm transports $O(g\\log n)$ memory and finishes in time $O(g^2n^2)$, where $n$ is the size of the graph. It requires access to a homology basis for the surface. This algorithm, GFR, may be viewed as a suitable generalization of Face Routing (FR), the well-known algorithm for plane graphs, which we previously showed does {\\it not} guarantee delivery in graphs embedded on positive genus surfaces. The problem for such surfaces is the potential presence of homologically non-trivial closed walks which may be traversed by the right-hand rule. We use an interesting mathematical property of homology bases (proven in Lemma \\ref{lem:connectFaceBdr}) to show that such walks will not impede GFR. FR is at the base of most routing algorithms used in modern (2D) ad hoc networks: these algorithms all involve additional local techniques to deal with edge-crossings so FR may be applied. GFR...

  5. Flood Routing Technique for Data Networks

    OpenAIRE

    Cho, Jaihyung; Breen, James

    1998-01-01

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

  6. Routing Issues in Opportunistic Networks

    Science.gov (United States)

    Conti, Marco; Crowcroft, Jon; Giordano, Silvia; Hui, Pan; Nguyen, Hoang Anh; Passarella, Andrea

    The opportunistic networking idea stems from the critical review of the research field on Mobile Ad hoc Networks (MANET). After more than ten years of research in the MANET field, this promising technology still has not massively entered the mass market. One of the main reasons of this is nowadays seen in the lack of a practical approach to the design of infrastructure-less multi-hop ad hoc networks [186, 185]. One of the main approaches of conventional MANET research is to design protocols that mask the features of mobile networks via the routing (and transport) layer, so as to expose to higher layers an Internet-like network abstraction. Wireless networks’ peculiarities, such as mobility of users, disconnection of nodes, network partitions, links’ instability, are seen—as in the legacy Internet—as exceptions. This often results in the design of MANET network stacks that are significantly complex and unstable [107].

  7. Shortest Paths and Vehicle Routing

    DEFF Research Database (Denmark)

    Petersen, Bjørn

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

  8. Fast 3D route-planning approach for air vehicle

    Science.gov (United States)

    Tu, Jilin; Ding, Mingyue; Zhou, Chengping; Ai, Haojun

    1997-06-01

    A fast 3-D route planning method for unmanned air vehicle is proposed which can generate physically realizable 3-D route within a reasonable time. Our method includes two steps: First, 2-D route planning generates a route which satisfies turning radius constraint(abbreviated as R-constrained below); second, 3-D route planning generates 3-D route in vertical profile of the 2-D route. To make 2-D route R-constrained, a method is proposed by supposing 2-D route of air vehicle is composed of a sequence of arc route segments and tangential points between neighboring arcs are searching nodes. 3 -D route planning is considered as optimal control problem, and its route can be determined by applying motion equations of air vehicle. The experiments show that our method can produce feasible 3-D routes within a reasonable time, and ensure the planned 3-D routes satisfy aerodynamics constraints of air vehicle.

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

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

    Data.gov (United States)

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

  11. US Hazardous Materials Routes, Geographic WGS84, BTS (2006) [hazardous_material_routes_BTS_2006

    Data.gov (United States)

    Louisiana Geographic Information Center — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes were developed using the 2004 First Edition TIGER/Line files. The routes are...

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

    Directory of Open Access Journals (Sweden)

    T. R. Rangaswamy

    2012-01-01

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

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

    NARCIS (Netherlands)

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

    2016-01-01

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

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

    Science.gov (United States)

    Wigglesivorth, John C.

    2003-01-01

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

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

    NARCIS (Netherlands)

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

    2016-01-01

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

  16. Accessibility in the Smart City

    Directory of Open Access Journals (Sweden)

    Giuseppe Trieste

    2014-07-01

    Full Text Available FIABA is a cultural route for all, its aim is to promote a Global Accessibility and a Universal Usability through the removal of architectural, cultural, psychological and sensory barriers. FIABA is carrying out a real change and a cultural renewal in the name of equal opportunities. Respect for the environment in which we live is also a duty towards the younger generations to whom we must deliver a world in which free movement and the normal use of spaces are goals already achieved. There are millions of citizens who, because of their physical conditions are prisoners in their homes because there isn’t any elevator or any elevator maintenance. FIABA project aims at implementing “a Space for all” or “a landscape for all” following the path of the ONU Convention on the Rights of People with disabilities with an emphasis on architectural, cultural, and psychological barriers, the last ones in particular, create barriers to equal opportunities and they are often carriers of discrimination. The principle of accessibility is invoked in Article 9 of the Convention which confirms the principle that people have a right to live independently and participate fully in all spheres of life and thus States are required to take all necessary measures to ensure accessibility to physical environment, transport, information and communications, including systems and technologies of information and communication and other facilities and services open to the public, both in urban and rural areas.

  17. Layout and Routing Methods for Warehouses

    NARCIS (Netherlands)

    K.J. Roodbergen (Kees-Jan)

    2001-01-01

    textabstractLayout and Routing Methods for Warehouses discusses aspects of order picking in warehouses. Order picking is the process by which products are retrieved from storage to meet customer demand. Various new routing methods are introduced to determine efficient sequences in which products hav

  18. On green routing and scheduling problem

    CERN Document Server

    Touati, Nora

    2012-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

  19. On green routing and scheduling problem

    OpenAIRE

    Touati, Nora; Jost, Vincent

    2011-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

  20. Joint Route Planning under Varying Market Conditions

    NARCIS (Netherlands)

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

    2006-01-01

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

  1. TBRF: Trust Based Routing Framework for WSNs

    Directory of Open Access Journals (Sweden)

    Kushal Gulaskar

    2014-03-01

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

  2. Inventory routing for dynamic waste collection

    NARCIS (Netherlands)

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

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

  3. Secure Geographic Routing Protocols: Issues and Approaches

    CERN Document Server

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

    2011-01-01

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

  4. Performance Evaluation of Routing Protocols in MANET

    Directory of Open Access Journals (Sweden)

    Smitha Sunny

    2015-01-01

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

  5. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.M.J.

    2011-01-01

    Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not

  6. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.M.J.

    2008-01-01

    Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW sol

  7. Routing in Optical and Stochastic Networks

    NARCIS (Netherlands)

    Yang, S.

    2015-01-01

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

  8. Hierarchical Routing over Dynamic Wireless Networks

    CERN Document Server

    Tschopp, Dominique; Grossglauser, Matthias

    2009-01-01

    Wireless network topologies change over time and maintaining routes requires frequent updates. Updates are costly in terms of consuming throughput available for data transmission, which is precious in wireless networks. In this paper, we ask whether there exist low-overhead schemes that produce low-stretch routes. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks.

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

  10. 45 CFR 1310.20 - Trip routing.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 4 2010-10-01 2010-10-01 false Trip routing. 1310.20 Section 1310.20 Public... PROGRAM HEAD START TRANSPORTATION Special Requirements § 1310.20 Trip routing. (a) Each agency providing... the primary consideration. (b) The agency must also ensure that the following basic principles of trip...

  11. Secure Geographic Routing Protocols: Issues and Approaches

    Directory of Open Access Journals (Sweden)

    Mehdi sookhak

    2011-09-01

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

  12. Optical label-controlled transparent metro-access network interface

    DEFF Research Database (Denmark)

    Osadchiy, Alexey Vladimirovich

    This thesis presents results obtained during the course of my PhD research on optical signal routing and interfacing between the metropolitan and access segments of optical networks. Due to both increasing capacity demands and variety of emerging services types, new technological challenges...... are arising for seamlessly interfacing metropolitan and access networks. Therefore, in this PhD project, I have analyzed those technological challenges and identified the key aspects to be addressed. I have also proposed and experimentally verified a number of solutions to metropolitan and access networks...... interfacing and signal routing. Equipment and infrastructure simplification was recognized as the path towards more efficient metropolitan and access networks providing a spectrum of high-bandwidth services to large number of users. Several approaches have been proposed and developed in order to enable...

  13. Individuality in bird migration: routes and timing.

    Science.gov (United States)

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

    2011-08-23

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

  14. Integrated Routing Protocol for Opportunistic Networks

    CERN Document Server

    Verma, Anshul

    2012-01-01

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

  15. Latent factors and route choice behaviour

    DEFF Research Database (Denmark)

    Prato, Carlo Giacomo

    by proposing a methodology for collecting and analyzing behavioural indicators and modelling route choices of individuals driving habitually from home to their workplace. A web-based survey was designed to collect attitudinal data and observed route choices among faculty and staff members of Turin Polytechnic......A behaviourally realistic description of the route choice process should consider variables that are both observable, such as travel time and cost, and unobservable, such as attitudes, perceptions, spatial abilities and network knowledge. This manuscript focuses on automotive route choice behaviour....... A reliable dataset was prepared through measures of internal consistency and sampling adequacy, and data were analyzed with a proper application of factor analysis to the route choice context. For the dataset obtained from the survey, six latent constructs affecting driver behaviour were extracted and scores...

  16. Drug targeting through pilosebaceous route.

    Science.gov (United States)

    Chourasia, Rashmi; Jain, Sanjay K

    2009-10-01

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

  17. Guard Sets for Onion Routing

    Directory of Open Access Journals (Sweden)

    Hayes Jamie

    2015-06-01

    Full Text Available “Entry” guards protect the Tor onion routing system from variants of the “predecessor” attack, that would allow an adversary with control of a fraction of routers to eventually de-anonymize some users. Research has however shown the three guard scheme has drawbacks and Dingledine et al. proposed in 2014 for each user to have a single long-term guard. We first show that such a guard selection strategy would be optimal if the Tor network was failure-free and static. However under realistic failure conditions the one guard proposal still suffers from the classic fingerprinting attacks, uniquely identifying users. Furthermore, under dynamic network conditions using single guards offer smaller anonymity sets to users of fresh guards. We propose and analyze an alternative guard selection scheme by way of grouping guards together to form shared guard sets. We compare the security and performance of guard sets with the three guard scheme and the one guard proposal. We show guard sets do provide increased resistance to a number of attacks, while foreseeing no significant degradation in performance or bandwidth utilization.

  18. Location and Routing of the Defense Courier Service Aerial Network

    Science.gov (United States)

    1991-03-01

    The Vehicle Routing Problem ................ 8 Vehicle Routing Problem Modifications ...... .0 Multiple Depot Problems...several specific formulations are applicable to the DCS aerial network. Those addressed in this review include: 1) the Vehicle Routing Problem (VRP); 2...methodologies show great promise for adaptation to the DCS network. The Vehicle Routing Problem The Travelling Salesman Problem seeks the shortest route which

  19. Analisis Performansi Routing Protocol OLSR Dan AOMDV Pada Vehicular Ad Hoc Network (VANET

    Directory of Open Access Journals (Sweden)

    Rianda Anisia

    2016-09-01

    Full Text Available Vehicular Ad-Hoc Network (VANET is a development of the Mobile Ad-Hoc Network (MANET, which makes the vehicle as its nodes. VANET technology is expected to improve the security of drivers while driving on a highway between the others, with the map location, traffic information, warning if there will be a collision, and internet access in the vehicle. However, VANET has the characteristics of a network rapidly changing due to the rapid movement of nodes that need to have a routing protocol that is considered suitable and efficient so that data transmission can be optimally lasts. This research will be simulated and analyzed the comparative performance of Optimized Link State Routing Protocol (OLSR and Ad Hoc On-demand Multipath Distance Vector (AOMDV using urban conditions (urban. The environment will be tested in speed changes and the effect of the number of nodes nodes. This simulation was done using NS-equipped with SUMO 0.12.3 2:34. as mobility MOVE as a script generator and generator Performance was measured using parameters such as Average throughput comparison, Packet Delivery Ratio, Average End-to-end delay, Normalized Routing Load, and Routing Overhead. Results of analysis in environmental VANET, routing protocols AOMDV superior routing protocol than OLSR. Because almost all parameters tested in scenarios of changes in the number of nodes and node speed AOMDV have better performance so AOMDV more efficient use on urban environmental conditions.

  20. Inter-Cluster Routing Authentication for Ad Hoc Networks by a Hierarchical Key Scheme

    Institute of Scientific and Technical Information of China (English)

    Yueh-Min Huang; Hua-Yi Lin; Tzone-I Wang

    2006-01-01

    Dissimilar to traditional networks, the features of mobile wireless devices that can actively form a network without any infrastructure mean that mobile ad hoc networks frequently display partition due to node mobility or link failures. These indicate that an ad hoc network is difficult to provide on-line access to a trusted authority server. Therefore,applying traditional Public Key Infrastructure (PKI) security framework to mobile ad hoc networks will cause insecurities.This study proposes a scalable and elastic key management scheme integrated into Cluster Based Secure Routing Protocol (CBSRP) to enhance security and non-repudiation of routing authentication, and introduces an ID-Based internal routing authentication scheme to enhance the routing performance in an internal cluster. Additionally, a method of performing routing authentication between internal and external clusters, as well as inter-cluster routing authentication, is developed.The proposed cluster-based key management scheme distributes trust to an aggregation of cluster heads using a threshold scheme faculty, provides Certificate Authority (CA) with a fault tolerance mechanism to prevent a single point of compromise or failure, and saves CA large repositories from maintaining member certificates, making ad hoc networks robust to malicious behaviors and suitable for numerous mobile devices.

  1. Chain Routing: A new routing framework for the Internet based on complete orders

    CERN Document Server

    Arjona-Villicaña, P David; Stepanenko, Alexander S

    2009-01-01

    A new framework to perform routing at the Autonomous System level is proposed in this paper. This mechanism, called Chain Routing, uses complete orders as its main topological unit, which enables a group of Autonomous Systems to define an acyclic structure to route packets to a destination. The employment of complete orders also allows easy identification and avoidance of persistent route oscillations, eliminates the possibility of developing transient loops in paths, and provides a structure that facilitates the implementation of traffic engineering. Moreover, by combining Chain Routing with other mechanisms that implement complete orders in time, we surmise it is possible to design a new routing protocol which could be more reliable and stable than BGP. Although Chain Routing will require an increase of the message overhead and greater coordination between network administrators, the rewards in stability and resilience should more than compensate for this effort.

  2. VT Limited Access Highways

    Data.gov (United States)

    Vermont Center for Geographic Information — A limited-access road, known by various terms worldwide, including limited-access highway, dual carriageway, expressway, and partial controlled access highway, is a...

  3. Fishing Access Areas

    Data.gov (United States)

    Vermont Center for Geographic Information — The Vermont Fish & Wildlife Department maintains developed fishing access areas. These sites provide public access to waters in Vermont for shore fishing...

  4. A new perspective on the access process

    DEFF Research Database (Denmark)

    Bergenholtz, Henning; Gouws, Rufus

    2010-01-01

    Only 10 or 15 years ago, you had to spend hours, days or even weeks in libraries to find data of many kinds. Today, one has access to data at your desks at home. Therefore, the biggest problem for a real information society is not that you do not have access to the needed data, but that you cannot...... find it or that it takes so long to find it that you quit the search before finding the result. This is clearly shown by a Google search where you get so many results that can lead to a case of information stress or even worse information death. An easy search route and a short search time......, including linguistic text books, books presenting the formal spelling and orthographic rules of Afrikaans as well as a monolingual dictionary. The paper argues that the applicability of the access process, as developed in lexicography, goes beyond dictionaries, illustrating the importance of a process...

  5. Routing problems based on hils system platform

    Directory of Open Access Journals (Sweden)

    Andrzej Adamski

    2015-03-01

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

  6. Scottish Access Students in Higher Education. Research Report Series.

    Science.gov (United States)

    Powney, Janet; Hall, Stuart

    This document is the final report on the experiences of mature students who had entered higher education through the Scottish Wider Access Programme (SWAP), a one-year course designed to provide an alternative route into higher education for adults and which utilizes a supportive environment plus an incremental, modular approach and small-group…

  7. Access to the tracheal pulmonary pathway in small rodents

    Directory of Open Access Journals (Sweden)

    Roberto S. A. Ribeiro

    2015-06-01

    Full Text Available ABSTRACT The tracheal pulmonary route is used in diverse experimental models for the study of drugs, infectious agents, and diseases. In view of its importance and associated difficulties, the present article proposes to give research groups up-to-date information on techniques to access the tracheal pulmonary pathway of small rodents.

  8. ENERGY EFFICIENCY AND ROUTING IN SENSOR NETWORKS

    DEFF Research Database (Denmark)

    Cetin, Bilge Kartal

    for dierent network parameters is de- veloped by considering a duty-cycling mechanism in the network. Upper bound on network lifetime is sought by considering idle and sleep mode energy consumption as well as energy consumption in transmission and reception for sensor networks. The solution of the developed...... optimization problems gives an analytical benchmark for designing of maximum lifetime routing algorithms by giving the most energy balanced trac allocation between the possible routes in the network by considering a duty-cycling mechanism. Lastly, an energy ecient routing protocol is proposed and evaluated...

  9. On line routing per mobile phone

    DEFF Research Database (Denmark)

    Bieding, Thomas; Görtz, Simon; Klose, Andreas

    2009-01-01

    . Additionally it is of utmost importance that the employed communication system is suitable integrated with the firm’s enterprise application system and business processes. On basis of a case study, we describe in this paper a system that is cheap and easy to implement due to the use of simple mobile phones......On-line routing is concerned with building vehicle routes in an ongoing fashion in such a way that customer requests arriving dynamically in time are efficiently and effectively served. An indispensable prerequisite for applying on-line routing methods is mobile communication technology...

  10. Pheromone Static Routing Strategy for Complex Networks

    CERN Document Server

    Ling, Xiang; Jiang, Rui; Hu, Mao-Bin

    2011-01-01

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

  11. Traffic Performance Analysis of Manet Routing Protocol

    CERN Document Server

    Rajeswari, S; 10.5121/ijdps.2011.2306

    2011-01-01

    The primary objective of this research work is to study and investigate the performance measures of Gossip Routing protocol and Energy Efficient and Reliable Adaptive Gossip routing protocols. We use TCP and CBR based traffic models to analyze the performance of above mentioned protocols based on the parameters of Packet Delivery Ratio, Average End-to-End Delay and Throughput. We will investigate the effect of change in the simulation time and Number of nodes for the MANET routing protocols. For Simulation, we have used ns-2 simulator.

  12. Multimedia Traffic Routing in Multilayer WDM Networks

    CERN Document Server

    Amphawan, Angela; Hasan, Hassanuddin

    2012-01-01

    The advent of real-time multimedia services over the Internet has stimulated new technologies for expanding the information carrying capacity of optical network backbones. Multilayer wavelength division multiplexing (WDM) packet switching is an emerging technology for increasing the bandwidth of optical networks. Two algorithms for the routing of the multimedia traffic flows were applied: (i) Capacitated Shortest Path First (CSPF) routing, which minimizes the distance of each flow linking the given source and destination nodes and satisfying capacity constraints; and (ii) Flow Deviation Algorithm (FDA) routing, which minimizes the network?wide average packet delay.

  13. Analysis of Enhanced Associativity Based Routing Protocol

    Directory of Open Access Journals (Sweden)

    Said A. Shaar

    2006-01-01

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

  14. Steganographic Routing in Multi Agent System Environment

    CERN Document Server

    Szczypiorski, Krzysztof; Mazurczyk, Wojciech

    2008-01-01

    In this paper we present an idea of trusted communication platform for Multi-Agent Systems (MAS) called TrustMAS. Based on analysis of routing protocols suitable for MAS we have designed a new proactive hidden routing. Proposed steg-agents discovery procedure, as well as further routes updates and hidden communication, are cryptographically independent. Steganographic exchange can cover heterogeneous and geographically outlying environments using available cross-layer covert channels. Finally we have specified rules that agents have to follow to benefit the TrustMAS distributed router platform.

  15. Stability Analysis of Path-vector Routing

    CERN Document Server

    Dimitri, Papadimitriou

    2012-01-01

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

  16. Analysis of Path-vector Routing Stability

    CERN Document Server

    Dimitri, Papadimitriou

    2012-01-01

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

  17. JISC Open Access Briefing Paper

    OpenAIRE

    Swan, Alma

    2005-01-01

    What Open Access is. What Open Access is not. How is Open Access provided? Open Access archives or repositories. Open Access journals. Why should authors provide Open Access to their work? Further information and resources

  18. JISC Open Access Briefing Paper

    OpenAIRE

    Swan, Alma

    2005-01-01

    What Open Access is. What Open Access is not. How is Open Access provided? Open Access archives or repositories. Open Access journals. Why should authors provide Open Access to their work? Further information and resources

  19. Update on Instrumentations for Cholecystectomies Performed via Transvaginal Route: State of the Art and Future Prospectives

    Directory of Open Access Journals (Sweden)

    Elia Pulvirenti

    2010-01-01

    Full Text Available Natural Orifice Transluminal Endoscopic Surgery (NOTES is an innovative approach in which a flexible endoscope enters the abdominal cavity via the transesophageal, transgastric, transcolonic, transvaginal or transvescical route, combining the technique of minimally invasive surgery with flexible endoscopy. Several groups have described different modifications by using flexible endoscopes with different levels of laparoscopic assistance. Transvaginal cholecystectomy (TVC consists in accessing the abdominal cavity through a posterior colpotomy and using the vaginal incision as a visual or operative port. An increasing interest has arisen around the TVC; nevertheless, the most common and highlighted concern is about the lack of specific instruments dedicated to the vaginal access route. TVC should be distinguished between “pure”, in which the entire operation is performed through the transvaginal route, and “hybrid”, in which the colpotomy represents only a support to introduce instruments and the operation is performed mainly by the classic transabdominal-introduced instruments. Although this new technique seems very appealing for patients, on the other hand it is very challenging for the surgeon because of the difficulties related to the mode of access, the limited technology currently available and the risk of complications related to the organ utilized for access. In this brief review all the most recent advancements in the field of TVC's techniques and instrumentations are listed and discussed.

  20. Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Networks

    Directory of Open Access Journals (Sweden)

    V.Jai KumarAssociate

    2016-12-01

    Full Text Available A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET. The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.

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

    Directory of Open Access Journals (Sweden)

    KOMAL

    2014-06-01

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

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

    Directory of Open Access Journals (Sweden)

    Mehajabeen Fatima

    2013-06-01

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

  3. An Enhanced Route Recovery Protocol for Mobile Ad Hoc Networks

    Science.gov (United States)

    Kim, Sangkyung; Park, Noyeul; Kim, Changhwa; Choi, Seung-Sik

    In case of link failures, many ad hoc routing protocols recover a route by employing source-initiated route re-discovery, but this approach can degrade system performance. Some use localized route recovery, which may yield non-optimal paths. Our proposal provides a mechanism that can enhance the overall routing performance by initiating route recovery at the destination node. We elucidate the effects through simulations including comparisons with AODV and AODV with local repair.

  4. Modify AODV Routing Protocol to Improve Motorway Surveillance System Performance

    OpenAIRE

    Layth Abdulkareem Hassnawi; R. Badlishah Ahmad; Abid Yahya

    2012-01-01

    This paper presents an algorithm to modify the Ad Hoc On-Demand Distance Vector (AODV) routing protocol in order to improve the routing performance in motorway surveillance systems. The proposed protocol has all the characteristics of the original AODV routing protocol since it follows all the steps of the route discovery and route maintenance mechanism of the original AODV routing protocol. The Modified AODV (MAODV) is different from the original AODV protocol in that it modifies the origina...

  5. VANET Routing Replay Attack Detection Research Based on SVM

    OpenAIRE

    Fan Qing Gang; Wang Li; Cai Yan Ning; Li Yong Qiang; Chen Jing

    2016-01-01

    In the process of establishing routing in VANET, because of the interference of routing request (RREQ) and routing response (RREP), the nodes in the network are busy with looking for routing or establishing routing. The impact on the network performance is extremely serious, such as increasing a lot of network overhead, consuming valuable bandwidth resources. In this paper, the influence of routing replay attack in VANET is studied. Four typical characteristic are extracted by “cross layer” s...

  6. [Use of the intraosseous route in a premature infant].

    Science.gov (United States)

    Nasimi, A; Gorin, P; Berthier, M; Boussemart, T; Follet-Bouhamed, C; Oriot, D

    1998-04-01

    The intraosseous route (IOR) is a rehabilitated vascular access in emergency situations. Its indications and duration are defined, although the age limit at which it is usable is not clearly established. A 34-week-old preterm neonate, without infection, receiving gastric gavage, developed, at 8 days of life, a severe septic shock requiring ventilatory support and emergency volume expansion via a subclavian catheter. During the chest X-ray to check its position, the catheter was unfortunately pulled out. The child presented an acute desaturation with bradycardia, requiring bag ventilation and endotracheal epinephrine. The umbilical vein being unusable, an intraosseous access (20 G, distal hole, Cook) was performed at the upper tibial level to continue resuscitation and left in place for 14 hours to infuse antibiotics, inotropic support, blood products and colloids. Blood cultures grew Klebsiella pneumoniae. After a severe initial phase, course was favorable with normal examination at 3 years without complication of the IOR. To our knowledge, it is the youngest child in whom IOR was performed. For neonates and especially preterms, the site of puncture is just below the tibial superior tuberosity, otherwise there is a risk of fracture of the diaphysis. This risk justifies the control of the IOR by X-ray. The place of the IOR among emergency vascular accesses in neonates, seems to us to be reserved to situations when umbilical vein is unusable. Although no study compared IOR to superior longitudinal sinus access, we suggest to reserve the sinus access only when IOR has failed, because of its potential cerebral complications.

  7. Performance Evaluation of MANET Routing Protocols

    Directory of Open Access Journals (Sweden)

    Hrituparna Paul

    2012-07-01

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

  8. Latent factors and route choice behaviour

    DEFF Research Database (Denmark)

    Prato, Carlo Giacomo

    . A reliable dataset was prepared through measures of internal consistency and sampling adequacy, and data were analyzed with a proper application of factor analysis to the route choice context. For the dataset obtained from the survey, six latent constructs affecting driver behaviour were extracted and scores...... by proposing a methodology for collecting and analyzing behavioural indicators and modelling route choices of individuals driving habitually from home to their workplace. A web-based survey was designed to collect attitudinal data and observed route choices among faculty and staff members of Turin Polytechnic...... on each factor for each survey participant were calculated. Path generation algorithms were examined with respect to observed behaviour, through a measure of reproduction with deterministic techniques of the routes indicated in the answers to the survey. Results presented evidence that the majority...

  9. Coordinated Platoon Routing in a Metropolitan Network

    Energy Technology Data Exchange (ETDEWEB)

    Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

    2016-10-10

    Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing the platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.

  10. Integrating routing decisions in public transportation problems

    CERN Document Server

    Schmidt, Marie E

    2014-01-01

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

  11. Pharmacokinetics of Alternative Administration Routes of Melatonin

    DEFF Research Database (Denmark)

    Zetner, D.; Andersen, L. P.H.; Rosenberg, J.

    2016-01-01

    Background: Melatonin is traditionally administered orally but has a poor and variable bioavailability. This study aims to present an overview of studies investigating the pharmacokinetics of alternative administration routes of melatonin. Methods: A systematic literature search was performed...... and included experimental or clinical studies, investigating pharmacokinetics of alternative administration routes of melatonin in vivo. Alternative administration routes were defined as all administration routes except oral and intravenous. Results: 10 studies were included in the review. Intranasal...... administration exhibited a quick absorption rate and high bioavailability. Transdermal administration displayed a variable absorption rate and possible deposition of melatonin in the skin. Oral transmucosal administration of melatonin exhibited a high plasma concentration compared to oral administration...

  12. Language and Spatial Cognition in Route Navigation

    Institute of Scientific and Technical Information of China (English)

    宋娟

    2013-01-01

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

  13. Recommended Cross-Desert Driving Route

    Institute of Scientific and Technical Information of China (English)

    2004-01-01

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

  14. A new routing assignment model for Internet

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

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

  15. Multicriteria Evolutionary Weather Routing Algorithm in Practice

    Directory of Open Access Journals (Sweden)

    Joanna Szlapczynska

    2013-03-01

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

  16. Quantum chemistry-assisted synthesis route development

    Energy Technology Data Exchange (ETDEWEB)

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

    2015-12-31

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

  17. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2016-01-01

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

  18. Rich Vehicle Routing Problems and Applications

    DEFF Research Database (Denmark)

    Wen, Min

    The Vehicle Routing Problem (VRP) is one of the most important and challenging optimization problems in the field of Operations Research. It was introduced by Dantzig and Ramser (1959) and defined as the problem of designing the optimal set of routes for a fleet of vehicles in order to serve...... a given set of customers. The VRP is a computationally hard combinatorial problem and has been intensively studied by numerous researchers in the last fifty years. Due to the significant economic benefit that can be achieved by optimizing the routing problems in practice, more and more attention has been...... given to various extensions of the VRP that arise in real life. These extensions are often called Rich Vehicle Routing Problems (RVRPs). In contrast to the research of classical VRP that focuses on the idealized models with unrealistic assumptions, the research of RVRPs considers those complicated...

  19. Dams and Obstructions along Iowa's Canoe Routes

    Data.gov (United States)

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

  20. CERN Access Cards and Access Authorisations

    CERN Multimedia

    2003-01-01

    From the 01/05/2003, all problems relating to access cards and refusal of access to any zone, building or experiment within CERN must be addressed to the Centrale de Surveillance des Accès (CSA building 120) on 78877 or send an e-mail to Access.Surveillance@cern.ch. The responsibles for CERN access control have put into place a procedure with the CSA, Service Enregistrement and the Technical Control Room, to make sure that all problems get resolved in a proper and timely manner.

  1. Light olefins - challenges from new production routes?

    Energy Technology Data Exchange (ETDEWEB)

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

    2007-07-01

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

  2. Latent variables and route choice behavior

    DEFF Research Database (Denmark)

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

    2012-01-01

    In the last decade, a broad array of disciplines has shown a general interest in enhancing discrete choice models by considering the incorporation of psychological factors affecting decision making. This paper provides insight into the comprehension of the determinants of route choice behavior by...... results illustrate that considering latent variables (i.e., memory, habit, familiarity, spatial ability, time saving skills) alongside traditional variables (e.g., travel time, distance, congestion level) enriches the comprehension of route choice behavior....

  3. Energy Efficient Routing in Nomadic Networks

    DEFF Research Database (Denmark)

    Kristensen, Mads Darø; Bouvin, Niels Olof

    2007-01-01

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

  4. A CONTRIBUTION TO SECURE THE ROUTING PROTOCOL

    Directory of Open Access Journals (Sweden)

    Mohammed ERRITALI

    2011-10-01

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

  5. Routing Games : From Egoism to Altruism

    OpenAIRE

    Azad, Amar Prakash; Altman, Eitan; El-Azouzi, Rachid

    2009-01-01

    International audience; The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and that of other users, by controlling the routing of its given flow demand. We parameterize the degree of cooperation which allows to cover the fully non-cooperative behavior, the fully cooperative behavior, and even more, the fully altruistic behavior, all these as special cases of the parameter'...

  6. An Efficient Quality of Service Based Routing Protocol for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Tapan Kumar Godder

    2011-05-01

    Full Text Available Ad-hoc network is set up with multiple wireless devices without any infrastructure. Its employment is favored in many environments. Quality of Service (QoS is one of the main issues for any network and due to bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting Quality of Service (QoS is extremely a challenging task. It is modeled as a multi-layer problem and is considered in both Medium Access Control (MAC and routing layers for ad hoc networks. Ad-hoc On-demand Distance Vector (AODV routing protocol is one of the most used and popular reactive routing protocols in ad-hoc networks. This paper proposed a new protocol QoS based AODV (QAODV which is a modified version of AODV.

  7. Accessibility and sensory experiences

    DEFF Research Database (Denmark)

    Ryhl, Camilla

    2010-01-01

    This article introduces a new design concept; sensory accessibility. While acknowledging the importance of sensory experiences in architectural quality, as well as the importance of accommodating user needs the concept combines three equally important factors; architecture, the senses and accessi......This article introduces a new design concept; sensory accessibility. While acknowledging the importance of sensory experiences in architectural quality, as well as the importance of accommodating user needs the concept combines three equally important factors; architecture, the senses...... and accessibility. Sensory accessibility accommodates aspects of a sensory disability and describes architectural design requirements needed to ensure access to architectural experiences. In the context of architecture accessibility has become a design concept of its own. It is generally described as ensuring...... physical access to the built environment by accommodating physical disabilities. While the existing concept of accessibility ensures the physical access of everyone to a given space, sensory accessibility ensures the choice of everyone to stay and be able to participate and experience....

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

    Directory of Open Access Journals (Sweden)

    L. Keerthana

    2012-06-01

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

  9. Genetic algorithm to solve constrained routing problem with applications for cruise missile routing

    Science.gov (United States)

    Latourell, James L.; Wallet, Bradley C.; Copeland, Bruce

    1998-03-01

    In this paper the use of a Genetic Algorithm to solve a constrained vehicle routing problem is explored. The problem is two-dimensional with obstacles represented as ellipses of uncertainty surrounding each obstacle point. A route is defined as a series of points through which the vehicle sequentially travels from the starting point to the ending point. The physical constraints of total route length and maximum turn angle are included and appear in the fitness function. In order to be valid, a route must go from start to finish without violating any constraint. The effects that different mutation rates and population sizes have on the algorithm's computation speed and ability to find a high quality route are also explored. Finally, possible applications of this algorithm to the problem of route planning for cruise missiles are discussed.

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

  11. Mathematical Modeling of Routing in DHTs

    Science.gov (United States)

    Kersch, Peter; Szabo, Robert

    Although most Distributed Hash Table (DHT) overlays are structurally similar to the "small-world" navigation model of Kleinberg - architectural and algorithmic details of different DHT variants differ significantly. Lookup performance of DHTs depends on a sets of different and often incompatible parameters, which makes analytical comparison rather difficult. The objective of this chapter is to review existing analytical models for DHT routing performance and to introduce a novel framework for the per-hop routing progress analysis of long-range DHT connections based on a logarithmic transformation. With the logarithmic transformation of the DHT metric space we analyze the distribution of the per-hop routing progress in general and also for the special cases of the deterministic and probabilistic power-law routing overlays. Based on the proposed analytical framework routing performance of DHTs can be described by a triple: the long-range connection density, its coefficient of variation and the number of short-range connections. Finally, we derive upper bound on the expected number of routing hops as a function of network size and the parameter triple.

  12. Survivable Lightpath Routing in WDM Optical Networks

    Institute of Scientific and Technical Information of China (English)

    LIUFengqing; ZENGQingji; ZHUXu; YANGXudong; XIAOShilin

    2004-01-01

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

  13. Manet Load Balancing Parallel Routing Protocol

    Directory of Open Access Journals (Sweden)

    Hesham Arafat Ali

    2012-07-01

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

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

  15. Deflection routing in slotted self-routing networks with arbitrary topology

    OpenAIRE

    2002-01-01

    A deflection routing algorithm that can be applied to a novel self-routing address scheme for networks with arbitrary topology is proposed. The proposed deflection routing algorithm can be implemented all-optically using bitwise optical logic gates. Besides the primary output link selection, alternate output link choices by a packet at each node in case of deflection are also encoded in the address header. Priority classes can also be defined in the proposed address scheme. The performance of...

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

    Institute of Scientific and Technical Information of China (English)

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

    2003-01-01

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

  17. Vascular Access Procedures

    Science.gov (United States)

    ... benefits vs. risks? Benefits A central catheter permits infusion of solutions containing medication or nutritional substances without ... products may be given by this route, including antibiotics and blood products. The catheter also may be ...

  18. Region Based Route Planning: Multi-Abstraction Route Planning Based On Intermediate Level Vision Processing

    Science.gov (United States)

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

    1989-01-01

    The Region Based Route Planner performs intermediate-level and high-level processing on vision data to organize the image into more meaningful higher-level topological representations. A variety of representations are employed at appropriate stages in the route plan-ning process. A variety of abstractions are used for the purposes of problem reduction and application of multiple criteria at different phases during the navigation planning process. The Region Based Route Planner operates in terrain scenarios where some or most of the terrain is occluded. The Region Based Route Planner operates without any priori maps. The route planner uses two dimensional representations and utilizes gradient and roughness information. The implementation described here is being tested on the JPL Robotic Vehicle. The Region Based Route Planner operates in two phases. In the first phase, the terrain map is segmented to derive global information about various features in it. The next phase is the actual route planning phase. The route is planned with increasing amounts of detail by successive refinement. This phase has three abstrac-tions. In the first abstraction, the planner analyses high level information and so a coarse, region-to-region plan is produced. The second abstraction produces a list of pairs of entry and exit waypoints for only these selected regions. In the last abstraction, for every pair of these waypoints, a local route planner is invoked. This planner finds a detailed point-to-point path by searching only within the boundaries of these relatively small regions.

  19. Coherent Route Cache In Dynamic Source Routing For Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Sofiane Boukli Hacene

    2012-02-01

    Full Text Available Ad hoc network is a set of nodes that are able to move and can be connected in an arbitrary manner. Each node acts as a router and communicates using a multi-hop wireless links. Nodes within ad hoc networks need efficient dynamic routing protocols to facilitate communication. An Efficient routing protocol can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Several routing protocols exist allowing and facilitating communication between mobile nodes. One of the promising routing protocols is DSR (Dynamic Source Routing. This protocol presents some problems. The major problem in DSR is that the route cache contains some inconsistence routing information; this is due to node mobility. This problem generates longer delays for data packets. In order to reduce the delays we propose a technique based on cleaning route caches for nodes within an active route. Our approach has been implemented and tested in the well known network simulator GLOMOSIM and the simulation results show that protocol performance have been enhanced.

  20. Field Target Allocation and Routing Algorithms for Starbugs

    CERN Document Server

    Goodwin, Michael; Satorre, Christophe; Hong, Sungwook E; Kuehn, Kyler; Lawrence, Jon S

    2014-01-01

    Starbugs are miniaturised robotic devices that position optical fibres over a telescope's focal plane in parallel operation for high multiplex spectroscopic surveys. The key advantage of the Starbug positioning system is its potential to configure fields of hundreds of targets in a few minutes, consistent with typical detector readout times. Starbugs have been selected as the positioning technology for the TAIPAN (Transforming Astronomical Imaging surveys through Polychromatic Analysis of Nebulae) instrument, a prototype for MANIFEST (Many Instrument Fiber System) on the GMT (Giant Magellan Telescope). TAIPAN consists of a 150-fibre Starbug positioner accessing the 6 degree field-of-view of the AAO's UK Schmidt Telescope at Siding Spring Observatory. For TAIPAN, it is important to optimise the target allocation and routing algorithms to provide the fastest configurations times. We present details of the algorithms and results of the simulated performance.

  1. A Routing Mechanism for Cloud Outsourcing of Medical Imaging Repositories.

    Science.gov (United States)

    Godinho, Tiago Marques; Viana-Ferreira, Carlos; Bastião Silva, Luís A; Costa, Carlos

    2016-01-01

    Web-based technologies have been increasingly used in picture archive and communication systems (PACS), in services related to storage, distribution, and visualization of medical images. Nowadays, many healthcare institutions are outsourcing their repositories to the cloud. However, managing communications between multiple geo-distributed locations is still challenging due to the complexity of dealing with huge volumes of data and bandwidth requirements. Moreover, standard methodologies still do not take full advantage of outsourced archives, namely because their integration with other in-house solutions is troublesome. In order to improve the performance of distributed medical imaging networks, a smart routing mechanism was developed. This includes an innovative cache system based on splitting and dynamic management of digital imaging and communications in medicine objects. The proposed solution was successfully deployed in a regional PACS archive. The results obtained proved that it is better than conventional approaches, as it reduces remote access latency and also the required cache storage space.

  2. World Wide Access: Accessible Web Design.

    Science.gov (United States)

    Washington Univ., Seattle.

    This brief paper considers the application of "universal design" principles to Web page design in order to increase accessibility for people with disabilities. Suggestions are based on the World Wide Web Consortium's accessibility initiative, which has proposed guidelines for all Web authors and federal government standards. Seven guidelines for…

  3. Challenges and Future Prospects for the Delivery of Biologics: Oral Mucosal, Pulmonary, and Transdermal Routes.

    Science.gov (United States)

    Morales, Javier O; Fathe, Kristin R; Brunaugh, Ashlee; Ferrati, Silvia; Li, Song; Montenegro-Nicolini, Miguel; Mousavikhamene, Zeynab; McConville, Jason T; Prausnitz, Mark R; Smyth, Hugh D C

    2017-02-13

    Biologic products are large molecules such as proteins, peptides, nucleic acids, etc., which have already produced many new drugs for clinical use in the last decades. Due to the inherent challenges faced by biologics after oral administration (e.g., acidic stomach pH, digestive enzymes, and limited permeation through the gastrointestinal tract), several alternative routes of administration have been investigated to enable sufficient drug absorption into systemic circulation. This review describes the buccal, sublingual, pulmonary, and transdermal routes of administration for biologics with relevant details of the respective barriers. While all these routes avoid transit through the gastrointestinal tract, each has its own strengths and weaknesses that may be optimal for specific classes of compounds. Buccal and sublingual delivery enable rapid drug uptake through a relatively permeable barrier but are limited by small epithelial surface area, stratified epithelia, and the practical complexities of maintaining a drug delivery system in the mouth. Pulmonary delivery accesses the highly permeable and large surface area of the alveolar epithelium but must overcome the complexities of safe and effective delivery to the alveoli deep in the lung. Transdermal delivery offers convenient access to the body for extended-release delivery via the skin surface but requires the use of novel devices and formulations to overcome the skin's formidable stratum corneum barrier. New technologies and strategies advanced to overcome these challenges are reviewed, and critical views in future developments of each route are given.

  4. An Intermodal Transport Route within the Hinterland of the Bakar Ro-Ro Terminal

    Directory of Open Access Journals (Sweden)

    Hrvoje Baričević

    2006-09-01

    Full Text Available The geographical/traffic position of the P01t of Rijeka is animportant factor in its integration into the European traffic system.In this respect, Bakar emerges as an important point,which, unfortunately, has not been sufficiently valorised andtherefore holds much unused potential (especially in the formercoke plant area. The existing infrastructure facilities and theirtechnical and traffic elements synthesize the aim for a well-balancedmaritime, road and/or railway traffic. The road freighttransport routes correspond to the distant traffic itineraries towardsBakar, i.e. the Rijeka Traffic Junction, and further towardsthe Italian Port of Chioggia. These are the routes fromthe continental hinterland, i.e. Central and Eastern Europe,which primarily exist as two access routes from Zagreb andLjubljana and, secondarily from Dalmatia and !stria. In the future,the Rijeka Traffic Junction access road together with themotorway links will be integrated into the Rijeka by-pass Road.A possibility of introducing intermodal railway alternativeshould be considered as well as the ''piggyback" system. The assumptionsfor the justification of such operations should be examinedin a special research taking into consideration similar,already well-established intermodal services in Europe. Theset-up of the existing Rijeka Traffic Junction infrastructure andsuprastructure allows for an uninhibited start of an extremelypositive initiative. Howeve1; an efficient intermodal route betweenthe countries of Central and Eastern Europe and NorthernItalian ports is possible only with an integrated logistic support.

  5. Access Nets: Modeling Access to Physical Spaces

    Science.gov (United States)

    Frohardt, Robert; Chang, Bor-Yuh Evan; Sankaranarayanan, Sriram

    Electronic, software-managed mechanisms using, for example, radio-frequency identification (RFID) cards, enable great flexibility in specifying access control policies to physical spaces. For example, access rights may vary based on time of day or could differ in normal versus emergency situations. With such fine-grained control, understanding and reasoning about what a policy permits becomes surprisingly difficult requiring knowledge of permission levels, spatial layout, and time. In this paper, we present a formal modeling framework, called AccessNets, suitable for describing a combination of access permissions, physical spaces, and temporal constraints. Furthermore, we provide evidence that model checking techniques are effective in reasoning about physical access control policies. We describe our results from a tool that uses reachability analysis to validate security policies.

  6. An efficient geo-routing aware MAC protocol for underwater acoustic networks

    Directory of Open Access Journals (Sweden)

    Yibo Zhu

    2011-09-01

    Full Text Available In this paper, we propose an efficient geo-routing aware MAC protocol (GOAL for underwater acoustic networks. It smoothly integrates self-adaptation based REQ/REP handshake, geographic cyber carrier sensing, and implicit ACK to perform combined channel reservation and next-hop selection. As a result, it incorporates the advantages of both a geo-routing protocol and a reservation-based medium access control (MAC protocol. Specifically, with its self-adaptation based REQ/REP, nodes can dynamically detect the best next-hop with low route discovery cost. In addition, through geographic cyber carrier sensing, a node can map its neighbors’ time slots for sending/receiving DATA packets to its own time line, which allows the collision among data packets to be greatly reduced. With these features, GOAL outperforms geo-routing protocols coupling with broadcast MAC. Simulation results show that GOAL provides much higher end-to-end reliability with lower energy consumptions than existing Vector-Based Forwarding (VBF routing with use of a broadcast MAC protocol. Moreover, we develop a theoretical model for the probability of a successful handshake, which coincides well with the simulation results.

  7. A novel synthetic route for 2-[2-(2,2,2-trifluoroethoxy)phenoxy] ethanamine

    Institute of Scientific and Technical Information of China (English)

    Xiao Chuan Luo; Guo Hua Chen; Hui Bin Zhang; Wen Long Huang

    2008-01-01

    2-[2-(2,2,2-Trifluoroethoxy)phenoxy]ethanamine is the key intermediate of Silodosin, the α1-adrenoceptor antagonist for thetreatment of benign prostatic hyperplasia. In order to obtain this intermediate, we developed a novel synthetic route by utilizing 2-nitrochlorobenzene as the starting material via O-alkylation, reduction, diazotization, acidolysis, etherification, condensation andhydrazinolysis. The highlight of this method lies on its convenience and economy in accessing this intermediate.

  8. Underwater Acoustic Wireless Sensor Networks: Advances and Future Trends in Physical, MAC and Routing Layers

    Directory of Open Access Journals (Sweden)

    Salvador Climent

    2014-01-01

    Full Text Available This survey aims to provide a comprehensive overview of the current researchon underwater wireless sensor networks, focusing on the lower layers of the communicationstack, and envisions future trends and challenges. It analyzes the current state-of-the-art onthe physical, medium access control and routing layers. It summarizes their security threadsand surveys the currently proposed studies. Current envisioned niches for further advances inunderwater networks research range from efficient, low-power algorithms and

  9. Professional Access 2013 programming

    CERN Document Server

    Hennig, Teresa; Hepworth, George; Yudovich, Dagi (Doug)

    2013-01-01

    Authoritative and comprehensive coverage for building Access 2013 Solutions Access, the most popular database system in the world, just opened a new frontier in the Cloud. Access 2013 provides significant new features for building robust line-of-business solutions for web, client and integrated environments.  This book was written by a team of Microsoft Access MVPs, with consulting and editing by Access experts, MVPs and members of the Microsoft Access team. It gives you the information and examples to expand your areas of expertise and immediately start to develop and upgrade projects. Exp

  10. Metagenomics: an inexhaustible access to nature's diversity.

    Science.gov (United States)

    Langer, Martin; Gabor, Esther M; Liebeton, Klaus; Meurer, Guido; Niehaus, Frank; Schulze, Renate; Eck, Jürgen; Lorenz, Patrick

    2006-01-01

    The chemical industry has an enormous need for innovation. To save resources, energy and time, currently more and more established chemical processes are being switched to biotechnological routes. This requires white biotechnology to discover and develop novel enzymes, biocatalysts and applications. Due to a limitation in the cultivability of microbes living in certain habitats, technologies have to be established which give access to the enormous resource of uncultivated microbial diversity. Metagenomics promises to provide new and diverse enzymes and biocatalysts as well as bioactive molecules and has the potential to make industrial biotechnology an economic, sustainable success.

  11. Allocation and Routing of CRAF MD80 Aircraft

    Science.gov (United States)

    1990-03-01

    5 II. Literature Review...................7 Formal Statement of the Vehicle Routing Problem ............ .. . .. .. ....... Vehicle...83 Appendix H: Example Vehicle Routing Problem Input 84 Appendix I: Example Vehicle Routing Problem Output 85 Appendix J: Spacefilling Curve...this problem is a stochastic vehicle routing problem with multiple depots. In this case, there are nine depots and 30 vehicles corresponding to nine

  12. Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networks

    OpenAIRE

    Jacquet, Philippe; Naimi, Amina Meraihi; Rodolakis, Georgios

    2005-01-01

    International audience; In this paper we show that the CSMA IEEE 802.11 protocol (Wifi) provides packet access delays asymptotics in power law. This very feature allows us to specify optimal routing via polynomial algorithm while the general case is NP-hard.

  13. Eccentricity in Zone Routing Protocol for MANET

    Directory of Open Access Journals (Sweden)

    Mrs Komal Nair

    2012-06-01

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

  14. An Indirect Route for Ethanol Production

    Energy Technology Data Exchange (ETDEWEB)

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

    2005-04-29

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

  15. A Packet Routing Model for Computer Networks

    Directory of Open Access Journals (Sweden)

    O. Osunade

    2012-05-01

    Full Text Available The quest for reliable data transmission in today’s computer networks and internetworks forms the basis for which routing schemes need be improved upon. The persistent increase in the size of internetwork leads to a dwindling performance of the present routing algorithms which are meant to provide optimal path for forwarding packets from one network to the other. A mathematical and analytical routing model framework is proposed to address the routing needs to a substantial extent. The model provides schemes typical of packet sources, queuing system within a buffer, links and bandwidth allocation and time-based bandwidth generator in routing chunks of packets to their destinations. Principal to the choice of link are such design considerations as least-congested link in a set of links, normalized throughput, mean delay and mean waiting time and the priority of packets in a set of prioritized packets. These performance metrics were targeted and the resultant outcome is a fair, load-balanced network.

  16. The Balanced Billing Cycle Vehicle Routing Problem

    Energy Technology Data Exchange (ETDEWEB)

    Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University

    2009-01-01

    Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer s usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter-reading routes. On the other hand, the addition of new customers and locations requires the utility company to add newstops to the existing routes. A utility that does not adjust its meter-reading routes over time can find itself with inefficient routes and, subsequently, higher meter-reading costs. Furthermore, the utility can end up with certain billing days that require substantially larger meter-reading resources than others. However, remedying this problem is not as simple as it may initially seem. Certain regulatory and customer service considerations can prevent the utility from shifting a customer s billing day by more than a few days in either direction. Thus, the problem of reducing the meterreading costs and balancing the workload can become quite difficult. We describe this Balanced Billing Cycle Vehicle Routing Problem in more detail and develop an algorithm for providing solutions to a slightly simplified version of the problem. Our algorithm uses a combination of heuristics and integer programming via a three-stage algorithm. We discuss the performance of our procedure on a real-world data set.

  17. Routing algorithms in networks-on-chip

    CERN Document Server

    Daneshtalab, Masoud

    2014-01-01

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

  18. Low Carbon Footprint Routes for Bird Watching

    Directory of Open Access Journals (Sweden)

    Wei-Ta Fang

    2015-03-01

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

  19. Alternative routes to olefins. Chances and challenges

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-11-01

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

  20. Routes to Reading and Spelling: Testing the Predictions of Dual-Route Theory

    Science.gov (United States)

    Sheriston, Lee; Critten, Sarah; Jones, Emily

    2016-01-01

    Dual-route theory, which emphasizes the importance of lexical and nonlexical routes, makes specific predictions about the kinds of strategies that young students might adopt when attempting to correctly read and spell regular and irregular words. The current study tests these predictions by assessing strategy choice on regular, irregular, and…

  1. Automatic Extraction of Destinations, Origins and Route Parts from Human Generated Route Directions

    Science.gov (United States)

    Zhang, Xiao; Mitra, Prasenjit; Klippel, Alexander; Maceachren, Alan

    Researchers from the cognitive and spatial sciences are studying text descriptions of movement patterns in order to examine how humans communicate and understand spatial information. In particular, route directions offer a rich source of information on how cognitive systems conceptualize movement patterns by segmenting them into meaningful parts. Route directions are composed using a plethora of cognitive spatial organization principles: changing levels of granularity, hierarchical organization, incorporation of cognitively and perceptually salient elements, and so forth. Identifying such information in text documents automatically is crucial for enabling machine-understanding of human spatial language. The benefits are: a) creating opportunities for large-scale studies of human linguistic behavior; b) extracting and georeferencing salient entities (landmarks) that are used by human route direction providers; c) developing methods to translate route directions to sketches and maps; and d) enabling queries on large corpora of crawled/analyzed movement data. In this paper, we introduce our approach and implementations that bring us closer to the goal of automatically processing linguistic route directions. We report on research directed at one part of the larger problem, that is, extracting the three most critical parts of route directions and movement patterns in general: origin, destination, and route parts. We use machine-learning based algorithms to extract these parts of routes, including, for example, destination names and types. We prove the effectiveness of our approach in several experiments using hand-tagged corpora.

  2. Children's route choice during active transportation to school : difference between shortest and actual route

    NARCIS (Netherlands)

    Dessing, D.; Vries, S.I. (Sanne); Hegeman, G.; Mechelen, W. van; Pierik, F.H.

    2016-01-01

    Background: The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible r

  3. On increasing network lifetime in body area networks using global routing with energy consumption balancing.

    Science.gov (United States)

    Tsouri, Gill R; Prieto, Alvaro; Argade, Nikhil

    2012-09-26

    Global routing protocols in wireless body area networks are considered. Global routing is augmented with a novel link cost function designed to balance energy consumption across the network. The result is a substantial increase in network lifetime at the expense of a marginal increase in energy per bit. Network maintenance requirements are reduced as well, since balancing energy consumption means all batteries need to be serviced at the same time and less frequently. The proposed routing protocol is evaluated using a hardware experimental setup comprising multiple nodes and an access point. The setup is used to assess network architectures, including an on-body access point and an off-body access point with varying number of antennas. Real-time experiments are conducted in indoor environments to assess performance gains. In addition, the setup is used to record channel attenuation data which are then processed in extensive computer simulations providing insight on the effect of protocol parameters on performance. Results demonstrate efficient balancing of energy consumption across all nodes, an average increase of up to 40% in network lifetime corresponding to a modest average increase of 0.4 dB in energy per bit, and a cutoff effect on required transmission power to achieve reliable connectivity.

  4. Optimal Relay Selection using Efficient Beaconless Geographic Contention-Based Routing Protocol in Wireless Adhoc Networks

    Directory of Open Access Journals (Sweden)

    G. Srimathy

    2012-04-01

    Full Text Available In Wireless Ad hoc network, cooperation of nodes can be achieved by more interactions at higher protocol layers, particularly the MAC (Medium Access Control and network layers play vital role. MAC facilitates a routing protocol based on position location of nodes at network layer specially known as Beacon-less geographic routing (BLGR using Contention-based selection process. This paper proposes two levels of cross-layer framework -a MAC network cross-layer design for forwarder selection (or routing and a MAC-PHY for relay selection. CoopGeo; the proposed cross-layer protocol provides an efficient, distributed approach to select next hops and optimal relays to form a communication path. Wireless networks suffers huge number of communication at the same time leads to increase in collision and energy consumption; hence focused on new Contention access method that uses a dynamical change of channel access probability which can reduce the number of contention times and collisions. Simulation result demonstrates the best Relay selection and the comparative of direct mode with the cooperative networks. And Performance evaluation of contention probability with Collision avoidance.

  5. Ad Hoc Access Gateway Selection Algorithm

    Science.gov (United States)

    Jie, Liu

    With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network.

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

    Science.gov (United States)

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

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

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

    CERN Document Server

    Kataria, Jayesh; Sanyal, Sugata

    2010-01-01

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

  8. Design for Accessibility

    DEFF Research Database (Denmark)

    Herriott, Richard

    2012-01-01

    A report on how nine rail builder, operators and transport designers deal with design for accessibility......A report on how nine rail builder, operators and transport designers deal with design for accessibility...

  9. Ontology Based Access Control

    Directory of Open Access Journals (Sweden)

    Özgü CAN

    2010-02-01

    Full Text Available As computer technologies become pervasive, the need for access control mechanisms grow. The purpose of an access control is to limit the operations that a computer system user can perform. Thus, access control ensures to prevent an activity which can lead to a security breach. For the success of Semantic Web, that allows machines to share and reuse the information by using formal semantics for machines to communicate with other machines, access control mechanisms are needed. Access control mechanism indicates certain constraints which must be achieved by the user before performing an operation to provide a secure Semantic Web. In this work, unlike traditional access control mechanisms, an "Ontology Based Access Control" mechanism has been developed by using Semantic Web based policies. In this mechanism, ontologies are used to model the access control knowledge and domain knowledge is used to create policy ontologies.

  10. Physical Access Control Database -

    Data.gov (United States)

    Department of Transportation — This data set contains the personnel access card data (photo, name, activation/expiration dates, card number, and access level) as well as data about turnstiles and...

  11. Comparison of Two Hierarchical Routing Protocols for Heterogeneous MANET

    Science.gov (United States)

    2007-10-01

    protocols (e.g. Ad-Hoc On-Demand Distance Vector routing protocol , AODV ) search for and maintain routes to destination nodes upon demand from...the time it takes to find a route when data needs to be sent. Protocols such as OLSR and AODV support nodes having multiple interfaces. However they...hierarchical ad hoc routing protocols are derived from a “flat” ad routing protocol . For instance, H- AODV [8] and H-DSR [11] are examples

  12. Defining and Computing Alternative Routes in Road Networks

    CERN Document Server

    Dees, Jonathan; Sanders, Peter; Bader, Roland

    2010-01-01

    Every human likes choices. But today's fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative routes, but this topic has not been studied thoroughly. Often, the aspect of meaningful alternative routes is neglected from a human point of view. We fill in this gap by suggesting mathematical definitions for such routes. As a second contribution we propose heuristics to compute them, as this is NP-hard in general.

  13. Theory and New Primitives for Safely Connecting Routing Protocol Instances

    Science.gov (United States)

    2010-08-01

    reliability, and load. The current route redistribution procedure handles this incompatibility in a crude fashion. It resets the metric of a redis ...routing instances can also be performed in a link-state manner whereby one routing instance passes on its entire link state database to another...routers B and A, respectively. However, route redis - tribution at multiple points can easily result in routing anomalies [8]. Hence, to support

  14. Access Control Enforcement Testing

    OpenAIRE

    El Kateb, Donia; Elrakaiby, Yehia; Mouelhi, Tejeddine; Le Traon, Yves

    2012-01-01

    A policy-based access control architecture com- prises Policy Enforcement Points (PEPs), which are modules that intercept subjects access requests and enforce the access decision reached by a Policy Decision Point (PDP), the module implementing the access decision logic. In applications, PEPs are generally implemented manually, which can introduce errors in policy enforcement and lead to security vulnerabilities. In this paper, we propose an approach to systematically test and validate the co...

  15. Waste Collection Vehicle Routing Problem: Literature Review

    Directory of Open Access Journals (Sweden)

    Hui Han

    2015-08-01

    Full Text Available Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP in literature. Based on a classification of waste collection (residential, commercial and industrial, firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

  16. Trust Based Routing in Ad Hoc Network

    Science.gov (United States)

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

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

  17. Genetic algorithms for the vehicle routing problem

    Science.gov (United States)

    Volna, Eva

    2016-06-01

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

  18. Next Generation Network Routing and Control Plane

    DEFF Research Database (Denmark)

    Fu, Rong

    -constrains). It is shown by the simulation and analysis that the proposed DPV enhanced PCE inter-domain routing architecture improves the performance of BRPC mechanism in terms of reducing the blocking probabilities and increasing the network inter-domain link utilization. The proposed algorithms enable the PCE compute......Concerning the high performance, QoS supported transport services, it is not sufficient that only the traffic transport under a single domain or Autonomous System (AS) is under the consideration. Inter-domain QoS routing is also in a great need. As there has been empirically and theoretically...... proved, the dominating Border Gateway Protocol (BGP) cannot address all the issues that in inter-domain QoS routing. Thus a new protocol or network architecture has to be developed to be able to carry the inter-domain traffic with the QoS and TE consideration. Moreover, the current network control also...

  19. Crosstalk-Aware Routing Resource Assignment

    Institute of Scientific and Technical Information of China (English)

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

    2005-01-01

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

  20. Pheromone Static Routing Strategy for Complex Networks

    Science.gov (United States)

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

    2012-12-01

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

  1. Predication-Based Intelligence Routing on Telecommunications

    Institute of Scientific and Technical Information of China (English)

    DONGJun; HEJifeng; PANYunhe

    2004-01-01

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

  2. Towards Building an Intelligent Call Routing System

    Directory of Open Access Journals (Sweden)

    Thien Khai Tran

    2016-01-01

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

  3. Generalized routing protocols for multihop relay networks

    KAUST Repository

    Khan, Fahd Ahmed

    2011-07-01

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

  4. Evolution Strategies in the Multipoint Connections Routing

    Directory of Open Access Journals (Sweden)

    L. Krulikovska

    2010-09-01

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

  5. Prevention of Routing Attacks In Manet

    Directory of Open Access Journals (Sweden)

    N.Rajesh

    2013-01-01

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

  6. Quantitative analysis of access strategies to remote information in network services

    DEFF Research Database (Denmark)

    Olsen, Rasmus Løvenstein; Schwefel, Hans-Peter; Hansen, Martin Bøgsted

    2006-01-01

    Remote access to dynamically changing information elements is a required functionality for various network services, including routing and instances of context-sensitive networking. Three fundamentally different strategies for such access are investigated in this paper: (1) a reactive approach......, network delay characterization) and specific requirements on mismatch probability, traffic overhead, and access delay. Finally, the analysis is applied to the use-case of context-sensitive service discovery....

  7. The Geomorphological Effects of Old Routes

    Science.gov (United States)

    Martinek, Jan; Bíl, Michal

    2017-04-01

    The communication network in rural areas in the historical Czech Lands predominantly consisted of unpaved routes prior to the eighteenth century. Certain parts of the network were transformed gradually into the current roads and are now being used by motor traffic. The majority of the old routes form, however, an abandoned network the remnants of which (abandoned during the Middle Ages or even earlier) are currently being discovered. Certain segments of used unpaved routes were, over the course of time, transformed into holloways (sunken lanes) and consequently also abandoned. The degree of incision of the holloway into the soil was determined by local geological conditions. Routes, which were abandoned due to more difficult transport in holloways, have distinct linear forms and can often be found as a grouping of parallel holloways. This indicates that these routes were frequently used or localized on low-resistant ground. Analyses of the precise digital elevation models, derived from LIDAR data, can reveal the distinct pattern of an old route network quite often interacting with other geomorphological phenomena (e.g., landslides, streams) or old human constructions (e.g., fortified settlements). We will present several cases where old paths interacted with landslides. These facts can consequently be used for dating the purposes of both the landslides and the old path sections. General erosion impacts, the degree of incision of the old transportation lines, can also be quantified through analyses of digital elevation models taking into consideration the former and new, incised, surface. We will demonstrate the methodology used for these analyses and the preliminary results.

  8. Mathematical Aspects of Network Routing Optimization

    CERN Document Server

    Oliveira, Carlos AS

    2011-01-01

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

  9. The Team Orienteering Arc Routing Problem

    OpenAIRE

    Archetti, Claudia; Speranza, M. Grazia; Corberan, Angel; Sanchís Llopis, José María; Plana, Isaac

    2014-01-01

    The team orienteering arc routing problem (TOARP) is the extension to the arc routing setting of the team orienteering problem. In the TOARP, in addition to a possible set of regular customers that have to be serviced, another set of potential customers is available. Each customer is associated with an arc of a directed graph. Each potential customer has a profit that is collected when it is serviced, that is, when the associated arc is traversed. A fleet of vehicles with a given maximum trav...

  10. A Generalized Assignment Heuristic for Vehicle Routing

    Science.gov (United States)

    1979-08-01

    1977), 517-524. 20. Shuster, K. A. and D. A. Schur.- "A Heuristic Approach to Routing Solid Waste Collection Vehicles," U.S. Environmental Protection...this problem by ( VRP ). L. . . . .. i -3- Formulation of the Vehicle Routing Problem ( VRP ) min Z c X. (1)ijk 1) i jk S.t. Z aiYik < bk , k ,...,K (2) 1...developing a sophisticated solution theory for the traveling salesman and generalized assignment models embedded within ( VRP ). By con- trast

  11. Enabling Routes as Context in Mobile Services

    DEFF Research Database (Denmark)

    Brilingaite, Agne; Jensen, Christian Søndergaard; Zokaite, Nora

    by a small screen and no keyboard, and by the service being only a secondary focus of the user. Under such circumstances, it is particularly important to deliver the "right" information and service at the right time, with as little user interaction as possible. This may be achieved by making services context...... and accumulates the routes of a user along with their usage patterns and that makes the routes available to services. Experiences from using the component on logs of GPS positions acquired from vehicles traveling within a real road network are reported....

  12. An Improved Wireless Sensor Network Routing Algorithm

    Institute of Scientific and Technical Information of China (English)

    Shengmei Luo; Xue Li; Yiai Jin; Zhixin Sun

    2015-01-01

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

  13. Optimized QoS Routing Algorithm

    Institute of Scientific and Technical Information of China (English)

    石明洪; 王思兵; 白英彩

    2004-01-01

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

  14. Ambient noise near the sea-route

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

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

  15. Ambient noise near the sea-route

    Institute of Scientific and Technical Information of China (English)

    HE Li; LI ZhengLin; PENG ZhaoHui

    2009-01-01

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

  16. Reconfigurable Robust Routing for Mobile Outreach Network

    Science.gov (United States)

    Lin, Ching-Fang

    2010-01-01

    The Reconfigurable Robust Routing for Mobile Outreach Network (R3MOO N) provides advanced communications networking technologies suitable for the lunar surface environment and applications. The R3MOON techn ology is based on a detailed concept of operations tailored for luna r surface networks, and includes intelligent routing algorithms and wireless mesh network implementation on AGNC's Coremicro Robots. The product's features include an integrated communication solution inco rporating energy efficiency and disruption-tolerance in a mobile ad h oc network, and a real-time control module to provide researchers an d engineers a convenient tool for reconfiguration, investigation, an d management.

  17. Network Congestion Control with Markovian Multipath Routing

    CERN Document Server

    Cominetti, Roberto

    2011-01-01

    In this paper we consider an integrated model for TCP/IP protocols with multipath routing. The model combines a Network Utility Maximization for rate control based on end-to-end queuing delays, with a Markovian Traffic Equilibrium for routing based on total expected delays. We prove the existence of a unique equilibrium state which is characterized as the solution of an unconstrained strictly convex program. A distributed algorithm for solving this optimization problem is proposed, with a brief discussion of how it can be implemented by adapting the current Internet protocols.

  18. BGP Route Analysis and Management Systems

    CERN Document Server

    Stewart, Alex A

    2009-01-01

    The Border Gateway Protocol (BGP) is an important component in today's IP network infrastructure. As the main routing protocol of the Internet, clear understanding of its dynamics is crucial for configuring, diagnosing and debugging Internet routing problems. Despite the increase in the services that BGP provide such as MPLS VPNs, there is no much progress achieved in automating the BGP management tasks. In this paper we discuss some of the problems encountered by network engineers when managing BGP networks. We also describe some of the open source tools and methods that attempt to resolve these issues. Then we present some of the features that, if implemented, will ease BGP management related tasks.

  19. A Survey of Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Cao Wujun

    2017-01-01

    Full Text Available In recent years, vehicle routing problem (VRP has become an important content in logistics management research, and has been widely used in transportation system, logistics distribution system and express delivery system. In this paper, we discuss the classification of VRP, and summarize the common constraints of VRP, model algorithm and the main research results in recent years. Finally, we analyzes the future of VRP, and it is considered that the intelligent vehicle routing problem and intelligent heuristic algorithm will be an important field of future research.

  20. Cooperative HARQ with Poisson Interference and Opportunistic Routing

    KAUST Repository

    Kaveh, Mostafa

    2014-01-06

    This presentation considers reliable transmission of data from a source to a destination, aided cooperatively by wireless relays selected opportunistically and utilizing hybrid forward error correction/detection, and automatic repeat request (Hybrid ARQ, or HARQ). Specifically, we present a performance analysis of the cooperative HARQ protocol in a wireless adhoc multihop network employing spatial ALOHA. We model the nodes in such a network by a homogeneous 2-D Poisson point process. We study the tradeoff between the per-hop rate, spatial density and range of transmissions inherent in the network by optimizing the transport capacity with respect to the network design parameters, HARQ coding rate and medium access probability. We obtain an approximate analytic expression for the expected progress of opportunistic routing and optimize the capacity approximation by convex optimization. By way of numerical results, we show that the network design parameters obtained by optimizing the analytic approximation of transport capacity closely follows that of Monte Carlo based exact transport capacity optimization. As a result of the analysis, we argue that the optimal HARQ coding rate and medium access probability are independent of the node density in the network.

  1. Direct cervical arterial access for intracranial endovascular treatment

    Energy Technology Data Exchange (ETDEWEB)

    Blanc, R. [Fondation Rothschild, Department of Interventional Neuroradiology, Paris (France); APHP, Hopital Henri Mondor, Service de Neuroradiologie Diagnostique et Therapeutique, Creteil Cedex (France); Piotin, M.; Mounayer, C.; Spelle, L. [Fondation Rothschild, Department of Interventional Neuroradiology, Paris (France); Moret, J. [Fondation Rothschild, Department of Interventional Neuroradiology, Paris (France); Hopital de la Fondation Ophtalmologique Adolphe de Rothschild, Service de Neuroradiologie Interventionnelle, Paris Cedex 19 (France)

    2006-12-15

    Tortuous vasculature is a cause of failure of endovascular treatment of intracranial vascular lesions. We report our experience of direct cervical accesses in patients in whom the arterial femoral route was not attainable. In this retrospective study, 42 direct punctures of the carotid or the vertebral arteries at the neck were performed in 38 patients. The vessel harboring the intracranial lesion was punctured at the neck above the main tortuosity, a sheath was then positioned under fluoroscopic control to allow a stable access to the intracranial circulation. After the procedure, the sheath was removed and hemostasis was gained either by manual compression or by an arterial closure device (4 of 42, 9%). The cervical route allowed access to all intracranial lesions in all 42 procedures. A complication was encountered in six procedures (14%) related to the direct puncture. In 2 of the 42 procedures (4%), a transient vasospasm was encountered. A cervical hematoma formed in 3 of the 42 procedures (7%) after sheath withdrawal (one patient in whom an 8F sheath had been used, required surgical evacuation of a hematoma compressing the upper airways; the other patients did well without surgical evacuation). In the remaining patient (1 of 42 procedures, 2%), a small asymptomatic aneurysm at the puncture site was seen on the follow-up angiogram. Direct cervical arterial approaches to accessing the intracranial circulation is effective in patients in whom the femoral route does not allow the navigation and stabilization of guiding catheters. (orig.)

  2. Pro Access 2010 Development

    CERN Document Server

    Collins, Mark

    2011-01-01

    Pro Access 2010 Development is a fundamental resource for developing business applications that take advantage of the features of Access 2010 and the many sources of data available to your business. In this book, you'll learn how to build database applications, create Web-based databases, develop macros and Visual Basic for Applications (VBA) tools for Access applications, integrate Access with SharePoint and other business systems, and much more. Using a practical, hands-on approach, this book will take you through all the facets of developing Access-based solutions, such as data modeling, co

  3. Access 2013 for dummies

    CERN Document Server

    Ulrich Fuller, Laurie

    2013-01-01

    The easy guide to Microsoft Access returns with updates on the latest version! Microsoft Access allows you to store, organize, view, analyze, and share data; the new Access 2013 release enables you to build even more powerful, custom database solutions that integrate with the web and enterprise data sources. Access 2013 For Dummies covers all the new features of the latest version of Accessand serves as an ideal reference, combining the latest Access features with the basics of building usable databases. You'll learn how to create an app from the Welcome screen, get support

  4. Android Access Control Extension

    Directory of Open Access Journals (Sweden)

    Anton Baláž

    2015-12-01

    Full Text Available The main objective of this work is to analyze and extend security model of mobile devices running on Android OS. Provided security extension is a Linux kernel security module that allows the system administrator to restrict program's capabilities with per-program profiles. Profiles can allow capabilities like network access, raw socket access, and the permission to read, write, or execute files on matching paths. Module supplements the traditional Android capability access control model by providing mandatory access control (MAC based on path. This extension increases security of access to system objects in a device and allows creating security sandboxes per application.

  5. Urban Railway Accessibility

    Institute of Scientific and Technical Information of China (English)

    GUAN Hongzhi; YIN Yuanfei; YAN Hai; HAN Yan; QIN Huanmei

    2007-01-01

    Effective use of urban rapid railway systems requires that the railway systems be effectively connected with other transportation modes so that they are accessible. This paper uses the logit model and data to analyze the factors influencing railway access choices in a railway choice access model. The results indicate that access time, access cost, and access distance are factors significantly affecting railway access choices. The user's income significantly affects the probability of choosing to walk rather than to take a taxi,but is not related to choosing buses or bicycles. Vehicle ownership significantly affects the probability of choosing a taxi, but is not significantly related to the other modes. The conclusions provide an analysis tool for urban railway planning and construction.

  6. Open Access @ DTU

    DEFF Research Database (Denmark)

    Ekstrøm, Jeannette

    Open Access is high on the agenda in Denmark and internationally. Denmark has announced a national strategy for Open Access that aims to achieve Open Access to 80% in 2017 and 100% in 2022 to peer review research articles. All public Danish funders as well as H2020 requires that all peer review...... articles that is an outcome of their funding will be Open Access. Uploading your full texts (your final author manuscript after review ) to DTU Orbit is a fundamental part of providing Open Access to your research. We are here to answer all your questions with regards to Open Access and related topics...... such as copyright, DTU Orbit, Open Access journals, APCs, Vouchers etc....

  7. A SURVEY ON SPECTRUM-MAP BASED ON NORMAL OPPORTUNISTIC ROUTING METHODS FOR COGNITIVE RADIO AD HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    Hesham Mohammed Ali Abdullah

    2015-11-01

    Full Text Available Cognitive Radio (CR technology has significant impacts on upper layer performance in Ad Hoc Networks (AHNs. In recent times, several number of investigation are conducted in CR are mostly focusing on the opportunistic spectrum admission and physical layer transmission throughput. However, CR technology determination also have considerable impacts in mobile Ad Hoc networks (AHNs, which enables wireless devices to dynamically create networks without essentially use of a fixed infrastructure . Nowadays, establishing a cognitive network is such a difficult task. The most important issues is routing in CRAHNs. In this paper, it majorly focuses on the survey of routing and opportunistic routing schema in CRAHN. The most significant scheme behind this concept is to make use of a suitable routing protocol designed for establishing Cognitive Radio Network (CRN. Due to licensing, the accessibility of radio frequency for wireless communication gets reduced day by day. Thus, there is a necessitate to have some other way to use these frequencies in an efficient manner. Routing is efficient method to solve these issues, but the use of geographical concept is also a challenging task in CRN. Since, there is a lack in detailed understanding of these extremely dynamic opportunistic links and a consistent end-to-end transportation mechanism over the network. Here, it focuses on the study of possible routing approaches with the purpose of be able to be employed in CRAHNs. There is a comparison on performance evaluation of various potential routing approaches in terms of table significant reduction and what solution can be found from the routing protocol are also discussed. The routing protocol attains reliable communications for CRAHNs, without usually getting feedback information from nodes in a CRAHN to considerably accumulate the communication overhead.

  8. Analysis of potential highway routes to Yucca Mountain

    Energy Technology Data Exchange (ETDEWEB)

    Sathisan, S.K.; Parentela, E.M.; Lee, M.S. [Univ. of Nevada, Las Vegas, NV (United States)

    1994-12-31

    States have been provided the authority to designate routes for the transport of highway route controlled quantity shipments of radioactive materials. The state of Nevada is currently evaluating alternative routes for such designation. This paper provides a preliminary assessment of potential system impacts of Nevada`s highway route designation for the shipment of High Level Radioactive Waste (HLRW) to the proposed geologic repository at Yucca Mountain, Nevada. A potential route being evaluated by Nevada was used to specify routing constraints for highway shipments to Yucca Mountain. Individual routes were determined for shipments from each origin using the HIGHWAY model for unconstrained and constrained routing scenarios. Results of the analysis indicate that the imposition of the routing constraint would result in increased travel times and shipment distances. These increases range from about 1.25 percent to about 80 percent. However, the magnitude of such increases is highly dependent on the geographic location of the origin.

  9. Literary Routes: Contributions to Natural/Cultural Heritage Tourism. How landscape transforms literature and tourism

    Directory of Open Access Journals (Sweden)

    Rosalinda Ruiz Scarfuto

    2013-12-01

    ;  Don Quijote of La Mancha (1603 was first made tangible as a literary route in 1780 with a detailed topographical surveyor map inspiring visitors like Washington Irving (1829, Alexander Dumas (1861, and Hans Christian Andersen (1880 to the Spanish plains. This eventually galvanized into an innovative move to pass the Don Quijote Route Law (2007, complete with GPS coordinates. In Japan, Basho’s literary route (1700 with its natural elements changed the style of Japanese Haiku, encouraging writers around the world to follow in his footsteps, and Humboldt’s account of his Andes’ route in South America inspired Lewis & Clark, Darwin, and Muir to follow a similar path that spurred events, websites, and even a NASA astrobiology project to conserve and access the accumulated heritage of these literary routes.  Economic investments in literary routes in natural settings have been initiated by worldwide government ministries of culture, recreation/tourism, environment, economy, and/or education, demonstrating commitments to the conservation of landscapes which have inspired literature. Hence, literary routes can highly contribute to cultural itineraries in natural settings.

  10. Issues of Simulation-Based Route Assignment

    Energy Technology Data Exchange (ETDEWEB)

    Nagel, K.; Rickert, M.

    1999-07-20

    The authors use an iterative re-planning scheme with simulation feedback to generate a self-consistent route-set for a given street network and origin-destination matrix. The iteration process is defined by three parameters. They found that they have influence on the speed of the relaxation, but not necessarily on its final state.

  11. Real Time Route for Dynamic Road Congestions

    Directory of Open Access Journals (Sweden)

    A. M. Riad

    2012-05-01

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

  12. Obsidian trade routes in the mayan area.

    Science.gov (United States)

    Hammond, N

    1972-12-08

    Obsidian from two sources in highland Guatemala has been found at 23 sites of the Classic Mayan civilization, mainly in the nonvolcanic lowlands to the north. The distribution, together with trade routes suggested by topography and documentary sources, suggests efficient waterborne transport and competition between sources for the lowland market.

  13. Energy-Efficient Routing in GMPLS Network

    DEFF Research Database (Denmark)

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

    2011-01-01

    In this paper, a GMPLS controlled core network model that takes energy efficiency into account is built using OPNET MODELER. By extending the standard GMPLS routing protocol -- OSPF-TE, we are able to spread desired energy related information over the local area, and subsequently use RSVP...

  14. Phone Routing using the Dynamic Memory Model

    DEFF Research Database (Denmark)

    Bendtsen, Claus Nicolaj; Krink, Thiemo

    2002-01-01

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

  15. A Geographical Heuristic Routing Protocol for VANETs

    Directory of Open Access Journals (Sweden)

    Luis Urquiza-Aguiar

    2016-09-01

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

  16. Routing trains through railway stations: complexity issues

    NARCIS (Netherlands)

    L.G. Kroon (Leo); H.E. Romeijn (Edwin); P.J. Zwaneveld (Peter)

    1997-01-01

    textabstractIn this paper we consider the problem of routing trains through railway stations. This problem occurs as a subproblem in the project DONS that is currently being carried out under the supervision of Railned and Netherlands Railways. The project DONS involves the determination of the

  17. Locating Depots for Capacitated Vehicle Routing

    CERN Document Server

    Goertz, Inge Li

    2011-01-01

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

  18. MULTINOMINAL LOGIT MODEL OF BICYCLIST ROUTE CHOICE

    Directory of Open Access Journals (Sweden)

    O. Chernyshova

    2016-06-01

    Full Text Available The paper presents the multinominal logit discrete choice model that allows determining parameters coefficients of the cyclists’ route. The basic model includes six parameters, however, only a number of signalized intersections, speed of motorized traffic and total physical work required from cyclist prove to be significant factors. The model provides a better understanding about cyclist traffic assignment.

  19. Graphical route information on variable message signs

    NARCIS (Netherlands)

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

    2002-01-01

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

  20. Traffic disruption route Einstein near building 170

    CERN Multimedia

    A Lopez - TS/CE

    2005-01-01

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

  1. Automated Flight Routing Using Stochastic Dynamic Programming

    Science.gov (United States)

    Ng, Hok K.; Morando, Alex; Grabbe, Shon

    2010-01-01

    Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

  2. Partially dynamic vehicle routing - models and algorithms

    DEFF Research Database (Denmark)

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

    2002-01-01

    In this paper we propose a framework for dynamic routing systems based on their degree of dynamism. Next, we consider its impact on solution methodology and quality. Specifically, we introduce the Partially Dynamic Travelling Repairman Problem and describe several dynamic policies to minimize rou...

  3. Variable-speed, portable routing skate

    Science.gov (United States)

    Pesch, W. A.

    1967-01-01

    Lightweight, portable, variable-speed routing skate is used on heavy metal subassemblies which are impractical to move to a stationary machine. The assembly, consisting of the housing with rollers, router, and driving mechanism with transmission, weighs about forty pounds. Both speed and depth of cut are adjustable.

  4. Towards seasonal Arctic shipping route predictions

    Science.gov (United States)

    Melia, N.; Haines, K.; Hawkins, E.; Day, J. J.

    2017-08-01

    The continuing decline in Arctic sea-ice will likely lead to increased human activity and opportunities for shipping in the region, suggesting that seasonal predictions of route openings will become ever more important. Here we present results from a set of ‘perfect model’ experiments to assess the predictability characteristics of the opening of Arctic sea routes. We find skilful predictions of the upcoming summer shipping season can be made from as early as January, although typically forecasts show lower skill before a May ‘predictability barrier’. We demonstrate that in forecasts started from January, predictions of route opening date are twice as uncertain as predicting the closing date and that the Arctic shipping season is becoming longer due to climate change, with later closing dates mostly responsible. We find that predictive skill is state dependent with predictions for high or low ice years exhibiting greater skill than medium ice years. Forecasting the fastest open water route through the Arctic is accurate to within 200 km when predicted from July, a six-fold increase in accuracy compared to forecasts initialised from the previous November, which are typically no better than climatology. Finally we find that initialisation of accurate summer sea-ice thickness information is crucial to obtain skilful forecasts, further motivating investment into sea-ice thickness observations, climate models, and assimilation systems.

  5. Overview of Stochastic Vehicle Routing Problems

    Institute of Scientific and Technical Information of China (English)

    郭耀煌; 谢秉磊; 郭强

    2002-01-01

    Stochastic vehicle routing problems (VRPs) play important roles in logistics, though they have not been studied systematically yet. The paper summaries the definition, properties and classification of stochastic VRPs, makes further discussion about two strategies in stochastic VRPs, and at last overviews dynamic and stochastic VRPs.

  6. Norton's theorem for batch routing queueing networks

    NARCIS (Netherlands)

    Bause, Falko; Boucherie, Richard J.; Buchholz, Peter

    2001-01-01

    This paper shows that the aggregation and decomposition result known as Norton’s theorem for queueing networks can be extended to a general class of batch routing queueing networks with product-form solution that allows for multiple components to simultaneously release and receive (batches of) custo

  7. Porcelain tiles by the dry route

    Directory of Open Access Journals (Sweden)

    Boschi, A. O.

    2010-10-01

    Full Text Available In Brazil, the second largest tile producer of the world, at present, 70% of the tiles are produced by the dry route. One of the main reasons that lead to this development is the fact that the dry route uses approximately 30% less thermal energy them the traditional wet route. The increasing world concern with the environment and the recognition of the central role played by the water also has pointed towards privileging dry processes. In this context the objective of the present work is to study the feasibility of producing high quality porcelain tiles by the dry route. A brief comparison of the dry and wet route, in standard conditions industrially used today to produce tiles that are not porcelain tiles, shows that there are two major differences: the particle sizes obtained by the wet route are usually considerably finer and the capability of mixing the different minerals, the intimacy of the mixture, is also usually better in the wet route. The present work studied the relative importance of these differences and looked for raw materials and operational conditions that would result in better performance and glazed porcelain tiles of good quality.

    En Brasil, en este momento segundo productor mundial, el 70% de los pavimentos cerámicos se obtiene por vía seca. Una de las razones fundamentales se debe a que esta vía supone un consumo energético inferior, en un 30%, a la via húmeda tradicional. La creciente preocupación mundial sobre los problemas medioambientales y el reconocimiento del papel central que juega el agua en este proceso han favorecido el desarrollo de la vía seca. En este contexto, el objetivo del presente trabajo es estudiar la viabilidad de la producción de pavimentos porcelánicos de alta calidad por vía seca. Una breve comparación entre ambas vías, en las condiciones standard de producción vigentes para producciones que no son de porcelánico, indican que existen dos diferencias substanciales; el tamaño de

  8. PERFORMANCE COMPARISION OF DIFFERENT ROUTING PROTOCOLS WITH FUZZY INFERENCE SYSTEM IN MANET

    Directory of Open Access Journals (Sweden)

    Subhrananda Goswami

    2015-08-01

    Full Text Available An ad hoc wireless network consists of mobile networks which create an underlying architecture for communication without the help of traditional fixed-position routers. There are different protocols for handling the routing in the mobile environment. Routing protocols used in fixed infrastructure networks cannot be efficiently used for mobile ad-hoc networks (MANET, so it requires different protocols. The node moves at different speeds in an independent random form, connected by any number of wireless links, where each node is ready to pass or forward both data and control traffic unrelated to its own use ahead (routing to other nodes in a flexible interdependence of wireless communication in between. In contrast to infrastructure wireless networks, where the communication between network nodes is take place by a special node known as an access point. It is also, in contrast to wired networks in which the routing task is performed by special and specific devices called routers and switches. In this paper, we consider fuzzy inference system, an attempt has been made to present a model using fuzzy logic approach to evaluate and compare three routing protocols i.e. AODV, DSDV and DSR using effective factor of the number of nodes based on 3 outputs of control overhead, delay and PDR (totally fuzzy system with 4 outputs in order to select one of these two routing protocols properly under different conditions and based on need and goal. To show efficiency and truth of fuzzy system, three protocols have been evaluated equally using NS-2 simulator and attempt has been made to prove efficiency of the designed fuzzy system by comparing results of simulation of fuzzy system and NS-2 software.

  9. Optimal Route Selection Method Based on Vague Sets

    Institute of Scientific and Technical Information of China (English)

    GUO Rui; DU Li min; WANG Chun

    2015-01-01

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

  10. Escape probability based routing for ad hoc networks

    Institute of Scientific and Technical Information of China (English)

    Zhang Xuanping; Qin Zheng; Li Xin

    2006-01-01

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

  11. An Efficient Routing Algorithm in Ad Hoc Networks

    Institute of Scientific and Technical Information of China (English)

    WANGShuqiao; LIHongyan; LIJiandong

    2005-01-01

    The Dynamic source routing protocol(DSR) is an on-demand routing protocol, designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. In this paper, some mechanisms such as the route's lifetime prediction, route’s creation time and an adaptive gratuitous route reply mode are introduced into DSR to get an efficient routing algorithm which is refered to E-DSR. The simulation results show that E-DSR can improve the packet delivery rate and reduce the routing overhead compared with hop-based DSR.

  12. Research on network failure handling technology based on deflection routing

    Institute of Scientific and Technical Information of China (English)

    Tao YU; Shanzhi CHEN; Xin LI; Zhen QIN

    2008-01-01

    A new deflection routing scheme is proposed to overcome the drawback of existing deflection routing scheme that cannot handle node failure and suffer from routing loops.A new algorithm for computing the backup shortest path tree(SPT)is proposed and a set of procedures are defined for utilizing the backup SPT in case of node or link failure.The failure can be handled swiftly and the backup routes are guaranteed to be loop-free.Experimental results show that the backup routes calculated by proposed scheme are close to the optimal routes by totally re-computing.

  13. Aerosol immunisation for TB: matching route of vaccination to route of infection.

    Science.gov (United States)

    Manjaly Thomas, Zita-Rose; McShane, Helen

    2015-03-01

    TB remains a very significant global health burden. There is an urgent need for better tools for TB control, which include an effective vaccine. Bacillus Calmette-Guérin (BCG), the currently licensed vaccine, confers highly variable protection against pulmonary TB, the main source of TB transmission. Replacing BCG completely or boosting BCG with another vaccine are the two current strategies for TB vaccine development. Delivering a vaccine by aerosol represents a way to match the route of vaccination to the route of infection. This route of immunisation offers not only the scientific advantage of delivering the vaccine directly to the respiratory mucosa, but also practical and logistical advantages. This review summarises the state of current TB vaccine candidates in the pipeline, reviews current progress in aerosol administration of vaccines in general and evaluates the potential for TB vaccine candidates to be administered by the aerosol route.

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

    CERN Document Server

    He, Zhengbing; Guan, Wei

    2013-01-01

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

  15. A Maximum Entropy Fixed-Point Route Choice Model for Route Correlation

    Directory of Open Access Journals (Sweden)

    Louis de Grange

    2014-06-01

    Full Text Available In this paper we present a stochastic route choice model for transit networks that explicitly addresses route correlation due to overlapping alternatives. The model is based on a multi-objective mathematical programming problem, the optimality conditions of which generate an extension to the Multinomial Logit models. The proposed model considers a fixed point problem for treating correlations between routes, which can be solved iteratively. We estimated the new model on the Santiago (Chile Metro network and compared the results with other route choice models that can be found in the literature. The new model has better explanatory and predictive power that many other alternative models, correctly capturing the correlation factor. Our methodology can be extended to private transport networks.

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

    Data.gov (United States)

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

  17. Complications of Central Venous Totally Implantable Access Port: Internal Jugular Versus Subclavian Access

    Directory of Open Access Journals (Sweden)

    Pil Young Jung

    Full Text Available Background: Totally implantable access port (TIAP provides reliable, long term vascular access with minimal risk of infection and allows patients normal physical activity. With wide use of ports, new complications have been encountered. We analyzed TIAP related complications and evaluated the outcomes of two different percutaneous routes of access to superior vena cava. Methods: All 172 patients who underwent port insertion with internal jugular approach (Group 1, n = 92 and subclavian approach (Group 2, n = 79 between August 2011 and May 2013 in a single center were analyzed, retrospectively. Medical records were analyzed to compare the outcomes and the occurrence of port related complications between two different percutaneous routes of access to superior vena cava. Results: Median follow-up for TIAP was 278 days (range, 1-1868. Twenty four complications were occurred (14.0%, including pneumothorax (n = 1, 0.6%, migration/malposition (n = 4, 2.3%, pinch-off syndrome (n = 4, 2.3%, malfunction (n = 2, 1.1%, infection (n = 8, 4.7%, and venous thrombosis (n = 5, 2.9%. The overall incidence was 8.7% and 20.3% in each group (p = 0.030. Mechanical complications except infectious and thrombotic complications were more often occurred in group 2 (p = 0.033. The mechanical complication free probability is significantly higher in group 1 (p = 0.040. Conclusions: We suggest that the jugular access should be chosen in patients who need long term catheterization because of high incidence of mechanical complication, such as pinch-off syndrome.

  18. Vehicle routing problem and capacitated vehicle routing problem frameworks in fund allocation problem

    Science.gov (United States)

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

    2016-11-01

    Two new methods adopted from methods commonly used in the field of transportation and logistics are proposed to solve a specific issue of investment allocation problem. Vehicle routing problem and capacitated vehicle routing methods are applied to optimize the fund allocation of a portfolio of investment assets. This is done by determining the sequence of the assets. As a result, total investment risk is minimized by this sequence.

  19. Port Access Cardiac Surgery.

    Science.gov (United States)

    Viganó, Mario; Minzioni, Gaetano; Spreafico, Patrizio; Rinaldi, Mauro; Pasquino, Stefano; Ceriana, Piero; Locatelli, Alessandro

    2000-10-01

    The port-access technique for cardiac surgery was recently developed at Stanford University in California as a less invasive method to perform some cardiac operations. The port-access system has been described in detail elsewhere. It is based on femoral arterial and venous access for cardiopulmonary bypass (CPB) and on the adoption of a specially designed triple-lumen catheter described originally by Peters, and subsequently modified and developed in the definitive configuration called the endoaortic clamp.

  20. Are PDF Documents Accessible?

    Directory of Open Access Journals (Sweden)

    Mireia Ribera Turró

    2008-09-01

    Full Text Available Adobe PDF is one of the most widely used formats in scientific communications and in administrative documents. In its latest versions it has incorporated structural tags and improvements that increase its level of accessibility. This article reviews the concept of accessibility in the reading of digital documents and evaluates the accessibility of PDF according to the most widely established standards.

  1. Access Data Analysis Cookbook

    CERN Document Server

    Bluttman, Ken

    2008-01-01

    This book offers practical recipes to solve a variety of common problems that users have with extracting Access data and performing calculations on it. Whether you use Access 2007 or an earlier version, this book will teach you new methods to query data, different ways to move data in and out of Access, how to calculate answers to financial and investment issues, how to jump beyond SQL by manipulating data with VBA, and more.

  2. Accessible e-learning

    OpenAIRE

    Bühler, Christian; Scheer, Birgit

    2005-01-01

    People with disabilities often encounter difficulties while trying to learn something, because teaching material is for example not accessible to blind people or rooms, where courses take place, are not accessible to people using a wheelchair. E-learning provides an opportunity to disabled people. With the new German law on the equalisation of opportunities for people with disabilities for the first time access to information technology was explicitly taken up in German legislation. As a cons...

  3. Optimal Route Based Advanced Algorithm using Hot Link Split Multi-Path Routing Algorithm

    Directory of Open Access Journals (Sweden)

    Akhilesh A. Waoo

    2014-07-01

    Full Text Available Present research work describes advancement in standard routing protocol AODV for mobile ad-hoc networks. Our mechanism sets up multiple optimal paths with the criteria of bandwidth and delay to store multiple optimal paths in the network. At time of link failure, it will switch to next available path. We have used the information that we get in the RREQ packet and also send RREP packet to more than one path, to set up multiple paths, It reduces overhead of local route discovery at the time of link failure and because of this End to End Delay and Drop Ratio decreases. The main feature of our mechanism is its simplicity and improved efficiency. This evaluates through simulations the performance of the AODV routing protocol including our scheme and we compare it with HLSMPRA (Hot Link Split Multi-Path Routing Algorithm Algorithm. Indeed, our scheme reduces routing load of network, end to end delay, packet drop ratio, and route error sent. The simulations have been performed using network simulator OPNET. The network simulator OPNET is discrete event simulation software for network simulations which means it simulates events not only sending and receiving packets but also forwarding and dropping packets. This modified algorithm has improved efficiency, with more reliability than Previous Algorithm.

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

    Science.gov (United States)

    Biro, Dora; Meade, Jessica; Guilford, Tim

    2006-01-01

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

  5. OGIS Access System

    Data.gov (United States)

    National Archives and Records Administration — The OGIS Access System (OAS) provides case management, stakeholder collaboration, and public communications activities including a web presence via a web portal.

  6. Open Access Policy

    OpenAIRE

    University of East London, .

    2013-01-01

    The University of East London is committed to and supports open access to its research publications.\\ud There is a worldwide move towards free and unrestricted access to research publications, with benefits\\ud for researchers, universities and wider society. UEL supports this initiative and recognises the\\ud importance of open access in increasing the visibility and impact of research. This policy is aligned with\\ud and supports HEFCE’s Policy for Open Access in the Post‐2014 REF, and is alig...

  7. Channel Access in Erlang

    Energy Technology Data Exchange (ETDEWEB)

    Nicklaus, Dennis J. [Fermilab

    2013-10-13

    We have developed an Erlang language implementation of the Channel Access protocol. Included are low-level functions for encoding and decoding Channel Access protocol network packets as well as higher level functions for monitoring or setting EPICS process variables. This provides access to EPICS process variables for the Fermilab Acnet control system via our Erlang-based front-end architecture without having to interface to C/C++ programs and libraries. Erlang is a functional programming language originally developed for real-time telecommunications applications. Its network programming features and list management functions make it particularly well-suited for the task of managing multiple Channel Access circuits and PV monitors.

  8. Web Accessibility and Guidelines

    Science.gov (United States)

    Harper, Simon; Yesilada, Yeliz

    Access to, and movement around, complex online environments, of which the World Wide Web (Web) is the most popular example, has long been considered an important and major issue in the Web design and usability field. The commonly used slang phrase ‘surfing the Web’ implies rapid and free access, pointing to its importance among designers and users alike. It has also been long established that this potentially complex and difficult access is further complicated, and becomes neither rapid nor free, if the user is disabled. There are millions of people who have disabilities that affect their use of the Web. Web accessibility aims to help these people to perceive, understand, navigate, and interact with, as well as contribute to, the Web, and thereby the society in general. This accessibility is, in part, facilitated by the Web Content Accessibility Guidelines (WCAG) currently moving from version one to two. These guidelines are intended to encourage designers to make sure their sites conform to specifications, and in that conformance enable the assistive technologies of disabled users to better interact with the page content. In this way, it was hoped that accessibility could be supported. While this is in part true, guidelines do not solve all problems and the new WCAG version two guidelines are surrounded by controversy and intrigue. This chapter aims to establish the published literature related to Web accessibility and Web accessibility guidelines, and discuss limitations of the current guidelines and future directions.

  9. Access 2013 bible

    CERN Document Server

    Alexander, Michael

    2013-01-01

    A comprehensive reference to the updated and new features of Access 2013 As the world's most popular database management tool, Access enables you to organize, present, analyze, and share data as well as build powerful database solutions. However, databases can be complex. That's why you need the expert guidance in this comprehensive reference. Access 2013 Bible helps you gain a solid understanding of database purpose, construction, and application so that whether you're new to Access or looking to upgrade to the 2013 version, this well-rounded resource provides you with a th

  10. Ultrasound Evaluation Before and After Hemodialysis Access

    Directory of Open Access Journals (Sweden)

    Daryoush Saedi

    2009-01-01

    Full Text Available   "nThe basic concept of hemodialysis access is to make a route to the central circulation in CRF patients. Vascular access procedures and subsequent complications represent a major cause of morbidity, hospitalization and cost for hemodialysis patients. Native arteriovenous fistulas (AVFs are preferable to synthetic arteriovenous grafts because they are associated with a lower frequency of thrombosis and infection, as well as greater longevity. AVFs that are never usable and early graft failures are associated with the common problem of inadequate vessel (artery or vein selection. The surgeon’s preoperative physical examination is the primary basis for AVF versus graft selection. Only palpable veins are considered for construction of AVFs, and the more proximal draining venous anatomy is not known prior to the operation. Physical examination is the traditional surgical evaluation performed prior to hemodialysis access placement. Palpation and inspection are difficult in obese arms, and few patients have vessels that are visible throughout their entire course. Patients with end-stage renal disease have often had multiple venipunctures and numerous intravenous lines placed and thus have an increased likelihood of venous stenosis or occlusion. Central vein problems are difficult to detect at visual inspection. By colour Doppler analysis vessels can be assessed for size, stenosis, and occlusion. US mapping assists in surgical planning and is especially valuable in patients who are difficult surgical cases (eg, obesity, diabetes, history of prior access, elderly women.  "nThis lecture contains two separate sections: 1-Vascular mapping prior to access placement and 2-Fistula maturity by US evaluation. Ultrasonography (US is an excellent modality for hemodialysis access evaluation because it is  readily available, non-invasive and inexpensive. It avoids the risks associated with iodinated contrast material and ionizing radiation.   

  11. INTERLINE 5.0 -- An expanded railroad routing model: Program description, methodology, and revised user`s manual

    Energy Technology Data Exchange (ETDEWEB)

    Johnson, P.E.; Joy, D.S. [Oak Ridge National Lab., TN (United States); Clarke, D.B.; Jacobi, J.M. [Tennessee Univ., Knoxville, TN (United States). Transportation Center

    1993-03-01

    A rail routine model, INTERLINE, has been developed at the Oak Ridge National Laboratory to investigate potential routes for transporting radioactive materials. In Version 5.0, the INTERLINE routing algorithms have been enhanced to include the ability to predict alternative routes, barge routes, and population statistics for any route. The INTERLINE railroad network is essentially a computerized rail atlas describing the US railroad system. All rail lines, with the exception of industrial spurs, are included in the network. Inland waterways and deep water routes along with their interchange points with the US railroadsystem are also included. The network contains over 15,000 rail and barge segments (links) and over 13,000 stations, interchange points, ports, and other locations (nodes). The INTERLINE model has been converted to operate on an IBM-compatible personal computer. At least a 286 computer with a hard disk containing approximately 6 MB of free space is recommended. Enhanced program performance will be obtained by using arandom-access memory drive on a 386 or 486 computer.

  12. INTERLINE 5. 0 -- An expanded railroad routing model: Program description, methodology, and revised user's manual

    Energy Technology Data Exchange (ETDEWEB)

    Johnson, P.E.; Joy, D.S. (Oak Ridge National Lab., TN (United States)); Clarke, D.B.; Jacobi, J.M. (Tennessee Univ., Knoxville, TN (United States). Transportation Center)

    1993-03-01

    A rail routine model, INTERLINE, has been developed at the Oak Ridge National Laboratory to investigate potential routes for transporting radioactive materials. In Version 5.0, the INTERLINE routing algorithms have been enhanced to include the ability to predict alternative routes, barge routes, and population statistics for any route. The INTERLINE railroad network is essentially a computerized rail atlas describing the US railroad system. All rail lines, with the exception of industrial spurs, are included in the network. Inland waterways and deep water routes along with their interchange points with the US railroadsystem are also included. The network contains over 15,000 rail and barge segments (links) and over 13,000 stations, interchange points, ports, and other locations (nodes). The INTERLINE model has been converted to operate on an IBM-compatible personal computer. At least a 286 computer with a hard disk containing approximately 6 MB of free space is recommended. Enhanced program performance will be obtained by using arandom-access memory drive on a 386 or 486 computer.

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

  14. Route Monopolie and Optimal Nonlinear Pricing

    Science.gov (United States)

    Tournut, Jacques

    2003-01-01

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

  15. Geostatistical analyses of communication routes in a geo-strategic and regional development perspective

    Directory of Open Access Journals (Sweden)

    Alexandru-Ionuţ Petrişor

    2017-12-01

    Full Text Available Accessibility is a key concept in regional development, with numerous ties to territorial cohesion and polycentricity. Moreover, it also exhibits a geo-strategic function, anchored in the international relationships between countries and continents. The article reviews several case studies, placing analyses of the Romanian accessibility in a broader context. The results show that regional development, overall EU connectivity and possible transit fluxes are prevented by the configuration or lack of communication routes. Increasing the accessibility of regions must be a priority of governments, regardless of political opinions. It is expected that the transition of economy to post-carbon era or other models – green economy, knowledge-based economy etc. – to result into the emergence of new poles and axes of development, and ensure transport sustainability.

  16. A novel bandwidth allocation scheme for QoS routing in mobile ad hoc networks

    Science.gov (United States)

    Wu, Bin; Kuo, Geng-Sheng

    2004-09-01

    The main purpose of this paper is to propose a novel bandwidth allocation scheme for facilitating quality of service (QoS) routing in mobile ad hoc networks (MANETs). In a MANET using time division multiple access (TDMA), each node communicates with its neighbors in the same time slot. In general, finding a route with the maximum end-to-end bandwidth subject to the constraint of collision-free transmission is an NP-complete problem. This paper proposed a sub-optimal solution to this problem. The solution is based on a centrally controlled bandwidth allocation scheme to properly assign the available time slots to each intermediate link. The advantage of our proposed scheme is that the resource utilization of MANET is maximized and the end-to-end QoS is guaranteed during the route establishment period. Performance analyses show that when using the proposed scheme with AODV to perform QoS routing, it achieves about 25% throughput higher than its best-effort counterpart if the node is moving at 5mps speed.

  17. Distributed Traffic Balancing Routing for LEO Satellite Networks

    Directory of Open Access Journals (Sweden)

    Yong Lu

    2013-11-01

    Full Text Available Satellite networks have been widely investigated both in the business and academia for many years, with many important routing algorithms reported in the literatures. However, fewer existing routing algorithms focus on the trade-off between the routing survivability and the routing computation and storage overheads. Due to topological dynamics, it is difficult to effectively apply the conventional routing protocols such as RIP or OSPF to Low Earth Orbit (LEO satellite networks. According to the virtual topology model based on virtual node, this paper propose a new fully distributed routing protocol for LEO satellite networks, called Distributed Traffic Balancing Routing (DTBR. The proposed protocol not only guarantees the routing survivability and provides the ability of traffic balancing, but also result in few additional computation and storage overheads only deriving from the information flooding of failed satellites. Simulation results demonstrate positive conclusions of our methods.

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

    CERN Document Server

    Liu, Ke

    2008-01-01

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

  19. Route of transmission might influence the clinical expression of ...

    African Journals Online (AJOL)

    2012-05-04

    May 4, 2012 ... ... Various routes have been reported with respect to the transmission of human immunodeficiency virus .... disease through both the routes and people who have started ... band present from one papilla to adjacent papilla and.

  20. Use of Interactive Computer Graphics to Solve Routing Problems.

    Science.gov (United States)

    Gillett, B. E.; Lawrence, J. L.

    1981-01-01

    Discusses vehicle routing problems and solutions. Describes testing of an interactive computer graphics package combining several types of solutions that allows users with little or no experience to work out routing problems. (Author/RW)

  1. ASR performance analysis of an experimental call routing system

    CSIR Research Space (South Africa)

    Modipa, T

    2009-11-01

    Full Text Available Call routing is an important application of Automatic Speech Recognition (ASR) technology. In this paper the authors discuss the main issues affecting the performance of a call routing system and describe the ASR component of the "Auto...

  2. Using Tabu Search Heuristics in Solving the Vehicle Routing ...

    African Journals Online (AJOL)

    Nafiisah

    Routing Problem with Time Windows where the capacity of vehicle has been taken ... The optimal routes of the delivery of frozen chicken were found and it ... messages, people or goods from one place to another (Toth and Vigo, 2000). VRP.

  3. Frequency of nursing care of vascular access in hemodialysis patients

    Directory of Open Access Journals (Sweden)

    Iman Taghizade Firoozjayi

    2016-03-01

    Full Text Available Background: Hemodialysis is a critical treatment method, which depends on the vascular access route. Lack of care for the vascular access route could diminish its efficiency in a short time. Regarding this, the present study aimed to evaluate the frequency of nursing care for vascular access route in the hemodialysis patients. Methods: This cross-sectional study was conducted on 20 nurses and 120 hemodialysis patients, who referred to the Hemodialysis Department of Shahid Beheshti Hospital, Babol, Iran, in 2015. The method of nursing care for vascular access route was evaluated using a researcher-made checklist. The data analysis was performed using the descriptive statistics in the SPSS version 16. Results: In total, 14 cases of nursing care were evaluated, in 100% of which all the caring steps, including wearing gloves and a mask, early bolus injections of heparin, washing the catheter tubing, frequent monitoring of blood pressure, rinsing the catheter tubing, returning the blood to the body after hemodialysis, and sterile covering of the puncture site, were observed. However, some of the other techniques, such as the care related to appropriate pump speed when starting the dialysis machine (81.66%, observance of the needle distance from fistula (75.83%, appropriate placement of catheter (75%, pressing the injection site (54.17%, blood pressure monitoring at the end of dialysis (50%, and change of the needle site between two sessions (27.5%, were not adhered to by the nurses. Conclusion: According to the results of this study, some of the nursing care steps, which are necessary in the beginning and end of the hemodialysis, were not accurately followed by the nurses. It is recommended that constant training courses be held for the nurses in this regard.

  4. Probabilistic models for access strategies to dynamic information elements

    DEFF Research Database (Denmark)

    Hansen, Martin Bøgsted; Olsen, Rasmus L.; Schwefel, Hans-Peter

    In various network services (e.g., routing and instances of context-sensitive networking) remote access to dynamically changing information elements is a required functionality. Three fundamentally different strategies for such access are investigated in this paper: (1) a reactive approach...... for information elements spread over a large number of network nodes are provided, which allow to draw conclusions on scalability properties. The impact of different distribution types for the network delays as well as for the time between changes of the information element on the mismatch probability...

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

    Directory of Open Access Journals (Sweden)

    Dae-seop Moon

    2015-03-01

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

  6. Pedestrian Route Choice by Iterated Equilibrium Search

    CERN Document Server

    Kretz, Tobias; Hofsäß, Ingmar

    2014-01-01

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

  7. Eco-sustainable routing in optical networks

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  8. Fund allocation using capacitated vehicle routing problem

    Science.gov (United States)

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

    2014-09-01

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

  9. Chemical Routes to Colloidal Chalcogenide Nanosheets

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-11-25

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

  10. Maritime route of colonization of Europe

    Science.gov (United States)

    Paschou, Peristera; Drineas, Petros; Yannaki, Evangelia; Razou, Anna; Kanaki, Katerina; Tsetsos, Fotis; Padmanabhuni, Shanmukha Sampath; Michalodimitrakis, Manolis; Renda, Maria C.; Pavlovic, Sonja; Anagnostopoulos, Achilles; Stamatoyannopoulos, John A.; Kidd, Kenneth K.; Stamatoyannopoulos, George

    2014-01-01

    The Neolithic populations, which colonized Europe approximately 9,000 y ago, presumably migrated from Near East to Anatolia and from there to Central Europe through Thrace and the Balkans. An alternative route would have been island hopping across the Southern European coast. To test this hypothesis, we analyzed genome-wide DNA polymorphisms on populations bordering the Mediterranean coast and from Anatolia and mainland Europe. We observe a striking structure correlating genes with geography around the Mediterranean Sea with characteristic east to west clines of gene flow. Using population network analysis, we also find that the gene flow from Anatolia to Europe was through Dodecanese, Crete, and the Southern European coast, compatible with the hypothesis that a maritime coastal route was mainly used for the migration of Neolithic farmers to Europe. PMID:24927591

  11. Enhanced PMIPv6 Route Optimization Handover

    Science.gov (United States)

    Jeon, Seil; Kang, Namhi; Kim, Younghan; Yoon, Wonsik

    Packet delivery in Proxy Mobile IPv6 (PMIPv6) relies on an anchor node called LMA. All packets sent by a source node reach a receiver node via LMA, even though the two nodes attach to the same MAG. In some scenarios, PMIPv6 results in high delivery latency and processing costs due to this unnecessary detour. To address this issue, several PMIPv6 route optimization schemes have been proposed. However, high signaling costs and excessive delays remain when handover is performed. For this reason, we propose an enhanced PMIPv6 route optimization (EPRO) scheme. In addition, we analyze the performance of the EPRO. Analytical results indicate that the EPRO outperforms previous schemes in terms of signaling overhead and handover latency.

  12. Multicast Routing Protocols in Adhoc Mobile networks

    Directory of Open Access Journals (Sweden)

    S.Nagaprasad,

    2010-11-01

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

  13. Secure Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Soumyashree Sahoo

    2012-01-01

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

  14. Chemical-potential route for multicomponent fluids

    Science.gov (United States)

    Santos, Andrés; Rohrmann, René D.

    2013-05-01

    The chemical potentials of multicomponent fluids are derived in terms of the pair correlation functions for arbitrary number of components, interaction potentials, and dimensionality. The formally exact result is particularized to hard-sphere mixtures with zero or positive nonadditivity. As a simple application, the chemical potentials of three-dimensional additive hard-sphere mixtures are derived from the Percus-Yevick theory and the associated equation of state is obtained. This Percus-Yevick chemical-route equation of state is shown to be more accurate than the virial equation of state. An interpolation between the chemical-potential and compressibility routes exhibits a better performance than the well-known Boublík-Mansoori-Carnahan-Starling-Leland equation of state.

  15. Effective Privacy-Preserving Online Route Planning

    DEFF Research Database (Denmark)

    Vicente, Carmen Ruiz; Assent, Ira; Jensen, Christian S.

    2011-01-01

    An online Route Planning Service (RPS) computes a route from one location to another. Current RPSs such as Google Maps require the use of precise locations. However, some users may not want to disclose their source and destination locations due to privacy concerns. An approach that supplies fake...... privacy. The solution re-uses a standard online RPS rather than replicate this functionality, and it needs no trusted third party. The solution is able to compute the exact results without leaking of the exact locations to the RPS or un-trusted parties. In addition, we provide heuristics that reduce...... the number of times that the RPS needs to be queried, and we also describe how the accuracy and privacy requirements can be relaxed to achieve better performance. An empirical study offers insight into key properties of the approach....

  16. Multicast Routing Based on Hybrid Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    CAO Yuan-da; CAI Gui

    2005-01-01

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

  17. Adaptive Routing Algorithm for MANET:TERMITE

    Directory of Open Access Journals (Sweden)

    Sharvani G S

    2009-12-01

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

  18. On the Lorentzian route to Relativity

    CERN Document Server

    Gürel, Atilla

    2011-01-01

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

  19. Magnetic routing of light-induced waveguides

    Science.gov (United States)

    Izdebskaya, Yana; Shvedov, Vladlen; Assanto, Gaetano; Krolikowski, Wieslaw

    2017-01-01

    Among photofunctional materials that can be employed to control the propagation of light by modifying their properties, soft dielectrics such as nematic liquid crystals (NLCs) stand out for their large all-optical response. Through reorientation, the molecular distribution of NLCs can be modified by the electric field of light, permitting functional operations and supporting self-localized light beams or spatial optical solitons. To date, the generation and routing of such solitons have been limited by the boundary conditions employed to tailor the properties of NLCs in planar cells or capillaries. Here we report on spatial solitons in bulk NLCs with no lateral anchoring, where the application of an external magnetic field effectively controls the direction of propagation and the angular steering of the self-trapped wavepackets. Our results entail a completely new approach to the routing of self-localized beams and light-induced waveguides in three dimensions, without the usual limitations imposed by transverse boundary conditions. PMID:28198374

  20. Inventory routing for dynamic waste collection.

    Science.gov (United States)

    Mes, Martijn; Schutten, Marco; Rivera, Arturo Pérez

    2014-09-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 networks, the latter becomes more important. To cope with uncertainty in deposit volumes and with fluctuations due to daily and seasonal effects, we need an anticipatory policy that balances the workload over time. We propose a relatively simple heuristic consisting of several tunable parameters depending on the day of the week. We tune the parameters of this policy using optimal learning techniques combined with simulation. We illustrate our approach using a real life problem instance of a waste collection company, located in The Netherlands, and perform experiments on several other instances. For our case study, we show that costs savings up to 40% are possible by optimizing the parameters. Copyright © 2014 Elsevier Ltd. All rights reserved.