Energy-Aware Routing in Multiple Domains Software-Defined Networks

Directory of Open Access Journals (Sweden)

Adriana FERNÁNDEZ-FERNÁNDEZ

2016-12-01

Full Text Available The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, the new architecture of Software-Defined Networks (SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale SDN with multiple domains. The solution proposed, called DEAR (Distributed Energy-Aware Routing, tackles the problem of minimizing the number of links that can be used to satisfy a given data traffic demand under performance constraints such as control traffic delay and link utilization. To this end, we present a complete formulation of the optimization problem that considers routing requirements for control and data plane communications. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.

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

Science.gov (United States)

Aslam, Muhammad; Hu, Xiaopeng; Wang, Fan

2017-12-13

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

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

Directory of Open Access Journals (Sweden)

Muhammad Aslam

2017-12-01

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

Home awareness - connecting people sensuously to places

DEFF Research Database (Denmark)

Lynggaard, Aviaja Borup; Petersen, Marianne Graves; Gude, Rasmus

2010-01-01

People living a global lifestyle connect remotely to their families while away from home. In this paper we identify a need for connecting with a home as the physical place itself. For this purpose we introduce the concept of Home Awareness that connects people sensuously to remote places through...

Vibrant Energy Aware Spray and Wait Routing in Delay Tolerant Network

Directory of Open Access Journals (Sweden)

Viren G. Patel

2013-01-01

Full Text Available Delay tolerant networks (DTN are wireless networks where disconnections arise often due to the mobility of nodes, failures of energy, the low density of nodes, or when the network extends over long distances. In these situations, traditional routing protocols that have been developed for mobile ad hoc networks prove to be unsuccessful to the scope of transmitting messages between nodes. The Spray and Wait routing may achieve low routing and energy efficiency due to the blindness in the spray phase. To deal with this situation, we propose an opportunistic routing with enclosed message copies, called the Vibrant Energy aware Spray and Wait (VESW, which utilizes the information about vibrancy of node and remaining energy to allocate the number of copies between the corresponding pair nodes in the spray phase.

Simulating urban growth by emphasis on connective routes network (case study: Bojnourd city

Directory of Open Access Journals (Sweden)

Mehdi Saadat Novin

2017-06-01

Full Text Available Development of urban construction and ever-increasing growth of population lead to landuse changes especially in agricultural lands, which play an important role in providing human food. According to this issue, a proper landuse planning is required to protecting and preserving the valuable agricultural lands and environment, in today’s world. The prediction of urban growth can help in understanding the potential impacts on a region’s water resource, economy and people. One of the effective parameters in development of cities is connective routes network and their different types and qualities that play an important role in decreasing or increasing the growth of the city. On the other hand, the type of the connective routes network is an important factor for the speed and quality of development. In this paper, two different scenarios were used to simulate landuse changes and analyzing their results. In first scenario, modeling is based on the effective parameters in urban growth without classification of connective routes network. In the second scenario, effective parameters in urban growth were considered and connective routes were classified in 6 different classes with different weights in order to examine their effect on urban development. Simulation of landuse has been carried out for 2020–2050. The results clearly showed the effect of the connective routes network classification in output maps so that the effect of the first and second main routes network in development, is conspicuous.

MQARR-AODV: A NOVEL MULTIPATH QOS AWARE RELIABLE REVERSE ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORKS

Directory of Open Access Journals (Sweden)

K.G. Santhiya

2012-12-01

Full Text Available MANET (Mobile Ad-hoc Network is an infra structure less wireless ad-hoc network that does not require any basic central control. The topology of the network changes drastically due to very fast mobility of nodes. So an adaptive routing protocol is needed for routing in MANET. AODV (Ad-hoc On-demand Distance Vector routing is the effective and prominent on-demand Ad-hoc routing protocols. During route establishment phase in traditional AODV, only one route reply message will be sent in the reverse path to establish routing path. The high mobility of nodes may affect the reply messages which lead to the retransmission of route request message by the sender which in turn leads to higher communication delay, power consumption and the reduction in the ratio of packets delivered. Sending multiple route reply messages and establishing multiple paths in a single path discovery will reduce the routing overhead involved in maintaining the connection between source and destination nodes. Multipath routing can render high scalability, end-to-end throughput and provide load balancing in MANET. The new proposed novel Multipath QoS aware reliable routing protocol establishes two routes of maximum node disjoint paths and the data transfer is carried out in the two paths simultaneously. To select best paths, the new proposed protocol uses three parameters Link Eminence, MAC overhead and node residual energy. The experimental values prove that the MQARR-AODV protocol achieves high reliability, stability, low latency and outperforms AODV by the less energy consumption, overhead and delay.

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

Directory of Open Access Journals (Sweden)

Ki-Hyung Kim

2013-05-01

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

A Scalable Context-Aware Objective Function (SCAOF) of Routing Protocol for Agricultural Low-Power and Lossy Networks (RPAL).

Science.gov (United States)

Chen, Yibo; Chanet, Jean-Pierre; Hou, Kun-Mean; Shi, Hongling; de Sousa, Gil

2015-08-10

In recent years, IoT (Internet of Things) technologies have seen great advances, particularly, the IPv6 Routing Protocol for Low-power and Lossy Networks (RPL), which provides a powerful and flexible routing framework that can be applied in a variety of application scenarios. In this context, as an important role of IoT, Wireless Sensor Networks (WSNs) can utilize RPL to design efficient routing protocols for a specific application to increase the ubiquity of networks with resource-constrained WSN nodes that are low-cost and easy to deploy. In this article, our work starts with the description of Agricultural Low-power and Lossy Networks (A-LLNs) complying with the LLN framework, and to clarify the requirements of this application-oriented routing solution. After a brief review of existing optimization techniques for RPL, our contribution is dedicated to a Scalable Context-Aware Objective Function (SCAOF) that can adapt RPL to the environmental monitoring of A-LLNs, through combining energy-aware, reliability-aware, robustness-aware and resource-aware contexts according to the composite routing metrics approach. The correct behavior of this enhanced RPL version (RPAL) was verified by performance evaluations on both simulation and field tests. The obtained experimental results confirm that SCAOF can deliver the desired advantages on network lifetime extension, and high reliability and efficiency in different simulation scenarios and hardware testbeds.

A Scalable Context-Aware Objective Function (SCAOF of Routing Protocol for Agricultural Low-Power and Lossy Networks (RPAL

Directory of Open Access Journals (Sweden)

Yibo Chen

2015-08-01

Full Text Available In recent years, IoT (Internet of Things technologies have seen great advances, particularly, the IPv6 Routing Protocol for Low-power and Lossy Networks (RPL, which provides a powerful and flexible routing framework that can be applied in a variety of application scenarios. In this context, as an important role of IoT, Wireless Sensor Networks (WSNs can utilize RPL to design efficient routing protocols for a specific application to increase the ubiquity of networks with resource-constrained WSN nodes that are low-cost and easy to deploy. In this article, our work starts with the description of Agricultural Low-power and Lossy Networks (A-LLNs complying with the LLN framework, and to clarify the requirements of this application-oriented routing solution. After a brief review of existing optimization techniques for RPL, our contribution is dedicated to a Scalable Context-Aware Objective Function (SCAOF that can adapt RPL to the environmental monitoring of A-LLNs, through combining energy-aware, reliability-aware, robustness-aware and resource-aware contexts according to the composite routing metrics approach. The correct behavior of this enhanced RPL version (RPAL was verified by performance evaluations on both simulation and field tests. The obtained experimental results confirm that SCAOF can deliver the desired advantages on network lifetime extension, and high reliability and efficiency in different simulation scenarios and hardware testbeds.

A Survey on Temperature-Aware Routing Protocols in Wireless Body Sensor Networks

Directory of Open Access Journals (Sweden)

Sangman Moh

2013-08-01

Full Text Available The rapid growth of the elderly population in the world and the rising cost of healthcare impose big issues for healthcare and medical monitoring. A Wireless Body Sensor Network (WBSN is comprised of small sensor nodes attached inside, on or around a human body, the main purpose of which is to monitor the functions and surroundings of the human body. However, the heat generated by the node’s circuitry and antenna could cause damage to the human tissue. Therefore, in designing a routing protocol for WBSNs, it is important to reduce the heat by incorporating temperature into the routing metric. The main contribution of this paper is to survey existing temperature-aware routing protocols that have been proposed for WBSNs. In this paper, we present a brief overview of WBSNs, review the existing routing protocols comparatively and discuss challenging open issues in the design of routing protocols.

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

Directory of Open Access Journals (Sweden)

Jaewon Choi

2010-01-01

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

GRAdient Cost Establishment (GRACE for an Energy-Aware Routing in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Noor M. Khan

2009-01-01

Full Text Available In Wireless Sensor Network (WSN, the nodes have limitations in terms of energy-constraint, unreliable links, and frequent topology change. In this paper we propose an energy-aware routing protocol, that outperforms the existing ones with an enhanced network lifetime and more reliable data delivery. Major issues in the design of a routing strategy in wireless sensor networks are to make efficient use of energy and to increase reliability in data delivery. The proposed approach reduces both energy consumption and communication-bandwidth requirements and prolongs the lifetime of the wireless sensor network. Using both analysis and extensive simulations, we show that the proposed dynamic routing helps achieve the desired system performance under dynamically changing network conditions. The proposed algorithm is compared with one of the best existing routing algorithms, GRAB. Moreover, a modification in GRAB is proposed which not only improves its performance but also prolongs its lifetime.

A comprehensive survey of energy-aware routing protocols in wireless body area sensor networks.

Science.gov (United States)

Effatparvar, Mehdi; Dehghan, Mehdi; Rahmani, Amir Masoud

2016-09-01

Wireless body area sensor network is a special purpose wireless sensor network that, employing wireless sensor nodes in, on, or around the human body, makes it possible to measure biological parameters of a person for specific applications. One of the most fundamental concerns in wireless body sensor networks is accurate routing in order to send data promptly and properly, and therefore overcome some of the challenges. Routing protocols for such networks are affected by a large number of factors including energy, topology, temperature, posture, the radio range of sensors, and appropriate quality of service in sensor nodes. Since energy is highly important in wireless body area sensor networks, and increasing the network lifetime results in benefiting greatly from sensor capabilities, improving routing performance with reduced energy consumption presents a major challenge. This paper aims to study wireless body area sensor networks and the related routing methods. It also presents a thorough, comprehensive review of routing methods in wireless body area sensor networks from the perspective of energy. Furthermore, different routing methods affecting the parameter of energy will be classified and compared according to their advantages and disadvantages. In this paper, fundamental concepts of wireless body area sensor networks are provided, and then the advantages and disadvantages of these networks are investigated. Since one of the most fundamental issues in wireless body sensor networks is to perform routing so as to transmit data precisely and promptly, we discuss the same issue. As a result, we propose a classification of the available relevant literature with respect to the key challenge of energy in the routing process. With this end in view, all important papers published between 2000 and 2015 are classified under eight categories including 'Mobility-Aware', 'Thermal-Aware', 'Restriction of Location and Number of Relays', 'Link-aware', 'Cluster- and Tree

A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Lesiba Morries Kola

2017-12-01

Full Text Available The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources. We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV and the weighted cumulative expected transmission time (WCETT routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

Science.gov (United States)

Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jeevaa Katiravan

2015-01-01

Full Text Available In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

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

Science.gov (United States)

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

2018-01-01

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

Connectivity-Enhanced Route Selection and Adaptive Control for the Chevrolet Volt: Preprint

Energy Technology Data Exchange (ETDEWEB)

Gonder, J.; Wood, E.; Rajagopalan, S.

2014-09-01

The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3% respectively. These represent substantial opportunities considering that they only require software adjustments to implement.

An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

DEFF Research Database (Denmark)

Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

deliberation. To tackle these two problems, Mobile Wireless Sensor Networks (MWSNs) is a better choice. In MWSN, Sensor nodes move freely to a target area without the need for any special infrastructure. Due to mobility, the routing process in MWSN has become more complicated as connections in the network can...... such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The authors study the influence of energy heterogeneity and mobility of sensor nodes on the performance of EMRP. The Performance of EMRP compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing...

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

Science.gov (United States)

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

2018-01-01

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

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

Directory of Open Access Journals (Sweden)

Xiaomei Zhang

2017-01-01

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

Self-Adaptive Context Aware Routing Protocol for Unicast Communication in Delay and Tolerant Network

Directory of Open Access Journals (Sweden)

Yunbo Chen

2014-05-01

Full Text Available At present, most of research works in mobile network focus on the network overhead of the known path which exists between the sender and the receiver. However, the trend of the current practical application demands is becoming increasingly distributed and decentralized. The Delay and Tolerant Network (DTN just comes out of such background of the conflicts between them. The DTN could effectively eliminate the gap between the mobile network and the practical application demands. In this paper, a Self-Adaptive Context Aware Routing Protocol (SACARP for the unicast communication in delay and tolerant networks is presented. Meanwhile, according to the real-time context information of DTN, the Kalman filter theory is introduced to predict the information state of mobility for the optional message ferrying node, and then gives the optimal selection strategy of the message ferrying nodes. The simulation experiments have shown that, compared to the familiar single- copy and multi-copy protocols, the SACARP proposed in this paper has better transmission performance and stability, especially when the network is free, the protocol would keep a good performance with fewer connections and less buffer space.

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

Directory of Open Access Journals (Sweden)

DING Yulin

2016-12-01

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

Introspection-based Periodicity Awareness Model for Intermittently Connected Mobile Networks

NARCIS (Netherlands)

Türkes, Okan; Scholten, Johan; Havinga, Paul J.M.

Recently, context awareness in Intermittently Connected Mobile Networks (ICMNs) has gained popularity in order to discover social similarities among mobile entities. Nevertheless, most of the contextual methods depend on network knowledge obtained with unrealistic scenarios. Mobile entities should

An algorithm for routing optimization in DiffServ-aware MPLS networks

OpenAIRE

Luigi Atzori; Fabio D'Andreagiovanni; Carlo Mannino; Tatiana Onali

2010-01-01

This paper addresses the constrained-based routing problem in DiffServaware MPLS networks. We consider a dynamic context in which new requests appear over time, asking for reconfigurations of the previous allocation. In the classical approach, a multi-phase heuristic procedure is adopted: the new requests are evaluated considering available bandwidth; if the bandwidth is not sufficient, preemption and rerouting of one or more connections are performed in sequence. As an alternative, we propos...

Cost-aware request routing in multi-geography cloud data centres using software-defined networking

Science.gov (United States)

Yuan, Haitao; Bi, Jing; Li, Bo Hu; Tan, Wei

2017-03-01

Current geographically distributed cloud data centres (CDCs) require gigantic energy and bandwidth costs to provide multiple cloud applications to users around the world. Previous studies only focus on energy cost minimisation in distributed CDCs. However, a CDC provider needs to deliver gigantic data between users and distributed CDCs through internet service providers (ISPs). Geographical diversity of bandwidth and energy costs brings a highly challenging problem of how to minimise the total cost of a CDC provider. With the recently emerging software-defined networking, we study the total cost minimisation problem for a CDC provider by exploiting geographical diversity of energy and bandwidth costs. We formulate the total cost minimisation problem as a mixed integer non-linear programming (MINLP). Then, we develop heuristic algorithms to solve the problem and to provide a cost-aware request routing for joint optimisation of the selection of ISPs and the number of servers in distributed CDCs. Besides, to tackle the dynamic workload in distributed CDCs, this article proposes a regression-based workload prediction method to obtain future incoming workload. Finally, this work evaluates the cost-aware request routing by trace-driven simulation and compares it with the existing approaches to demonstrate its effectiveness.

Awareness of Emotional Stimuli Determines the Behavioral Consequences of Amygdala Activation and Amygdala-Prefrontal Connectivity

Science.gov (United States)

Lapate, R. C.; Rokers, B.; Tromp, D. P. M.; Orfali, N. S.; Oler, J. A.; Doran, S. T.; Adluru, N.; Alexander, A. L.; Davidson, R. J.

2016-01-01

Conscious awareness of negative cues is thought to enhance emotion-regulatory capacity, but the neural mechanisms underlying this effect are unknown. Using continuous flash suppression (CFS) in the MRI scanner, we manipulated visual awareness of fearful faces during an affect misattribution paradigm, in which preferences for neutral objects can be biased by the valence of a previously presented stimulus. The amygdala responded to fearful faces independently of awareness. However, when awareness of fearful faces was prevented, individuals with greater amygdala responses displayed a negative bias toward unrelated novel neutral faces. In contrast, during the aware condition, inverse coupling between the amygdala and prefrontal cortex reduced this bias, particularly among individuals with higher structural connectivity in the major white matter pathway connecting the prefrontal cortex and amygdala. Collectively, these results indicate that awareness promotes the function of a critical emotion-regulatory network targeting the amygdala, providing a mechanistic account for the role of awareness in emotion regulation. PMID:27181344

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

Science.gov (United States)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis

Directory of Open Access Journals (Sweden)

Rosario G. Garroppo

2013-01-01

Full Text Available The paper deeply analyzes a novel network-wide power management problem, called Power-Aware Routing and Network Design with Bundled Links (PARND-BL, which is able to take into account both the relationship between the power consumption and the traffic throughput of the nodes and to power off both the chassis and even the single Physical Interface Card (PIC composing each link. The solutions of the PARND-BL model have been analyzed by taking into account different aspects associated with the actual applicability in real network scenarios: (i the time for obtaining the solution, (ii the deployed network topology and the resulting topology provided by the solution, (iii the power behavior of the network elements, (iv the traffic load, (v the QoS requirement, and (vi the number of paths to route each traffic demand. Among the most interesting and novel results, our analysis shows that the strategy of minimizing the number of powered-on network elements through the traffic consolidation does not always produce power savings, and the solution of this kind of problems, in some cases, can lead to spliting a single traffic demand into a high number of paths.

An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

Science.gov (United States)

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-08-18

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

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

Science.gov (United States)

Robinson, Y Harold; Rajaram, M

2015-01-01

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

An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jin Wang

2014-08-01

Full Text Available Traffic patterns in wireless sensor networks (WSNs usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

ENERGY EFFICIENT ROUTING PROTOCOLS FOR WIRELESS AD HOC NETWORKS – A SURVEY

Directory of Open Access Journals (Sweden)

K. Sankar

2012-06-01

Full Text Available Reducing energy consumption, primarily with the goal of extending the lifetime of battery-powered devices, has emerged as a fundamental challenge in wireless communication. The performance of the medium access control (MAC scheme not only has a fairly significant end-result on the behaviour of the routing approach employed, but also on the energy consumption of the wireless network interface card (NIC. We investigate the inadequacies of the MAC schemes designed for ad hoc wireless networks in the context of power awareness herein. The topology changes due to uncontrollable factors such as node mobility, weather, interference, noise, as well as on controllable parameters such as transmission power and antenna direction results in significant amount of energy loss. Controlling rapid topology changes by minimizing the maximum transmission power used in ad hoc wireless networks, while still maintaining networks connectivity can prolong battery life and hence network lifetime considerably. In addition, we systematically explore the potential energy consumption pitfalls of non–power-based and power based routing schemes. We suggest a thorough energy-based performance survey of energy aware routing protocols for wireless mobile ad-hoc networks. We also present the statistical performance metrics measured by our simulations.

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

Directory of Open Access Journals (Sweden)

A.V. Sutagundar

2013-03-01

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

A Novel Load Balancing Scheme for Multipath Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Kokilamani Mounagurusamy

2016-09-01

Full Text Available The recent advancements in information and communication technology create a great demand for multipath routing protocols. In MANET, nodes can be arbitrarily located and can move freely at any given time. The topology of MANET can change rapidly and unpredictably. Because wireless link capacities are usually limited, congestion is possible in MANETs. Hence, balancing the load in a MANET is important since nodes with high load will deplete their batteries quickly, thereby increasing the probability of disconnecting or partitioning the network. To overcome these, the multipath protocol should be aware of load at route discovery phase. The main objective of the proposed article is to balance the load on a node and to extend the lifetime of the node due to the congestion, energy depletion and link failures. This article describes a novel load and congestion aware scheme called Path Efficient Ad-hoc On-demand Multipath Distance Vector (PE-AOMDV protocol to increase the performance of routing process in MANET in terms of congestion, end-to-end delay and load balancing. A new threshold value and a counter variable are introduced to limit the number of communication paths passing over a node in route discovery phase. For every new request the counter variable is incremented by one and the threshold value is compared to see whether the maximum number of connections has been reached or not. The proposed method is network simulator ns-2 and it is found that there is a significant improvement in the proposed scheme. It reduces the energy consumption, average end-to-end delay and normalized routing overhead. Also the proposed scheme increases packet delivery ratio, throughput and minimizes routing overheads.

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.

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

Science.gov (United States)

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-01-01

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio. PMID:29562628

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks.

Science.gov (United States)

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-03-18

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shaobo Wu

2018-03-01

Full Text Available Wireless sensor networks (WSNs involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

DEFF Research Database (Denmark)

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

2012-01-01

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

On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks.

Science.gov (United States)

Monowar, Muhammad Mostafa; Bajaber, Fuad

2015-06-15

In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches.

QoS and energy aware cooperative routing protocol for wildfire monitoring wireless sensor networks.

Science.gov (United States)

Maalej, Mohamed; Cherif, Sofiane; Besbes, Hichem

2013-01-01

Wireless sensor networks (WSN) are presented as proper solution for wildfire monitoring. However, this application requires a design of WSN taking into account the network lifetime and the shadowing effect generated by the trees in the forest environment. Cooperative communication is a promising solution for WSN which uses, at each hop, the resources of multiple nodes to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modeling, optimizing a cooperative communication protocol based on RSSI and node energy consumption in a competitive context (RSSI/energy-CC), that is, an energy and quality-of-service aware-based cooperative communication routing protocol. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.

On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Muhammad Mostafa Monowar

2015-06-01

Full Text Available In this paper, we address the thermal rise and Quality-of-Service (QoS provisioning issue for an intra-body Wireless Body Area Network (WBAN having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s, and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches.

On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks

OpenAIRE

Monowar, Muhammad Mostafa; Bajaber, Fuad

2015-01-01

In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level....

Comparison of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2011-09-01

Full Text Available in each and every relay node so as to find the next hop for the packet. A routing metric is simply a measure used for selecting the best path, used by a routing protocol. Figure 2 shows the relationship between a routing protocol and the routing... on its QoS-awareness level. The routing metrics that considered QoS the most were selected from each group. This section discusses the four routing metrics that were compared in this paper, which are: hop count (HOP), expected transmission count (ETX...

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

Directory of Open Access Journals (Sweden)

Farzad Kiani

2016-01-01

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

Performance evaluation of spatial vector routing protocol for wireless sensor networks

International Nuclear Information System (INIS)

Baloch, J.; Jokhio, I.

2012-01-01

WSNs (Wireless Sensor Networks) is an emerging area of research. Researchers worldwide are working on the issues faced by sensor nodes. Communication has been a major issue in wireless networks and the problem is manifolds in WSN s because of the limited resources. The routing protocol in such networks plays a pivotal role, as an effective routing protocol could significantly reduce the energy consumed in transmitting and receiving data packets throughout a network. In this paper the performance of SVR (Spatial Vector Routing) an energy efficient, location aware routing protocol is compared with the existing location aware protocols. The results from the simulation trials show the performance of SVR. (author)

Performance Evaluation of Spatial Vector Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Javed Ali Baloch

2012-10-01

Full Text Available WSNs (Wireless Sensor Networks is an emerging area of research. Researchers worldwide are working on the issues faced by sensor nodes. Communication has been a major issue in wireless networks and the problem is manifolds in WSNs because of the limited resources. The routing protocol in such networks plays a pivotal role, as an effective routing protocol could significantly reduce the energy consumed in transmitting and receiving data packets throughout a network. In this paper the performance of SVR (Spatial Vector Routing an energy efficient, location aware routing protocol is compared with the existing location aware protocols. The results from the simulation trials show the performance of SVR.

OSPF-TE Extensions for Green Routing in Optical Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Ricciardi, S.; Fagertun, Anna Manolova

2012-01-01

This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing.......This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing....

Cooperative Cloud Service Aware Mobile Internet Coverage Connectivity Guarantee Protocol Based on Sensor Opportunistic Coverage Mechanism

Directory of Open Access Journals (Sweden)

Qin Qin

2015-01-01

Full Text Available In order to improve the Internet coverage ratio and provide connectivity guarantee, based on sensor opportunistic coverage mechanism and cooperative cloud service, we proposed the coverage connectivity guarantee protocol for mobile Internet. In this scheme, based on the opportunistic covering rules, the network coverage algorithm of high reliability and real-time security was achieved by using the opportunity of sensor nodes and the Internet mobile node. Then, the cloud service business support platform is created based on the Internet application service management capabilities and wireless sensor network communication service capabilities, which is the architecture of the cloud support layer. The cooperative cloud service aware model was proposed. Finally, we proposed the mobile Internet coverage connectivity guarantee protocol. The results of experiments demonstrate that the proposed algorithm has excellent performance, in terms of the security of the Internet and the stability, as well as coverage connectivity ability.

Anonymous Connections and Onion Routing

National Research Council Canada - National Science Library

Syverson, Paul F; Goldschlag, David M; Reed, Michael G

1997-01-01

.... Unmodified Internet applications can use these anonymous connections by means of proxies. The proxies may also make communication anonymous by removing identifying information from the data stream...

NATURE FACILITATES CONNECTION WITH THE PROFOUND SELF: NEEDS, GOALS AND RESOURCE AWARENESS

Directory of Open Access Journals (Sweden)

Nicoleta Răban-Motounu

2014-11-01

Full Text Available The present study is based on Kaplan and Kaplan’s (1989 theory explaining the restorative effects that nature has on a person’s psychic. According to this theory, nature exerts a “soft fascination” combining the activation of involuntary attention mechanisms with the reflexive awareness, allowing a spontaneous detachment from stress factors and automatic functioning, and also the feeling of compatibility between personal purposes, and the possibilities for action offered by the environment (a sense of meaning. Our objective was to investigate the effects of nature on Self awareness: the immediate, emotional experience; needs awareness and organization; plans for action, and availability of resources, both personal, and external. We conducted an experiment with an experimental group (persons watching a video with life in nature and an active control group (involved in a psychotherapeutic technique focused on confronting and solving personal difficulties by creative means, accompanied by a short psychological analysis. The effects were assessed in terms of “here and now” emotions and available resources according to a self-evaluation scale, and with open-ended questions regarding personal needs and goals. The results showed that, for the experimental group, the relaxation effects and the awareness of long term goals were stronger, while all the other effects were the same as for the control group. The results suggest that indeed, nature helps a person get in contact with her profound Self, allowing the access to both “here and now” basic needs, and also long term goals (inner sources of meaning, the sense of connection between internal tendencies, personal, and external resources, resulting in increased positive emotions, and decreased negative emotions. Nature contemplation may facilitate a meditative state whit all its positive effects.

Enhanced DSR Routing Protocol for the Short Time Disconnected MANET

Directory of Open Access Journals (Sweden)

PAPAJ Ján

2013-05-01

Full Text Available Data delivery in Mobile Ad-Hoc network (MANET is a very difficult task due to the fact the sporadic connections between mobile nodes. For this reason, we introduce the new modified routing protocol that enables the data delivery in the case that the connections are disconnected. A key aspect of the protocol is a process of finding connections between source and destination nodes that can provide low end-to-end delay and better delivery performance in a disconnected MANET. The protocol provides the concepts of opportunistic routing of the routing packets in disconnected MANETs. In this paper we present a modification of the DSR routing protocol and also some results of a simulation.

Awareness and Self-Awareness for Multi-Robot Organisms

OpenAIRE

Kernbach, Serge

2011-01-01

Awareness and self-awareness are two different notions related to knowing the environment and itself. In a general context, the mechanism of self-awareness belongs to a class of co-called "self-issues" (self-* or self-star): self-adaptation, self-repairing, self-replication, self-development or self-recovery. The self-* issues are connected in many ways to adaptability and evolvability, to the emergence of behavior and to the controllability of long-term developmental processes. Self-* are ei...

An Energy-aware Routing Scheme in Delay Tolerant Mobile Sensor Networking

Directory of Open Access Journals (Sweden)

Zhe Chen

2014-08-01

Full Text Available In Delay Tolerant Mobile Sensor Networking (DTMSN, mobile sensor nodes are usually limited to their energy capacity, one important concern in routing design of DTMSN is energy consumption. This paper presents a number of variations of the Epidemic Routing Protocol (ERP to extend the DTMSN lifetime. It introduces the analytical model for ERP, after introducing the concepts behind the Target Delivery Probability and Minimum Delivery Probability, it defines the network lifetime. In this paper, it firstly studies many variations of the Epidemic Routing Protocol to extend the lifetime of the DTMSN. Secondly, based on the Epidemic Routing Protocol, three schemes are introduced. Those schemes rely on the limiting the times of message allowed for propagation (LT scheme, directly controlling the number of the copies (LC scheme, split the copies to the residual energies of the nodes (LE scheme. Finally, with the experiment and the validation of the simulation, the LE scheme can significantly maximize the lifetime of DTMSN, because it minimizes the number of copies and that shifts the generation of the copies to the nodes with larger residual energy.

Routing Protocol for Mobile Ad-hoc Wireless Networks

Directory of Open Access Journals (Sweden)

I. M. B. Nogales

2007-09-01

Full Text Available Bluetooth is a cutting-edge technology used for implementing wireless ad hoc networks. In order to provide an overall scheme for mobile ad hoc networks, this paper deals with scatternet topology formation and routing algorithm to form larger ad hoc wireless Networks. Scatternet topology starts by forming a robust network, which is less susceptible to the problems posed by node mobility. Mobile topology relies on the presence of free nodes that create multiple connections with the network and on their subsequently rejoining the network. Our routing protocol is a proactive routing protocol, which is tailor made for the Bluetooth ad hoc network. The connection establishment connects nodes in a structure that simplifies packet routing and scheduling. The design allows nodes to arrive and leave arbitrarily, incrementally building the topology and healing partitions when they occur. We present simulation results that show that the algorithm presents low formation latency and also generates an efficient topology for forwarding packets along ad-hoc wireless networks.

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

OpenAIRE

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

2013-01-01

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

Proxies for Anonymous Routing

National Research Council Canada - National Science Library

Reed, Michael G; Syverson, Paul F; Goldschlag, David M

1996-01-01

...), and file transfers (FTP) have been implemented. Onion routing provides application independent, real-time, and bi-directional anonymous connections that are resistant to both eavesdropping and traffic analysis...

Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

OpenAIRE

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

2011-01-01

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

Scripted Mobile Network Routing in a Contested Environment

National Research Council Canada - National Science Library

Otto, Anthony R

2008-01-01

Mobile wireless network protocols currently run on optimistic routing algorithms, adjusting node connectivity only when the chosen connectivity metrics, such as signal strength, pass beyond minimum thresholds...

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

A Secure Routing Protocol for Wireless Sensor Networks Considering Secure Data Aggregation

Directory of Open Access Journals (Sweden)

Triana Mugia Rahayu

2015-06-01

Full Text Available The commonly unattended and hostile deployments of WSNs and their resource-constrained sensor devices have led to an increasing demand for secure energy-efficient protocols. Routing and data aggregation receive the most attention since they are among the daily network routines. With the awareness of such demand, we found that so far there has been no work that lays out a secure routing protocol as the foundation for a secure data aggregation protocol. We argue that the secure routing role would be rendered useless if the data aggregation scheme built on it is not secure. Conversely, the secure data aggregation protocol needs a secure underlying routing protocol as its foundation in order to be effectively optimal. As an attempt for the solution, we devise an energy-aware protocol based on LEACH and ESPDA that combines secure routing protocol and secure data aggregation protocol. We then evaluate its security effectiveness and its energy-efficiency aspects, knowing that there are always trade-off between both.

Cost-effective handoff scheme based on mobility-aware dual pointer forwarding in proxy mobile IPv6 networks.

Science.gov (United States)

Son, Seungsik; Jeong, Jongpil

2014-01-01

In this paper, a mobility-aware Dual Pointer Forwarding scheme (mDPF) is applied in Proxy Mobile IPv6 (PMIPv6) networks. The movement of a Mobile Node (MN) is classified as intra-domain and inter-domain handoff. When the MN moves, this scheme can reduce the high signaling overhead for intra-handoff/inter-handoff, because the Local Mobility Anchor (LMA) and Mobile Access Gateway (MAG) are connected by pointer chains. In other words, a handoff is aware of low mobility between the previously attached MAG (pMAG) and newly attached MAG (nMAG), and another handoff between the previously attached LMA (pLMA) and newly attached LMA (nLMA) is aware of high mobility. Based on these mobility-aware binding updates, the overhead of the packet delivery can be reduced. Also, we analyse the binding update cost and packet delivery cost for route optimization, based on the mathematical analytic model. Analytical results show that our mDPF outperforms the PMIPv6 and the other pointer forwarding schemes, in terms of reducing the total cost of signaling.

RFID-WSN integrated architecture for energy and delay- aware routing a simulation approach

CERN Document Server

Ahmed, Jameel; Tayyab, Muhammad; Nawaz, Menaa

2015-01-01

The book identifies the performance challenges concerning Wireless Sensor Networks (WSN) and Radio Frequency Identification (RFID) and analyzes their impact on the performance of routing protocols. It presents a thorough literature survey to identify the issues affecting routing protocol performance, as well as a mathematical model for calculating the end-to-end delays of the routing protocol ACQUIRE; a comparison of two routing protocols (ACQUIRE and DIRECTED DIFFUSION) is also provided for evaluation purposes. On the basis of the results and literature review, recommendations are made for better selection of protocols regarding the nature of the respective application and related challenges. In addition, this book covers a proposed simulator that integrates both RFID and WSN technologies. Therefore, the manuscript is divided in two major parts: an integrated architecture of smart nodes, and a power-optimized protocol for query and information interchange.

The Silk Route from Land to Sea

Directory of Open Access Journals (Sweden)

Jack Weatherford

2018-04-01

Full Text Available The Silk Route reached its historic and economic apogee under the Mongol Empire (1207–1368, as a direct result of the policies of Chinggis Khan (Genghis Khan and his successors. Because the land network proved inefficient for the amount of goods needing transport from one part of the empire to another, the Mongols expanded the Silk Route to ocean shipping and thus created the first Maritime Silk Route. The sea traffic initially expanded the land routes but soon strangled them. With the expansion of the Maritime Silk Route through the fourteenth century, the land connections reverted to local networks and lost their global importance.

Routing protocol extension for resilient GMPLS multi-domain networks

DEFF Research Database (Denmark)

Manolova, Anna Vasileva; Ruepp, Sarah Renée; Romeral, Ricardo

2010-01-01

This paper evaluates the performance of multi-domain networks under the Generalized Multi-Protocol Label Switching control framework in case of a single inter-domain link failure. We propose and evaluate a routing protocol extension for the Border Gateway Protocol, which allows domains to obtain...... two Autonomous System disjoint paths and use them efficiently under failure conditions. Three main applications for the protocol extension are illustrated: reducing traffic loss on existing connections by xploiting pre-selected backup paths derived with our proposal, applying multi-domain restoration...... as survivability mechanism in case of single link failure, and employing proper failure notification mechanisms for routing of future connection requests under routing protocol re-convergence. Via simulations we illustrate the benefits of utilizing the proposed routing protocol extension for networks employing...

Overview: Routes to Open Access

OpenAIRE

Tullney, Marco; van Wezenbeek, Wilma

2017-01-01

Slides of an overview presentation given at a CESAER workshop on Open Access, February 2nd, 2017, in Brussels Cover major routes to more open access as discussed in the Task Force Open Science of CESAER: (national) open access strategies open access mandates open access incentives open access awareness open access publishing open access infrastructure

Routing in Networks with Random Topologies

Science.gov (United States)

Bambos, Nicholas

1997-01-01

We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

Location-Aware Cross-Layer Design Using Overlay Watermarks

Directory of Open Access Journals (Sweden)

Paul Ho

2007-04-01

Full Text Available A new orthogonal frequency division multiplexing (OFDM system embedded with overlay watermarks for location-aware cross-layer design is proposed in this paper. One major advantage of the proposed system is the multiple functionalities the overlay watermark provides, which includes a cross-layer signaling interface, a transceiver identification for position-aware routing, as well as its basic role as a training sequence for channel estimation. Wireless terminals are typically battery powered and have limited wireless communication bandwidth. Therefore, efficient collaborative signal processing algorithms that consume less energy for computation and less bandwidth for communication are needed. Transceiver aware of its location can also improve the routing efficiency by selective flooding or selective forwarding data only in the desired direction, since in most cases the location of a wireless host is unknown. In the proposed OFDM system, location information of a mobile for efficient routing can be easily derived when a unique watermark is associated with each individual transceiver. In addition, cross-layer signaling and other interlayer interactive information can be exchanged with a new data pipe created by modulating the overlay watermarks. We also study the channel estimation and watermark removal techniques at the physical layer for the proposed overlay OFDM. Our channel estimator iteratively estimates the channel impulse response and the combined signal vector from the overlay OFDM signal. Cross-layer design that leads to low-power consumption and more efficient routing is investigated.

Routing and Disaster Awareness in Optical Networks

NARCIS (Netherlands)

Muhammad Iqbal, M.A.F.

2016-01-01

Optical networks facilitate the configurations of high-speed network connections with tremendous bandwidth between the optical switches. Optical switches are interconnected by optical fibers that act as the mediums in which data are transferred using lightpaths. Due to the importance of optical

An energy-aware engineered control plane for wavelength-routed networks

DEFF Research Database (Denmark)

Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

2015-01-01

' operational expenditures. To face this problem, we propose a single-stage routing and wavelength assignment scheme, based on several network engineering extensions to the Generalised Multi-Protocol Label Switching (GMPLS) control plane protocols, mainly Open Shortest Path First, with new composed metrics...

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

DEFF Research Database (Denmark)

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

1998-01-01

interchanging can be used to create a robust and nonblocking OXC. However, for an OXC with n fiber inlets each carrying m wavelengths the OXC requires n×m internal wavelengths, which constrains the size of the cross-connect. In this paper we therefore propose and demonstrate an architecture that uses a reduced......Optical transport layers need rearrangeable wavelength-division multiplexing optical cross-connects (OXCs) to increase the capacity and flexibility of the network. It has previously been shown that a cross-connect based on all-optical wavelength converters for routing as well as wavelength slot...... set of internal wavelengths without sacrificing cross-connecting capabilities. By inserting a partly equipped OXC with the new architecture in a 10-Gbit/s re-circulating loop setup we demonstrate the possibility of cascading up to ten OXCs. Furthermore, we investigate the regenerating effect...

Impact of Dual-Link Failures on Impairment-Aware Routed Networks

DEFF Research Database (Denmark)

Georgakilas, Konstantinos N; Katrinis, Kostas; Tzanakaki, Anna

2010-01-01

This paper evaluates the impact of dual-link failures on single-link failure resilient networks, while physical layer constraints are taken into consideration during demand routing, as dual link failures and equivalent situations appear to be quite probable in core optical networks. In particular...

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

Science.gov (United States)

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

2018-01-26

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

A Proposal for IoT Dynamic Routes Selection Based on Contextual Information

Directory of Open Access Journals (Sweden)

Harilton da Silva Araújo

2018-01-01

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

Turbulence Awareness for Strategic Aircraft Re-Routing (TASAR-R), Phase I

Data.gov (United States)

National Aeronautics and Space Administration — The Innovation Laboratory, Inc., proposes to develop a Decision Support Tool (DST) for strategic guidance to pilots for mitigating encounters with en route...

Energy Aware GPSR Routing Protocol in a Wireless Sensor Network ...

African Journals Online (AJOL)

Energy is the scarce resource in wireless sensor networks (WSNs), and it determines the lifetime of WSNs. For this reason, WSN algorithms and routing protocols should be selected in a manner which fulfills these energy requirements. This paper presents a solution to increase the lifetime of WSNs by decreasing their ...

Analog integrated circuit design automation placement, routing and parasitic extraction techniques

CERN Document Server

Martins, Ricardo; Horta, Nuno

2017-01-01

This book introduces readers to a variety of tools for analog layout design automation. After discussing the placement and routing problem in electronic design automation (EDA), the authors overview a variety of automatic layout generation tools, as well as the most recent advances in analog layout-aware circuit sizing. The discussion includes different methods for automatic placement (a template-based Placer and an optimization-based Placer), a fully-automatic Router and an empirical-based Parasitic Extractor. The concepts and algorithms of all the modules are thoroughly described, enabling readers to reproduce the methodologies, improve the quality of their designs, or use them as starting point for a new tool. All the methods described are applied to practical examples for a 130nm design process, as well as placement and routing benchmark sets. Introduces readers to hierarchical combination of Pareto fronts of placements; Presents electromigration-aware routing with multilayer multiport terminal structures...

Towards droplet size-aware biochemical application compilation for AM-EWOD biochips

DEFF Research Database (Denmark)

Pop, Paul; Alistar, Mirela

2015-01-01

a droplet size-aware compilation by proposing a routing algorithm that considers the droplet size. Our routing algorithm is developed for a novel digital microfluidic biochip architecture based on Active Matrix Electrowetting on Dielectric, which uses a thin film transistor array for the electrodes. We also...

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

Directory of Open Access Journals (Sweden)

Amit Sarkar

2016-12-01

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

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

Science.gov (United States)

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

2018-05-03

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

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

Directory of Open Access Journals (Sweden)

Farhan Aadil

2018-05-01

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

A QoS aware services mashup model for cloud computing applications

Directory of Open Access Journals (Sweden)

Yee Ming Chen

2012-12-01

Full Text Available Purpose: With the popularity of cloud computing, cloud services have become to be application programming platform where users can create new applications mashup(composing the functionality offered byothers.By composing of distributed, cloud services dynamicallyto provide more complex tasks, services mashup provides an attractive way for building large-scale Internetapplications.Oneof the challenging issues of cloud services mashup is how to find service paths to route the service instances provider through whilemeeting the applications’ resource requirements so that the QoS constraints are satisfied. However, QoS aware service routing problem istypically NP-hard.The purpose of this paper is to propose a QoS Aware Services Mashup(QASM model to solve this problem more effectively.Design/methodology/approach: In this paper, we focus on the QoS aware services selection problem in cloud services mashup, for example, given the user service composition requirements and their QoS constraint descriptions, how to select the required serviceinstances and route the data flows through these instances so that the QoS requirements are satisfied. We design a heuristic algorithm to find service paths to route the data flows through whilemeeting the applications’ resource requirements and specific QoS constraints.Findings: This study propose a QoS Aware Services Mashup(QASM model to solve this problem more effectively. Simulations show that QASM can achieve desired QoS assurances as well as load balancing in cloud services environment.Originality/value: This paperpresent a QASM model for providing high performance distributedapplications in the cloud computing systems.

Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

R. Asokan

2008-01-01

Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA with self-healing and optimized routing techniques (SHORT. SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy.

User habits and multimodal route planning

Directory of Open Access Journals (Sweden)

Géza Katona

2017-10-01

Full Text Available The results of route planning researches are monitored by logistic and automotive industries. The economic aspects of the cost saving are in the focus of the attention. An optimal route could cause time or fuel savings. An effective driving or an optimal route is a good basis to achieve an economical aim. Moreover the spread of new automotive solutions especially in case of electric cars the optimisation has particular significance regarding the limited battery storage. Additionally the autonomous car development could not be neglected. As a result the society could expect safer roads, better space usage and effective resource management. Nevertheless the requirements of users are extremely diverse, which is not negligible. Supporting these aims, in this paper the connection between the multimodal route planning and the user requirements are investigated. The examination is focused to a sensitivity analysis and a survey to evaluate the data and support the settings of a user habit effect to the final route.

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

Directory of Open Access Journals (Sweden)

Adamu Murtala Zungeru

2013-01-01

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

Body awareness and mindfulness: validation of the Spanish version of the Scale of Body Connection.

Science.gov (United States)

del C Quezada-Berumen, Lucía; González-Ramírez, Mónica T; Cebolla, Ausias; Soler, Joaquim; Garcia-Campayo, Javier

2014-01-01

To assess the psychometric properties and the factor structure of the Spanish version of the Scale of Body Connection (SBC) in a community population of meditators and non-meditators and to investigate the relationships among mindfulness, body awareness and body dissociation. Design. Validation study. Sampling. An internet-based commercial system was used to recruit the sample. Instruments. In addition to the SBC, the Five Facet Mindfulness Questionnaire (FFMQ) and the Depression, Anxiety, and Stress Scale (DASS-21) were administered. A sample of 578 subjects responded to all of the items in the protocol. A total of 55.2% of respondents had some previous experience with meditation. A Scree plot showed a two-factor solution involving the Body Awareness (BA) and Body Dissociation (BD) subscales. This study differed from the original validation study in the lack of independence of the subscales; they were correlated in the present study (r=-.11). Internal consistency for BA was α: .86, and for BD, the α was .62. Test-retest reliability was assessed in a subsample (N=67) and was r=.679 for BA and r=.765 for BD. Hierarchical multiple regression analyses showed that mindfulness practice and the FFMQ factors of Observing and Describing were positive predictors of BA. Describing, Acting with awareness and Non-judging negatively predicted BD, and Observing positively predicted BD. The study confirms the adequacy of the psychometric properties of the Spanish version of the SBC for use in community samples. The relationship between SBC and mindfulness is discussed in light of previous research.

Lightweight context aware routing in wireless sensor networks for environments

International Nuclear Information System (INIS)

Aijaz, S.

2015-01-01

Design and implementation of a WSN (Wireless Sensor Network) that can efficiently work for a longer time period must include identification of the deployment environment context and to conform to the behavior of the sensor nodes. The context information when treated with evaluation factor becomes a process of context awareness and the evaluation factor is called the context attribute. In this paper, we consider the context factor of energy. The paper identifies analyses and evaluates efficiency of two when used in a context aware environment. Furthermore, the study also highlights the strengths and weaknesses of sensor SPIN (Sensor Protocol for Information via Negotiation) and LEACH (Low Energy Adaptive Clustering Hierarchy) protocols with respect to the support for WSN with heavy network traffic conditions. The performance has been evaluated in terms of energy efficiency, data packet transmission, network status, data management, reliability, etc. (author)

Geotechnical characterization through in situ and laboratory tests of several geological formations present in the route of the Future Fix Connection between Spain and Morocco through Gibraltar Strait

International Nuclear Information System (INIS)

Perucho Martinez, A.; Diez Torres, J. A.; Muniz Menendez, M.; Cano Linares, H.; Ruiz Fonticiella, J. M.

2015-01-01

CEDEX and SECEGSA (Sociedad Española para la Comunicación Fija a través del Estrecho de Gibraltar), Have been collaborating since a few decades ago to study different technical aspects related to the Fix Connection through the Gibraltar Strait, mainly in relation to the geological and geotechnical properties of the different formations present in the route. In order to do so, many studies of geotechnical characterization of materials, in situ and laboratory testing campaigns have been carried out. Furthermore, they have participated in some Expertise Committees carrying out some advice work related to studies performed by other organizations. This paper presents a brief description of the most relevant aspects of the main geological and geotechnical studies performed related to this Project of the Future Fix Connection and obtained through the study of SECEGSAs extensive data base. Moreover, it includes a synopsis of the geotechnical characterization carried out through in situ and laboratory tests on different Miocene and Eocene formations from the Algeciras Unit, present in the route of the future Fix Connection between Spain and gibraltar through the Gibraltar Strait. (Author)

DEHAR: a Distributed Energy Harvesting Aware Routing Algorithm for Ad-hoc Multi-hop Wireless Sensor Networks

DEFF Research Database (Denmark)

Jakobsen, Mikkel Koefoed; Madsen, Jan; Hansen, Michael Reichhardt

2010-01-01

One of the key design goals in Wireless Sensor Networks is long lasting or even continuous operation. Continuous operation is made possible through energy harvesting. Keeping the network operational imposes a demand to prevent network segmentation and power loss in nodes. It is therefore important...... that the best energy-wise route is found for each data transfer from a source node to the sink node. We present a new adaptive and distributed routing algorithm for finding energy optimised routes in a wireless sensor network with energy harvesting. The algorithm finds an energy efficient route from each source...

Oral-to-inhalation route extrapolation in occupational health risk assessment: A critical assessment

NARCIS (Netherlands)

Rennen, M.A.J.; Bouwman, T.; Wilschut, A.; Bessems, J.G.M.; Heer, C.de

2004-01-01

Due to a lack of route-specific toxicity data, the health risks resulting from occupational exposure are frequently assessed by route-to-route (RtR) extrapolation based on oral toxicity data. Insight into the conditions for and the uncertainties connected with the application of RtR extrapolation

Preventing Restricted Space Inference in Online Route Planning Services

Directory of Open Access Journals (Sweden)

Florian Dorfmeister

2016-03-01

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

Service-Aware Clustering: An Energy-Efficient Model for the Internet-of-Things.

Science.gov (United States)

Bagula, Antoine; Abidoye, Ademola Philip; Zodi, Guy-Alain Lusilao

2015-12-23

Current generation wireless sensor routing algorithms and protocols have been designed based on a myopic routing approach, where the motes are assumed to have the same sensing and communication capabilities. Myopic routing is not a natural fit for the IoT, as it may lead to energy imbalance and subsequent short-lived sensor networks, routing the sensor readings over the most service-intensive sensor nodes, while leaving the least active nodes idle. This paper revisits the issue of energy efficiency in sensor networks to propose a clustering model where sensor devices' service delivery is mapped into an energy awareness model, used to design a clustering algorithm that finds service-aware clustering (SAC) configurations in IoT settings. The performance evaluation reveals the relative energy efficiency of the proposed SAC algorithm compared to related routing algorithms in terms of energy consumption, the sensor nodes' life span and its traffic engineering efficiency in terms of throughput and delay. These include the well-known low energy adaptive clustering hierarchy (LEACH) and LEACH-centralized (LEACH-C) algorithms, as well as the most recent algorithms, such as DECSA and MOCRN.

Service-Aware Clustering: An Energy-Efficient Model for the Internet-of-Things

Directory of Open Access Journals (Sweden)

Antoine Bagula

2015-12-01

Full Text Available Current generation wireless sensor routing algorithms and protocols have been designed based on a myopic routing approach, where the motes are assumed to have the same sensing and communication capabilities. Myopic routing is not a natural fit for the IoT, as it may lead to energy imbalance and subsequent short-lived sensor networks, routing the sensor readings over the most service-intensive sensor nodes, while leaving the least active nodes idle. This paper revisits the issue of energy efficiency in sensor networks to propose a clustering model where sensor devices’ service delivery is mapped into an energy awareness model, used to design a clustering algorithm that finds service-aware clustering (SAC configurations in IoT settings. The performance evaluation reveals the relative energy efficiency of the proposed SAC algorithm compared to related routing algorithms in terms of energy consumption, the sensor nodes’ life span and its traffic engineering efficiency in terms of throughput and delay. These include the well-known low energy adaptive clustering hierarchy (LEACH and LEACH-centralized (LEACH-C algorithms, as well as the most recent algorithms, such as DECSA and MOCRN.

Route Flap Damping Made Usable

Science.gov (United States)

Pelsser, Cristel; Maennel, Olaf; Mohapatra, Pradosh; Bush, Randy; Patel, Keyur

The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is known to be noisy. The protocol has two main mechanisms to ameliorate this, MinRouteAdvertisementInterval (MRAI), and Route Flap Damping (RFD). MRAI deals with very short bursts on the order of a few to 30 seconds. RFD deals with longer bursts, minutes to hours. Unfortunately, RFD was found to severely penalize sites for being well-connected because topological richness amplifies the number of update messages exchanged. So most operators have disabled it. Through measurement, this paper explores the avenue of absolutely minimal change to code, and shows that a few RFD algorithmic constants and limits can be trivially modified, with the result being damping a non-trivial amount of long term churn without penalizing well-behaved prefixes' normal convergence process.

LITERATURE SURVEY ON EXISTING POWER SAVING ROUTING METHODS AND TECHNIQUES FOR INCREASING NETWORK LIFE TIME IN MANET

Directory of Open Access Journals (Sweden)

K Mariyappan

2017-06-01

Full Text Available Mobile ad hoc network (MANET is a special type of wireless network in which a collection of wireless mobile devices (called also nodes dynamically forming a temporary network without the need of any pre-existing network infrastructure or centralized administration. Currently, Mobile ad hoc networks (MANETs play a significant role in university campus, advertisement, emergency response, disaster recovery, military use in battle fields, disaster management scenarios, in sensor network, and so on. However, wireless network devices, especially in ad hoc networks, are typically battery-powered. Thus, energy efficiency is a critical issue for battery-powered mobile devices in ad hoc networks. This is due to the fact that failure of node or link allows re-routing and establishing a new path from source to destination which creates extra energy consumption of nodes and sparse network connectivity, leading to a more likelihood occurrences of network partition. Routing based on energy related parameters is one of the important solutions to extend the lifetime of the node and reduce energy consumption of the network. In this paper detail literature survey on existing energy efficient routing method are studied and compared for their performance under different condition. The result has shown that both the broadcast schemes and energy aware metrics have great potential in overcoming the broadcast storm problem associated with flooding. However, the performances of these approaches rely on either the appropriate selection of the broadcast decision parameter or an energy efficient path. In the earlier proposed broadcast methods, the forwarding probability is selected based on fixed probability or number of neighbors regardless of nodes battery capacity whereas in energy aware schemes energy inefficient node could be part of an established path. Therefore, in an attempt to remedy the paucity of research and to address the gaps identified in this area, a study

Constructing Battery-Aware Virtual Backbones in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Yang Yuanyuan

2007-01-01

Full Text Available A critical issue in battery-powered sensor networks is to construct energy efficient virtual backbones for network routing. Recent study in battery technology reveals that batteries tend to discharge more power than needed and reimburse the over-discharged power if they are recovered. In this paper we first provide a mathematical battery model suitable for implementation in sensor networks. We then introduce the concept of battery-aware connected dominating set (BACDS and show that in general the minimum BACDS (MBACDS can achieve longer lifetime than the previous backbone structures. Then we show that finding a MBACDS is NP-hard and give a distributed approximation algorithm to construct the BACDS. The resulting BACDS constructed by our algorithm is at most opt size, where is the maximum node degree and opt is the size of an optimal BACDS. Simulation results show that the BACDS can save a significant amount of energy and achieve up to longer network lifetime than previous schemes.

Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors

Directory of Open Access Journals (Sweden)

Trung Kien Vu

2014-01-01

Full Text Available We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.

Handbook of networking & connectivity

CERN Document Server

McClain, Gary R

1994-01-01

Handbook of Networking & Connectivity focuses on connectivity standards in use, including hardware and software options. The book serves as a guide for solving specific problems that arise in designing and maintaining organizational networks.The selection first tackles open systems interconnection, guide to digital communications, and implementing TCP/IP in an SNA environment. Discussions focus on elimination of the SNA backbone, routing SNA over internets, connectionless versus connection-oriented networks, internet concepts, application program interfaces, basic principles of layering, proto

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

Science.gov (United States)

Davis, L. C.

2017-07-01

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

Route planning with transportation network maps: an eye-tracking study.

Science.gov (United States)

Grison, Elise; Gyselinck, Valérie; Burkhardt, Jean-Marie; Wiener, Jan Malte

2017-09-01

Planning routes using transportation network maps is a common task that has received little attention in the literature. Here, we present a novel eye-tracking paradigm to investigate psychological processes and mechanisms involved in such a route planning. In the experiment, participants were first presented with an origin and destination pair before we presented them with fictitious public transportation maps. Their task was to find the connecting route that required the minimum number of transfers. Based on participants' gaze behaviour, each trial was split into two phases: (1) the search for origin and destination phase, i.e., the initial phase of the trial until participants gazed at both origin and destination at least once and (2) the route planning and selection phase. Comparisons of other eye-tracking measures between these phases and the time to complete them, which depended on the complexity of the planning task, suggest that these two phases are indeed distinct and supported by different cognitive processes. For example, participants spent more time attending the centre of the map during the initial search phase, before directing their attention to connecting stations, where transitions between lines were possible. Our results provide novel insights into the psychological processes involved in route planning from maps. The findings are discussed in relation to the current theories of route planning.

Creating a Current Awareness Service Using Yahoo! Pipes and LibGuides

Directory of Open Access Journals (Sweden)

Elizabeth Kiscaden

2014-12-01

Full Text Available Migration from print to electronic journals brought an end to traditional current awareness services, which primarily utilized print routing. The emergence of Real Simple Syndication, or RSS feeds, and email alerting systems provided users with alternative services. To assist users with adopting these technologies, a service utilizing aggregate feeds to the library’s electronic journal content was created and made available through LibGuides. Libraries can resurrect current awareness services using current technologies to increase awareness and usage of library-provided electronic journal content. The current awareness service presented is an example of how libraries can build simple current awareness services utilizing freely accessible technologies.

Offloading IP Flows onto Lambda-Connections

NARCIS (Netherlands)

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

2007-01-01

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

First demonstration of single-mode MCF transport network with crosstalk-aware in-service optical channel control

DEFF Research Database (Denmark)

Pulverer, K.; Tanaka, T.; Häbel, U.

2017-01-01

We demonstrate the first crosstalk-aware traffic engineering as a use case in a multicore fibre transport network. With the help of a software-defined network controller, modulation format and channel route are adaptively changed using programmable devices with XT monitors.......We demonstrate the first crosstalk-aware traffic engineering as a use case in a multicore fibre transport network. With the help of a software-defined network controller, modulation format and channel route are adaptively changed using programmable devices with XT monitors....

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.

Intelligent routing protocol for ad hoc wireless network

Science.gov (United States)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

A novel routing scheme for mobile ad hoc networks (MANETs), which combines hybrid and multi-inter-routing path properties with a distributed topology discovery route mechanism using control agents is proposed in this paper. In recent years, a variety of hybrid routing protocols for Mobile Ad hoc wireless networks (MANETs) have been developed. Which is proactively maintains routing information for a local neighborhood, while reactively acquiring routes to destinations beyond the global. The hybrid protocol reduces routing discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the other side the hybrid routing protocols in MANETs likes Zone Routing Protocol still need route "re-discover" time when a route between zones link break. Sine the topology update information needs to be broadcast routing request on local zone. Due to this delay, the routing protocol may not be applicable for real-time data and multimedia communication. We utilize the advantages of a clustering organization and multi-routing path in routing protocol to achieve several goals at the same time. Firstly, IRP efficiently saves network bandwidth and reduces route reconstruction time when a routing path fails. The IRP protocol does not require global periodic routing advertisements, local control agents will automatically monitor and repair broke links. Secondly, it efficiently reduces congestion and traffic "bottlenecks" for ClusterHeads in clustering network. Thirdly, it reduces significant overheads associated with maintaining clusters. Fourthly, it improves clusters stability due to dynamic topology changing frequently. In this paper, we present the Intelligent Routing Protocol. First, we discuss the problem of routing in ad hoc networks and the motivation of IRP. We describe the hierarchical architecture of IRP. We describe the routing process and illustrate it with an example. Further, we describe the control manage

Secure Trust Based Key Management Routing Framework for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jugminder Kaur

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

Liu Liu

2017-11-01

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

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.

Lightweight Context Aware Routing in Wireless Sensor Networks for Real Environments

Directory of Open Access Journals (Sweden)

Samia Aijaz

2015-07-01

Full Text Available Design and implementation of a WSN (Wireless Sensor Network that can efficiently work for a longer time period must include identification of the deployment environment context and to conform to the behavior of the sensor nodes. The context information when treated with evaluation factor becomes a process of context awareness and the evaluation factor is called the context attribute. In this paper, we consider the context factor of energy. The paper identifies analyses and evaluates efficiency of two when used in a context aware environment. Furthermore, the study also highlights the strengths and weaknesses of sensor SPIN (Sensor Protocol for Information via Negotiation and LEACH (Low Energy Adaptive Clustering Hierarchy protocols with respect to the support for WSN with heavy network traffic conditions. The performance has been evaluated in terms of energy efficiency, data packet transmission, network status, data management, reliability, etc.

A Link Quality and Geographical-aware Routing Protocol for Video Transmission in Mobile IoT

OpenAIRE

Rosário, Denis; Zhao, Zhongliang; Cerqueira, Eduardo; Braun, Torsten; Santos, Aldri

2013-01-01

Wireless mobile sensor networks are enlarging the Internet of Things (IoT) portfolio with a huge number of multimedia services for smart cities. Safety and environmental monitoring multimedia applications will be part of the Smart IoT systems, which aim to reduce emergency response time, while also predicting hazardous events. In these mobile and dynamic (possible disaster) scenarios, opportunistic routing allows routing decisions in a completely distributed manner, by using a hop- by-hop rou...

Simulated Annealing Technique for Routing in a Rectangular Mesh Network

Directory of Open Access Journals (Sweden)

Noraziah Adzhar

2014-01-01

Full Text Available In the process of automatic design for printed circuit boards (PCBs, the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniform Nx×Ny array of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.

Brain connectivity in pathological and pharmacological coma

Directory of Open Access Journals (Sweden)

Quentin Noirhomme

2010-12-01

Full Text Available Recent studies in patients with disorders of consciousness (DOC tend to support the view that awareness is not related to activity in a single brain region but to thalamo-cortical connectivity in the frontoparietal network. Functional neuroimaging studies have shown preserved albeit disconnected low level cortical activation in response to external stimulation in patients in a vegetative state or unresponsive wakefulness syndrome. While activation of these primary sensory cortices does not necessarily reflect conscious awareness, activation in higher order associative cortices in minimally conscious state patients seems to herald some residual perceptual awareness. PET studies have identified a metabolic dysfunction in a widespread fronto-parietal global neuronal workspace in DOC patients including the midline default mode network, ‘intrinsic’ system, and the lateral frontoparietal cortices or ‘extrinsic system’. Recent studies have investigated the relation of awareness to the functional connectivity within intrinsic and extrinsic networks, and with the thalami in both pathological and pharmacological coma. In brain damaged patients, connectivity in all default network areas was found to be non-linearly correlated with the degree of clinical consciousness impairment, ranging from healthy controls and locked-in syndrome to minimally conscious, vegetative, coma and brain dead patients. Anesthesia-induced loss of consciousness was also shown to correlate with a global decrease in cortico-cortical and thalamo-cortical connectivity in both intrinsic and extrinsic networks, but not in auditory or visual networks. In anesthesia, unconsciousness was also associated with a loss of cross-modal interactions between networks. These results suggest that conscious awareness critically depends on the functional integrity of thalamo-cortical and cortico-cortical frontoparietal connectivity within and between intrinsic and extrinsic brain networks.

Constructing Battery-Aware Virtual Backbones in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Chi Ma

2007-05-01

Full Text Available A critical issue in battery-powered sensor networks is to construct energy efficient virtual backbones for network routing. Recent study in battery technology reveals that batteries tend to discharge more power than needed and reimburse the over-discharged power if they are recovered. In this paper we first provide a mathematical battery model suitable for implementation in sensor networks. We then introduce the concept of battery-aware connected dominating set (BACDS and show that in general the minimum BACDS (MBACDS can achieve longer lifetime than the previous backbone structures. Then we show that finding a MBACDS is NP-hard and give a distributed approximation algorithm to construct the BACDS. The resulting BACDS constructed by our algorithm is at most (8+Δopt size, where Δ is the maximum node degree and opt is the size of an optimal BACDS. Simulation results show that the BACDS can save a significant amount of energy and achieve up to 30% longer network lifetime than previous schemes.

A Credit-Based Congestion-Aware Incentive Scheme for DTNs

Directory of Open Access Journals (Sweden)

Qingfeng Jiang

2016-12-01

Full Text Available In Delay-Tolerant Networks (DTNs, nodes may be selfish and reluctant to expend their precious resources on forwarding messages for others. Therefore, an incentive scheme is necessary to motivate selfish nodes to cooperatively forward messages. However, the current incentive schemes mainly focus on encouraging nodes to participate in message forwarding, without considering the node congestion problem. When many messages are forwarded to the nodes with high connection degree, these nodes will become congested and deliberately discard messages, which will seriously degrade the routing performance and reduce the benefits of other nodes. To address this problem, we propose a credit-based congestion-aware incentive scheme (CBCAIS for DTNs. In CBCAIS, a check and punishment mechanism is proposed to prevent forwarding nodes from deliberately discarding message. In addition, a message acceptance selection mechanism is proposed to allow the nodes to decide whether to accept other messages, according to self congestion degree. The experimental results show that CBCAIS can effectively stimulate selfish nodes to cooperatively forward messages, and achieve a higher message delivery ratio with lower overhead ratio, compared with other schemes.

HIV/AIDS: Awareness and Practice Among Traditional Birth ...

African Journals Online (AJOL)

Ebonyi State has an HIV prevalence rate of 11.1%. The state has 2.1 million inhabitants, who are mainly rural dwellers where traditional birth attendants play pivotal role in healthcare delivery. This study assesses the awareness of HIV infection and its route of transmission among the traditional birth attendants in Ebonyi ...

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

Directory of Open Access Journals (Sweden)

Istikmal

2017-01-01

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

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

Science.gov (United States)

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

2017-07-07

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

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

Science.gov (United States)

Dudukovich, Rachel; Raible, Daniel E.

2016-01-01

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

An Enhanced Hybrid Social Based Routing Algorithm for MANET-DTN

Directory of Open Access Journals (Sweden)

Martin Matis

2016-01-01

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

'The Iranian connection': the geo-economics of exporting Central Asian energy via Iran

International Nuclear Information System (INIS)

Stauffer, T.R.

1998-01-01

Of the possible routes to connect Caucasian and Central Asian oil to market, the 'Iranian connection' is the most interesting. The economic attraction of the Iranian route is clear: large transport capacities exist in the various pieces of Iran's existing network, large refining centers are located near the Caspian and there ate unutilized export terminals [it

The Comparative Study Some of Reactive and Proactive Routing Protocols in The Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Anas Ali Hussien

2018-02-01

Full Text Available The wireless sensor network (WSN consists mostly of a large number of nodes in a large area where not all nodes are directly connected. The applications of comprise a wide variety of scenarios.The mobile nodes are free to move because this network has selfــstructured topology. Routing protocols are responsible for detecting and maintaining paths in the network, and it classified into reactive (OnـــDemand, proactive (Table driven, and hybrid. In this paper represents a performance study of some WSN routing protocols: the Dynamic Source Routing (DSR, Ad hoc On-Demand Distance Vector (AODV, and Destination-Sequenced Distance-Vector (DSDV. The comparison made according to important metrics like packet delivery ratio (PDR, total packets dropped, Average end-to-end delay (Avg EED, and normalized routing load under the Transmission Control Protocol (TCP and User Datagram Protocol (UDP traffic connection and with varying number of nodes, pause time; and  varying speed. In this work used (NSــ2.35 that installed on (Ubuntu 14.04 operating system to implementing the scenario. Conclude that the DSR has better performance in TCP connection; while the DSDV has better performance in UDP protocol.

Personalised Diversification Using Intent-Aware Portfolio

OpenAIRE

Wasilewski, Jacek; Hurley, Neil J.

2017-01-01

The intent-aware diversification framework considers a set of aspects associated with items to be recommended. A baseline recommendation is greedily re-ranked using an objective that promotes diversity across the aspects. In this paper the framework is analysed and a new intent-aware objective is derived that considers the minimum variance criterion, connecting the framework directly to portfolio diversification from finance. We derive an aspect model that supports the goal of minimum varianc...

Grounding privacy with awareness : a social approach to describe privacy related issues in awareness systems

NARCIS (Netherlands)

Romero, N.; Markopoulos, P.; Markopoulos, P.; De Ruyter, B.; MacKay, W.

2009-01-01

By their very nature, awareness systems bring about an increase in the level of communication between the individuals they connect. Sharing information regarding people’s whereabouts and activities raises privacy concerns, potentially compromising their ability to control who receives what

Suppressing traffic-driven epidemic spreading by use of the efficient routing protocol

International Nuclear Information System (INIS)

Yang, Han-Xin; Wu, Zhi-Xi

2014-01-01

Despite extensive work on the interplay between traffic dynamics and epidemic spreading, the control of epidemic spreading by routing strategies has not received adequate attention. In this paper, we study the impact of an efficient routing protocol on epidemic spreading. In the case of infinite node-delivery capacity, where the traffic is free of congestion, we find that that there exist optimal values of routing parameter, leading to the maximal epidemic threshold. This means that epidemic spreading can be effectively controlled by fine tuning the routing scheme. Moreover, we find that an increase in the average network connectivity and the emergence of traffic congestion can suppress the epidemic outbreak. (paper)

Connected vehicle applications : safety.

Science.gov (United States)

2016-01-01

Connected vehicle safety applications are designed to increase situational awareness : and reduce or eliminate crashes through vehicle-to-infrastructure, vehicle-to-vehicle, : and vehicle-to-pedestrian data transmissions. Applications support advisor...

A Joint Link and Channel Assignment Routing Scheme for Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

H.S.Zhao

2013-12-01

Full Text Available Cognitive radio (CR is a promising technology that enables opportunistic utilization of the temporarily vacant spectrum to mitigate the spectrum scarcity in wireless communications. Since secondary users (SUs should vacate the channel in use immediately after detecting the reappearances of primary users (PUs in cognitive radio networks (CRNs, the route reliability is a distinctive challenge for routing in CRNs. Furthermore, the throughput requirement of an SU session should be satisfied and it is always preferable to select a route with less negative influence on other current or latish sessions. To account for the route reliability challenge, we study the joint link and channel assignment routing problem for CRNs. It is formulated in a form of integer nonlinear programming (INLP, which is NP-hard, with the objective of minimizing the interference of a new route to other routes while providing route reliability and throughput guarantee. An on-demand route discovery algorithm is proposed to find reliable candidate paths, while a joint link and channel assignment routing algorithm with sequentially-connected-link coordination is proposed to choose the near-optimal route for improving the route reliability and minimizing negative influence. Simulation results demonstrate that the proposed algorithm achieves considerable improvement over existing schemes in both route reliability and throughput.

Importance of human right inferior frontoparietal network connected by inferior branch of superior longitudinal fasciculus tract in corporeal awareness of kinesthetic illusory movement.

Science.gov (United States)

Amemiya, Kaoru; Naito, Eiichi

2016-05-01

It is generally believed that the human right cerebral hemisphere plays a dominant role in corporeal awareness, which is highly associated with conscious experience of the physical self. Prompted by our previous findings, we examined whether the right frontoparietal activations often observed when people experience kinesthetic illusory limb movement are supported by a large-scale brain network connected by a specific branch of the superior longitudinal fasciculus fiber tracts (SLF I, II, and III). We scanned brain activity with functional magnetic resonance imaging (MRI) while nineteen blindfolded healthy volunteers experienced illusory movement of the right stationary hand elicited by tendon vibration, which was replicated after the scanning. We also scanned brain activity when they executed and imagined right hand movement, and identified the active brain regions during illusion, execution, and imagery in relation to the SLF fiber tracts. We found that illusion predominantly activated the right inferior frontoparietal regions connected by SLF III, which were not substantially recruited during execution and imagery. Among these regions, activities in the right inferior parietal cortices and inferior frontal cortices showed right-side dominance and correlated well with the amount of illusion (kinesthetic illusory awareness) experienced by the participants. The results illustrated the predominant involvement of the right inferior frontoparietal network connected by SLF III when people recognize postural changes of their limb. We assume that the network bears a series of functions, specifically, monitoring the current status of the musculoskeletal system, and building-up and updating our postural model (body schema), which could be a basis for the conscious experience of the physical self. Copyright © 2016 The Authors. Published by Elsevier Ltd.. All rights reserved.

Evaluation of connected vehicle impact on mobility and mode choice

Directory of Open Access Journals (Sweden)

Simon Minelli

2015-10-01

Full Text Available Connected vehicle is emerging as a solution to exacerbating congestion problems in urban areas. It is important to understand the impacts of connected vehicle on network and travel behavior of road users. The main objective of this paper is to evaluate the impact of connected vehicle on the mode choice and mobility of transportation networks. An iterative methodology was used in this paper where demands for various modes were modified based on the changes in travel time between each origin-destination (OD pair caused by introduction of connected vehicle. Then a traffic assignment was performed in a micro-simulation model, which was able to accurately simulate vehicle-to-vehicle communication. It is assumed that vehicles are equipped with a dynamic route guidance technology to choose their own route using real-time traffic information obtained through communication. The travel times obtained from the micro-simulation model were compared with a base scenario with no connected vehicle. The methodology was tested for a portion of Downtown Toronto, Ontario, Canada. In order to quantify changes in mode share with changes in travel time associated with each OD pair, mode choice models were developed for auto, transit, cycling and pedestrians using data mainly from the Transportation Tomorrow Survey. The impact of connected vehicle on mode choice was evaluated for different market penetrations of connected vehicle. The results of this study show that average travel times for the whole auto mode will generally increase, with the largest increase from connected vehicles. This causes an overall move away from the auto mode for high market penetrations if a dynamic route guidance algorithm is implemented.

Low-stress bicycling and network connectivity.

Science.gov (United States)

2012-05-01

For a bicycling network to attract the widest possible segment of the population, its most fundamental attribute should be low-stress connectivity, that is, providing routes between peoples origins and destinations that do not require cyclists to ...

Evaluation of Topology-Aware Broadcast Algorithms for Dragonfly Networks

Energy Technology Data Exchange (ETDEWEB)

Dorier, Matthieu; Mubarak, Misbah; Ross, Rob; Li, Jianping Kelvin; Carothers, Christopher D.; Ma, Kwan-Liu

2016-09-12

Two-tiered direct network topologies such as Dragonflies have been proposed for future post-petascale and exascale machines, since they provide a high-radix, low-diameter, fast interconnection network. Such topologies call for redesigning MPI collective communication algorithms in order to attain the best performance. Yet as increasingly more applications share a machine, it is not clear how these topology-aware algorithms will react to interference with concurrent jobs accessing the same network. In this paper, we study three topology-aware broadcast algorithms, including one designed by ourselves. We evaluate their performance through event-driven simulation for small- and large-sized broadcasts (in terms of both data size and number of processes). We study the effect of different routing mechanisms on the topology-aware collective algorithms, as well as their sensitivity to network contention with other jobs. Our results show that while topology-aware algorithms dramatically reduce link utilization, their advantage in terms of latency is more limited.

Planning Routes Across Economic Terrains: Maximizing Utility, Following Heuristics

Science.gov (United States)

Zhang, Hang; Maddula, Soumya V.; Maloney, Laurence T.

2010-01-01

We designed an economic task to investigate human planning of routes in landscapes where travel in different kinds of terrain incurs different costs. Participants moved their finger across a touch screen from a starting point to a destination. The screen was divided into distinct kinds of terrain and travel within each kind of terrain imposed a cost proportional to distance traveled. We varied costs and spatial configurations of terrains and participants received fixed bonuses minus the total cost of the routes they chose. We first compared performance to a model maximizing gain. All but one of 12 participants failed to adopt least-cost routes and their failure to do so reduced their winnings by about 30% (median value). We tested in detail whether participants’ choices of routes satisfied three necessary conditions (heuristics) for a route to maximize gain. We report failures of one heuristic for 7 out of 12 participants. Last of all, we modeled human performance with the assumption that participants assign subjective utilities to costs and maximize utility. For 7 out 12 participants, the fitted utility function was an accelerating power function of actual cost and for the remaining 5, a decelerating power function. We discuss connections between utility aggregation in route planning and decision under risk. Our task could be adapted to investigate human strategy and optimality of route planning in full-scale landscapes. PMID:21833269

PLANNING ROUTES ACROSS ECONOMIC TERRAINS: MAXIMIZING UTILITY, FOLLOWING HEURISTICS

Directory of Open Access Journals (Sweden)

Hang eZhang

2010-12-01

Full Text Available We designed an economic task to investigate human planning of routes in landscapes where travel in different kinds of terrain incurs different costs. Participants moved their finger across a touch screen from a starting point to a destination. The screen was divided into distinct kinds of terrain and travel within each kind of terrain imposed a cost proportional to distance traveled. We varied costs and spatial configurations of terrains and participants received fixed bonuses minus the total cost of the routes they chose. We first compared performance to a model maximizing gain. All but one of 12 participants failed to adopt least-cost routes and their failure to do so reduced their winnings by about 30% (median value. We tested in detail whether participants’ choices of routes satisfied three necessary conditions (heuristics for a route to maximize gain. We report failures of one heuristic for 7 out of 12 participants. Last of all, we modeled human performance with the assumption that participants assign subjective utilities to costs and maximize utility. For 7 out 12 participants, the fitted utility function was an accelerating power function of actual cost and for the remaining 5, a decelerating power function. We discuss connections between utility aggregation in route planning and decision under risk. Our task could be adapted to investigate human strategy and optimality of route planning in full-scale landscapes.

QoS Routing in Ad-Hoc Networks Using GA and Multi-Objective Optimization

Directory of Open Access Journals (Sweden)

Admir Barolli

2011-01-01

Full Text Available Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing.

Connected vehicle application : safety.

Science.gov (United States)

2015-01-01

Connected vehicle safety applications are designed to increase situational awareness : and reduce or eliminate crashes through vehicle-to-infrastructure (V2I), vehicle-to-vehicle (V2V), and vehicle-to-pedestrian (V2P) data transmissions. Applications...

Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation

Science.gov (United States)

Liu, Qiang; Wang, Chengen

2012-08-01

Computer-aided design of pipe routing is of fundamental importance for complex equipments' developments. In this article, non-rectilinear branch pipe routing with multiple terminals that can be formulated as a Euclidean Steiner Minimal Tree with Obstacles (ESMTO) problem is studied in the context of an aeroengine-integrated design engineering. Unlike the traditional methods that connect pipe terminals sequentially, this article presents a new branch pipe routing algorithm based on the Steiner tree theory. The article begins with a new algorithm for solving the ESMTO problem by using particle swarm optimisation (PSO), and then extends the method to the surface cases by using geodesics to meet the requirements of routing non-rectilinear pipes on the surfaces of aeroengines. Subsequently, the adaptive region strategy and the basic visibility graph method are adopted to increase the computation efficiency. Numeral computations show that the proposed routing algorithm can find satisfactory routing layouts while running in polynomial time.

`The Iranian connection`: the geo-economics of exporting Central Asian energy via Iran; La geoeconomia delle esportazioni asiatiche: `l`iranian connection`

Energy Technology Data Exchange (ETDEWEB)

Stauffer, T.R.

1998-03-01

Of the possible routes to connect Caucasian and Central Asian oil to market, the `Iranian connection` is the most interesting. The economic attraction of the Iranian route is clear: large transport capacities exist in the various pieces of Iran`s existing network, large refining centers are located near the Caspian and there ate unutilized export terminals. [Italiano] Tra le vie possibili per assicurare uno sbocco ai mercati al petrolio caucasico e dell`Asia centrale, la `via iraniana` e` la piu` interessante. L`attrazione economica di questa via e` chiara: nel sistema di oleodotti dell`Iran sussistono ampie capacita` di trasporto, grandi centri de raffinazione sono localizzati vicino al Caspio e ci sono terminali di esportazione non utilizzati.

A review of variables of urban street connectivity for spatial connection

International Nuclear Information System (INIS)

Mohamad, W S N W; Said, I

2014-01-01

Several studies on street connectivity in cities and towns have been modeled on topology, morphology, technology and psychology of people living in the urban environment. Street connectivity means the connection of streets that offers people alternative routes. However, there emerge difficulties to determine the suitable variables and analysis to be chosen in defining the accurate result for studies street connectivity. The aim of this paper is to identify variables of street connectivity by applying GIS and Space Syntax. This paper reviews the variables of street connectivity from 15 past articles done in 1990s to early 2000s from journals of nine disciplines on Environment and Behavior, Planning and Design, Computers, Environment and Urban Systems, Applied Earth Observation and Geo-information, Environment and Planning, Physica A: Statistical Mechanics and its Applications, Environmental Psychology, Social Science and Medicine and Building and Environment. From the review, there are four variables found for street connectivity: link (streets-streets, street-nodes or node-streets, nodes-nodes), accessibility, least-angle, and centrality. Space syntax and GIS are suitable tools to analyze the four variables relating to systematic street systems for pedestrians. This review implies that planners of the street systems, in the aspect of street connectivity in cities and towns, should consider these four variables

A review of variables of urban street connectivity for spatial connection

Science.gov (United States)

Mohamad, W. S. N. W.; Said, I.

2014-02-01

Several studies on street connectivity in cities and towns have been modeled on topology, morphology, technology and psychology of people living in the urban environment. Street connectivity means the connection of streets that offers people alternative routes. However, there emerge difficulties to determine the suitable variables and analysis to be chosen in defining the accurate result for studies street connectivity. The aim of this paper is to identify variables of street connectivity by applying GIS and Space Syntax. This paper reviews the variables of street connectivity from 15 past articles done in 1990s to early 2000s from journals of nine disciplines on Environment and Behavior, Planning and Design, Computers, Environment and Urban Systems, Applied Earth Observation and Geo-information, Environment and Planning, Physica A: Statistical Mechanics and its Applications, Environmental Psychology, Social Science and Medicine and Building and Environment. From the review, there are four variables found for street connectivity: link (streets-streets, street-nodes or node-streets, nodes-nodes), accessibility, least-angle, and centrality. Space syntax and GIS are suitable tools to analyze the four variables relating to systematic street systems for pedestrians. This review implies that planners of the street systems, in the aspect of street connectivity in cities and towns, should consider these four variables.

Investigating the impact of static roadside advertising on drivers' situation awareness.

Science.gov (United States)

Young, Kristie L; Stephens, Amanda N; Logan, David B; Lenné, Michael G

2017-04-01

Roadside advertising has the potential to create a crash risk for drivers as it may distract attention from driving at critical times. In an on-road instrumented vehicle study, we examined if and how static advertising billboards affect drivers' situation awareness across different driving environments. Nineteen fully licensed drivers drove an instrumented vehicle around a 38 km urban test route comprising freeway, busy urban retail and arterial road sections. The route contained a number of static billboards. Drivers provided continuous verbal protocols throughout the drive. Results indicated that the structure and content of drivers' situation awareness was not appreciably affected by the billboards in any of the road environments examined. Drivers focused their attention on the billboards when driving demand was low, such as when driving on the freeway with light to moderate traffic, in lower speed zones, or when stationary. However, when drivers were required to perform a manoeuvre or driving demands increased, drivers directed less attention to the billboards and focussed their awareness on the immediate driving task. This suggests that drivers can, at least under some conditions, effectively self-regulate their attention to billboards when required to focus on the immediate traffic or driving situation. Copyright © 2016 Elsevier Ltd. All rights reserved.

A Comparative Study of Novel Opportunistic Routing Protocols in Mobile Ad Hoc Networks

OpenAIRE

R. Poonkuzhali; M. Y. Sanavullah; M. R. Gurupriya

2014-01-01

Opportunistic routing is used, where the network has the features like dynamic topology changes and intermittent network connectivity. In Delay tolerant network or Disruption tolerant network opportunistic forwarding technique is widely used. The key idea of opportunistic routing is selecting forwarding nodes to forward data packets and coordination among these nodes to avoid duplicate transmissions. This paper gives the analysis of pros and cons of various opportunistic ...

Cortical networks involved in visual awareness independent of visual attention.

Science.gov (United States)

Webb, Taylor W; Igelström, Kajsa M; Schurger, Aaron; Graziano, Michael S A

2016-11-29

It is now well established that visual attention, as measured with standard spatial attention tasks, and visual awareness, as measured by report, can be dissociated. It is possible to attend to a stimulus with no reported awareness of the stimulus. We used a behavioral paradigm in which people were aware of a stimulus in one condition and unaware of it in another condition, but the stimulus drew a similar amount of spatial attention in both conditions. The paradigm allowed us to test for brain regions active in association with awareness independent of level of attention. Participants performed the task in an MRI scanner. We looked for brain regions that were more active in the aware than the unaware trials. The largest cluster of activity was obtained in the temporoparietal junction (TPJ) bilaterally. Local independent component analysis (ICA) revealed that this activity contained three distinct, but overlapping, components: a bilateral, anterior component; a left dorsal component; and a right dorsal component. These components had brain-wide functional connectivity that partially overlapped the ventral attention network and the frontoparietal control network. In contrast, no significant activity in association with awareness was found in the banks of the intraparietal sulcus, a region connected to the dorsal attention network and traditionally associated with attention control. These results show the importance of separating awareness and attention when testing for cortical substrates. They are also consistent with a recent proposal that awareness is associated with ventral attention areas, especially in the TPJ.

Identifying and prioritizing ungulate migration routes for landscape-level conservation

Science.gov (United States)

Sawyer, Hall; Kauffman, Matthew J.; Nielson, Ryan M.; Horne, Jon S.

2009-01-01

As habitat loss and fragmentation increase across ungulate ranges, identifying and prioritizing migration routes for conservation has taken on new urgency. Here we present a general framework using the Brownian bridge movement model (BBMM) that: (1) provides a probabilistic estimate of the migration routes of a sampled population, (2) distinguishes between route segments that function as stopover sites vs. those used primarily as movement corridors, and (3) prioritizes routes for conservation based upon the proportion of the sampled population that uses them. We applied this approach to a migratory mule deer (Odocoileus hemionus) population in a pristine area of southwest Wyoming, USA, where 2000 gas wells and 1609 km of pipelines and roads have been proposed for development. Our analysis clearly delineated where migration routes occurred relative to proposed development and provided guidance for on-the-ground conservation efforts. Mule deer migration routes were characterized by a series of stopover sites where deer spent most of their time, connected by movement corridors through which deer moved quickly. Our findings suggest management strategies that differentiate between stopover sites and movement corridors may be warranted. Because some migration routes were used by more mule deer than others, proportional level of use may provide a reasonable metric by which routes can be prioritized for conservation. The methods we outline should be applicable to a wide range of species that inhabit regions where migration routes are threatened or poorly understood.

Mathematical Modeling and Analysis Methodology for Opportunistic Routing in Wireless Multihop Networks

Directory of Open Access Journals (Sweden)

Wang Dongyang

2015-01-01

Full Text Available Modeling the forwarding feature and analyzing the performance theoretically for opportunistic routing in wireless multihop network are of great challenge. To address this issue, a generalized geometric distribution (GGD is firstly proposed. Based on the GGD, the forwarding probability between any two forwarding candidates could be calculated and it can be proved that the successful delivery rate after several transmissions of forwarding candidates is irrelevant to the priority rule. Then, a discrete-time queuing model is proposed to analyze mean end-to-end delay (MED of a regular opportunistic routing with the knowledge of the forwarding probability. By deriving the steady-state joint generating function of the queue length distribution, MED for directly connected networks and some special cases of nondirectly connected networks could be ultimately determined. Besides, an approximation approach is proposed to assess MED for the general cases in the nondirectly connected networks. By comparing with a large number of simulation results, the rationality of the analysis is validated. Both the analysis and simulation results show that MED varies with the number of forwarding candidates, especially when it comes to connected networks; MED increases more rapidly than that in nondirectly connected networks with the increase of the number of forwarding candidates.

Emergent situation awareness of drivable routes for autonomous robots using temporal probalistic reasoning

CSIR Research Space (South Africa)

Osunmakinde, IO

2009-11-01

Full Text Available of hidden paths embedded in the complex environments. Experimental evaluations of the ESA on real life and publicly available road frames outperform the classical statistical baseline methods in handling uncertainties over time. Our awareness results reveal...

75 FR 33164 - Modification of Jet Routes J-32, J-38, and J-538; Minnesota

Science.gov (United States)

2010-06-11

..., and J-538 between the Duluth, MN, VORTAC and the United States (U.S.)/Canadian border (74 FR 65040... between the Duluth, MN, VORTAC and the U.S./Canadian border that do not meet or connect to any... regulation is within the scope of that authority as it modifies the route structure of Jet Routes as required...

Robots with Internal Models: A Route to Self-Aware and Hence Safer Robots

Science.gov (United States)

Winfield, Alan F. T.

The following sections are included: * Introduction * Internal Models and Self-Awareness * Internal Model-Based Architecture for Robot Safety * The Internal Model * The Consequence Evaluator * The Object Tracker-Localizer * Towards an Ethical Robot * Challenges and Open Questions * Discussion: The Way Forward * Summary and Conclusions

A security analysis of the 802.11s wireless mesh network routing protocol and its secure routing protocols.

Science.gov (United States)

Tan, Whye Kit; Lee, Sang-Gon; Lam, Jun Huy; Yoo, Seong-Moo

2013-09-02

Wireless mesh networks (WMNs) can act as a scalable backbone by connecting separate sensor networks and even by connecting WMNs to a wired network. The Hybrid Wireless Mesh Protocol (HWMP) is the default routing protocol for the 802.11s WMN. The routing protocol is one of the most important parts of the network, and it requires protection, especially in the wireless environment. The existing security protocols, such as the Broadcast Integrity Protocol (BIP), Counter with cipher block chaining message authentication code protocol (CCMP), Secure Hybrid Wireless Mesh Protocol (SHWMP), Identity Based Cryptography HWMP (IBC-HWMP), Elliptic Curve Digital Signature Algorithm HWMP (ECDSA-HWMP), and Watchdog-HWMP aim to protect the HWMP frames. In this paper, we have analyzed the vulnerabilities of the HWMP and developed security requirements to protect these identified vulnerabilities. We applied the security requirements to analyze the existing secure schemes for HWMP. The results of our analysis indicate that none of these protocols is able to satisfy all of the security requirements. We also present a quantitative complexity comparison among the protocols and an example of a security scheme for HWMP to demonstrate how the result of our research can be utilized. Our research results thus provide a tool for designing secure schemes for the HWMP.

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

Directory of Open Access Journals (Sweden)

Halikul Lenando

2018-01-01

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

Congestion control for vehicular delay tolerant network routing protocols

OpenAIRE

Oham, Chuka Finbars

2014-01-01

The Vehicular Delay Tolerant Network (VDTN) is a special and challenging type of the Delay Tolerant Network because of its high mobility, frequent disconnections and nodal congestion features. These challenging features make it prone to congestion which leads to a considerable amount of message drops in the network. To minimize the impact of congestion in the network, we designed and implemented the Congestion Aware Spray and Wait (CASaW) routing protocol. We varied the buffer sizes of the no...

Branch-pipe-routing approach for ships using improved genetic algorithm

Science.gov (United States)

Sui, Haiteng; Niu, Wentie

2016-09-01

Branch-pipe routing plays fundamental and critical roles in ship-pipe design. The branch-pipe-routing problem is a complex combinatorial optimization problem and is thus difficult to solve when depending only on human experts. A modified genetic-algorithm-based approach is proposed in this paper to solve this problem. The simplified layout space is first divided into threedimensional (3D) grids to build its mathematical model. Branch pipes in layout space are regarded as a combination of several two-point pipes, and the pipe route between two connection points is generated using an improved maze algorithm. The coding of branch pipes is then defined, and the genetic operators are devised, especially the complete crossover strategy that greatly accelerates the convergence speed. Finally, simulation tests demonstrate the performance of proposed method.

Indoor 3D Route Modeling Based On Estate Spatial Data

Science.gov (United States)

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

2014-04-01

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

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

Science.gov (United States)

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

2003-08-01

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

Real World Awareness in Distributed Organizations: A View on Informal Processes

Directory of Open Access Journals (Sweden)

Eldar Sultanow

2011-06-01

Full Text Available Geographically distributed development has consistently had to deal with the challenge of intense awareness extensively more than locally concentrated development. Awareness marks the state of being informed incorporated with an understanding of project-related activities, states or relationships of each individual employee within a given group as a whole. In multifarious offices, where social interaction is necessary in order to distribute and locate information together with experts, awareness becomes a concurrent process which amplifies the exigency of easy routes for staff to be able to access this information, deferred or decentralized, in a formalized and problem-oriented way. Although the subject of Awareness has immensely increased in importance, there is extensive disagreement about how this transparency can be conceptually and technically implemented [1]. This paper introduces a model in order to visualize and navigate this information in three tiers using semantic networks, GIS and Web3D.

A Dynamic Travel Time Estimation Model Based on Connected Vehicles

Directory of Open Access Journals (Sweden)

Daxin Tian

2015-01-01

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

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

Directory of Open Access Journals (Sweden)

Arafatur RAHMAN

2009-01-01

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

A Cross-Layer Routing Design for Multi-Interface Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Tzu-Chieh Tsai

2009-01-01

Full Text Available In recent years, Wireless Mesh Networks (WMNs technologies have received significant attentions. WMNs not only accede to the advantages of ad hoc networks but also provide hierarchical multi-interface architecture. Transmission power control and routing path selections are critical issues in the past researches of multihop networks. Variable transmission power levels lead to different network connectivity and interference. Further, routing path selections among different radio interfaces will also produce different intra-/interflow interference. These features tightly affect the network performance. Most of the related works on the routing protocol design do not consider transmission power control and multi-interface environment simultaneously. In this paper, we proposed a cross-layer routing protocol called M2iRi2 which coordinates transmission power control and intra-/interflow interference considerations as routing metrics. Each radio interface calculates the potential tolerable-added transmission interference in the physical layer. When the route discovery starts, the M2iRi2 will adopt the appropriate power level to evaluate each interface quality along paths. The simulation results demonstrate that our design can enhance both network throughput and end-to-end delay.

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

Science.gov (United States)

Wang, Changji; Shi, Dongyuan; Xu, Xilei

2015-01-01

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

Analysis of Greedy Decision Making for Geographic Routing for Networks of Randomly Moving Objects

Directory of Open Access Journals (Sweden)

Amber Israr

2016-04-01

Full Text Available Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network

Physical impairment aware transparent optical networks

Science.gov (United States)

Antona, Jean-Christophe; Morea, Annalisa; Zami, Thierry; Leplingard, Florence

2009-11-01

As illustrated by optical fiber and optical amplification, optical telecommunications have appeared for the last ten years as one of the most promising candidates to increase the transmission capacities. More recently, the concept of optical transparency has been investigated and introduced: it consists of the optical routing of Wavelength Division Multiplexed (WDM) channels without systematic optoelectronic processing at nodes, as long as propagation impairments remain acceptable [1]. This allows achieving less power-consuming, more scalable and flexible networks, and today partial optical transparency has become a reality in deployed systems. However, because of the evolution of traffic features, optical networks are facing new challenges such as demand for higher transmitted capacity, further upgradeability, and more automation. Making all these evolutions compliant on the same current network infrastructure with a minimum of upgrades is one of the main issues for equipment vendors and operators. Hence, an automatic and efficient management of the network needs a control plan aware of the expected Quality of Transmission (QoT) of the connections to set-up with respect to numerous parameters such as: the services demanded by the customers in terms of protection/restoration; the modulation rate and format of the connection under test and also of its adjacent WDM channels; the engineering rules of the network elements traversed with an accurate knowledge of the associated physical impairments. Whatever the method and/or the technology used to collect this information, the issue about its accuracy is one of the main concerns of the network system vendors, because an inaccurate knowledge could yield a sub-optimal dimensioning and so additional costs when installing the network in the field. Previous studies [1], [2] illustrated the impact of this knowledge accuracy on the ability to predict the connection feasibility. After describing usual methods to build

Simulation of Routing Protocol with CoS/QoS Enhancements in Heterogeneous Communication Network

National Research Council Canada - National Science Library

Kubera, Emil; Sliwa, Joanna; Zubel, Krzysztof; Mroczko, Adrian

2006-01-01

The article describes the subject of QoS routing mechanism in tactical heterogeneous communication network consisting of network elements built in different technologies and connected following rules...

AutoRoute Rapid Flood Inundation Model

Science.gov (United States)

2013-03-01

cross-section data does not exist. As such, the AutoRoute model is not meant to be as accurate as models such as HEC - RAS (U.S. Army Engineer...such as HEC - RAS assume that the defined low point of cross sections must be connected. However, in this approach the channel is assumed to be defined...Res. 33(2): 309-319. U.S. Army Engineer Hydrologic Engineering Center. 2010. “ HEC - RAS : River Analysis System, User’s Manual, Version 4.1.” Davis

Context-Aware Writing Support for SNS: Connecting Formal and Informal Learning

Science.gov (United States)

Waragai, Ikumi; Kurabayashi, Shuichi; Ohta, Tatsuya; Raindl, Marco; Kiyoki, Yasushi; Tokuda, Hideyuki

2014-01-01

This paper presents another stage in a series of research efforts by the authors to develop an experience-connected mobile language learning environment, bridging formal and informal learning. Building on a study in which the authors tried to connect classroom learning (of German in Japan) with learners' real life experiences abroad by having…

Altered functional connectivity of interoception in illness anxiety disorder.

Science.gov (United States)

Grossi, Dario; Longarzo, Mariachiara; Quarantelli, Mario; Salvatore, Elena; Cavaliere, Carlo; De Luca, Paolofabrizio; Trojano, Luigi; Aiello, Marco

2017-01-01

Interoception collects all information coming from the body and is sustained by several brain areas such as insula and cingulate cortex. Here, we used resting-state functional magnetic resonance imaging to investigate functional connectivity (FC) of networks implied in interoception in patients with Illness anxiety disorders (IADs). We observed significantly reduced FC between the left extrastriate body area (EBA) and the paracentral lobule compared to healthy controls. Moreover, the correlation analysis between behavioural questionnaires and ROI to ROI FC showed that higher levels of illness anxiety were related to hyper-connectivity between EBA and amygdala and hippocampus. Scores on a questionnaire for interoceptive awareness were significantly correlated with higher FC between right hippocampus and nucleus accumbens bilaterally, and with higher connectivity between left anterior cingulate cortex (ACC) and left orbitofrontal cortex (OFC). Last, patients showed increased interoceptive awareness, measured by Self-Awareness Questionnaire (SAQ), and reduced capability in recognizing emotions, indicating inverse correlation between interoception and emotional awareness. Taken together our results suggested that, in absence of structural and micro-structural changes, patients with IADs show functional alteration in the neural network involved in the self-body representation; such functional alteration might be the target of possible treatments. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

Directory of Open Access Journals (Sweden)

PAPAJ Ján

2013-05-01

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

Writ in water, lines in sand: Ancient trade routes, models and comparative evidence

Directory of Open Access Journals (Sweden)

Eivind Heldaas Seland

2015-12-01

Full Text Available Historians and archaeologists often take connectivity for granted, and fail to address the problems of documenting patterns of movement. This article highlights the methodological challenges of reconstructing trade routes in prehistory and early history. The argument is made that these challenges are best met through the application of modern models of connectivity, in combination with the conscious use of comparative approaches.

Stitching-aware in-design DPT auto fixing for sub-20nm logic devices

Science.gov (United States)

Choi, Soo-Han; Sai Krishna, K. V. V. S.; Pemberton-Smith, David

2017-03-01

As the technology continues to shrink below 20nm, Double Patterning Technology (DPT) becomes one of the mandatory solutions for routing metal layers. From the view point of Place and Route (P&R), the major concerns are how to prevent DPT odd-cycles automatically without sacrificing chip area. Even though the leading-edge P&R tools have advanced algorithms to prevent DPT odd-cycles, it is very hard to prevent the localized DPT odd-cycles, especially in Engineering Change Order (ECO) routing. In the last several years, we developed In-design DPT Auto Fixing method in order to reduce localized DPT odd-cycles significantly during ECO and could achieve remarkable design Turn-Around Times (TATs). But subsequently, as the design complexity continued increasing and chip size continued decreasing, we needed a new In-design DPT Auto Fixing approach to improve the auto. fixing rate. In this paper, we present the Stitching-Aware In-design DPT Auto Fixing method for better fixing rates and smaller chip design. The previous In-design DPT Auto Fixing method detected all DPT odd-cycles and tried to remove oddcycles by increasing the adjacent space. As the metal congestions increase in the newer technology nodes, the older Auto Fixing method has limitations to increase the adjacent space between routing metals. Consequently, the auto fixing rate of older method gets worse with the introduction of the smaller design rules. With DPT stitching enablement at In-design DRC checking procedure, the new Stitching-Aware DPT Auto Fixing method detects the most critical odd-cycles and revolve the odd-cycles automatically. The accuracy of new flow ensures better usage of space in the congested areas, and helps design more smaller chips. By applying the Stitching-Aware DPT Auto Fixing method to sub-20nm logic devices, we can confirm that the auto fixing rate is improved by 2X compared with auto fixing without stitching. Additionally, by developing the better heuristic algorithm and flow for DPT

Context Aware Systems, Methods and Trends in Smart Home Technology

Science.gov (United States)

Robles, Rosslin John; Kim, Tai-Hoon

Context aware applications respond and adapt to changes in the computing environment. It is the concept of leveraging information about the end user to improve the quality of the interaction. New technologies in context-enriched services will use location, presence, social attributes, and other environmental information to anticipate an end user's immediate needs, offering more-sophisticated, situation-aware and usable functions. Smart homes connect all the devices and appliances in your home so they can communicate with each other and with you. Context-awareness can be applied to Smart Home technology. In this paper, we discuss the context-aware tools for development of Smart Home Systems.

An Efficient Addressing Scheme and Its Routing Algorithm for a Large-Scale Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Choi Jeonghee

2008-01-01

Full Text Available Abstract So far, various addressing and routing algorithms have been extensively studied for wireless sensor networks (WSNs, but many of them were limited to cover less than hundreds of sensor nodes. It is largely due to stringent requirements for fully distributed coordination among sensor nodes, leading to the wasteful use of available address space. As there is a growing need for a large-scale WSN, it will be extremely challenging to support more than thousands of nodes, using existing standard bodies. Moreover, it is highly unlikely to change the existing standards, primarily due to backward compatibility issue. In response, we propose an elegant addressing scheme and its routing algorithm. While maintaining the existing address scheme, it tackles the wastage problem and achieves no additional memory storage during a routing. We also present an adaptive routing algorithm for location-aware applications, using our addressing scheme. Through a series of simulations, we prove that our approach can achieve two times lesser routing time than the existing standard in a ZigBee network.

An Efficient Addressing Scheme and Its Routing Algorithm for a Large-Scale Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Yongwan Park

2008-12-01

Full Text Available So far, various addressing and routing algorithms have been extensively studied for wireless sensor networks (WSNs, but many of them were limited to cover less than hundreds of sensor nodes. It is largely due to stringent requirements for fully distributed coordination among sensor nodes, leading to the wasteful use of available address space. As there is a growing need for a large-scale WSN, it will be extremely challenging to support more than thousands of nodes, using existing standard bodies. Moreover, it is highly unlikely to change the existing standards, primarily due to backward compatibility issue. In response, we propose an elegant addressing scheme and its routing algorithm. While maintaining the existing address scheme, it tackles the wastage problem and achieves no additional memory storage during a routing. We also present an adaptive routing algorithm for location-aware applications, using our addressing scheme. Through a series of simulations, we prove that our approach can achieve two times lesser routing time than the existing standard in a ZigBee network.

A Smart Collaborative Routing Protocol for Reliable Data Diffusion in IoT Scenarios.

Science.gov (United States)

Ai, Zheng-Yang; Zhou, Yu-Tong; Song, Fei

2018-06-13

It is knotty for current routing protocols to meet the needs of reliable data diffusion during the Internet of Things (IoT) deployments. Due to the random placement, limited resources and unattended features of existing sensor nodes, the wireless transmissions are easily exposed to unauthorized users, which becomes a vulnerable area for various malicious attacks, such as wormhole and Sybil attacks. However, the scheme based on geographic location is a suitable candidate to defend against them. This paper is inspired to propose a smart collaborative routing protocol, Geographic energy aware routing and Inspecting Node (GIN), for guaranteeing the reliability of data exchanging. The proposed protocol integrates the directed diffusion routing, Greedy Perimeter Stateless Routing (GPSR), and the inspecting node mechanism. We first discuss current wireless routing protocols from three diverse perspectives (improving transmission rate, shortening transmission range and reducing transmission consumption). Then, the details of GIN, including the model establishment and implementation processes, are presented by means of the theoretical analysis. Through leveraging the game theory, the inspecting node is elected to monitor the network behaviors. Thirdly, we evaluate the network performances, in terms of transmission delay, packet loss ratio, and throughput, between GIN and three traditional schemes (i.e., Flooding, GPSR, and GEAR). The simulation results illustrate that the proposed protocol is able to outperform the others.

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

Directory of Open Access Journals (Sweden)

Jongbin Ko

2014-01-01

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

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

Science.gov (United States)

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

2014-01-01

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

A method for joint routing, wavelength dimensioning and fault tolerance for any set of simultaneous failures on dynamic WDM optical networks

Science.gov (United States)

Jara, Nicolás; Vallejos, Reinaldo; Rubino, Gerardo

2017-11-01

The design of optical networks decomposes into different tasks, where the engineers must basically organize the way the main system's resources are used, minimizing the design and operation costs and respecting critical performance constraints. More specifically, network operators face the challenge of solving routing and wavelength dimensioning problems while aiming to simultaneously minimize the network cost and to ensure that the network performance meets the level established in the Service Level Agreement (SLA). We call this the Routing and Wavelength Dimensioning (R&WD) problem. Another important problem to be solved is how to deal with failures of links when the network is operating. When at least one link fails, a high rate of data loss may occur. To avoid it, the network must be designed in such a manner that upon one or multiple failures, the affected connections can still communicate using alternative routes, a mechanism known as Fault Tolerance (FT). When the mechanism allows to deal with an arbitrary number of faults, we speak about Multiple Fault Tolerance (MFT). The different tasks before mentioned are usually solved separately, or in some cases by pairs, leading to solutions that are not necessarily close to optimal ones. This paper proposes a novel method to simultaneously solve all of them, that is, the Routing, the Wavelength Dimensioning, and the Multiple Fault Tolerance problems. The method allows to obtain: a) all the primary routes by which each connection normally transmits its information, b) the additional routes, called secondary routes, used to keep each user connected in cases where one or more simultaneous failures occur, and c) the number of wavelengths available at each link of the network, calculated such that the blocking probability of each connection is lower than a pre-determined threshold (which is a network design parameter), despite the occurrence of simultaneous link failures. The solution obtained by the new algorithm is

Green Routing Fuel Saving Opportunity Assessment: A Case Study on California Large-Scale Real-World Travel Data

Energy Technology Data Exchange (ETDEWEB)

Zhu, Lei [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Holden, Jacob [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Gonder, Jeffrey D [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Wood, Eric W [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2017-07-31

New technologies, such as connected and automated vehicles, have attracted more and more researchers for improving the energy efficiency and environmental impact of current transportation systems. The green routing strategy instructs a vehicle to select the most fuel-efficient route before the vehicle departs. It benefits the current transportation system with fuel saving opportunity through identifying the greenest route. This paper introduces an evaluation framework for estimating benefits of green routing based on large-scale, real-world travel data. The framework has the capability to quantify fuel savings by estimating the fuel consumption of actual routes and comparing to routes procured by navigation systems. A route-based fuel consumption estimation model, considering road traffic conditions, functional class, and road grade is proposed and used in the framework. An experiment using a large-scale data set from the California Household Travel Survey global positioning system trajectory data base indicates that 31% of actual routes have fuel savings potential with a cumulative estimated fuel savings of 12%.

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

First demonstration of single-mode MCF transport network with crosstalk-aware in-service optical channel control

DEFF Research Database (Denmark)

Pulverer, K.; Tanaka, T.; Häbel, U.

2017-01-01

We demonstrate the first crosstalk-aware traffic engineering as a use case in a multicore fibre transport network. With the help of a software-defined network controller, modulation format and channel route are adaptively changed using programmable devices with XT monitors....

Lexington and the World: Teaching Connections for International Understanding.

Science.gov (United States)

Daniel, Frankie, Ed.; Drake, Michele, Ed.

Students in the community schools of Lexington, Kentucky must realize the international connections that exist between Lexington and the world, and be aware of the impact of world events on their own community. These international connections can be revealed through learning activities utilizing local history, international restaurants, street…

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

Directory of Open Access Journals (Sweden)

Yan Wang

2005-01-01

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

A Rapid Subcortical Amygdala Route for Faces Irrespective of Spatial Frequency and Emotion.

Science.gov (United States)

McFadyen, Jessica; Mermillod, Martial; Mattingley, Jason B; Halász, Veronika; Garrido, Marta I

2017-04-05

There is significant controversy over the existence and function of a direct subcortical visual pathway to the amygdala. It is thought that this pathway rapidly transmits low spatial frequency information to the amygdala independently of the cortex, and yet the directionality of this function has never been determined. We used magnetoencephalography to measure neural activity while human participants discriminated the gender of neutral and fearful faces filtered for low or high spatial frequencies. We applied dynamic causal modeling to demonstrate that the most likely underlying neural network consisted of a pulvinar-amygdala connection that was uninfluenced by spatial frequency or emotion, and a cortical-amygdala connection that conveyed high spatial frequencies. Crucially, data-driven neural simulations revealed a clear temporal advantage of the subcortical connection over the cortical connection in influencing amygdala activity. Thus, our findings support the existence of a rapid subcortical pathway that is nonselective in terms of the spatial frequency or emotional content of faces. We propose that that the "coarseness" of the subcortical route may be better reframed as "generalized." SIGNIFICANCE STATEMENT The human amygdala coordinates how we respond to biologically relevant stimuli, such as threat or reward. It has been postulated that the amygdala first receives visual input via a rapid subcortical route that conveys "coarse" information, namely, low spatial frequencies. For the first time, the present paper provides direction-specific evidence from computational modeling that the subcortical route plays a generalized role in visual processing by rapidly transmitting raw, unfiltered information directly to the amygdala. This calls into question a widely held assumption across human and animal research that fear responses are produced faster by low spatial frequencies. Our proposed mechanism suggests organisms quickly generate fear responses to a wide range

Routing Service Quality—Local Driver Behavior Versus Routing Services

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

2013-01-01

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

Connectivity and superconductivity

CERN Document Server

Rubinstein, Jacob

2000-01-01

The motto of connectivity and superconductivity is that the solutions of the Ginzburg--Landau equations are qualitatively influenced by the topology of the boundaries, as in multiply-connected samples. Special attention is paid to the "zero set", the set of the positions (also known as "quantum vortices") where the order parameter vanishes. The effects considered here usually become important in the regime where the coherence length is of the order of the dimensions of the sample. It takes the intuition of physicists and the awareness of mathematicians to find these new effects. In connectivity and superconductivity, theoretical and experimental physicists are brought together with pure and applied mathematicians to review these surprising results. This volume is intended to serve as a reference book for graduate students and researchers in physics or mathematics interested in superconductivity, or in the Schrödinger equation as a limiting case of the Ginzburg--Landau equations.

Glaciers along proposed routes extending the Copper River Highway, Alaska

Science.gov (United States)

Glass, R.L.

1996-01-01

Three inland highway routes are being considered by the Alaska Department of Transportation and Public Facilities to connect the community of Cordova in southcentral Alaska to a statewide road system. The routes use part of a Copper River and Northwest Railway alignment along the Copper River through mountainous terrain having numerous glaciers. An advance of any of several glaciers could block and destroy the roadway, whereas retreating glaciers expose large quantities of unconsolidated, unvegetated, and commonly ice-rich sediments. The purpose of this study was to map historical locations of glacier termini near these routes and to describe hazards associated with glaciers and seasonal snow. Historical and recent locations of glacier termini along the proposed Copper River Highway routes were determined by reviewing reports and maps and by interpreting aerial photographs. The termini of Childs, Grinnell, Tasnuna, and Woodworth Glaciers were 1 mile or less from a proposed route in the most recently available aerial photography (1978-91); the termini of Allen, Heney, and Schwan Glaciers were 1.5 miles or less from a proposed route. In general, since 1911, most glaciers have slowly retreated, but many glaciers have had occasional advances. Deserted Glacier and one of its tributary glaciers have surge-type medial moraines, indicating potential rapid advances. The terminus of Deserted Glacier was about 2.1 miles from a proposed route in 1978, but showed no evidence of surging. Snow and rock avalanches and snowdrifts are common along the proposed routes and will periodically obstruct the roadway. Floods from ice-dammed lakes also pose a threat. For example, Van Cleve Lake, adjacent to Miles Glacier, is as large as 4.4 square miles and empties about every 6 years. Floods from drainages of Van Cleve Lake have caused the Copper River to rise on the order of 20 feet at Million Dollar Bridge.

Green Routing Fuel Saving Opportunity Assessment: A Case Study on California Large-Scale Real-World Travel Data: Preprint

Energy Technology Data Exchange (ETDEWEB)

Zhu, Lei; Holden, Jacob; Gonder, Jeff; Wood, Eric

2017-07-13

New technologies, such as connected and automated vehicles, have attracted more and more researchers for improving the energy efficiency and environmental impact of current transportation systems. The green routing strategy instructs a vehicle to select the most fuel-efficient route before the vehicle departs. It benefits the current transportation system with fuel saving opportunity through identifying the greenest route. This paper introduces an evaluation framework for estimating benefits of green routing based on large-scale, real-world travel data. The framework has the capability to quantify fuel savings by estimating the fuel consumption of actual routes and comparing to routes procured by navigation systems. A route-based fuel consumption estimation model, considering road traffic conditions, functional class, and road grade is proposed and used in the framework. An experiment using a large-scale data set from the California Household Travel Survey global positioning system trajectory data base indicates that 31% of actual routes have fuel savings potential with a cumulative estimated fuel savings of 12%.

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.

Addressing the Issue of Routing Unfairness in Opportunistic Backhaul Networks for Collecting Sensed Data

Directory of Open Access Journals (Sweden)

Tekenate E. Amah

2017-12-01

Full Text Available Widely deploying sensors in the environment and embedding them in physical objects is a crucial step towards realizing smart and sustainable cities. To cope with rising resource demands and limited budgets, opportunistic networks (OppNets offer a scalable backhaul option for collecting delay-tolerant data from sensors to gateways in order to enable efficient urban operations and services. While pervasive devices such as smartphones and tablets contribute significantly to the scalability of OppNets, closely following human movement patterns and social structure introduces network characteristics that pose routing challenges. Our study on the impact of these characteristics reveals that existing routing protocols subject a key set of devices to higher resource consumption, to which their users may respond by withdrawing participation. Unfortunately, existing solutions addressing this unfairness do not guarantee achievable throughput since they are not specifically designed for sensed data collection scenarios. Based on concepts derived from the study, we suggest design guidelines for adapting applicable routing protocols to sensed data collection scenarios. We also follow our design guidelines to propose the Fair Locality Aware Routing (FLARoute technique. Evaluating FLARoute within an existing routing protocol confirms improved fairness and throughput under conditions that compromise the performance of existing solutions.

Connection Setup Signaling Scheme with Flooding-Based Path Searching for Diverse-Metric Network

Science.gov (United States)

Kikuta, Ko; Ishii, Daisuke; Okamoto, Satoru; Oki, Eiji; Yamanaka, Naoaki

Connection setup on various computer networks is now achieved by GMPLS. This technology is based on the source-routing approach, which requires the source node to store metric information of the entire network prior to computing a route. Thus all metric information must be distributed to all network nodes and kept up-to-date. However, as metric information become more diverse and generalized, it is hard to update all information due to the huge update overhead. Emerging network services and applications require the network to support diverse metrics for achieving various communication qualities. Increasing the number of metrics supported by the network causes excessive processing of metric update messages. To reduce the number of metric update messages, another scheme is required. This paper proposes a connection setup scheme that uses flooding-based signaling rather than the distribution of metric information. The proposed scheme requires only flooding of signaling messages with requested metric information, no routing protocol is required. Evaluations confirm that the proposed scheme achieves connection establishment without excessive overhead. Our analysis shows that the proposed scheme greatly reduces the number of control messages compared to the conventional scheme, while their blocking probabilities are comparable.

Raising students’ awareness with respect to choice of literature

DEFF Research Database (Denmark)

Bagger, Bettan; Taylor Kelly, Hélène; Hørdam, Britta

is a pedagogical tool which raises students’ awareness with respect to the necessity of employing scientific and researched based material. The tool is not only used in the theoretical setting but also in clinical practice. Students and clinical advisors evaluate the relevance of the pedagogical tool via...... questionnaires. The data will be analyzed and form the basis for further innovative teaching developments promoting the theory-clinical connection in the learning environment. Keywords: literature, education, pedagogical tool, theory-practice connection....

The Effectiveness of a Phonological Awareness Training Intervention on Pre-Reading Skills of Children with Mental Retardation

Science.gov (United States)

Eissa, Mourad Ali

2013-01-01

Phonological awareness is the ability to manipulate the individual speech sounds that make up connected speech. Little information is reported on the acquisition of phonological awareness in special populations. The purpose of this study was to explore the effectiveness of a phonological awareness training intervention on pre-reading skills of…

Development of a Healthy Urban Route Planner for cyclists and pedestrians in Amsterdam

Science.gov (United States)

van der Molen, Michiel; Ligtenberg, Arend; Vreugdenhil, Corne; Steeneveld, Gert-Jan

2017-04-01

Cities are hotspots of air pollution and heat stress, the exposure to which results in nuisance, health risks, cost of medication, reduced labour productivity and sick leave for citizens. Yet the air pollution and heat stress are spatially and temporally unevenly distributed over the city, depending on pollutant emissions, street design and atmospheric turbulent mixing and radiation. This spatiotemporal variation allows pedestrians and bikers to choose alternative routes to minimize their exposure, if the distribution is known. In this project, we develop a route planner for bicyclists and pedestrians for Amsterdam (NL), that proposes routes and departure times based on model simulations of weather and air quality. We use the WRF-Chem atmosphere and air quality model at unprecedented grid spacing of 100-m (Ronda et al, 2015, Super et al, 2016), with an underlying urban canopy model and NOx and PM10 emissions. The emissions by traffic are calculated based on observed traffic intensities and emission factors. An urban land use map will characterize urban density and street configuration to estimate urban heat storage (Attema et al, 2015). WRF-Chem runs will be issued daily for a lead time of 48 hours, resulting in forecast maps of temperature and pollutant concentrations that will be uniquely expressed in a metric that combines both threats. The hourly fields of this metric are provided to the route planner based on the open source routing library pgRouting to identify the more healthy routes on the route network of Amsterdam. The objectives of the healthy urban route planner are to raise awareness of heat and air quality issues in Amsterdam, to provide an innovative adaptation tool for citizens and tourists, to locate the most important bottlenecks in (the exposure to) air pollution and heat stress, and ultimately to test the readiness of the travellers to use the information and adapt the route. We expect to particularly target a group of lung- and cardiovascular

Awareness, persuasion, and adoption: Enriching the Bass model

Science.gov (United States)

Colapinto, Cinzia; Sartori, Elena; Tolotti, Marco

2014-02-01

In the context of diffusion of innovations, we propose a probabilistic model based on interacting populations connected through new communication channels. The potential adopters are heterogeneous in the connectivity levels and in their taste for innovation. The proposed framework can model the different stages of the adoption dynamics. In particular, the adoption curve is the result of a micro-founded decision process following the awareness phase. Eventually, we recover stylized facts pointed out by the extant literature in the field, such as delayed adoptions and non-monotonic adoption curves.

Seasonal Climate Associated with Major Shipping Routes in the North Pacific and North Atlantic

Directory of Open Access Journals (Sweden)

Jau-Ming Chen

2014-01-01

Full Text Available The major shipping routes in the North Pacific (NP and North Atlantic (NA are analyzed via ship-reported records compiled by the International Comprehensive Ocean-Atmosphere Data Set (ICOADS. The shipping route seasonal characteristics and associated climatic features are also examined. In the NP, the dominant cross-basin route takes a great-circle path between East Asia and North America along 54°N north of the Aleutian Islands throughout the year. This route penetrates the Aleutian low center where ocean waves and winds are relatively weaker than those in the low¡¦s southern section south of 50°N. Moreover, the Earth¡¦s spherical shape makes a higher-latitude route shorter in navigational distance across the NP than a lower-latitude route. Two additional mid-latitude routes through the 40° - 50°N region appear in summer when the Aleutian low vanishes. In the NA, the major shipping routes form an X-shaped pattern in the oceans south of 40°N to connect North America/the Panama Canal and the Mediterranean Sea/the British Isles and Europe. These major shipping routes are far from the influence of the Icelandic low and thus are used throughout the year due to the stability in marine conditions and their general efficiency. A third and more zonal route appears to the north of the X-shaped routes in the 40° - 50°N region. Weak influence from the Icelandic low on marine conditions during summer and spring means that more ships take this route in summer and spring than in winter and fall.

State alternative route designations

International Nuclear Information System (INIS)

1989-07-01

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

A Dyadic Perspective on Speech Accommodation and Social Connection: Both Partners’ Rejection Sensitivity Matter

Science.gov (United States)

Aguilar, Lauren; Downey, Geraldine; Krauss, Robert; Pardo, Jennifer; Lane, Sean; Bolger, Niall

2014-01-01

Objective Findings from confederate paradigms predict that mimicry is an adaptive route to social connection for rejection sensitive individuals (Lakin et al., 2008). However, dyadic perspectives predict that whether mimicry leads to perceived connection depends on the rejection sensitivity (RS) of both partners in an interaction. Method We investigated these predictions in 50 college women who completed a dyadic cooperative task in which members were matched or mismatched in being dispositionally high or low in RS. We used a psycholinguistics paradigm to assess, through independent listeners’ judgments (N = 162), how much interacting individuals accommodate phonetic aspects of their speech toward each other. Results Results confirmed predictions from confederate paradigms in matched RS dyads. However, mismatched dyads showed an asymmetry in levels of accommodation and perceived connection: Those high in RS accommodated more than their low RS partner but emerged feeling less connected. Meditational analyses indicated that low RS individuals’ nonaccommodation in mismatched dyads helped explain their high RS partners’ relatively low perceived connection to them. Conclusions Establishing whether mimicry is an adaptive route to social connection requires analyzing mimicry as a dyadic process influenced by the needs of each dyad member. PMID:25393028

An Experimental Study of the Effect of Shared Information on Pilot/Controller Re-Route Negotiation

Science.gov (United States)

Farley, Todd C.; Hansman, R. John

1999-01-01

Air-ground data link systems are being developed to enable pilots and air traffic controllers to share information more fully. The sharing of information is generally expected to enhance their shared situation awareness and foster more collaborative decision making. An exploratory, part-task simulator experiment is described which evaluates the extent to which shared information may lead pilots and controllers to cooperate or compete when negotiating route amendments. The results indicate an improvement in situation awareness for pilots and controllers and a willingness to work cooperatively. Independent of data link considerations, the experiment also demonstrates the value of providing controllers with a good-quality weather representation on their plan view displays. Observed improvements in situation awareness and separation assurance are discussed. It is argued that deployment of this relatively simple, low-risk addition to the plan view displays be accelerated.

SLA-aware differentiated QoS in elastic optical networks

Science.gov (United States)

Agrawal, Anuj; Vyas, Upama; Bhatia, Vimal; Prakash, Shashi

2017-07-01

The quality of service (QoS) offered by optical networks can be improved by accurate provisioning of service level specifications (SLSs) included in the service level agreement (SLA). A large number of users coexisting in the network require different services. Thus, a pragmatic network needs to offer a differentiated QoS to a variety of users according to the SLA contracted for different services at varying costs. In conventional wavelength division multiplexed (WDM) optical networks, service differentiation is feasible only for a limited number of users because of its fixed-grid structure. Newly introduced flex-grid based elastic optical networks (EONs) are more adaptive to traffic requirements as compared to the WDM networks because of the flexibility in their grid structure. Thus, we propose an efficient SLA provisioning algorithm with improved QoS for these flex-grid EONs empowered by optical orthogonal frequency division multiplexing (O-OFDM). The proposed algorithm, called SLA-aware differentiated QoS (SADQ), employs differentiation at the level of routing, spectrum allocation, and connection survivability. The proposed SADQ aims to accurately provision the SLA using such multilevel differentiation with an objective to improve the spectrum utilization from the network operator's perspective. SADQ is evaluated for three different CoSs under various traffic demand patterns and for different ratios of the number of requests belonging to the three considered CoSs. We propose two new SLA metrics for the improvement of functional QoS requirements, namely, security, confidentiality and survivability of high class of service (CoS) traffic. Since, to the best of our knowledge, the proposed SADQ is the first scheme in optical networks to employ exhaustive differentiation at the levels of routing, spectrum allocation, and survivability in a single algorithm, we first compare the performance of SADQ in EON and currently deployed WDM networks to assess the

A Spiritually-based approach to breast cancer awareness: Cognitive response analysis of communication effectiveness

Science.gov (United States)

Holt, Cheryl L.; Lee, Crystal; Wright, Katrina

2017-01-01

The purpose of this study was to compare the communication effectiveness of a spiritually-based approach to breast cancer early detection education with a secular approach, among African American women, by conducting a cognitive response analysis. A total of 108 women from six Alabama churches were randomly assigned by church to receive a spiritually-based or secular educational booklet discussing breast cancer early detection. Based on the Elaboration Likelihood Model (Petty & Cacioppo, 1981), after reading the booklets participants were asked to complete a thought-listing task writing down any thoughts they experienced and rating them as positive, negative, or neutral. Two independent coders then used five dimensions to code participants thoughts. Compared with the secular booklet, the spiritually-based booklet resulted in significantly more thoughts involving personal connection, self-assessment, and spiritually-based responses. These results suggest that a spiritually-based approach to breast cancer awareness may be more effective than the secular because it caused women to more actively process the message, stimulating central route processing. The incorporation of spiritually-based content into church-based breast cancer education could be a promising health communication approach for African American women. PMID:18443989

A distance-aware replica adaptive data gathering protocol for Delay Tolerant Mobile Sensor Networks.

Science.gov (United States)

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

2011-01-01

In Delay Tolerant Mobile Sensor Networks (DTMSNs) that have the inherent features of intermitted connectivity and frequently changing network topology it is reasonable to utilize multi-replica schemes to improve the data gathering performance. However, most existing multi-replica approaches inject a large amount of message copies into the network to increase the probability of message delivery, which may drain each mobile node's limited battery supply faster and result in too much contention for the restricted resources of the DTMSN, so a proper data gathering scheme needs a trade off between the number of replica messages and network performance. In this paper, we propose a new data gathering protocol called DRADG (for Distance-aware Replica Adaptive Data Gathering protocol), which economizes network resource consumption through making use of a self-adapting algorithm to cut down the number of redundant replicas of messages, and achieves a good network performance by leveraging the delivery probabilities of the mobile sensors as main routing metrics. Simulation results have shown that the proposed DRADG protocol achieves comparable or higher message delivery ratios at the cost of the much lower transmission overhead than several current DTMSN data gathering schemes.

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

COMPOSITE METHOD OF RELIABILITY RESEARCH FOR HIERARCHICAL MULTILAYER ROUTING SYSTEMS

Directory of Open Access Journals (Sweden)

R. B. Tregubov

2016-09-01

Full Text Available The paper deals with the idea of a research method for hierarchical multilayer routing systems. The method represents a composition of methods of graph theories, reliability, probabilities, etc. These methods are applied to the solution of different private analysis and optimization tasks and are systemically connected and coordinated with each other through uniform set-theoretic representation of the object of research. The hierarchical multilayer routing systems are considered as infrastructure facilities (gas and oil pipelines, automobile and railway networks, systems of power supply and communication with distribution of material resources, energy or information with the use of hierarchically nested functions of routing. For descriptive reasons theoretical constructions are considered on the example of task solution of probability determination for up state of specific infocommunication system. The author showed the possibility of constructive combination of graph representation of structure of the object of research and a logic probable analysis method of its reliability indices through uniform set-theoretic representation of its elements and processes proceeding in them.

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model

Directory of Open Access Journals (Sweden)

Yi Yang

2014-01-01

Full Text Available This paper mainly focuses on routing in two-dimensional mesh networks. We propose a novel faulty block model, which is cracky rectangular block, for fault-tolerant adaptive routing. All the faulty nodes and faulty links are surrounded in this type of block, which is a convex structure, in order to avoid routing livelock. Additionally, the model constructs the interior spanning forest for each block in order to keep in touch with the nodes inside of each block. The procedure for block construction is dynamically and totally distributed. The construction algorithm is simple and ease of implementation. And this is a fully adaptive block which will dynamically adjust its scale in accordance with the situation of networks, either the fault emergence or the fault recovery, without shutdown of the system. Based on this model, we also develop a distributed fault-tolerant routing algorithm. Then we give the formal proof for this algorithm to guarantee that messages will always reach their destinations if and only if the destination nodes keep connecting with these mesh networks. So the new model and routing algorithm maximize the availability of the nodes in networks. This is a noticeable overall improvement of fault tolerability of the system.

Building Multicultural Awareness in University Students Using Synchronous Technology

Science.gov (United States)

Stork, Michele Garabedian; Zhang, Jingshun; Wang, Charles Xiaoxue

2018-01-01

To explore the potential for building multicultural awareness in university students using synchronous technology, faculty members from an American regional state university and a Chinese regional university collaborated to find appropriate ways to integrate synchronous technology (e.g., Adobe Connect) into a teacher education program in the…

Buffer Management and Hybrid Probability Choice Routing for Packet Delivery in Opportunistic Networks

Directory of Open Access Journals (Sweden)

Daru Pan

2012-01-01

Full Text Available Due to the features of long connection delays, frequent network partitions, and topology unsteadiness, the design of opportunistic networks faces the challenge of how to effectively deliver data based only on occasional encountering of nodes, where the conventional routing schemes do not work properly. This paper proposes a hybrid probability choice routing protocol with buffer management for opportunistic networks. A delivery probability function is set up based on continuous encounter duration time, which is used for selecting a better node to relay packets. By combining the buffer management utility and the delivery probability, a total utility is used to decide whether the packet should be kept in the buffer or be directly transmitted to the encountering node. Simulation results show that the proposed routing outperforms the existing one in terms of the delivery rate and the average delay.

Developing Road Infrastructure Route Planning: Increasing Feasibility of Toll Road Project

Directory of Open Access Journals (Sweden)

Mohammed Ali Berawi

2016-12-01

Full Text Available Indonesian government attempts to improve connectivity and to increase regional activities in SumateraIsland through the development of Trans Sumatera Toll Road (TSTR.However, despite its benefits to local economic development in Sumatera, the project shows low feasibility due to a low amount of investment. It can be attributed from the lack of planning in the initial phase to produce a comprehensive route that considers the various potentials of the regions. Thus, this research aims to investigate alternative routeplanning of Trans Sumatera Toll Road particularly in this paper for Central Sumatera by studying Gross Regional Domestic Product (GRDP, population and other significant factors. This research exposes cities and districts in Riau, West Sumatera, and Jambi which potentially contribute to the regional economy. Each selected towns and districts will be integrated with the intermodal system and connected to other functions to establish the Trans Sumatera Toll Roadproject in Central Sumatera. Compared to existing estimation of investment from public records, this alternative route has generated a competitive cost of investment which is estimated around 118,053,400,074,696 rupiahs. The research findings are expected to become the basis to improve other similar infrastructure toll road project development.

Recommendation system to determine suitable and viable hiking routes: a prototype application in Sierra de las Nieves Nature Reserve (southern Spain)

Science.gov (United States)

Vías, Jesús; Rolland, José; Gómez, María Luisa; Ocaña, Carmen; Luque, Ana

2018-05-01

This paper describes a system for recommending hiking routes to help manage hiking activities in a protected area. The system proposes various routes, based on five criteria that maximize some aspects of hikers' requirements (by analyzing the viability and difficulty of the trails) and also those of protected areas managers (by proposals to relieve congestion in areas already used for hiking and to promote awareness of new ones, as a contribution to environmental education). The recommendation system uses network analysis, multi-criteria decision analysis and geographic information system by free software tools: PgRouting, PostgreSQL and PostGIS. This system has been tested in Sierra de las Nieves Nature Reserve (Andalusia, Spain). Of the 182 routes obtained by the system, 62 (34%) are considered viable for hikers in Sierra de las Nieves, taking into account the type of user most likely to visit this protected area. Most routes have a high difficulty level, which is coherent with the mountainous character of the protected area.

Traffic grooming in WDM optical network with grooming resources at Max Connectivity nodes

Science.gov (United States)

Paul, Partha; Rawat, Balbeer Singh; Ghorai, S. K.

2012-12-01

In this paper, we propose Max Connectivity grooming in WDM mesh networks under static lightpath connection requests. The grooming and wavelength conversion resources are placed at the nodes having maximum connections. We propose a heuristic genetic algorithm (GA) model to solve grooming, routing and wavelength assignment. The GA algorithm has been used to optimize the cost of grooming and wavelength conversion resources. The blocking probability has been investigated under different lightpath connections. The performance of Max Connectivity grooming has been compared with other grooming policies. Our results indicate the improvement of resource utilization with minimum blocking probability.

Optical slotted circuit switched network: a bandwidth efficient alternative to wavelength-routed network

Science.gov (United States)

Li, Yan; Collier, Martin

2007-11-01

Wavelength-routed networks have received enormous attention due to the fact that they are relatively simple to implement and implicitly offer Quality of Service (QoS) guarantees. However, they suffer from a bandwidth inefficiency problem and require complex Routing and Wavelength Assignment (RWA). Most attempts to address the above issues exploit the joint use of WDM and TDM technologies. The resultant TDM-based wavelength-routed networks partition the wavelength bandwidth into fixed-length time slots organized as a fixed-length frame. Multiple connections can thus time-share a wavelength and the grooming of their traffic leads to better bandwidth utilization. The capability of switching in both wavelength and time domains in such networks also mitigates the RWA problem. However, TMD-based wavelength-routed networks work in synchronous mode and strict synchronization among all network nodes is required. Global synchronization for all-optical networks which operate at extremely high speed is technically challenging, and deploying an optical synchronizer for each wavelength involves considerable cost. An Optical Slotted Circuit Switching (OSCS) architecture is proposed in this paper. In an OSCS network, slotted circuits are created to better utilize the wavelength bandwidth than in classic wavelength-routed networks. The operation of the protocol is such as to avoid the need for global synchronization required by TDM-based wavelength-routed networks.

Velocity-Aware Handover Management in Two-Tier Cellular Networks

KAUST Repository

Arshad, Rabe

2017-01-19

While network densification is considered an important solution to cater the ever-increasing capacity demand, its effect on the handover (HO) rate is overlooked. In dense 5G networks, HO delays may neutralize or even negate the gains offered by network densification. Hence, user mobility imposes a nontrivial challenge to harvest capacity gains via network densification. In this paper, we propose a velocity-aware HO management scheme for two-tier downlink cellular network to mitigate the HO effect on the foreseen densification throughput gains. The proposed HO scheme sacrifices the best base station (BS) connectivity, by skipping HO to some BSs along the user trajectory, to maintain longer connection durations and reduce HO rates. Furthermore, the proposed scheme enables cooperative BS service and strongest interference cancellation to compensate for skipping the best connectivity. To this end, we consider different HO skipping scenarios and develop a velocity-aware mathematical model, via stochastic geometry, to quantify the performance of the proposed HO schemes in terms of the coverage probability and user throughput. The results highlight the HO rate problem in dense cellular environments and show the importance of the proposed HO schemes. Finally, the value of BS cooperation along with handover skipping is quantified for different user mobility profiles.

Impact of Locality on Location Aware Unit Disk Graphs

Directory of Open Access Journals (Sweden)

Evangelos Kranakis

2008-09-01

Full Text Available Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Despite of this restriction we propose local constant ratio approximation algorithms for solving minimum dominating and connected dominating set, maximum independent set and minimum vertex cover in location aware Unit Disk Graphs. We also prove the first ever lower bounds for local algorithms for these problems with a given locality in the location aware setting.

Academic ethical awareness among undergraduate nursing students.

Science.gov (United States)

Cho, Ok-Hee; Hwang, Kyung-Hye

2017-01-01

Academic ethical awareness is an important aspect especially for nursing students who will provide ethical nursing care to patients in future or try to tread the path of learning toward professional acknowledgement in nursing scholarship. The purpose of this study was to explore academic ethical awareness and its related characteristics among undergraduate nursing students. This study commenced the survey with cross-sectional, descriptive questions and enrolled convenient samples of 581 undergraduate nursing students from three universities in South Korea. It was investigated with structured questionnaires including general characteristics and academic ethical awareness related. Ethical considerations: This study was reviewed and approved by the Institutional Review Board at National University. Academic ethical awareness was the highest regarding behaviors violating the respect or confidentiality of patients and cheating on exams, while it was the lowest for inappropriate behaviors in class. From the result of general characteristics difference, male students showed higher score than female students in relative; first-year students showed higher score than other year students; the higher score was rated from students who were highly satisfied with their major than the other not satisfied with their major; and students with low academic stress showed higher ethical awareness score than persons with higher stress. Personal behaviors were rated with low ethical awareness in relative, but items related to public rules and actual effects on patients or others were rated with higher score. Nursing satisfaction and academic stress are main factors on ethical awareness. To improve overall ethical awareness level of nursing students, it is required to provide more education about the importance of personal behaviors in class and need to improve the understanding of how it will be connected with future situation and effect.

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

NARCIS (Netherlands)

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

2012-01-01

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

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

A framework of connections between soil and people can help improve sustainability of the food system and soil functions.

Science.gov (United States)

Ball, Bruce C; Hargreaves, Paul R; Watson, Christine A

2018-04-01

Globally soil quality and food security continue to decrease indicating that agriculture and the food system need to adapt. Improving connection to the soil by knowledge exchange can help achieve this. We propose a framework of three types of connections that allow the targeting of appropriate messages to different groups of people. Direct connection by, for example, handling soil develops soil awareness for management that can be fostered by farmers joining groups on soil-focused farming such as organic farming or no-till. Indirect connections between soil, food and ecosystem services can inform food choices and environmental awareness in the public and can be promoted by, for example, gardening, education and art. Temporal connection revealed from past usage of soil helps to bring awareness to policy workers of the need for the long-term preservation of soil quality for environmental conservation. The understanding of indirect and temporal connections can be helped by comparing them with the operations of the networks of soil organisms and porosity that sustain soil fertility and soil functions.

Facebook network structure and awareness of preexposure prophylaxis among young men who have sex with men.

Science.gov (United States)

Khanna, Aditya S; Schumm, Phil; Schneider, John A

2017-03-01

Young Black men who have sex with men (YBMSM) are the only population in the United States who have experienced rising human immunodeficiency virus incidence over the past decade. Consistent pre-exposure prophylaxis (PrEP) use can substantially reduce the risk of human immunodeficiency virus acquisition. What differentiates those who become aware of PrEP, and those who do not, remains largely unknown. The social networks of YBMSM can impact their awareness of PrEP; to examine this impact, we used two waves of Facebook data from "uConnect"-a longitudinal cohort study of YBMSM in Chicago (n = 266). While PrEP awareness increased from 45% at baseline to 75% at follow-up, its use remained low (4% and 6%). There were 88 PrEP-unaware individuals at baseline who became aware (BA) by follow-up, and 56 who remained persistently unaware. While the persistently unawares had a higher median number of total Facebook friends, the BAs had a higher median numbers of friends who participated in uConnect, who were PrEP-aware, and who practiced behaviors previously found to be associated with individual-level awareness of PrEP at baseline. The BAs also had substantially more "influential" friends. These findings demonstrate the potential of social networks in raising PrEP awareness and use among YBMSM. Copyright © 2016 Elsevier Inc. All rights reserved.

Emotional regulation and bodily sensation: interoceptive awareness is intact in borderline personality disorder.

Science.gov (United States)

Hart, Nova; McGowan, John; Minati, Ludovico; Critchley, Hugo D

2013-08-01

Emotional dysregulation is a core component of borderline personality disorder (BPD). Theoretical models suggest that deficits in labeling physiological sensations of emotion contribute to affective instability in BPD. Interoceptive awareness refers to the ability to perceive changes in internal bodily states, and is linked to the subjective experience and control of emotions. The authors tested whether differences in interoceptive awareness accounted for emotional instability in BPD. Patients diagnosed with BPD (n = 24) were compared to healthy controls (n = 30) on two established measures of interoceptive awareness, a heartbeat perception task and a heartbeat monitoring task. Contrary to their hypothesis, the authors observed no significant differences in objective measures of interoceptive awareness. Their findings provide strong evidence against the notion that difficulties in emotional regulation in BPD are connected to differences in interoceptive awareness.

Edible Connections: A Model To Facilitate Citizen Dialogue and Build Community Collaboration.

Science.gov (United States)

Thomson, Joan S.; Abel, Jennifer L.; Maretzki, Audrey N.

2001-01-01

Edible Connections brings together the media, the public, and food system stakeholders to increase awareness and understanding of the local food system, strengthen connections among stakeholders, and address food system problems identified by a given community. Extension educators have successfully used it to educate about food access, hunger,…

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

International Nuclear Information System (INIS)

Johnson, P.E.

1995-01-01

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

VINE ROUTES IN BULGARIA

Directory of Open Access Journals (Sweden)

Lyuben Hristov

2015-03-01

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

Robust against route failure using power proficient reliable routing in MANET

Directory of Open Access Journals (Sweden)

M. Malathi

2018-03-01

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

Performance modeling of neighbor discovery in proactive routing protocols

Directory of Open Access Journals (Sweden)

Andres Medina

2011-07-01

Full Text Available It is well known that neighbor discovery is a critical component of proactive routing protocols in wireless ad hoc networks. However there is no formal study on the performance of proposed neighbor discovery mechanisms. This paper provides a detailed model of key performance metrics of neighbor discovery algorithms, such as node degree and the distribution of the distance to symmetric neighbors. The model accounts for the dynamics of neighbor discovery as well as node density, mobility, radio and interference. The paper demonstrates a method for applying these models to the evaluation of global network metrics. In particular, it describes a model of network connectivity. Validation of the models shows that the degree estimate agrees, within 5% error, with simulations for the considered scenarios. The work presented in this paper serves as a basis for the performance evaluation of remaining performance metrics of routing protocols, vital for large scale deployment of ad hoc networks.

AN ESTIMATION OF CONNECTION BETWEEN INDICATORS OF BRAND AWARENESS/PENETRATION AND MARKET SHARE

Directory of Open Access Journals (Sweden)

Grebennikov V. F.

2015-09-01

Full Text Available In marketing practice usually are used various indicators for the description of «brand health». Between which and brand market share possibly exist the statistically significant connection. If such connection is found, it is possible data recovery about a market share when it is absent or is incomplete. In the article application for this regression analysis on the basis of actual data on several local markets is described. The results show that such connection exists for all studied indicators. But force of it significantly differs that leads to a conclusion about priority of use for data recovery part of indicators, and refusal of application of others. Also it is necessary to pay attention to existence of specifics of commodity group and the market which significantly influence by sight and regression equation accuracy.

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

Science.gov (United States)

Zhu, Xudong; Wang, Jinhang; Chen, Yunchao

2014-01-01

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

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

Directory of Open Access Journals (Sweden)

Yulia Shichkina

2017-01-01

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

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

Green open location-routing problem considering economic and environmental costs

Directory of Open Access Journals (Sweden)

Eliana M. Toro

2016-12-01

Full Text Available This paper introduces a new bi-objective vehicle routing problem that integrates the Open Location Routing Problem (OLRP, recently presented in the literature, coupled with the growing need for fuel consumption minimization, named Green OLRP (G-OLRP. Open routing problems (ORP are known to be NP-hard problems, in which vehicles start from the set of existing depots and are not required to return to the starting depot after completing their service. The OLRP is a strategic-level problem involving the selection of one or many depots from a set of candidate locations and the planning of delivery radial routes from the selected depots to a set of customers. The concept of radial paths allows us to use a set of constraints focused on maintaining the radiality condition of the paths, which significantly simplifies the set of constraints associated with the connectivity and capacity requirements and provides a suitable alternative when compared with the elimination problem of sub-tours traditionally addressed in the literature. The emphasis in the paper will be placed on modeling rather than solution methods. The model proposed is formulated as a bi-objective problem, considering the minimization of operational costs and the minimization of environmental effects, and it is solved by using the epsilon constraint technique. The results illustrate that the proposed model is able to generate a set of trade-off solutions leading to interesting conclusions about the relationship between operational costs and environmental impact.

Reading speed and phonological awareness deficits among Arabic-speaking children with dyslexia.

Science.gov (United States)

Layes, Smail; Lalonde, Robert; Rebaï, Mohamed

2015-02-01

Although reading accuracy of isolated words and phonological awareness represent the main criteria of subtyping developmental dyslexia, there is increasing evidence that reduced reading speed also represents a defining characteristic. In the present study, reading speed and accuracy were measured in Arabic-speaking phonological and mixed dyslexic children matched with controls of the same age. Participants in third and fourth grades, aged from 9-10 to 9-8 years, were given single frequent and infrequent word and pseudo-word reading and phonological awareness tasks. Results showed that the group with dyslexia scored significantly lower than controls in accuracy and speed in reading tasks. Phonological and mixed dyslexic subgroups differed in infrequent and frequent word reading accuracy, the latter being worse. In contrast, the subgroups were comparable in pseudo-word identification and phonological awareness. Delayed phonological and recognition processes of infrequent and frequent words, respectively, were placed in the context of the dual route model of reading and the specific orthographic features of the Arabic language. Copyright © 2014 John Wiley & Sons, Ltd.

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

Directory of Open Access Journals (Sweden)

Shereen Omar

2017-01-01

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

Lower Bound of Energy-Latency Tradeoff of Opportunistic Routing in Multihop Networks

Directory of Open Access Journals (Sweden)

Gorce Jean-Marie

2011-01-01

Full Text Available Opportunistic networking aims at exploiting sporadic radio links to improve the connectivity of multihop networks and to foster data transmissions. The broadcast nature of wireless channels is an important feature that can be exploited to improve transmissions by using several potential receivers. Opportunistic relaying is thus the first brick for opportunistic networking. However, the advantage of opportunistic relaying may be degraded due to energy increase related to having multiple active receivers. This paper proposes a thorough analysis of opportunistic relaying efficiency under different realistic radio channel conditions. The study is intended to find the best tradeoff between two objectives: energy and latency minimizations, with a hard reliability constraint. We derive an optimal bound, namely, the Pareto front of the related optimization problem, which offers a good insight into the benefits of opportunistic routings compared with classical multihop routing schemes. Meanwhile, the lower bound provides a framework to optimize the parameters at the physical layer, MAC layer, and routing layer from the viewpoint of cross layer during the design or planning phase of a network.

EFL Prospective Teachers’ Competency in Phonological Awareness: Impact on Teaching English Reading

Directory of Open Access Journals (Sweden)

Yousef Alshaboul

2018-03-01

Full Text Available Deficits in EFL teachers’ proficiency have surfaced recently as one of the possible factors contributing to children’s reading problems at their early encounters with literacy. Phonological awareness (PA has dominated specialists’ interests well-timed with escalating reports containing more provoking evidence connecting children's reading disability with deficiencies in PA. This paper aims at investigating the impact of perceived proficiency, GPA, and gender of prospective teachers on shaping their future reading instruction detectable by prospective teachers' PA beliefs, awareness and knowledge. Towards this end, a four-section survey was administered to 158 pre-service EFL teachers. Results confirmed significant differences related to knowledge and beliefs at the expense of awareness.

Intelligent Shuttle Management and Routing Algorithm

Science.gov (United States)

Thomas, Toshen M.; Subashanthini, S.

2017-11-01

Nowadays, most of the big Universities and campuses have Shuttle cabs running in them to cater the transportational needs of the students and faculties. While some shuttle services ask for a meagre sum to be paid for the usage, no digital payment system is onboard these vehicles to go truly cashless. Even more troublesome is the fact that sometimes during the day, some of these cabs run with bare number of passengers, which can result in unwanted budget loss to the shuttle operator. The main purpose of this paper is to create a system with two types of applications: A web portal and an Android app, to digitize the Shuttle cab industry. This system can be used for digital cashless payment feature, tracking passengers, tracking cabs and more importantly, manage the number of shuttle cabs in every route to maximize profit. This project is built upon an ASP.NET website connected to a cloud service along with an Android app that tracks and reads the passengers ID using an attached barcode reader along with the current GPS coordinates, and sends these data to the cloud for processing using the phone’s internet connectivity.

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

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

Directory of Open Access Journals (Sweden)

Amara Umar

2015-06-01

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

Distributed sensor management for space situational awareness via a negotiation game

Science.gov (United States)

Jia, Bin; Shen, Dan; Pham, Khanh; Blasch, Erik; Chen, Genshe

2015-05-01

Space situational awareness (SSA) is critical to many space missions serving weather analysis, communications, and navigation. However, the number of sensors used in space situational awareness is limited which hinders collision avoidance prediction, debris assessment, and efficient routing. Hence, it is critical to use such sensor resources efficiently. In addition, it is desired to develop the SSA sensor management algorithm in a distributed manner. In this paper, a distributed sensor management approach using the negotiation game (NG-DSM) is proposed for the SSA. Specifically, the proposed negotiation game is played by each sensor and its neighboring sensors. The bargaining strategies are developed for each sensor based on negotiating for accurately tracking desired targets (e.g., satellite, debris, etc.) . The proposed NG-DSM method is tested in a scenario which includes eight space objects and three different sensor modalities which include a space based optical sensor, a ground radar, or a ground Electro-Optic sensor. The geometric relation between the sensor, the Sun, and the space object is also considered. The simulation results demonstrate the effectiveness of the proposed NG-DSM sensor management methods, which facilitates an application of multiple-sensor multiple-target tracking for space situational awareness.

Developing student awareness:

DEFF Research Database (Denmark)

Bagger, Bettan; Taylor Kelly, Hélène; Hørdam, Britta

Danish academic regulations emphasize a dynamic theory- practice relation in the nursing education. The nursing program is based upon the close collaboration and development of the scholastic and clinical spheres. Attempts to improve patient safety emphasize the critical role that the systematic...... reporting of clinical errors can play. This is not only a national but also an international priority as millions of patients worldwide suffer injury or death due to unsafe care. A project in co-operation with clinical practice and University College Sealand’s research and development department attempts...... to optimize the theory-practice connection while developing students’ competencies with respect to the reporting of clinical errors. Quantitative data from the involved students and clinical advisors is collected in order to measure the effect of the intervention. Student knowledge, awareness and experiences...

In vivo evaluation of dosage forms: application of gamma scintigraphy to non-enteral routes of administration.

Science.gov (United States)

Meseguer, G; Gurny, R; Buri, P

1994-01-01

The trend to deliver drugs to defined areas of the body involves sophisticated carriers systems. In addition to the in vitro drug release profile one must be aware of the in vivo behaviour of the dosage form and the drug. Gamma scintigraphy is an elegant way to gain insights of the actual in vivo distribution pattern of dosage forms. This technique relies on the use of radioactive tracers included into the medicament and selected so as to enable an optimum detection by a gamma ray camera. The choice of a convenient label enables the in vivo determination of the targeting of the formulation administered through a large number of routes. The present paper reviews applications of gamma scintigraphy for the evaluation of dosage forms administered by the parenteral, rectal, buccal, nasal, pulmonary, and ophthalmic routes.

Power Management Based Grid Routing Protocol for IEEE 802.11 Based MANET

Institute of Scientific and Technical Information of China (English)

XU Li; ZHENG Bao-yu; YANG Zhen

2004-01-01

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

Context-Aware Community Construction in Proximity-Based Mobile Networks

Directory of Open Access Journals (Sweden)

Na Yu

2015-01-01

Full Text Available Sensor-equipped mobile devices have allowed users to participate in various social networking services. We focus on proximity-based mobile social networking environments where users can share information obtained from different places via their mobile devices when they are in proximity. Since people are more likely to share information if they can benefit from the sharing or if they think the information is of interest to others, there might exist community structures where users who share information more often are grouped together. Communities in proximity-based mobile networks represent social groups where connections are built when people are in proximity. We consider information influence (i.e., specify who shares information with whom as the connection and the space and time related to the shared information as the contexts. To model the potential information influences, we construct an influence graph by integrating the space and time contexts into the proximity-based contacts of mobile users. Further, we propose a two-phase strategy to detect and track context-aware communities based on the influence graph and show how the context-aware community structure improves the performance of two types of mobile social applications.

Fast long-range connections in transportation networks

International Nuclear Information System (INIS)

Palhares Viana, Matheus; Fontoura Costa, Luciano da

2011-01-01

Multidimensional scaling is applied in order to visualize an analogue of the small-world effect implied by edges having different displacement velocities in transportation networks. Our findings are illustrated for two real-world systems, namely the London urban network (streets and underground) and the US highway network enhanced by some of the main US airlines routes. We also show that the travel time in these two networks is drastically changed by attacks targeting the edges with large displacement velocities. - Highlights: → Multidimensional scaling used to visualize the effects of fast long-range connections. → Fast long-range connections are important to decrease the average travel time. → The average travel time diverges quickly when the network is under target attacks.

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

Cyberbullying Awareness for Mitigating Consequences in Higher Education.

Science.gov (United States)

Elçi, Alev; Seçkin, Zeliha

2016-04-28

Technology has many positive effects on education, but negative effects also exist. One of the negative effects is cyberbullying spreading out of school boundaries to the social networks. The increasing popularity of social media among youngsters engenders cyberbullies who exploit the virtual environment besides the usual emails. This distresses the students and adversely affects their families, teachers, and others around them. Although research studies mainly concentrate on prior education, there seems to be a need to investigate the situation in higher education. This study focuses on students studying technology and related disciplines, who are hence likely to be well connected with cyberspace, and explores their awareness about cyberbullying. The findings reveal that female students have significantly less awareness than males. This study will help address some gender issues in cyberbullying. © The Author(s) 2016.

The relation between musical abilities and the phonological awareness in pre-school children

Directory of Open Access Journals (Sweden)

Anja Božič

2007-06-01

Full Text Available The pre-school period plays a very important role in the language development. One of the significant indicators of this development is the phonological awareness. Some of the previous studies reported the presence of the relation between the phonological awareness and musical abilities. Our main goal was to examine this relation with the Test of the phonological awareness and the Test of musical abilities on 67 Slovene preschool children, aged from 5 to 6. We also wanted to investigate the differences between boys (N = 36 and girls (N = 31 and the differences between two age groups (aged from 5 to 5.5 years, N = 32, and from 5.5 to 6 years, N = 35. The results confirmed the connection between musical abilities and the phonological awareness. They also indicated that the recognition of the first and the last phoneme is related to melodic awareness and that phoneme merging is mainly related to rhythm awareness. No significant differences were found between male and female children or between the groups of the children of different ages.

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

Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Ceronmani Sharmila

2016-06-01

Full Text Available Efficient routing between nodes is the most important challenge in a Mobile Ad Hoc Network (MANET. A Connected Dominating Set (CDS acts as a virtual backbone for routing in a MANET. Hence, the construction of CDS based on the need and its application plays a vital role in the applications of MANET. The PipeLined Strategic CDS (PLS-CDS is constructed based on strategy, dynamic diameter and transmission range. The strategy used for selecting the starting node is, any source node in the network, which has its entire destination within a virtual pipelined coverage, instead of the node with maximum connectivity. The other nodes are then selected based on density and velocity. The proposed CDS also utilizes the energy of the nodes in the network in an optimized manner. Simulation results showed that the proposed algorithm is better in terms of size of the CDS and average hop per path length.

Transmission enhancement by deployment of interferometric wavelength converters within all-optical cross connects

DEFF Research Database (Denmark)

Poulsen, Henrik Nørskov; Mikkelsen, Benny; Stubkjær, Kristian

1997-01-01

Wavelength-division multiplexing (WDM) networks are expected to utilize all-optical cross connects (OXCN) for signal routing. Because a signal path is likely to contain a number of OXCNs, their cascadability is essential. Furthermore, because wavelength converters in the OXCNs improve traffic...

Towards energy aware optical networks and interconnects

Science.gov (United States)

Glesk, Ivan; Osadola, Tolulope; Idris, Siti

2013-10-01

In a today's world, information technology has been identified as one of the major factors driving economic prosperity. Datacenters businesses have been growing significantly in the past few years. The equipments in these datacenters need to be efficiently connected to each other and also to the outside world in order to enable effective exchange of information. This is why there is need for highly scalable, energy savvy and reliable network connectivity infrastructure that is capable of accommodating the large volume of data being exchanged at any time within the datacenter network and the outside network in general. These devices that can ensure such effective connectivity currently require large amount of energy in order to meet up with these increasing demands. In this paper, an overview of works being done towards realizing energy aware optical networks and interconnects for datacenters is presented. Also an OCDMA approach is discussed as potential multiple access technique for future optical network interconnections. We also presented some challenges that might inhibit effective implementation of the OCDMA multiplexing scheme.

Energy Aware Routing Schemes in Solar PoweredWireless Sensor Networks

KAUST Repository

Dehwah, Ahmad H.

2016-10-01

Wireless sensor networks enable inexpensive distributed monitoring systems that are the backbone of smart cities. In this dissertation, we are interested in wireless sensor networks for traffic monitoring and an emergency flood detection to improve the safety of future cities. To achieve real-time traffic monitoring and emergency flood detection, the system has to be continually operational. Accordingly, an energy source is needed to ensure energy availability at all times. The sun provides for the most inexpensive source of energy, and therefore the energy is provided here by a solar panel working in conjunction with a rechargeable battery. Unlike batteries, solar energy fluctuates spatially and temporally due to the panel orientation, seasonal variation and node location, particularly in cities where buildings cast shadows. Especially, it becomes scarce whenever floods are likely to occur, as the weather tends to be cloudy at such times when the emergency detection system is most needed. These considerations lead to the need for the optimization of the energy of the sensor network, to maximize its sensing performance. In this dissertation, we address the challenges associated with long term outdoor deployments along with providing some solutions to overcome part of these challenges. We then introduce the energy optimization problem, as a distributed greedy approach. Motivated by the flood sensing application, our objective is to maximize the energy margin in the solar powered network at the onset of the high rain event, to maximize the network lifetime. The decentralized scheme will achieve this by optimizing the energy over a time horizon T, taking into account the available and predicted energy over the entire routing path. Having a good energy forecasting scheme can significantly enhance the energy optimization in WSN. Thus, this dissertation proposes a new energy forecasting scheme that is compatible with the platform’s capabilities. This proposed

Assessment of parental awareness about malocclusion in Shiraz, Islamic Republic of Iran.

Science.gov (United States)

Danaei, S Momeni; Oshagh, M; Pajuhi, N; Ghahremani, Y; Bushehri, Ghodsi S

2011-07-01

Information empowers people to take charge of their health. The aim of this study in Shiraz, Islamic Republic of Iran was to evaluate parents' knowledge about dental malocclusion, referral routes and information sources. A random sample of 1000 7-9-year-old schoolchildren were given a questionnaire to complete at home. Questionnaires were completed by 795 parents. Knowledge about malocclusion was significantly greater in families with higher levels of education and income. Most respondents (83.5%) were aware of the importance of maintaining primary teeth to prevent malocclusion, and 25.1% thought that carious primary teeth must be extracted. Half of the parents (50.6%) did not know that spaces between primary teeth are normal. Only 28.8% of the children visited dentists for annual routine check-ups. Television (43.3%) was the most common source of dental information. The level of general public awareness about malocclusion needs to be improved.

Design and Analysis of QoS Routing Framework integrated with OLSR protocol for Multimedia Traffic in Mobile Adhoc Networks

Directory of Open Access Journals (Sweden)

S. Soni

2017-06-01

Full Text Available MANETs (Mobile Ad-hoc Networks is the self organizing wireless structure of mobile hosts. Wireless media is used for communication in MANETs. Considering the developing requirements for multimedia and real-time traffic applications in real world, QoS (Quality-of-Service support is essential in MANETs. But most of the characteristics of MANETs make QoS support a difficult problem. It is challenging to support QoS routing in MANET due to dynamic behavior and mobility of the hosts. The OLSR (Optimized Link State Routing protocol can be efficiently used in MANETs to provide QoS routing because of its dynamic MPR (Multi Point Relay selection criteria and proactive nature. In this paper, a design of QoS routing framework integrated with OLSR protocol is proposed and also analyzed using network simulator. Proposed QoS framework combines a bandwidth estimation algorithm with explicit resource reservation, QoS routing and connection admission control (CAC. OLSR protocol is extended for QoS framework to solve performance issues related to node mobility using cross layer approach. Results after simulation conclude about efficiency of the proposed QoS routing framework.

Tourist Valorization of Cultural Route “The Trail of the Roman Emperors“

Directory of Open Access Journals (Sweden)

Sanja Božić

2013-01-01

Full Text Available Cultural routes appear as a new concept that turned to be very beneficial in terms of the revitalization and presentation of cultural heritage in its broader sense - from archaeological sites to landscapes. These trails provide a unique purview into the spirit of modern countries and their inextricable connection to contemporary time. On the territory of present day Serbia 17 Roman emperors were born, which is one fifth and largest number of Roman emperors born anywhere in the world, outside of Rome. That was a good basis for developing idea of forming cultural route and starting the project „The Trail of the Roman Emperors“ in Serbia. It can be one of the most important topics in the field of cultural tourism in Serbia, and the main goal of this paper is to give a proposal for its valorization and promotion for the tourism purposes. This will be achieved through the evaluation of all elements of tourist valorization on the basis of which general tourist assessment will be formed, while the purpose of SWOT analysis was to detect existing strengths and weaknesses, and provide real opportunities and risks for this cultural route

SAFEBIKE: A Bike-sharing Route Recommender with Availability Prediction and Safe Routing

OpenAIRE

Zhong, Weisheng; Chen, Fanglan; Fu, Kaiqun; Lu, Chang-Tien

2017-01-01

This paper presents SAFEBIKE, a novel route recommendation system for bike-sharing service that utilizes station information to infer the number of available bikes in dock and recommend bike routes according to multiple factors such as distance and safety level. The system consists of a station level availability predictor that predicts bikes and docks amount at each station, and an efficient route recommendation service that considers safety and bike/dock availability factors. It targets use...

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.

Structural and effective connectivity in focal epilepsy

Directory of Open Access Journals (Sweden)

Christopher S. Parker

2018-01-01

Full Text Available Patients with medically-refractory focal epilepsy may be candidates for neurosurgery and some may require placement of intracranial EEG electrodes to localise seizure onset. Assessing cerebral responses to single pulse electrical stimulation (SPES may give diagnostically useful data. SPES produces cortico-cortical evoked potentials (CCEPs, which infer effective brain connectivity. Diffusion-weighted images and tractography may be used to estimate structural brain connectivity. This combination provides the opportunity to observe seizure onset and its propagation throughout the brain, spreading contiguously along the cortex explored with electrodes, or non-contiguously. We analysed CCEPs and diffusion tractography in seven focal epilepsy patients and reconstructed the effective and structural brain networks. We aimed to assess the inter-modal similarity of the networks at a large scale across the cortex, the effective and structural connectivity of the ictal-onset zone, and investigate potential mechanisms of non-contiguous seizure spread. We found a significant overlap between structural and effective networks. Effective network CCEP amplitude, baseline variation, and outward connectivity was higher at ictal-onset zones, while structural connection strength within the ictal-onset zone tended to be higher. These findings support the concept of hyperexcitable cortex being associated with seizure generation. The high prevalence of structural and effective connections from the ictal-onset zone to sites of non-contiguous spread suggests that macroscopic structural and effective connections are plausible routes for non-contiguous seizure spread.

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

Science.gov (United States)

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-05-12

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.

Epidemic spreading with activity-driven awareness diffusion on multiplex network.

Science.gov (United States)

Guo, Quantong; Lei, Yanjun; Jiang, Xin; Ma, Yifang; Huo, Guanying; Zheng, Zhiming

2016-04-01

There has been growing interest in exploring the interplay between epidemic spreading with human response, since it is natural for people to take various measures when they become aware of epidemics. As a proper way to describe the multiple connections among people in reality, multiplex network, a set of nodes interacting through multiple sets of edges, has attracted much attention. In this paper, to explore the coupled dynamical processes, a multiplex network with two layers is built. Specifically, the information spreading layer is a time varying network generated by the activity driven model, while the contagion layer is a static network. We extend the microscopic Markov chain approach to derive the epidemic threshold of the model. Compared with extensive Monte Carlo simulations, the method shows high accuracy for the prediction of the epidemic threshold. Besides, taking different spreading models of awareness into consideration, we explored the interplay between epidemic spreading with awareness spreading. The results show that the awareness spreading can not only enhance the epidemic threshold but also reduce the prevalence of epidemics. When the spreading of awareness is defined as susceptible-infected-susceptible model, there exists a critical value where the dynamical process on the awareness layer can control the onset of epidemics; while if it is a threshold model, the epidemic threshold emerges an abrupt transition with the local awareness ratio α approximating 0.5. Moreover, we also find that temporal changes in the topology hinder the spread of awareness which directly affect the epidemic threshold, especially when the awareness layer is threshold model. Given that the threshold model is a widely used model for social contagion, this is an important and meaningful result. Our results could also lead to interesting future research about the different time-scales of structural changes in multiplex networks.

Epidemic spreading with activity-driven awareness diffusion on multiplex network

Science.gov (United States)

Guo, Quantong; Lei, Yanjun; Jiang, Xin; Ma, Yifang; Huo, Guanying; Zheng, Zhiming

2016-04-01

There has been growing interest in exploring the interplay between epidemic spreading with human response, since it is natural for people to take various measures when they become aware of epidemics. As a proper way to describe the multiple connections among people in reality, multiplex network, a set of nodes interacting through multiple sets of edges, has attracted much attention. In this paper, to explore the coupled dynamical processes, a multiplex network with two layers is built. Specifically, the information spreading layer is a time varying network generated by the activity driven model, while the contagion layer is a static network. We extend the microscopic Markov chain approach to derive the epidemic threshold of the model. Compared with extensive Monte Carlo simulations, the method shows high accuracy for the prediction of the epidemic threshold. Besides, taking different spreading models of awareness into consideration, we explored the interplay between epidemic spreading with awareness spreading. The results show that the awareness spreading can not only enhance the epidemic threshold but also reduce the prevalence of epidemics. When the spreading of awareness is defined as susceptible-infected-susceptible model, there exists a critical value where the dynamical process on the awareness layer can control the onset of epidemics; while if it is a threshold model, the epidemic threshold emerges an abrupt transition with the local awareness ratio α approximating 0.5. Moreover, we also find that temporal changes in the topology hinder the spread of awareness which directly affect the epidemic threshold, especially when the awareness layer is threshold model. Given that the threshold model is a widely used model for social contagion, this is an important and meaningful result. Our results could also lead to interesting future research about the different time-scales of structural changes in multiplex networks.

CAreDroid: Adaptation Framework for Android Context-Aware Applications.

Science.gov (United States)

Elmalaki, Salma; Wanner, Lucas; Srivastava, Mani

2015-09-01

Context-awareness is the ability of software systems to sense and adapt to their physical environment. Many contemporary mobile applications adapt to changing locations, connectivity states, available computational and energy resources, and proximity to other users and devices. Nevertheless, there is little systematic support for context-awareness in contemporary mobile operating systems. Because of this, application developers must build their own context-awareness adaptation engines, dealing directly with sensors and polluting application code with complex adaptation decisions. In this paper, we introduce CAreDroid, which is a framework that is designed to decouple the application logic from the complex adaptation decisions in Android context-aware applications. In this framework, developers are required- only-to focus on the application logic by providing a list of methods that are sensitive to certain contexts along with the permissible operating ranges under those contexts. At run time, CAreDroid monitors the context of the physical environment and intercepts calls to sensitive methods, activating only the blocks of code that best fit the current physical context. CAreDroid is implemented as part of the Android runtime system. By pushing context monitoring and adaptation into the runtime system, CAreDroid eases the development of context-aware applications and increases their efficiency. In particular, case study applications implemented using CAre-Droid are shown to have: (1) at least half lines of code fewer and (2) at least 10× more efficient in execution time compared to equivalent context-aware applications that use only standard Android APIs.

Fault Activity Aware Service Delivery in Wireless Sensor Networks for Smart Cities

Directory of Open Access Journals (Sweden)

Xiaomei Zhang

2017-01-01

Full Text Available Wireless sensor networks (WSNs are increasingly used in smart cities which involve multiple city services having quality of service (QoS requirements. When misbehaving devices exist, the performance of current delivery protocols degrades significantly. Nonetheless, the majority of existing schemes either ignore the faulty behaviors’ variability and time-variance in city environments or focus on homogeneous traffic for traditional data services (simple text messages rather than city services (health care units, traffic monitors, and video surveillance. We consider the problem of fault-aware multiservice delivery, in which the network performs secure routing and rate control in terms of fault activity dynamic metric. To this end, we first design a distributed framework to estimate the fault activity information based on the effects of nondeterministic faulty behaviors and to incorporate these estimates into the service delivery. Then we present a fault activity geographic opportunistic routing (FAGOR algorithm addressing a wide range of misbehaviors. We develop a leaky-hop model and design a fault activity rate-control algorithm for heterogeneous traffic to allocate resources, while guaranteeing utility fairness among multiple city services. Finally, we demonstrate the significant performance of our scheme in routing performance, effective utility, and utility fairness in the presence of misbehaving sensors through extensive simulations.

A Comprehensive Real-Time Traffic Map for Geographic Routing in VANETs

Directory of Open Access Journals (Sweden)

Chi-Fu Huang

2017-01-01

Full Text Available Vehicular Ad Hoc Networks (VANETs have attracted a lot of attention during the last decade. VANETs can not only improve driving safety, but also convenience, and support most future Intelligent Transportation System (ITS. Due to the highly dynamic network topology of VANETs, many geographic routing protocols have been proposed and use real-time traffic information as an important metric to select a reliable forwarding path. However, most of the existing works do not describe how to gather real-time traffic. They either assume this information is already available, or can query an existing traffic center. Few studies have noticed this issue but the proposed solutions only consider a small region. In this paper, we propose a Comprehensive Real-Time Traffic Map (CRT Map to collect wide-ranging real-time traffic information with low overhead. In the design of a CRT Map, the concept of Crowdsensing is adopted. Vehicles cooperatively gather traffic information and share it with each other to construct an overview of the whole road network traffic. In addition, we design a CRT Map Based Routing (CBR, which takes into account the connectivity of consecutive roads in routing decisions. Simulation results show that the CBR can achieve a lower end-to-end delay and a higher packet delivery ratio.

Class network routing

Science.gov (United States)

Bhanot, Gyan [Princeton, NJ; Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Takken, Todd E [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

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.

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

Science.gov (United States)

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

2016-01-01

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

Maritime Situational Awareness: The MARISS Experience

Science.gov (United States)

Margarit, G.; Tabasco, A.; Gomez, C.

2010-04-01

This paper presents the operational solution developed by GMV to provide support to maritime situational awareness via Earth Observation (EO) technologies. The concept falls on integrating the information retrieved from Synthetic Aperture Radar (SAR) images and transponder-based polls (AIS and similar) in an advanced GeoPortal web. The service has been designed in the framework of the MARISS project, a project conceived to help improving ship monitoring with the support of a large user segment. In this context, the interaction with official agencies has provided good feedback about system performance and its usefulness in supporting monitoring and surveillance tasks. Some representative samples are analyzed along the paper in order to validate key kernel utilities, such as ship and coastline detection, and ship classification. They justify the promotion of extended R&D activities to increase monitoring performance and to include advanced added- value tools, such as decision making and route tracking.

Insecure Network, Unknown Connection: Understanding Wi-Fi Privacy Assumptions of Mobile Device Users

Directory of Open Access Journals (Sweden)

Bram Bonné

2017-07-01

Full Text Available Smartphones and other mobile devices have proliferated in the past five years. The expectation of mobile device users to always be online has led to Wi-Fi networks being offered by a variety of providers. Using these networks introduces multiple security risks. In this work, we assess to what extent the privacy stance of mobile device users corresponds with their actual behavior by conducting a study with 108 participants. Our methodology consists of monitoring Wi-Fi networks that the participants’ devices connect to and the connections made by apps on these devices, for a period of 30 days. Afterwards, participants are surveyed about their awareness and privacy sensitiveness. We show that while a higher expertise in computer networks corresponds to more awareness about the connections made by apps, neither this expertise nor the actual privacy stance of the participant translates to better security habits. Moreover, participants in general were unaware about a significant part of connections made by apps on their devices, a matter that is worsened by the fact that one third of Wi-Fi networks that participants connect to do not have any security enabled. Based on our results, we provide recommendations to network providers, developers and users on how to improve Wi-Fi security for mobile devices.

Adopting Energy Efficiency in Connected Homes

Energy Technology Data Exchange (ETDEWEB)

Christensen, Dane T [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Kemper, Emily [CLEAResult

2017-10-02

This presentation on connected homes was presented at the 11th Rocky Mountain Utility Efficiency Exchange on September 28, 2017. The discussion covered the integration of energy efficiency measures and practices with Internet of Things (IoT) awareness and adoption of smart technologies and services via WiFi/ Bluetooth enabled home and office equipment. The presentation also describes the benefits to the home and business and benefits/challenges for the utility/implementer.

The role of empathy in making availability judgments from video and silhouette awareness information

NARCIS (Netherlands)

Ruyter, de B.E.R.; Baha, S.E.; Pijl, M.; Markopoulos, P.

2011-01-01

This paper reports research concerning video media spaces for the home and specifically the extent to which different approaches for video obfuscation can balance conflicting requirements for awareness between connected individuals and privacy. Different filtering techniques were compared regarding

Developing an eco-routing application.

Science.gov (United States)

2014-01-01

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

Connecting today's climates to future climate analogs to facilitate movement of species under climate change.

Science.gov (United States)

Littlefield, Caitlin E; McRae, Brad H; Michalak, Julia L; Lawler, Joshua J; Carroll, Carlos

2017-12-01

Increasing connectivity is an important strategy for facilitating species range shifts and maintaining biodiversity in the face of climate change. To date, however, few researchers have included future climate projections in efforts to prioritize areas for increasing connectivity. We identified key areas likely to facilitate climate-induced species' movement across western North America. Using historical climate data sets and future climate projections, we mapped potential species' movement routes that link current climate conditions to analogous climate conditions in the future (i.e., future climate analogs) with a novel moving-window analysis based on electrical circuit theory. In addition to tracing shifting climates, the approach accounted for landscape permeability and empirically derived species' dispersal capabilities. We compared connectivity maps generated with our climate-change-informed approach with maps of connectivity based solely on the degree of human modification of the landscape. Including future climate projections in connectivity models substantially shifted and constrained priority areas for movement to a smaller proportion of the landscape than when climate projections were not considered. Potential movement, measured as current flow, decreased in all ecoregions when climate projections were included, particularly when dispersal was limited, which made climate analogs inaccessible. Many areas emerged as important for connectivity only when climate change was modeled in 2 time steps rather than in a single time step. Our results illustrate that movement routes needed to track changing climatic conditions may differ from those that connect present-day landscapes. Incorporating future climate projections into connectivity modeling is an important step toward facilitating successful species movement and population persistence in a changing climate. © 2017 Society for Conservation Biology.

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.

Metacognitive awareness of TOEFL reading comprehension strategies

Directory of Open Access Journals (Sweden)

Sungatullina Dilyana D.

2016-01-01

Full Text Available The rising demand for exchange and mobility programs as well as double diploma opportunities with world leading universities highlights the importance of ESL proficiency. TOEFL iBT as a test of EAP is accepted by most of the HEI in various countries. The aim of the present study is to determine students’ metacognitive awareness of global academic reading strategies, namely the use of context clues, within the framework of preparation for TOEFL reading section. The article establishes the connection between success in reading comprehension and the degree of students’ metacognitive awareness. The authors concentrate on expository texts from TOEFL reading section as a testing material and provide detailed description of single context clues types and double context clues patterns typical for this text structure. The following study is concerned with comparison and interpretation of the results obtained in three focus groups of students, who have accomplished reading comprehension task from TOEFL iBT with and without learning to employ the context clues reading strategy.

Augmented Reality Tool for the Situational Awareness Improvement of UAV Operators

Science.gov (United States)

Ruano, Susana; Cuevas, Carlos; Gallego, Guillermo; García, Narciso

2017-01-01

Unmanned Aerial Vehicles (UAVs) are being extensively used nowadays. Therefore, pilots of traditional aerial platforms should adapt their skills to operate them from a Ground Control Station (GCS). Common GCSs provide information in separate screens: one presents the video stream while the other displays information about the mission plan and information coming from other sensors. To avoid the burden of fusing information displayed in the two screens, an Augmented Reality (AR) tool is proposed in this paper. The AR system has two functionalities for Medium-Altitude Long-Endurance (MALE) UAVs: route orientation and target identification. Route orientation allows the operator to identify the upcoming waypoints and the path that the UAV is going to follow. Target identification allows a fast target localization, even in the presence of occlusions. The AR tool is implemented following the North Atlantic Treaty Organization (NATO) standards so that it can be used in different GCSs. The experiments show how the AR tool improves significantly the situational awareness of the UAV operators. PMID:28178189

The connection between landscapes and the solar ephemeris in honeybees.

Science.gov (United States)

Towne, William F; Moscrip, Heather

2008-12-01

Honeybees connect the sun's daily pattern of azimuthal movement to some aspect of the landscape around their nests. In the present study, we ask what aspect of the landscape is used in this context--the entire landscape panorama or only sectors seen along familiar flight routes. Previous studies of the solar ephemeris memory in bees have generally used bees that had experience flying a specific route, usually along a treeline, to a feeder. When such bees were moved to a differently oriented treeline on overcast days, the bees oriented their communicative dances as if they were still at the first treeline, based on a memory of the sun's course in relation to some aspect of the site, possibly the familiar route along the treeline or possibly the entire landscape or skyline panorama. Our results show that bees lacking specific flight-route training can nonetheless recall the sun's compass bearing relative to novel flight routes in their natal landscape. Specifically, we moved a hive from one landscape to a differently oriented twin landscape, and only after transplantation under overcast skies did we move a feeder away from the hive. These bees nonetheless danced accurately by memory of the sun's course in relation to their natal landscape. The bees' knowledge of the relationship between the sun and landscape, therefore, is not limited to familiar flight routes and so may encompass, at least functionally, the entire panorama. Further evidence suggests that the skyline in particular may be the bees' preferred reference in this context.

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Science.gov (United States)

Alena, Richard I.; Lee, Charles

2004-01-01

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the

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

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

2015-01-01

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

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

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

2015-01-01

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

Longitudinal study of self-imposed driving restrictions and deficit awareness in patients with Alzheimer disease.

Science.gov (United States)

Cotrell, V; Wild, K

1999-01-01

Thirty-five patients with Alzheimer disease (AD), including 19 who were still driving, were evaluated for level of awareness and driving status. There was no significant correlation between driving status and Mini-Mental State Examination (MMSE) scores. Only the attention subscore of the awareness questionnaire yielded a statistically significant difference between drivers and nondrivers. Follow-up of the patients who were still driving was conducted 12-18 months later. All but 4 patients had stopped driving. Caregivers responded to a questionnaire assessing the patient's driving behaviors since the onset of AD. There was no correlation between MMSE and driving status. In 7 of 10 cases, caregivers or patients made the decision that the patient should stop driving. However, caregivers reported long periods between the caregiver's perception that the patient should stop driving and actual cessation (0.5-48 months). Results suggest that AD patients do restrict several areas of their driving voluntarily and that a failure to do so may be associated with an awareness deficit. In particular, a deficit of awareness for attention was significantly associated with an absence of restricted driving behaviors such as avoiding unfamiliar routes. Awareness of a deficit that is related to driving performance may be critical to restricted driving behavior, and this change in behavior may enable the patient to prolong his or her status as a driver.

Fuel Economy and Emission Testing for Connected and Automated Vehicles Using Real-world Driving Datasets

OpenAIRE

Chang, Yan; Yang, Weiqing; Zhao, Ding

2018-01-01

By using the onboard sensing and external connectivity technology, connected and automated vehicles (CAV) could lead to improved energy efficiency, better routing, and lower traffic congestion. With the rapid development of the technology and adaptation of CAV, it is more critical to develop the new evaluation method and standard which could evaluate the impacts on energy consumption and environmental pollution of CAV fairly, especially under the various traffic conditions. In this paper, we ...

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.

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

Directory of Open Access Journals (Sweden)

Tong Wang

2017-01-01

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

Zinc oxide: Connecting theory and experiment

Directory of Open Access Journals (Sweden)

Dejan Zagorac

2013-09-01

Full Text Available Zinc oxide (ZnO is a material with a great variety of industrial applications including high heat capacity, thermal conductivity and temperature stability. Clearly, it would be of great importance to find new stable and/or metastable modifications of zinc oxide, and investigate the influence of pressure and/or temperature on these structures, and try to connect theoretical results to experimental observations. In order to reach this goal, we performed several research studies, using modern theoretical methods. We have predicted possible crystal structures for ZnO using simulated annealing (SA, followed by investigations of the barrier structure using the threshold algorithm (TA. Finally, we have performed calculations using the prescribed path algorithm (PP, where connections between experimental structures on the energy landscape, and in particular transition states, were investigated in detail. The results were in good agreement with previous theoretical and experimental observations, where available, and we have found several additional (metastable modifications at standard, elevated and negative pressures. Furthermore, we were able to gain new insight into synthesis conditions for the various ZnO modifications and to connect our results to the actual synthesis and transformation routes.

On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

Science.gov (United States)

Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

2016-05-01

A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

Southern states' routing agency report

International Nuclear Information System (INIS)

1989-02-01

The Southern states' routing agency report is a compendium of 16-southern states' routing programs relative to the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source ad scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

Southern States' Routing Agency Report

International Nuclear Information System (INIS)

1990-03-01

The Southern States' Routing Agency Report is a compendium of 16-southern states' routing program for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

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

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

Science.gov (United States)

Utamima, Amalia; Djunaidy, Arif

2017-08-01

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

Dynamic effective connectivity of inter-areal brain circuits.

Directory of Open Access Journals (Sweden)

Demian Battaglia

Full Text Available Anatomic connections between brain areas affect information flow between neuronal circuits and the synchronization of neuronal activity. However, such structural connectivity does not coincide with effective connectivity (or, more precisely, causal connectivity, related to the elusive question "Which areas cause the present activity of which others?". Effective connectivity is directed and depends flexibly on contexts and tasks. Here we show that dynamic effective connectivity can emerge from transitions in the collective organization of coherent neural activity. Integrating simulation and semi-analytic approaches, we study mesoscale network motifs of interacting cortical areas, modeled as large random networks of spiking neurons or as simple rate units. Through a causal analysis of time-series of model neural activity, we show that different dynamical states generated by a same structural connectivity motif correspond to distinct effective connectivity motifs. Such effective motifs can display a dominant directionality, due to spontaneous symmetry breaking and effective entrainment between local brain rhythms, although all connections in the considered structural motifs are reciprocal. We show then that transitions between effective connectivity configurations (like, for instance, reversal in the direction of inter-areal interactions can be triggered reliably by brief perturbation inputs, properly timed with respect to an ongoing local oscillation, without the need for plastic synaptic changes. Finally, we analyze how the information encoded in spiking patterns of a local neuronal population is propagated across a fixed structural connectivity motif, demonstrating that changes in the active effective connectivity regulate both the efficiency and the directionality of information transfer. Previous studies stressed the role played by coherent oscillations in establishing efficient communication between distant areas. Going beyond these early

Technical guide to the connection of generation to the distribution network

Energy Technology Data Exchange (ETDEWEB)

Jarrett, K.; Hedgecock, J.; Gregory, R.; Warham, T.

2003-07-01

This guide provides a 'route map' of the processes of getting a generation scheme connected to the network and is intended to help developers of any form of distributed generation connected to the UK's local electricity networks, eg: renewable energy schemes; waste-to-energy schemes; on-site generation and combined heat and power (CHP) schemes; and peak lopping schemes using back-up generators. Where necessary, the guide distinguishes between arrangements that apply in Scotland and those that apply in England and Wales. The guide aims to: provide background information about the electricity industry; highlight common technical issues that arise during connection negotiation and their implications for distribution network operators (DNOs) and developers; examine the main factors affecting connection costs and timescales for achieving connections; and identify the different types of contracts relating to connection. The report considers the connection process, the connection application process and timescales, costs and charges, competition in connection, the structure of the UK electricity industry, the statutory framework, the effects of distributed generation of the distribution system, earthing and protection design, safety issues and DNO network information. It includes a glossary, checklists, useful contact details and information about standards and other useful documents.

Guidelines for selecting preferred highway routes for highway-route-controlled quantity shipments of radioactive materials

International Nuclear Information System (INIS)

1989-01-01

The document presents guidelines for use by State officials in selecting preferred routes for highway route controlled quantity shipments of radioactive materials. A methodology for analyzing and comparing safety factors of alternative routes is described. Technical information on the impacts of radioactive material transportation needed to apply the methodology is also presented. Application of the methodology will identify the route (or set of routes) that minimizes the radiological impacts from shipments of these radioactive materials within a given State. Emphasis in the document is on practical application of the methodology. Some details of the derivation of the methods and data are presented in the appendices. All references in the body of the report can be found listed in the Bibliography (Appendix F)

The St. Ignatius Jesuit Retreat and Training Centre: Cultivating Ecological Awareness and Connection with the Earth

Science.gov (United States)

Groen, Janet

2017-01-01

This chapter focuses on the role of religiously based spirituality in cultivating environmental awareness and citizenship by examining an adult environmental education program offered at the Ignatius Jesuit Centre, a religious retreat center in Guelph, Canada.

Dynamic Routing of Short Transfer Baggage

DEFF Research Database (Denmark)

Clausen, Tommy; Pisinger, David

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

Design guidelines for rapid and simple context-aware mobile application development – an android case study

Directory of Open Access Journals (Sweden)

Hossein Shams

2015-11-01

Full Text Available Presenting a context-aware service and information is a key aspect of ubiquitous computing, but development of such applications is quite complicated. Context-aware applications should be able to obtain raw data fromsensors, create highlevel context information, detect the user’s situation, and adapt the behavior of the application to the recognized situation . These complexities caused to reduce the impact of context -awareness in mobile computing while sensors of smartphones have made huge potential for developing context aware mobile applications. In this paper, we explain some guidelines to overcome the existing obstacles by separating the context -aware application layers and make a loosely coupled connection between them. These guidelines will bring easy and rapid development, reusability of the code and flexibility for developers. Finally, we provide a case study example in the Android platform to demonstrate how the guidelines can be used in a real application.

En Route Care in Confined Spaces: Impact of Transport, Immobilization Practices, Space Constraints, and Medical Awareness Enhancements

Science.gov (United States)

2017-10-01

physical space , ergonomics , and enhancement of medical awareness. Outcomes of the project will provide significant information and tools that can be...This group of research projects was designed to look at various aspects of transport, immobilization, optimal physical space , ergonomics , and...Devereux, J. 2002. The nature of work -related neck and upper limb musculoskeletal disorders. Applied Ergonomics . 33(3): 207-17. Chaffin, D.B

Mining Data from Interactions with a Motivational-Aware Tutoring System Using Data Visualization

Science.gov (United States)

Rebolledo-Mendez, Genaro; Du Boulay, Benedict; Luckin, Rosemary; Benitez-Guerrero, Edgard Ivan

2013-01-01

Tutoring systems are a common tool for delivering educational content and recent advances in this field include the detection of and reaction to learners' motivation. A data set derived from interactions in a tutoring system and its motivationally-aware variant provided opportunities to discover patterns of behavior in connection with motivational…

Reliability-Aware Cooperative Node Sleeping and Clustering in Duty-Cycled Sensors Networks

Directory of Open Access Journals (Sweden)

Jeungeun Song

2018-01-01

Full Text Available Duty-cycled sensor networks provide a new perspective for improvement of energy efficiency and reliability assurance of multi-hop cooperative sensor networks. In this paper, we consider the energy-efficient cooperative node sleeping and clustering problems in cooperative sensor networks where clusters of relay nodes jointly transmit sensory data to the next hop. Our key idea for guaranteeing reliability is to exploit the on-demand number of cooperative nodes, facilitating the prediction of personalized end-to-end (ETE reliability. Namely, a novel reliability-aware cooperative routing (RCR scheme is proposed to select k-cooperative nodes at every hop (RCR-selection. After selecting k cooperative nodes at every hop, all of the non-cooperative nodes will go into sleep status. In order to solve the cooperative node clustering problem, we propose the RCR-based optimal relay assignment and cooperative data delivery (RCR-delivery scheme to provide a low-communication-overhead data transmission and an optimal duty cycle for a given number of cooperative nodes when the network is dynamic, which enables part of cooperative nodes to switch into idle status for further energy saving. Through the extensive OPNET-based simulations, we show that the proposed scheme significantly outperforms the existing geographic routing schemes and beaconless geographic routings in wireless sensor networks with a highly dynamic wireless channel and controls energy consumption, while ETE reliability is effectively guaranteed.

Strategies for Selecting Routes through Real-World Environments: Relative Topography, Initial Route Straightness, and Cardinal Direction.

Directory of Open Access Journals (Sweden)

Tad T Brunyé

Full Text Available Previous research has demonstrated that route planners use several reliable strategies for selecting between alternate routes. Strategies include selecting straight rather than winding routes leaving an origin, selecting generally south- rather than north-going routes, and selecting routes that avoid traversal of complex topography. The contribution of this paper is characterizing the relative influence and potential interactions of these strategies. We also examine whether individual differences would predict any strategy reliance. Results showed evidence for independent and additive influences of all three strategies, with a strong influence of topography and initial segment straightness, and relatively weak influence of cardinal direction. Additively, routes were also disproportionately selected when they traversed relatively flat regions, had relatively straight initial segments, and went generally south rather than north. Two individual differences, extraversion and sense of direction, predicted the extent of some effects. Under real-world conditions navigators indeed consider a route's initial straightness, cardinal direction, and topography, but these cues differ in relative influence and vary in their application across individuals.

MANETS and Internet of Things: The Development of a Data Routing Algorithm

Directory of Open Access Journals (Sweden)

I. A. Alameri

2018-02-01

Full Text Available Internet of things (IoT, is an innovative technology which allows the connection of physical things with the digital world through the use of heterogeneous networks and communication technologies. IoT in smart environments interacts with wireless sensor network (WSN and mobile ad‐hoc network (MANET, becoming even more attractive and economically successful. Interaction between wireless sensor and mobile ad‐hoc networks with the internet of things allows the creation of a new MANET‐IoT systems and IT‐based networks. Such systems give the user greater mobility and reduce costs. At the same time new challenging issues are opened in networking aspects. In this work, author proposed a routing solution for the IoT system using a combination of MANET protocols and WSN routing principles. The presented results of solution's investigation provide an effective approach to efficient energy consumption in the global MANET‐IoT system. That is a step forward to a reliable provision of services over global future internet infrastructure.

Impact of Radio Link Unreliability on the Connectivity of Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Gorce Jean-Marie

2007-01-01

Full Text Available Many works have been devoted to connectivity of ad hoc networks. This is an important feature for wireless sensor networks (WSNs to provide the nodes with the capability of communicating with one or several sinks. In most of these works, radio links are assumed ideal, that is, with no transmission errors. To fulfil this assumption, the reception threshold should be high enough to guarantee that radio links have a low transmission error probability. As a consequence, all unreliable links are dismissed. This approach is suboptimal concerning energy consumption because unreliable links should permit to reduce either the transmission power or the number of active nodes. The aim of this paper is to quantify the contribution of unreliable long hops to an increase of the connectivity of WSNs. In our model, each node is assumed to be connected to each other node in a probabilistic manner. Such a network is modeled as a complete random graph, that is, all edges exist. The instantaneous node degree is then defined as the number of simultaneous valid single-hop receptions of the same message, and finally the mean node degree is computed analytically in both AWGN and block-fading channels. We show the impact on connectivity of two MACs and routing parameters. The first one is the energy detection level such as the one used in carrier sense mechanisms. The second one is the reliability threshold used by the routing layer to select stable links only. Both analytic and simulation results show that using opportunistic protocols is challenging.

Impact of Radio Link Unreliability on the Connectivity of Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jean-Marie Gorce

2007-06-01

Full Text Available Many works have been devoted to connectivity of ad hoc networks. This is an important feature for wireless sensor networks (WSNs to provide the nodes with the capability of communicating with one or several sinks. In most of these works, radio links are assumed ideal, that is, with no transmission errors. To fulfil this assumption, the reception threshold should be high enough to guarantee that radio links have a low transmission error probability. As a consequence, all unreliable links are dismissed. This approach is suboptimal concerning energy consumption because unreliable links should permit to reduce either the transmission power or the number of active nodes. The aim of this paper is to quantify the contribution of unreliable long hops to an increase of the connectivity of WSNs. In our model, each node is assumed to be connected to each other node in a probabilistic manner. Such a network is modeled as a complete random graph, that is, all edges exist. The instantaneous node degree is then defined as the number of simultaneous valid single-hop receptions of the same message, and finally the mean node degree is computed analytically in both AWGN and block-fading channels. We show the impact on connectivity of two MACs and routing parameters. The first one is the energy detection level such as the one used in carrier sense mechanisms. The second one is the reliability threshold used by the routing layer to select stable links only. Both analytic and simulation results show that using opportunistic protocols is challenging.

Factors Affecting Mobile Tagging Awareness; A Research on Social Media Consumers

Directory of Open Access Journals (Sweden)

Kübra DALDAL

2014-12-01

Full Text Available The purpose of the study is to identify the factors affecting awareness of mobile tagging on social media. The study assumes that the mobile tagging awareness levels of social media consumers are high. As a result of the literature review made in the scope of the purpose and assumption of the study, it was identified that the variables used in the measurement of brand awareness levels are recognition, remembering, being first in remembering, brand dominance, brand knowledge and brand opinion. A conceptual model showing the relation between these variables and mobile tagging awareness levels of social media consumers and hypotheses connected to this model were developed and a survey form, loyal to the relevant literature, was prepared in order to obtain the data necessary for the analyses. The universe of the study covers the consumers who are members of social media sites Facebook, Twitter and Linked In. For the analysis of the data obtained as a result of the survey conducted, descriptive statistics containing percentages and frequencies, factor analysis and Pearson’s Correlation Coefficient was used in the analysis of the hypotheses.

Routing and scheduling problems

DEFF Research Database (Denmark)

Reinhardt, Line Blander

couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company......, 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...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...

Risk assessment of alternative proliferation routes

International Nuclear Information System (INIS)

Ahmed, S.; Husseiny, A.A.

1982-01-01

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

Traffic Congestion Detection System through Connected Vehicles and Big Data

OpenAIRE

Néstor Cárdenas-Benítez; Raúl Aquino-Santos; Pedro Magaña-Espinoza; José Aguilar-Velazco; Arthur Edwards-Block; Aldo Medina Cass

2016-01-01

This article discusses the simulation and evaluation of a traffic congestion detection system which combines inter-vehicular communications, fixed roadside infrastructure and infrastructure-to-infrastructure connectivity and big data. The system discussed in this article permits drivers to identify traffic congestion and change their routes accordingly, thus reducing the total emissions of CO2 and decreasing travel time. This system monitors, processes and stores large amounts of data, which ...

Transportation Routing Analysis Geographic Information System -- TRAGIS, progress on improving a routing tool

International Nuclear Information System (INIS)

Johnson, P.E.; Lester, P.B.

1998-05-01

The Transportation Routing Analysis Geographic Information System (TRAGIS) model provides a useful tool to calculate and analyze transportation routes for radioactive materials within the continental US. This paper outlines some of the features available in this model

Optimising social information by game theory and ant colony method to enhance routing protocol in opportunistic networks

Directory of Open Access Journals (Sweden)

Chander Prabha

2016-09-01

Full Text Available The data loss and disconnection of nodes are frequent in the opportunistic networks. The social information plays an important role in reducing the data loss because it depends on the connectivity of nodes. The appropriate selection of next hop based on social information is critical for improving the performance of routing in opportunistic networks. The frequent disconnection problem is overcome by optimising the social information with Ant Colony Optimization method which depends on the topology of opportunistic network. The proposed protocol is examined thoroughly via analysis and simulation in order to assess their performance in comparison with other social based routing protocols in opportunistic network under various parameters settings.

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.

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

DEFF Research Database (Denmark)

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

2013-01-01

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

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

Highway route controlled quantity shipment routing reports - An overview

International Nuclear Information System (INIS)

Cashwell, J.W.; Welles, B.W.; Welch, M.J.

1989-01-01

US Department of Transportation (DOT) regulations require a postnotification report from the shipper for all shipments of radioactive materials categorized as a Highway Route Controlled Quantity. These postnotification reports, filed in compliance with 49 CFR 172.203(d), have been compiled by the DOT in a database known as the Radioactive Materials Routing Report (RAMRT) since 1982. The data were sorted by each of its elements to establish historical records and trends of Highway Route Controlled Quantity shipments from 1982 through 1987. Approximately 1520 records in the RAMRT database were compiled for this analysis. Approximately half of the shipments reported for the study period were from the US Department of Energy (DOE) and its contractors, with the others being commercial movements. Two DOE installations, EG and G Idaho and Oak Ridge, accounted for nearly half of the DOE activities. Similarly, almost half of the commercial movements were reported by two vendors, Nuclear Assurance Corporation and Transnuclear, Incorporated. Spent fuel from power and research reactors accounted for approximately half of all shipments

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

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

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2017-02-01

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

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

Directory of Open Access Journals (Sweden)

Srinivas Kanakala

2014-01-01

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

Route-specific analysis for radioactive materials transportation

International Nuclear Information System (INIS)

1986-01-01

This report addresses a methodology for route-specific analysis, of which route-selection is one aspect. Identification and mitigation of specific hazards along a chosen route is another important facet of route-specific analysis. Route-selection and route-specific mitigation are two tools to be used in minimizing the risk of radioactive materials transportation and promoting public confidence. Other tools exist to improve the safety of transportation under the Nuclear Waste Policy Act. Selection of a transportation mode and other, non-route-specific measures, such as improved driver training and improved cask designs, are additional tools to minimize transportation risk and promote public confidence. This report addresses the route-specific analysis tool and does not attempt to evaluate its relative usefulness as compared to other available tools. This report represents a preliminary attempt to develop a route-specific analysis methodlogy. The Western Interstate Energy Board High-Level Waste Committee has formed a Route-Specific Analysis Task Force which will build upon the methodology proposed in this Staff Report. As western states continue to investigate route-specific analysis issues, it is expected that the methodology will evolve into a more refined product representing the views of a larger group of interested parties in the West

Enhancing Evacuation Plans with a Situation Awareness System Based on End-User Knowledge Provision

Directory of Open Access Journals (Sweden)

Augusto Morales

2014-06-01

Full Text Available Recent disasters have shown that having clearly defined preventive procedures and decisions is a critical component that minimizes evacuation hazards and ensures a rapid and successful evolution of evacuation plans. In this context, we present our Situation-Aware System for enhancing Evacuation Plans (SASEP system, which allows creating end-user business rules that technically support the specific events, conditions and actions related to evacuation plans. An experimental validation was carried out where 32 people faced a simulated emergency situation, 16 of them using SASEP and the other 16 using a legacy system based on static signs. From the results obtained, we compare both techniques and discuss in which situations SASEP offers a better evacuation route option, confirming that it is highly valuable when there is a threat in the evacuation route. In addition, a study about user satisfaction using both systems is presented showing in which cases the systems are assessed as satisfactory, relevant and not frustrating.

Bellman Ford algorithm - in Routing Information Protocol (RIP)

Science.gov (United States)

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

2018-04-01

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

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

Directory of Open Access Journals (Sweden)

Xuhao Zhang

2014-01-01

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

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

Directory of Open Access Journals (Sweden)

Thirumoorthy Palanisamy

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

Making a personal connection in the medical interview.

Science.gov (United States)

Sessions, Donald G

2009-01-01

The medical interview is an access point for contacting patients at the core of their being. Patients with concernfull medical problems initially and unreflectively grasp these conflicted situations directly in terms of their meaning for the self. The situation and the self can become fused transparently. Physicians can facilitate patients awareness of their core self which is separate from their medical issue, by creating an opportunity for patients to experience the core of being that they mutually share. In the medical interview the possibility of making a personal connection with the patient is already present in the context of the presupposed shared history of a caring relationship between patients and physicians. The physician's gift of presence, of riveted attention and silence as the patient describes her concerns, can create an opening for awareness of their mutual involvement in a common web of concerns at a profound level. Being attuned initially can be reinforced by attending to perceptual domains. The hearing that listens and the seeing that can result in vision can allow for inspiration. Touching with gentleness is a primal mode of knowing and understanding. Words themselves can have great salutary power. Who has not wondered at the "tingle" that occurs during the reading of a powerful poem? What if you do make a personal connection with patients? What if you don't? Even though there is little scientific evidence or statistics to ground the assertion that there is value in a profound relationship I maintain that it is a way to follow the path you have chosen. It is the distinction between a job and a calling. It also lightens the burden we carry in our continual conflict with the increasing pressure of technology, third parties, and the other which is 'other.' Making a personal connection with patients is not about the "trickle down" of humanity from physicians to patients. Personal connection is inspiring to physicians and patients and enlightening

Mission Command in the Age of Network-Enabled Operations: Social Network Analysis of Information Sharing and Situation Awareness.

Science.gov (United States)

Buchler, Norbou; Fitzhugh, Sean M; Marusich, Laura R; Ungvarsky, Diane M; Lebiere, Christian; Gonzalez, Cleotilde

2016-01-01

A common assumption in organizations is that information sharing improves situation awareness and ultimately organizational effectiveness. The sheer volume and rapid pace of information and communications received and readily accessible through computer networks, however, can overwhelm individuals, resulting in data overload from a combination of diverse data sources, multiple data formats, and large data volumes. The current conceptual framework of network enabled operations (NEO) posits that robust networking and information sharing act as a positive feedback loop resulting in greater situation awareness and mission effectiveness in military operations (Alberts and Garstka, 2004). We test this assumption in a large-scale, 2-week military training exercise. We conducted a social network analysis of email communications among the multi-echelon Mission Command staff (one Division and two sub-ordinate Brigades) and assessed the situational awareness of every individual. Results from our exponential random graph models challenge the aforementioned assumption, as increased email output was associated with lower individual situation awareness. It emerged that higher situation awareness was associated with a lower probability of out-ties, so that broadly sending many messages decreased the likelihood of attaining situation awareness. This challenges the hypothesis that increased information sharing improves situation awareness, at least for those doing the bulk of the sharing. In addition, we observed two trends that reflect a compartmentalizing of networked information sharing as email links were more commonly formed among members of the command staff with both similar functions and levels of situation awareness, than between two individuals with dissimilar functions and levels of situation awareness; both those findings can be interpreted to reflect effects of homophily. Our results have major implications that challenge the current conceptual framework of NEO. In

Predicting transportation routes for radioactive wastes

International Nuclear Information System (INIS)

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

1981-01-01

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

RSRP: A Robust Secure Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Sinha Ditipriya

2014-05-01

Full Text Available In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs. This algorithm is based on some basic schemes such as RSA_CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR, secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

Human risk assessment of dermal and inhalation exposures to chemicals assessed by route-to-route extrapolation: the necessity of kinetic data.

Science.gov (United States)

Geraets, Liesbeth; Bessems, Jos G M; Zeilmaker, Marco J; Bos, Peter M J

2014-10-01

In toxicity testing the oral route is in general the first choice. Often, appropriate inhalation and dermal toxicity data are absent. Risk assessment for these latter routes usually has to rely on route-to-route extrapolation starting from oral toxicity data. Although it is generally recognized that the uncertainties involved are (too) large, route-to-route extrapolation is applied in many cases because of a strong need of an assessment of risks linked to a given exposure scenario. For an adequate route-to-route extrapolation the availability of at least some basic toxicokinetic data is a pre-requisite. These toxicokinetic data include all phases of kinetics, from absorption (both absorbed fraction and absorption rate for both the starting route and route of interest) via distribution and biotransformation to excretion. However, in practice only differences in absorption between the different routes are accounted for. The present paper demonstrates the necessity of route-specific absorption data by showing the impact of its absence on the uncertainty of the human health risk assessment using route-to-route extrapolation. Quantification of the absorption (by in vivo, in vitro or in silico methods), particularly for the starting route, is considered essential. Copyright © 2014 Elsevier Inc. All rights reserved.

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

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.

Quantized Visual Awareness

Directory of Open Access Journals (Sweden)

W Alexander Escobar

2013-11-01

Full Text Available The proposed model holds that, at its most fundamental level, visual awareness is quantized. That is to say that visual awareness arises as individual bits of awareness through the action of neural circuits with hundreds to thousands of neurons in at least the human striate cortex. Circuits with specific topologies will reproducibly result in visual awareness that correspond to basic aspects of vision like color, motion and depth. These quanta of awareness (qualia are produced by the feedforward sweep that occurs through the geniculocortical pathway but are not integrated into a conscious experience until recurrent processing from centers like V4 or V5 select the appropriate qualia being produced in V1 to create a percept. The model proposed here has the potential to shift the focus of the search for visual awareness to the level of microcircuits and these likely exist across the kingdom Animalia. Thus establishing qualia as the fundamental nature of visual awareness will not only provide a deeper understanding of awareness, but also allow for a more quantitative understanding of the evolution of visual awareness throughout the animal kingdom.

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.

Alarm Fatigue vs User Expectations Regarding Context-Aware Alarm Handling in Hospital Environments Using CallMeSmart.

Science.gov (United States)

Solvoll, Terje; Arntsen, Harald; Hartvigsen, Gunnar

2017-01-01

Surveys and research show that mobile communication systems in hospital settings are old and cause frequent interruptions. In the quest to remedy this, an Android based communication system called CallMeSmart tries to encapsulate most of the frequent communication into one hand held device focusing on reducing interruptions and at the same time make the workday easier for healthcare workers. The objective of CallMeSmart is to use context-awareness techniques to automatically monitor the availability of physicians' and nurses', and use this information to prevent or route phone calls, text messages, pages and alarms that would otherwise compromise patient care. In this paper, we present the results from interviewing nurses on alarm fatigue and their expectations regarding context-aware alarm handling using CallMeSmart.

Capacity Constrained Routing Algorithms for Evacuation Route Planning

National Research Council Canada - National Science Library

Lu, Qingsong; George, Betsy; Shekhar, Shashi

2006-01-01

.... In this paper, we propose a new approach, namely a capacity constrained routing planner which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints...

Deploying a Route Optimization EFB Application for Commercial Airline Operational Trials

Science.gov (United States)

Roscoe, David A.; Vivona, Robert A.; Woods, Sharon E.; Karr, David A.; Wing, David J.

2016-01-01

The Traffic Aware Planner (TAP), developed for NASA Langley Research Center to support the Traffic Aware Strategic Aircrew Requests (TASAR) project, is a flight-efficiency software application developed for an Electronic Flight Bag (EFB). Tested in two flight trials and planned for operational testing by two commercial airlines, TAP is a real-time trajectory optimization application that leverages connectivity with onboard avionics and broadband Internet sources to compute and recommend route modifications to flight crews to improve fuel and time performance. The application utilizes a wide range of data, including Automatic Dependent Surveillance Broadcast (ADS-B) traffic, Flight Management System (FMS) guidance and intent, on-board sensors, published winds and weather, and Special Use Airspace (SUA) schedules. This paper discusses the challenges of developing and deploying TAP to various EFB platforms, our solutions to some of these challenges, and lessons learned, to assist commercial software developers and hardware manufacturers in their efforts to implement and extend TAP functionality in their environments. EFB applications (such as TAP) typically access avionics data via an ARINC 834 Simple Text Avionics Protocol (STAP) server hosted by an Aircraft Interface Device (AID) or other installed hardware. While the protocol is standardized, the data sources, content, and transmission rates can vary from aircraft to aircraft. Additionally, the method of communicating with the AID may vary depending on EFB hardware and/or the availability of onboard networking services, such as Ethernet, WIFI, Bluetooth, or other mechanisms. EFBs with portable and installed components can be implemented using a variety of operating systems, and cockpits are increasingly incorporating tablet-based technologies, further expanding the number of platforms the application may need to support. Supporting multiple EFB platforms, AIDs, avionics datasets, and user interfaces presents a

Entanglement-Gradient Routing for Quantum Networks.

Science.gov (United States)

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

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

The pyramidal capacitated vehicle routing problem

DEFF Research Database (Denmark)

Lysgaard, Jens

2010-01-01

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

A multicast tree aggregation algorithm in wavelength-routed WDM networks

Science.gov (United States)

Cheng, Hsu-Chen; Kuo, Chin-Chun; Lin, Frank Y.

2005-02-01

Wavelength division multiplexing (WDM) has been considered a promising transmission technology in optical communication networks. With the continuous advance in optical technology, WDM network will play an important role in wide area backbone networks. Optical wavelength switching, compared with optical packet switching, is a more mature and more cost-effective choice for optical switching technologies. Besides, the technology of time division multiplexing in optical communication networks has been working smoothly for a long time. In the proposed research, the problem of multicast groups aggregation and multicast routing and wavelength assignment in wavelength-routed WDM network is studied. The optical cross connect switches in the problem are assumed to have limited optical multicast/splitting and TDM functionalities. Given the physical network topology and capacity, the objective is to maximize the total revenue by means of utmost merging multicast groups into larger macro-groups. The groups in the same macro-group will share a multicast tree to conduct data transmission. The problem is formulated as an optimization problem, where the objective function is to maximize the total revenue subject to capacity constraints of components in the optical network, wavelength continuity constraints, and tree topology constraints. The decision variables in the formulations include the merging results between groups, multicast tree routing assignment and wavelength assignment. The basic approach to the algorithm development for this model is Lagrangean relaxation in conjunction with a number of optimization techniques. In computational experiments, the proposed algorithms are evaluated on different network topologies and perform efficiently and effectively according to the experiment results.

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.

Road Routes for Waste Disposal - MDC_RecyclingRoute

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — 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...

Porcelain tiles by the dry route

International Nuclear Information System (INIS)

Melchiades, F. G.; Daros, M. T.; Boschi, A. O.

2010-01-01

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. (Author) 7 refs.

VANET Routing Protocols: Pros and Cons

OpenAIRE

Paul, Bijan; Ibrahim, Md.; Bikas, Md. Abu Naser

2012-01-01

VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol h...

Effect of exposure routes on the relationships of lethal toxicity to rats from oral, intravenous, intraperitoneal and intramuscular routes.

Science.gov (United States)

Ning, Zhong H; Long, Shuang; Zhou, Yuan Y; Peng, Zi Y; Sun, Yi N; Chen, Si W; Su, Li M; Zhao, Yuan H

2015-11-01

The lethal toxicity values (log 1/LD(50)) of 527 aliphatic and aromatic compounds in oral, intravenous, intramuscular and intraperitoneal routes were used to investigate the relationships of log 1/LD(50) from different exposure routes. Regression analysis shows that the log 1/LD(50) values are well correlated between intravenous and intraperitoneal or intramuscular injections. However, the correlations between oral and intravenous or intraperitoneal routes are relatively poor. Comparison of the average residuals indicates that intravenous injection is the most sensitive exposure route and oral administration is the least sensitive exposure route. This is attributed to the difference in kinetic process of toxicity testing. The toxic effect of a chemical can be similar or significantly different between exposure routes, depending on the absorption rates of chemicals into blood. Inclusion of hydrophobic parameter and fractions of ionic forms can improve the correlations between intravenous and intraperitoneal or oral routes, but not between intraperitoneal and oral routes. This is due to the differences of absorption rate in different exposure environments from different routes. Several factors, such as experimental uncertainty, metabolism and toxic kinetics, can affect the correlations between intravenous and intraperitoneal or oral routes. Copyright © 2015 Elsevier Inc. All rights reserved.

An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2015-11-01

Full Text Available Most applications of underwater wireless sensor networks (UWSNs demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV-aided efficient data-gathering (AEDG routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.

An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks.

Science.gov (United States)

Javaid, Nadeem; Ilyas, Naveed; Ahmad, Ashfaq; Alrajeh, Nabil; Qasim, Umar; Khan, Zahoor Ali; Liaqat, Tayyaba; Khan, Majid Iqbal

2015-11-17

Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.

Breadcrumbs: location and context aware mobile platform for story sharing

OpenAIRE

Dias, César Manuel Nascimento

2014-01-01

With the current proliferation of sensor equipped mobile devices such as smartphones and tablets, location aware services are expanding beyond the mere efficiency and work related needs of users, evolving in order to incorporate fun, culture and the social life of users. Today people on the move have more and more connectivity and are expected to be able to communicate with their usual and familiar social networks. That means communications not only with their peers and c...

Analysis of In-to-Out Wireless Body Area Network Systems: Towards QoS-Aware Health Internet of Things Applications

Directory of Open Access Journals (Sweden)

Yangzhe Liao

2016-07-01

Full Text Available In this paper, an analytical and accurate in-to-out (I2O human body path loss (PL model at 2.45 GHz is derived based on a 3D heterogeneous human body model under safety constraints. The bit error rate (BER performance for this channel using multiple efficient modulation schemes is investigated and the link budget is analyzed based on a predetermined satisfactory BER of 10−3. In addition, an incremental relay-based cooperative quality of service-aware (QoS-aware routing protocol for the proposed I2O WBAN is presented and compared with an existing scheme. Linear programming QoS metric expressions are derived and employed to maximize the network lifetime, throughput, minimizing delay. Results show that binary phase-shift keying (BPSK outperforms other modulation techniques for the proposed I2O WBAN systems, enabling the support of a 30 Mbps data transmission rate up to 1.6 m and affording more reliable communication links when the transmitter power is increased. Moreover, the proposed incremental cooperative routing protocol outperforms the existing two-relay technique in terms of energy efficiency. Open issues and on-going research within the I2O WBAN area are presented and discussed as an inspiration towards developments in health IoT applications.

Highway and interline transportation routing models

International Nuclear Information System (INIS)

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

1994-01-01

The potential impacts associated with the transportation of hazardous materials are important issues to shippers, carriers, and the general public. Since transportation routes are a central characteristic in most of these issues, the prediction of likely routes is the first step toward the resolution of these issues. In addition, US Department of Transportation requirements (HM-164) mandate specific routes for shipments of highway controlled quantities of radioactive materials. In response to these needs, two routing models have been developed at Oak Ridge National Laboratory under the sponsorship of the U.S. Department of Energy (DOE). These models have been designated by DOE's Office of Environmental Restoration and Waste Management, Transportation Management Division (DOE/EM) as the official DOE routing models. Both models, HIGHWAY and INTERLINE, are described

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

Science.gov (United States)

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

2015-01-01

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

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.

Geotechnical characterization through in situ and laboratory tests of several geological formations present in the route of the Future Fix Connection between Spain and Morocco through Gibraltar Strait; Caracterizacion geotecnica mediante ensayos in situ y de laboratorio de algunas formaciones geologicas presentes en la traza de la Futura Conexion Fija entre Espana y Marruecos a traves del estrecho de Gibraltar

Energy Technology Data Exchange (ETDEWEB)

Perucho Martinez, A.; Diez Torres, J. A.; Muniz Menendez, M.; Cano Linares, H.; Ruiz Fonticiella, J. M.

2015-07-01

CEDEX and SECEGSA (Sociedad Española para la Comunicación Fija a través del Estrecho de Gibraltar), Have been collaborating since a few decades ago to study different technical aspects related to the Fix Connection through the Gibraltar Strait, mainly in relation to the geological and geotechnical properties of the different formations present in the route. In order to do so, many studies of geotechnical characterization of materials, in situ and laboratory testing campaigns have been carried out. Furthermore, they have participated in some Expertise Committees carrying out some advice work related to studies performed by other organizations. This paper presents a brief description of the most relevant aspects of the main geological and geotechnical studies performed related to this Project of the Future Fix Connection and obtained through the study of SECEGSAs extensive data base. Moreover, it includes a synopsis of the geotechnical characterization carried out through in situ and laboratory tests on different Miocene and Eocene formations from the Algeciras Unit, present in the route of the future Fix Connection between Spain and gibraltar through the Gibraltar Strait. (Author)

Usefulness of bone window CT images parallel to the transnasal surgical route for pituitary disorders

International Nuclear Information System (INIS)

Abe, T.; Kunii, N.; Ikeda, H.; Izumiyama, H.; Asahina, N.

2003-01-01

Before operating on 130 patients with pituitary disorders, we evaluated their bone window CT images sliced parallel to the trans nasal surgical route to assess the surgical anatomy of the nasal cavity for trans nasal surgery. High resolution bone window CT was performed in 3- to 5-mm slices parallel to the imaginary line connecting the inferior margin of the piriform aperture and the top of the sellar floor, parallel to the trans nasal surgical route. This CT angle was useful in evaluating the width and depth of the operative hold, the bony components of the nasal conchas, deviation of the nasal septum, the bony structure and mucosa in the sphenoid sinus, and the condition of the sellar floor. In patients requiring repeat surgery, the location of thin or thick nasal mucosa, residual bony septum, and inadequate sellar floor opening were easily detected. Bone window CT images sliced parallel to the trans nasal surgical route provide direct visualization of the nasal anatomy for the trans nasal approach. This method is helpful in determining how far to remove the sellar floor laterally, especially in cases requiring repeat surgery. (author)

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

Directory of Open Access Journals (Sweden)

Nguyen Thanh Long

2015-02-01

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

Students multicultural awareness

Directory of Open Access Journals (Sweden)

F.I Soekarman

2016-12-01

Full Text Available Multicultural awareness is the foundation of communication and it involves the ability of standing back from ourselves and becoming aware of our cultural values, beliefs and perceptions. Multicultural awareness becomes central when we have to interact with people from other cultures. People see, interpret and evaluate things in a different ways. What is considered an appropriate behaviour in one culture is frequently inappropriate in another one. this research use descriptive- quantitative methodology to indentify level of students multicultural awareness specifically will be identified by gender and academic years. This research will identify multicultural awareness based on differences of gender, academic years. This research use random and purposive random sampling of 650 students from university. These studies identify of multicultural awareness 34, 11, 4% in high condition, 84, 1% medium and 4, 5% in low. Further, there is a significant difference in the level of multicultural awareness based on gender and academic year. These findings could not be generalized because of the limited sample and ethnicity; it should need a wider research so that can be generalized and recommended the efforts to development and improvement of multicultural awareness conditions for optimization the services.

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

Science.gov (United States)

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

2018-01-01

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

Children's route choice during active transportation to school: Difference between shortest and actual route

NARCIS (Netherlands)

Dessing, D.; Vries, S.I. de; Hegeman, G.; Verhagen, E.; 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

Route selection issues for NWPA shipments

International Nuclear Information System (INIS)

Hill, C.V.; Harrison, I.G.

1993-01-01

Questions surrounding the designation of routes for the movement of spent nuclear fuel (SNF) and high-level radioactive waste (HLW) by the Office of Civilian Radioactive Waste Management (OCRWM) have broad implications. Federal regulations prescribe rules to be applied in the selection of highway routes. In most cases, these rules will lead to a clear selection of one route between an origin and destination point. However, in other cases, strict application of the regulations does not result in a clear choice of a preferred route. The regulations also provide discretion to State governments and carriers to select alternative routes to enhance the safety of the shipment. Railroad shipments of radioactive materials are not subject to Federal routing regulations. Since the railroads operate on private property, it has been assumed that they know the best way to move freight on their system. This discretion, while desirable for addressing unique local safety concerns or for responding to temporary safety concerns such as road problems, weather conditions, or construction areas, leads to significant opportunity for misunderstandings and uneasiness on the part of local residents

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

Science.gov (United States)

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

2018-05-18

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

A Router Architecture for Connection-Oriented Service Guarantees in the MANGO Clockless Network-on-Chip

DEFF Research Database (Denmark)

Bjerregaard, Tobias; Sparsø, Jens

2005-01-01

On-chip networks for future system-on-chip designs need simple, high performance implementations. In order to promote system-level integrity, guaranteed services (GS) need to be provided. We propose a network-on-chip (NoC) router architecture to support this, and demonstrate with a CMOS standard...... cell design. Our implementation is based on clockless circuit techniques, and thus inherently supports a modular, GALS-oriented design flow. Our router exploits virtual channels to provide connection-oriented GS, as well as connection-less best-effort (BE) routing. The architecture is highly flexible...

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,

A Smart Home Gateway Platform for Data Collection and Awareness

OpenAIRE

Wang, Pan; Ye, Feng; Chen, Xuejiao

2018-01-01

Smart homes have attracted much attention due to the expanding of Internet-of-Things (IoT) and smart devices. In this paper, we propose a smart gateway platform for data collection and awareness in smart home networks. A smart gateway will replace the traditional network gateway to connect the home network and the Internet. A smart home network supports different types of smart devices, such as in home IoT devices, smart phones, smart electric appliances, etc. A traditional network gateway is...

En Route Descent Advisor Multi-Sector Planning Using Active and Provisional Controller Plans

Science.gov (United States)

Vivona, Robert; Green, Steven

2003-01-01

As decision support tools are developed to support controllers in complex air traffic control environments, new approaches to maintaining situation awareness and managing traffic planning must be developed to handle the ever-increasing amounts of alerting and advisory data. Within high-density metering and other environments where flight path changes are the rule, not the exception, and where interactions between these changes are required, current trial planning approaches are limited by potential increases in workload. The Enroute Descent Advisor (EDA) is a set of decision support tool capabilities for managing high-density en route traffic subject to metering restrictions. The EDA system s novel approach builds aircraft plans from combinations of user intent data and builds controller plans from combinations of aircraft plans to effectively maintain situation awareness during traffic planning. By maintaining both active (current) and provisional (proposed) controller plans, EDA supports controllers in coordinated traffic planning both within and between sectors. Ultimately, EDA s multi-sector planning approach will facilitate a transition from current sector-oriented operations to a new trajectory-oriented paradigm, enabling new levels of efficiency and collaboration in air traffic control.

The QKD network: model and routing scheme

Science.gov (United States)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn't address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.

Environmental factors along the Northern Sea Route

International Nuclear Information System (INIS)

Fjeld, P.E.

1993-01-01

The Northern Sea Route runs ca 5,600 nautical miles across the top of Russia from Murmansk to Vladivostok, and includes half of the Arctic basin. An environmental impact assessment is needed for this route because of the potential for commercial shipping to disturb the vulnerable Arctic environment along the route. For example, Russian development of oil and gas resources in the area served by the route is expected to rise dramatically in the near future. Drilling in the route area offshore has already begun, and potential blowouts or tanker spills are of concern. A pilot study on the environment along this route was conducted in 1990/91, focusing on a study of the literature and communications with Russian scientists working on Arctic ecology. Existing data seem to be insufficient and generally only cover the westernmost and easternmost parts of the route. A five-year research plan is proposed to provide an inventory of Arctic species in the route area and levels of contaminants present, to assess the environmental sensitivity of the area, and analyze impacts that increased shipping might have on the environment. Protection measures will also be suggested. 1 fig

Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs

Directory of Open Access Journals (Sweden)

Eun-Seok Cho

2017-10-01

Full Text Available Face routing has been adopted in wireless sensor networks (WSNs where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, and messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.

CAN Tree Routing for Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao LI

2014-01-01

Full Text Available We propose a novel topology to improve the routing performance of Content- Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree by means of equipping each node with a few long links towards some distant nodes. The long links enhance routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is O(log n, which is much better than a uniform greedy routing, while each node maintains two long links in average.

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.

Route planning algorithms: Planific@ Project

Directory of Open Access Journals (Sweden)

Gonzalo Martín Ortega

2009-12-01

Full Text Available Planific@ is a route planning project for the city of Madrid (Spain. Its main aim is to develop an intelligence system capable of routing people from one place in the city to any other using the public transport. In order to do this, it is necessary to take into account such things as: time, traffic, user preferences, etc. Before beginning to design the project is necessary to make a comprehensive study of the variety of main known route planning algorithms suitable to be used in this project.

What happens in an estuary doesn't stay there: patterns of biotic connectivity resulting from long term ecological research

Science.gov (United States)

Mather, Martha E.; Finn, John T.; Kennedy, Christina G.; Deegan, Linda A.; Smith, Joseph M.

2013-01-01

The paucity of data on migratory connections and an incomplete understanding of how mobile organisms use geographically separate areas have been obstacles to understanding coastal dynamics. Research on acoustically tagged striped bass (Morone saxatilis) at the Plum Island Ecosystems (PIE) Long Term Ecological Research site, Massachusetts, documents intriguing patterns of biotic connectivity (i.e., long-distance migration between geographically distinct areas). First, the striped bass tagged at PIE migrated southward along the coast using different routes. Second, these tagged fish exhibited strong fidelity and specificity to PIE. For example, across multiple years, tagged striped bass resided in PIE waters for an average of 1.5-2.5 months per year (means: 51-72 days; range 2-122 days), left this estuary in fall, then returned in subsequent years. Third, this specificity and fidelity connected PIE to other locations. The fish exported nutrients and energy to at least three other coastal locations through biomass added as growth. These results demonstrate that what happens in an individual estuary can affect other estuaries. Striped bass that use tightly connected routes to feed in specific estuaries should have greater across-system impacts than fish that are equally likely to go anywhere. Consequently, variations in when, where, and how fish migrate can alter across-estuary impacts.

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.

Comparing genetic algorithm and particle swarm optimization for solving capacitated vehicle routing problem

Science.gov (United States)

Iswari, T.; Asih, A. M. S.

2018-04-01

In the logistics system, transportation plays an important role to connect every element in the supply chain, but it can produces the greatest cost. Therefore, it is important to make the transportation costs as minimum as possible. Reducing the transportation cost can be done in several ways. One of the ways to minimizing the transportation cost is by optimizing the routing of its vehicles. It refers to Vehicle Routing Problem (VRP). The most common type of VRP is Capacitated Vehicle Routing Problem (CVRP). In CVRP, the vehicles have their own capacity and the total demands from the customer should not exceed the capacity of the vehicle. CVRP belongs to the class of NP-hard problems. These NP-hard problems make it more complex to solve such that exact algorithms become highly time-consuming with the increases in problem sizes. Thus, for large-scale problem instances, as typically found in industrial applications, finding an optimal solution is not practicable. Therefore, this paper uses two kinds of metaheuristics approach to solving CVRP. Those are Genetic Algorithm and Particle Swarm Optimization. This paper compares the results of both algorithms and see the performance of each algorithm. The results show that both algorithms perform well in solving CVRP but still needs to be improved. From algorithm testing and numerical example, Genetic Algorithm yields a better solution than Particle Swarm Optimization in total distance travelled.

Aircraft route forecasting under adverse weather conditions

Directory of Open Access Journals (Sweden)

Thomas Hauf

2017-04-01

Full Text Available In this paper storm nowcasts in the terminal manoeuvring area (TMA of Hong Kong International Airport are used to forecast deviation routes through a field of storms for arriving and departing aircraft. Storms were observed and nowcast by the nowcast system SWIRLS from the Hong Kong Observatory. Storms were considered as no-go zones for aircraft and deviation routes were determined with the DIVSIM software package. Two days (21 and 22 May 2011 with 22 actual flown routes were investigated. Flights were simulated with a nowcast issued at the time an aircraft entered the TMA or departed from the airport. These flights were compared with a posteriori simulations, in which all storm fields were known and circumnavigated. Both types of simulated routes were then compared with the actual flown routes. The qualitative comparison of the various routes revealed generally good agreement. Larger differences were found in more complex situations with many active storms in the TMA. Route differences resulted primarily from air traffic control measures imposed such as holdings, slow-downs and shortcuts, causing the largest differences between the estimated and actual landing time. Route differences could be enhanced as aircraft might be forced to circumnavigate a storm ahead in a different sense. The use of route forecasts to assist controllers coordinating flights in a complex moving storm field is discussed. The study emphasises the important application of storm nowcasts in aviation meteorology.

An analysis of the awareness and performance of radiation workers' radiation/radioactivity protection in medical institutions : Focused on Busan regional medical institutions

International Nuclear Information System (INIS)

Park, Cheol Koo; Hwang, Chul Hwan; Kim, Dong Hyun

2017-01-01

The purpose of this study was to investigate safety management awareness and behavioral investigation of radiation/radioactivity performance defenses of radiation workers' in medical institutions. Data collection consisted of 267 radiation workers working in medical institutions using structured questionnaires. As a result, it was analyzed that radiation safety management awareness and performance were high in 40s, 50s group and higher education group. The analysis according to the radiation safety management knowledge was analyzed that the 'Know very well' group had higher scores on awareness and performance scores. The analysis according to the degree of safety management effort showed the high awareness scale and the performance scale in the group 'Receiving various education or studying the safety management contents through book'. The correlations between the sub-factors showed the highest positive correlation between perceived practician and personal perspective and perceived by patient and patient's caretaker perspective. Therefore, radiation safety management for workers, patients, and patient's caretaker should be conducted through continuous education of radiation safety management through various routes of radiation workers working at medical institutions

Direct modulation of aberrant brain network connectivity through real-time NeuroFeedback.

Science.gov (United States)

Ramot, Michal; Kimmich, Sara; Gonzalez-Castillo, Javier; Roopchansingh, Vinai; Popal, Haroon; White, Emily; Gotts, Stephen J; Martin, Alex

2017-09-16

The existence of abnormal connectivity patterns between resting state networks in neuropsychiatric disorders, including Autism Spectrum Disorder (ASD), has been well established. Traditional treatment methods in ASD are limited, and do not address the aberrant network structure. Using real-time fMRI neurofeedback, we directly trained three brain nodes in participants with ASD, in which the aberrant connectivity has been shown to correlate with symptom severity. Desired network connectivity patterns were reinforced in real-time, without participants' awareness of the training taking place. This training regimen produced large, significant long-term changes in correlations at the network level, and whole brain analysis revealed that the greatest changes were focused on the areas being trained. These changes were not found in the control group. Moreover, changes in ASD resting state connectivity following the training were correlated to changes in behavior, suggesting that neurofeedback can be used to directly alter complex, clinically relevant network connectivity patterns.

Direct modulation of aberrant brain network connectivity through real-time NeuroFeedback

Science.gov (United States)

Kimmich, Sara; Gonzalez-Castillo, Javier; Roopchansingh, Vinai; Popal, Haroon; White, Emily; Gotts, Stephen J; Martin, Alex

2017-01-01

The existence of abnormal connectivity patterns between resting state networks in neuropsychiatric disorders, including Autism Spectrum Disorder (ASD), has been well established. Traditional treatment methods in ASD are limited, and do not address the aberrant network structure. Using real-time fMRI neurofeedback, we directly trained three brain nodes in participants with ASD, in which the aberrant connectivity has been shown to correlate with symptom severity. Desired network connectivity patterns were reinforced in real-time, without participants’ awareness of the training taking place. This training regimen produced large, significant long-term changes in correlations at the network level, and whole brain analysis revealed that the greatest changes were focused on the areas being trained. These changes were not found in the control group. Moreover, changes in ASD resting state connectivity following the training were correlated to changes in behavior, suggesting that neurofeedback can be used to directly alter complex, clinically relevant network connectivity patterns. PMID:28917059

Transport Routes Optimization Model Through Application of Fuzzy Logic

Directory of Open Access Journals (Sweden)

Ivan Bortas

2018-03-01

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

SIMULATION AND ANALYSIS OF GREEDY ROUTING PROTOCOL IN VIEW OF ENERGY CONSUMPTION AND NETWORK LIFETIME IN THREE DIMENSIONAL UNDERWATER WIRELESS SENSOR NETWORK

Directory of Open Access Journals (Sweden)

SHEENA KOHLI

2017-11-01

Full Text Available Underwater Wireless Sensor Network (UWSN comprises of a number of miniature sized sensing devices deployed in the sea or ocean, connected by dint of acoustic links to each other. The sensors trap the ambient conditions and transmit the data from one end to another. For transmission of data in any medium, routing protocols play a crucial role. Moreover, being battery limited, an unavoidable parameter to be considered in operation and analysis of protocols is the network energy and the network lifetime. The paper discusses the greedy routing protocol for underwater wireless sensor networks. The simulation of this routing protocol also takes into consideration the characteristics of acoustic communication like attenuation, transmission loss, signal to noise ratio, noise, propagation delay. The results from these observations may be used to construct an accurate underwater communication model.

Roles of Metalinguistic Awareness and Academic Extensive Reading in the Development of EFL/ESL Academic Writing Skills

Directory of Open Access Journals (Sweden)

Grace H. Wang

2013-11-01

Full Text Available This paper argues that the development of academic writing proficiency may require both explicit metalinguistic awareness (MA and extensive reading (ER of academic texts. Specifically, it argues that: (a there may be a connection between explicit MA and the development of writing skills; (b there is a connection between ER and the development of writing skills, but academic ER may be required for development of academic writing skills; (c there may be a connection between explicit MA and the development of reading skills, which may be exploited for the development of academic ER skills, which in turn supports the development of academic writing skills.

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

Using corporate governance to enhance 'long-term situation awareness' and assist in the avoidance of organisation-induced disasters.

Science.gov (United States)

Siemieniuch, C E; Sinclair, M A

2008-03-01

This paper considers the issue of how corporate governance can and should deal with the long-term understanding of systems health-what we may call 'long-term situation awareness' (i.e. which evolves and is coherent over time) for organisational systems (and their component sub systems) in the engineering domain. Many characteristics affect long-term situation awareness-the rate of change to processes, pressures for greater efficiency from existing resources, changes in personnel, cultural changes and changes to the operational environment of the organisational systems. Many disasters (e.g. Chernobyl, Flixborough, Piper Alpha) have a causal path that indicates a loss of group situation awareness, over a long period of time. The problem of the gradual, slow drift over many years towards unsafe conduct of company operations is discussed and examples of possible consequences provided. A 'parable' from the world of manufacturing is used to exemplify the problem. The paper goes on to discuss some ways by which this problem could be addressed and longer-term system situational awareness increased; essentially by good corporate governance, knowledge management and ownership of processes. Links are made to the literature on these topics, and a route map to help organisations to gain the benefits is offered.

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

Routing Data Authentication in Wireless Networks; TOPICAL

International Nuclear Information System (INIS)

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

2001-01-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

Ebola Virus Infection among Western Healthcare Workers Unable to Recall the Transmission Route

Directory of Open Access Journals (Sweden)

Stefano Petti

2016-01-01

Full Text Available Introduction. During the 2014–2016 West-African Ebola virus disease (EVD outbreak, some HCWs from Western countries became infected despite proper equipment and training on EVD infection prevention and control (IPC standards. Despite their high awareness toward EVD, some of them could not recall the transmission routes. We explored these incidents by recalling the stories of infected Western HCWs who had no known directly exposures to blood/bodily fluids from EVD patients. Methodology. We carried out conventional and unconventional literature searches through the web using the keyword “Ebola” looking for interviews and reports released by the infected HCWs and/or the healthcare organizations. Results. We identified fourteen HCWs, some infected outside West Africa and some even classified at low EVD risk. None of them recalled accidents, unintentional exposures, or any IPC violation. Infection transmission was thus inexplicable through the acknowledged transmission routes. Conclusions. We formulated two hypotheses: inapparent exposures to blood/bodily fluids or transmission due to asymptomatic/mildly symptomatic carriers. This study is in no way intended to be critical with the healthcare organizations which, thanks to their interventions, put an end to a large EVD outbreak that threatened the regional and world populations.

Inferring sediment connectivity from high-resolution DEMs of Difference

Science.gov (United States)

Heckmann, Tobias; Vericat, Damià

2017-04-01

Topographic changes due to the erosion and deposition of bedrock, sediments and soil can be measured by differencing Digital Elevation Models (DEM) acquired at different points in time. So-called morphological sediment budgets can be computed from such DEMs of Difference (DoD) on an areal rather than a point basis. The advent of high-resolution and highly accurate surveying techniques (e.g. LiDAR, SfM), together with recent advances of survey platforms (e.g. UaVs) provides opportunities to improve the spatial and temporal scale (in terms of extent and resolution), the availability and quality of such measurements. Many studies have used DoD to investigate and interpret the spatial pattern of positive and negative vertical differences in terms of erosion and deposition, or of horizontal movement. Vertical differences can be converted to volumes, and negative (erosion) and positive (deposition) volumetric changes aggregated for spatial units (e.g., landforms, hillslopes, river channels) have been used to compute net balances. We argue that flow routing algorithms common in digital terrain analysis provide a means to enrich DoD-based investigations with some information about (potential) sediment pathways - something that has been widely neglected in previous studies. Where the DoD indicates a positive surface change, flow routing delineates the upslope area where the deposited sediment has potentially been derived from. In the downslope direction, flow routing indicates probable downslope pathways of material eroded/detached/entrained where the DoD shows negative surface change. This material has either been deposited along these pathways or been flushed out of the area of investigation. This is a question of sediment connectivity, a property of a system (i.e. a hillslope, a sub-/catchment) that describes its potential to move sediment through itself. The sediment pathways derived from the DEM are related to structural connectivity, while the spatial pattern of (net

White Awareness: The Frontier of Racism Awareness Training

Science.gov (United States)

Katz, Judy H.; Ivey, Allen

1977-01-01

This article's purpose is to make white professional helpers aware of how racism undermines the helping field and to demonstrate how racism affects white people. A systematic training program for white people that develops an awareness of the masking effect of racism and develops interventions for changes is presented. (Author)

The Time Window Vehicle Routing Problem Considering Closed Route

Science.gov (United States)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

The Vehicle Routing Problem (VRP) determines the optimal set of routes used by a fleet of vehicles to serve a given set of customers on a predefined graph; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we study a variant of the predefined graph: given a weighted graph G and vertices a and b, and given a set X of closed paths in G, find the minimum total travel cost of a-b path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model

Awareness in Gestalt sex therapy.

Science.gov (United States)

Mosher, D L

1979-01-01

Awareness is conceived to be selective, curative, a method, a prescription for ideal living, and a ground for human existence. In this paper the following gestalt awareness methods are described: continuum of awareness, awareness questions, biobehavioral feedback, directed awareness, concentration, present-centering, taking responsibilty, and shuttles in awareness. The use of these methods is illustrated in a gestalt therapy dialogue. The application of awareness as concept and method to sensate focus and to the treatment of the prematurely ejaculating male is discussed. Shuttles in awareness and the shared continua of awareness are introduced as promising new methods in the treatment of sexual dysfunction and as enhancing sexual pleasure and communion.

A rural, community-based suicide awareness and intervention program.

Science.gov (United States)

Jones, Sharon; Walker, Coralanne; Miles, Alison C J; De Silva, Eve; Zimitat, Craig

2015-01-01

Suicide is a prominent public health issue in rural Australia and specifically in Tasmania, which has one of the highest suicide rates in the country. The Community Response to Eliminating Suicide (CORES) program was developed in rural Tasmania in response to a significant number of suicides over a short period of time. CORES is unique in that it is both a community-based and gatekeeper education model. CORES aims to build and empower communities to take ownership of suicide prevention strategies. It also aims to increase the individual community member's interpersonal skills and awareness of suicide risks, while building peer support and awareness of suicide prevention support services within the community itself. Pre- and post-test surveys after the CORES 1-day suicide awareness and intervention program (SAIP) showed significant increases in levels of comfort and confidence in discussing suicide with those who may be contemplating that action. CORES builds community capital through establishing new connections within communities. Establishment of local executive groups, funding and SAIP are key activities of successful CORES programs in communities around Australia. Over half of the initial leaders are still actively involved after a decade, which reflects positively on the quality and outcomes of the program. This study supports CORES as a beneficial and feasible community-based suicide intervention program for rural communities.

A Game for Energy-Aware Allocation of Virtualized Network Functions

Directory of Open Access Journals (Sweden)

Roberto Bruschi

2016-01-01

Full Text Available Network Functions Virtualization (NFV is a network architecture concept where network functionality is virtualized and separated into multiple building blocks that may connect or be chained together to implement the required services. The main advantages consist of an increase in network flexibility and scalability. Indeed, each part of the service chain can be allocated and reallocated at runtime depending on demand. In this paper, we present and evaluate an energy-aware Game-Theory-based solution for resource allocation of Virtualized Network Functions (VNFs within NFV environments. We consider each VNF as a player of the problem that competes for the physical network node capacity pool, seeking the minimization of individual cost functions. The physical network nodes dynamically adjust their processing capacity according to the incoming workload, by means of an Adaptive Rate (AR strategy that aims at minimizing the product of energy consumption and processing delay. On the basis of the result of the nodes’ AR strategy, the VNFs’ resource sharing costs assume a polynomial form in the workflows, which admits a unique Nash Equilibrium (NE. We examine the effect of different (unconstrained and constrained forms of the nodes’ optimization problem on the equilibrium and compare the power consumption and delay achieved with energy-aware and non-energy-aware strategy profiles.

Impact of connected vehicle guidance information on network-wide average travel time

Directory of Open Access Journals (Sweden)

Jiangfeng Wang

2016-12-01

Full Text Available With the emergence of connected vehicle technologies, the potential positive impact of connected vehicle guidance on mobility has become a research hotspot by data exchange among vehicles, infrastructure, and mobile devices. This study is focused on micro-modeling and quantitatively evaluating the impact of connected vehicle guidance on network-wide travel time by introducing various affecting factors. To evaluate the benefits of connected vehicle guidance, a simulation architecture based on one engine is proposed representing the connected vehicle–enabled virtual world, and connected vehicle route guidance scenario is established through the development of communication agent and intelligent transportation systems agents using connected vehicle application programming interface considering the communication properties, such as path loss and transmission power. The impact of connected vehicle guidance on network-wide travel time is analyzed by comparing with non-connected vehicle guidance in response to different market penetration rate, following rate, and congestion level. The simulation results explore that average network-wide travel time in connected vehicle guidance shows a significant reduction versus that in non–connected vehicle guidance. Average network-wide travel time in connected vehicle guidance have an increase of 42.23% comparing to that in non-connected vehicle guidance, and average travel time variability (represented by the coefficient of variance increases as the travel time increases. Other vital findings include that higher penetration rate and following rate generate bigger savings of average network-wide travel time. The savings of average network-wide travel time increase from 17% to 38% according to different congestion levels, and savings of average travel time in more serious congestion have a more obvious improvement for the same penetration rate or following rate.

A Machine Learning Concept for DTN Routing

Science.gov (United States)

Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

2017-01-01

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

Coordinated computer-supported collaborative learning: Awareness and awareness tools

NARCIS (Netherlands)

Janssen, J.J.H.M.; Bodermer, D.

2013-01-01

Traditionally, research on awareness during online collaboration focused on topics such as the effects of spatial information about group members’ activities on the collaborative process. When the concept of awareness was introduced to computer-supported collaborative learning, this focus shifted to

Large-Scale Context-Aware Volume Navigation using Dynamic Insets

KAUST Repository

Al-Awami, Ali

2012-07-01

Latest developments in electron microscopy (EM) technology produce high resolution images that enable neuro-scientists to identify and put together the complex neural connections in a nervous system. However, because of the massive size and underlying complexity of this kind of data, processing, navigation and analysis suffer drastically in terms of time and effort. In this work, we propose the use of state-of- the-art navigation techniques, such as dynamic insets, built on a peta-scale volume visualization framework to provide focus and context-awareness to help neuro-scientists in their mission to analyze, reconstruct, navigate and explore EM neuroscience data.

An Examination Of Fracture Splitting Parameters Of Crackable Connecting Rods

Directory of Open Access Journals (Sweden)

Zafer Özdemir

2000-06-01

Full Text Available Fracture splitting method is an innovative processing technique in the field of automobile engine connecting rod (con/rod manufacturing. Compared with traditional method, this technique has remarkable advantages. Manufacturing procedures, equipment and tools investment can be decreased and energy consumption reduced remarkably. Furthermore, product quality and bearing capability can also be improved. It provides a high quality, high accuracy and low cost route for producing connecting rods (con/rods. With the many advantages mentioned above, this method has attracted manufacturers attention and has been utilized in many types of con/rod manufacturing. In this article, the method and the advantages it provides, such as materials, notches for fracture splitting, fracture splitting conditions and fracture splitting equipment are discussed in detail. The paper describes an analysis of examination of fracture splitting parameters and optik-SEM fractography of C70S6 crackable connectıng rod. Force and velocity parameters are investigated. That uniform impact force distrubition starting from the starting notch causes brittle and cleavage failure mode is obtained as a result. This induces to decrease the toughness.

Warehouse order-picking process. Order-picker routing problem

Directory of Open Access Journals (Sweden)

E. V. Korobkov

2015-01-01

Full Text Available This article continues “Warehouse order-picking process” cycle and describes order-picker routing sub-problem of a warehouse order-picking process. It draws analogies between the orderpickers’ routing problem and traveling salesman’s problem, shows differences between the standard problem statement of a traveling salesman and routing problem of warehouse orderpickers, and gives the particular Steiner’s problem statement of a traveling salesman.Warehouse layout with a typical order is represented by a graph, with some its vertices corresponding to mandatory order-picker’s visits and some other ones being noncompulsory. The paper describes an optimal Ratliff-Rosenthal algorithm to solve order-picker’s routing problem for the single-block warehouses, i.e. warehouses with only two crossing aisles, defines seven equivalent classes of partial routing sub-graphs and five transitions used to have an optimal routing sub-graph of a order-picker. An extension of optimal Ratliff-Rosenthal order-picker routing algorithm for multi-block warehouses is presented and also reasons for using the routing heuristics instead of exact optimal algorithms are given. The paper offers algorithmic description of the following seven routing heuristics: S-shaped, return, midpoint, largest gap, aisle-by-aisle, composite, and combined as well as modification of combined heuristics. The comparison of orderpicker routing heuristics for one- and two-block warehouses is to be described in the next article of the “Warehouse order-picking process” cycle.

An Investigation of the Use of Real-time Image Mosaicing for Facilitating Global Spatial Awareness in Visual Search

Science.gov (United States)

Soung Yee, Anthony

Three experiments have been completed to investigate whether and how a software technique called real-time image mosaicing applied to a restricted field of view (FOV) might influence target detection and path integration performance in simulated aerial search scenarios, representing local and global spatial awareness tasks respectively. The mosaiced FOV (mFOV) was compared to single FOV (sFOV) and one with double the single size (dFOV). In addition to advancing our understanding of visual information in mosaicing, the present study examines the advantages and limitations of a number of metrics used to evaluate performance in path integration tasks, with particular attention paid to measuring performance in identifying complex routes. The highlights of the results are summarized as follows, according to Experiments 1 through 3 respectively. 1. A novel response method for evaluating route identification performance was developed. The surmised benefits of the mFOV relative to sFOV and dFOV revealed no significant differences in performance for the relatively simple route shapes tested. Compared to the mFOV and dFOV conditions, target detection performance in the local task was found to be superior in the sFOV condition. 2. In order to appropriately quantify the observed differences in complex route selections made by the participants, a novel analysis method was developed using the Thurstonian Paired Comparisons Method. 3. To investigate the effect of display size and elevation angle (EA) in a complex route environment, a 2x3 experiment was conducted for the two spatial tasks, at a height selected from Experiment 2. Although no significant differences were found in the target detection task, contrasts in the Paired Comparisons Method results revealed that route identification performance were as hypothesised: mFOV > dFOV > sFOV for EA = 90°. Results were similar for EA = 45°, but with mFOV being no different than dFOV. As hypothesised, EA was found to have an effect

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

Stochastic vehicle routing with recourse

DEFF Research Database (Denmark)

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

2012-01-01

instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...

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

Science.gov (United States)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

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

Identification of Robust Terminal-Area Routes in Convective Weather

Science.gov (United States)

Pfeil, Diana Michalek; Balakrishnan, Hamsa

2012-01-01

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

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

Science.gov (United States)

Hanold, Gregg T.; Hanold, David T.

2010-01-01

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

All roads lead to Iran: Predicting landscape connectivity of the last stronghold for the critically endangered Asiatic cheetah

Science.gov (United States)

E. M. Moqanaki; Samuel Cushman

2016-01-01

Effective conservation solutions for small and isolated wildlife populations depend on identifying and preserving critical biological corridors and dispersal routes. With a worldwide population of ≤70 individuals, the critically endangered Asiatic cheetah Acinonyx jubatus venaticus persists in several fragmented nuclei in Iran. Connectivity between nuclei is...

Great Ellipse Route Planning Based on Space Vector

Directory of Open Access Journals (Sweden)

LIU Wenchao

2015-07-01

Full Text Available Aiming at the problem of navigation error caused by unified earth model in great circle route planning using sphere model and modern navigation equipment using ellipsoid mode, a method of great ellipse route planning based on space vector is studied. By using space vector algebra method, the vertex of great ellipse is solved directly, and description of great ellipse based on major-axis vector and minor-axis vector is presented. Then calculation formulas of great ellipse azimuth and distance are deduced using two basic vectors. Finally, algorithms of great ellipse route planning are studied, especially equal distance route planning algorithm based on Newton-Raphson(N-R method. Comparative examples show that the difference of route planning between great circle and great ellipse is significant, using algorithms of great ellipse route planning can eliminate the navigation error caused by the great circle route planning, and effectively improve the accuracy of navigation calculation.

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.

Local topological modeling of glass structure and radiation-induced rearrangements in connected networks

International Nuclear Information System (INIS)

Hobbs, L.W.; Jesurum, C.E.; Pulim, V.

1997-01-01

Topology is shown to govern the arrangement of connected structural elements in network glasses such as silica and related radiation-amorphized network compounds: A topological description of such topologically-disordered arrangements is possible which utilizes a characteristic unit of structure--the local cluster--not far in scale from the unit cells in crystalline arrangements. Construction of credible glass network structures and their aberration during cascade disordering events during irradiation can be effected using local assembly rules based on modification of connectivity-based assembly rules derived for crystalline analogues. These topological approaches may provide useful complementary information to that supplied by molecular dynamics about re-ordering routes and final configurations in irradiated glasses. (authors)

Local topological modeling of glass structure and radiation-induced rearrangements in connected networks

Energy Technology Data Exchange (ETDEWEB)

Hobbs, L.W. [Massachusetts Institute of Technology, Dept. of Materials Science and Engineering, Cambridge, MA (United States); Jesurum, C.E. [Massachusetts Institute of Technology, Dept. of Mathematics, Cambridge, MA (United States); Pulim, V. [Massachusetts Institute of Technology, Lab. for Computer Science, Cambridge, MA (United States)

1997-07-01

Topology is shown to govern the arrangement of connected structural elements in network glasses such as silica and related radiation-amorphized network compounds: A topological description of such topologically-disordered arrangements is possible which utilizes a characteristic unit of structure--the local cluster--not far in scale from the unit cells in crystalline arrangements. Construction of credible glass network structures and their aberration during cascade disordering events during irradiation can be effected using local assembly rules based on modification of connectivity-based assembly rules derived for crystalline analogues. These topological approaches may provide useful complementary information to that supplied by molecular dynamics about re-ordering routes and final configurations in irradiated glasses. (authors)

Demonstration of Single-Mode Multicore Fiber Transport Network with Crosstalk-Aware In-Service Optical Path Control

DEFF Research Database (Denmark)

Tanaka, Takafumi; Pulverer, Klaus; Häbel, Ulrich

2017-01-01

transport network testbed and demonstrate an XT-aware traffic engineering scenario. With the help of a software-defined network (SDN) controller, the modulation format and optical path route are adaptively changed based on the monitored XT values by using programmable devices such as a real-time transponder......-capacity transmission, because inter-core crosstalk (XT) could be the main limiting factor for MCF transmission. In a real MCF network, the inter-core XT in a particular core is likely to change continuously as the optical paths in the adjacent cores are dynamically assigned to match the dynamic nature of the data...

Adapting Parcellation Schemes to Study Fetal Brain Connectivity in Serial Imaging Studies

DEFF Research Database (Denmark)

Cheng, Xi; Wilm, Jakob; Seshamani, Sharmishtaa

2013-01-01

A crucial step in studying brain connectivity is the definition of the Regions Of Interest (ROI's) which are considered as nodes of a network graph. These ROI's identified in structural imaging reflect consistent functional regions in the anatomies being compared. However in serial studies...... of the developing fetal brain such functional and associated structural markers are not consistently present over time. In this study we adapt two non-atlas based parcellation schemes to study the development of connectivity networks of a fetal monkey brain using Diffusion Weighted Imaging techniques. Results...... demonstrate that the fetal brain network exhibits small-world characteristics and a pattern of increased cluster coefficients and decreased global efficiency. These findings may provide a route to creating a new biomarker for healthy fetal brain development....

Is Entrepreneurship a Route Out of Deprivation?

DEFF Research Database (Denmark)

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

2014-01-01

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

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

Science.gov (United States)

Segui, John S.; Jennings, Esther H.; Clare, Loren P.

2013-01-01

Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

Attention without awareness: Attentional modulation of perceptual grouping without awareness.

Science.gov (United States)

Lo, Shih-Yu

2018-04-01

Perceptual grouping is the process through which the perceptual system combines local stimuli into a more global perceptual unit. Previous studies have shown attention to be a modulatory factor for perceptual grouping. However, these studies mainly used explicit measurements, and, thus, whether attention can modulate perceptual grouping without awareness is still relatively unexplored. To clarify the relationship between attention and perceptual grouping, the present study aims to explore how attention interacts with perceptual grouping without awareness. The task was to judge the relative lengths of two centrally presented horizontal bars while a railway-shaped pattern defined by color similarity was presented in the background. Although the observers were unaware of the railway-shaped pattern, their line-length judgment was biased by that pattern, which induced a Ponzo illusion, indicating grouping without awareness. More importantly, an attentional modulatory effect without awareness was manifested as evident by the observer's performance being more often biased when the railway-shaped pattern was formed by an attended color than when it was formed by an unattended one. Also, the attentional modulation effect was shown to be dynamic, being more pronounced with a short presentation time than a longer one. The results of the present study not only clarify the relationship between attention and perceptual grouping but also further contribute to our understanding of attention and awareness by corroborating the dissociation between attention and awareness.

Modelling of Situation Awareness with Perception, Attention, and Prior and Retrospective Awareness

NARCIS (Netherlands)

Thilakarathne, D.J.

2015-01-01

Human awareness under different circumstances is complex and non-trivial to understand. Nevertheless, due to the importance of awareness for safety and efficiency in many domains (e.g.; the aviation domain), it is necessary to study the processes behind situation awareness, to eliminate possible

Fish ladder of Lajeado Dam: migrations on one-way routes?

Directory of Open Access Journals (Sweden)

Angelo Antônio Agostinho

Full Text Available Fish ladders are generally conceived to reestablish connectivity among critical habitats for migratory species, thus mitigating the impacts of the blockage of migration routes by dams. If this management tool is to be meaningful for conserving fish species, it must provide a fully permeable connection and assure both upward and downward movements. However, because reservoirs have very different hydrodynamics than the original river, it is expected that, at least in the inner area, they may constitute an additional barrier to this movement, especially for descending fish. Thus, the present study sought to determine if migratory fish and their offspring disperse downstream from the dam after ascending a ladder and spawning in the upper reaches of a basin. To achieve this purpose, we evaluated the limitation imposed by lentic areas to the descent of eggs, larvae and adults of migratory species; we also determined the abundance and composition of larvae present in the plankton near the dam, and compared the intensity of the upward and downward movements of adult fish. Samples of ichthyoplankton were taken upriver, inside the reservoir, in the river downstream from the dam, and in the forebay of the Lajeado Dam on the Tocantins River (Luis Eduardo Magalhães Hydroelectric Plant, from October, 1999 through September, 2004. The densities of fish ascending and descending the ladder were determined experimentally on eight occasions, from June, 2004 to March, 2005. Due to difficulties in identifying the true fish origin (up or down in the environments connected by the fish passage system, the evaluation of the distribution of migratory fish in reservoirs was based on the landings of the commercial fishery conducted along the Itaipu Reservoir during the four years preceding (2001 through 2003 the construction of the lateral channel (fish-passage mechanism. Fish eggs and larvae drifting down the Tocantins River did not appear in samples taken in the lower

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)

Energy-aware scheduling of surveillance in wireless multimedia sensor networks.

Science.gov (United States)

Wang, Xue; Wang, Sheng; Ma, Junjie; Sun, Xinyao

2010-01-01

Wireless sensor networks involve a large number of sensor nodes with limited energy supply, which impacts the behavior of their application. In wireless multimedia sensor networks, sensor nodes are equipped with audio and visual information collection modules. Multimedia contents are ubiquitously retrieved in surveillance applications. To solve the energy problems during target surveillance with wireless multimedia sensor networks, an energy-aware sensor scheduling method is proposed in this paper. Sensor nodes which acquire acoustic signals are deployed randomly in the sensing fields. Target localization is based on the signal energy feature provided by multiple sensor nodes, employing particle swarm optimization (PSO). During the target surveillance procedure, sensor nodes are adaptively grouped in a totally distributed manner. Specially, the target motion information is extracted by a forecasting algorithm, which is based on the hidden Markov model (HMM). The forecasting results are utilized to awaken sensor node in the vicinity of future target position. According to the two properties, signal energy feature and residual energy, the sensor nodes decide whether to participate in target detection separately with a fuzzy control approach. Meanwhile, the local routing scheme of data transmission towards the observer is discussed. Experimental results demonstrate the efficiency of energy-aware scheduling of surveillance in wireless multimedia sensor network, where significant energy saving is achieved by the sensor awakening approach and data transmission paths are calculated with low computational complexity.

Study on the Context-Aware Middleware for Ubiquitous Greenhouses Using Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jeonghwang Hwang

2011-04-01

Full Text Available Wireless Sensor Network (WSN technology is one of the important technologies to implement the ubiquitous society, and it could increase productivity of agricultural and livestock products, and secure transparency of distribution channels if such a WSN technology were successfully applied to the agricultural sector. Middleware, which can connect WSN hardware, applications, and enterprise systems, is required to construct ubiquitous agriculture environment combining WSN technology with agricultural sector applications, but there have been insufficient studies in the field of WSN middleware in the agricultural environment, compared to other industries. This paper proposes a context-aware middleware to efficiently process data collected from ubiquitous greenhouses by applying WSN technology and used to implement combined services through organic connectivity of data. The proposed middleware abstracts heterogeneous sensor nodes to integrate different forms of data, and provides intelligent context-aware, event service, and filtering functions to maximize operability and scalability of the middleware. To evaluate the performance of the middleware, an integrated management system for ubiquitous greenhouses was implemented by applying the proposed middleware to an existing greenhouse, and it was tested by measuring the level of load through CPU usage and the response time for users’ requests when the system is working.

Personal awareness and behavioural choices on having a stoma: a qualitative metasynthesis.

Science.gov (United States)

Tao, Hui; Songwathana, Praneed; Isaramalai, Sang-Arun; Zhang, Ying

2014-05-01

To answer how personal awareness and behavioural choices on having a stoma have been described and interpreted in previous qualitative studies. Over the past two decades, there has been an accumulation of the qualitative studies concerning the experiences of individuals living with a stoma. Synthesising the findings of these studies would be able to improve the understanding among health providers. Qualitative metasynthesis. The literature was obtained through searching CINAHL and PubMed databases for papers published in English, and China National Knowledge Infrastructure database for papers published in Chinese from 1990-March 2012. Sixteen articles were selected using the predefined criteria. Three themes about personal awareness and behavioural choices on having a stoma were identified: altered self, restricted life and overcoming restrictions. The results showed the impacts of having a stoma through the analysis on connections between personal awareness and behavioural choices. Having a stoma means that the individuals have to learn to be aware of and accustomed to changes and restrictions in their everyday lives. The individuals take behavioural efforts to overcome these restrictions involving: deciding on whether to reveal or conceal their stomas to others based on the possibility of being accepted or rejected, using internal resources, seeking and receiving external supports. The description and interpretation on personal awareness and behavioural choices associated with having a stoma is useful for nurses in providing practical, informational and emotional supports to help the individuals successfully adapt to their lives with a stoma. © 2013 John Wiley & Sons Ltd.

A Community-Aware Approach to Minimizing Dissemination in Graphs

KAUST Repository

Zhang, Chuxu

2017-08-02

Given a graph, can we minimize the spread of an entity (such as a meme or a virus) while maintaining the graph’s community structure (defined as groups of nodes with denser intra-connectivity than inter-connectivity)? At first glance, these two objectives seem at odds with each other. To minimize dissemination, nodes or links are often deleted to reduce the graph’s connectivity. These deletions can (and often do) destroy the graph’s community structure, which is an important construct in real-world settings (e.g., communities promote trust among their members). We utilize rewiring of links to achieve both objectives. Examples of rewiring in real life are prevalent, such as purchasing products from a new farm since the local farm has signs of mad cow disease; getting information from a new source after a disaster since your usual source is no longer available, etc. Our community-aware approach, called constrCRlink (short for Constraint Community Relink), preserves (on average) 98.6% of the efficacy of the best community-agnostic link-deletion approach (namely, NetMelt+), but changes the original community structure of the graph by only 4.5%. In contrast, NetMelt+ changes 13.6% of the original community structure.

A study of routing algorithms for SCI-Based multistage networks

International Nuclear Information System (INIS)

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

1994-03-01

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

Performance of Implementation IBR-DTN and Batman-Adv Routing Protocol in Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Herman Yuliandoko

2016-03-01

Full Text Available Wireless mesh networks is a network which has high mobility and flexibility network. In Wireless mesh networks nodes are free to move and able to automatically build a network connection with other nodes. High mobility, heterogeneous condition and intermittent network connectivity cause data packets drop during wireless communication and it becomes a problem in the wireless mesh networks. This condition can happen because wireless mesh networks use connectionless networking type such as IP protocol which it is not tolerant to delay. To solve this condition it is needed a technology to keep data packets when the network is disconnect. Delay tolerant technology is a technology that provides store and forward mechanism and it can prevent packet data dropping during communication. In our research, we proposed a test bed wireless mesh networks implementation by using proactive routing protocol and combining with delay tolerant technology. We used Batman-adv routing protocol and IBR-DTN on our research. We measured some particular performance aspect of networking such as packet loss, delay, and throughput of the network. We identified that delay tolerant could keep packet data from dropping better than current wireless mesh networks in the intermittent network condition. We also proved that IBR-DTN and Batman-adv could run together on the wireless mesh networks. In The experiment throughput test result of IBR-DTN was higher than Current TCP on the LoS (Line of Side and on environment with obstacle. Keywords: Delay Tolerant, IBR-DTN, Wireless Mesh, Batman-adv, Performance

Towards seasonal Arctic shipping route predictions

Science.gov (United States)

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

2017-12-01

In our previous work [1] we showed how trans-Arctic shipping routes would become more available through the 21st century as sea ice declines, using CMIP5 models with means and stds calibrated to PIOMAS sea ice observations. Sea ice will continue to close shipping routes to open water vessels through the winter months for the foreseeable future so the availability of open sea routes will vary greatly from year to year. Here [2] we look at whether the trans-Arctic shipping season period can be predicted in seasonal forecasts, again using several climate models, and testing both perfect and imperfect knowledge of the initial sea ice conditions. We find skilful predictions of the upcoming summer shipping season can be made from as early as January, although typically forecasts may show lower skill before a May `predictability barrier'. Focussing on the northern sea route (NSR) off Siberia, the date of opening of this sea route is twice as variable as the closing date, and this carries through to reduced predictability at the start of the season. Under climate change the later freeze-up date accounts for 60% of the lengthening season, Fig1 We find that predictive skill is state dependent with predictions for high or low ice years exhibiting greater skill than for average ice years. Forecasting the exact timing of route open periods is harder (more weather dependent) under average ice conditions while in high and low ice years the season is more controlled by the initial ice conditions from spring onwards. This could be very useful information for companies planning vessel routing for the coming season. We tested this dependence on the initial ice conditions by changing the initial ice state towards climatologically average conditions and show directly that early summer sea-ice thickness information is crucial to obtain skilful forecasts of the coming shipping season. Mechanisms for this are discussed. This strongly suggests that good sea ice thickness observations

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2016-02-01

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

Lessons learned by southern states in designating alternative routes

International Nuclear Information System (INIS)

1989-08-01

The purpose of this report is to discuss the ''lessons learned'' by the five states within the southem region that have designated alternative or preferred routes under the regulations of the Department of Transportation (DOT) established for the transportation of radioactive materials. The document was prepared by reviewing applicable federal laws and regulations, examining state reports and documents and contacting state officials and routing agencies involved in making routing decisions. In undertaking this project, the Southern States Energy Board hopes to reveal the process used by states that have designated alternative routes and thereby share their experiences (i.e., lessons learned) with other southern states that have yet to make designations. Under DOT regulations (49 CFR 177.826), carriers of highway route controlled quantities of radioactive materials (which include spent nuclear fuel and high-level waste) must use preferred routes selected to reduce time in transit. Such preferred routes consist of (1) an interstate system highway with use of an interstate system bypass or beltway around cities when available, and (2) alternate routes selected by a ''state routing agency.''

Quantum chemistry-assisted synthesis route development

International Nuclear Information System (INIS)

Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

2015-01-01

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

Route Choice Model Based on Game Theory for Commuters

Directory of Open Access Journals (Sweden)

Licai Yang

2016-06-01

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

On the Performance of the Current MANET Routing Protocols for VoIP, HTTP, and FTP Applications

Directory of Open Access Journals (Sweden)

Waheb A. Jabbar

2014-01-01

Full Text Available The recent advances of ensemble mobile environment of smart devices with embedded sensors have enabled the MANET to play a key role in the smart cities as well as WSN and WMN. However, these smart devices are still limited in terms of energy, processor, and memory. Moreover, the efficient routing for reliable network connectivity at anytime, anywhere, and about everything is still a challenge in multihop wireless networks. This paper evaluates the QoS and energy efficiency of three active routing protocols: (i OLSRv2, a successor to OLSR, (ii DYMO, a successor to both DSR and AODV, and (iii MP-OLSR multipath extension to OLSRv2. In contrast to the related previous works which focused only on CBR traffic without considering the influence of specific traffic types on the performance of routing protocols, this work focused on this area from a different perspective. It evaluates the performance of three internet-based traffic types that can be used in the smart city applications: VoIP, HTTP, and FTP using different simulation models. The impact of the network density, load traffic, and nodes mobility on the considered protocols was evaluated by considering particular performance metrics for each traffic application. Based on the results, the study concludes by presenting useful recommendations for future work.

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

A tree routing protocol for cognitive radio network

Directory of Open Access Journals (Sweden)

Mohammed Hashem

2017-07-01

Full Text Available Cognitive Radio (CR technology is an agile solution for spectrum congestion and spectrum access utilization problems that result from the legacy fixed spectrum management policies. CR technology can exploit unused licensed band to meet the increasing demand for radio frequency. The routing process faces many challenges in CR Network (CRN such as the absence of centralized infrastructure, the coordination between the routing module and spectrum management module, in addition to the frequent link failure due to the sudden appearance of PUs. In this paper we propose a Tree routing protocol for cognitive radio network (C-TRP that jointly utilizes the tree routing algorithm with a spectrum management module in routing decisions, and also we proposed a new metric used in taking the best route decisions. In addition, we enhance the traditional tree routing algorithm by using a neighbor table technique that speeds up the forwarding data packets. Moreover, we add a robust recovery module to C-TRP to resume the network in case of the link failure. The main motivation in the design of C-TRP is quick data transmission and maximization of date rates. The performance evaluation is carried out in NS2 simulator. The simulation results proved that C-TRP protocol achieves better performance in terms of average “PDR”, “end-to-end delay” and “routing overhead ratio “compared to “CTBR” and “STOD-RP” routing protocols.

Route Network Construction with Location-Direction-Enabled Photographs

Science.gov (United States)

Fujita, Hideyuki; Sagara, Shota; Ohmori, Tadashi; Shintani, Takahiko

2018-05-01

We propose a method for constructing a geometric graph for generating routes that summarize a geographical area and also have visual continuity by using a set of location-direction-enabled photographs. A location- direction-enabled photograph is a photograph that has information about the location (position of the camera at the time of shooting) and the direction (direction of the camera at the time of shooting). Each nodes of the graph corresponds to a location-direction-enabled photograph. The location of each node is the location of the corresponding photograph, and a route on the graph corresponds to a route in the geographic area and a sequence of photographs. The proposed graph is constructed to represent characteristic spots and paths linking the spots, and it is assumed to be a kind of a spatial summarization of the area with the photographs. Therefore, we call the routes on the graph as spatial summary route. Each route on the proposed graph also has a visual continuity, which means that we can understand the spatial relationship among the continuous photographs on the route such as moving forward, backward, turning right, etc. In this study, when the changes in the shooting position and shooting direction satisfied a given threshold, the route was defined to have visual continuity. By presenting the photographs in order along the generated route, information can be presented sequentially, while maintaining visual continuity to a great extent.

Development of safe routes for children in urban environment

Science.gov (United States)

Koryagin, M. E.; Medvedev, V. I.; Strykov, P. G.

2018-01-01

The matter of development of safe travel routes for children between school and home is analyzed. The availability of various applications and devices to identify the location of the child and his/her travel routes is noted. The main factors to be taken into account when planning children travel routes are described. The most popular Russian services for route planning, Google, Yandex, and 2GIS, are discussed. These services are shown to have a number of shortcomings which does not allow them to choose really safe routes. A decision on making the route selection by two criteria (the travel time and the probability of an accident) is obtained. As a numerical example, the Pareto area for possible routes is constructed.

Risk assessment of the entry of canine-rabies into Papua New Guinea via sea and land routes.

Science.gov (United States)

Brookes, Victoria J; Keponge-Yombo, Andy; Thomson, David; Ward, Michael P

2017-09-15

Canine-rabies is endemic in parts of Indonesia and continues to spread eastwards through the Indonesian archipelago. Papua New Guinea (PNG) has a land border with Papua Province, Indonesia, as well as logging and fishing industry connections throughout Asia. PNG has a Human Development Index of 0.505; therefore, an incursion of canine-rabies could have devastating impacts on human (7.5 million) and animal populations. Given the known difficulties of rabies elimination in resource-scarce environments, an incursion of rabies into PNG would also likely compromise the campaign for global elimination of rabies. A previous qualitative study to determine routes for detailed risk assessment identified logging, fishing and three land-routes (unregulated crossers ["shopper-crossers"], traditional border crossers and illegal hunters) as potential high risk routes for entry of rabies-infected dogs into PNG. The objective of the current study was to quantify and compare the probability of entry of a rabies-infected dog via these routes into PNG and to identify the highest risk provinces and border districts to target rabies prevention and control activities. Online questionnaires were used to elicit expert-opinion about quantitative model parameter values. A quantitative, stochastic model was then used to assess risk, and parameters with the greatest influence on the estimated mean number of rabies-infected dogs introduced/year were identified via global sensitivity analysis (Sobol method). Eight questionnaires - including 7 online - were implemented and >220 empirical distributions were parameterised using >2900 expert-opinions. The highest risk provinces for combined sea routes were West Sepik, Madang and Western Province, driven by the number of vessels and the probability of bringing dogs. The highest risk border districts for combined land routes were Vanimo-Green River and South Fly, driven by the number of people crossing the border and the number of dogs (with hunters

ExTouch: Spatially-aware embodied manipulation of actuated objects mediated by augmented reality

OpenAIRE

Kasahara, Shunichi; Niiyama, Ryuma; Ishii, Hiroshi; Heun, Valentin Markus Josef

2013-01-01

As domestic robots and smart appliances become increasingly common, they require a simple, universal interface to control their motion. Such an interface must support a simple selection of a connected device, highlight its capabilities and allow for an intuitive manipulation. We propose "exTouch", an embodied spatially-aware approach to touch and control devices through an augmented reality mediated mobile interface. The "exTouch" system extends the users touchscreen interactions into the rea...

Routing architecture and security for airborne networks

Science.gov (United States)

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

2009-05-01

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

Relating Pitch Awareness to Phonemic Awareness in Children: Implications for Tone-Deafness and Dyslexia

Directory of Open Access Journals (Sweden)

Psyche eLoui

2011-05-01

Full Text Available Language and music are complex cognitive and neural functions that rely on awareness of one’s own sound productions. Information on the awareness of vocal pitch, and its relation to phonemic awareness which is crucial for learning to read, will be important for understanding the relationship between tone-deafness and developmental language disorders such as dyslexia. Here we show that phonemic awareness skills are positively correlated with pitch perception-production skills in children. Children between the ages of 7 and 9 were tested on pitch perception and production, phonemic awareness, and IQ. Results showed a significant positive correlation between pitch perception-production and phonemic awareness, suggesting that the relationship between musical and linguistic sound processing is intimately linked to awareness at the level of pitch and phonemes. Since tone-deafness is a pitch-related impairment and dyslexia is a deficit of phonemic awareness, we suggest that dyslexia and tone-deafness may have a shared and/or common neural basis.

Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

Directory of Open Access Journals (Sweden)

Yan Han

2014-01-01

Full Text Available The question prompted is how to design the tour route to make the tourists get the maximum satisfactions considering the tourists’ demand. The influence factors of the tour route choices of tourists were analyzed and tourists’ behavior characteristics and psychological preferences were regarded as the important influence factors based on the tourist behavioral theories. A questionnaire of tourists’ tour route information and satisfaction degree was carried out. Some information about the scene spot and tourists demand and tour behaviors characteristic such as visit frequency, number of attractions visited was obtained and analyzed. Based on the convey datum, tour routes multiobjective optimization functions were prompted for the tour route design regarding the maximum satisfaction and the minimum tour distance as the optimal objective. The available routes are listed and categorized. Based on the particle swarm optimization model, the priorities of the tour route are calculated and finally the suggestion depth tour route and quick route tour routes are given considering the different tour demands of tourists. The results can offer constructive suggestions on how to design tour routes on the part of tourism enterprises and how to choose a proper tour route on the part of tourists.

Where to restore ecological connectivity? Detecting barriers and quantifying restoration benefits.

Directory of Open Access Journals (Sweden)

Brad H McRae

Full Text Available Landscape connectivity is crucial for many ecological processes, including dispersal, gene flow, demographic rescue, and movement in response to climate change. As a result, governmental and non-governmental organizations are focusing efforts to map and conserve areas that facilitate movement to maintain population connectivity and promote climate adaptation. In contrast, little focus has been placed on identifying barriers-landscape features which impede movement between ecologically important areas-where restoration could most improve connectivity. Yet knowing where barriers most strongly reduce connectivity can complement traditional analyses aimed at mapping best movement routes. We introduce a novel method to detect important barriers and provide example applications. Our method uses GIS neighborhood analyses in conjunction with effective distance analyses to detect barriers that, if removed, would significantly improve connectivity. Applicable in least-cost, circuit-theoretic, and simulation modeling frameworks, the method detects both complete (impermeable barriers and those that impede but do not completely block movement. Barrier mapping complements corridor mapping by broadening the range of connectivity conservation alternatives available to practitioners. The method can help practitioners move beyond maintaining currently important areas to restoring and enhancing connectivity through active barrier removal. It can inform decisions on trade-offs between restoration and protection; for example, purchasing an intact corridor may be substantially more costly than restoring a barrier that blocks an alternative corridor. And it extends the concept of centrality to barriers, highlighting areas that most diminish connectivity across broad networks. Identifying which modeled barriers have the greatest impact can also help prioritize error checking of land cover data and collection of field data to improve connectivity maps. Barrier detection

Airline Schedule Disruption Management. The impact of flight delays on connection loss

Directory of Open Access Journals (Sweden)

Rahil Hicham

2017-01-01

Full Text Available Air travel demand is important and many travellers choose to drive to larger airports instead of flying from a small airport for many reasons, especially availability of non-stop flights. Another reason is perceived reliability of service. Consultants have pointed to a large number of delays and cancellations as reasons for low passenger. However, the effect of these flight delays on actual travel times is less clear. Because connections are usually necessary when traveling from small airports, departure delays may lead to missed connections. In the case of a cancellation, need to wait several hours (often overnight for the next flight due to the small number of daily departures. This paper evaluate the impact of delays and cancellations on the profit earned through the seats captured on new opened routes. This aspect of decision-making comes in the form of multi-objective problem by testing the impact of a new opened route in terms of flight delays costs, financial gain and the quality of the service provided to a target customer. The NSGA-II algorithm is adopted to generate a front of Pareto-optimal compound of a number of optimal departure times to the new destination while ensuring the best fill rate, and a minimum flight delays. The experiences are based on the flights of the Royal Air Maroc Company on the Casablanca hub.

Optimizing departure times in vehicle routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes 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

Developing Cultural Awareness

Directory of Open Access Journals (Sweden)

İsmail Fırat Altay

2005-04-01

Full Text Available This paper aims at emphasizing the issue of teaching of culture in foreign languageteaching. In this respect, the reasons of teaching culture in foreign language classes arefocused on initially. So, the justifications of teaching culture are considered and explainedand by the help of a dialogue. Right after this, ways of developing cultural awareness is takeninto account. At this step, types of courses to develop cultural awareness are dealt with.Developing cultural awareness in class is another aspect to handle. Besides, ways ofdeveloping cultural awareness outside the class are worked on. Whether there are dangers ofusing culture in foreign language class is explained in dangers and problems part. In theconclusion, ideas of the writer on the subject as final remarks are clarified.

Knowledge and awareness of medical doctors, medical students and nurses about dentistry in Nigeria.

Science.gov (United States)

Oyetola, Elijah Olufemi; Oyewole, Taiwo; Adedigba, Micheal; Aregbesola, Stephen Tunde; Umezudike, Kehinde; Adewale, Adedotun

2016-01-01

Various studies have reported poor awareness and knowledge of dentistry in the Nigerian population. There is, however, paucity of information assessing the knowledge and awareness of medical doctors/students and nurses about dentistry. The present study is aimed at determining the knowledge and awareness of medical doctors/students and nurses about dentistry. Self-administered questionnaires were randomly distributed among medical doctors/students, and nurses of Obafemi Awolowo Teaching Hospitals' Complex, Ile-Ife, Nigeria. Information collected using the questionnaire included participants' biodata, questions evaluating dental awareness, knowledge of systemic and oral health connections as well as referral practices. The data analysis was done with STATA version 11 software. A total of 300 questionnaires were randomly distributed among doctors/students and nurses, 206 were returned (response rate of 69%). Of the returned questionnaires, 129(63%) were males and 77(37%) were females. There were 42 medical doctors, 49 nurses and 115 medical students. The mean age of the participants was 26.7 years (SD 5.2). Majority (99.5%) was aware of dental profession, but 92% had never referred patients for dental consultation. One third (31%) of medical doctors believed that Ludwig angina was a cardiac disease. A large proportion of the respondents (61%) see no need for routine dental visit while 27% would want to visit the dentist only when they had a dental complaint. Although a large percentage of the participants claimed to be aware of dentistry, our findings revealed low level of knowledge and attitude to Dentistry. Efforts should be made towards closing this knowledge gap to achieve efficient oral health.

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

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

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

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