Science.gov

Sample records for ad-hoc routing protocol

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

    PubMed Central

    Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

    2016-01-01

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

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

    PubMed

    Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

    2016-01-01

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

  3. Routing Protocol of Sparse Urban Vehicular Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Li, Huxiong

    Vehicular ad hoc network (VANET) is an application of mobile ad hoc technology in transportation systems, it has become an important part of ITS. Since multi-hop link is hard to set up in sparse VANET, a traffic-aware routing (TAR) protocol is proposed which estimates vehicle average neighbors (VAN) of roads by exchanging beacon messages between encounter vehicles. Road with high VAN is preferred to be selected as part of forwarding path at intersection. Packets are forwarded to the next intersection in road in a greedy manner. Simulations show that TAR outperforms the compared protocols in terms of both packet delivery ratio and average end-to-end delay.

  4. Intelligent routing protocol for ad hoc wireless network

    NASA Astrophysics Data System (ADS)

    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

  5. Energy Efficient and QoS sensitive Routing Protocol for Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Saeed Tanoli, Tariq; Khalid Khan, Muhammad

    2013-12-01

    Efficient routing is an important part of wireless ad hoc networks. Since in ad hoc networks we have limited resources, there are many limitations like bandwidth, battery consumption, and processing cycle etc. Reliability is also necessary since there is no allowance for invalid or incomplete information (and expired data is useless). There are various protocols that perform routing by considering one parameter but ignoring other parameters. In this paper we present a protocol that finds route on the basis of bandwidth, energy and mobility of the nodes participating in the communication.

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

    NASA Astrophysics Data System (ADS)

    Huibin, Liu; Jun, Zhang

    2016-04-01

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

  7. Analysis and Proposal of Position-Based Routing Protocols for Vehicular Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Okada, Hiraku; Takano, Akira; Mase, Kenichi

    One of the most promising applications of a mobile ad hoc network is a vehicular ad hoc network (VANET). Each vehicle is aware of its position information by GPS or other methods, so position-based routing is a useful approach in VANET. The position-based routing protocol can be classified roughly into a next-hop forwarding method and a directed flooding method. We evaluate performance of both methods by analytic approach and compare them in this paper. From the evaluation results, we conclude that it is effective for the position-based routing to choose either the next-hop forwarding method or the directed flooding method according to the environment. Then we propose the hybrid transmission method which can select one of them according to the environment, and clarify that the proposed method can keep the packet delivery ratio at a high level and reduce the delay time.

  8. A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

    PubMed Central

    Parasuraman, Ganesh Kumar

    2014-01-01

    The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET. PMID:25136697

  9. A secure 3-way routing protocols for intermittently connected mobile ad hoc networks.

    PubMed

    Sekaran, Ramesh; Parasuraman, Ganesh Kumar

    2014-01-01

    The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET. PMID:25136697

  10. T2AR: trust-aware ad-hoc routing protocol for MANET.

    PubMed

    Dhananjayan, Gayathri; Subbiah, Janakiraman

    2016-01-01

    Secure data transfer against the malicious attacks is an important issue in an infrastructure-less independent network called mobile ad-hoc network (MANET). Trust assurance between MANET nodes is the key parameter in the high-security provision under dynamic topology variations and open wireless constraints. But, the malicious behavior of nodes reduces the trust level of the nodes that leads to an insecure data delivery. The increase in malicious attacks causes the excessive energy consumption that leads to a reduction of network lifetime. The lack of positional information update of the nodes in ad-hoc on-demand vector (AODV) protocol during the connection establishment offers less trust level between the nodes. Hence, the trust rate computation using energy and mobility models and its update are the essential tasks for secure data delivery. This paper proposes a trust-aware ad-hoc routing (T2AR) protocol to improve the trust level between the nodes in MANET. The proposed method modifies the traditional AODV routing protocol with the constraints of trust rate, energy, mobility based malicious behavior prediction. The packet sequence ID matching from the log reports of neighbor nodes determine the trust rate that avoids the malicious report generation. Besides, the direct and indirect trust observation schemes utilization increases the trust level. Besides, the received signal strength indicator utilization determines the trusted node is within the communication range or not. The comparative analysis between the proposed T2AR with the existing methods such as TRUNCMAN, RBT, GR, FBR and DICOTIDS regarding the average end-to-end delay, throughput, false positives, packet delivery ratio shows the effectiveness of T2AR in the secure MANET environment design. PMID:27441127

  11. Characterizing the Interaction Between Routing and MAC Protocols in Ad-Hoc Networks

    SciTech Connect

    Barrett, C. L.; Drozda, M.; Marathe, A.; Marathe, M. V.

    2002-01-01

    We empirically study the effect of mobility on the performance of protocols designed for wireless ad-hoc networks. An important objective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols is measured in terms of (i) latency, (ii) throughput, (iii) number of packets received, (iv) long term fairness and (v) number of control packets at the MAC and routing layer level. Three different commonly studied routing protocols are used: AODV, DSR and LAR1. Similarly three well known MAC protocols are used: MACA, 802.1 1 and CSMA. Our main contribution is simulation based experiments coupled with rigorous statistical analysis to characterize the interaction of MAC layer protocols with routing layer protocols in ad-hoc networks. From the results, we can conclude the following: e No single MAC or Routing protocol dominated the other protocols in their class. Probably more interestingly, no MAURouting protocol combination was better than other combinations over all scenarios and response variables. 0 In general, it is not meaningful to speak about a MAC or a routing protocol in isolation. Presence of interaction leads to trade-offs between the amount of control packets generated by each layer. The results raise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. Thus in order to improve the performanceof a communication network, it is important to study the entire protocol stack as a single algorithmic construct; optimizing individual layers in the seven layer OS1 stack will not yield performance improvements beyond a point. A methodological contribution of this paper is the use of statistical methods such as analysis of variance (ANOVA), to characterize the interaction between the protocols

  12. Performance evaluation of reactive and proactive routing protocol in IEEE 802.11 ad hoc network

    NASA Astrophysics Data System (ADS)

    Hamma, Salima; Cizeron, Eddy; Issaka, Hafiz; Guédon, Jean-Pierre

    2006-10-01

    Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show

  13. Performance Analysis of Ad Hoc Routing Protocols in City Scenario for VANET

    NASA Astrophysics Data System (ADS)

    Das, Sanjoy; Raw, Ram Shringar; Das, Indrani

    2011-12-01

    In this paper, performance analysis of Location Aided Routing (LAR), AODV and DSR protocol in city scenarios has been done. The mobility model considered is Manhattan model. This mobility model used to emulate the movement pattern of nodes i.e., vehicles on streets defined by maps. Our objective is to provide a comparative analysis among LAR, AODV and DSR protocol in city scenarios in Vehicular Ad hoc Networks. The simulation work has been conducted using the Glomosim 2.03 simulator. The results show that LAR1 protocol achieves maximum packet delivery ratio is 100% in the sparsely populated network. The delay is maximum in AODV 121.88 ms when the number of node is 10 in the network. The results show that LAR1 outperform DSR and AODV in term of packet delivery ratio and end to end delay.

  14. History-based route selection for reactive ad hoc routing protocols

    NASA Astrophysics Data System (ADS)

    Medidi, Sirisha; Cappetto, Peter

    2007-04-01

    Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.

  15. VehiHealth: An Emergency Routing Protocol for Vehicular Ad Hoc Network to Support Healthcare System.

    PubMed

    Bhoi, S K; Khilar, P M

    2016-03-01

    Survival of a patient depends on effective data communication in healthcare system. In this paper, an emergency routing protocol for Vehicular Ad hoc Network (VANET) is proposed to quickly forward the current patient status information from the ambulance to the hospital to provide pre-medical treatment. As the ambulance takes time to reach the hospital, ambulance doctor can provide sudden treatment to the patient in emergency by sending patient status information to the hospital through the vehicles using vehicular communication. Secondly, the experienced doctors respond to the information by quickly sending a treatment information to the ambulance. In this protocol, data is forwarded through that path which has less link breakage problem between the vehicles. This is done by calculating an intersection value I v a l u e for the neighboring intersections by using the current traffic information. Then the data is forwarded through that intersection which has minimum I v a l u e . Simulation results show VehiHealth performs better than P-GEDIR, GyTAR, A-STAR and GSR routing protocols in terms of average end-to-end delay, number of link breakage, path length, and average response time. PMID:26696419

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

    NASA Astrophysics Data System (ADS)

    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.

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

    SciTech Connect

    Goldsby, Michael E.; Johnson, Michael M.; Kilman, Dominique Marie; Bierbaum, Neal Robert; Chen, Helen Y.; Ammerlahn, Heidi R.; Tsang, Rose P.; Nicol, David M.

    2004-01-01

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

  18. A Time-Slotted On-Demand Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems

    SciTech Connect

    Hope Forsmann; Robert Hiromoto; John Svoboda

    2007-04-01

    The popularity of UAVs has increased dramatically because of their successful deployment in military operations, their ability to preserve human life, and the continual improvements in wireless communication that serves to increase their capabilities. We believe the usefulness of UAVs would be dramatically increased if formation flight were added to the list of capabilities. Currently, sustained formation flight with a cluster of UAVs has only been achieved with two nodes by the Multi-UAV Testbed at the Massachusetts Institute of Technology. (Park, 2004) Formation flight is a complex operation requiring the ability to adjust the flight patterns on the fly and correct for wind gusts, terrain, and differences in node equipment. All of which increases the amount of inner node communication. Since one of the problems with MANET communication is network congestion, we believe a first step towards formation flight can be made through improved inner node communication. We have investigated current communication routing protocols and developed an altered hybrid routing protocol in order to provide communication with less network congestion.

  19. Performance analysis of multi-radio routing protocol in cognitive radio ad hoc networks under different path failure rate

    NASA Astrophysics Data System (ADS)

    Che-Aron, Z.; Abdalla, A. H.; Abdullah, K.; Hassan, W. H.

    2013-12-01

    In recent years, Cognitive Radio (CR) technology has largely attracted significant studies and research. Cognitive Radio Ad Hoc Network (CRAHN) is an emerging self-organized, multi-hop, wireless network which allows unlicensed users to opportunistically access available licensed spectrum bands for data communication under an intelligent and cautious manner. However, in CRAHNs, a lot of failures can easily occur during data transmission caused by PU (Primary User) activity, topology change, node fault, or link degradation. In this paper, an attempt has been made to evaluate the performance of the Multi-Radio Link-Quality Source Routing (MR-LQSR) protocol in CRAHNs under different path failure rate. In the MR-LQSR protocol, the Weighted Cumulative Expected Transmission Time (WCETT) is used as the routing metric. The simulations are carried out using the NS-2 simulator. The protocol performance is evaluated with respect to performance metrics like average throughput, packet loss, average end-to-end delay and average jitter. From the simulation results, it is observed that the number of path failures depends on the PUs number and mobility rate of SUs (Secondary Users). Moreover, the protocol performance is greatly affected when the path failure rate is high, leading to major service outages.

  20. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks

    PubMed Central

    Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J.; Segarra, Esteve Pallarès; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Gargallo, Emilio Sanvicente

    2015-01-01

    The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic.Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs. PMID:25897496

  1. A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks.

    PubMed

    Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J; Pallarès Segarra, Esteve; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Sanvicente Gargallo, Emilio

    2015-01-01

    The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs. PMID:25897496

  2. Routing in Ad Hoc Network Using Ant Colony Optimization

    NASA Astrophysics Data System (ADS)

    Khanpara, Pimal; Valiveti, Sharada; Kotecha, K.

    The ad hoc networks have dynamic topology and are infrastructure less. So it is required to implement a new network protocol for providing efficient end to end communication based on TCP/IP structure. There is a need to re-define or modify the functions of each layer of TCP/IP model to provide end to end communication between nodes. The mobility of the nodes and the limited resources are the main reason for this change. The main challenge in ad hoc networks is routing. Due to the mobility of the nodes in the ad hoc networks, routing becomes very difficult. Ant based algorithms are suitable for routing in ad hoc networks due to its dynamic nature and adaptive behavior. There are number of routing algorithms based on the concept of ant colony optimizations. It is quite difficult to determine the best ant based algorithm for routing as these algorithms perform differently under various circumstances such as the traffic distribution and network topology. In this paper, the overview of such routing algorithms is given.

  3. Protocols for Detection and Removal of Wormholes for Secure Routing and Neighborhood Creation in Wireless Ad Hoc Networks

    ERIC Educational Resources Information Center

    Hayajneh, Thaier Saleh

    2009-01-01

    Wireless ad hoc networks are suitable and sometimes the only solution for several applications. Many applications, particularly those in military and critical civilian domains (such as battlefield surveillance and emergency rescue) require that ad hoc networks be secure and stable. In fact, security is one of the main barriers to the extensive use…

  4. Auto-Configuration Protocols in Mobile Ad Hoc Networks

    PubMed Central

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    The TCP/IP protocol allows the different nodes in a network to communicate by associating a different IP address to each node. In wired or wireless networks with infrastructure, we have a server or node acting as such which correctly assigns IP addresses, but in mobile ad hoc networks there is no such centralized entity capable of carrying out this function. Therefore, a protocol is needed to perform the network configuration automatically and in a dynamic way, which will use all nodes in the network (or part thereof) as if they were servers that manage IP addresses. This article reviews the major proposed auto-configuration protocols for mobile ad hoc networks, with particular emphasis on one of the most recent: D2HCP. This work also includes a comparison of auto-configuration protocols for mobile ad hoc networks by specifying the most relevant metrics, such as a guarantee of uniqueness, overhead, latency, dependency on the routing protocol and uniformity. PMID:22163814

  5. Auto-configuration protocols in mobile ad hoc networks.

    PubMed

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    The TCP/IP protocol allows the different nodes in a network to communicate by associating a different IP address to each node. In wired or wireless networks with infrastructure, we have a server or node acting as such which correctly assigns IP addresses, but in mobile ad hoc networks there is no such centralized entity capable of carrying out this function. Therefore, a protocol is needed to perform the network configuration automatically and in a dynamic way, which will use all nodes in the network (or part thereof) as if they were servers that manage IP addresses. This article reviews the major proposed auto-configuration protocols for mobile ad hoc networks, with particular emphasis on one of the most recent: D2HCP. This work also includes a comparison of auto-configuration protocols for mobile ad hoc networks by specifying the most relevant metrics, such as a guarantee of uniqueness, overhead, latency, dependency on the routing protocol and uniformity. PMID:22163814

  6. Routing Security in Ad Hoc Wireless Networks

    NASA Astrophysics Data System (ADS)

    Pervaiz, Mohammad O.; Cardei, Mihaela; Wu, Jie

    Wireless networks provide rapid, untethered access to information and computing, eliminating the barriers of distance, time, and location for many applications ranging from collaborative, distributed mobile computing to disaster recovery (such as fire, flood, earthquake), law enforcement (crowd control, search, and rescue), and military communications (command, control, surveillance, and reconnaissance). An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration [11

  7. Performance Improvement in Geographic Routing for Vehicular Ad Hoc Networks

    PubMed Central

    Kaiwartya, Omprakash; Kumar, Sushil; Lobiyal, D. K.; Abdullah, Abdul Hanan; Hassan, Ahmed Nazar

    2014-01-01

    Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and speed. PMID:25429415

  8. Reliable on-demand multicast routing with congestion control in wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Tang, Ken; Gerla, Mario

    2001-07-01

    In this paper, we address the congestion control multicast routing problem in wireless ad hoc networks through the medium access control (MAC) layer. We first introduce the Broadcast Medium Window (BMW) MAC protocol, which provides reliable delivery to broadcast packets at the MAC layer. We then extend the wireless On-Demand Multicast Routing Protocol (ODMRP) to facilitate congestion control in ad hoc networks using BMW. Through simulation, we show that ODMRP with congestion control adapts well to multicast sources that are aggressive in data transmissions.

  9. Fuzzy Multiple Metrics Link Assessment for Routing in Mobile Ad-Hoc Network

    NASA Astrophysics Data System (ADS)

    Soo, Ai Luang; Tan, Chong Eng; Tay, Kai Meng

    2011-06-01

    In this work, we investigate on the use of Sugeno fuzzy inference system (FIS) in route selection for mobile Ad-Hoc networks (MANETs). Sugeno FIS is introduced into Ad-Hoc On Demand Multipath Distance Vector (AOMDV) routing protocol, which is derived from its predecessor, Ad-Hoc On Demand Distance Vector (AODV). Instead of using the conventional way that considering only a single metric to choose the best route, our proposed fuzzy decision making model considers up to three metrics. In the model, the crisp inputs of the three parameters are fed into an FIS and being processed in stages, i.e., fuzzification, inference, and defuzzification. Finally, after experiencing all the stages, a single value score is generated from the combination metrics, which will be used to measure all the discovered routes credibility. Results obtained from simulations show a promising improvement as compared to AOMDV and AODV.

  10. Routing in wireless ad hoc and sensor network underground with sensor data in real-time

    NASA Astrophysics Data System (ADS)

    Odei-Lartey, Emmanuel; Hartmann, Klaus; Ahmadian, Hamidreza

    2012-05-01

    This paper first describes the innovative topology and structure of a wireless ad hoc and sensor network in a so called line-in-the-underground formation and the feasibility of achieving a reliable wireless connection underground with regards to a borehole telemetry system. It further describes a routing algorithm/protocol implementation based on a modification of the ad hoc on-demand distance vector protocol to achieve a reliable underground communication scheme for the wireless ad hoc network deployed underground for sensor data acquisition in real time as applied in the borehole telemetry system. Simulations and experiments are conducted to investigate and verify the effectiveness of this routing technique and the performance results are shown.

  11. MAC protocol for ad hoc networks using a genetic algorithm.

    PubMed

    Elizarraras, Omar; Panduro, Marco; Méndez, Aldo L; Reyna, Alberto

    2014-01-01

    The problem of obtaining the transmission rate in an ad hoc network consists in adjusting the power of each node to ensure the signal to interference ratio (SIR) and the energy required to transmit from one node to another is obtained at the same time. Therefore, an optimal transmission rate for each node in a medium access control (MAC) protocol based on CSMA-CDMA (carrier sense multiple access-code division multiple access) for ad hoc networks can be obtained using evolutionary optimization. This work proposes a genetic algorithm for the transmission rate election considering a perfect power control, and our proposition achieves improvement of 10% compared with the scheme that handles the handshaking phase to adjust the transmission rate. Furthermore, this paper proposes a genetic algorithm that solves the problem of power combining, interference, data rate, and energy ensuring the signal to interference ratio in an ad hoc network. The result of the proposed genetic algorithm has a better performance (15%) compared to the CSMA-CDMA protocol without optimizing. Therefore, we show by simulation the effectiveness of the proposed protocol in terms of the throughput. PMID:25140339

  12. MAC Protocol for Ad Hoc Networks Using a Genetic Algorithm

    PubMed Central

    Elizarraras, Omar; Panduro, Marco; Méndez, Aldo L.

    2014-01-01

    The problem of obtaining the transmission rate in an ad hoc network consists in adjusting the power of each node to ensure the signal to interference ratio (SIR) and the energy required to transmit from one node to another is obtained at the same time. Therefore, an optimal transmission rate for each node in a medium access control (MAC) protocol based on CSMA-CDMA (carrier sense multiple access-code division multiple access) for ad hoc networks can be obtained using evolutionary optimization. This work proposes a genetic algorithm for the transmission rate election considering a perfect power control, and our proposition achieves improvement of 10% compared with the scheme that handles the handshaking phase to adjust the transmission rate. Furthermore, this paper proposes a genetic algorithm that solves the problem of power combining, interference, data rate, and energy ensuring the signal to interference ratio in an ad hoc network. The result of the proposed genetic algorithm has a better performance (15%) compared to the CSMA-CDMA protocol without optimizing. Therefore, we show by simulation the effectiveness of the proposed protocol in terms of the throughput. PMID:25140339

  13. A Dirichlet reputation system in reliable routing of wireless ad hoc network

    SciTech Connect

    Yang, Dr. Li; Cui, Xiaohui; Cemerlic, Alma

    2010-01-01

    Ad hoc networks are very helpful in situations when no fixed network infrastructure is available, such as natural disasters and military conflicts. In such a network, all wireless nodes are equal peers simultaneously serving as both senders and routers for other nodes. Therefore, how to route packets through reliable paths becomes a fundamental problems when behaviors of certain nodes deviate from wireless ad hoc routing protocols. We proposed a novel Dirichlet reputation model based on Bayesian inference theory which evaluates reliability of each node in terms of packet delivery. Our system offers a way to predict and select a reliable path through combination of first-hand observation and second-hand reputation reports. We also proposed moving window mechanism which helps to adjust ours responsiveness of our system to changes of node behaviors. We integrated the Dirichlet reputation into routing protocol of wireless ad hoc networks. Our extensive simulation indicates that our proposed reputation system can improve good throughput of the network and reduce negative impacts caused by misbehaving nodes.

  14. Effective Route Maintenance and Restoration Schemes in Mobile Ad Hoc Networks

    PubMed Central

    Kang, Byung-Seok; Ko, In-Young

    2010-01-01

    This study proposes a location-based hybrid routing protocol to improve data packet delivery and to reduce control message overhead in mobile ad hoc networks. In mobile environments, where nodes move continuously at a high speed, it is generally difficult to maintain and restore route paths. Therefore, this study suggests a new flooding mechanism to control route paths. The essence of the proposed scheme is its effective tracking of the destination’s location based on the beacon messages of the main route nodes. Through experiments based on an NS-2 simulator, the proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as AODV, LAR, ZRP and AODV-DFR. PMID:22315570

  15. Analysis of a distributed algorithm to determine multiple routes with path diversity in ad hoc networks.

    SciTech Connect

    Ghosal, Dipak; Mueller, Stephen Ng

    2005-04-01

    With multipath routing in mobile ad hoc networks (MANETs), a source can establish multiple routes to a destination for routing data. In MANETs, mulitpath routing can be used to provide route resilience, smaller end-to-end delay, and better load balancing. However, when the multiple paths are close together, transmissions of different paths may interfere with each other, causing degradation in performance. Besides interference, the physical diversity of paths also improves fault tolerance. We present a purely distributed multipath protocol based on the AODV-Multipath (AODVM) protocol called AODVM with Path Diversity (AODVM/PD) that finds multiple paths with a desired degree of correlation between paths specified as an input parameter to the algorithm. We demonstrate through detailed simulation analysis that multiple paths with low degree of correlation determined by AODVM/PD provides both smaller end-to-end delay than AODVM in networks with low mobility and better route resilience in the presence of correlated node failures.

  16. A Token Ring Protocol for Dynamic Ad-hoc Wireless Environments

    SciTech Connect

    Top, P; Kohlhepp, V; Dowla, F

    2005-09-30

    A wireless ad-hoc networking protocol is presented. The protocol is designed to be flexible, easy to use and adaptable to a wide variety of potential applications. The primary considerations in design are small code size, guaranteed bandwidth access, limited delay, and error resilience in a highly dynamic ad-hoc environment. These considerations are achieved through the use of token ring protocol.

  17. Exploiting Location Information and Enabling Adaptive Mobile Ad Hoc Network Protocols

    NASA Astrophysics Data System (ADS)

    Boleng, Jeff

    2002-09-01

    Mobile Ad Hoc Networks (MANETs) consist of a group of mobile nodes which form a communication network without prior infrastructure. Each node in the network is responsible to provide services to other nodes in order to realize the ad hoc communication capability. A key component and primary challenge in MANETs is routing data packets over multiple hops between nodes. MANET routing has received considerable research interest recently. However, no routing protocol proposed to date has proven to be effective in the wide range of mobility conditions present in a MANET. We combine location information and mobility feedback to create an innovative MANET routing protocol which we prove is effective over a wide range of mobility conditions typical in a MANET. We introduce link duration as our mobility feedback metric, and we demonstrate that mobility feedback using link duration effectively enables adaptive MANET protocols. Using our mobility feedback agent, we develop a hybrid MANET routing protocol which adapts in order to combine the strengths of both component protocols while avoiding their weaknesses. Our hybrid, adaptive protocol achieves data packet delivery ratios above 80% in highly demanding network mobility conditions (i.e. link durations less than 4 seconds and node speeds up to 40 m/s). No existing MANET routing protocol can achieve such high performance operating alone. In addition we show that location information increases the performance of MANET routing. Finally, we develop a comprehensive set of mathematical models for data packet delivery ratio, overhead, and delay. These models confirm the suitability of link duration as a mobility metric, validate our simulation results and conclusions, and provide valuable insight into reactive MANET routing protocol operation.

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

    PubMed Central

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

  19. Reinforcement learning for routing in cognitive radio ad hoc networks.

    PubMed

    Al-Rawi, Hasan A A; Yau, Kok-Lim Alvin; Mohamad, Hafizal; Ramli, Nordin; Hashim, Wahidah

    2014-01-01

    Cognitive radio (CR) enables unlicensed users (or secondary users, SUs) to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs). Reinforcement learning (RL) is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate) through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs' network performance without significantly jeopardizing PUs' network performance, specifically SUs' interference to PUs. PMID:25140350

  20. IDMA: improving the defense against malicious attack for mobile ad hoc networks based on ARIP protocol

    NASA Astrophysics Data System (ADS)

    Peng, Chaorong; Chen, Chang Wen

    2008-04-01

    Malicious nodes are mounting increasingly sophisticated attacking operations on the Mobile Ad Hoc Networks (MANETs). This is mainly because the IP-based MANETs are vulnerable to attacks by various malicious nodes. However, the defense against malicious attack can be improved when a new layer of network architecture can be developed to separate true IP address from disclosing to the malicious nodes. In this paper, we propose a new algorithm to improve the defense against malicious attack (IDMA) that is based on a recently developed Assignment Router Identify Protocol (ARIP) for the clustering-based MANET management. In the ARIP protocol, we design the ARIP architecture based on the new Identity instead of the vulnerable IP addresses to provide the required security that is embedded seamlessly into the overall network architecture. We make full use of ARIP's special property to monitor gateway forward packets by Reply Request Route Packets (RREP) without additional intrusion detection layer. We name this new algorithm IDMA because of its inherent capability to improve the defense against malicious attacks. Through IDMA, a watching algorithm can be established so as to counterattack the malicious node in the routing path when it unusually drops up packets. We provide analysis examples for IDMA for the defense against a malicious node that disrupts the route discovery by impersonating the destination, or by responding with state of corrupted routing information, or by disseminating forged control traffic. The IDMA algorithm is able to counterattack the malicious node in the cases when the node lunch DoS attack by broadcast a large number of route requests, or make Target traffic congestion by delivering huge mount of data; or spoof the IP addresses and send forge packets with a fake ID to the same Target causing traffic congestion at that destination. We have implemented IDMA algorism using the GloMoSim simulator and have demonstrated its performance under a variety of

  1. Dynamic autonomous routing technology for IP-based satellite ad hoc networks

    NASA Astrophysics Data System (ADS)

    Wang, Xiaofei; Deng, Jing; Kostas, Theresa; Rajappan, Gowri

    2014-06-01

    IP-based routing for military LEO/MEO satellite ad hoc networks is very challenging due to network and traffic heterogeneity, network topology and traffic dynamics. In this paper, we describe a traffic priority-aware routing scheme for such networks, namely Dynamic Autonomous Routing Technology (DART) for satellite ad hoc networks. DART has a cross-layer design, and conducts routing and resource reservation concurrently for optimal performance in the fluid but predictable satellite ad hoc networks. DART ensures end-to-end data delivery with QoS assurances by only choosing routing paths that have sufficient resources, supporting different packet priority levels. In order to do so, DART incorporates several resource management and innovative routing mechanisms, which dynamically adapt to best fit the prevailing conditions. In particular, DART integrates a resource reservation mechanism to reserve network bandwidth resources; a proactive routing mechanism to set up non-overlapping spanning trees to segregate high priority traffic flows from lower priority flows so that the high priority flows do not face contention from low priority flows; a reactive routing mechanism to arbitrate resources between various traffic priorities when needed; a predictive routing mechanism to set up routes for scheduled missions and for anticipated topology changes for QoS assurance. We present simulation results showing the performance of DART. We have conducted these simulations using the Iridium constellation and trajectories as well as realistic military communications scenarios. The simulation results demonstrate DART's ability to discriminate between high-priority and low-priority traffic flows and ensure disparate QoS requirements of these traffic flows.

  2. Cross-layer protocols optimized for real-time multimedia services in energy-constrained mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2003-07-01

    Mobile ad hoc networking (MANET) supports self-organizing, mobile infrastructures and enables an autonomous network of mobile nodes that can operate without a wired backbone. Ad hoc networks are characterized by multihop, wireless connectivity via packet radios and by the need for efficient dynamic protocols. All routers are mobile and can establish connectivity with other nodes only when they are within transmission range. Importantly, ad hoc wireless nodes are resource-constrained, having limited processing, memory, and battery capacity. Delivery of high quality-ofservice (QoS), real-time multimedia services from Internet-based applications over a MANET is a challenge not yet achieved by proposed Internet Engineering Task Force (IETF) ad hoc network protocols in terms of standard performance metrics such as end-to-end throughput, packet error rate, and delay. In the distributed operations of route discovery and maintenance, strong interaction occurs across MANET protocol layers, in particular, the physical, media access control (MAC), network, and application layers. The QoS requirements are specified for the service classes by the application layer. The cross-layer design must also satisfy the battery-limited energy constraints, by minimizing the distributed power consumption at the nodes and of selected routes. Interactions across the layers are modeled in terms of the set of concatenated design parameters including associated energy costs. Functional dependencies of the QoS metrics are described in terms of the concatenated control parameters. New cross-layer designs are sought that optimize layer interdependencies to achieve the "best" QoS available in an energy-constrained, time-varying network. The protocol design, based on a reactive MANET protocol, adapts the provisioned QoS to dynamic network conditions and residual energy capacities. The cross-layer optimization is based on stochastic dynamic programming conditions derived from time-dependent models of

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

    PubMed Central

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

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

    PubMed

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

  5. Opportunistic Hybrid Transport Protocol (OHTP) for Cognitive Radio Ad Hoc Sensor Networks.

    PubMed

    Bin Zikria, Yousaf; Nosheen, Summera; Ishmanov, Farruh; Kim, Sung Won

    2015-01-01

    The inefficient assignment of spectrum for different communications purposes, plus technology enhancements and ever-increasing usage of wireless technology is causing spectrum scarcity. To address this issue, one of the proposed solutions in the literature is to access the spectrum dynamically or opportunistically. Therefore, the concept of cognitive radio appeared, which opens up a new research paradigm. There is extensive research on the physical, medium access control and network layers. The impact of the transport layer on the performance of cognitive radio ad hoc sensor networks is still unknown/unexplored. The Internet's de facto transport protocol is not well suited to wireless networks because of its congestion control mechanism. We propose an opportunistic hybrid transport protocol for cognitive radio ad hoc sensor networks. We developed a new congestion control mechanism to differentiate true congestion from interruption loss. After such detection and differentiation, we propose methods to handle them opportunistically. There are several benefits to window- and rate-based protocols. To exploit the benefits of both in order to enhance overall system performance, we propose a hybrid transport protocol. We empirically calculate the optimal threshold value to switch between window- and rate-based mechanisms. We then compare our proposed transport protocol to Transmission Control Protocol (TCP)-friendly rate control, TCP-friendly rate control for cognitive radio, and TCP-friendly window-based control. We ran an extensive set of simulations in Network Simulator 2. The results indicate that the proposed transport protocol performs better than all the others. PMID:26694396

  6. Distributive routing and congestion control in wireless multihop ad hoc communication networks

    NASA Astrophysics Data System (ADS)

    Glauche, Ingmar; Krause, Wolfram; Sollacher, Rudolf; Greiner, Martin

    2004-10-01

    Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example network connectivity, good data traffic performance and robustness are guaranteed. In this contribution the focus is on routing and congestion control. First, random data traffic along shortest path routes is studied by simulations as well as theoretical modeling. Measures of congestion like end-to-end time delay and relaxation times are given. A scaling law of the average time delay with respect to network size is revealed and found to depend on the underlying network topology. In the second step, a distributive routing and congestion control is proposed. Each node locally propagates its routing cost estimates and information about its congestion state to its neighbors, which then update their respective cost estimates. This allows for a flexible adaptation of end-to-end routes to the overall congestion state of the network. Compared to shortest-path routing, the critical network load is significantly increased.

  7. Opportunistic Hybrid Transport Protocol (OHTP) for Cognitive Radio Ad Hoc Sensor Networks

    PubMed Central

    Zikria, Yousaf Bin; Nosheen, Summera; Ishmanov, Farruh; Kim, Sung Won

    2015-01-01

    The inefficient assignment of spectrum for different communications purposes, plus technology enhancements and ever-increasing usage of wireless technology is causing spectrum scarcity. To address this issue, one of the proposed solutions in the literature is to access the spectrum dynamically or opportunistically. Therefore, the concept of cognitive radio appeared, which opens up a new research paradigm. There is extensive research on the physical, medium access control and network layers. The impact of the transport layer on the performance of cognitive radio ad hoc sensor networks is still unknown/unexplored. The Internet’s de facto transport protocol is not well suited to wireless networks because of its congestion control mechanism. We propose an opportunistic hybrid transport protocol for cognitive radio ad hoc sensor networks. We developed a new congestion control mechanism to differentiate true congestion from interruption loss. After such detection and differentiation, we propose methods to handle them opportunistically. There are several benefits to window- and rate-based protocols. To exploit the benefits of both in order to enhance overall system performance, we propose a hybrid transport protocol. We empirically calculate the optimal threshold value to switch between window- and rate-based mechanisms. We then compare our proposed transport protocol to Transmission Control Protocol (TCP)-friendly rate control, TCP-friendly rate control for cognitive radio, and TCP-friendly window-based control. We ran an extensive set of simulations in Network Simulator 2. The results indicate that the proposed transport protocol performs better than all the others. PMID:26694396

  8. Research of Ad Hoc Networks Access Algorithm

    NASA Astrophysics Data System (ADS)

    Xiang, Ma

    With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. When the ad hoc network is the access network of the internet, the gateway discovery protocol is very important to choose the most appropriate gateway to guarantee the connectivity between ad hoc network and IP based fixed networks. The paper proposes a QoS gateway discovery protocol which uses the time delay and stable route to the gateway selection conditions. And according to the gateway discovery protocol, it also proposes a fast handover scheme which can decrease the handover time and improve the handover efficiency.

  9. Enhanced Weight based DSR for Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Verma, Samant; Jain, Sweta

    2011-12-01

    Routing in ad hoc network is a great problematic, since a good routing protocol must ensure fast and efficient packet forwarding, which isn't evident in ad hoc networks. In literature there exists lot of routing protocols however they don't include all the aspects of ad hoc networks as mobility, device and medium constraints which make these protocols not efficient for some configuration and categories of ad hoc networks. Thus in this paper we propose an improvement of Weight Based DSR in order to include some of the aspects of ad hoc networks as stability, remaining battery power, load and trust factor and proposing a new approach Enhanced Weight Based DSR.

  10. PNNI routing support for ad hoc mobile networking: The multilevel case

    SciTech Connect

    Martinez, L.; Sholander, P.; Tolendino, L.

    1998-01-01

    This contribution extends the Outside Nodal Hierarchy List (ONHL) procedures described in ATM Forum Contributions 97-0766 and 97-0933. These extensions allow multiple mobile networks to form either an ad hoc network or an extension of a fixed PNNI infrastructure. A previous contribution (97-1073) covered the simplest case where the top-most Logical Group Nodes (LGNs), in those mobile networks, all resided at the same level in a PNNI hierarchy. This contribution covers the more general case wherein those top-most LGNs may reside at different PNNI hierarchy levels. Both of the SNL contributions consider flat ad hoc network architectures in the sense that each mobile network always participates in the PNNI hierarchy at the pre-configured level of its top-most LGN.

  11. PNNI routing support for ad hoc mobile networking: A flat architecture

    SciTech Connect

    Martinez, L.; Sholander, P.; Tolendino, L.

    1997-12-01

    This contribution extends the Outside Nodal Hierarchy List (ONHL) procedures described in ATM Form Contribution 97-0766. These extensions allow multiple mobile networks to form either an ad hoc network or an extension of a fixed PNNI infrastructure. This contribution covers the simplest case where the top-most Logical Group Nodes (LGNs), in those mobile networks, all reside at the same level in a PNNI hierarchy. Future contributions will cover the general case where those top-most LGNs reside at different hierarchy levels. This contribution considers a flat ad hoc network architecture--in the sense that each mobile network always participates in the PNNI hierarchy at the preconfigured level of its top-most LGN.

  12. Analytical Models of Cross-Layer Protocol Optimization in Real-Time Wireless Sensor Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    The real-time interactions among the nodes of a wireless sensor network (WSN) to cooperatively process data from multiple sensors are modeled. Quality-of-service (QoS) metrics are associated with the quality of fused information: throughput, delay, packet error rate, etc. Multivariate point process (MVPP) models of discrete random events in WSNs establish stochastic characteristics of optimal cross-layer protocols. Discrete-event, cross-layer interactions in mobile ad hoc network (MANET) protocols have been modeled using a set of concatenated design parameters and associated resource levels by the MVPPs. Characterization of the "best" cross-layer designs for a MANET is formulated by applying the general theory of martingale representations to controlled MVPPs. Performance is described in terms of concatenated protocol parameters and controlled through conditional rates of the MVPPs. Modeling limitations to determination of closed-form solutions versus explicit iterative solutions for ad hoc WSN controls are examined.

  13. EFFECT OF MOBILITY ON PERFORMANCE OF WIRELESS AD-HOC NETWORK PROTOCOLS.

    SciTech Connect

    Barrett, C. L.; Drozda, M.; Marathe, M. V.; Marathe, A.

    2001-01-01

    We empirically study the effect of mobility on the performance of protocols designed for wireless adhoc networks. An important ohjective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols was measured in terms of (i) latency, (ii) throughput, (iii) number of packels received, (iv) long term fairness and (v) number of control packets at the MAC layer level. Three different commonly studied routing protocols were used: AODV, DSR and LAR1. Similarly three well known MAC protocols were used: MACA, 802.1 1 and CSMA. The inair1 conclusion of our study include the following: 1. 'I'he performance of the: network varies widely with varying mobility models, packet injection rates and speeds; and can ba in fact characterized as fair to poor depending on the specific situation. Nevertheless, in general, it appears that the combination of AODV and 802.1 I is far better than other combination of routing and MAC protocols. 2. MAC layer protocols interact with routing layer protocols. This concept which is formalized using statistics implies that in general it is not meaningful to speak about a MAC or a routing protocol in isolation. Such an interaction leads to trade-offs between the amount of control packets generated by each layer. More interestingly, the results wise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. 3. Routing prolocols with distributed knowledge about routes are more suitable for networks with mobility. This is seen by comparing the performance of AODV with DSR or LAR scheme 1. In DSli and IAR scheme 1, information about a computed path is being stored in the route query control packct. 4. MAC layer protocols have varying performance with varying mobility models. It is

  14. Combined bio-inspired/evolutionary computational methods in cross-layer protocol optimization for wireless ad hoc sensor networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2011-06-01

    Published studies have focused on the application of one bio-inspired or evolutionary computational method to the functions of a single protocol layer in a wireless ad hoc sensor network (WSN). For example, swarm intelligence in the form of ant colony optimization (ACO), has been repeatedly considered for the routing of data/information among nodes, a network-layer function, while genetic algorithms (GAs) have been used to select transmission frequencies and power levels, physical-layer functions. Similarly, artificial immune systems (AISs) as well as trust models of quantized data reputation have been invoked for detection of network intrusions that cause anomalies in data and information; these act on the application and presentation layers. Most recently, a self-organizing scheduling scheme inspired by frog-calling behavior for reliable data transmission in wireless sensor networks, termed anti-phase synchronization, has been applied to realize collision-free transmissions between neighboring nodes, a function of the MAC layer. In a novel departure from previous work, the cross-layer approach to WSN protocol design suggests applying more than one evolutionary computational method to the functions of the appropriate layers to improve the QoS performance of the cross-layer design beyond that of one method applied to a single layer's functions. A baseline WSN protocol design, embedding GAs, anti-phase synchronization, ACO, and a trust model based on quantized data reputation at the physical, MAC, network, and application layers, respectively, is constructed. Simulation results demonstrate the synergies among the bioinspired/ evolutionary methods of the proposed baseline design improve the overall QoS performance of networks over that of a single computational method.

  15. Integrating Overlay Protocols for Providing Autonomic Services in Mobile Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    Gouvas, Panagiotis; Zafeiropoulos, Anastasios; Liakopoulos, Athanassios; Mentzas, Gregoris; Mitrou, Nikolas

    Next generation network characteristics increase the complexity in the design and provision of advanced services, making inappropriate the selection of traditional approaches. Future networks are becoming larger in scale, more dynamic and more heterogeneous. In order to cope with these requirements, services are expected to adapt to environmental conditions and require minimum human intervention. In this paper a new model for providing autonomous and decentralized services is proposed, especially focusing on mobile ad hoc networks (MANETs). Using a newly proposed four-layered approach, service development may be realized independently from the underlying physical network. In a reference implementation, it is demonstrated that it is possible to set up an overlay network that hides any network changes from the service layer. Multiple mechanisms have been adapted in order to efficiently — in terms of message exchanges and convergence time — operate over an ad hoc environment. Finally, it is demonstrated that a specific service could operate over a dynamic network with multiple failures.

  16. Malicious node detection in ad-hoc wireless networks

    NASA Astrophysics Data System (ADS)

    Griswold, Richard L.; Medidi, Sirisha R.

    2003-07-01

    Advances in wireless communications and the proliferation of mobile computing devices has led to the rise of a new type of computer network: the ad-hoc wireless network. Ad-hoc networks are characterized by a lack of fixed infrastructure, which give ad-hoc networks a great deal of flexibility, but also increases the risk of security problems. In wired networks, key pieces of network infrastructure are secured to prevent unauthorized physical access and tampering. Network administrators ensure that everything is properly configured and are on-hand to fix problems and deal with intrusions. In contrast, the nodes in an ad-hoc network are responsible for routing and forwarding data in the network, and there are no network administrators to handle potential problems. This makes an ad-hoc network more vulnerable to a misconfigured, faulty, or compromised node. We propose a means for a node in an ad-hoc network to detect and handle these malicious nodes by comparing data available to the routing protocol, such as cached routes in Dynamic Source Routing, ICMP messages, and transport layer information, such as TCP timeouts. This data can then be used along with network probes to isolate the malicious node.

  17. Declarative ad-hoc sensor networking

    NASA Astrophysics Data System (ADS)

    Coffin, Daniel A.; Van Hook, Daniel J.; McGarry, Stephen M.; Kolek, Stephen R.

    2000-11-01

    Networking protocols for distributed collaborative ad-hoc wireless sensing are constrained by requirements such as energy efficiency, scalability, and support for greater variations in topology than traditional fully wired or last- hop wireless (remote to base station) networks. In such a highly constrained and dynamic environment, conventional networking approaches are generally not adequate. A declarative approach to network configuration and organization appears to offer significant benefits. Declarative networking exploits application-supplied data descriptions to control network routing and resource allocation in such a way as to enhance energy efficiency and scalability. An implementation of this approach, called the Declarative Routing Protocol (DRP) has been developed as part of DARPA's Sensor Information Technology program. This paper introduces the concept of declarative networking and what distinguishes it from more conventional networking approaches, describes the Declarative Routing Protocol, and presents performance results from initial experiments.

  18. Distributed Reinforcement Learning Approach for Vehicular Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Wu, Celimuge; Kumekawa, Kazuya; Kato, Toshihiko

    In Vehicular Ad hoc Networks (VANETs), general purpose ad hoc routing protocols such as AODV cannot work efficiently due to the frequent changes in network topology caused by vehicle movement. This paper proposes a VANET routing protocol QLAODV (Q-Learning AODV) which suits unicast applications in high mobility scenarios. QLAODV is a distributed reinforcement learning routing protocol, which uses a Q-Learning algorithm to infer network state information and uses unicast control packets to check the path availability in a real time manner in order to allow Q-Learning to work efficiently in a highly dynamic network environment. QLAODV is favored by its dynamic route change mechanism, which makes it capable of reacting quickly to network topology changes. We present an analysis of the performance of QLAODV by simulation using different mobility models. The simulation results show that QLAODV can efficiently handle unicast applications in VANETs.

  19. Protocol independent adaptive route update for VANET.

    PubMed

    Rasheed, Asim; Ajmal, Sana; Qayyum, Amir

    2014-01-01

    High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptive route update usually becomes impractical for dense networks due to large routing overheads. This paper presents an adaptive route update approach which can provide solution for any baseline routing protocol. The proposed adaptation eliminates the classification of reactive and proactive by categorizing them as logical conditions to find and update the route. PMID:24723807

  20. Protocol Independent Adaptive Route Update for VANET

    PubMed Central

    Rasheed, Asim; Qayyum, Amir

    2014-01-01

    High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptive route update usually becomes impractical for dense networks due to large routing overheads. This paper presents an adaptive route update approach which can provide solution for any baseline routing protocol. The proposed adaptation eliminates the classification of reactive and proactive by categorizing them as logical conditions to find and update the route. PMID:24723807

  1. Design of multilevel heterogeneous ad-hoc wireless networks with UAVs

    NASA Astrophysics Data System (ADS)

    Gu, Daniel L.; Gerla, Mario; Ly, Henry; Xu, Kaixin; Kong, Jiejun; Hong, Xiaoyan

    2001-10-01

    Multi-Layer Ad Hoc Wireless Networks with UAVs is an ideal infrastructure to establish a rapidly deployable wireless communication system any time any where in the world for military applications. In this paper, we review the research we have done so far for our heterogeneous solution. First of all, we proposed the infrastructure of Multi-level Heterogeneous Ad-Hoc Wireless Network with UAVs. Second, we developed a new MAC layer protocol, Centralized Intelligent Channel Assigned Multiple Access (C-ICAMA), for ground mobile backbone nodes to access UAV. Third, we extended HSR (Hierarchical State Routing) to this Multi-Level Heterogeneous Ad-Hoc Wireless Network. Due to the intrinsic limitations of Extended HSR, we extended the Landmark Ad Hoc Routing (LANMAR) as our forth step. Security is a critical issue for mobile ad-hoc wireless networks, especially for military applications. We developed an embedded distributed security protocol and integrated with this heterogeneous hierarchical ad hoc wireless networks in our fifth step. Therefore, the hierarchical multi-layer approach is the most desirable approach to achieve routing scalability in multi-hop wireless networks.

  2. On the Connectivity, Lifetime and Hop Count of Routes Determined Using the City Section and Manhattan Mobility Models for Vehicular Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Meghanathan, Natarajan

    The high-level contribution of this paper is a simulation based analysis of the network connectivity, hop count and lifetime of the routes determined for vehicular ad hoc networks (VANETs) using the City Section and Manhattan mobility models. The Random Waypoint mobility model is used as a benchmark in the simulation studies. Two kinds of paths are determined on the sequence of static graphs representing the topology over the duration of the network session: paths with the minimum hop count (using the Dijkstra algorithm) and stable paths with the longest lifetime (using our recently proposed OptPathTrans algorithm). Simulation results indicate that the City Section model provided higher network connectivity compared to the Manhattan model for all the network scenarios. Minimum hop paths and stable paths determined under the Manhattan model have a smaller lifetime and larger hop count compared to those determined using the City Section and Random Waypoint mobility models.

  3. Ad Hoc Access Gateway Selection Algorithm

    NASA Astrophysics Data System (ADS)

    Jie, Liu

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

  4. Realistic Mobility Modeling for Vehicular Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Akay, Hilal; Tugcu, Tuna

    2009-08-01

    Simulations used for evaluating the performance of routing protocols for Vehicular Ad Hoc Networks (VANET) are mostly based on random mobility and fail to consider individual behaviors of the vehicles. Unrealistic assumptions about mobility produce misleading results about the behavior of routing protocols in real deployments. In this paper, a realistic mobility modeling tool, Mobility for Vehicles (MOVE), which considers the basic mobility behaviors of vehicles, is proposed for a more accurate evaluation. The proposed model is tested against the Random Waypoint (RWP) model using AODV and OLSR protocols. The results show that the mobility model significantly affects the number of nodes within the transmission range of a node, the volume of control traffic, and the number of collisions. It is shown that number of intersections, grid size, and node density are important parameters when dealing with VANET performance.

  5. Intelligent Sensing and Classification in DSR-Based Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Dempsey, Tae; Sahin, Gokhan; Morton, Yu T. (Jade

    Wireless ad hoc networks have fundamentally altered today's battlefield, with applications ranging from unmanned air vehicles to randomly deployed sensor networks. Security and vulnerabilities in wireless ad hoc networks have been considered at different layers, and many attack strategies have been proposed, including denial of service (DoS) through the intelligent jamming of the most critical packet types of flows in a network. This paper investigates the effectiveness of intelligent jamming in wireless ad hoc networks using the Dynamic Source Routing (DSR) and TCP protocols and introduces an intelligent classifier to facilitate the jamming of such networks. Assuming encrypted packet headers and contents, our classifier is based solely on the observable characteristics of size, inter-arrival timing, and direction and classifies packets with up to 99.4% accuracy in our experiments.

  6. A novel Smart Routing Protocol for remote health monitoring in Medical Wireless Networks.

    PubMed

    Sundararajan, T V P; Sumithra, M G; Maheswar, R

    2014-01-01

    In a Medical Wireless Network (MWN), sensors constantly monitor patient's physiological condition and movement. Inter-MWN communications are set up between the Patient Server and one or more Centralized Coordinators. However, MWNs require protocols with little energy consumption and the self-organizing attribute perceived in ad-hoc networks. The proposed Smart Routing Protocol (SRP) selects only the nodes with a higher residual energy and lower traffic density for routing. This approach enhances cooperation among the nodes of a Mobile Ad Hoc Network. Consequently, SRP produces better results than the existing protocols, namely Conditional Min-Max Battery Cost Routing, Min-Max Battery Cost Routing and AdHoc On-demand Distance Vector in terms of network parameters. The performance of the erstwhile schemes for routing protocols is evaluated using the network simulator Qualnet v 4.5. PMID:24691389

  7. Detecting and isolating malicious nodes in wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Li, Fanzhi; Jassim, Sabah

    2007-04-01

    Malicious nodes can seriously impair the performance of wireless ad hoc networks as a result of different actions such as packet dropping. Secure routes are shortest paths on which every node on the route is trusted even if unknown. Secure route discovery requires the adoption of mechanisms of associating trust to nodes. Most existing secure route discovery mechanisms rely on shared keys and digital signature. In the absence of central nodes that act as certification authority, such protocols suffer from heavy computational burden and are vulnerable to malicious attacks. In this paper we shall review existing techniques for secure routing and propose to complement route finding with creditability scores. Each node would have a credit list for its neighbors. Each node monitors its neighbors' pattern of delivering packets and regularly credits are reviewed and updated accordingly. Unlike most existing schemes the focus of our work is based on post route discovery stage, i.e. when packets are transmitted on discovered routes. The level of trust in any route will be based on the credits associated with the neighbors belonging to the discovered route. We shall evaluate the performance of the proposed scheme by modifying our simulation system so that each node has a dynamic changing "credit list" for its neighbors' behavior. We shall conduct a series of simulations with and without the proposed scheme and compare the results. We will demonstrate that the proposed mechanism is capable of isolating malicious nodes and thereby counteracting black hole attacks.

  8. An artificial immune system approach with secondary response for misbehavior detection in mobile ad hoc networks.

    PubMed

    Sarafijanović, Slavisa; Le Boudec, Jean-Yves

    2005-09-01

    In mobile ad hoc networks, nodes act both as terminals and information relays, and they participate in a common routing protocol, such as dynamic source routing (DSR). The network is vulnerable to routing misbehavior, due to faulty or malicious nodes. Misbehavior detection systems aim at removing this vulnerability. In this paper, we investigate the use of an artificial immune system (AIS) to detect node misbehavior in a mobile ad hoc network using DSR. The system is inspired by the natural immune system (IS) of vertebrates. Our goal is to build a system that, like its natural counterpart, automatically learns, and detects new misbehavior. We describe our solution for the classification task of the AIS; it employs negative selection and clonal selection, the algorithms for learning and adaptation used by the natural IS. We define how we map the natural IS concepts such as self, antigen, and antibody to a mobile ad hoc network and give the resulting algorithm for classifying nodes as misbehaving. We implemented the system in the network simulator Glomosim; we present detection results and discuss how the system parameters affect the performance of primary and secondary response. Further steps will extend the design by using an analogy to the innate system, danger signal, and memory cells. PMID:16252818

  9. Cross-Layer Service Discovery Mechanism for OLSRv2 Mobile Ad Hoc Networks.

    PubMed

    Vara, M Isabel; Campo, Celeste

    2015-01-01

    Service discovery plays an important role in mobile ad hoc networks (MANETs). The lack of central infrastructure, limited resources and high mobility make service discovery a challenging issue for this kind of network. This article proposes a new service discovery mechanism for discovering and advertising services integrated into the Optimized Link State Routing Protocol Version 2 (OLSRv2). In previous studies, we demonstrated the validity of a similar service discovery mechanism integrated into the previous version of OLSR (OLSRv1). In order to advertise services, we have added a new type-length-value structure (TLV) to the OLSRv2 protocol, called service discovery message (SDM), according to the Generalized MANET Packet/Message Format defined in Request For Comments (RFC) 5444. Each node in the ad hoc network only advertises its own services. The advertisement frequency is a user-configurable parameter, so that it can be modified depending on the user requirements. Each node maintains two service tables, one to store information about its own services and another one to store information about the services it discovers in the network. We present simulation results, that compare our service discovery integrated into OLSRv2 with the one defined for OLSRv1 and with the integration of service discovery in Ad hoc On-demand Distance Vector (AODV) protocol, in terms of service discovery ratio, service latency and network overhead. PMID:26205272

  10. Cross-Layer Service Discovery Mechanism for OLSRv2 Mobile Ad Hoc Networks

    PubMed Central

    Vara, M. Isabel; Campo, Celeste

    2015-01-01

    Service discovery plays an important role in mobile ad hoc networks (MANETs). The lack of central infrastructure, limited resources and high mobility make service discovery a challenging issue for this kind of network. This article proposes a new service discovery mechanism for discovering and advertising services integrated into the Optimized Link State Routing Protocol Version 2 (OLSRv2). In previous studies, we demonstrated the validity of a similar service discovery mechanism integrated into the previous version of OLSR (OLSRv1). In order to advertise services, we have added a new type-length-value structure (TLV) to the OLSRv2 protocol, called service discovery message (SDM), according to the Generalized MANET Packet/Message Format defined in Request For Comments (RFC) 5444. Each node in the ad hoc network only advertises its own services. The advertisement frequency is a user-configurable parameter, so that it can be modified depending on the user requirements. Each node maintains two service tables, one to store information about its own services and another one to store information about the services it discovers in the network. We present simulation results, that compare our service discovery integrated into OLSRv2 with the one defined for OLSRv1 and with the integration of service discovery in Ad hoc On-demand Distance Vector (AODV) protocol, in terms of service discovery ratio, service latency and network overhead. PMID:26205272

  11. An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks.

    PubMed

    Penumalli, Chakradhar; Palanichamy, Yogesh

    2015-01-01

    A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node's remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node's mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results. PMID:26221627

  12. An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks

    PubMed Central

    Penumalli, Chakradhar; Palanichamy, Yogesh

    2015-01-01

    A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node's remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node's mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results. PMID:26221627

  13. Service discovery with routing protocols for MANETs

    NASA Astrophysics Data System (ADS)

    Gu, Xuemai; Shi, Shuo

    2005-11-01

    Service discovery is becoming an important topic as its use throughout the Internet becomes more widespread. In Mobile Ad hoc Networks (MANETs), the routing protocol is very important because it is special network. To find a path for data, and destination nodes, nodes send packets to each node, creating substantial overhead traffic and consuming much time. Even though a variety of routing protocols have been developed for use in MANETs, they are insufficient for reducing overhead traffic and time. In this paper, we propose SDRP: a new service discovery protocol combined with routing policies in MANETs. The protocol is performed upon a distributed network. We describe a service by a unique ID number and use a group-cast routing policy in advertisement and request. The group-cast routing policy decreases the traffic in networks, and it is efficient to find destination node. In addition, the nodes included in the reply path also cache the advertisement information, and it means when each node finds a node next time, they can know where it is as soon as possible, so they minimize the time. Finally, we compare SDRP with both Flood and MAODV in terms of overload, and average delay. Simulation results show SDRP can spend less response time and accommodate even high mobility network environments.

  14. Stop_times based Routing Protocol for VANET

    NASA Astrophysics Data System (ADS)

    Moawad, Hafez; Shaaban, Eman; Taha Fayed, Zaki

    2013-11-01

    Vehicular Ad hoc Network (VANET) is a special class of Mobile Ad hoc Network (MANET) where vehicles are considered as MANET nodes with wireless links. The key difference of VANET and MANET is the special mobility pattern and rapidly changeable topology. There has been significant interest in improving safety and traffic efficiency using VANET. The design of routing protocols in VANET is important and necessary issue for support the smart ITS. Existing routing protocols of MANET are not suitable for VANET. AOMDV is the most important on demand multipath routing protocol. This paper proposes SSD-AOMDV as VANET routing protocol. SSD-AOMDV improves AOMDV to suit VANET characteristics. SSD-AOMDV adds the mobility parameters: Stop_times, Speed and Direction to hop count as new AOMDV routing metric to select next hop during the route discovery phase. Stop_times metric is added to simulate buses mobility pattern and traffic lights at intersections. Simulation results show that SSD-AOMDV achieves better performance compared to AOMDV.

  15. Topology Control in Large-Scale High Dynamic Mobile Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    El-Habbal, Mohamed; Rückert, Ulrich; Witkowski, Ulf

    We present our contribution in projects related to ad-hoc networking using different routing protocols and hardware platforms, showing our results and new solutions regarding topology control and routing protocols. We mainly focus on our work in the GUARDIANS EU-project, where as a main disaster scenario a large industrial warehouse on fire is assumed. The paper presents the simulation results for the routing protocols ACR, DSR and EDSR, as well as the implementation of down-scaled demos for supporting the autonomous team of robots as well as the human squad team with robust communication coverage. Various hardware platforms were used in the demos for distance measurement, based on laser range finder and radio communication with time of flight analysis.

  16. New efficiency algorithm for flooding the packet in wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Lee, Kyuhwan; Ma, Joongsoo

    2002-08-01

    This paper proposes a novel flooding algorithm based on an existing IEEE 802.11 MAC protocol in wireless ad hoc networks. Currently when we use the multi-hop routing algorithm, such as the Ad hoc On-demand Distance Vector (AODV) algorithm, the Cluster-Based Routing Protocol (CBRP) and so on, we frequently use the broadcast packet in order to get the topology information. At this time all nodes receiving the packet try to forward the received packet to other nodes. If a number of nodes are located in the sender's coverage, the channel is busy due to the delivery of the received packet. With respect to the coverage of the IEEE 802.11, the utilization factor of the wireless network is decreased because of occupying the channel to distribute the received packet. Thus we propose the new algorithm to resolve this problem. In this algorithm, each node maintains a table of immediate neighbors as well as each neighbor's neighbors. When each node receiving broadcast packets in the sender's coverage forwards the packets, it decides whether to forward them or not by comparing the neighbor list of receiver with that of sender. The proposed algorithm can increase the network efficiency due to the decrease in frequency of broadcast packets in the multi-hop routing protocol. Finally, we evaluate the improved performance through the simulation.

  17. Performance optimisation through EPT-WBC in mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Agarwal, Ratish; Gupta, Roopam; Motwani, Mahesh

    2016-03-01

    Mobile ad hoc networks are self-organised, infrastructure-less networks in which each mobile host works as a router to provide connectivity within the network. Nodes out of reach to each other can communicate with the help of intermediate routers (nodes). Routing protocols are the rules which determine the way in which these routing activities are to be performed. In cluster-based architecture, some selected nodes (clusterheads) are identified to bear the extra burden of network activities like routing. Selection of clusterheads is a critical issue which significantly affects the performance of the network. This paper proposes an enhanced performance and trusted weight-based clustering approach in which a number of performance factors such as trust, load balancing, energy consumption, mobility and battery power are considered for the selection of clusterheads. Moreover, the performance of the proposed scheme is compared with other existing approaches to demonstrate the effectiveness of the work.

  18. Anomaly Detection Techniques for Ad Hoc Networks

    ERIC Educational Resources Information Center

    Cai, Chaoli

    2009-01-01

    Anomaly detection is an important and indispensable aspect of any computer security mechanism. Ad hoc and mobile networks consist of a number of peer mobile nodes that are capable of communicating with each other absent a fixed infrastructure. Arbitrary node movements and lack of centralized control make them vulnerable to a wide variety of…

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

    NASA Astrophysics Data System (ADS)

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

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

  20. FRCA: a fuzzy relevance-based cluster head selection algorithm for wireless mobile ad-hoc sensor networks.

    PubMed

    Lee, Chongdeuk; Jeong, Taegwon

    2011-01-01

    Clustering is an important mechanism that efficiently provides information for mobile nodes and improves the processing capacity of routing, bandwidth allocation, and resource management and sharing. Clustering algorithms can be based on such criteria as the battery power of nodes, mobility, network size, distance, speed and direction. Above all, in order to achieve good clustering performance, overhead should be minimized, allowing mobile nodes to join and leave without perturbing the membership of the cluster while preserving current cluster structure as much as possible. This paper proposes a Fuzzy Relevance-based Cluster head selection Algorithm (FRCA) to solve problems found in existing wireless mobile ad hoc sensor networks, such as the node distribution found in dynamic properties due to mobility and flat structures and disturbance of the cluster formation. The proposed mechanism uses fuzzy relevance to select the cluster head for clustering in wireless mobile ad hoc sensor networks. In the simulation implemented on the NS-2 simulator, the proposed FRCA is compared with algorithms such as the Cluster-based Routing Protocol (CBRP), the Weighted-based Adaptive Clustering Algorithm (WACA), and the Scenario-based Clustering Algorithm for Mobile ad hoc networks (SCAM). The simulation results showed that the proposed FRCA achieves better performance than that of the other existing mechanisms. PMID:22163905

  1. Energy Efficient Probabilistic Broadcasting for Mobile Ad-Hoc Network

    NASA Astrophysics Data System (ADS)

    Kumar, Sumit; Mehfuz, Shabana

    2016-08-01

    In mobile ad-hoc network (MANETs) flooding method is used for broadcasting route request (RREQ) packet from one node to another node for route discovery. This is the simplest method of broadcasting of RREQ packets but it often results in broadcast storm problem, originating collisions and congestion of packets in the network. A probabilistic broadcasting is one of the widely used broadcasting scheme for route discovery in MANETs and provides solution for broadcasting storm problem. But it does not consider limited energy of the battery of the nodes. In this paper, a new energy efficient probabilistic broadcasting (EEPB) is proposed in which probability of broadcasting RREQs is calculated with respect to remaining energy of nodes. The analysis of simulation results clearly indicate that an EEPB route discovery scheme in ad-hoc on demand distance vector (AODV) can increase the network lifetime with a decrease in the average power consumption and RREQ packet overhead. It also decreases the number of dropped packets in the network, in comparison to other EEPB schemes like energy constraint gossip (ECG), energy aware gossip (EAG), energy based gossip (EBG) and network lifetime through energy efficient broadcast gossip (NEBG).

  2. Supporting Dynamic Ad hoc Collaboration Capabilities

    SciTech Connect

    Agarwal, Deborah A.; Berket, Karlo

    2003-07-14

    Modern HENP experiments such as CMS and Atlas involve as many as 2000 collaborators around the world. Collaborations this large will be unable to meet often enough to support working closely together. Many of the tools currently available for collaboration focus on heavy-weight applications such as videoconferencing tools. While these are important, there is a more basic need for tools that support connecting physicists to work together on an ad hoc or continuous basis. Tools that support the day-to-day connectivity and underlying needs of a group of collaborators are important for providing light-weight, non-intrusive, and flexible ways to work collaboratively. Some example tools include messaging, file-sharing, and shared plot viewers. An important component of the environment is a scalable underlying communication framework. In this paper we will describe our current progress on building a dynamic and ad hoc collaboration environment and our vision for its evolution into a HENP collaboration environment.

  3. Ad Hoc Selection of Voice over Internet Streams

    NASA Technical Reports Server (NTRS)

    Macha, Mitchell G. (Inventor); Bullock, John T. (Inventor)

    2008-01-01

    A method and apparatus for a communication system technique involving ad hoc selection of at least two audio streams is provided. Each of the at least two audio streams is a packetized version of an audio source. A data connection exists between a server and a client where a transport protocol actively propagates the at least two audio streams from the server to the client. Furthermore, software instructions executable on the client indicate a presence of the at least two audio streams, allow selection of at least one of the at least two audio streams, and direct the selected at least one of the at least two audio streams for audio playback.

  4. Ad Hoc Selection of Voice over Internet Streams

    NASA Technical Reports Server (NTRS)

    Macha, Mitchell G. (Inventor); Bullock, John T. (Inventor)

    2014-01-01

    A method and apparatus for a communication system technique involving ad hoc selection of at least two audio streams is provided. Each of the at least two audio streams is a packetized version of an audio source. A data connection exists between a server and a client where a transport protocol actively propagates the at least two audio streams from the server to the client. Furthermore, software instructions executable on the client indicate a presence of the at least two audio streams, allow selection of at least one of the at least two audio streams, and direct the selected at least one of the at least two audio streams for audio playback.

  5. 14 CFR 1203.903 - Ad hoc committees.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Ad hoc committees. 1203.903 Section 1203... NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is authorized to establish such ad hoc panels or subcommittees as may be necessary in the conduct of the...

  6. 14 CFR 1203.903 - Ad hoc committees.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 14 Aeronautics and Space 5 2011-01-01 2010-01-01 true Ad hoc committees. 1203.903 Section 1203.903... Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is authorized to establish such ad hoc panels or subcommittees as may be necessary in the conduct of the Committee's work....

  7. 21 CFR 14.90 - Ad hoc advisory committee members.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 21 Food and Drugs 1 2010-04-01 2010-04-01 false Ad hoc advisory committee members. 14.90 Section... PUBLIC HEARING BEFORE A PUBLIC ADVISORY COMMITTEE Members of Advisory Committees § 14.90 Ad hoc advisory committee members. In selecting members of an ad hoc advisory committee, the Commissioner may use...

  8. 21 CFR 14.90 - Ad hoc advisory committee members.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 21 Food and Drugs 1 2012-04-01 2012-04-01 false Ad hoc advisory committee members. 14.90 Section... PUBLIC HEARING BEFORE A PUBLIC ADVISORY COMMITTEE Members of Advisory Committees § 14.90 Ad hoc advisory committee members. In selecting members of an ad hoc advisory committee, the Commissioner may use...

  9. 21 CFR 14.90 - Ad hoc advisory committee members.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 21 Food and Drugs 1 2011-04-01 2011-04-01 false Ad hoc advisory committee members. 14.90 Section... PUBLIC HEARING BEFORE A PUBLIC ADVISORY COMMITTEE Members of Advisory Committees § 14.90 Ad hoc advisory committee members. In selecting members of an ad hoc advisory committee, the Commissioner may use...

  10. 14 CFR § 1203.803 - Ad hoc committees.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 14 Aeronautics and Space 5 2014-01-01 2014-01-01 false Ad hoc committees. § 1203.803 Section Â... PROGRAM Delegation of Authority To Make Determinations in Original Classification Matters § 1203.803 Ad hoc committees. The Chairperson is authorized to establish such ad hoc panels or subcommittees as...

  11. 14 CFR 1203.903 - Ad hoc committees.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 14 Aeronautics and Space 5 2013-01-01 2013-01-01 false Ad hoc committees. 1203.903 Section 1203... NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is authorized to establish such ad hoc panels or subcommittees as may be necessary in the conduct of the...

  12. 21 CFR 14.90 - Ad hoc advisory committee members.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 21 Food and Drugs 1 2014-04-01 2014-04-01 false Ad hoc advisory committee members. 14.90 Section... PUBLIC HEARING BEFORE A PUBLIC ADVISORY COMMITTEE Members of Advisory Committees § 14.90 Ad hoc advisory committee members. In selecting members of an ad hoc advisory committee, the Commissioner may use...

  13. 14 CFR 1203.903 - Ad hoc committees.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 14 Aeronautics and Space 5 2012-01-01 2012-01-01 false Ad hoc committees. 1203.903 Section 1203... NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is authorized to establish such ad hoc panels or subcommittees as may be necessary in the conduct of the...

  14. 14 CFR § 1203.903 - Ad hoc committees.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 14 Aeronautics and Space 5 2014-01-01 2014-01-01 false Ad hoc committees. § 1203.903 Section Â... PROGRAM NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is authorized to establish such ad hoc panels or subcommittees as may be necessary in the conduct of...

  15. 21 CFR 14.90 - Ad hoc advisory committee members.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 21 Food and Drugs 1 2013-04-01 2013-04-01 false Ad hoc advisory committee members. 14.90 Section... PUBLIC HEARING BEFORE A PUBLIC ADVISORY COMMITTEE Members of Advisory Committees § 14.90 Ad hoc advisory committee members. In selecting members of an ad hoc advisory committee, the Commissioner may use...

  16. On Trust Evaluation in Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Nguyen, Dang Quan; Lamont, Louise; Mason, Peter C.

    Trust has been considered as a social relationship between two individuals in human society. But, as computer science and networking have succeeded in using computers to automate many tasks, the concept of trust can be generalized to cover the reliability and relationships of non-human interaction, such as, for example, information gathering and data routing. This paper investigates the evaluation of trust in the context of ad hoc networks. Nodes evaluate each other’s behaviour based on observables. A node then decides whether to trust another node to have certain innate abilities. We show how accurate such an evaluation could be. We also provide the minimum number of observations required to obtain an accurate evaluation, a result that indicates that observation-based trust in ad hoc networks will remain a challenging problem. The impact of making networking decisions using trust evaluation on the network connectivity is also examined. In this manner, quantitative decisions can be made concerning trust-based routing with the knowledge of the potential impact on connectivity.

  17. Ad Hoc Networks: Headline 2000 Communications Analysis

    NASA Astrophysics Data System (ADS)

    Blair, W. D.; Reynolds, A. B.

    2002-06-01

    This report examines unit location data and terrain from Headline 2000 to investigate communications networks within the maneuver units. Within the Enhanced Combat Force timeframe, such units would be supported by a Tactical Data Distribution Sub-system (TDDS). This is envisaged as an ad hoc network changing its topology as units maneuver across the battlespace. The report describes approaches that can be applied to Headline 2000 and other data to characterize the nature of the network topology, both statically and as it changes over time, in order to explore the impact on the TDDS network capacity and hence to hence to assist in elucidating consequent requirements of a candidate TDDS.

  18. Maximizing the Effective Lifetime of Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Hossain, M. Julius; Dewan, M. Ali Akber; Chae, Oksam

    This paper presents a new routing approach to extend the effective lifetime of mobile ad hoc networks (MANET) considering both residual battery energy of the participating nodes and routing cost. As the nodes in ad hoc networks are limited in power, a power failure occurs if a node has insufficient remaining energy to send, receive or forward a message. So, it is important to minimize the energy expenditure as well as to balance the remaining battery power among the nodes. Cost effective routing algorithms attempt to minimize the total power needed to transmit a packet which causes a large number of nodes to loose energy quickly and die. On the other hand, lifetime prediction based routing algorithms try to balance the remaining energies among the nodes in the networks and ignore the transmission cost. These approaches extend the lifetime of first few individual nodes. But as nodes spend more energy for packet transfer, power failures occurs, within short interval resulting more number of total dead node earlier. This reduces the effective lifetime of the network, as at this stage successful communication is not possible due to the lack of forwarding node. The proposed method keeps the transmission power in modest range and at the same time tries to reduce the variance of the residual energy of the nodes more effectively to obtain the highest useful lifetime of the networks in the long run. Nonetheless, movement of nodes frequently creates network topology changes via link breaks and link creation and thus effects on the stability of the network. So, the pattern of the node movement is also incorporated in our route selection procedure.

  19. VANET Clustering Based Routing Protocol Suitable for Deserts

    PubMed Central

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

    2016-01-01

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

  20. VANET Clustering Based Routing Protocol Suitable for Deserts.

    PubMed

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

    2016-01-01

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

  1. Worm epidemics in wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Nekovee, Maziar

    2007-06-01

    A dramatic increase in the number of computing devices with wireless communication capability has resulted in the emergence of a new class of computer worms which specifically target such devices. The most striking feature of these worms is that they do not require Internet connectivity for their propagation but can spread directly from device to device using a short-range radio communication technology, such as WiFi or Bluetooth. In this paper, we develop a new model for epidemic spreading of these worms and investigate their spreading in wireless ad hoc networks via extensive Monte Carlo simulations. Our studies show that the threshold behaviour and dynamics of worm epidemics in these networks are greatly affected by a combination of spatial and temporal correlations which characterize these networks, and are significantly different from the previously studied epidemics in the Internet.

  2. Indoor Positioning - An Ad-Hoc Positioning System

    NASA Astrophysics Data System (ADS)

    Mautz, Rainer

    2008-06-01

    The aim of this paper is to discuss the development of an automatic, low-cost system that exploits current or near future wireless communications technology to enable continuous tracking of the location of devices in all environments. The development of such a wireless sensor network involves system design, digital signal processing, protocol development, extraction of ranges and localisation. This paper focuses on the user requirements, system architecture and network positioning. The user requirements are presented with a focus on applications in geodesy. A high level strategy for the positioning function is presented based on an ad-hoc geodetic network positioning method including issues of accuracy, quality and reliability of the node positions. Results show that it is possible to achieve a position deviation that is of the size of the ranging error.

  3. Spontaneous Ad Hoc Mobile Cloud Computing Network

    PubMed Central

    Lacuesta, Raquel; Sendra, Sandra; Peñalver, Lourdes

    2014-01-01

    Cloud computing helps users and companies to share computing resources instead of having local servers or personal devices to handle the applications. Smart devices are becoming one of the main information processing devices. Their computing features are reaching levels that let them create a mobile cloud computing network. But sometimes they are not able to create it and collaborate actively in the cloud because it is difficult for them to build easily a spontaneous network and configure its parameters. For this reason, in this paper, we are going to present the design and deployment of a spontaneous ad hoc mobile cloud computing network. In order to perform it, we have developed a trusted algorithm that is able to manage the activity of the nodes when they join and leave the network. The paper shows the network procedures and classes that have been designed. Our simulation results using Castalia show that our proposal presents a good efficiency and network performance even by using high number of nodes. PMID:25202715

  4. SVANET: A smart vehicular ad hoc network for efficient data transmission with wireless sensors.

    PubMed

    Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin

    2014-01-01

    Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET) architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency. PMID:25429409

  5. SVANET: A Smart Vehicular Ad Hoc Network for Efficient Data Transmission with Wireless Sensors

    PubMed Central

    Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin

    2014-01-01

    Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET) architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency. PMID:25429409

  6. On the Routing Protocol Influence on the Resilience of Wireless Sensor Networks to Jamming Attacks

    PubMed Central

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Monroy, Raul; Nolazco-Flores, Juan Arturo

    2015-01-01

    In this work, we compare a recently proposed routing protocol, the multi-parent hierarchical (MPH) protocol, with two well-known protocols, the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR). For this purpose, we have developed a simulator, which faithfully reifies the workings of a given protocol, considering a fixed, reconfigurable ad hoc network given by the number and location of participants, and general network conditions. We consider a scenario that can be found in a large number of wireless sensor network applications, a single sink node that collects all of the information generated by the sensors. The metrics used to compare the protocols were the number of packet retransmissions, carrier sense multiple access (CSMA) inner loop retries, the number of nodes answering the queries from the coordinator (sink) node and the energy consumption. We tested the network under ordinary (without attacks) conditions (and combinations thereof) and when it is subject to different types of jamming attacks (in particular, random and reactive jamming attacks), considering several positions for the jammer. Our results report that MPH has a greater ability to tolerate such attacks than DSR and AODV, since it minimizes and encapsulates the network segment under attack. The self-configuring capabilities of MPH derived from a combination of a proactive routes update, on a periodic-time basis, and a reactive behavior provide higher resilience while offering a better performance (overhead and energy consumption) than AODV and DSR, as shown in our simulation results. PMID:25825979

  7. Assured Information Sharing for Ad-Hoc Collaboration

    ERIC Educational Resources Information Center

    Jin, Jing

    2009-01-01

    Collaborative information sharing tends to be highly dynamic and often ad hoc among organizations. The dynamic natures and sharing patterns in ad-hoc collaboration impose a need for a comprehensive and flexible approach to reflecting and coping with the unique access control requirements associated with the environment. This dissertation…

  8. A Multimetric, Map-Aware Routing Protocol for VANETs in Urban Areas

    PubMed Central

    Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Igartua, Mónica Aguilar; Rebollo-Monedero, David; de la Cruz Llopis, Luis J.; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

    2014-01-01

    In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery. PMID:24476683

  9. A multimetric, map-aware routing protocol for VANETs in urban areas.

    PubMed

    Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Aguilar Igartua, Mónica; Rebollo-Monedero, David; de la Cruz Llopis, Luis J; Mezher, Ahmad Mohamad; Aguilar-Calderón, José Alfonso

    2014-01-01

    In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicles' trajectory and the available bandwidth, making use of the information retrieved by the sensors of the vehicle, in order to make forwarding decisions, minimizing packet losses and packet delay. Through simulation, we compare our proposal to other protocols, such as AODV (Ad hoc On-Demand Distance Vector), GPSR (Greedy Perimeter Stateless Routing), I-GPSR (Improvement GPSR) and to our previous proposal, GBSR-B (Greedy Buffer Stateless Routing Building-aware). Besides, we present a performance evaluation of the individual importance of each metric to make forwarding decisions. Experimental results show that our proposed forwarding decision outperforms existing solutions in terms of packet delivery. PMID:24476683

  10. Design of the next generation cognitive mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Amjad, Ali; Wang, Huiqiang; Chen, Xiaoming

    Cognition capability has been seen by researchers as the way forward for the design of next generation of Mobile Ad Hoc Networks (MANETs). The reason why a cognitive paradigm would be more suited to a MANET is because MANETs are highly dynamic networks. The topology may change very frequently during the operation of a MANET. Traffic patterns in MANETs can vary from time to time depending on the need of the users. The size of a MANET and node density is also very dynamic and may change without any predictable pattern. In a MANET environment, most of these parameters may change very rapidly and keeping track of them manually would be very difficult. Previous studies have shown that the performance of a certain routing approach in MANETs is dependent on the size of the network and node density. The choice of whether to use a reactive or proactive routing approach comes down to the network size parameter. Static or offline approaches to fine tune a MANET to achieve certain performance goals is hence not very productive as a lot of these parameters keep changing during the course of operation of MANETs. Similarly, the performance of MANETs would improve greatly if the MAC layer entity could operate in a more flexible manner. In this paper we propose a cognitive MANET design that will ensure that all these dynamic parameters are automatically monitored and decisions are based on the current status of these parameters.

  11. An Ad-hoc Satellite Network to Measure Filamentary Current Structures in the Auroral Zone

    NASA Astrophysics Data System (ADS)

    Nabong, C.; Fritz, T. A.; Semeter, J. L.

    2014-12-01

    An ad-hoc cubesat-based satellite network project known as ANDESITE is under development at Boston University. It aims to develop a dense constellation of easy-to-use, rapidly-deployable low-cost wireless sensor nodes in space. The objectives of the project are threefold: 1) Demonstrate viability of satellite based sensor networks by deploying an 8-node miniature sensor network to study the filamentation of the field aligned currents in the auroral zones of the Earth's magnetosphere. 2) Test the scalability of proposed protocols, including localization techniques, tracking, data aggregation, and routing, for a 3 dimensional wireless sensor network using a "flock" of nodes. 3) Construct a 6U Cube-sat running the Android OS as an integrated constellation manager, data mule and sensor node deplorer. This small network of sensor nodes will resolve current densities at different spatial resolutions in the near-Earth magnetosphere using measurements from magnetometers with 1-nT sensitivities and 0.2 nT/√Hz self-noise. Mapping of these currents will provide new constraints for models of auroral particle acceleration, wave-particle interactions, ionospheric destabilization, and other kinetic processes operating in the low-beta plasma of the near Earth magnetosphere.

  12. The Ad Hoc process to strengthen the framework convention on climate change

    SciTech Connect

    Ramakrishna, K.; Deutz, A.M.; Jacobsen, L.A.

    1995-11-01

    The Woods Hole Research Center convened an International Conference on The Ad Hoc Process to Strengthen the Framework Convention on Climate Change in Woods Hole, MA, on October 7-9, 1995. The conference was conducted to examine the prospects for successful adoption of a protocol to the Framework Convention on Climate Change by 1997. In preparation for the Second session of the Ad Hoc Group on the Berlin Mandate, several governmental and nongovernmental representatives met in Woods Hole to discuss the process and possible outcome of the Berlin Mandate negotiations for a protocol or other legal instrument to strengthen the Convention. The conference was by invitation and all participants attended in their personal capacities.

  13. Virtual machine-based simulation platform for mobile ad-hoc network-based cyber infrastructure

    DOE PAGESBeta

    Yoginath, Srikanth B.; Perumalla, Kayla S.; Henz, Brian J.

    2015-09-29

    In modeling and simulating complex systems such as mobile ad-hoc networks (MANETs) in de-fense communications, it is a major challenge to reconcile multiple important considerations: the rapidity of unavoidable changes to the software (network layers and applications), the difficulty of modeling the critical, implementation-dependent behavioral effects, the need to sustain larger scale scenarios, and the desire for faster simulations. Here we present our approach in success-fully reconciling them using a virtual time-synchronized virtual machine(VM)-based parallel ex-ecution framework that accurately lifts both the devices as well as the network communications to a virtual time plane while retaining full fidelity. At themore » core of our framework is a scheduling engine that operates at the level of a hypervisor scheduler, offering a unique ability to execute multi-core guest nodes over multi-core host nodes in an accurate, virtual time-synchronized manner. In contrast to other related approaches that suffer from either speed or accuracy issues, our framework provides MANET node-wise scalability, high fidelity of software behaviors, and time-ordering accuracy. The design and development of this framework is presented, and an ac-tual implementation based on the widely used Xen hypervisor system is described. Benchmarks with synthetic and actual applications are used to identify the benefits of our approach. The time inaccuracy of traditional emulation methods is demonstrated, in comparison with the accurate execution of our framework verified by theoretically correct results expected from analytical models of the same scenarios. In the largest high fidelity tests, we are able to perform virtual time-synchronized simulation of 64-node VM-based full-stack, actual software behaviors of MANETs containing a mix of static and mobile (unmanned airborne vehicle) nodes, hosted on a 32-core host, with full fidelity of unmodified ad-hoc routing protocols, unmodified

  14. Virtual machine-based simulation platform for mobile ad-hoc network-based cyber infrastructure

    SciTech Connect

    Yoginath, Srikanth B.; Perumalla, Kayla S.; Henz, Brian J.

    2015-09-29

    In modeling and simulating complex systems such as mobile ad-hoc networks (MANETs) in de-fense communications, it is a major challenge to reconcile multiple important considerations: the rapidity of unavoidable changes to the software (network layers and applications), the difficulty of modeling the critical, implementation-dependent behavioral effects, the need to sustain larger scale scenarios, and the desire for faster simulations. Here we present our approach in success-fully reconciling them using a virtual time-synchronized virtual machine(VM)-based parallel ex-ecution framework that accurately lifts both the devices as well as the network communications to a virtual time plane while retaining full fidelity. At the core of our framework is a scheduling engine that operates at the level of a hypervisor scheduler, offering a unique ability to execute multi-core guest nodes over multi-core host nodes in an accurate, virtual time-synchronized manner. In contrast to other related approaches that suffer from either speed or accuracy issues, our framework provides MANET node-wise scalability, high fidelity of software behaviors, and time-ordering accuracy. The design and development of this framework is presented, and an ac-tual implementation based on the widely used Xen hypervisor system is described. Benchmarks with synthetic and actual applications are used to identify the benefits of our approach. The time inaccuracy of traditional emulation methods is demonstrated, in comparison with the accurate execution of our framework verified by theoretically correct results expected from analytical models of the same scenarios. In the largest high fidelity tests, we are able to perform virtual time-synchronized simulation of 64-node VM-based full-stack, actual software behaviors of MANETs containing a mix of static and mobile (unmanned airborne vehicle) nodes, hosted on a 32-core host, with full fidelity of unmodified ad-hoc routing protocols, unmodified application

  15. Design of free patterns of nanocrystals with ad hoc features via templated dewetting

    SciTech Connect

    Aouassa, M.; Berbezier, I.; Favre, L.; Ronda, A.; Bollani, M.; Sordan, R.; Delobbe, A.; Sudraud, P.

    2012-07-02

    Design of monodisperse ultra-small nanocrystals (NCs) into large scale patterns with ad hoc features is demonstrated. The process makes use of solid state dewetting of a thin film templated through alloy liquid metal ion source focused ion beam (LMIS-FIB) nanopatterning. The solid state dewetting initiated at the edges of the patterns controllably creates the ordering of NCs with ad hoc placement and periodicity. The NC size is tuned by varying the nominal thickness of the film while their position results from the association of film retraction from the edges of the lay out and Rayleigh-like instability. The use of ultra-high resolution LMIS-FIB enables to produce monocrystalline NCs with size, periodicity, and placement tunable as well. It provides routes for the free design of nanostructures for generic applications in nanoelectronics.

  16. Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.

    PubMed

    Lee, HyungJune

    2014-01-01

    We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736

  17. Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

    PubMed Central

    Lee, HyungJune

    2014-01-01

    We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736

  18. Global Coverage from Ad-Hoc Constellations in Rideshare Orbits

    NASA Technical Reports Server (NTRS)

    Ellis, Armin; Mercury, Michael; Brown, Shannon

    2012-01-01

    A promising area of small satellite development is in providing higher temporal resolution than larger satellites. Traditional constellations have required specific orbits and dedicated launch vehicles. In this paper we discuss an alternative architecture in which the individual elements of the constellation are launched as rideshare opportunities. We compare the coverage of such an ad-hoc constellation with more traditional constellations. Coverage analysis is based on actual historical data from rideshare opportunities. Our analysis includes ground coverage and temporal revisits for Polar, Tropics, Temperate, and Global regions, comparing ad-hoc and Walker constellation.

  19. Metadata-driven Ad Hoc Query of Clinical Studies Data

    PubMed Central

    Deshpande, Aniruddha M.; Nadkarni, Prakash M.

    2001-01-01

    The Entity-Attribute-Value (EAV) data representation is widely used in both clinical patient record systems (CPRSs) and clinical study data management systems (CSDMS). Both of these systems are heterogeneous in that many types of data are also represented conventionally, a situation that complicates data display, editing and ad hoc query. Seamless functioning of such systems mandates the presence of developer-defined metadata (data describing the rest of the database) that records, among other things, how individual parameters are represented within the system. We illustrate a web-based ad hoc query tool that relies on the metadata to generate syntactically and semantically correct SQL.

  20. Energy-Saving Topology Control for Heterogeneous Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Zhang, Lei; Wang, Xuehui

    Topology control with per-node transmission power adjustment in wireless ad hoc networks has been shown to be effective with respect to prolonging network lifetime and increasing network capacity. In this paper, we propose a fully distributed, asynchronous and localized energy-saving topology control algorithm for heterogeneous ad hoc networks with non-uniform transmission ranges. We prove the topology derived from the algorithm preserves the network connectivity and bi-directionality. It need not the position system support and dramatically reduces the communication overhead compared to other topology control algorithms. Simulation results show the effectiveness of our proposed algorithm.

  1. Report of the Ad Hoc Committee on Scope and Sequence.

    ERIC Educational Resources Information Center

    Hergesheimer, John; And Others

    1989-01-01

    Describes the establishment of the Ad Hoc Committee on Scope and Sequence by the National Council for the Social Studies (NCSS). Outlines the responsibilities of the Committee, the process used to formulate curriculum criteria and the resultant criteria for social studies education curriculum design. (SLM)

  2. Providing Location Security in Vehicular Ad Hoc Networks

    ERIC Educational Resources Information Center

    Yan, Gongjun

    2010-01-01

    Location is fundamental information in Vehicular Ad-hoc Networks (VANETs). Almost all VANET applications rely on location information. Therefore it is of importance to ensure location information integrity, meaning that location information is original (from the generator), correct (not bogus or fabricated) and unmodified (value not changed). We…

  3. 14 CFR § 1203.1002 - Ad hoc committees.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 14 Aeronautics and Space 5 2014-01-01 2014-01-01 false Ad hoc committees. § 1203.1002 Section § 1203.1002 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION INFORMATION SECURITY PROGRAM Special Access Programs (SAP) and Sensitive Compartmented Information (SCI) Programs...

  4. Systematic lossy error protection for video transmission over wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Zhu, Xiaoqing; Rane, Shantanu; Girod, Bernd

    2005-07-01

    Wireless ad hoc networks present a challenge for error-resilient video transmission, since node mobility and multipath fading result in time-varying link qualities in terms of packet loss ratio and available bandwidth. In this paper, we propose to use a systematic lossy error protection (SLEP) scheme for video transmission over wireless ad hoc networks. The transmitted video signal has two parts-a systematic portion consisting of a video sequence transmitted without channel coding over an error-prone channel, and error protection information consisting of a bitstream generated by Wyner-Ziv encoding of the video sequence. Using an end-to-end video distortion model in conjunction with online estimates of packet loss ratio and available bandwidth, the optimal Wyner-Ziv description can be selected dynamically according to current channel conditions. The scheme can also be applied to choose one path for transmission from amongst multiple candidate routes with varying available bandwidths and packet loss ratios, so that the expected end-to-end video distortion is maximized. Experimental results of video transmission over a simulated ad hoc wireless network shows that the proposed SLEP scheme outperforms the conventional application layer FEC approach in that it provides graceful degradation of received video quality over a wider range of packet loss ratios and is less susceptible to inaccuracy in the packet loss ratio estimation.

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

    PubMed

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

    2016-01-01

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

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

    PubMed Central

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

    2016-01-01

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

  7. New Routing Metrics for ADHOC Network Routing Protocols

    NASA Astrophysics Data System (ADS)

    Reddy, P. C.

    2014-12-01

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

  8. Shuttle-run synchronization in mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Ma, Sheng-Fei; Bi, Hong-Jie; Zou, Yong; Liu, Zong-Hua; Guan, Shu-Guang

    2015-06-01

    In this work, we study the collective dynamics of phase oscillators in a mobile ad hoc network whose topology changes dynamically. As the network size or the communication radius of individual oscillators increases, the topology of the ad hoc network first undergoes percolation, forming a giant cluster, and then gradually achieves global connectivity. It is shown that oscillator mobility generally enhances the coherence in such networks. Interestingly, we find a new type of phase synchronization/clustering, in which the phases of the oscillators are distributed in a certain narrow range, while the instantaneous frequencies change signs frequently, leading to shuttle-run-like motion of the oscillators in phase space. We conduct a theoretical analysis to explain the mechanism of this synchronization and obtain the critical transition point.

  9. MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture

    PubMed Central

    Diaz, Juan R.; Jimenez, Jose M.; Sendra, Sandra

    2014-01-01

    Wireless Ad hoc networks provide a flexible and adaptable infrastructure to transport data over a great variety of environments. Recently, real-time audio and video data transmission has been increased due to the appearance of many multimedia applications. One of the major challenges is to ensure the quality of multimedia streams when they have passed through a wireless ad hoc network. It requires adapting the network architecture to the multimedia QoS requirements. In this paper we propose a new architecture to organize and manage cluster-based ad hoc networks in order to provide multimedia streams. Proposed architecture adapts the network wireless topology in order to improve the quality of audio and video transmissions. In order to achieve this goal, the architecture uses some information such as each node's capacity and the QoS parameters (bandwidth, delay, jitter, and packet loss). The architecture splits the network into clusters which are specialized in specific multimedia traffic. The real system performance study provided at the end of the paper will demonstrate the feasibility of the proposal. PMID:24737996

  10. Distinguishing congestion from malicious behavior in mobile ad-hoc networks

    NASA Astrophysics Data System (ADS)

    Ding, Jin; Medidi, Sirisha R.

    2004-08-01

    Packet dropping in Mobile Ad-hoc Networks could be a result of wireless link errors, congestion, or malicious packet drop attack. Current techniques for detecting malicious behavior either do not consider congestion in the network or are not able to detect in real time. Further more, they usually work at network layer. In this paper, we propose a TCP-Manet protocol, which reacts to congestion like TCP Reno protocol, and has additional capability to distinguish among congestion, wireless link error, and malicious packet drop attack. It is an end-to-end mechanism that does not require additional modifications to the nodes in the network. Since it is an extension of existing TCP protocol, it is compatible with existing protocols. It works in conjunction with the network layer and an unobtrusive monitor to assist the network in the detection and characterization of the nature of the behavior. Experimental results show that TCP-Manet has the same performance as that of TCP-Reno in wired network, and performs better in wireless ad-hoc networks in terms of throughput while having good detection effectiveness.

  11. 29 CFR 1912.11 - Terms of ad hoc committee members.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 29 Labor 7 2010-07-01 2010-07-01 false Terms of ad hoc committee members. 1912.11 Section 1912.11..., DEPARTMENT OF LABOR (CONTINUED) ADVISORY COMMITTEES ON STANDARDS Organizational Matters § 1912.11 Terms of ad hoc committee members. Each member of an ad hoc advisory committee shall serve for such period as...

  12. 29 CFR 1912.11 - Terms of ad hoc committee members.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 29 Labor 7 2013-07-01 2013-07-01 false Terms of ad hoc committee members. 1912.11 Section 1912.11..., DEPARTMENT OF LABOR (CONTINUED) ADVISORY COMMITTEES ON STANDARDS Organizational Matters § 1912.11 Terms of ad hoc committee members. Each member of an ad hoc advisory committee shall serve for such period as...

  13. 29 CFR 1912.11 - Terms of ad hoc committee members.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 29 Labor 7 2012-07-01 2012-07-01 false Terms of ad hoc committee members. 1912.11 Section 1912.11..., DEPARTMENT OF LABOR (CONTINUED) ADVISORY COMMITTEES ON STANDARDS Organizational Matters § 1912.11 Terms of ad hoc committee members. Each member of an ad hoc advisory committee shall serve for such period as...

  14. 29 CFR 1912.11 - Terms of ad hoc committee members.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 29 Labor 7 2014-07-01 2014-07-01 false Terms of ad hoc committee members. 1912.11 Section 1912.11..., DEPARTMENT OF LABOR (CONTINUED) ADVISORY COMMITTEES ON STANDARDS Organizational Matters § 1912.11 Terms of ad hoc committee members. Each member of an ad hoc advisory committee shall serve for such period as...

  15. 29 CFR 1912.11 - Terms of ad hoc committee members.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 29 Labor 7 2011-07-01 2011-07-01 false Terms of ad hoc committee members. 1912.11 Section 1912.11..., DEPARTMENT OF LABOR (CONTINUED) ADVISORY COMMITTEES ON STANDARDS Organizational Matters § 1912.11 Terms of ad hoc committee members. Each member of an ad hoc advisory committee shall serve for such period as...

  16. Power-Aware Intrusion Detection in Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Şen, Sevil; Clark, John A.; Tapiador, Juan E.

    Mobile ad hoc networks (MANETs) are a highly promising new form of networking. However they are more vulnerable to attacks than wired networks. In addition, conventional intrusion detection systems (IDS) are ineffective and inefficient for highly dynamic and resource-constrained environments. Achieving an effective operational MANET requires tradeoffs to be made between functional and non-functional criteria. In this paper we show how Genetic Programming (GP) together with a Multi-Objective Evolutionary Algorithm (MOEA) can be used to synthesise intrusion detection programs that make optimal tradeoffs between security criteria and the power they consume.

  17. Scalable Architecture for Multihop Wireless ad Hoc Networks

    NASA Technical Reports Server (NTRS)

    Arabshahi, Payman; Gray, Andrew; Okino, Clayton; Yan, Tsun-Yee

    2004-01-01

    A scalable architecture for wireless digital data and voice communications via ad hoc networks has been proposed. Although the details of the architecture and of its implementation in hardware and software have yet to be developed, the broad outlines of the architecture are fairly clear: This architecture departs from current commercial wireless communication architectures, which are characterized by low effective bandwidth per user and are not well suited to low-cost, rapid scaling in large metropolitan areas. This architecture is inspired by a vision more akin to that of more than two dozen noncommercial community wireless networking organizations established by volunteers in North America and several European countries.

  18. Routing Protocols in Wireless Sensor Networks

    PubMed Central

    Villalba, Luis Javier García; Orozco, Ana Lucila Sandoval; Cabrera, Alicia Triviño; Abbas, Cláudia Jacy Barenco

    2009-01-01

    The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks. PMID:22291515

  19. Cross-layer design for intrusion detection and data security in wireless ad hoc sensor networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2007-09-01

    A wireless ad hoc sensor network is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. The nodes are severely resource-constrained, with limited processing, memory and power capacities and must operate cooperatively to fulfill a common mission in typically unattended modes. In a wireless sensor network (WSN), each sensor at a node can observe locally some underlying physical phenomenon and sends a quantized version of the observation to sink (destination) nodes via wireless links. Since the wireless medium can be easily eavesdropped, links can be compromised by intrusion attacks from nodes that may mount denial-of-service attacks or insert spurious information into routing packets, leading to routing loops, long timeouts, impersonation, and node exhaustion. A cross-layer design based on protocol-layer interactions is proposed for detection and identification of various intrusion attacks on WSN operation. A feature set is formed from selected cross-layer parameters of the WSN protocol to detect and identify security threats due to intrusion attacks. A separate protocol is not constructed from the cross-layer design; instead, security attributes and quantified trust levels at and among nodes established during data exchanges complement customary WSN metrics of energy usage, reliability, route availability, and end-to-end quality-of-service (QoS) provisioning. Statistical pattern recognition algorithms are applied that use observed feature-set patterns observed during network operations, viewed as security audit logs. These algorithms provide the "best" network global performance in the presence of various intrusion attacks. A set of mobile (software) agents distributed at the nodes implement the algorithms, by moving among the layers involved in the network response at each active node

  20. Opportunistic Channel Scheduling for Ad Hoc Networks with Queue Stability

    NASA Astrophysics Data System (ADS)

    Dong, Lei; Wang, Yongchao

    2015-03-01

    In this paper, a distributed opportunistic channel access strategy in ad hoc network is proposed. We consider the multiple sources contend for the transmission opportunity, the winner source decides to transmit or restart contention based on the current channel condition. Owing to real data assumption at all links, the decision still needs to consider the stability of the queues. We formulate the channel opportunistic scheduling as a constrained optimization problem which maximizes the system average throughput with the constraints that the queues of all links are stable. The proposed optimization model is solved by Lyapunov stability in queueing theory. The successive channel access problem is decoupled into single optimal stopping problem at every frame and solved with Lyapunov algorithm. The threshold for every frame is different, and it is derived based on the instantaneous queue information. Finally, computer simulations are conducted to demonstrate the validity of the proposed strategy.

  1. Topology for efficient information dissemination in ad-hoc networking

    NASA Technical Reports Server (NTRS)

    Jennings, E.; Okino, C. M.

    2002-01-01

    In this paper, we explore the information dissemination problem in ad-hoc wirless networks. First, we analyze the probability of successful broadcast, assuming: the nodes are uniformly distributed, the available area has a lower bould relative to the total number of nodes, and there is zero knowledge of the overall topology of the network. By showing that the probability of such events is small, we are motivated to extract good graph topologies to minimize the overall transmissions. Three algorithms are used to generate topologies of the network with guaranteed connectivity. These are the minimum radius graph, the relative neighborhood graph and the minimum spanning tree. Our simulation shows that the relative neighborhood graph has certain good graph properties, which makes it suitable for efficient information dissemination.

  2. Ad hoc committee on global climate issues: Annual report

    USGS Publications Warehouse

    Gerhard, L.C.; Hanson, B.M.B.

    2000-01-01

    The AAPG Ad Hoc Committee on Global Climate Issues has studied the supposition of human-induced climate change since the committee's inception in January 1998. This paper details the progress and findings of the committee through June 1999. At that time there had been essentially no geologic input into the global climate change debate. The following statements reflect the current state of climate knowledge from the geologic perspective as interpreted by the majority of the committee membership. The committee recognizes that new data could change its conclusions. The earth's climate is constantly changing owing to natural variability in earth processes. Natural climate variability over recent geological time is greater than reasonable estimates of potential human-induced greenhouse gas changes. Because no tool is available to test the supposition of human-induced climate change and the range of natural variability is so great, there is no discernible human influence on global climate at this time.

  3. On the MAC/network/energy performance evaluation of Wireless Sensor Networks: Contrasting MPH, AODV, DSR and ZTR routing protocols.

    PubMed

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Orozco-Lugo, Aldo; Lara, Mauricio; Galván-Tejada, Giselle M; Olmedo, Oscar

    2014-01-01

    Wireless Sensor Networks deliver valuable information for long periods, then it is desirable to have optimum performance, reduced delays, low overhead, and reliable delivery of information. In this work, proposed metrics that influence energy consumption are used for a performance comparison among our proposed routing protocol, called Multi-Parent Hierarchical (MPH), the well-known protocols for sensor networks, Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Zigbee Tree Routing (ZTR), all of them working with the IEEE 802.15.4 MAC layer. Results show how some communication metrics affect performance, throughput, reliability and energy consumption. It can be concluded that MPH is an efficient protocol since it reaches the best performance against the other three protocols under evaluation, such as 19.3% reduction of packet retransmissions, 26.9% decrease of overhead, and 41.2% improvement on the capacity of the protocol for recovering the topology from failures with respect to AODV protocol. We implemented and tested MPH in a real network of 99 nodes during ten days and analyzed parameters as number of hops, connectivity and delay, in order to validate our Sensors 2014, 14 22812 simulator and obtain reliable results. Moreover, an energy model of CC2530 chip is proposed and used for simulations of the four aforementioned protocols, showing that MPH has 15.9% reduction of energy consumption with respect to AODV, 13.7% versus DSR, and 5% against ZTR. PMID:25474377

  4. On the MAC/Network/Energy Performance Evaluation of Wireless Sensor Networks: Contrasting MPH, AODV, DSR and ZTR Routing Protocols

    PubMed Central

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Orozco-Lugo, Aldo; Lara, Mauricio; Galván-Tejada, Giselle M.; Olmedo, Oscar

    2014-01-01

    Wireless Sensor Networks deliver valuable information for long periods, then it is desirable to have optimum performance, reduced delays, low overhead, and reliable delivery of information. In this work, proposed metrics that influence energy consumption are used for a performance comparison among our proposed routing protocol, called Multi-Parent Hierarchical (MPH), the well-known protocols for sensor networks, Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Zigbee Tree Routing (ZTR), all of them working with the IEEE 802.15.4 MAC layer. Results show how some communication metrics affect performance, throughput, reliability and energy consumption. It can be concluded that MPH is an efficient protocol since it reaches the best performance against the other three protocols under evaluation, such as 19.3% reduction of packet retransmissions, 26.9% decrease of overhead, and 41.2% improvement on the capacity of the protocol for recovering the topology from failures with respect to AODV protocol. We implemented and tested MPH in a real network of 99 nodes during ten days and analyzed parameters as number of hops, connectivity and delay, in order to validate our simulator and obtain reliable results. Moreover, an energy model of CC2530 chip is proposed and used for simulations of the four aforementioned protocols, showing that MPH has 15.9% reduction of energy consumption with respect to AODV, 13.7% versus DSR, and 5% against ZTR. PMID:25474377

  5. Implementation and performance evaluation of mobile ad hoc network for Emergency Telemedicine System in disaster areas.

    PubMed

    Kim, J C; Kim, D Y; Jung, S M; Lee, M H; Kim, K S; Lee, C K; Nah, J Y; Lee, S H; Kim, J H; Choi, W J; Yoo, S K

    2009-01-01

    So far we have developed Emergency Telemedicine System (ETS) which is a robust system using heterogeneous networks. In disaster areas, however, ETS cannot be used if the primary network channel is disabled due to damages on the network infrastructures. Thus we designed network management software for disaster communication network by combination of Mobile Ad hoc Network (MANET) and Wireless LAN (WLAN). This software maintains routes to a Backbone Gateway Node in dynamic network topologies. In this paper, we introduce the proposed disaster communication network with management software, and evaluate its performance using ETS between Medical Center and simulated disaster areas. We also present the results of network performance analysis which identifies the possibility of actual Telemedicine Service in disaster areas via MANET and mobile network (e.g. HSDPA, WiBro). PMID:19964544

  6. A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks

    PubMed Central

    Chen, Huifang; Ge, Linlin; Xie, Lei

    2015-01-01

    The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes. PMID:26184224

  7. Secure Adaptive Topology Control for Wireless Ad-Hoc Sensor Networks

    PubMed Central

    Hsueh, Ching-Tsung; Li, Yu-Wei; Wen, Chih-Yu; Ouyang, Yen-Chieh

    2010-01-01

    This paper presents a secure decentralized clustering algorithm for wireless ad-hoc sensor networks. The algorithm operates without a centralized controller, operates asynchronously, and does not require that the location of the sensors be known a priori. Based on the cluster-based topology, secure hierarchical communication protocols and dynamic quarantine strategies are introduced to defend against spam attacks, since this type of attacks can exhaust the energy of sensor nodes and will shorten the lifetime of a sensor network drastically. By adjusting the threshold of infected percentage of the cluster coverage, our scheme can dynamically coordinate the proportion of the quarantine region and adaptively achieve the cluster control and the neighborhood control of attacks. Simulation results show that the proposed approach is feasible and cost effective for wireless sensor networks. PMID:22205866

  8. A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks.

    PubMed

    Chen, Huifang; Ge, Linlin; Xie, Lei

    2015-01-01

    The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes. PMID:26184224

  9. Z306 molecular contamination ad hoc committee results

    NASA Technical Reports Server (NTRS)

    Golden, Johnny L.

    1992-01-01

    LDEF external surfaces which did not receive significant amounts of atomic oxygen were observed to be coated with a brown contamination, apparently the result of a condensed organic residue darkened due to UV radiation exposure. During the initial Materials Special Investigation Group (MSIG) Meeting after LDEF deintegration, held in Seattle - July 1990, this organic contamination was the subject of much discussion. The amount of contamination was thought to be significant and its source was immediately believed to be the Z306 black thermal control coating used to coat the entire inner surface of LDEF. Due to the size of the structure, it was not feasible to bake-out the coating. However, initial data on the contamination film was confusing in that significant amounts of silicon was observed by several different researchers. Silicon (from silicone) was not expected to be a potential outgassing product of the Z306 polyurethane coating. To investigate the connection between external contamination and the interior paint, a MSIG ad hoc committee was formed.

  10. Managing performance of DB2 Ad Hoc Reports

    SciTech Connect

    Chow, A.

    1994-02-01

    The DB2 financial reporting systems at Westinghouse Savannah River Company consists of 212 standardized reports that over 1034 users have accessed in 1993 to generate their reports. Each report has a range of selection criteria that the users can specify. Depending on the selection criteria, a report can access from a few rows to millions of rows of data. When this new DB2 system went into production in 1992, the CPU was at 100% utilization. From the beginning, ad hoc reports had a backlog of 4--5 days. Since DB2 was a new DBMS, most people blamed the poor report turn around times on DB2 as an inefficient DBMS and on a shortage of CPU cycles. Since we are unable to purchase a more powerful CPU, the only option left to us was to improve report turn around was system and application performance tuning. This document presents our efforts in these areas. Education of users in report submission was a starting point. And as to index tuning techniques that were applied, we created more friendly indexes, used clustering indexes, and used a reorganizing mechanism. A more efficient SQL was written which saved a lot of money.

  11. Algorithmic aspects of topology control problems for ad hoc networks

    SciTech Connect

    Liu, R.; Lloyd, E. L.; Marathe, M. V.; Ramanathan, R.; Ravi, S. S.

    2002-01-01

    Topology control problems are concerned with the assignment of power values to nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying some specified properties. This paper considers such problems under several optimization objectives, including minimizing the maximum power and minimizing the total power. A general approach leading to a polynomial algorithm is presented for minimizing maximum power for a class of graph properties, called monotone properties. The difficulty of generalizing the approach to properties that are not monoione is pointed out. Problems involving the minimization of total power are known to be NP-complete even for simple graph properties. A general approach that leads to an approximation algorithm for minimizing the total power for some monotone properties is presented. Using this approach, a new approximation algorithm for the problem of minimizing the total power for obtaining a 2-node-connected graph is obtained. It is shown that this algorithm provides a constant performance guarantee. Experimental results from an implementation of the approximation algorithm are also presented.

  12. Load-aware Flooding for Streaming over Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Utsu, Keisuke; Ishii, Hiroshi

    This paper discusses the streaming of high rate media such as video or audio information over ad hoc networks in disaster situations or for temporary events when it is difficult to use fixed infrastructure. The conventional simple flooding is not applicable for this application because it generates a large number of redundant rebroadcast and heavy traffic load to the network. To restrain redundant rebroadcast messages, several methods have been proposed. But since those studies do not take into account the actual load condition at each node that will affect network efficiency, they cannot achieve both ensuring the high message reachability and reducing redundant rebroadcast. In this paper, we propose two novel load-aware flooding methods using the MAC transmission queue information at each node to make the decision about whether rebroadcast messages should be sent or not. Through network simulations, we evaluate and show the effectiveness of our proposals. The result shows that our proposals achieve both ensuring high message reachability and restraint of redundant rebroadcast comparing with existing methods.

  13. Random Time Identity Based Firewall In Mobile Ad hoc Networks

    NASA Astrophysics Data System (ADS)

    Suman, Patel, R. B.; Singh, Parvinder

    2010-11-01

    A mobile ad hoc network (MANET) is a self-organizing network of mobile routers and associated hosts connected by wireless links. MANETs are highly flexible and adaptable but at the same time are highly prone to security risks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized control. Firewall is an effective means of protecting a local network from network-based security threats and forms a key component in MANET security architecture. This paper presents a review of firewall implementation techniques in MANETs and their relative merits and demerits. A new approach is proposed to select MANET nodes at random for firewall implementation. This approach randomly select a new node as firewall after fixed time and based on critical value of certain parameters like power backup. This approach effectively balances power and resource utilization of entire MANET because responsibility of implementing firewall is equally shared among all the nodes. At the same time it ensures improved security for MANETs from outside attacks as intruder will not be able to find out the entry point in MANET due to the random selection of nodes for firewall implementation.

  14. Intelligent self-organization methods for wireless ad hoc sensor networks based on limited resources

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2006-05-01

    A wireless ad hoc sensor network (WSN) is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. To a greater degree than the terminals found in mobile ad hoc networks (MANETs) for communications, sensor nodes are resource-constrained, with limited computational processing, bandwidth, memory, and power, and are typically unattended once in operation. Consequently, the level of information exchange among nodes, to support any complex adaptive algorithms to establish network connectivity and optimize throughput, not only deplete those limited resources and creates high overhead in narrowband communications, but also increase network vulnerability to eavesdropping by malicious nodes. Cooperation among nodes, critical to the mission of sensor networks, can thus be disrupted by the inappropriate choice of the method for self-organization. Recent published contributions to the self-configuration of ad hoc sensor networks, e.g., self-organizing mapping and swarm intelligence techniques, have been based on the adaptive control of the cross-layer interactions found in MANET protocols to achieve one or more performance objectives: connectivity, intrusion resistance, power control, throughput, and delay. However, few studies have examined the performance of these algorithms when implemented with the limited resources of WSNs. In this paper, self-organization algorithms for the initiation, operation and maintenance of a network topology from a collection of wireless sensor nodes are proposed that improve the performance metrics significant to WSNs. The intelligent algorithm approach emphasizes low computational complexity, energy efficiency and robust adaptation to change, allowing distributed implementation with the actual limited resources of the cooperative nodes of the network. Extensions of the

  15. 32 CFR 2800.7 - Designation of chairperson for Ad Hoc Committees.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 32 National Defense 6 2011-07-01 2011-07-01 false Designation of chairperson for Ad Hoc Committees... VICE PRESIDENT OF THE UNITED STATES SECURITY PROCEDURES § 2800.7 Designation of chairperson for Ad Hoc Committees. The Counsel to the Vice President is designated as the responsible official to chair Ad...

  16. 32 CFR 2800.7 - Designation of chairperson for Ad Hoc Committees.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 32 National Defense 6 2010-07-01 2010-07-01 false Designation of chairperson for Ad Hoc Committees... VICE PRESIDENT OF THE UNITED STATES SECURITY PROCEDURES § 2800.7 Designation of chairperson for Ad Hoc Committees. The Counsel to the Vice President is designated as the responsible official to chair Ad...

  17. 32 CFR 2800.7 - Designation of chairperson for Ad Hoc Committees.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 32 National Defense 6 2012-07-01 2012-07-01 false Designation of chairperson for Ad Hoc Committees... VICE PRESIDENT OF THE UNITED STATES SECURITY PROCEDURES § 2800.7 Designation of chairperson for Ad Hoc Committees. The Counsel to the Vice President is designated as the responsible official to chair Ad...

  18. Typicality Mediates Performance during Category Verification in Both Ad-Hoc and Well-Defined Categories

    ERIC Educational Resources Information Center

    Sandberg, Chaleece; Sebastian, Rajani; Kiran, Swathi

    2012-01-01

    Background: The typicality effect is present in neurologically intact populations for natural, ad-hoc, and well-defined categories. Although sparse, there is evidence of typicality effects in persons with chronic stroke aphasia for natural and ad-hoc categories. However, it is unknown exactly what influences the typicality effect in this…

  19. 32 CFR 2800.7 - Designation of chairperson for Ad Hoc Committees.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 32 National Defense 6 2014-07-01 2014-07-01 false Designation of chairperson for Ad Hoc Committees... VICE PRESIDENT OF THE UNITED STATES SECURITY PROCEDURES § 2800.7 Designation of chairperson for Ad Hoc Committees. The Counsel to the Vice President is designated as the responsible official to chair Ad...

  20. 32 CFR 2800.7 - Designation of chairperson for Ad Hoc Committees.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 32 National Defense 6 2013-07-01 2013-07-01 false Designation of chairperson for Ad Hoc Committees... VICE PRESIDENT OF THE UNITED STATES SECURITY PROCEDURES § 2800.7 Designation of chairperson for Ad Hoc Committees. The Counsel to the Vice President is designated as the responsible official to chair Ad...

  1. Data Delivery Method Based on Neighbor Nodes' Information in a Mobile Ad Hoc Network

    PubMed Central

    Hayashi, Takuma; Taenaka, Yuzo; Okuda, Takeshi; Yamaguchi, Suguru

    2014-01-01

    This paper proposes a data delivery method based on neighbor nodes' information to achieve reliable communication in a mobile ad hoc network (MANET). In a MANET, it is difficult to deliver data reliably due to instabilities in network topology and wireless network condition which result from node movement. To overcome such unstable communication, opportunistic routing and network coding schemes have lately attracted considerable attention. Although an existing method that employs such schemes, MAC-independent opportunistic routing and encoding (MORE), Chachulski et al. (2007), improves the efficiency of data delivery in an unstable wireless mesh network, it does not address node movement. To efficiently deliver data in a MANET, the method proposed in this paper thus first employs the same opportunistic routing and network coding used in MORE and also uses the location information and transmission probabilities of neighbor nodes to adapt to changeable network topology and wireless network condition. The simulation experiments showed that the proposed method can achieve efficient data delivery with low network load when the movement speed is relatively slow. PMID:24672371

  2. Does Ad Hoc Coronary Intervention Reduce Radiation Exposure? – Analysis of 568 Patients

    PubMed Central

    Truffa, Márcio A. M.; Alves, Gustavo M.P.; Bernardi, Fernando; Esteves Filho, Antonio; Ribeiro, Expedito; Galon, Micheli Z.; Spadaro, André; Kajita, Luiz J.; Arrieta, Raul; Lemos, Pedro A.

    2015-01-01

    Background Advantages and disadvantages of ad hoc percutaneous coronary intervention have been described. However little is known about the radiation exposure of that procedure as compared with the staged intervention. Objective To compare the radiation dose of the ad hoc percutaneous coronary intervention with that of the staged procedure Methods The dose-area product and total Kerma were measured, and the doses of the diagnostic and therapeutic procedures were added. In addition, total fluoroscopic time and number of acquisitions were evaluated. Results A total of 568 consecutive patients were treated with ad hoc percutaneous coronary intervention (n = 320) or staged percutaneous coronary intervention (n = 248). On admission, the ad hoc group had less hypertension (74.1% vs 81.9%; p = 0.035), dyslipidemia (57.8% vs. 67.7%; p = 0.02) and three-vessel disease (38.8% vs. 50.4%; p = 0.015). The ad hoc group was exposed to significantly lower radiation doses, even after baseline characteristic adjustment between both groups. The ad hoc group was exposed to a total dose-area product of 119.7 ± 70.7 Gycm2, while the staged group, to 139.2 ± 75.3 Gycm2 (p < 0.001). Conclusion Ad hoc percutaneous coronary intervention reduced radiation exposure as compared with diagnostic and therapeutic procedures performed at two separate times. PMID:26351982

  3. A Threshold-Adaptive Reputation System on Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Tsai, Hsiao-Chien; Lo, Nai-Wei; Wu, Tzong-Chen

    In recent years huge potential benefits from novel applications in mobile ad hoc networks (MANET) have been discussed extensively. However, without robust security mechanisms and systems to provide safety shell through the MANET infrastructure, MANET applications can be vulnerable and hammered by malicious attackers easily. In order to detect misbehaved message routing and identify malicious attackers in MANET, schemes based on reputation concept have shown their advantages in this area in terms of good scalability and simple threshold-based detection strategy. We observed that previous reputation schemes generally use predefined thresholds which do not take into account the effect of behavior dynamics between nodes in a period of time. In this paper, we propose a Threshold-Adaptive Reputation System (TARS) to overcome the shortcomings of static threshold strategy and improve the overall MANET performance under misbehaved routing attack. A fuzzy-based inference engine is introduced to evaluate the trustiness of a node's one-hop neighbors. Malicious nodes whose trust values are lower than the adaptive threshold, will be detected and filtered out by their honest neighbors during trustiness evaluation process. The results of network simulation show that the TARS outperforms other compared schemes under security attacks in most cases and at the same time reduces the decrease of total packet delivery ratio by 67% in comparison with MANET without reputation system.

  4. 75 FR 33838 - NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-06-15

    ... Parham, Exploration Systems Mission Directorate, National Aeronautics and Space Administration... SPACE ADMINISTRATION NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting AGENCY: National Aeronautics and Space Administration. ACTION: Notice of Meeting. SUMMARY: In accordance with...

  5. A Group Based Key Sharing and Management Algorithm for Vehicular Ad Hoc Networks

    PubMed Central

    Moharram, Mohammed Morsi; Azam, Farzana

    2014-01-01

    Vehicular ad hoc networks (VANETs) are one special type of ad hoc networks that involves vehicles on roads. Typically like ad hoc networks, broadcast approach is used for data dissemination. Blind broadcast to each and every node results in exchange of useless and irrelevant messages and hence creates an overhead. Unicasting is not preferred in ad-hoc networks due to the dynamic topology and the resource requirements as compared to broadcasting. Simple broadcasting techniques create several problems on privacy, disturbance, and resource utilization. In this paper, we propose media mixing algorithm to decide what information should be provided to each user and how to provide such information. Results obtained through simulation show that fewer number of keys are needed to share compared to simple broadcasting. Privacy is also enhanced through this approach. PMID:24587749

  6. Ad-hoc percutaneous coronary intervention and staged percutaneous coronary intervention.

    PubMed

    Rahman, Z; Paul, G K; Choudhury, A K

    2011-10-01

    Percutaneous coronary intervention (PCI) is a catheter based procedure where a catheter system is introduced through a systemic artery under local anesthesia in a stenotic coronary artery by controlled inflation of a distensible balloon. At early period, PCI was done in a separate session following coronary angiogram (Staged PCI) and it was more costly and hospital stay was long. As the expertization and laboratory facilities improved, the health care providers think about cost, hospital stay and patient convenience. So, to reduce the cost and patient preferred more PCI being done immediately following diagnostic catheterization (Ad-hoc PCI). Subsequently this Ad-hoc procedure becomes popular and now most of the PCI are Ad-hoc PCI worldwide. Rate of combined procedure (Ad-hoc) progressively increased from 54% in 1990 to 88% in 2000 with a significant decrease in rate of complications. In the initial study of Ad-hoc PCI suggested that Ad-hoc PCI should be done in selected group of patients as there was some potential risk factors (e.g. Multivessel diseases, unstable angina, aortic valve disease, and recent infarction or thrombolytic therapy) for Ad-hoc procedure and some (e.g. Older age, multivessel PTCA and complex lesion PTCA) for staged procedure. But recent studies showed that no significant difference in respect of safety and efficacy between Ad-hoc and staged PCI. Previous studies, in the era of balloon angioplasty from 1985 to 1995, Haraphonges et al. (1988), Rozenman et al. (1995) and Kimmel et al. (1997) suggested that an ad hoc approach is safe, with potentially more complications in patients with unstable angina pectoris or other high-risk factors. However, these reports have been limited to observational studies representing single institution experiences with small samples and inclusion of patients who underwent emergency PCI procedures. In Bangladesh a prospective observational study was done among 120 patients to compare the outcome of Ad-hoc and

  7. A Game Theory Algorithm for Intra-Cluster Data Aggregation in a Vehicular Ad Hoc Network.

    PubMed

    Chen, Yuzhong; Weng, Shining; Guo, Wenzhong; Xiong, Naixue

    2016-01-01

    Vehicular ad hoc networks (VANETs) have an important role in urban management and planning. The effective integration of vehicle information in VANETs is critical to traffic analysis, large-scale vehicle route planning and intelligent transportation scheduling. However, given the limitations in the precision of the output information of a single sensor and the difficulty of information sharing among various sensors in a highly dynamic VANET, effectively performing data aggregation in VANETs remains a challenge. Moreover, current studies have mainly focused on data aggregation in large-scale environments but have rarely discussed the issue of intra-cluster data aggregation in VANETs. In this study, we propose a multi-player game theory algorithm for intra-cluster data aggregation in VANETs by analyzing the competitive and cooperative relationships among sensor nodes. Several sensor-centric metrics are proposed to measure the data redundancy and stability of a cluster. We then study the utility function to achieve efficient intra-cluster data aggregation by considering both data redundancy and cluster stability. In particular, we prove the existence of a unique Nash equilibrium in the game model, and conduct extensive experiments to validate the proposed algorithm. Results demonstrate that the proposed algorithm has advantages over typical data aggregation algorithms in both accuracy and efficiency. PMID:26907272

  8. A Game Theory Algorithm for Intra-Cluster Data Aggregation in a Vehicular Ad Hoc Network

    PubMed Central

    Chen, Yuzhong; Weng, Shining; Guo, Wenzhong; Xiong, Naixue

    2016-01-01

    Vehicular ad hoc networks (VANETs) have an important role in urban management and planning. The effective integration of vehicle information in VANETs is critical to traffic analysis, large-scale vehicle route planning and intelligent transportation scheduling. However, given the limitations in the precision of the output information of a single sensor and the difficulty of information sharing among various sensors in a highly dynamic VANET, effectively performing data aggregation in VANETs remains a challenge. Moreover, current studies have mainly focused on data aggregation in large-scale environments but have rarely discussed the issue of intra-cluster data aggregation in VANETs. In this study, we propose a multi-player game theory algorithm for intra-cluster data aggregation in VANETs by analyzing the competitive and cooperative relationships among sensor nodes. Several sensor-centric metrics are proposed to measure the data redundancy and stability of a cluster. We then study the utility function to achieve efficient intra-cluster data aggregation by considering both data redundancy and cluster stability. In particular, we prove the existence of a unique Nash equilibrium in the game model, and conduct extensive experiments to validate the proposed algorithm. Results demonstrate that the proposed algorithm has advantages over typical data aggregation algorithms in both accuracy and efficiency. PMID:26907272

  9. Further Development of Synchronous Array Method for Ad Hoc Wireless Networks

    NASA Astrophysics Data System (ADS)

    Yu, Yuan; Huang, Yi; Zhao, Bin; Hua, Yingbo

    2008-12-01

    A further development of the synchronous array method (SAM) as a medium access control scheme for large-scale ad hoc wireless networks is presented. Under SAM, all transmissions of data packets between adjacent nodes are synchronized on a frame-by-frame basis, and the spacing between concurrent cochannel transmissions of data packets is properly controlled. An opportunistic SAM (O-SAM) is presented which allows concurrent cochannel transmissions to be locally adaptive to channel gain variations. A distributed SAM (D-SAM) is discussed that schedules all concurrent cochannel transmissions in a distributed fashion. For networks of low mobility, the control overhead required by SAM can be made much smaller than the payload. By analysis and simulation, the intranetwork throughput of O-SAM and D-SAM is evaluated. The effects of traffic load and multiple antennas on the intranetwork throughput are studied. The throughput of ALOHA is also analyzed and compared with that of O-SAM and D-SAM. By a distance-weighted throughput, a comparison of long distance transmission versus short distance transmission is also presented. The study of D-SAM reveals an important insight into the MSH-DSCH protocol adopted in IEEE 802.16 standards.

  10. Energy-Efficient Algorithm for Broadcasting in Ad Hoc Wireless Sensor Networks

    PubMed Central

    Xiong, Naixue; Huang, Xingbo; Cheng, Hongju; Wan, Zheng

    2013-01-01

    Broadcasting is a common and basic operation used to support various network protocols in wireless networks. To achieve energy-efficient broadcasting is especially important for ad hoc wireless sensor networks because sensors are generally powered by batteries with limited lifetimes. Energy consumption for broadcast operations can be reduced by minimizing the number of relay nodes based on the observation that data transmission processes consume more energy than data reception processes in the sensor nodes, and how to improve the network lifetime is always an interesting issue in sensor network research. The minimum-energy broadcast problem is then equivalent to the problem of finding the minimum Connected Dominating Set (CDS) for a connected graph that is proved NP-complete. In this paper, we introduce an Efficient Minimum CDS algorithm (EMCDS) with help of a proposed ordered sequence list. EMCDS does not concern itself with node energy and broadcast operations might fail if relay nodes are out of energy. Next we have proposed a Minimum Energy-consumption Broadcast Scheme (MEBS) with a modified version of EMCDS, and aimed at providing an efficient scheduling scheme with maximized network lifetime. The simulation results show that the proposed EMCDS algorithm can find smaller CDS compared with related works, and the MEBS can help to increase the network lifetime by efficiently balancing energy among nodes in the networks. PMID:23584121

  11. A Survey on Underwater Acoustic Sensor Network Routing Protocols

    PubMed Central

    Li, Ning; Martínez, José-Fernán; Meneses Chaus, Juan Manuel; Eckert, Martina

    2016-01-01

    Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research. PMID:27011193

  12. A Survey on Underwater Acoustic Sensor Network Routing Protocols.

    PubMed

    Li, Ning; Martínez, José-Fernán; Meneses Chaus, Juan Manuel; Eckert, Martina

    2016-01-01

    Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research. PMID:27011193

  13. The effects of malicious nodes on performance of mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Li, Fanzhi; Shi, Xiyu; Jassim, Sabah; Adams, Christopher

    2006-05-01

    Wireless ad hoc networking offers convenient infrastructureless communication over the shared wireless channel. However, the nature of ad hoc networks makes them vulnerable to security attacks. Unlike their wired counterpart, infrastructureless ad hoc networks do not have a clear line of defense, their topology is dynamically changing, and every mobile node can receive messages from its neighbors and can be contacted by all other nodes in its neighborhood. This poses a great danger to network security if some nodes behave in a malicious manner. The immediate concern about the security in this type of networks is how to protect the network and the individual mobile nodes against malicious act of rogue nodes from within the network. This paper is concerned with security aspects of wireless ad hoc networks. We shall present results of simulation experiments on ad hoc network's performance in the presence of malicious nodes. We shall investigate two types of attacks and the consequences will be simulated and quantified in terms of loss of packets and other factors. The results show that network performance, in terms of successful packet delivery ratios, significantly deteriorates when malicious nodes act according to the defined misbehaving characteristics.

  14. A Decentralized VPN Service over Generalized Mobile Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    Fujita, Sho; Shima, Keiichi; Uo, Yojiro; Esaki, Hiroshi

    We present a decentralized VPN service that can be built over generalized mobile ad-hoc networks (Generalized MANETs), in which topologies can be represented as a time-varying directed multigraph. We address wireless ad-hoc networks and overlay ad-hoc networks as instances of Generalized MANETs. We first propose an architecture to operate on various kinds of networks through a single set of operations. Then, we design and implement a decentralized VPN service on the proposed architecture. Through the development and operation of a prototype system we implemented, we found that the proposed architecture makes the VPN service applicable to each instance of Generalized MANETs, and that the VPN service makes it possible for unmodified applications to operate on the networks.

  15. Time geography for ad-hoc shared-ride trip planning in mobile geosensor networks

    NASA Astrophysics Data System (ADS)

    Raubal, Martin; Winter, Stephan; Teβmann, Sven; Gaisbauer, Christian

    Ad-hoc shared-ride trip planning in an urban environment is a complex task within a non-deterministic transportation network. Mobile geosensor networks provide the technical environment for realizing ad-hoc shared-ride trip planning: Network nodes are autonomous agents that interact locally by ad-hoc short-range communication and arrange for shared rides. In a mobile geosensor network, communication costs are critical because of constraints regarding bandwidth, available energy, and memory. This paper introduces spatio-temporal concepts from time geography, which can be employed during the planning process to significantly reduce communication costs. We will integrate network-based algorithms and different wayfinding strategies to assist both shared-ride clients and hosts in finding optimal travel assignments. Multi-agent geosimulation in a real street network is used to demonstrate the applicability of the approach and quantitatively confirm the theoretically foreseen reduction in communication costs.

  16. Impact of network structure on the capacity of wireless multihop ad hoc communication

    NASA Astrophysics Data System (ADS)

    Krause, Wolfram; Glauche, Ingmar; Sollacher, Rudolf; Greiner, Martin

    2004-07-01

    As a representative of a complex technological system, the so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a central control authority, the ad hoc nodes have to coordinate themselves such that the overall network performs in an optimal way. A performance indicator is the end-to-end throughput capacity. Various models, generating differing ad hoc network structure via differing transmission power assignments, are constructed and characterized. They serve as input for a generic data traffic simulation as well as some semi-analytic estimations. The latter reveal that due to the most-critical-node effect the end-to-end throughput capacity sensitively depends on the underlying network structure, resulting in differing scaling laws with respect to network size.

  17. Deny-by-Default Distributed Security Policy Enforcement in Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Alicherry, Mansoor; Keromytis, Angelos D.; Stavrou, Angelos

    Mobile Ad-hoc Networks (MANETs) are increasingly employed in tactical military and civil rapid-deployment networks, including emergency rescue operations and ad hoc disaster-relief networks. However, this flexibility of MANETs comes at a price, when compared to wired and base station-based wireless networks: MANETs are susceptible to both insider and outsider attacks. This is mainly because of the lack of a well-defined defense perimeter preventing the effective use of wired defenses including firewalls and intrusion detection systems.

  18. Data Security in Ad Hoc Networks Using Randomization of Cryptographic Algorithms

    NASA Astrophysics Data System (ADS)

    Krishna, B. Ananda; Radha, S.; Keshava Reddy, K. Chenna

    Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is how to feasibly detect and defend the major attacks against data, impersonation and unauthorized data modification. Also, in the same network some nodes may be malicious whose objective is to degrade the network performance. In this study, we propose a security model in which the packets are encrypted and decrypted using multiple algorithms where the selection scheme is random. The performance of the proposed model is analyzed and it is observed that there is no increase in control overhead but a slight delay is introduced due to the encryption process. We conclude that the proposed security model works well for heavily loaded networks with high mobility and can be extended for more cryptographic algorithms.

  19. Work, Family, and Community: Summary Proceedings of an Ad Hoc Committee.

    ERIC Educational Resources Information Center

    Hayes, Cheryl D., Ed.

    These proceedings contain summaries of five working group discussions and a discussion of suggestions for future research from an ad hoc meeting on Work, Family, and Community (Fedruary 21-22, 1980) in Washington, D.C. The meeting had these objectives: (1) to identify salient policy and research issues associated with changing patterns of labor…

  20. The 5th Meeting of the Ad Hoc Panel on Terminal Configured Vehicles

    NASA Technical Reports Server (NTRS)

    1977-01-01

    A report of the fifth meeting of the NASA Research and Technology Advisory Council, Ad Hoc panel on Terminal Configured Vehicles is presented. Some of the following topics were discussed; (1) microwave landing systems; (2) whole word computer system status; (3) flight path angle control: (4) VTOL approaches and landing technology; and (5) simulation study in wind shear.

  1. Report of the Ad Hoc Committee on Religious and Cultural Celebrations in the Library.

    ERIC Educational Resources Information Center

    Rathemacher, Andree; Grubman, Sheila Black; Lahiri, Amar; Gilton, Donna; Sharif, Mohammed

    The charge of the University of Rhode Island's Ad Hoc Committee on Religious and Cultural Celebrations in the Library was to: investigate all opportunities for the library to educate the campus community about religious and cultural holidays; consider all the major religions of the world and the possibility of having displays for the symbols of…

  2. Report of the Council for Exceptional Children's Ad Hoc Committee on Medically Fragile Students.

    ERIC Educational Resources Information Center

    Council for Exceptional Children, Reston, VA.

    New opportunities are available for students with special health care needs requiring specialized technological health care procedures for life support and/or health support, and attention to appropriate educational programs is required. Guidelines proposed by the Council for Exceptional Children's Ad Hoc Committee on Medically Fragile Students…

  3. Final Report of the IAG AD Hoc Working Group on Global Change

    NASA Technical Reports Server (NTRS)

    Dickey, Jean O.

    1995-01-01

    None given. Paper gives final report of the IAG ad hoc working group on global change. They made three main recommendations to the group: 1. the post of and IAG liaison or representative to the IGBP should be established. 2. A new core program,.

  4. 75 FR 43565 - NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-07-26

    ... SPACE ADMINISTRATION NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting AGENCY: National Aeronautics and Space Administration. ACTION: Notice of meeting. SUMMARY: In accordance with the Federal Advisory Committee Act, Public Law 92-463, as amended, the National Aeronautics and...

  5. 75 FR 15742 - NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-03-30

    ... SPACE ADMINISTRATION NASA Advisory Council; Ad-Hoc Task Force on Planetary Defense; Meeting AGENCY: National Aeronautics and Space Administration. ACTION: Notice of meeting. SUMMARY: In accordance with the Federal Advisory Committee Act, Public Law 92-463, as amended, the National Aeronautics and...

  6. A Survey on Clustering Routing Protocols in Wireless Sensor Networks

    PubMed Central

    Liu, Xuxun

    2012-01-01

    The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions. PMID:23112649

  7. Unsupervised algorithms for intrusion detection and identification in wireless ad hoc sensor networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2009-05-01

    In previous work by the author, parameters across network protocol layers were selected as features in supervised algorithms that detect and identify certain intrusion attacks on wireless ad hoc sensor networks (WSNs) carrying multisensor data. The algorithms improved the residual performance of the intrusion prevention measures provided by any dynamic key-management schemes and trust models implemented among network nodes. The approach of this paper does not train algorithms on the signature of known attack traffic, but, instead, the approach is based on unsupervised anomaly detection techniques that learn the signature of normal network traffic. Unsupervised learning does not require the data to be labeled or to be purely of one type, i.e., normal or attack traffic. The approach can be augmented to add any security attributes and quantified trust levels, established during data exchanges among nodes, to the set of cross-layer features from the WSN protocols. A two-stage framework is introduced for the security algorithms to overcome the problems of input size and resource constraints. The first stage is an unsupervised clustering algorithm which reduces the payload of network data packets to a tractable size. The second stage is a traditional anomaly detection algorithm based on a variation of support vector machines (SVMs), whose efficiency is improved by the availability of data in the packet payload. In the first stage, selected algorithms are adapted to WSN platforms to meet system requirements for simple parallel distributed computation, distributed storage and data robustness. A set of mobile software agents, acting like an ant colony in securing the WSN, are distributed at the nodes to implement the algorithms. The agents move among the layers involved in the network response to the intrusions at each active node and trustworthy neighborhood, collecting parametric values and executing assigned decision tasks. This minimizes the need to move large amounts

  8. SARA: a self-adaptive and resource-aware approach towards secure wireless ad hoc and sensor networks

    NASA Astrophysics Data System (ADS)

    Chigan, Chunxiao; Li, Leiyuan

    2005-05-01

    Providing security is essential for mission critical Wireless Ad Hoc and Sensor Networks (WAHSN) applications. Often a highly secure mechanism inevitably consumes a rather large amount of system resources, which in turn may unintentionally cause a Security Service Denial of Service (SSDoS) attack. This paper proposes a self-adaptive resource-aware (SARA) security provisioning approach for WAHSNs. For resource scarce WAHSNs, SARA strives to provide the optimal tradeoff between the sufficient security (which is reflected by the Security Index (SI)) and the acceptable network performance degradation (which is reflected by the Performance Index (PI)). With the support of the offline optimal secure protocol selection module and the online self-adaptive security control module, SARA is capable of employing different combinations of secure protocol sets to satisfy different security need at different condition for different applications. To determine the security index SI of a secure protocol set, a heuristic cross-layer security-service mapping mechanism is presented. Furthermore, we evaluate performance index PI of a secure protocol set via simulation followed by Analysis of Variance (ANOVA). Consequently, the proposed self-adaptive security provisioning based on both SI and PI achieves the maximum overall network security services and network performance services, without causing the SSDoS attack. Furthermore, this self-adaptive mechanism is capable of switching from one secure protocol set to another while keeping similar level of security and performance, it thus provides additional security by security service hopping.

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

    SciTech Connect

    Barrett, C. L.; Drozda, M.; Marathe, A.; Marathe, M. V.

    2002-01-01

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

  10. Ad Hoc Supervision of General Practice Registrars as a "Community of Practice": Analysis, Interpretation and Re-Presentation

    ERIC Educational Resources Information Center

    Clement, T.; Brown, J.; Morrison, J.; Nestel, D.

    2016-01-01

    General practice registrars in Australia undertake most of their vocational training in accredited general practices. They typically see patients alone from the start of their community-based training and are expected to seek timely ad hoc support from their supervisor. Such ad hoc encounters are a mechanism for ensuring patient safety, but also…

  11. Routing Issues in Opportunistic Networks

    NASA Astrophysics Data System (ADS)

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

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

  12. A Survey of Routing Protocols in Wireless Body Sensor Networks

    PubMed Central

    Bangash, Javed Iqbal; Abdullah, Abdul Hanan; Anisi, Mohammad Hossein; Khan, Abdul Waheed

    2014-01-01

    Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses. PMID:24419163

  13. Enhancements for distributed certificate authority approaches for mobile wireless ad hoc networks.

    SciTech Connect

    Van Leeuwen, Brian P.; Michalski, John T.; Anderson, William Erik

    2003-12-01

    Mobile wireless ad hoc networks that are resistant to adversarial manipulation are necessary for distributed systems used in military and security applications. Critical to the successful operation of these networks, which operate in the presence of adversarial stressors, are robust and efficient information assurance methods. In this report we describe necessary enhancements for a distributed certificate authority (CA) used in secure wireless network architectures. Necessary cryptographic algorithms used in distributed CAs are described and implementation enhancements of these algorithms in mobile wireless ad hoc networks are developed. The enhancements support a network's ability to detect compromised nodes and facilitate distributed CA services. We provide insights to the impacts the enhancements will have on network performance with timing diagrams and preliminary network simulation studies.

  14. Scope of practice in audiology. Ad Hoc Committee on scope of Practice in Audiology.

    PubMed

    1996-01-01

    This scope of practice in audiology statement is an official policy of the American Speech-Language Hearing Association (ASHA). The document was developed by the ASHA Ad Hoc Committee on the Scope of Practice in Audiology and approved in 1995 by the Legislative Council (8-95). Members of the ad hoc committee include David Wark (chair), Tamara Adkins, J. Michael Dennis, Dana L. Oviatt, Lori Williams, and Evelyn Cherow (ex officio). Lawrence Higdon, ASHA vice president for professional practices in audiology, served as monitoring vice president. This statement supersedes the Scope of Practice, Speech-Language Pathology and Audiology statement (LC 6-89), Asha, April 1990, 1-2. PMID:8680260

  15. Forming an ad-hoc nearby storage, based on IKAROS and social networking services

    NASA Astrophysics Data System (ADS)

    Filippidis, Christos; Cotronis, Yiannis; Markou, Christos

    2014-06-01

    We present an ad-hoc "nearby" storage, based on IKAROS and social networking services, such as Facebook. By design, IKAROS is capable to increase or decrease the number of nodes of the I/O system instance on the fly, without bringing everything down or losing data. IKAROS is capable to decide the file partition distribution schema, by taking on account requests from the user or an application, as well as a domain or a Virtual Organization policy. In this way, it is possible to form multiple instances of smaller capacity higher bandwidth storage utilities capable to respond in an ad-hoc manner. This approach, focusing on flexibility, can scale both up and down and so can provide more cost effective infrastructures for both large scale and smaller size systems. A set of experiments is performed comparing IKAROS with PVFS2 by using multiple clients requests under HPC IOR benchmark and MPICH2.

  16. Upper Bounding Service Capacity in Multihop Wireless SSMA-Based Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Du, Shirong; Daigle, John N.; Alidaee, Bahram

    Upper bounds on the service carrying capacity of a multihop, wireless, SSMA-based ad hoc network are considered herein. The network has a single radio band for transmission and reception. Each node can transmit to, or receive from, multiple nodes simultaneously. We formulate the scheduling of transmissions and control of transmit powers as a joint, mixed-integer, nonlinear optimization problem that yields maximum return at minimum power subject to SINR constraints. We present an efficient tabu search-based heuristic algorithm to solve the optimization problem and rigorously assess the quality of the results. Through analysis and simulation, we establish upper bounds on the VoIP call carrying capacity of the network as function of various parameters. We discuss the pros and cons of using SSMA as a spectrum sharing technique in wireless ad hoc networks

  17. Adhoc: an R package to calculate ad hoc distance thresholds for DNA barcoding identification.

    PubMed

    Sonet, Gontran; Jordaens, Kurt; Nagy, Zoltán T; Breman, Floris C; De Meyer, Marc; Backeljau, Thierry; Virgilio, Massimiliano

    2013-12-30

    Identification by DNA barcoding is more likely to be erroneous when it is based on a large distance between the query (the barcode sequence of the specimen to identify) and its best match in a reference barcode library. The number of such false positive identifications can be decreased by setting a distance threshold above which identification has to be rejected. To this end, we proposed recently to use an ad hoc distance threshold producing identifications with an estimated relative error probability that can be fixed by the user (e.g. 5%). Here we introduce two R functions that automate the calculation of ad hoc distance thresholds for reference libraries of DNA barcodes. The scripts of both functions, a user manual and an example file are available on the JEMU website (http://jemu.myspecies.info/computer-programs) as well as on the comprehensive R archive network (CRAN, http://cran.r-project.org). PMID:24453565

  18. Adhoc: an R package to calculate ad hoc distance thresholds for DNA barcoding identification

    PubMed Central

    Sonet, Gontran; Jordaens, Kurt; Nagy, Zoltán T.; Breman, Floris C.; De Meyer, Marc; Backeljau, Thierry; Virgilio, Massimiliano

    2013-01-01

    Abstract Identification by DNA barcoding is more likely to be erroneous when it is based on a large distance between the query (the barcode sequence of the specimen to identify) and its best match in a reference barcode library. The number of such false positive identifications can be decreased by setting a distance threshold above which identification has to be rejected. To this end, we proposed recently to use an ad hoc distance threshold producing identifications with an estimated relative error probability that can be fixed by the user (e.g. 5%). Here we introduce two R functions that automate the calculation of ad hoc distance thresholds for reference libraries of DNA barcodes. The scripts of both functions, a user manual and an example file are available on the JEMU website (http://jemu.myspecies.info/computer-programs) as well as on the comprehensive R archive network (CRAN, http://cran.r-project.org). PMID:24453565

  19. An Ad-Hoc Adaptive Pilot Model for Pitch Axis Gross Acquisition Tasks

    NASA Technical Reports Server (NTRS)

    Hanson, Curtis E.

    2012-01-01

    An ad-hoc algorithm is presented for real-time adaptation of the well-known crossover pilot model and applied to pitch axis gross acquisition tasks in a generic fighter aircraft. Off-line tuning of the crossover model to human pilot data gathered in a fixed-based high fidelity simulation is first accomplished for a series of changes in aircraft dynamics to provide expected values for model parameters. It is shown that in most cases, for this application, the traditional crossover model can be reduced to a gain and a time delay. The ad-hoc adaptive pilot gain algorithm is shown to have desirable convergence properties for most types of changes in aircraft dynamics.

  20. Vehicular ad hoc network for a surveillance system using multifrequency band enhancement

    NASA Astrophysics Data System (ADS)

    Bunruangses, Montree; Sunat, Khamron; Mitatha, Somsak; Yupapin, Preecha P.

    2010-09-01

    We present a new design of a surveillance system via a vehicular ad hoc network (VANET) integrated by a 3-G or 4-G cellular wireless network. We propose dense wavelength division multiplexing wavelength enhancement for increasing the channel capacity and signal security. Increase in the number of channels can be obtained by increasing the wavelength density. Signal security is introduced by a specific wavelength filter controlled by the central operator. Optical communication wavelength enhancement is reviewed. The advantage of this proposed system is that it can easily be implemented and incorporated into the existing communication link in either a cellular or ad hoc wireless system, where signal security and hence privacy can be provided.

  1. RHINO: armoured plated networking with intelligent high speed wireless ad hoc capability

    NASA Astrophysics Data System (ADS)

    Markarian, Garik; Singh, Farid

    2008-04-01

    This paper describes the concept of an intelligent high speed wireless ad-hoc network, which is currently being developed. The technology aims at, not replacing any of the existing standards, but aims to complement them in urban, military and hazardous environments. Known as Rhino, the technology is a platform independent, IP based network which will provide adequate bandwidth for real time video, audio and data traffic. The technology and specifications described in this paper are based on initial development of the technology.

  2. VoIP Implementation and Experiments on a Mobile Wireless AdHoc Network

    NASA Astrophysics Data System (ADS)

    Zhang, Hongqi; Yang, Oliver; Zhao, Jiying

    We have implemented a testbed to study the performance of VoIP in wireless ad hoc networks. The ASNC (Adaptive Source Network-rate Control) scheme is used to battle packet loss by feeding MOS (Mean Opinion Score) and loss information back to the sender. Our different VoIP experiments with measurements on delay, packet loss rate and MOS have validated the feasibility and efficiency of our scheme. It further verifies the simulator we used in the initial investigation.

  3. EGPS: An Efficient Privacy Preserving Scheme for Vehicular ad hoc Networks

    NASA Astrophysics Data System (ADS)

    Zhao, Baokang; Su, Xiangyu; Su, Jinshu; Song, Ziming; Sun, Yipin; Tao, Jing; Tang, Yong; Chen, Shuhui; Zhao, Guohong; Chen, Yijiao

    2010-09-01

    In this paper, we propose EGPS, an efficient privacy preserving scheme for vehicular ad hoc networks. The EGPS scheme is based on a very efficient group signature and Identity Based Cryptography(IBC) techniques. Several security properties of EGPS, including the correctness and unforgeability have been proved. Furthermore, EGPS is also proved to be more efficient than GSIS, which is currently one of the best state-of-the-art VANET privacy preserving schemes.

  4. In search of reflective behavior and shared understanding in ad hoc expert teams.

    PubMed

    Mulder, Ingrid; Swaak, Janine; Kessels, Joseph

    2004-04-01

    The work reported on here concentrates on virtual ad hoc expert teams for the integration of learning and working, as ad hoc teams seem to be one way to cope with complexity in a knowledge-intensive society. In order to let ad hoc teams learn and work together, group members require effective communication and shared understanding among each other. Two empirical studies were conducted to study collaborative learning and shared understanding, one exploratory study and one experiment. In the first study, it was explored how virtual design teams work and learn together. Based on conceptual ideas, collaborative learning and shared understanding were observed and assessed in a design team over a period of four months. It was concluded that shared understanding was suboptimal; mainly due to the effect that hardly any questions were raised and answered. The second study elaborates on the need to encourage question-answer patterns and reflective behavior in such teams. A tool was developed that supported questioning behavior. As it was hypothesized that this tool leads to better questioning behavior, which in turn results in more reflective behavior and in increased shared understanding, an experiment was conducted. In the exploratory study, as well as in the experimental study, the perceived shared understanding increased over time. However, in both studies suboptimal questioning behavior and little reflective activity were noticed. The main results of the two empirical studies are compared and discussed. PMID:15140358

  5. Real Time Semantic Interoperability in AD HOC Networks of Geospatial Data Sources: Challenges, Achievements and Perspectives

    NASA Astrophysics Data System (ADS)

    Mostafavi, M. A.; Bakillah, M.

    2012-07-01

    Recent advances in geospatial technologies have made available large amount of geospatial data. Meanwhile, new developments in Internet and communication technologies created a shift from isolated geospatial databases to ad hoc networks of geospatial data sources, where data sources can join or leave the network, and form groups to share data and services. However, effective integration and sharing of geospatial data among these data sources and their users are hampered by semantic heterogeneities. These heterogeneities affect the spatial, temporal and thematic aspects of geospatial concepts. There have been many efforts to address semantic interoperability issues in the geospatial domain. These efforts were mainly focused on resolving heterogeneities caused by different and implicit representations of the concepts. However, many approaches have focused on the thematic aspects, leaving aside the explicit representation of spatial and temporal aspects. Also, most semantic interoperability approaches for networks have focused on automating the semantic mapping process. However, the ad hoc network structure is continuously modified by source addition or removal, formation of groups, etc. This dynamic aspect is often neglected in those approaches. This paper proposes a conceptual framework for real time semantic interoperability in ad hoc networks of geospatial data sources. The conceptual framework presents the fundamental elements of real time semantic interoperability through a hierarchy of interrelated semantic states and processes. Then, we use the conceptual framework to set the discussion on the achievements that have already been made, the challenges that remain to be addressed and perspectives with respect to these challenges.

  6. Ad hoc CubeSat constellations: Secondary launch coverage and distribution

    NASA Astrophysics Data System (ADS)

    Marinan, A.; Nicholas, A.; Cahoy, K.

    The primary purpose of a constellation is to obtain global measurements with improved spatial and temporal resolution. The small size, low cost, standardized form factor, and increasing availability of commercial parts for CubeSats make them ideal for use in constellations. However, without taking advantage of secondary payload opportunities, it would be costly to launch and distribute a CubeSat constellation into a specific configuration. A cost-effective way to launch a constellation of CubeSats is via consecutive secondary payload launch opportunities, but the resulting constellation would be an ad hoc mix of orbit parameters. We focus on the feasibility of cobbling together constellation-like functionality from multiple secondary payload opportunities. Each participating CubeSat (or set of CubeSats) per launch could have completely different orbital parameters, even without propulsion onboard the CubeSats or intermediate transfer carriers. We look at the ground coverages that could be obtained for a constellation of five to six orbital planes with one to six satellites in each plane. We analyze past and announced future launch opportunities for CubeSats, including launch platforms supported by the NASA Educational Launch of Nanosatellites (ELaNa). We consider combinations of possible launch locations and temporal spacings over the course of one year and simulate the resulting ground coverage patterns and revisit times for an ad hoc constellation using these launch opportunities. We perform this analysis for two separate case studies - one with only US launches and one with both US and non-US opportunities - and vary the number of satellites per orbital plane. Typical CubeSat mission lifetimes and deorbit times for low-altitude orbits are included in these analyses. The ad hoc constellation results are compared to coverage from uniformly-placed LEO constellations and are quantified in terms of revisit time, time to 100% global coverage, and response time. For mu

  7. On interaction between MAC and transport layers for media streaming in 802.11 ad hoc networks

    NASA Astrophysics Data System (ADS)

    Nahm, Kitae; Helmy, Ahmed; Kuo, C.-C. Jay

    2004-10-01

    We examine the validity of TCP-friendliness and the utility of equation-based congestion control as a mean for the media streaming service in 802.11 multi-hop networks. Our investigation is motivated by the recent findings of the bandwidth-delay product of 802.11 multi-hop networks via intensive computer simulations. We show that TCP behavior in 802.11 multi-hop networks is generally inefficient and unstable because the standard TCP is too aggressive considering the low bandwidth-delay product of 802.11 networks. We introduce the concept of the `fractional window' mechanism (which resembles the stop-and-go protocol) for TCP, and show that the modified TCP is more stable and efficient while outperforming the legacy TCP in 802.11-based ad hoc networks. Finally, we show that many of the typical problems of TCP protocol (performance, network fairness, and TCP-friendliness) in 802.11 networks can be solved simply by increasing the bandwidth-delay product of 802.11 networks without any TCP modification. Based on this observation, we conclude that the assumption of the ideal steady-state TCP behavior is generally invalid in 802.11 multi-hop networking environment, and that congestion control based on TCP-friendly equation can hardly provide TCP-fair throughput and smoothness in 802.11 multi-hop networking environment.

  8. A Security Solution for IEEE 802.11's Ad-hoc Mode:Password-Authentication and Group Diffie-Hellman Key Exchange

    SciTech Connect

    Emmanuel, Bresson; Olivier, Chevassut; David, Pointcheval

    2005-10-01

    The IEEE 802 standards ease the deployment of networkinginfrastructures and enable employers to accesscorporate networks whiletraveling. These standards provide two modes of communication calledinfrastructure and ad-hoc modes. A security solution for the IEEE802.11's infrastructure mode took several years to reach maturity andfirmware are still been upgraded, yet a solution for the ad-hoc modeneeds to be specified. The present paper is a first attempt in thisdirection. It leverages the latest developments in the area ofpassword-based authentication and (group) Diffie-Hellman key exchange todevelop a provably-secure key-exchange protocol for IEEE 802.11's ad-hocmode. The protocol allows users to securely join and leave the wirelessgroup at time, accommodates either a single-shared password orpairwise-shared passwords among the group members, or at least with acentral server; achieves security against dictionary attacks in theideal-hash model (i.e. random-oracles). This is, to the best of ourknowledge, the first such protocol to appear in the cryptographicliterature.

  9. Dynamic fair node spectrum allocation for ad hoc networks using random matrices

    NASA Astrophysics Data System (ADS)

    Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

    2015-05-01

    Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

  10. Soil Property Mapping Over Large Areas Using Sparse Ad-hoc Samples

    NASA Astrophysics Data System (ADS)

    Zhu, A.; Liu, J.

    2011-12-01

    Information on spatial variation of soil properties over large areas is a critical input for environmental modeling at large scales. Yet, quality information on soil spatial variation over large areas is difficult to obtain due to the large number of field samples required. Existing samples are often sparse and ad-hoc. The soil property maps created from these samples using existing techniques are not only at low quality but also lack the uncertainty information. This paper presents a new approach to map soil properties and quantify uncertainty in the derived soil property maps over large areas using sparse and ad-hoc samples. The underlying assumption of this new approach is the soil-landscape concept which stipulates that the more similar the environment conditions between two locations the more similar the soil property values are between the two sites. Under this assumption each sample can be considered as a representative over areas of similar environmental conditions. The level of representation of an individual sample for an unsampled location can be approximated by the similarity between their respective environment conditions. Based on this "individual representation" concept and with a Case-based Reasoning (CBR) approach soil property values at unsampled locations can be predicted and the uncertainty associated with each prediction can also be quantified based on their environmental similarity to individual samples. A case study over the Illy Region, a 50,000 km2 area in Xinjiang, Northwest China, has demonstrated that the approach can be an effective alternative for mapping soil property and quantifying uncertainty over large areas with sparse and ad-hoc samples.

  11. Panel Discussion : Report of the APS Ad-Hoc Committee on LGBT Issues

    NASA Astrophysics Data System (ADS)

    Atherton, Tim; Barthelemy, Ramon; Garmon, Savannah; Reeves, Kyle; APS Ad-Hoc Committee on LGBT Issues Team

    Following the presentation of the findings and recommendations of the APS Ad-Hoc Committee on LGBT Issues (C-LGBT) by Committee Chair Michael Falk, a panel discussion will be held featuring several members of the committee. The discussion will focus on how APS can best ensure the recommendations of the committee are carried out in a timely fashion and other ideas on future APS efforts toward LGBT inclusion in physics. Discussion topics will also include the research and other input that shaped the committee's findings and recommendations.

  12. Joint Random Access and Power Control Game in Ad Hoc Networks with Noncooperative Users

    NASA Astrophysics Data System (ADS)

    Long, Chengnian; Guan, Xinping

    We consider a distributed joint random access and power control scheme for interference management in wireless ad hoc networks. To derive decentralized solutions that do not require any cooperation among the users, we formulate this problem as non-cooperative joint random access and power control game, in which each user minimizes its average transmission cost with a given rate constraint. Using supermodular game theory, the existence and uniqueness of Nash equilibrium are established. Furthermore, we present an asynchronous distributed algorithm to compute the solution of the game based on myopic best response updates, which converges to Nash equilibrium globally.

  13. Smart border: ad-hoc wireless sensor networks for border surveillance

    NASA Astrophysics Data System (ADS)

    He, Jun; Fallahi, Mahmoud; Norwood, Robert A.; Peyghambarian, Nasser

    2011-06-01

    Wireless sensor networks have been proposed as promising candidates to provide automated monitoring, target tracking, and intrusion detection for border surveillance. In this paper, we demonstrate an ad-hoc wireless sensor network system for border surveillance. The network consists of heterogeneously autonomous sensor nodes that distributively cooperate with each other to enable a smart border in remote areas. This paper also presents energy-aware and sleeping algorithms designed to maximize the operating lifetime of the deployed sensor network. Lessons learned in building the network and important findings from field experiments are shared in the paper.

  14. Linking Satellites Via Earth "Hot Spots" and the Internet to Form Ad Hoc Constellations

    NASA Technical Reports Server (NTRS)

    Mandl, Dan; Frye, Stu; Grosvenor, Sandra; Ingram, Mary Ann; Langley, John; Miranda, Felix; Lee, Richard Q.; Romanofsky, Robert; Zaman, Afoz; Popovic, Zoya

    2004-01-01

    As more assets are placed in orbit, opportunities emerge to combine various sets of satellites in temporary constellations to perform collaborative image collections. Often, new operations concepts for a satellite or set of satellites emerge after launch. To the degree with which new space assets can be inexpensively and rapidly integrated into temporary or "ad hoc" constellations, will determine whether these new ideas will be implemented or not. On the Earth Observing 1 (EO-1) satellite, a New Millennium Program mission, a number of experiments were conducted and are being conducted to demonstrate various aspects of an architecture that, when taken as a whole, will enable progressive mission autonomy. In particular, the target architecture will use adaptive ground antenna arrays to form, as close as possible, the equivalent of wireless access points for low earth orbiting satellites. Coupled with various ground and flight software and the Internet. the architecture enables progressive mission autonomy. Thus, new collaborative sensing techniques can be implemented post-launch. This paper will outline the overall operations concept and highlight details of both the research effort being conducted in ad hoc constellations, mission autonomy and

  15. A multihop key agreement scheme for wireless ad hoc networks based on channel characteristics.

    PubMed

    Hao, Zhuo; Zhong, Sheng; Yu, Nenghai

    2013-01-01

    A number of key agreement schemes based on wireless channel characteristics have been proposed recently. However, previous key agreement schemes require that two nodes which need to agree on a key are within the communication range of each other. Hence, they are not suitable for multihop wireless networks, in which nodes do not always have direct connections with each other. In this paper, we first propose a basic multihop key agreement scheme for wireless ad hoc networks. The proposed basic scheme is resistant to external eavesdroppers. Nevertheless, this basic scheme is not secure when there exist internal eavesdroppers or Man-in-the-Middle (MITM) adversaries. In order to cope with these adversaries, we propose an improved multihop key agreement scheme. We show that the improved scheme is secure against internal eavesdroppers and MITM adversaries in a single path. Both performance analysis and simulation results demonstrate that the improved scheme is efficient. Consequently, the improved key agreement scheme is suitable for multihop wireless ad hoc networks. PMID:23766725

  16. A Multihop Key Agreement Scheme for Wireless Ad Hoc Networks Based on Channel Characteristics

    PubMed Central

    Yu, Nenghai

    2013-01-01

    A number of key agreement schemes based on wireless channel characteristics have been proposed recently. However, previous key agreement schemes require that two nodes which need to agree on a key are within the communication range of each other. Hence, they are not suitable for multihop wireless networks, in which nodes do not always have direct connections with each other. In this paper, we first propose a basic multihop key agreement scheme for wireless ad hoc networks. The proposed basic scheme is resistant to external eavesdroppers. Nevertheless, this basic scheme is not secure when there exist internal eavesdroppers or Man-in-the-Middle (MITM) adversaries. In order to cope with these adversaries, we propose an improved multihop key agreement scheme. We show that the improved scheme is secure against internal eavesdroppers and MITM adversaries in a single path. Both performance analysis and simulation results demonstrate that the improved scheme is efficient. Consequently, the improved key agreement scheme is suitable for multihop wireless ad hoc networks. PMID:23766725

  17. A Network Coding Based Routing Protocol for Underwater Sensor Networks

    PubMed Central

    Wu, Huayang; Chen, Min; Guan, Xin

    2012-01-01

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

  18. A Security Analysis of the 802.11s Wireless Mesh Network Routing Protocol and Its Secure Routing Protocols

    PubMed Central

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

    2013-01-01

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

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

    PubMed

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

    2013-01-01

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

  20. Energy-efficient distributed constructions of miniumum spanning tree for wireless ad-hoc networks

    SciTech Connect

    Kumar, V. S. A.; Pandurangan, G.; Khan, M.

    2004-01-01

    The Minimum Spanning Tree (MST) problem is one of the most important and commonly occurring primitive in the design and operation of data and communication networks. While there a redistributed algorithms for the MST problem these require relatively large number of messages and time, and are fairly involved, require synchronization and a lot of book keeping; this makes these algorithms impractical for emerging technologies such as ad hoc and sensor networks. In such networks, a sensor has very limited power, and any algorithm needs to be simple, local and energy efficient for being practical. Motivated by these considerations, we study the performance of a class of simple and local algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient construction of MSTs in a wireless ad hoc setting. These employ a very simple idea to eliminate the work involved in cycle detection in other MST algorithms: each node chooses a distinct rank, and connects to the closest node of higher rank. We consider two variants of the NNT algorithms, obtained by two ways of choosing the ranks: (i) Random NNT, in which each node chooses a rank randomly, and (ii) Directional NNT, in which each node uses directional information for choosing the rank. We show provable bounds on the performance of these algorithms in instances obtained by uniformly distributed points in the unit square. Finally, we perform extensive simulations of our algorithms. We tested our algorithms on both uniformly random distributions of points, and on realistic distributions of points in an urban setting. The cost of the tree found by the NNT algorithms is within a factor of 2 of the MST, but there is more than a ten-fold saving on the energy and about a five fold saving on the number of messages sent. Also, our algorithms are significantly simpler to implement compared to, for instance, the GHS algorithm, which is essentially optimal with regards to the message complexity. Thus, our results

  1. Standardization of positive controls in diagnostic immunohistochemistry: recommendations from the International Ad Hoc Expert Committee.

    PubMed

    Torlakovic, Emina E; Nielsen, Søren; Francis, Glenn; Garratt, John; Gilks, Blake; Goldsmith, Jeffrey D; Hornick, Jason L; Hyjek, Elizabeth; Ibrahim, Merdol; Miller, Keith; Petcu, Eugen; Swanson, Paul E; Zhou, Xiaoge; Taylor, Clive R; Vyberg, Mogens

    2015-01-01

    Diagnostic immunohistochemistry (dIHC) has been practiced for several decades, with an ongoing expansion of applications for diagnostic use, and more recently for detection of prognostic and predictive biomarkers. However, standardization of practice has yet to be achieved, despite significant advances in methodology. An Ad Hoc Expert Committee was formed to address the standardization of controls, which is a missing link in demonstrating and assuring standardization of the various components of dIHC. This committee has also developed a concept of immunohistochemistry critical assay performance controls that are intended to facilitate methodology transfer and harmonization in dIHC. Furthermore, the committee has clarified definitions of IHC assay sensitivity and specificity, with special emphasis on how these definitions apply to positive controls. Recommendations for "best laboratory practice" regarding positive controls for dIHC are specified. The first set of immunohistochemistry critical assay performance controls for several frequently used IHC stains or tests is also developed and presented. PMID:25474126

  2. A high performance, ad-hoc, fuzzy query processing system for relational databases

    NASA Technical Reports Server (NTRS)

    Mansfield, William H., Jr.; Fleischman, Robert M.

    1992-01-01

    Database queries involving imprecise or fuzzy predicates are currently an evolving area of academic and industrial research. Such queries place severe stress on the indexing and I/O subsystems of conventional database environments since they involve the search of large numbers of records. The Datacycle architecture and research prototype is a database environment that uses filtering technology to perform an efficient, exhaustive search of an entire database. It has recently been modified to include fuzzy predicates in its query processing. The approach obviates the need for complex index structures, provides unlimited query throughput, permits the use of ad-hoc fuzzy membership functions, and provides a deterministic response time largely independent of query complexity and load. This paper describes the Datacycle prototype implementation of fuzzy queries and some recent performance results.

  3. An epidemic model for biological data fusion in ad hoc sensor networks

    NASA Astrophysics Data System (ADS)

    Chang, K. C.; Kotari, Vikas

    2009-05-01

    Bio terrorism can be a very refined and a catastrophic approach of attacking a nation. This requires the development of a complete architecture dedicatedly designed for this purpose which includes but is not limited to Sensing/Detection, Tracking and Fusion, Communication, and others. In this paper we focus on one such architecture and evaluate its performance. Various sensors for this specific purpose have been studied. The accent has been on use of Distributed systems such as ad-hoc networks and on application of epidemic data fusion algorithms to better manage the bio threat data. The emphasis has been on understanding the performance characteristics of these algorithms under diversified real time scenarios which are implemented through extensive JAVA based simulations. Through comparative studies on communication and fusion the performance of channel filter algorithm for the purpose of biological sensor data fusion are validated.

  4. Noise-Assisted Concurrent Multipath Traffic Distribution in Ad Hoc Networks

    PubMed Central

    Murata, Masayuki

    2013-01-01

    The concept of biologically inspired networking has been introduced to tackle unpredictable and unstable situations in computer networks, especially in wireless ad hoc networks where network conditions are continuously changing, resulting in the need of robustness and adaptability of control methods. Unfortunately, existing methods often rely heavily on the detailed knowledge of each network component and the preconfigured, that is, fine-tuned, parameters. In this paper, we utilize a new concept, called attractor perturbation (AP), which enables controlling the network performance using only end-to-end information. Based on AP, we propose a concurrent multipath traffic distribution method, which aims at lowering the average end-to-end delay by only adjusting the transmission rate on each path. We demonstrate through simulations that, by utilizing the attractor perturbation relationship, the proposed method achieves a lower average end-to-end delay compared to other methods which do not take fluctuations into account. PMID:24319375

  5. Noise-assisted concurrent multipath traffic distribution in ad hoc networks.

    PubMed

    Asvarujanon, Narun; Leibnitz, Kenji; Wakamiya, Naoki; Murata, Masayuki

    2013-01-01

    The concept of biologically inspired networking has been introduced to tackle unpredictable and unstable situations in computer networks, especially in wireless ad hoc networks where network conditions are continuously changing, resulting in the need of robustness and adaptability of control methods. Unfortunately, existing methods often rely heavily on the detailed knowledge of each network component and the preconfigured, that is, fine-tuned, parameters. In this paper, we utilize a new concept, called attractor perturbation (AP), which enables controlling the network performance using only end-to-end information. Based on AP, we propose a concurrent multipath traffic distribution method, which aims at lowering the average end-to-end delay by only adjusting the transmission rate on each path. We demonstrate through simulations that, by utilizing the attractor perturbation relationship, the proposed method achieves a lower average end-to-end delay compared to other methods which do not take fluctuations into account. PMID:24319375

  6. A Leasing Model to Deal with Partial Failures in Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Gonzalez Boix, Elisa; van Cutsem, Tom; Vallejos, Jorge; de Meuter, Wolfgang; D'Hondt, Theo

    In mobile ad hoc networks (MANETs) many partial failures are the result of temporary network partitions due to the intermittent connectivity of mobile devices. Some of these failures will be permanent and require application-level failure handling. However, it is impossible to distinguish a permanent from a transient failure. Leasing provides a solution to this problem based on the temporal restriction of resources. But to date no leasing model has been designed specifically for MANETs. In this paper, we identify three characteristics required for a leasing model to be usable in a MANET, discuss the issues with existing leasing models and then propose the leased object references model, which integrates leasing with remote object references. In addition, we describe an implementation of the model in the programming language AmbientTalk. Leased object references provide an extensible framework that allows programmers to express their own leasing patterns and enables both lease holders (clients) and lease grantors (services) to deal with permanent failures.

  7. Robotic disaster recovery efforts with ad-hoc deployable cloud computing

    NASA Astrophysics Data System (ADS)

    Straub, Jeremy; Marsh, Ronald; Mohammad, Atif F.

    2013-06-01

    Autonomous operations of search and rescue (SaR) robots is an ill posed problem, which is complexified by the dynamic disaster recovery environment. In a typical SaR response scenario, responder robots will require different levels of processing capabilities during various parts of the response effort and will need to utilize multiple algorithms. Placing these capabilities onboard the robot is a mediocre solution that precludes algorithm specific performance optimization and results in mediocre performance. Architecture for an ad-hoc, deployable cloud environment suitable for use in a disaster response scenario is presented. Under this model, each service provider is optimized for the task and maintains a database of situation-relevant information. This service-oriented architecture (SOA 3.0) compliant framework also serves as an example of the efficient use of SOA 3.0 in an actual cloud application.

  8. Energy conservation in ad hoc multimedia networks using traffic-shaping mechanisms

    NASA Astrophysics Data System (ADS)

    Chandra, Surendar

    2003-12-01

    In this work, we explore network traffic shaping mechanisms that deliver packets at pre-determined intervals; allowing the network interface to transition to a lower power consuming sleep state. We focus our efforts on commodity devices, IEEE 802.11b ad hoc mode and popular streaming formats. We argue that factors such as the lack of scheduling clock phase synchronization among the participants and scheduling delays introduced by back ground tasks affect the potential energy savings. Increasing the periodic transmission delays to transmit data infrequently can offset some of these effects at the expense of flooding the wireless channel for longer periods of time; potentially increasing the time to acquire the channel for non-multimedia traffic. Buffering mechanisms built into media browsers can mitigate the effects of these added delays from being mis-interpreted as network congestion. We show that practical implementations of such traffic shaping mechanisms can offer significant energy savings.

  9. Enhancing the Social Capital of Learning Communities by Using an Ad Hoc Transient Communities Service

    NASA Astrophysics Data System (ADS)

    Fetter, Sibren; Berlanga, Adriana J.; Sloep, Peter

    In online learning, communities can help to enhance learning. However, because of the dynamic nature of communities, attaining and sustaining these communities can be difficult. One aspect that has an influence on, and is influenced by these dynamics is the social capital of a community. Features of social capital are the social network structure, the sense of belonging and, the support received and provided. It is hypothesized that these features can be improved by using Ad Hoc Transient Communities (AHTCs). Through an AHTC learners are brought together for a specific, learning-related goal (‘ad hoc’) and for only a limited amount of time (‘transience’). To test whether the use of AHTCs has a positive influence on the social capital, a learner support service which enables the use of AHTCs is proposed. Furthermore, requirements, prerequisites, and future research are discussed.

  10. CP-TDMA: Coloring-and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Zhang, Xuedan; Hong, Jun; Zhang, Lin; Shan, Xiuming; Li, Victor O. K.

    This paper addresses the issue of transmission scheduling in wireless ad hoc networks. We propose a Time Division Multiple Access (TDMA) scheduling scheme based on edge coloring and probabilistic assignment, called CP-TDMA. We categorize the conflicts suffered by wireless links into two types: explicit conflicts and implicit conflicts, and utilize two different strategies to deal with them. Explicit conflicts are avoided completely by a simple distributed edge-coloring algorithm μ-M, and implicit conflicts are minimized by applying probabilistic time slot assignments to links. We evaluate CP-TDMA analytically and numerically, and find that CP-TDMA, which requires only local information exhibits a better performance than previous work.

  11. A novel unbalanced multiple description coder for robust video transmission over ad hoc wireless networks

    NASA Astrophysics Data System (ADS)

    Huang, Feng; Sun, Lifeng; Zhong, Yuzhuo

    2006-01-01

    Robust transmission of live video over ad hoc wireless networks presents new challenges: high bandwidth requirements are coupled with delay constraints; even a single packet loss causes error propagation until a complete video frame is coded in the intra-mode; ad hoc wireless networks suffer from bursty packet losses that drastically degrade the viewing experience. Accordingly, we propose a novel UMD coder capable of quickly recovering from losses and ensuring continuous playout. It uses 'peg' frames to prevent error propagation in the High-Resolution (HR) description and improve the robustness of key frames. The Low-Resolution (LR) coder works independent of the HR one, but they can also help each other recover from losses. Like many UMD coders, our UMD coder is drift-free, disruption-tolerant and able to make good use of the asymmetric available bandwidths of multiple paths. The simulation results under different conditions show that the proposed UMD coder has the highest decoded quality and lowest probability of pause when compared with concurrent UMDC techniques. The coder also has a comparable decoded quality, lower startup delay and lower probability of pause than a state-of-the-art FEC-based scheme. To provide robustness for video multicast applications, we propose non-end-to-end UMDC-based video distribution over a multi-tree multicast network. The multiplicity of parents decorrelates losses and the non-end-to-end feature increases the throughput of UMDC video data. We deploy an application-level service of LR description reconstruction in some intermediate nodes of the LR multicast tree. The principle behind this is to reconstruct the disrupted LR frames by the correctly received HR frames. As a result, the viewing experience at the downstream nodes benefits from the protection reconstruction at the upstream nodes.

  12. Reconfigurable routing protocol for free space optical sensor networks.

    PubMed

    Xie, Rong; Yang, Won-Hyuk; Kim, Young-Chon

    2012-01-01

    Recently, free space optical sensor networks (FSOSNs), which are based on free space optics (FSO) instead of radio frequency (RF), have gained increasing visibility over traditional wireless sensor networks (WSNs) due to their advantages such as larger capacity, higher security, and lower cost. However, the performance of FSOSNs is restricted to the requirement of a direct line-of-sight (LOS) path between a sender and a receiver pair. Once a node dies of energy depletion, the network would probably suffer from a dramatic decrease of connectivity, resulting in a huge loss of data packets. Thus, this paper proposes a reconfigurable routing protocol (RRP) to overcome this problem by dynamically reconfiguring the network virtual topology. The RRP works in three phases: (1) virtual topology construction, (2) routing establishment, and (3) reconfigurable routing. When data transmission begins, the data packets are first routed through the shortest hop paths. Then a reconfiguration is initiated by the node whose residual energy falls below a threshold. Nodes affected by this dying node are classified into two types, namely maintenance nodes and adjustment nodes, and they are reconfigured according to the types. An energy model is designed to evaluate the performance of RRP through OPNET simulation. Our simulation results indicate that the RRP achieves better performance compared with the simple-link protocol and a direct reconfiguration scheme in terms of connectivity, network lifetime, packet delivery ratio and the number of living nodes. PMID:22666061

  13. Future Information Services at the Texas A&M University Library: Background and Recommendations (Report of an Ad Hoc Committee).

    ERIC Educational Resources Information Center

    Cook, Colleen; And Others

    The Ad Hoc Committee on Future Information Services explored possible future directions for information services at Texas A&M University Library and developed a plan to guide the library into the next decade in terms of automated access to information. In exploring future directions for automated information services, the committee members…

  14. Federal Government Printing and Publishing: Policy Issues. Report of the Ad Hoc Advisory Committee on Revision of Title 44.

    ERIC Educational Resources Information Center

    Joint Committee on Printing, Washington, DC.

    Designed to present a better understanding of the government's system of printing and distributing information and to highlight problems, alternatives, and important policy questions, this report synthesizes 13 weeks of the Ad Hoc Advisory Committee hearings on six topics: (1) Administration of policy--who should establish and administer policy in…

  15. Dynamic Agent Classification and Tracking Using an Ad Hoc Mobile Acoustic Sensor Network

    NASA Astrophysics Data System (ADS)

    Friedlander, David; Griffin, Christopher; Jacobson, Noah; Phoha, Shashi; Brooks, Richard R.

    2003-12-01

    Autonomous networks of sensor platforms can be designed to interact in dynamic and noisy environments to determine the occurrence of specified transient events that define the dynamic process of interest. For example, a sensor network may be used for battlefield surveillance with the purpose of detecting, identifying, and tracking enemy activity. When the number of nodes is large, human oversight and control of low-level operations is not feasible. Coordination and self-organization of multiple autonomous nodes is necessary to maintain connectivity and sensor coverage and to combine information for better understanding the dynamics of the environment. Resource conservation requires adaptive clustering in the vicinity of the event. This paper presents methods for dynamic distributed signal processing using an ad hoc mobile network of microsensors to detect, identify, and track targets in noisy environments. They seamlessly integrate data from fixed and mobile platforms and dynamically organize platforms into clusters to process local data along the trajectory of the targets. Local analysis of sensor data is used to determine a set of target attribute values and classify the target. Sensor data from a field test in the Marine base at Twentynine Palms, Calif, was analyzed using the techniques described in this paper. The results were compared to "ground truth" data obtained from GPS receivers on the vehicles.

  16. Emergency Situation Prediction Mechanism: A Novel Approach for Intelligent Transportation System Using Vehicular Ad Hoc Networks

    PubMed Central

    Gokulakrishnan, P.

    2015-01-01

    In Indian four-lane express highway, millions of vehicles are travelling every day. Accidents are unfortunate and frequently occurring in these highways causing deaths, increase in death toll, and damage to infrastructure. A mechanism is required to avoid such road accidents at the maximum to reduce the death toll. An Emergency Situation Prediction Mechanism, a novel and proactive approach, is proposed in this paper for achieving the best of Intelligent Transportation System using Vehicular Ad Hoc Network. ESPM intends to predict the possibility of occurrence of an accident in an Indian four-lane express highway. In ESPM, the emergency situation prediction is done by the Road Side Unit based on (i) the Status Report sent by the vehicles in the range of RSU and (ii) the road traffic flow analysis done by the RSU. Once the emergency situation or accident is predicted in advance, an Emergency Warning Message is constructed and disseminated to all vehicles in the area of RSU to alert and prevent the vehicles from accidents. ESPM performs well in emergency situation prediction in advance to the occurrence of an accident. ESPM predicts the emergency situation within 0.20 seconds which is comparatively less than the statistical value. The prediction accuracy of ESPM against vehicle density is found better in different traffic scenarios. PMID:26065014

  17. An adaptive neural swarm approach for intrusion defense in ad hoc networks

    NASA Astrophysics Data System (ADS)

    Cannady, James

    2011-06-01

    Wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are being increasingly deployed in critical applications due to the flexibility and extensibility of the technology. While these networks possess numerous advantages over traditional wireless systems in dynamic environments they are still vulnerable to many of the same types of host-based and distributed attacks common to those systems. Unfortunately, the limited power and bandwidth available in WSNs and MANETs, combined with the dynamic connectivity that is a defining characteristic of the technology, makes it extremely difficult to utilize traditional intrusion detection techniques. This paper describes an approach to accurately and efficiently detect potentially damaging activity in WSNs and MANETs. It enables the network as a whole to recognize attacks, anomalies, and potential vulnerabilities in a distributive manner that reflects the autonomic processes of biological systems. Each component of the network recognizes activity in its local environment and then contributes to the overall situational awareness of the entire system. The approach utilizes agent-based swarm intelligence to adaptively identify potential data sources on each node and on adjacent nodes throughout the network. The swarm agents then self-organize into modular neural networks that utilize a reinforcement learning algorithm to identify relevant behavior patterns in the data without supervision. Once the modular neural networks have established interconnectivity both locally and with neighboring nodes the analysis of events within the network can be conducted collectively in real-time. The approach has been shown to be extremely effective in identifying distributed network attacks.

  18. Multiobjective Reinforcement Learning for Traffic Signal Control Using Vehicular Ad Hoc Network

    NASA Astrophysics Data System (ADS)

    Houli, Duan; Zhiheng, Li; Yi, Zhang

    2010-12-01

    We propose a new multiobjective control algorithm based on reinforcement learning for urban traffic signal control, named multi-RL. A multiagent structure is used to describe the traffic system. A vehicular ad hoc network is used for the data exchange among agents. A reinforcement learning algorithm is applied to predict the overall value of the optimization objective given vehicles' states. The policy which minimizes the cumulative value of the optimization objective is regarded as the optimal one. In order to make the method adaptive to various traffic conditions, we also introduce a multiobjective control scheme in which the optimization objective is selected adaptively to real-time traffic states. The optimization objectives include the vehicle stops, the average waiting time, and the maximum queue length of the next intersection. In addition, we also accommodate a priority control to the buses and the emergency vehicles through our model. The simulation results indicated that our algorithm could perform more efficiently than traditional traffic light control methods.

  19. Ad Hoc modeling, expert problem solving, and R&T program evaluation

    NASA Technical Reports Server (NTRS)

    Silverman, B. G.; Liebowitz, J.; Moustakis, V. S.

    1983-01-01

    A simplified cost and time (SCAT) analysis program utilizing personal-computer technology is presented and demonstrated in the case of the NASA-Goddard end-to-end data system. The difficulties encountered in implementing complex program-selection and evaluation models in the research and technology field are outlined. The prototype SCAT system described here is designed to allow user-friendly ad hoc modeling in real time and at low cost. A worksheet constructed on the computer screen displays the critical parameters and shows how each is affected when one is altered experimentally. In the NASA case, satellite data-output and control requirements, ground-facility data-handling capabilities, and project priorities are intricately interrelated. Scenario studies of the effects of spacecraft phaseout or new spacecraft on throughput and delay parameters are shown. The use of a network of personal computers for higher-level coordination of decision-making processes is suggested, as a complement or alternative to complex large-scale modeling.

  20. Integration of Body Sensor Networks and Vehicular Ad-hoc Networks for Traffic Safety

    PubMed Central

    Reyes-Muñoz, Angelica; Domingo, Mari Carmen; López-Trinidad, Marco Antonio; Delgado, José Luis

    2016-01-01

    The emergence of Body Sensor Networks (BSNs) constitutes a new and fast growing trend for the development of daily routine applications. However, in the case of heterogeneous BSNs integration with Vehicular ad hoc Networks (VANETs) a large number of difficulties remain, that must be solved, especially when talking about the detection of human state factors that impair the driving of motor vehicles. The main contributions of this investigation are principally three: (1) an exhaustive review of the current mechanisms to detect four basic physiological behavior states (drowsy, drunk, driving under emotional state disorders and distracted driving) that may cause traffic accidents is presented; (2) A middleware architecture is proposed. This architecture can communicate with the car dashboard, emergency services, vehicles belonging to the VANET and road or street facilities. This architecture seeks on the one hand to improve the car driving experience of the driver and on the other hand to extend security mechanisms for the surrounding individuals; and (3) as a proof of concept, an Android real-time attention low level detection application that runs in a next-generation smartphone is developed. The application features mechanisms that allow one to measure the degree of attention of a driver on the base of her/his EEG signals, establish wireless communication links via various standard wireless means, GPRS, Bluetooth and WiFi and issue alarms of critical low driver attention levels. PMID:26784204

  1. Securing Mobile Ad Hoc Networks Using Danger Theory-Based Artificial Immune Algorithm

    PubMed Central

    2015-01-01

    A mobile ad hoc network (MANET) is a set of mobile, decentralized, and self-organizing nodes that are used in special cases, such as in the military. MANET properties render the environment of this network vulnerable to different types of attacks, including black hole, wormhole and flooding-based attacks. Flooding-based attacks are one of the most dangerous attacks that aim to consume all network resources and thus paralyze the functionality of the whole network. Therefore, the objective of this paper is to investigate the capability of a danger theory-based artificial immune algorithm called the mobile dendritic cell algorithm (MDCA) to detect flooding-based attacks in MANETs. The MDCA applies the dendritic cell algorithm (DCA) to secure the MANET with additional improvements. The MDCA is tested and validated using Qualnet v7.1 simulation tool. This work also introduces a new simulation module for a flooding attack called the resource consumption attack (RCA) using Qualnet v7.1. The results highlight the high efficiency of the MDCA in detecting RCAs in MANETs. PMID:25946001

  2. Mean field game theoretic approach for security in mobile ad-hoc networks

    NASA Astrophysics Data System (ADS)

    Wang, Yanwei; Tang, Helen; Yu, F. Richard; Huang, Minyi

    2013-05-01

    Game theory can provide a useful tool to study the security problem in mobile ad hoc networks (MANETs). Most existing work on applying game theories to security only considers two players in the security game model: an attacker and a defender. While this assumption is valid for a network with centralized administration, it may not be realistic in MANETs, where centralized administration is not available. Consequently, each individual node in a MANET should be treated separately in the security game model. In this paper, using recent advances in mean field game theory, we propose a novel game theoretic approach for security in MANETs. Mean field game theory provides a powerful mathematical tool for problems with a large number of players. Since security defence mechanisms consume precious system resources (e.g., energy), the proposed scheme considers not only the security requirement of MANETs but also the system resources. In addition, each node only needs to know its own state information and the aggregate effect of the other nodes in the MANET. Therefore, the proposed scheme is a fully distributed scheme. Simulation results are presented to illustrate the effectiveness of the proposed scheme.

  3. Sketching Awareness: A Participatory Study to Elicit Designs for Supporting Ad Hoc Emergency Medical Teamwork

    PubMed Central

    Kusunoki, Diana; Sarcevic, Aleksandra; Zhang, Zhan; Yala, Maria

    2014-01-01

    Prior CSCW research on awareness in clinical settings has mostly focused on higher-level team coordination spanning across longer-term trajectories at the department and inter-department levels. In this paper, we offer a perspective on what awareness means within the context of an ad hoc, time- and safety-critical medical setting by looking at teams treating severely ill patients with urgent needs. We report findings from four participatory design workshops conducted with emergency medicine clinicians at two regional emergency departments. Workshops were developed to elicit design ideas for information displays that support awareness in emergency medical situations. Through analysis of discussions and clinicians’ sketches of information displays, we identified five features of teamwork that can be used as a foundation for supporting awareness from the perspective of clinicians. Based on these findings, we contribute rich descriptions of four facets of awareness that teams manage during emergency medical situations: team member awareness, elapsed time awareness, teamwork-oriented and patient-driven task awareness, and overall progress awareness. We then discuss these four awareness types in relation to awareness facets found in the CSCW literature. PMID:25870498

  4. Report of the APS Ad-Hoc Committee on LGBT Issues - Presentation of Findings and Recommendations

    NASA Astrophysics Data System (ADS)

    Long, Elena

    2016-03-01

    In 2014 the Executive Officer of the American Physical Society (APS), Kate Kirby, created an Ad-Hoc Committee on LGBT Issues (C-LGBT) charged with reporting on the obstacles to inclusion of LGBT physicists, a term which for the purpose of this report refers to persons who self-identify as lesbian, gay, bisexual, transgender, queer, questioning, intersex, or asexual, as well as other sexual and gender minorities. The full charge was as follows: ``The committee will advise the APS on the current status of LGBT issues in physics, provide recommendations for greater inclusion, and engage physicists in laying the foundation for a more inclusive physics community? More specifically, the committee will investigate LGBT representation in physics, assess the educational and professional climate in physics, recommend changes in policies and practices that impact LGBT physicists, and address other issues that affect inclusion.'' We will present the findings and recommendations of the C-LGBT final report, and a panel discussion will be held following the presentation to discuss the future of APS efforts toward LGBT inclusion in physics.

  5. Concurrent Transmission Based on Channel Quality in Ad Hoc Networks: A Game Theoretic Approach

    NASA Astrophysics Data System (ADS)

    Chen, Chen; Gao, Xinbo; Li, Xiaoji; Pei, Qingqi

    In this paper, a decentralized concurrent transmission strategy in shared channel in Ad Hoc networks is proposed based on game theory. Firstly, a static concurrent transmissions game is used to determine the candidates for transmitting by channel quality threshold and to maximize the overall throughput with consideration of channel quality variation. To achieve NES (Nash Equilibrium Solution), the selfish behaviors of node to attempt to improve the channel gain unilaterally are evaluated. Therefore, this game allows each node to be distributed and to decide whether to transmit concurrently with others or not depending on NES. Secondly, as there are always some nodes with lower channel gain than NES, which are defined as hunger nodes in this paper, a hunger suppression scheme is proposed by adjusting the price function with interferences reservation and forward relay, to fairly give hunger nodes transmission opportunities. Finally, inspired by stock trading, a dynamic concurrent transmission threshold determination scheme is implemented to make the static game practical. Numerical results show that the proposed scheme is feasible to increase concurrent transmission opportunities for active nodes, and at the same time, the number of hunger nodes is greatly reduced with the least increase of threshold by interferences reservation. Also, the good performance on network goodput of the proposed model can be seen from the results.

  6. A Sensitive Secondary Users Selection Algorithm for Cognitive Radio Ad Hoc Networks

    PubMed Central

    Li, Aohan; Han, Guangjie; Wan, Liangtian; Shu, Lei

    2016-01-01

    Secondary Users (SUs) are allowed to use the temporarily unused licensed spectrum without disturbing Primary Users (PUs) in Cognitive Radio Ad Hoc Networks (CRAHNs). Existing architectures for CRAHNs impose energy-consuming Cognitive Radios (CRs) on SUs. However, the advanced CRs will increase energy cost for their cognitive functionalities, which is undesirable for the battery powered devices. A new architecture referred to as spectral Requirement-based CRAHN (RCRAHN) is proposed to enhance energy efficiency for CRAHNs in this paper. In RCRAHNs, only parts of SUs are equipped with CRs. SUs equipped with CRs are referred to as Cognitive Radio Users (CRUs). To further enhance energy efficiency of CRAHNs, we aim to select minimum CRUs to sense available spectrum. A non-linear programming problem is mathematically formulated under the constraints of energy efficiency and real-time. Considering the NP-hardness of the problem, a framework of a heuristic algorithm referred to as Sensitive Secondary Users Selection (SSUS) was designed to compute the near-optimal solutions. The simulation results demonstrate that SSUS not only improves the energy efficiency, but also achieves satisfied performances in end-to-end delay and communication reliability. PMID:27023562

  7. Ad Hoc Query Support For Very Large Simulation Mesh Data: The Metadata Approach

    SciTech Connect

    Lee, B; Snapp, R; Musick, R; Critchlow, T

    2001-12-17

    We present our approach to enabling approximate ad hoc queries on terabyte-scale mesh data generated from large scientific simulations through the extension and integration of database, statistical, and data mining techniques. There are several significant barriers to overcome in achieving this objective. First, large-scale simulation data is already at the multi-terabyte scale and growing quickly, thus rendering traditional forms of interactive data exploration and query processing untenable. Second, a priori knowledge of user queries is not available, making it impossible to tune special-purpose solutions. Third, the data has spatial and temporal aspects, as well as arbitrarily high dimensionality, which exacerbates the task of finding compact, accurate, and easy-to-compute data models. Our approach is to preprocess the mesh data to generate highly compressed, lossy models that are used in lieu of the original data to answer users' queries. This approach leads to interesting challenges. The model (equivalently, the content-oriented metadata) being generated must be smaller than the original data by at least an order of magnitude. Second, the metadata representation must contain enough information to support a broad class of queries. Finally, the accuracy and speed of the queries must be within the tolerances required by users. In this paper we give an overview of ongoing development efforts with an emphasis on extracting metadata and using it in query processing.

  8. A Sensitive Secondary Users Selection Algorithm for Cognitive Radio Ad Hoc Networks.

    PubMed

    Li, Aohan; Han, Guangjie; Wan, Liangtian; Shu, Lei

    2016-01-01

    Secondary Users (SUs) are allowed to use the temporarily unused licensed spectrum without disturbing Primary Users (PUs) in Cognitive Radio Ad Hoc Networks (CRAHNs). Existing architectures for CRAHNs impose energy-consuming Cognitive Radios (CRs) on SUs. However, the advanced CRs will increase energy cost for their cognitive functionalities, which is undesirable for the battery powered devices. A new architecture referred to as spectral Requirement-based CRAHN (RCRAHN) is proposed to enhance energy efficiency for CRAHNs in this paper. In RCRAHNs, only parts of SUs are equipped with CRs. SUs equipped with CRs are referred to as Cognitive Radio Users (CRUs). To further enhance energy efficiency of CRAHNs, we aim to select minimum CRUs to sense available spectrum. A non-linear programming problem is mathematically formulated under the constraints of energy efficiency and real-time. Considering the NP-hardness of the problem, a framework of a heuristic algorithm referred to as Sensitive Secondary Users Selection (SSUS) was designed to compute the near-optimal solutions. The simulation results demonstrate that SSUS not only improves the energy efficiency, but also achieves satisfied performances in end-to-end delay and communication reliability. PMID:27023562

  9. Integration of Body Sensor Networks and Vehicular Ad-hoc Networks for Traffic Safety.

    PubMed

    Reyes-Muñoz, Angelica; Domingo, Mari Carmen; López-Trinidad, Marco Antonio; Delgado, José Luis

    2016-01-01

    The emergence of Body Sensor Networks (BSNs) constitutes a new and fast growing trend for the development of daily routine applications. However, in the case of heterogeneous BSNs integration with Vehicular ad hoc Networks (VANETs) a large number of difficulties remain, that must be solved, especially when talking about the detection of human state factors that impair the driving of motor vehicles. The main contributions of this investigation are principally three: (1) an exhaustive review of the current mechanisms to detect four basic physiological behavior states (drowsy, drunk, driving under emotional state disorders and distracted driving) that may cause traffic accidents is presented; (2) A middleware architecture is proposed. This architecture can communicate with the car dashboard, emergency services, vehicles belonging to the VANET and road or street facilities. This architecture seeks on the one hand to improve the car driving experience of the driver and on the other hand to extend security mechanisms for the surrounding individuals; and (3) as a proof of concept, an Android real-time attention low level detection application that runs in a next-generation smartphone is developed. The application features mechanisms that allow one to measure the degree of attention of a driver on the base of her/his EEG signals, establish wireless communication links via various standard wireless means, GPRS, Bluetooth and WiFi and issue alarms of critical low driver attention levels. PMID:26784204

  10. Report of the APS Ad-Hoc Committee on LGBT Issues - Presentation of Findings and Recommendations

    NASA Astrophysics Data System (ADS)

    Falk, Michael

    In 2014 the Executive Officer of the American Physical Society (APS), Kate Kirby, created an Ad-Hoc Committee on LGBT Issues (C-LGBT) charged with reporting on the obstacles to inclusion of LGBT physicists, a term which for the purpose of this report refers to persons who self-identify as lesbian, gay, bisexual, transgender, queer, questioning, intersex, or asexual, as well as other sexual and gender minorities. The full charge was as follows: ``The committee will advise the APS on the current status of LGBT issues in physics, provide recommendations for greater inclusion, and engage physicists in laying the foundation for a more inclusive physics community. ?More specifically, the committee will investigate LGBT representation in physics, assess the educational and professional climate in physics, recommend changes in policies and practices that impact LGBT physicists, and address other issues that affect inclusion.'' We will present the findings and recommendations of the C-LGBT final report, and a panel discussion will be held following the presentation to discuss the future of APS efforts toward LGBT inclusion in physics.

  11. Securing mobile ad hoc networks using danger theory-based artificial immune algorithm.

    PubMed

    Abdelhaq, Maha; Alsaqour, Raed; Abdelhaq, Shawkat

    2015-01-01

    A mobile ad hoc network (MANET) is a set of mobile, decentralized, and self-organizing nodes that are used in special cases, such as in the military. MANET properties render the environment of this network vulnerable to different types of attacks, including black hole, wormhole and flooding-based attacks. Flooding-based attacks are one of the most dangerous attacks that aim to consume all network resources and thus paralyze the functionality of the whole network. Therefore, the objective of this paper is to investigate the capability of a danger theory-based artificial immune algorithm called the mobile dendritic cell algorithm (MDCA) to detect flooding-based attacks in MANETs. The MDCA applies the dendritic cell algorithm (DCA) to secure the MANET with additional improvements. The MDCA is tested and validated using Qualnet v7.1 simulation tool. This work also introduces a new simulation module for a flooding attack called the resource consumption attack (RCA) using Qualnet v7.1. The results highlight the high efficiency of the MDCA in detecting RCAs in MANETs. PMID:25946001

  12. Enhanced ad hoc wireless connectivity in complex environment using small radio repeater systems

    NASA Astrophysics Data System (ADS)

    Sarabandi, Kamal; Song, Young Jun; Oh, Jungsuek

    2011-06-01

    Ad hoc communication among small robotic platforms in complex indoor environment is further challenged by three limiting factors: 1) limited power, 2) small size antennas, and 3) near-ground operation. In complex environments such as indoor scenarios often times the line-of-sight communication cannot be established and the wireless connectivity must rely on multi-path propagation. As a result, the propagation path-loss is much higher than free-space, and more power will be needed to obtain the need coverage. Near ground operation also leads to increased path-loss. To maintain the network connectivity without increasing the required power a novel high gain miniaturized radio repeater is presented. Unlike existing repeater systems, this system utilizes two closely spaced low profile miniaturized planar antennas capable of producing omnidirectional and vertical radiation patterns as well as a channel isolator layer that serves to decouple the adjacent antennas. The meta-material based channel isolator serves as an electromagnetic shield, thus enabling it to be built in a sub-wavelength size of 0.07λ0 2 × λ0/70, the smallest repeater ever built. Also wave propagation simulations have been conducted to determine the required gain of such repeaters so to ensure the signal from the repeater is the dominant component. A prototype of the small radio repeater is fabricated to verify the design performance through a standard free-space measurement setup.

  13. A DNA-Inspired Encryption Methodology for Secure, Mobile Ad Hoc Networks

    NASA Technical Reports Server (NTRS)

    Shaw, Harry

    2012-01-01

    Users are pushing for greater physical mobility with their network and Internet access. Mobile ad hoc networks (MANET) can provide an efficient mobile network architecture, but security is a key concern. A figure summarizes differences in the state of network security for MANET and fixed networks. MANETs require the ability to distinguish trusted peers, and tolerate the ingress/egress of nodes on an unscheduled basis. Because the networks by their very nature are mobile and self-organizing, use of a Public Key Infra structure (PKI), X.509 certificates, RSA, and nonce ex changes becomes problematic if the ideal of MANET is to be achieved. Molecular biology models such as DNA evolution can provide a basis for a proprietary security architecture that achieves high degrees of diffusion and confusion, and resistance to cryptanalysis. A proprietary encryption mechanism was developed that uses the principles of DNA replication and steganography (hidden word cryptography) for confidentiality and authentication. The foundation of the approach includes organization of coded words and messages using base pairs organized into genes, an expandable genome consisting of DNA-based chromosome keys, and a DNA-based message encoding, replication, and evolution and fitness. In evolutionary computing, a fitness algorithm determines whether candidate solutions, in this case encrypted messages, are sufficiently encrypted to be transmitted. The technology provides a mechanism for confidential electronic traffic over a MANET without a PKI for authenticating users.

  14. Adaptive Control Parameters for Dispersal of Multi-Agent Mobile Ad Hoc Network (MANET) Swarms

    SciTech Connect

    Kurt Derr; Milos Manic

    2013-11-01

    A mobile ad hoc network is a collection of independent nodes that communicate wirelessly with one another. This paper investigates nodes that are swarm robots with communications and sensing capabilities. Each robot in the swarm may operate in a distributed and decentralized manner to achieve some goal. This paper presents a novel approach to dynamically adapting control parameters to achieve mesh configuration stability. The presented approach to robot interaction is based on spring force laws (attraction and repulsion laws) to create near-optimal mesh like configurations. In prior work, we presented the extended virtual spring mesh (EVSM) algorithm for the dispersion of robot swarms. This paper extends the EVSM framework by providing the first known study on the effects of adaptive versus static control parameters on robot swarm stability. The EVSM algorithm provides the following novelties: 1) improved performance with adaptive control parameters and 2) accelerated convergence with high formation effectiveness. Simulation results show that 120 robots reach convergence using adaptive control parameters more than twice as fast as with static control parameters in a multiple obstacle environment.

  15. Security in MANETs using reputation-adjusted routing

    NASA Astrophysics Data System (ADS)

    Ondi, Attila; Hoffman, Katherine; Perez, Carlos; Ford, Richard; Carvalho, Marco; Allen, William

    2009-04-01

    Mobile Ad-Hoc Networks enable communication in various dynamic environments, including military combat operations. Their open and shared communication medium enables new forms of attack that are not applicable for traditional wired networks. Traditional security mechanisms and defense techniques are not prepared to cope with the new attacks and the lack of central authorities make identity verifications difficult. This work extends our previous work in the Biologically Inspired Tactical Security Infrastructure to provide a reputation-based weighing mechanism for linkstate routing protocols to protect the network from attackers that are corrupting legitimate network traffic. Our results indicate that the approach is successful in routing network traffic around compromised computers.

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

    PubMed

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

    2011-01-01

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

  17. A Secure Cluster-Based Multipath Routing Protocol for WMSNs

    PubMed Central

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

    2011-01-01

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

  18. Bringing Ad-Hoc Analytics to Big Earth Data: the EarthServer Experience

    NASA Astrophysics Data System (ADS)

    Baumann, Peter

    2014-05-01

    From the commonly accepted Vs defining the Big Data challenge - volume, velocity, variety - we more and more learn that the sheer volume is not the only, and often not even the decisive factor inhibiting access and analytics. In particular variety of data is a frequent core issue, posing manifold issues. Based on this observation we claim that a key aspect to analytics is the freedom to ask any questions, simple or complex, anytime and combining any choice of data structures, whatever diverging they may be. Actually, techniques for such "ad-hoc queries" we can learn from classical databases. Their concept of high-level query languages brings along several benefits: a uniform semantic, allowing machine-to-machine communication, including automatic generation of queries; massive server-side optimization and parallelization; and building attractive client interfaces hiding the query syntax from casual users while allowing power users to utilize it. However, these benefits used to be available only on tabular and set oriented data, text, and - more recently - graph data. With the advent of Array Databases, they become available on large multidimensional raster data assets as well, getting one step closer to the Holy Grail of itnegrated, uniform retrieval for users. ErthServer is a transatlantic initiative setting up operationa linfrastructures based on this paradigm. In our talk, we present core EarthServer technology concepts as well as a spectrum of Earth Science applications utilizing the EarthServer platform for versatile, visualisation supported analytics services. Further, we discuss the substantial impact EarthServer is having on Big Geo Data standardization in OGC and ISO. Time and Internet connection permitting a live demo can be presented.

  19. Road Accident Prevention with Instant Emergency Warning Message Dissemination in Vehicular Ad-Hoc Network

    PubMed Central

    P, Gokulakrishnan; P, Ganeshkumar

    2015-01-01

    A Road Accident Prevention (RAP) scheme based on Vehicular Backbone Network (VBN) structure is proposed in this paper for Vehicular Ad-hoc Network (VANET). The RAP scheme attempts to prevent vehicles from highway road traffic accidents and thereby reduces death and injury rates. Once the possibility of an emergency situation (i.e. an accident) is predicted in advance, instantly RAP initiates a highway road traffic accident prevention scheme. The RAP scheme constitutes the following activities: (i) the Road Side Unit (RSU) constructs a Prediction Report (PR) based on the status of the vehicles and traffic in the highway roads, (ii) the RSU generates an Emergency Warning Message (EWM) based on an abnormal PR, (iii) the RSU forms a VBN structure and (iv) the RSU disseminates the EWM to the vehicles that holds the high Risk Factor (RF) and travels in High Risk Zone (HRZ). These vehicles might reside either within the RSU’s coverage area or outside RSU’s coverage area (reached using VBN structure). The RAP scheme improves the performance of EWM dissemination in terms of increase in notification and decrease in end-to-end delay. The RAP scheme also reduces infrastructure cost (number of RSUs) by formulating and deploying the VBN structure. The RAP scheme with VBN structure improves notification by 19 percent and end-to-end delay by 14.38 percent for a vehicle density of 160 vehicles. It is also proved from the simulation experiment that the performance of RAP scheme is promising in 4-lane highway roads. PMID:26636576

  20. Road Accident Prevention with Instant Emergency Warning Message Dissemination in Vehicular Ad-Hoc Network.

    PubMed

    Gokulakrishnan, P; Ganeshkumar, P

    2015-01-01

    A Road Accident Prevention (RAP) scheme based on Vehicular Backbone Network (VBN) structure is proposed in this paper for Vehicular Ad-hoc Network (VANET). The RAP scheme attempts to prevent vehicles from highway road traffic accidents and thereby reduces death and injury rates. Once the possibility of an emergency situation (i.e. an accident) is predicted in advance, instantly RAP initiates a highway road traffic accident prevention scheme. The RAP scheme constitutes the following activities: (i) the Road Side Unit (RSU) constructs a Prediction Report (PR) based on the status of the vehicles and traffic in the highway roads, (ii) the RSU generates an Emergency Warning Message (EWM) based on an abnormal PR, (iii) the RSU forms a VBN structure and (iv) the RSU disseminates the EWM to the vehicles that holds the high Risk Factor (RF) and travels in High Risk Zone (HRZ). These vehicles might reside either within the RSU's coverage area or outside RSU's coverage area (reached using VBN structure). The RAP scheme improves the performance of EWM dissemination in terms of increase in notification and decrease in end-to-end delay. The RAP scheme also reduces infrastructure cost (number of RSUs) by formulating and deploying the VBN structure. The RAP scheme with VBN structure improves notification by 19 percent and end-to-end delay by 14.38 percent for a vehicle density of 160 vehicles. It is also proved from the simulation experiment that the performance of RAP scheme is promising in 4-lane highway roads. PMID:26636576

  1. An energy-aware routing protocol in wireless sensor networks.

    PubMed

    Liu, Ming; Cao, Jiannong; Chen, Guihai; Wang, Xiaomin

    2009-01-01

    The most important issue that must be solved in designing a data gathering algorithm for wireless sensor networks (WSNS) is how to save sensor node energy while meeting the needs of applications/users. In this paper, we propose a novel energy-aware routing protocol (EAP) for a long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all the nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely, intra-cluster coverage to cope with the area coverage problem. We use a simple temperature sensing application to evaluate the performance of EAP and results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered. PMID:22389610

  2. Ad hoc supervision of general practice registrars as a 'community of practice': analysis, interpretation and re-presentation.

    PubMed

    Clement, T; Brown, J; Morrison, J; Nestel, D

    2016-05-01

    General practice registrars in Australia undertake most of their vocational training in accredited general practices. They typically see patients alone from the start of their community-based training and are expected to seek timely ad hoc support from their supervisor. Such ad hoc encounters are a mechanism for ensuring patient safety, but also provide an opportunity for learning and teaching. Wenger's (Communities of practice: learning, meaning, and identity. Cambridge University Press, New York, 1998) social theory of learning ('communities of practice') guided a secondary analysis of audio-recordings of ad hoc encounters. Data from one encounter is re-presented as an extended sequence to maintain congruence with the theoretical perspective and enhance vicariousness. An interpretive commentary communicates key features of Wenger's theory and highlights the researchers' interpretations. We argue that one encounter can reveal universal understandings of clinical supervision and that the process of naturalistic generalisation allows readers to transfer others' experiences to their own contexts. The paper raises significant analytic, interpretive, and representational issues. We highlight that report writing is an important, but infrequently discussed, part of research design. We discuss the challenges of supporting the learning and teaching that arises from adopting a socio-cultural lens and argue that such a perspective importantly captures the complex range of issues that work-based practitioners have to grapple with. This offers a challenge to how we research and seek to influence work-based learning and teaching in health care settings. PMID:26384813

  3. Zone-Based Routing Protocol for Wireless Sensor Networks

    PubMed Central

    Venkateswarlu Kumaramangalam, Muni; Adiyapatham, Kandasamy; Kandasamy, Chandrasekaran

    2014-01-01

    Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads.

  4. A comparative study of routing protocols of heterogeneous wireless sensor networks.

    PubMed

    Han, Guangjie; Jiang, Xu; Qian, Aihua; Rodrigues, Joel J P C; Cheng, Long

    2014-01-01

    Recently, heterogeneous wireless sensor network (HWSN) routing protocols have drawn more and more attention. Various HWSN routing protocols have been proposed to improve the performance of HWSNs. Among these protocols, hierarchical HWSN routing protocols can improve the performance of the network significantly. In this paper, we will evaluate three hierarchical HWSN protocols proposed recently--EDFCM, MCR, and EEPCA--together with two previous classical routing protocols--LEACH and SEP. We mainly focus on the round of the first node dies (also called the stable period) and the number of packets sent to sink, which is an important aspect to evaluate the monitoring ability of a protocol. We conduct a lot of experiments and simulations on Matlab to analyze the performance of the five routing protocols. PMID:25050393

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

    PubMed Central

    Alanazi, Adwan; Elleithy, Khaled

    2015-01-01

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

  6. Maintaining communication link based on AODV routing protocol in mobile robot networks

    NASA Astrophysics Data System (ADS)

    Hu, Hui; Jiang, Hong

    2007-12-01

    Wired computer networks are vital in modern life. However, these networks are extremely vulnerable to disaster or attack in emergency situations. Therefore, how to maintain communication link under emergency situations is very important. In this paper, we utilize a series of autonomous mobile slave robots which follow behind the lead robot and automatically stop where needed to maintain an ad hoc network for guaranteeing a link between the lead robot and its remote monitor/control station. To accomplish this target, an efficient communication protocol limitation mobile robots broadcast based on AODV (LMRB-AODV) is proposed for deployment in multi-robot system. After then the lead robot could carry service traffics to the monitor station under emergency situations through the communication link. At any instance, the lead robot has the ability to reclaim the relay robot(s) which are unneeded in the network to rejoin the convoy behind the lead robot and use it to extend the range of wireless communication when the radio frequency (RF) shortcuts are detected by the lead robot. All relay deployment and reclaiming strategy functions occur without the operator's involvement. Finally, we provide a comparative study of their performance in a number of different simulation environments. The results show that the proposed scheme is very efficient in maintaining communication link in wireless network.

  7. BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks

    PubMed Central

    Li, Peng; Huang, Chuanhe; Liu, Qin

    2014-01-01

    In vehicular ad hoc networks, roadside units (RSUs) placement has been proposed to improve the the overall network performance in many ITS applications. This paper addresses the budget constrained and delay-bounded placement problem (BCDP) for roadside units in vehicular ad hoc networks. There are two types of RSUs: cable connected RSU (c-RSU) and wireless RSU (w-RSU). c-RSUs are interconnected through wired lines, and they form the backbone of VANETs, while w-RSUs connect to other RSUs through wireless communication and serve as an economical extension of the coverage of c-RSUs. The delay-bounded coverage range and deployment cost of these two cases are totally different. We are given a budget constraint and a delay bound, the problem is how to find the optimal candidate sites with the maximal delay-bounded coverage to place RSUs such that a message from any c-RSU in the region can be disseminated to the more vehicles within the given budget constraint and delay bound. We first prove that the BCDP problem is NP-hard. Then we propose several algorithms to solve the BCDP problem. Simulation results show the heuristic algorithms can significantly improve the coverage range and reduce the total deployment cost, compared with other heuristic methods. PMID:25436656

  8. Predicting impact of multi-paths on phase change in map-based vehicular ad hoc networks

    NASA Astrophysics Data System (ADS)

    Rahmes, Mark; Lemieux, George; Sonnenberg, Jerome; Chester, David B.

    2014-05-01

    Dynamic Spectrum Access, which through its ability to adapt the operating frequency of a radio, is widely believed to be a solution to the limited spectrum problem. Mobile Ad Hoc Networks (MANETs) can extend high capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact cognitive radio employs spectrum sensing to facilitate identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We quantify optimal signal detection in map based cognitive radio networks with multiple rapidly varying phase changes and multiple orthogonal signals. Doppler shift occurs due to reflection, scattering, and rapid vehicle movement. Path propagation as well as vehicle movement produces either constructive or destructive interference with the incident wave. Our signal detection algorithms can assist the Doppler spread compensation algorithm by deciding how many phase changes in signals are present in a selected band of interest. Additionally we can populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate Dynamic Spectrum Access. We show how topography can help predict the impact of multi-paths on phase change, as well as about the prediction from dense traffic areas. Utilization of high resolution geospatial data layers in RF propagation analysis is directly applicable.

  9. A Novel Clustering Algorithm for Mobile Ad Hoc Networks Based on Determination of Virtual Links' Weight to Increase Network Stability

    PubMed Central

    Karimi, Abbas; Afsharfarnia, Abbas; Zarafshan, Faraneh; Al-Haddad, S. A. R.

    2014-01-01

    The stability of clusters is a serious issue in mobile ad hoc networks. Low stability of clusters may lead to rapid failure of clusters, high energy consumption for reclustering, and decrease in the overall network stability in mobile ad hoc network. In order to improve the stability of clusters, weight-based clustering algorithms are utilized. However, these algorithms only use limited features of the nodes. Thus, they decrease the weight accuracy in determining node's competency and lead to incorrect selection of cluster heads. A new weight-based algorithm presented in this paper not only determines node's weight using its own features, but also considers the direct effect of feature of adjacent nodes. It determines the weight of virtual links between nodes and the effect of the weights on determining node's final weight. By using this strategy, the highest weight is assigned to the best choices for being the cluster heads and the accuracy of nodes selection increases. The performance of new algorithm is analyzed by using computer simulation. The results show that produced clusters have longer lifetime and higher stability. Mathematical simulation shows that this algorithm has high availability in case of failure. PMID:25114965

  10. Medium Access in Spread-Spectrum Ad Hoc Networks with Multiuser Detection

    NASA Astrophysics Data System (ADS)

    Kusume, Katsutoshi; Vilzmann, Robert; Müller, Andreas; Hartmann, Christian; Bauch, Gerhard

    2008-12-01

    Conventional medium access control protocols are designed to avoid simultaneous transmissions, based on a simple collision model in the underlying physical layer. Recently, strong physical layer capabilities, enabled by multiuser detection techniques, have been studied in connection with simple medium access control protocols, for example, slotted ALOHA. We think that neither of these extreme approaches is optimum, particularly in general scenarios where network nodes with different signal processing capabilities coexist. Instead of dealing with interferences in either of the two layers alone, both medium access control and physical layer functionalities should be designed to cooperate and complement each other. We discuss several key aspects for designing such a protocol, especially with an emphasis on iterative multiuser detection, which can provide a good tradeoff between performance and complexity. We propose a new protocol called MUD-MAC which satisfies these key aspects. We analyze its throughput bound and also perform numerical simulations. The simulation results show excellent throughput improvements. It is also demonstrated that the MUD-MAC protocol provides certain fairness among network nodes with different signal processing capabilities.

  11. A neural networks-based hybrid routing protocol for wireless mesh networks.

    PubMed

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

    2012-01-01

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

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

    PubMed Central

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

    2012-01-01

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

  13. Rapid self-organised initiation of ad hoc sensor networks close above the percolation threshold

    NASA Astrophysics Data System (ADS)

    Korsnes, Reinert

    2010-07-01

    This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path tree spanning a weighted graph. This is a well-studied problem where for example Dijkstra’s algorithm provides a solution for non-negative edge weights. The present contribution shows by simulation examples that simple modifications of known distributed approaches here can provide significant improvements in performance. Phase transition phenomena, which are known to take place in networks close to percolation thresholds, may explain these observations. An initial method, which here serves as reference, assumes the sink node starts organisation of the network (tree) by transmitting a control message advertising its availability for its neighbours. These neighbours then advertise their current cost estimate for routing a message to the sink. A node which in this way receives a message implying an improved route to the sink, advertises its new finding and remembers which neighbouring node the message came from. This activity proceeds until there are no more improvements to advertise to neighbours. The result is a tree network for cost effective transmission of messages to the sink (root). This distributed approach has potential for simple improvements which are of interest when minimisation of storage and communication of network information are a concern. Fast organisation of the network takes place when the number k of connections for each node ( degree) is close above its critical value for global network percolation and at the same time there is a threshold for the nodes to decide to advertise network route updates.

  14. Remote detection of riverine traffic using an ad hoc wireless sensor network

    NASA Astrophysics Data System (ADS)

    Athan, Stephan P.

    2005-05-01

    Trafficking of illegal drugs on riverine and inland waterways continues to proliferate in South America. While there has been a successful joint effort to cut off overland and air trafficking routes, there exists a vast river network and Amazon region consisting of over 13,000 water miles that remains difficult to adequately monitor, increasing the likelihood of narcotics moving along this extensive river system. Hence, an effort is underway to provide remote unattended riverine detection in lieu of manned or attended detection measures.

  15. A Comparative Study of Wireless Sensor Networks and Their Routing Protocols

    PubMed Central

    Bhattacharyya, Debnath; Kim, Tai-hoon; Pal, Subhajit

    2010-01-01

    Recent developments in the area of micro-sensor devices have accelerated advances in the sensor networks field leading to many new protocols specifically designed for wireless sensor networks (WSNs). Wireless sensor networks with hundreds to thousands of sensor nodes can gather information from an unattended location and transmit the gathered data to a particular user, depending on the application. These sensor nodes have some constraints due to their limited energy, storage capacity and computing power. Data are routed from one node to other using different routing protocols. There are a number of routing protocols for wireless sensor networks. In this review article, we discuss the architecture of wireless sensor networks. Further, we categorize the routing protocols according to some key factors and summarize their mode of operation. Finally, we provide a comparative study on these various protocols. PMID:22163483

  16. A survey on routing protocols for large-scale wireless sensor networks.

    PubMed

    Li, Changle; Zhang, Hanxiao; Hao, Binbin; Li, Jiandong

    2011-01-01

    With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. "Large-scale" means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and

  17. A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks

    PubMed Central

    Li, Changle; Zhang, Hanxiao; Hao, Binbin; Li, Jiandong

    2011-01-01

    With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner

  18. Evaluating the Importance of Image-related Text for Ad-hoc and Case-based Biomedical Article Retrieval

    PubMed Central

    Simpson, Matthew S.; Demner-Fushman, Dina; Thoma, George R.

    2010-01-01

    Images and their associated text are an essential source of information in biomedical articles. However, their use in providing evidence for clinical case descriptions has yet to be evaluated in the context of information retrieval. Given the complexity of case-based document retrieval, understanding the importance of images and image-related text is critical for future research into text- and content-based approaches to this problem. In this study, we compare the extent to which image-related text is useful in facilitating document retrieval for both case-based information requests and ad-hoc clinical questions in the domain of family practice. We show that case-based document retrieval is significantly improved with the use of image-related text whereas retrieval for clinical questions is largely unaffected. This suggests that visual evidence is more relevant for the case descriptions used in our study than the clinical questions. PMID:21347079

  19. Scope of practice in speech-language pathology. Ad Hoc Committee on Scope of Practice in Speech-Language Pathology.

    PubMed

    1996-01-01

    This scope of practice in speech-language pathology statement is an official policy of the American Speech-Language-Hearing Association (ASHA). It was developed by the Ad Hoc Committee on Scope of Practice in Speech-Language Pathology: Sarah W. Blackstone, chair; Diane Paul-Brown, ex officio; David A. Brandt; Rhonda Friedlander; Luis F. Riquelme; and Mark Ylvisaker. Crystal S. Cooper, vice president for professional practices in speech-language pathology, served as monitoring vice-president. The contributions of the editor, Jude Langsam, and select the widespread peer reviewers are grateful acknowledged. This statement supersedes the Scope of Practice, Speech-Language Pathology and Audiology statement (LC 6-89), Asha, April 1990, 1-2. PMID:8680261

  20. Potentials, Limitations and Applications of long-term and mobile ad-hoc Wireless Sensor Networks for Environmental Monitoring

    NASA Astrophysics Data System (ADS)

    Bumberger, Jan; Mollenhauer, Hannes; Lapteva, Yulia; Hutschenreuther, Tino; Toepfer, Hannes; Dietrich, Peter

    2014-05-01

    To characterize environmental systems it is necessary to identify and describe processes with suitable methods. Environmental systems are often characterized by their high heterogeneity, so individual measurements for their complete representation are often not sufficient. The application of wireless sensor networks in terrestrial and aquatic ecosystems offer significant benefits as a better consideration of the local test conditions becomes possible. This can be essential for the monitoring of heterogeneous environmental systems. Significant advantages in the application of mobile ad-hoc wireless sensor networks are their self-organizing behavior, resulting in a major reduction in installation and operation costs and time. In addition, a point measurement with a sensor is significantly improved by measuring at several points. It is also possible to perform analog and digital signal processing and computation on the basis of the measured data close to the sensor. Hence, a significant reduction of the data to be transmitted can be achieved which leads to a better energy management of sensor nodes. Furthermore, their localization via satellite, the miniaturization of the nodes and long-term energy self-sufficiency are current topics under investigation. The possibilities and limitations of the applicability of wireless sensor networks for long-term and mobile environmental monitoring are presented. A concepts and realization example are given in the field of micrometeorology and soil parameters for the interaction of biotic and abiotic processes .This long term monitoring is part of the Global Change Experimental Facility (GCEF), a large field-based experimental platform to assess the effects of climate change on ecosystem functions and processes under different land-use scenarios. Furthermore a mobile ad-hoc sensor network is presented for the monitoring of water induced mass wasting processes.

  1. Augmenting 3d City Model Components by Geodata Joins to Facilitate Ad-Hoc Geometric-Topologically Sound Integration

    NASA Astrophysics Data System (ADS)

    Kaden, R.; Kolbe, T. H.

    2012-07-01

    Virtual 3D city models are integrated complex compositions of spatial data of different themes, origin, quality, scale, and dimensions. Within this paper, we address the problem of spatial compatibility of geodata aiming to provide support for ad-hoc integration of virtual 3D city models including geodata of different sources and themes like buildings, terrain, and city furniture. In contrast to related work which is dealing with the integration of redundant geodata structured according to different data models and ontologies, we focus on the integration of complex 3D models of the same representation (here: CityGML) but regarding to the geometric-topological consistent matching of non-homologous objects, e.g. a building is connected to a road, and their geometric homogenisation. Therefore, we present an approach including a data model for a Geodata Join and the general concept of an integration procedure using the join information. The Geodata Join aims to bridge the lack of information between fragmented geodata by describing the relationship between adjacent objects from different datasets. The join information includes the geometrical representation of those parts of an object, which have a specific/known topological or geometrical relationship to another object. This part is referred to as a Connector and is either described by points, lines, or surfaces of the existing object geometry or by additional join geometry. In addition, the join information includes the specification of the connected object in the other dataset and the description of the topological and geometrical relationship between both objects, which is used to aid the matching process. Furthermore, the Geodata Join contains object-related information like accuracy values and restrictions of movement and deformation which are used to optimize the integration process. Based on these parameters, a functional model including a matching algorithm, transformation methods, and conditioned adjustment

  2. A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs

    PubMed Central

    Sivakumar, B.; Bhalaji, N.; Sivakumar, D.

    2014-01-01

    In mobile ad hoc networks connectivity is always an issue of concern. Due to dynamism in the behavior of mobile nodes, efficiency shall be achieved only with the assumption of good network infrastructure. Presence of critical links results in deterioration which should be detected in advance to retain the prevailing communication setup. This paper discusses a short survey on the specialized algorithms and protocols related to energy efficient load balancing for critical link detection in the recent literature. This paper also suggests a machine learning based hybrid power-aware approach for handling critical nodes via load balancing. PMID:24790546

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

    PubMed Central

    Rahayu, Triana Mugia; Lee, Sang-Gon; Lee, Hoon-Jae

    2015-01-01

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

  4. Routing Algorithm Exploits Spatial Relations

    NASA Technical Reports Server (NTRS)

    Okino, Clayton; Jennings, Esther

    2004-01-01

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

  5. Ad Hoc Influenza Vaccination During Years of Significant Antigenic Drift in a Tropical City With 2 Seasonal Peaks

    PubMed Central

    Wong, Martin C.S.; Nelson, E. Anthony S.; Leung, Czarina; Lee, Nelson; Chan, Martin C.W.; Choi, Kin Wing; Rainer, Timothy H.; Cheng, Frankie W.T.; Wong, Samuel Y.S.; Lai, Christopher K.C.; Lam, Bosco; Cheung, Tak Hong; Leung, Ting Fan; Chan, Paul K.S.

    2016-01-01

    Abstract We evaluated the acceptability of an additional ad hoc influenza vaccination among the health care professionals following seasons with significant antigenic drift. Self-administered, anonymous surveys were performed by hard copy questionnaires in public hospitals, and by an on-line platform available to all healthcare professionals, from April 1st to May 31st, 2015. A total of 1290 healthcare professionals completed the questionnaires, including doctors, nurses, and allied health professionals working in both the public and private systems. Only 31.8% of participating respondents expressed an intention to receive the additional vaccine, despite that the majority of them agreed or strongly agreed that it would bring benefit to the community (88.9%), save lives (86.7%), reduce medical expenses (76.3%), satisfy public expectation (82.8%), and increase awareness of vaccination (86.1%). However, a significant proportion expressed concern that the vaccine could disturb the normal immunization schedule (45.5%); felt uncertain what to do in the next vaccination round (66.0%); perceived that the summer peak might not occur (48.2%); and believed that the summer peak might not be of the same virus (83.5%). Furthermore, 27.8% of all respondents expected that the additional vaccination could weaken the efficacy of previous vaccinations; 51.3% was concerned about side effects; and 61.3% estimated that there would be a low uptake rate. If the supply of vaccine was limited, higher priority groups were considered to include the elderly aged ≥65 years with chronic medical conditions (89.2%), the elderly living in residential care homes (87.4%), and long-stay residents of institutions for the disabled (80.7%). The strongest factors associated with accepting the additional vaccine included immunization with influenza vaccines in the past 3 years, higher perceived risk of contracting influenza, and higher perceived severity of the disease impact. The acceptability to an

  6. Data-Centric Multiobjective QoS-Aware Routing Protocol for Body Sensor Networks

    PubMed Central

    Razzaque, Md. Abdur; Hong, Choong Seon; Lee, Sungwon

    2011-01-01

    In this paper, we address Quality-of-Service (QoS)-aware routing issue for Body Sensor Networks (BSNs) in delay and reliability domains. We propose a data-centric multiobjective QoS-Aware routing protocol, called DMQoS, which facilitates the system to achieve customized QoS services for each traffic category differentiated according to the generated data types. It uses modular design architecture wherein different units operate in coordination to provide multiple QoS services. Their operation exploits geographic locations and QoS performance of the neighbor nodes and implements a localized hop-by-hop routing. Moreover, the protocol ensures (almost) a homogeneous energy dissipation rate for all routing nodes in the network through a multiobjective Lexicographic Optimization-based geographic forwarding. We have performed extensive simulations of the proposed protocol, and the results show that DMQoS has significant performance improvements over several state-of-the-art approaches. PMID:22346611

  7. Preserving Nevada's Environmental Heritage: A Report of the Ad Hoc Committee on Environmental Quality. Final Report to the Governor's Natural Resources Council.

    ERIC Educational Resources Information Center

    Nevada State Dept. of Conservation and Natural Resources, Carson City.

    The Environmental Quality Ad Hoc Committee has prepared this report for the Governor's Natural Resources Council (Nevada). It is a compilation of available factual data focusing attention on needed statutory and administrative changes to preserve Nevada's environmental heritage and from which recommendations for future budgetary and legislative…

  8. The Future of 12th Grade NAEP: Report of the Ad Hoc Committee on Planning for NAEP 12th Grade Assessments in 2009

    ERIC Educational Resources Information Center

    National Assessment Governing Board, 2006

    2006-01-01

    The task of the Ad Hoc Committee on Planning for the the National Assessment of Educational Progress (NAEP) 12th Grade Assessments in 2009 addresses three policy areas: (1) Conducting assessment at the state level in 12th grade; (2) Reporting on 12th grade student preparedness for college-credit coursework, training for employment and entrance…

  9. Scientific and Technical Information for Developing Countries. A Report of an Ad Hoc Advisory Panel of the Board on Science and Technology for International Development.

    ERIC Educational Resources Information Center

    National Academy of Sciences - National Research Council, Washington, DC.

    This report from an ad hoc advisory panel of the Board of Science and Technology for International Development attempts to provide an argument for the importance of systematic scientific and technical information transfer within the framework of the total technical assistance effort. It stresses the need for substantially greater activity and a…

  10. Priorities in Community Services Research for the Northeast: A Report of the Ad Hoc Committee on Community Services. Publication No. 10.

    ERIC Educational Resources Information Center

    Northeast Regional Center for Rural Development, Ithaca, NY.

    Constituted to include research users, the ad hoc Committee on Community Services Research in the Northeast analyzed the problems and information needs of community service personnel during a conference session. Issues and questions derived from this initial interchange were categorized and then translated into research problems. Criteria employed…

  11. Dynamic Key Management Schemes for Secure Group Access Control Using Hierarchical Clustering in Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Tsaur, Woei-Jiunn; Pai, Haw-Tyng

    2008-11-01

    The applications of group computing and communication motivate the requirement to provide group access control in mobile ad hoc networks (MANETs). The operation in MANETs' groups performs a decentralized manner and accommodated membership dynamically. Moreover, due to lack of centralized control, MANETs' groups are inherently insecure and vulnerable to attacks from both within and outside the groups. Such features make access control more challenging in MANETs. Recently, several researchers have proposed group access control mechanisms in MANETs based on a variety of threshold signatures. However, these mechanisms cannot actually satisfy MANETs' dynamic environments. This is because the threshold-based mechanisms cannot be achieved when the number of members is not up to the threshold value. Hence, by combining the efficient elliptic curve cryptosystem, self-certified public key cryptosystem and secure filter technique, we construct dynamic key management schemes based on hierarchical clustering for securing group access control in MANETs. Specifically, the proposed schemes can constantly accomplish secure group access control only by renewing the secure filters of few cluster heads, when a cluster head joins or leaves a cross-cluster. In such a new way, we can find that the proposed group access control scheme can be very effective for securing practical applications in MANETs.

  12. Services Oriented Architectures and Rapid Deployment of Ad-Hoc Health Surveillance Systems: Lessons from Katrina Relief Efforts

    PubMed Central

    Mirhaji, Parsa; Casscells, S. Ward; Srinivasan, Arunkumar; Kunapareddy, Narendra; Byrne, Sean; Richards, David; Arafat, Raouf

    2006-01-01

    During the Hurricane Katrina relief efforts, a new city was born overnight within the City of Houston to provide accommodation and health services for thousands of evacuees deprived of food, rest, medical attention, and sanitation [1]. The hurricane victims had been exposed to flood water, toxic materials, physical injury, and mental stress. This scenario was an invitation for a variety of public health hazards, primarily infectious disease outbreaks. Early detection and monitoring of morbidity and mortality among evacuees due to unattended health conditions was an urgent priority and called for deployment of real-time surveillance to collect and analyze data at the scene, and to enable and guide appropriate response and planning activities [2]. To address this need, the University of Texas Health Science Center at Houston (UTHSC) and the Houston Department of Health and Human Services (HDHHS) deployed an ad hoc surveillance system overnight by leveraging Internet-based technologies and Services Oriented Architecture (SOA) [3, 4]. The system was post-coordinated through the orchestration of Web Services such as information integration, natural language processing, UMLS terminology services, syndromic case finding, and online analytical processing (OLAP) [5]. Here we will report the use of Internet-based and distributed architectures in providing timely, novel, and customizable solutions just in time for unprecedented events such as natural disasters. PMID:17238405

  13. Obtaining appropriate interval estimates for age when multiple indicators are used: evaluation of an ad-hoc procedure.

    PubMed

    Fieuws, Steffen; Willems, Guy; Larsen-Tangmose, Sara; Lynnerup, Niels; Boldsen, Jesper; Thevissen, Patrick

    2016-03-01

    When an estimate of age is needed, typically multiple indicators are present as found in skeletal or dental information. There exists a vast literature on approaches to estimate age from such multivariate data. Application of Bayes' rule has been proposed to overcome drawbacks of classical regression models but becomes less trivial as soon as the number of indicators increases. Each of the age indicators can lead to a different point estimate ("the most plausible value for age") and a prediction interval ("the range of possible values"). The major challenge in the combination of multiple indicators is not the calculation of a combined point estimate for age but the construction of an appropriate prediction interval. Ignoring the correlation between the age indicators results in intervals being too small. Boldsen et al. (2002) presented an ad-hoc procedure to construct an approximate confidence interval without the need to model the multivariate correlation structure between the indicators. The aim of the present paper is to bring under attention this pragmatic approach and to evaluate its performance in a practical setting. This is all the more needed since recent publications ignore the need for interval estimation. To illustrate and evaluate the method, Köhler et al. (1995) third molar scores are used to estimate the age in a dataset of 3200 male subjects in the juvenile age range. PMID:26024791

  14. Extended Virtual Spring Mesh (EVSM): The Distributed Self-Organizing Mobile Ad Hoc Network for Area Exploration

    SciTech Connect

    Kurt Derr

    2011-12-01

    Mobile Ad hoc NETworks (MANETs) are distributed self-organizing networks that can change locations and configure themselves on the fly. This paper focuses on an algorithmic approach for the deployment of a MANET within an enclosed area, such as a building in a disaster scenario, which can provide a robust communication infrastructure for search and rescue operations. While a virtual spring mesh (VSM) algorithm provides scalable, self-organizing, and fault-tolerant capabilities required by aMANET, the VSM lacks the MANET's capabilities of deployment mechanisms for blanket coverage of an area and does not provide an obstacle avoidance mechanism. This paper presents a new technique, an extended VSM (EVSM) algorithm that provides the following novelties: (1) new control laws for exploration and expansion to provide blanket coverage, (2) virtual adaptive springs enabling the mesh to expand as necessary, (3) adapts to communications disturbances by varying the density and movement of mobile nodes, and (4) new metrics to assess the performance of the EVSM algorithm. Simulation results show that EVSM provides up to 16% more coverage and is 3.5 times faster than VSM in environments with eight obstacles.

  15. Ad Hoc Rural Regionalism

    ERIC Educational Resources Information Center

    Hamin, Elisabeth M.; Marcucci, Daniel J.

    2008-01-01

    A new regionalism has been much documented and researched for metropolitan areas; this article documents that there is a new rural regionalism as well. In the United States, these groups appear most likely to emerge in areas that are challenged by outcomes characterizing globalization's effects on the rural condition: namely, exurban or…

  16. Adaptive Routing Protocol with Energy Efficiency and Event Clustering for Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Tran Quang, Vinh; Miyoshi, Takumi

    Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.

  17. Relay-based routing protocol for space networks with predictable mobility

    NASA Astrophysics Data System (ADS)

    Zhang, Zhi; Dai, Guanzhong; Li, Lixin; Zhao, Yuting

    2005-11-01

    Future space scientific missions are envisioned to incorporate a large number of satellites and spacecrafts deployed in different orbits to network together into Space Networks. These networks have some unique characteristics such as limited resource of nodes, large latency and intermittent connectivity, which pose challenges to routing. In this paper, we propose a Relay-based Routing Protocol for Space Networks (RRPSN), which exploits the predictability of nodes motion to help deliver packets. Nodes use the link state and trajectory information received from other nodes to construct the routing tables where the next hop node is selected from the current as well as the future neighbors. Three key components of the protocol, including dissemination link information, modified Dijkstra's algorithm and packet processing are described in this paper. The computation complexity and overhead of the protocol is analyzed.

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

    PubMed

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

    2015-01-01

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

  19. An Efficient and Reliable Geographic Routing Protocol Based on Partial Network Coding for Underwater Sensor Networks

    PubMed Central

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

    2015-01-01

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

  20. A survey on the taxonomy of cluster-based routing protocols for homogeneous wireless sensor networks.

    PubMed

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

    2012-01-01

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

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

    PubMed Central

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

    2012-01-01

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

  2. Adaptive Wireless Ad-hoc Sensor Networks for Long-term and Event-oriented Environmental Monitoring

    NASA Astrophysics Data System (ADS)

    Bumberger, Jan; Mollenhauer, Hannes; Remmler, Paul; Schaedler, Martin; Schima, Robert; Mollenhauer, Olaf; Hutschenreuther, Tino; Toepfer, Hannes; Dietrich, Peter

    2015-04-01

    Ecosystems are often characterized by their high heterogeneity, complexity and dynamic. Hence, single point measurements are often not sufficient for their complete representation. The application of wireless sensor networks in terrestrial and aquatic environmental systems offer significant benefits as a better consideration to the local test conditions, due to the simple adjustment of the sensor distribution, the sensor types and the sample rate. Another advantage of wireless ad-hoc sensor networks is their self-organizing behavior, resulting in a major reduction in installation and operation costs and time. In addition, individual point measurements with a sensor are significantly improved by measuring at several points continuously. In this work a concept and realization for Long-term ecosystem research is given in the field monitoring of micrometeorology and soil parameters for the interaction of biotic and abiotic processes. This long term analyses are part of the Global Change Experimental Facility (GCEF), a large field-based experimental platform to assess the effects of climate change on ecosystem functions and processes under different land-use scenarios. Regarding to the adaptive behavior of the network, also a mobile version was developed to overcome the lack of information of temporally and spatially fixed measurements for the detection and recording of highly dynamic or time limited processes. First results of different field campaigns are given to present the potentials and limitations of this application in environmental science, especially for the monitoring of the interaction of biotic and abiotic processes, soil-atmosphere interaction and the validation of remote sensing data.

  3. Adaptive Wireless Ad-hoc Sensor Networks for Long-term and Event-oriented Environmental Monitoring

    NASA Astrophysics Data System (ADS)

    Bumberger, Jan; Mollenhauer, Hannes; Remmler, Paul; Chirila, Andrei Marian; Mollenhauer, Olaf; Hutschenreuther, Tino; Toepfer, Hannes; Dietrich, Peter

    2016-04-01

    Ecosystems are often characterized by their high heterogeneity, complexity and dynamic. Hence, single point measurements are often not sufficient for their complete representation. The application of wireless sensor networks in terrestrial and aquatic environmental systems offer significant benefits as a better consideration to the local test conditions, due to the simple adjustment of the sensor distribution, the sensor types and the sample rate. Another advantage of wireless ad-hoc sensor networks is their self-organizing behavior, resulting in a major reduction in installation and operation costs and time. In addition, individual point measurements with a sensor are significantly improved by measuring at several points continuously. In this work a concept and realization for Long-term ecosystem research is given in the field monitoring of micrometeorology and soil parameters for the interaction of biotic and abiotic processes. This long term analyses are part of the Global Change Experimental Facility (GCEF), a large field-based experimental platform to assess the effects of climate change on ecosystem functions and processes under different land-use scenarios. Regarding to the adaptive behavior of the network, also a mobile version was developed to overcome the lack of information of temporally and spatially fixed measurements for the detection and recording of highly dynamic or time limited processes. First results of different field campaigns are given to present the potentials and limitations of this application in environmental science, especially for the monitoring of the interaction of biotic and abiotic processes, soil-atmosphere interaction and the validation of remote sensing data.

  4. Multi-hop routing mechanism for reliable sensor computing.

    PubMed

    Chen, Jiann-Liang; Ma, Yi-Wei; Lai, Chia-Ping; Hu, Chia-Cheng; Huang, Yueh-Min

    2009-01-01

    Current research on routing in wireless sensor computing concentrates on increasing the service lifetime, enabling scalability for large number of sensors and supporting fault tolerance for battery exhaustion and broken nodes. A sensor node is naturally exposed to various sources of unreliable communication channels and node failures. Sensor nodes have many failure modes, and each failure degrades the network performance. This work develops a novel mechanism, called Reliable Routing Mechanism (RRM), based on a hybrid cluster-based routing protocol to specify the best reliable routing path for sensor computing. Table-driven intra-cluster routing and on-demand inter-cluster routing are combined by changing the relationship between clusters for sensor computing. Applying a reliable routing mechanism in sensor computing can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption. Simulation results indicate that the reliability of the proposed RRM mechanism is around 25% higher than that of the Dynamic Source Routing (DSR) and ad hoc On-demand Distance Vector routing (AODV) mechanisms. PMID:22303165

  5. Multi-Hop Routing Mechanism for Reliable Sensor Computing

    PubMed Central

    Chen, Jiann-Liang; Ma, Yi-Wei; Lai, Chia-Ping; Hu, Chia-Cheng; Huang, Yueh-Min

    2009-01-01

    Current research on routing in wireless sensor computing concentrates on increasing the service lifetime, enabling scalability for large number of sensors and supporting fault tolerance for battery exhaustion and broken nodes. A sensor node is naturally exposed to various sources of unreliable communication channels and node failures. Sensor nodes have many failure modes, and each failure degrades the network performance. This work develops a novel mechanism, called Reliable Routing Mechanism (RRM), based on a hybrid cluster-based routing protocol to specify the best reliable routing path for sensor computing. Table-driven intra-cluster routing and on-demand inter-cluster routing are combined by changing the relationship between clusters for sensor computing. Applying a reliable routing mechanism in sensor computing can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption. Simulation results indicate that the reliability of the proposed RRM mechanism is around 25% higher than that of the Dynamic Source Routing (DSR) and ad hoc On-demand Distance Vector routing (AODV) mechanisms. PMID:22303165

  6. Routing Protocol Based on Link Reliability for WSN

    NASA Astrophysics Data System (ADS)

    Weipeng, Jing; Yaqiu, Liu

    In this paper, defining link reliability strategy constructed by remain energy, and communication cost of nodes as topology weight to synthetically reflect the energy efficiency of dominator, an Energy-radio and communication cost route (ECCR) is proposed to solve the problem that the average energy consumption in cluster and minimum communication cost. We take node residual energy and distance between sink and node to compete cluster head, at the same time, in order to reduce the cluster head energy costs, link reliability and hop is used to establish topology. The experimental results show that the algorithm not only has the energy saved characters, but also ensures the reliability of topology links and extends the network life-cycle efficiently.

  7. SEAODV: A Security Enhanced AODV Routing Protocol for Wireless Mesh Networks

    NASA Astrophysics Data System (ADS)

    Li, Celia; Wang, Zhuang; Yang, Cungang

    In this paper, we propose a Security Enhanced AODV routing protocol (SEAODV) for wireless mesh networks (WMN). SEAODV employs Blom's key pre-distribution scheme to compute the pairwise transient key (PTK) through the flooding of enhanced HELLO message and subsequently uses the established PTK to distribute the group transient key (GTK). PTK and GTK authenticate unicast and broadcast routing messages respectively. In WMN, a unique PTK is shared by each pair of nodes, while GTK is shared secretly between the node and all its one-hop neighbours. A message authentication code (MAC) is attached as the extension to the original AODV routing message to guarantee the message's authenticity and integrity in a hop-by-hop fashion. Security analysis and performance evaluation show that SEAODV is more effective in preventing identified routing attacks and outperforms ARAN and SAODV in terms of computation cost and route acquisition latency.

  8. Neighboring and Connectivity-Aware Routing in VANETs

    PubMed Central

    Koo, Insoo

    2014-01-01

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

  9. Neighboring and connectivity-aware routing in VANETs.

    PubMed

    Ghafoor, Huma; Koo, Insoo; Gohar, Nasir-ud-Din

    2014-01-01

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

  10. Distributed Dynamic Host Configuration Protocol (D2HCP).

    PubMed

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856

  11. Distributed Dynamic Host Configuration Protocol (D2HCP)

    PubMed Central

    Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

    2011-01-01

    Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856

  12. An Adaptive Jitter Mechanism for Reactive Route Discovery in Sensor Networks

    PubMed Central

    Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas

    2014-01-01

    This paper analyses the impact of jitter when applied to route discovery in reactive (on-demand) routing protocols. In multi-hop non-synchronized wireless networks, jitter—a small, random variation in the timing of message emission—is commonly employed, as a means to avoid collisions of simultaneous transmissions by adjacent routers over the same channel. In a reactive routing protocol for sensor and ad hoc networks, jitter is recommended during the route discovery process, specifically, during the network-wide flooding of route request messages, in order to avoid collisions. Commonly, a simple uniform jitter is recommended. Alas, this is not without drawbacks: when applying uniform jitter to the route discovery process, an effect called delay inversion is observed. This paper, first, studies and quantifies this delay inversion effect. Second, this paper proposes an adaptive jitter mechanism, designed to alleviate the delay inversion effect and thereby to reduce the route discovery overhead and (ultimately) allow the routing protocol to find more optimal paths, as compared to uniform jitter. This paper presents both analytical and simulation studies, showing that the proposed adaptive jitter can effectively decrease the cost of route discovery and increase the path quality. PMID:25111238

  13. An adaptive jitter mechanism for reactive route discovery in sensor networks.

    PubMed

    Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas

    2014-01-01

    This paper analyses the impact of jitter when applied to route discovery in reactive (on-demand) routing protocols. In multi-hop non-synchronized wireless networks, jitter--a small, random variation in the timing of message emission--is commonly employed, as a means to avoid collisions of simultaneous transmissions by adjacent routers over the same channel. In a reactive routing protocol for sensor and ad hoc networks, jitter is recommended during the route discovery process, specifically, during the network-wide flooding of route request messages, in order to avoid collisions. Commonly, a simple uniform jitter is recommended. Alas, this is not without drawbacks: when applying uniform jitter to the route discovery process, an effect called delay inversion is observed. This paper, first, studies and quantifies this delay inversion effect. Second, this paper proposes an adaptive jitter mechanism, designed to alleviate the delay inversion effect and thereby to reduce the route discovery overhead and (ultimately) allow the routing protocol to find more optimal paths, as compared to uniform jitter. This paper presents both analytical and simulation studies, showing that the proposed adaptive jitter can effectively decrease the cost of route discovery and increase the path quality. PMID:25111238

  14. Analysis of energy efficient routing protocols for implementation of a ubiquitous health system

    NASA Astrophysics Data System (ADS)

    Kwon, Jongwon; Park, Yongman; Koo, Sangjun; Ayurzana, Odgeral; Kim, Hiesik

    2007-12-01

    The innovative Ubiquitous-Health was born through convergence of medical service, with development of up to date information technologies and ubiquitous IT. The U-Health can be applied to a variety of special situations for managing functions of each medical center efficiently. This paper focuses on estimation of various routing protocols for implementation of U-health monitoring system. In order to facilitate wireless communication over the network, a routing protocol on the network layer is used to establish precise and efficient route between sensor nodes so that information acquired from sensors may be delivered in a timely manner. A route establishment should be considered to minimize overhead, data loss and power consumption because wireless networks for U-health are organized by a large number of sensor nodes which are small in size and have limited processing power, memory and battery life. In this paper a overview of wireless sensor network technologies commonly known is described as well as evaluation of three multi hop routing protocols which are flooding, gossiping and modified low energy adaptive clustering hierarchy(LEACH) for use with these networks using TOSSIM simulator. As a result of evaluation the integrated wireless sensor board was developed in particular. The board is embedded device based on AVR128 porting TinyOS. Also it employs bio sensor measures blood pressure, pulse frequency and ZigBee module for wireless communication. This paper accelerates the digital convergence age through continual research and development of technologies related the U-Health.

  15. Clinician Ratings of Interpreter Mediated Visits in Underserved Primary Care Settings with Ad hoc, In-person Professional, and Video Conferencing Modes

    PubMed Central

    Nápoles, Anna M.; Santoyo-Olsson, Jasmine; Karliner, Leah S.; O’Brien, Helen; Gregorich, Steven E.; Pérez-Stable, Eliseo J.

    2013-01-01

    Language interpretation ameliorates health disparities among underserved limited English-proficient patients, yet few studies have compared clinician satisfaction with these services. Self-administered clinician post-visit surveys compared the quality of interpretation and communication, visit satisfaction, degree of patient engagement, and cultural competence of visits using untrained people acting as interpreters (ad hoc), in-person professional, or video conferencing professional interpretation for 283 visits. Adjusting for clinician and patient characteristics, the quality of interpretation of in-person and video conferencing modes were rated similarly (OR=1.79; 95% CI 0.74, 4.33). The quality of in-person (OR=5.55; 95% CI 1.50, 20.51) and video conferencing (OR=3.10; 95% CI 1.16, 8.31) were rated higher than ad hoc interpretation. Self-assessed cultural competence was better for in-person versus video conferencing interpretation (OR=2.32; 95% CI 1.11, 4.86). Video conferencing interpretation increases access without compromising quality, but cultural nuances may be better addressed by in-person interpreters. Professional interpretation is superior to ad hoc (OR=4.15; 95% CI 1.43, 12.09). PMID:20173271

  16. Development of Innovative and Inexpensive Optical Sensors in Wireless Ad-hoc Sensor Networks for Environmental Monitoring

    NASA Astrophysics Data System (ADS)

    Mollenhauer, Hannes; Schima, Robert; Assing, Martin; Mollenhauer, Olaf; Dietrich, Peter; Bumberger, Jan

    2015-04-01

    Due to the heterogeneity and dynamic of ecosystems, the observation and monitoring of natural processes necessitate a high temporal and spatial resolution. This also requires inexpensive and adaptive measurements as well as innovative monitoring strategies. To this end, the application of ad-hoc wireless sensor networks holds the potential of creating an adequate monitoring platform. In order to achieve a comprehensive monitoring in space and time with affordability, it is necessary to reduce the sensor costs. Common investigation methods, especially with regard to vegetation processes, are based on optical measurements. In particular, different wavelengths correspond to specific properties of the plants and preserve the possibility to derive information about the ecosystem, e.g. photosynthetic performance or nutrient content. In this context, photosynthetically active radiation (PAR) sensors and hyperspectral sensors are in major use. This work aims the development, evaluation and application of inexpensive but high performance optical sensors for the implementation in wireless sensor networks. Photosynthetically active radiation designates the spectral range from 400 to 700 nanometers that photosynthetic organisms are able to use in the process of photosynthesis. PAR sensors enable the detection of the reflected solar light of the vegetation in the whole PAR wave band. The amount of absorption indicates photosynthetic activity of the plant, with good approximation. Hyperspectral sensors observe specific parts or rather distinct wavelengths of the solar light spectrum and facilitate the determination of the main pigment classes, e.g. Chlorophyll, Carotenoid and Anthocyanin. Due to the specific absorption of certain pigments, a characteristic spectral signature can be seen in the visible part of the electromagnetic spectrum, known as narrow-band peaks. In an analogous manner, also the presence and concentration of different nutrients cause a characteristic spectral

  17. Ad-hoc and context-dependent adjustments of selective attention in conflict control: an ERP study with visual probes.

    PubMed

    Nigbur, R; Schneider, J; Sommer, W; Dimigen, O; Stürmer, B

    2015-02-15

    Cognitive conflict control in flanker tasks has often been described using the zoom-lens metaphor of selective attention. However, whether and how selective attention - in terms of suppression and enhancement - operates in this context has remained unclear. To examine the dynamic interplay of selective attention and cognitive control we used electrophysiological measures and presented task-irrelevant visual probe stimuli at foveal, parafoveal, and peripheral display positions. Target-flanker congruency varied either randomly from trial to trial (mixed-block) or block-wise (fixed-block) in order to induce reactive versus proactive control modes, respectively. Three EEG measures were used to capture ad-hoc adjustments within trials as well as effects of context-based predictions: the N1 component of the visual evoked potential (VEP) to probes, the VEP to targets, and the conflict-related midfrontal N2 component. Results from probe-VEPs indicate that enhanced processing of the foveal target rather than suppression of the peripheral flankers supports interference control. In incongruent mixed-block trials VEPs were larger to probes near the targets. In the fixed-blocks probe-VEPs were not modulated, but contrary to the mixed-block the preceding target-related VEP was affected by congruency. Results of the control-related N2 reveal largest amplitudes in the unpredictable context, which did not differentiate for stimulus and response incongruency. In contrast, in the predictable context, N2 amplitudes were reduced overall and differentiated between stimulus and response incongruency. Taken together these results imply that predictability alters interference control by a reconfiguration of stimulus processing. During unpredictable sequences participants adjust their attentional focus dynamically on a trial-by-trial basis as reflected in congruency-dependent probe-VEP-modulation. This reactive control mode also elicits larger N2 amplitudes. In contrast, when task demands

  18. RoCoMAR: Robots' Controllable Mobility Aided Routing and Relay Architecture for Mobile Sensor Networks

    PubMed Central

    Van Le, Duc; Oh, Hoon; Yoon, Seokhoon

    2013-01-01

    In a practical deployment, mobile sensor network (MSN) suffers from a low performance due to high node mobility, time-varying wireless channel properties, and obstacles between communicating nodes. In order to tackle the problem of low network performance and provide a desired end-to-end data transfer quality, in this paper we propose a novel ad hoc routing and relaying architecture, namely RoCoMAR (Robots' Controllable Mobility Aided Routing) that uses robotic nodes' controllable mobility. RoCoMAR repeatedly performs link reinforcement process with the objective of maximizing the network throughput, in which the link with the lowest quality on the path is identified and replaced with high quality links by placing a robotic node as a relay at an optimal position. The robotic node resigns as a relay if the objective is achieved or no more gain can be obtained with a new relay. Once placed as a relay, the robotic node performs adaptive link maintenance by adjusting its position according to the movements of regular nodes. The simulation results show that RoCoMAR outperforms existing ad hoc routing protocols for MSN in terms of network throughput and end-to-end delay. PMID:23881134

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

    PubMed Central

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

    2015-01-01

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

  20. Cluster-Head Techniques for Single-hop Routing protocol in Energy Efficient Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Kandukuri, Somasekhar; Murad, Nour; Lorion, Richard

    2016-03-01

    Energy efficient routing protocols are an active research area in Wireless Sensor Networks (WSNs). Like prior research works in efficient-efficient routing protocols, we enhance the LEACH cluster-head (CH) threshold mechanism. Our approach mainly focuses on the idea of maximizing the network lifetime on the basis of CH nodes remaining energy levels. In LEACH, CH changes occur during every round of the network irrespective of their energy levels. In this scenario, we propose an energy threshold function as well as an optimal CH threshold function to specify the dynamicity of the CH, whether to change the cluster-topology often or not with the consideration of its current energy levels. In this regard, simulation results show that the proposed mechanism can maximize the network lifetime effectively and delivers three times more data messages while comparing with the other known energy-efficient protocols from the literature.

  1. Privacy Preserved and Secured Reliable Routing Protocol for Wireless Mesh Networks

    PubMed Central

    Thandava Meganathan, Navamani; Palanichamy, Yogesh

    2015-01-01

    Privacy preservation and security provision against internal attacks in wireless mesh networks (WMNs) are more demanding than in wired networks due to the open nature and mobility of certain nodes in the network. Several schemes have been proposed to preserve privacy and provide security in WMNs. To provide complete privacy protection in WMNs, the properties of unobservability, unlinkability, and anonymity are to be ensured during route discovery. These properties can be achieved by implementing group signature and ID-based encryption schemes during route discovery. Due to the characteristics of WMNs, it is more vulnerable to many network layer attacks. Hence, a strong protection is needed to avoid these attacks and this can be achieved by introducing a new Cross-Layer and Subject Logic based Dynamic Reputation (CLSL-DR) mechanism during route discovery. In this paper, we propose a new Privacy preserved and Secured Reliable Routing (PSRR) protocol for WMNs. This protocol incorporates group signature, ID-based encryption schemes, and CLSL-DR mechanism to ensure strong privacy, security, and reliability in WMNs. Simulation results prove this by showing better performance in terms of most of the chosen parameters than the existing protocols. PMID:26484361

  2. Privacy Preserved and Secured Reliable Routing Protocol for Wireless Mesh Networks.

    PubMed

    Meganathan, Navamani Thandava; Palanichamy, Yogesh

    2015-01-01

    Privacy preservation and security provision against internal attacks in wireless mesh networks (WMNs) are more demanding than in wired networks due to the open nature and mobility of certain nodes in the network. Several schemes have been proposed to preserve privacy and provide security in WMNs. To provide complete privacy protection in WMNs, the properties of unobservability, unlinkability, and anonymity are to be ensured during route discovery. These properties can be achieved by implementing group signature and ID-based encryption schemes during route discovery. Due to the characteristics of WMNs, it is more vulnerable to many network layer attacks. Hence, a strong protection is needed to avoid these attacks and this can be achieved by introducing a new Cross-Layer and Subject Logic based Dynamic Reputation (CLSL-DR) mechanism during route discovery. In this paper, we propose a new Privacy preserved and Secured Reliable Routing (PSRR) protocol for WMNs. This protocol incorporates group signature, ID-based encryption schemes, and CLSL-DR mechanism to ensure strong privacy, security, and reliability in WMNs. Simulation results prove this by showing better performance in terms of most of the chosen parameters than the existing protocols. PMID:26484361

  3. Energy Efficiency of Cluster-based Routing Protocols used in Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Meelu, Rajni; Anand, Rohit

    2010-11-01

    WSN faces a challenge in energy consumption. Because the sensor nodes in WSN are provided energy by compact batteries and the data transmission is frequent, the energy could be used up in a short time. Minimizing energy dissipation and maximizing network lifetime are among the central concerns when designing applications and protocols for sensor networks. Clustering has been proven to be energy-efficient in sensor networks since data routing and relaying are only operated by cluster heads. Besides, cluster heads can process, filter and aggregate data sent by cluster members, thus reducing network load and alleviating the bandwidth. In this paper, we propose a cluster-based routing algorithm viz. DCR (Distributed Cluster Routing) protocol and LEACH (Low Energy Adaptive Clustering Hierarchy) protocol. Sensor's eligibility to be elected cluster head is based on its residual energy and the distance. A simulation shows the comparison of above said algorithms in terms of time to live for nodes and data transmission. The results show that these protocols are almost similar for energy consumption but in terms of data transmission DCR performs better than LEACH.

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

    PubMed Central

    Khilar, Pabitra Mohan

    2014-01-01

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

  5. Analysis of GMPLS OSPF-TE protocol and its enhancement for routing in optical networks

    NASA Astrophysics Data System (ADS)

    Liu, Hang; Bouillet, E.; Pendarakis, Dimitrios; Komaee, Nooshin; Labourdette, J.; Chaudhuri, Sid

    2004-10-01

    For distributed control, network topology and link resource information is required at the ingress nodes to compute and route optical paths. It is the responsibility of routing protocols to disseminate this information. Generalized MPLS has extended traditional IP routing protocols such as OSPF for explicit path computation and traffic engineering (TE) in optical transport networks. However it is noted that the current version of GMPLS-extended OSPF-TE does not carry sufficient link state information to compute shared mesh restored paths. This paper describes the new extensions to the GMPLS OSPF-TE protocol to support the path computation for shared mesh restoration in optical networks. The efficient methods for aggregation and dissemination of link resource availability and sharing information are proposed. Especially these new extensions support both Shared Risk Link Group (SRLG) disjoint and node disjoint restoration paths, which provides more flexibility to the network operators. The network operators can choose to guarantee recovery from a SRLG failure or from a node/SRLG failure based upon the applications and the service level agreements with their customers. Furthermore, the paper presents an analytical model to estimate the performance of the GMPLS OSPF-TE protocol and the proposed extensions, including control bandwidth and memory requirements.

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

    PubMed

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

    2010-01-01

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

  7. The Deployment of Routing Protocols in Distributed Control Plane of SDN

    PubMed Central

    Jingjing, Zhou; Di, Cheng; Weiming, Wang; Rong, Jin; Xiaochun, Wu

    2014-01-01

    Software defined network (SDN) provides a programmable network through decoupling the data plane, control plane, and application plane from the original closed system, thus revolutionizing the existing network architecture to improve the performance and scalability. In this paper, we learned about the distributed characteristics of Kandoo architecture and, meanwhile, improved and optimized Kandoo's two levels of controllers based on ideological inspiration of RCP (routing control platform). Finally, we analyzed the deployment strategies of BGP and OSPF protocol in a distributed control plane of SDN. The simulation results show that our deployment strategies are superior to the traditional routing strategies. PMID:25250395

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

    PubMed

    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

  9. The deployment of routing protocols in distributed control plane of SDN.

    PubMed

    Jingjing, Zhou; Di, Cheng; Weiming, Wang; Rong, Jin; Xiaochun, Wu

    2014-01-01

    Software defined network (SDN) provides a programmable network through decoupling the data plane, control plane, and application plane from the original closed system, thus revolutionizing the existing network architecture to improve the performance and scalability. In this paper, we learned about the distributed characteristics of Kandoo architecture and, meanwhile, improved and optimized Kandoo's two levels of controllers based on ideological inspiration of RCP (routing control platform). Finally, we analyzed the deployment strategies of BGP and OSPF protocol in a distributed control plane of SDN. The simulation results show that our deployment strategies are superior to the traditional routing strategies. PMID:25250395

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

    NASA Astrophysics Data System (ADS)

    >Hasan Farooq, Low Tang Jung,

    2013-06-01

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

  11. Cross-Layer Protocol Combining Tree Routing and TDMA Slotting in Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Bai, Ronggang; Ji, Yusheng; Lin, Zhiting; Wang, Qinghua; Zhou, Xiaofang; Qu, Yugui; Zhao, Baohua

    Being different from other networks, the load and direction of data traffic for wireless sensor networks are rather predictable. The relationships between nodes are cooperative rather than competitive. These features allow the design approach of a protocol stack to be able to use the cross-layer interactive way instead of a hierarchical structure. The proposed cross-layer protocol CLWSN optimizes the channel allocation in the MAC layer using the information from the routing tables, reduces the conflicting set, and improves the throughput. Simulations revealed that it outperforms SMAC and MINA in terms of delay and energy consumption.

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

    PubMed Central

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

    2013-01-01

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

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

    PubMed

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

    2015-01-01

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

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

    PubMed Central

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

    2015-01-01

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

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

    PubMed

    Guan, Xin; Wu, Huayang; Bi, Shujun

    2011-01-01

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

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

    PubMed Central

    Guan, Xin; Wu, Huayang; Bi, Shujun

    2011-01-01

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

  17. Self-adaptive trust based ABR protocol for MANETs using Q-learning.

    PubMed

    Kumar, Anitha Vijaya; Jeyapal, Akilandeswari

    2014-01-01

    Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation. PMID:25254243

  18. Self-Adaptive Trust Based ABR Protocol for MANETs Using Q-Learning

    PubMed Central

    Jeyapal, Akilandeswari

    2014-01-01

    Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation. PMID:25254243

  19. Energy consumption and control response evaluations of AODV routing in WSANs for building-temperature control.

    PubMed

    Booranawong, Apidet; Teerapabkajorndet, Wiklom; Limsakul, Chusak

    2013-01-01

    The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved. PMID:23807689

  20. Energy Consumption and Control Response Evaluations of AODV Routing in WSANs for Building-Temperature Control

    PubMed Central

    Booranawong, Apidet; Teerapabkajorndet, Wiklom; Limsakul, Chusak

    2013-01-01

    The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved. PMID:23807689

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

    PubMed

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

  2. A Lightweight Neighbor-Info-Based Routing Protocol for No-Base-Station Taxi-Call System

    PubMed Central

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

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

    PubMed

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

    2013-01-01

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

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

    PubMed Central

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

    2013-01-01

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

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

    PubMed

    Perumal, Madhumathy; Dhandapani, Sivakumar

    2015-01-01

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

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

    PubMed Central

    Perumal, Madhumathy; Dhandapani, Sivakumar

    2015-01-01

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

  7. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

    PubMed

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

  8. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks

    PubMed Central

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

  9. A Routing Protocol with Stepwise Interest Retransmission for Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Bandai, Masaki; Mioki, Takamasa; Watanabe, Takashi

    In this paper, a routing protocol referred to as Directed Diffusion with Stepwise Interest Retransmission (DD/SIR) for wireless sensor networks is proposed to mitigate power consumption considering node mobility. In DD/SIR, a sink retransmits interest. The propagation areas of the interest are narrowed stepwisely. In addition, according to the number of hops between the sink and sensor nodes, the data transmission timing is controlled sequentially. By both theoretical analysis and computer simulation, we evaluate the performance of DD/SIR. We show that DD/SIR can mitigate control overhead and realize low power operation without degrading data reachability to the sink. Especially, at a small number of data sending nodes, DD/SIR is more effective than the conventional routing.

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

    PubMed

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

  11. Reliable Freestanding Position-Based Routing in Highway Scenarios

    PubMed Central

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

    2012-01-01

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

  12. Reliable freestanding position-based routing in highway scenarios.

    PubMed

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

    2012-01-01

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

  13. Criteria for intraventricular conduction disturbances and pre-excitation. World Health Organizational/International Society and Federation for Cardiology Task Force Ad Hoc.

    PubMed

    Willems, J L; Robles de Medina, E O; Bernard, R; Coumel, P; Fisch, C; Krikler, D; Mazur, N A; Meijler, F L; Mogensen, L; Moret, P

    1985-06-01

    In an effort to standardize terminology and criteria for clinical electrocardiography, and as a follow-up of its work on definitions of terms related to cardiac rhythm, an Ad Hoc Working Group established by the World Health Organization and the International Society and Federation of Cardiology reviewed criteria for the diagnosis of conduction disturbances and pre-excitation. Recommendations resulting from these discussions are summarized for the diagnosis of complete and incomplete right and left bundle branch block, left anterior and left posterior fascicular block, nonspecific intraventricular block, Wolff-Parkinson-White syndrome and related pre-excitation patterns. Criteria for intraatrial conduction disturbances are also briefly reviewed. The criteria are described in clinical terms. A concise description of the criteria using formal Boolean logic is given in the Appendix. For the incorporation into computer electrocardiographic analysis programs, the limits of some interval measurements may need to be adjusted. PMID:3889097

  14. Fundamental lifetime mechanisms in routing protocols for wireless sensor networks: a survey and open issues.

    PubMed

    Eslaminejad, Mohammadreza; Razak, Shukor Abd

    2012-01-01

    Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues. PMID:23202008

  15. A multipath routing protocol based on clustering and ant colony optimization for wireless sensor networks.

    PubMed

    Yang, Jing; Xu, Mai; Zhao, Wei; Xu, Baoguo

    2010-01-01

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

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

    PubMed Central

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

    2015-01-01

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

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

    PubMed

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

    2015-01-01

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

  18. Immunization coverage among splenectomized patients: Results of an ad hoc survey in Puglia Region (South of Italy).

    PubMed

    Martino, Carmen; Gallone, Maria Serena; Quarto, Michele; Germinario, Cinzia; Tafuri, Silvio

    2016-05-01

    Patients with anatomic or functional asplenia have a 10-50 times higher risk than general population to develop Overwhelming Post-Splenectomy Infection. Evidences are unanimous in recommending splenectomised patients to receive meningococcal, antipneumococcal and Haemophilus influenzae type B vaccinations according to a specific timing. In Italy there are no current data on the immunisation coverage in these patients. This study aims to investigate immunisation coverage in patients undergoing elective or urgent splenectomy for 2012-2013 in the 3 Apulian hospitals. The patients discharged with the code ICD-9-CM 41.5 - "Total splenectomy" were enrolled. The administration of vaccines was verified through consultation of medical records, archives of general practitioners and vaccination offices. In the study period, 166 subjects underwent splenectomy and none of them received vaccinations during hospitalization. 25 splenectomised patients (15.1%) received at least one of the recommended vaccinations. 21 patients (12.6%) received vaccine against Streptococcus pneumonia, 13 (7.8%) meningococcal vaccine, 10 patients (6%) Haemophilus influenzae type B vaccine. The low vaccination coverage could be due both to poor perception of the risk of infection and to a lack of knowledge on vaccinations by surgeons. For this reason it is necessary to draw up and share operational protocols that establish the administration of vaccines. PMID:26890256

  19. Neural methods based on modified reputation rules for detection and identification of intrusion attacks in wireless ad hoc sensor networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2010-04-01

    Determining methods to secure the process of data fusion against attacks by compromised nodes in wireless sensor networks (WSNs) and to quantify the uncertainty that may exist in the aggregation results is a critical issue in mitigating the effects of intrusion attacks. Published research has introduced the concept of the trustworthiness (reputation) of a single sensor node. Reputation is evaluated using an information-theoretic concept, the Kullback- Leibler (KL) distance. Reputation is added to the set of security features. In data aggregation, an opinion, a metric of the degree of belief, is generated to represent the uncertainty in the aggregation result. As aggregate information is disseminated along routes to the sink node(s), its corresponding opinion is propagated and regulated by Josang's belief model. By applying subjective logic on the opinion to manage trust propagation, the uncertainty inherent in aggregation results can be quantified for use in decision making. The concepts of reputation and opinion are modified to allow their application to a class of dynamic WSNs. Using reputation as a factor in determining interim aggregate information is equivalent to implementation of a reputation-based security filter at each processing stage of data fusion, thereby improving the intrusion detection and identification results based on unsupervised techniques. In particular, the reputation-based version of the probabilistic neural network (PNN) learns the signature of normal network traffic with the random probability weights normally used in the PNN replaced by the trust-based quantified reputations of sensor data or subsequent aggregation results generated by the sequential implementation of a version of Josang's belief model. A two-stage, intrusion detection and identification algorithm is implemented to overcome the problems of large sensor data loads and resource restrictions in WSNs. Performance of the twostage algorithm is assessed in simulations of WSN

  20. Dynamical jumping real-time fault-tolerant routing protocol for wireless sensor networks.

    PubMed

    Wu, Guowei; Lin, Chi; Xia, Feng; Yao, Lin; Zhang, He; Liu, Bing

    2010-01-01

    In time-critical wireless sensor network (WSN) applications, a high degree of reliability is commonly required. A dynamical jumping real-time fault-tolerant routing protocol (DMRF) is proposed in this paper. Each node utilizes the remaining transmission time of the data packets and the state of the forwarding candidate node set to dynamically choose the next hop. Once node failure, network congestion or void region occurs, the transmission mode will switch to jumping transmission mode, which can reduce the transmission time delay, guaranteeing the data packets to be sent to the destination node within the specified time limit. By using feedback mechanism, each node dynamically adjusts the jumping probabilities to increase the ratio of successful transmission. Simulation results show that DMRF can not only efficiently reduce the effects of failure nodes, congestion and void region, but also yield higher ratio of successful transmission, smaller transmission delay and reduced number of control packets. PMID:22294933

  1. AURP: an AUV-aided underwater routing protocol for underwater acoustic sensor networks.

    PubMed

    Yoon, Seokhoon; Azad, Abul K; Oh, Hoon; Kim, Sunghwan

    2012-01-01

    Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved. PMID:22438740

  2. Towards a hybrid energy efficient multi-tree-based optimized routing protocol for wireless networks.

    PubMed

    Mitton, Nathalie; Razafindralambo, Tahiry; Simplot-Ryl, David; Stojmenovic, Ivan

    2012-01-01

    This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks. In HECTOR, the node currently holding the packet forwards it to its neighbor that optimizes ratio of power cost over distance progress with landmark coordinates, among nodes that reduce landmark coordinates and do not increase distance in tree coordinates. If such a node does not exist, then forwarding is made to the neighbor that reduces tree-based distance only and optimizes power cost over tree distance progress ratio. We theoretically prove the packet delivery and propose an extension based on the use of multiple trees. Our simulations show the superiority of our algorithm over existing alternatives while guaranteeing delivery, and only up to 30% additional power compared to centralized shortest weighted path algorithm. PMID:23443398

  3. AURP: An AUV-Aided Underwater Routing Protocol for Underwater Acoustic Sensor Networks

    PubMed Central

    Yoon, Seokhoon; Azad, Abul K.; Oh, Hoon; Kim, Sunghwan

    2012-01-01

    Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved. PMID:22438740

  4. Ad Hoc Influenza Vaccination During Years of Significant Antigenic Drift in a Tropical City With 2 Seasonal Peaks: A Cross-Sectional Survey Among Health Care Practitioners.

    PubMed

    Wong, Martin C S; Nelson, E Anthony S; Leung, Czarina; Lee, Nelson; Chan, Martin C W; Choi, Kin Wing; Rainer, Timothy H; Cheng, Frankie W T; Wong, Samuel Y S; Lai, Christopher K C; Lam, Bosco; Cheung, Tak Hong; Leung, Ting Fan; Chan, Paul K S

    2016-05-01

    We evaluated the acceptability of an additional ad hoc influenza vaccination among the health care professionals following seasons with significant antigenic drift.Self-administered, anonymous surveys were performed by hard copy questionnaires in public hospitals, and by an on-line platform available to all healthcare professionals, from April 1st to May 31st, 2015. A total of 1290 healthcare professionals completed the questionnaires, including doctors, nurses, and allied health professionals working in both the public and private systems.Only 31.8% of participating respondents expressed an intention to receive the additional vaccine, despite that the majority of them agreed or strongly agreed that it would bring benefit to the community (88.9%), save lives (86.7%), reduce medical expenses (76.3%), satisfy public expectation (82.8%), and increase awareness of vaccination (86.1%). However, a significant proportion expressed concern that the vaccine could disturb the normal immunization schedule (45.5%); felt uncertain what to do in the next vaccination round (66.0%); perceived that the summer peak might not occur (48.2%); and believed that the summer peak might not be of the same virus (83.5%). Furthermore, 27.8% of all respondents expected that the additional vaccination could weaken the efficacy of previous vaccinations; 51.3% was concerned about side effects; and 61.3% estimated that there would be a low uptake rate. If the supply of vaccine was limited, higher priority groups were considered to include the elderly aged ≥65 years with chronic medical conditions (89.2%), the elderly living in residential care homes (87.4%), and long-stay residents of institutions for the disabled (80.7%). The strongest factors associated with accepting the additional vaccine included immunization with influenza vaccines in the past 3 years, higher perceived risk of contracting influenza, and higher perceived severity of the disease impact.The acceptability to an additional ad

  5. An Empirical Evaluation of Lightweight Random Walk Based Routing Protocol in Duty Cycle Aware Wireless Sensor Networks

    PubMed Central

    Fatima, Mehwish

    2014-01-01

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

  6. Ad Hoc Conference on the Education of Migrants: Introductory Report on Theme III, "Opportunities for Vocational and Technical Training and General Education for Adults and Adolescents" (Strasbourg, France, November 5-8, 1974).

    ERIC Educational Resources Information Center

    Egger, Eugene

    Theme III of the Ad Hoc Conference on the Education of Migrants was "measures to secure the satisfactory provision of opportunities for vocational and technical training and general education for adults and adolescents". This report briefly summarizes the situation in member countries regarding the vocational and technical training and general…

  7. CIRRPC Science Panel report No. 3 and 2: Review of the report of the National Institutes of Health Ad Hoc Working Group to Develop Radioepidemiological Tables

    SciTech Connect

    1985-01-01

    This report of the Science Panel supplements an earlier document (included), which summarized the Panel`s views on the September, 1984, draft report of the National Institutes of Health Ad Hoc Working Group to Develop Radioepidemiological Tables. Although the Orphan Drug Act requires that tables be produced for a range of dose from one millirad to 1000 rad, the Working Group chose to make no estimates below one rad. The Science Panel is in agreement with this judgment because in the low-dose range there is little empirical evidence of a carcinogenic effect in humans. In order for the Tables to be applicable, a person must have both one of the cancers listed in the Tables and a previous exposure to ionizing radiation. Therefore, the Tables should not be applied to determine the likelihood that a person having received a specific radiation dose will have such a cancer. The Panel`s previous recommendations were primarily concerned with three issues, use of Quality Factors, use of tables for exposures from internally deposited radionuclides, and treatment of uncertainties. In the final report, the Working Group has dispensed with the use of Quality Factors in treating the risks from internally deposited alpha emitters and has substantially expanded on its treatment of uncertainties. The Science Panel`s comments on these changes and other aspects of the report are included.

  8. Estimating HIV Incidence during Pregnancy and Knowledge of Prevention of Mother-to-Child Transmission with an Ad Hoc Analysis of Potential Cofactors

    PubMed Central

    Egbe, Thomas Obinchemti; Tazinya, Rose-Mary Asong; Halle-Ekane, Gregory Edie; Egbe, Eta-Nkongho; Achidi, Eric Akum

    2016-01-01

    Background. We determined the incidence of HIV seroconversion during the second and third trimesters of pregnancy and ad hoc potential cofactors associated with HIV seroconversion after having an HIV-negative result antenatally. We also studied knowledge of PMTCT among pregnant women in seven health facilities in Fako Division, South West Region, Cameroon. Method. During the period between September 12 and December 4, 2011, we recruited a cohort of 477 HIV-negative pregnant women by cluster sampling. Data collection was with a pretested interviewer-administered questionnaire. Sociodemographic information, knowledge of PMTCT, and methods of HIV prevention were obtained from the study population and we did Voluntary Counselling and Testing (VCT) for HIV. Results. The incidence rate of HIV seroconversion during pregnancy was 6.8/100 woman-years. Ninety percent of the participants did not use condoms throughout pregnancy but had a good knowledge of PMTCT of HIV. Only 31.9% of participants knew their HIV status before the booking visit and 33% did not know the HIV status of their partners. Conclusion. The incidence rate of HIV seroconversion in the Fako Division, Cameroon, was 6.8/100 woman-years. No risk factors associated with HIV seroconversion were identified among the study participants because of lack of power to do so. PMID:27127653

  9. An ultra-wide bandwidth-based range/GPS tight integration approach for relative positioning in vehicular ad hoc networks

    NASA Astrophysics Data System (ADS)

    Shen, Feng; Wayn Cheong, Joon; Dempster, Andrew G.

    2015-04-01

    Relative position awareness is a vital premise for the implementation of emerging intelligent transportation systems, such as collision warning. However, commercial global navigation satellite systems (GNSS) receivers do not satisfy the requirements of these applications. Fortunately, cooperative positioning (CP) techniques, through sharing the GNSS measurements between vehicles, can improve the performance of relative positioning in a vehicular ad hoc network (VANET). In this paper, while assuming there are no obstacles between vehicles, a new enhanced tightly coupled CP technique is presented by adding ultra-wide bandwidth (UWB)-based inter-vehicular range measurements. In the proposed CP method, each vehicle fuses the GPS measurements and the inter-vehicular range measurements. Based on analytical and experimental results, in the full GPS coverage environment, the new tight integration CP method outperforms the INS-aided tight CP method, tight CP method, and DGPS by 11%, 15%, and 24%, respectively; in the GPS outage scenario, the performance improvement achieves 60%, 65%, and 73%, respectively.

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

    NASA Astrophysics Data System (ADS)

    Zeng, Hui; Meng, Ke; Deng, Julia

    2012-06-01

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

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

    PubMed

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

    2015-01-01

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

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

    PubMed Central

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

    2015-01-01

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

  13. Monitoring of slope-instabilities and deformations with Micro-Electro-Mechanical-Systems (MEMS) in wireless ad-hoc Sensor Networks

    NASA Astrophysics Data System (ADS)

    Arnhardt, C.; Fernández-Steeger, T. M.; Azzam, R.

    2009-04-01

    In most mountainous regions, landslides represent a major threat to human life, properties and infrastructures. Nowadays existing landslide monitoring systems are often characterized by high efforts in terms of purchase, installation, maintenance, manpower and material. In addition (or because of this) only small areas or selective points of the endangered zone can be observed by the system. Therefore the improvement of existing and the development of new monitoring and warning systems are of high relevance. The joint project "Sensor based Landslide Early Warning Systems" (SLEWS) deals with the development of a prototypic Alarm- and Early Warning system (EWS) for different types of landslides using low-cost micro-sensors (MEMS) integrated in a wireless sensor network (WSN). Modern so called Ad-Hoc, Multi-Hop wireless sensor networks (WSN) are characterized by a self organizing and self-healing capacity of the system (autonomous systems). The network consists of numerous individual and own energy-supply operating sensor nodes, that can send data packages from their measuring devices (here: MEMS) over other nodes (Multi-Hop) to a collection point (gateway). The gateway provides the interface to central processing and data retrieval units (PC, Laptop or server) outside the network. In order to detect and monitor the different landslide processes (like fall, topple, spreading or sliding) 3D MEMS capacitive sensors made from single silicon crystals and glass were chosen to measure acceleration, tilting and altitude changes. Based on the so called MEMS (Micro-Electro-Mechanical Systems) technology, the sensors combine very small mechanical and electronic units, sensing elements and transducers on a small microchip. The mass production of such type of sensors allows low cost applications in different areas (like automobile industries, medicine, and automation technology). Apart from the small and so space saving size and the low costs another advantage is the energy

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

    PubMed

    Alia, Osama Moh'd

    2014-01-01

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

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

    SciTech Connect

    PI: Robert Grossman Co-PI: Stephen Eick

    2009-08-04

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

  16. Monitoring of slope-instabilities and deformations with Micro-Electro-Mechanical-Systems (MEMS) in wireless ad-hoc Sensor Networks

    NASA Astrophysics Data System (ADS)

    Arnhardt, C.; Fernández-Steeger, T. M.; Azzam, R.

    2009-04-01

    In most mountainous regions, landslides represent a major threat to human life, properties and infrastructures. Nowadays existing landslide monitoring systems are often characterized by high efforts in terms of purchase, installation, maintenance, manpower and material. In addition (or because of this) only small areas or selective points of the endangered zone can be observed by the system. Therefore the improvement of existing and the development of new monitoring and warning systems are of high relevance. The joint project "Sensor based Landslide Early Warning Systems" (SLEWS) deals with the development of a prototypic Alarm- and Early Warning system (EWS) for different types of landslides using low-cost micro-sensors (MEMS) integrated in a wireless sensor network (WSN). Modern so called Ad-Hoc, Multi-Hop wireless sensor networks (WSN) are characterized by a self organizing and self-healing capacity of the system (autonomous systems). The network consists of numerous individual and own energy-supply operating sensor nodes, that can send data packages from their measuring devices (here: MEMS) over other nodes (Multi-Hop) to a collection point (gateway). The gateway provides the interface to central processing and data retrieval units (PC, Laptop or server) outside the network. In order to detect and monitor the different landslide processes (like fall, topple, spreading or sliding) 3D MEMS capacitive sensors made from single silicon crystals and glass were chosen to measure acceleration, tilting and altitude changes. Based on the so called MEMS (Micro-Electro-Mechanical Systems) technology, the sensors combine very small mechanical and electronic units, sensing elements and transducers on a small microchip. The mass production of such type of sensors allows low cost applications in different areas (like automobile industries, medicine, and automation technology). Apart from the small and so space saving size and the low costs another advantage is the energy

  17. Routing Protocols for Next-Generation Networks Inspired by Collective Behaviors of Insect Societies: An Overview

    NASA Astrophysics Data System (ADS)

    Farooq, Muddassar; di Caro, Gianni A.

    In this chapter we discuss the properties and review the main instances of network routing algorithms whose bottom-up design has been inspired by collective behaviors of social insects such as ants and bees. This class of bio-inspired routing algorithms includes a relatively large number of algorithms mostly developed during the last ten years. The characteristics inherited by the biological systems of inspiration almost naturally empower these algorithms with characteristics such as autonomy, self-organization, adaptivity, robustness, and scalability, which are all desirable if not necessary properties to deal with the challenges of current and next-generation networks. In the chapter we consider different classes of wired and wireless networks, and for each class we briefly discuss the characteristics of the main ant- and bee-colony-inspired algorithms which can be found in literature. We point out their distinctive features and discuss their general pros and cons in relationship to the state of the art.

  18. Explicit solutions to analytical models of cross-layer protocol optimization in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2009-05-01

    The work is based on the interactions among the nodes of a wireless sensor network (WSN) to cooperatively process data from multiple sensors. Quality-of-service (QoS) metrics are associated with the quality of fused information: throughput, delay, packet error rate, etc. A multivariate point process (MVPP) model of discrete random events in WSNs establishes stochastic characteristics of optimal cross-layer protocols. In previous work by the author, discreteevent, cross-layer interactions in the MANET protocol are modeled in very general analytical terms with a set of concatenated design parameters and associated resource levels by multivariate point processes (MVPPs). Characterization of the "best" cross-layer designs for the MANET is formulated by applying the general theory of martingale representations to controlled MVPPs. Performance is described in terms of concatenated protocol parameters and controlled through conditional rates of the MVPPs. Assumptions on WSN characteristics simplify the dynamic programming conditions to yield mathematically tractable descriptions for the optimal routing protocols. Modeling limitations on the determination of closed-form solutions versus iterative explicit solutions for ad hoc WSN controls are presented.

  19. Quality-of-service sensitivity to bio-inspired/evolutionary computational methods for intrusion detection in wireless ad hoc multimedia sensor networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2012-06-01

    In the author's previous work, a cross-layer protocol approach to wireless sensor network (WSN) intrusion detection an identification is created with multiple bio-inspired/evolutionary computational methods applied to the functions of the protocol layers, a single method to each layer, to improve the intrusion-detection performance of the protocol over that of one method applied to only a single layer's functions. The WSN cross-layer protocol design embeds GAs, anti-phase synchronization, ACO, and a trust model based on quantized data reputation at the physical, MAC, network, and application layer, respectively. The construct neglects to assess the net effect of the combined bioinspired methods on the quality-of-service (QoS) performance for "normal" data streams, that is, streams without intrusions. Analytic expressions of throughput, delay, and jitter, coupled with simulation results for WSNs free of intrusion attacks, are the basis for sensitivity analyses of QoS metrics for normal traffic to the bio-inspired methods.

  20. VANET Broadcast Protocol Based on Fuzzy Logic and Lightweight Retransmission Mechanism

    NASA Astrophysics Data System (ADS)

    Wu, Celimuge; Ohzahata, Satoshi; Kato, Toshihiko

    Vehicular ad hoc networks have been attracting the interest of both academic and industrial communities on account of their potential role in Intelligent Transportation Systems (ITS). However, due to vehicle movement and fading in wireless communications, providing a reliable and efficient multi-hop broadcast service in vehicular ad hoc networks is still an open research topic. In this paper, we propose FUZZBR (FUZZy BRoadcast), a fuzzy logic based multi-hop broadcast protocol for information dissemination in vehicular ad hoc networks. FUZZBR has low message overhead since it uses only a subset of neighbor nodes to relay data messages. In the relay node selection, FUZZBR jointly considers multiple metrics of inter-vehicle distance, node mobility and signal strength by employing the fuzzy logic. FUZZBR also uses a lightweight retransmission mechanism to retransmit a packet when a relay fails. We use computer simulations to evaluate the performance of FUZZBR.

  1. An Evidence-Based Unified Definition of Lifelong and Acquired Premature Ejaculation: Report of the Second International Society for Sexual Medicine Ad Hoc Committee for the Definition of Premature Ejaculation

    PubMed Central

    Serefoglu, Ege Can; McMahon, Chris G; Waldinger, Marcel D; Althof, Stanley E; Shindel, Alan; Adaikan, Ganesh; Becher, Edgardo F; Dean, John; Giuliano, Francois; Hellstrom, Wayne JG; Giraldi, Annamaria; Glina, Sidney; Incrocci, Luca; Jannini, Emmanuele; McCabe, Marita; Parish, Sharon; Rowland, David; Segraves, R Taylor; Sharlip, Ira; Torres, Luiz Otavio

    2014-01-01

    Introduction The International Society for Sexual Medicine (ISSM) Ad Hoc Committee for the Definition of Premature Ejaculation developed the first evidence-based definition for lifelong premature ejaculation (PE) in 2007 and concluded that there were insufficient published objective data at that time to develop a definition for acquired PE. Aim The aim of this article is to review and critique the current literature and develop a contemporary, evidence-based definition for acquired PE and/or a unified definition for both lifelong and acquired PE. Methods In April 2013, the ISSM convened a second Ad Hoc Committee for the Definition of Premature Ejaculation in Bangalore, India. The same evidence-based systematic approach to literature search, retrieval, and evaluation used by the original committee was adopted. Results The committee unanimously agreed that men with lifelong and acquired PE appear to share the dimensions of short ejaculatory latency, reduced or absent perceived ejaculatory control, and the presence of negative personal consequences. Men with acquired PE are older, have higher incidences of erectile dysfunction, comorbid disease, and cardiovascular risk factors, and have a longer intravaginal ejaculation latency time (IELT) as compared with men with lifelong PE. A self-estimated or stopwatch IELT of 3 minutes was identified as a valid IELT cut-off for diagnosing acquired PE. On this basis, the committee agreed on a unified definition of both acquired and lifelong PE as a male sexual dysfunction characterized by (i) ejaculation that always or nearly always occurs prior to or within about 1 minute of vaginal penetration from the first sexual experience (lifelong PE) or a clinically significant and bothersome reduction in latency time, often to about 3 minutes or less (acquired PE); (ii) the inability to delay ejaculation on all or nearly all vaginal penetrations; and (iii) negative personal consequences, such as distress, bother, frustration, and/or the

  2. Enhanced Protein-Energy Provision via the Enteral Route in Critically Ill Patients (PEP uP Protocol): A Review of Evidence.

    PubMed

    Lee, Zheng Yii; Barakatun-Nisak, Mohd Yusof; Noor Airini, Ibrahim; Heyland, Daren K

    2016-02-01

    Nutrition support is an integral part of care among critically ill patients. However, critically ill patients are commonly underfed, leading to consequences such as increased length of hospital and intensive care unit stay, time on mechanical ventilation, infectious complications, and mortality. Nevertheless, the prevalence of underfeeding has not resolved since the first description of this problem more than 15 years ago. This may be due to the traditional conservative feeding approaches. A novel feeding protocol (the Enhanced Protein-Energy Provision via the Enteral Route Feeding Protocol in Critically Ill Patients [PEP uP] protocol) was proposed and proven to improve feeding adequacy significantly. However, some of the components in the protocol are controversial and subject to debate. This article is a review of the supporting evidences and some of the controversy associated with each component of the PEP uP protocol. PMID:26385874

  3. Space-Data Routers: Advanced data routing protocols for enhancing data exploitation for space weather applications

    NASA Astrophysics Data System (ADS)

    Anastasiadis, Anastasios; Daglis, Ioannis A.; Balasis, George; Papadimitriou, Constantinos; Tsaoussidis, Vassilios; Diamantopoulos, Sotirios

    2014-05-01

    Data sharing and access are major issues in space sciences, as they influence the degree of data exploitation. The availability of multi-spacecraft distributed observation methods and adaptive mission architectures require computationally intensive analysis methods. Moreover, accurate space weather forecasting and future space exploration far from Earth will be in need of real-time data distribution and assimilation technologies. The FP7-Space collaborative research project "Space-Data Routers" (SDR) relies on space internetworking and in particular on Delay Tolerant Networking (DTN), which marks the new era in space communications. SDR unifies space and earth communication infrastructures and delivers a set of tools and protocols for space-data exploitation. The main goal is to allow space agencies, academic institutes and research centers to share space-data generated by single or multiple missions, in an efficient, secure and automated manner. Here we are presenting the architecture and basic functionality of a DTN-based application specifically designed in the framework of the SDR project, for data query, retrieval and administration that will enable addressing outstanding science questions related to space weather, through the provision of simultaneous real-time data sampling at multiple points in space. The work leading to this paper has received funding from the European Union's Seventh Framework Programme (FP7-SPACE-2010-1) under grant agreement no. 263330 for the SDR (Space-Data Routers for Exploiting Space Data) collaborative research project. This paper reflects only the authors' views and the Union is not liable for any use that may be made of the information contained therein.

  4. A Comparative experimental study of media access protocols for wireless radio networks

    SciTech Connect

    Barrett, C. L.; Drozda, M.; Marathe, M. V.

    2001-05-24

    We conduct a comparative experimental analysis of three well known media access protocols: 802.11, CSMA, and MACA for wireless radio networks. Both fixed and ad-hoc networks are considered. The experimental analysis was carried out using GloMoSim: a tool for simulating wireless networks. The main focus of experiments was to study how (i) the size of the network, (ii) number of open connections, (iii) the spatial location of individual connections, (iv) speed with which individual nodes move and (v) protocols higher up in the protocol stack (e,g. routing layer) affect the performance of the media access sublayer protocols. The performance of the protocols was measured w.r.t. three important parameters: (1) number of received packets, (2) average latency of each packet, and (3) throughput. The following general qualitative conclusions were obtained; some of the conclusions reinforce the earlier claims by other researchers. (1) Although 802.11 performs better than the other two protocols with respect to fairness of transmission, packets dropped, and latency, its performance is found to (i) show a lot of variance with changing input parameters and (ii) the overall performance still leaves a lot of room for improvement. (2) CSMA does not perform too well under the fairness criteria, however, was the best in terms of the latency criteria. (3) MACA also shows fairness problems and has poor performance at high packet injection rates. (4) Protocols in the higher level of the protocol stack affect the MAC layer performance. The main general implications of our work is two folds: (1) No single protocol dominated the other protocols across various measures of efficiency. This motivates the design of a new class of parameterized protocols that adapt to changes in the network connectivity and loads. We refer to these class of protocols as parameterized dynamically adaptive efficient protocols and as a first step suggest key design requirements for such a class of protocols. (2

  5. Hearings before the Ad Hoc Committee on Maritime Education and Training of the Committee on Merchant Marine and Fisheries, Ninety-Third Congress; Second Session on Officer Requirements, and Session on Maritime Education Regarding Safety at Sea. Serial No. 93-44.

    ERIC Educational Resources Information Center

    Congress of the U.S., Washington, DC. House Committee on Merchant Marine and Fisheries.

    The publication consists of Congressional hearings before the Ad Hoc Committee on Maritime Education and Training: (1) June 26, 1974 hearing pertaining to officer requirements and (2) November 19, 1974 hearing on maritime education regarding safety at sea. Estimated cost per graduate for the U. S. Merchant Marine 1973 class was $31,100. Supply and…

  6. Sea Training at Maritime Academies Oversight. Hearings Before the Ad Hoc Select Subcommittee on Maritime Education and Training of the Committee on Merchant Marine and Fisheries, House of Representatives, Ninety-Sixth Congress, Second Session on Sea Training of United States Merchant Marine Officers and Different Ways of Satisfying This Requirement at the Various Maritime Academies.

    ERIC Educational Resources Information Center

    Congress of the U.S., Washington, DC. House Committee on Merchant Marine and Fisheries.

    Recorded are minutes of hearings before the House Ad Hoc Select Subcommittee on Maritime Education and Training regarding the sea training of United States Merchant Marine officers. Examined are various approaches to meeting the sea training requirement, especially the options of maritime academy training vessels, sailing on U.S.-flag merchant…

  7. Effective Protocols for Mobile Communications and Networking

    SciTech Connect

    Espinoza, J.; Sholander, P.; Van Leeuwen, B,

    1998-12-01

    This report examines methods of mobile communications with an emphasis on mobile computing and wireless communications. Many of the advances in communications involve the use of Internet Protocol (IP), Asynchronous Transfer Mode (ATM), and ad hoc network protocols. However, many of the advances in these protocols have been focused on wired communications. Recently much focus has been directed at advancing communication technology in the area of mobile wireless networks. This report discusses various protocols used in mobile communications and proposes a number of extensions to existing protocols. A detailed discussion is also included on desirable protocol characteristics and evaluation criteria. In addition, the report includes a discussion on several network simulation tools that maybe used to evaluate network protocols.

  8. The Traffic Adaptive Data Dissemination (TrAD) Protocol for both Urban and Highway Scenarios.

    PubMed

    Tian, Bin; Hou, Kun Mean; Zhou, Haiying

    2016-01-01

    The worldwide economic cost of road crashes and injuries is estimated to be US$518 billion per year and the annual congestion cost in France is estimated to be €5.9 billion. Vehicular Ad hoc Networks (VANETs) are one solution to improve transport features such as traffic safety, traffic jam and infotainment on wheels, where a great number of event-driven messages need to be disseminated in a timely way in a region of interest. In comparison with traditional wireless networks, VANETs have to consider the highly dynamic network topology and lossy links due to node mobility. Inter-Vehicle Communication (IVC) protocols are the keystone of VANETs. According to our survey, most of the proposed IVC protocols focus on either highway or urban scenarios, but not on both. Furthermore, too few protocols, considering both scenarios, can achieve high performance. In this paper, an infrastructure-less Traffic Adaptive data Dissemination (TrAD) protocol which takes into account road traffic and network traffic status for both highway and urban scenarios will be presented. TrAD has double broadcast suppression techniques and is designed to adapt efficiently to the irregular road topology. The performance of the TrAD protocol was evaluated quantitatively by means of realistic simulations taking into account different real road maps, traffic routes and vehicular densities. The obtained simulation results show that TrAD is more efficient in terms of packet delivery ratio, number of transmissions and delay in comparison with the performance of three well-known reference protocols. Moreover, TrAD can also tolerate a reasonable degree of GPS drift and still achieve efficient data dissemination. PMID:27338393

  9. The Traffic Adaptive Data Dissemination (TrAD) Protocol for both Urban and Highway Scenarios

    PubMed Central

    Tian, Bin; Hou, Kun Mean; Zhou, Haiying

    2016-01-01

    The worldwide economic cost of road crashes and injuries is estimated to be US$518 billion per year and the annual congestion cost in France is estimated to be €5.9 billion. Vehicular Ad hoc Networks (VANETs) are one solution to improve transport features such as traffic safety, traffic jam and infotainment on wheels, where a great number of event-driven messages need to be disseminated in a timely way in a region of interest. In comparison with traditional wireless networks, VANETs have to consider the highly dynamic network topology and lossy links due to node mobility. Inter-Vehicle Communication (IVC) protocols are the keystone of VANETs. According to our survey, most of the proposed IVC protocols focus on either highway or urban scenarios, but not on both. Furthermore, too few protocols, considering both scenarios, can achieve high performance. In this paper, an infrastructure-less Traffic Adaptive data Dissemination (TrAD) protocol which takes into account road traffic and network traffic status for both highway and urban scenarios will be presented. TrAD has double broadcast suppression techniques and is designed to adapt efficiently to the irregular road topology. The performance of the TrAD protocol was evaluated quantitatively by means of realistic simulations taking into account different real road maps, traffic routes and vehicular densities. The obtained simulation results show that TrAD is more efficient in terms of packet delivery ratio, number of transmissions and delay in comparison with the performance of three well-known reference protocols. Moreover, TrAD can also tolerate a reasonable degree of GPS drift and still achieve efficient data dissemination. PMID:27338393

  10. Spaceborne Mobile Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    Forcada, Ignasi; Strauss, Adi

    2010-08-01

    Reliable global networking is essential for a rapidly growing mobile and interactive communication. Satellite communication plays already a significant role in this subject. However, the classical space-based data transmission requires an appropriate infrastructure, both on the ground and in orbit. This paper discusses the potential of a self-organising distributed satellite system in Low Earth Orbits (LEO) to achieve a seamless integration in already existing infrastructures. The communication approach is based on dynamic Inter Satellite Links (ISL) not controlled nor coordinated on an individual basis from the ground-based stations.

  11. Ad-Hoc Implicature in Preschool Children

    ERIC Educational Resources Information Center

    Stiller, Alex J.; Goodman, Noah D.; Frank, Michael C.

    2015-01-01

    If a speaker tells us that "some guests were late to the party," we typically infer that not all were. Implicatures, in which an ambiguous statement ("some and possibly all") is strengthened pragmatically (to "some and not all"), are a paradigm case of pragmatic reasoning. Inferences of this sort are difficult for…

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

    PubMed

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

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

    PubMed Central

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

  14. A novel end-to-end fault detection and localization protocol for wavelength-routed WDM networks

    NASA Astrophysics Data System (ADS)

    Zeng, Hongqing; Vukovic, Alex; Huang, Changcheng

    2005-09-01

    Recently the wavelength division multiplexing (WDM) networks are becoming prevalent for telecommunication networks. However, even a very short disruption of service caused by network faults may lead to high data loss in such networks due to the high date rates, increased wavelength numbers and density. Therefore, the network survivability is critical and has been intensively studied, where fault detection and localization is the vital part but has received disproportional attentions. In this paper we describe and analyze an end-to-end lightpath fault detection scheme in data plane with the fault notification in control plane. The endeavor is focused on reducing the fault detection time. In this protocol, the source node of each lightpath keeps sending hello packets to the destination node exactly following the path for data traffic. The destination node generates an alarm once a certain number of consecutive hello packets are missed within a given time period. Then the network management unit collects all alarms and locates the faulty source based on the network topology, as well as sends fault notification messages via control plane to either the source node or all upstream nodes along the lightpath. The performance evaluation shows such a protocol can achieve fast fault detection, and at the same time, the overhead brought to the user data by hello packets is negligible.

  15. Nutritional route in oesophageal resection trial II (NUTRIENT II): study protocol for a multicentre open-label randomised controlled trial

    PubMed Central

    Berkelmans, Gijs H K; Wilts, Bas J W; Kouwenhoven, Ewout A; Kumagai, Koshi; Nilsson, Magnus; Weijs, Teus J; Nieuwenhuijzen, Grard A P; van Det, Marc J; Luyer, Misha D P

    2016-01-01

    Introduction Early start of an oral diet is safe and beneficial in most types of gastrointestinal surgery and is a crucial part of fast track or enhanced recovery protocols. However, the feasibility and safety of oral intake directly following oesophagectomy remain unclear. The aim of this study is to investigate the effects of early versus delayed start of oral intake on postoperative recovery following oesophagectomy. Methods and analysis This is an open-label multicentre randomised controlled trial. Patients undergoing elective minimally invasive or hybrid oesophagectomy for cancer are eligible. Further inclusion criteria are intrathoracic anastomosis, written informed consent and age 18 years or older. Inability for oral intake, inability to place a feeding jejunostomy, inability to provide written consent, swallowing disorder, achalasia, Karnofsky Performance Status <80 and malnutrition are exclusion criteria. Patients will be randomised using online randomisation software. The intervention group (direct oral feeding) will receive a liquid oral diet for 2 weeks with gradually expanding daily maximums. The control group (delayed oral feeding) will receive enteral feeding via a jejunostomy during 5 days and then start the same liquid oral diet. The primary outcome measure is functional recovery. Secondary outcome measures are 30-day surgical complications; nutritional status; need for artificial nutrition; need for additional interventions; health-related quality of life. We aim to recruit 148 patients. Statistical analysis will be performed according to an intention to treat principle. Results are presented as risk ratios with corresponding 95% CIs. A two-tailed p<0.05 is considered statistically significant. Ethics and dissemination Our study protocol has received ethical approval from the Medical research Ethics Committees United (MEC-U). This study is conducted according to the principles of Good Clinical Practice. Verbal and written informed consent is

  16. Analytical approach to cross-layer protocol optimization in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2008-04-01

    In the distributed operations of route discovery and maintenance, strong interaction occurs across mobile ad hoc network (MANET) protocol layers. Quality of service (QoS) requirements of multimedia service classes must be satisfied by the cross-layer protocol, along with minimization of the distributed power consumption at nodes and along routes to battery-limited energy constraints. In previous work by the author, cross-layer interactions in the MANET protocol are modeled in terms of a set of concatenated design parameters and associated resource levels by multivariate point processes (MVPPs). Determination of the "best" cross-layer design is carried out using the optimal control of martingale representations of the MVPPs. In contrast to the competitive interaction among nodes in a MANET for multimedia services using limited resources, the interaction among the nodes of a wireless sensor network (WSN) is distributed and collaborative, based on the processing of data from a variety of sensors at nodes to satisfy common mission objectives. Sensor data originates at the nodes at the periphery of the WSN, is successively transported to other nodes for aggregation based on information-theoretic measures of correlation and ultimately sent as information to one or more destination (decision) nodes. The "multimedia services" in the MANET model are replaced by multiple types of sensors, e.g., audio, seismic, imaging, thermal, etc., at the nodes; the QoS metrics associated with MANETs become those associated with the quality of fused information flow, i.e., throughput, delay, packet error rate, data correlation, etc. Significantly, the essential analytical approach to MANET cross-layer optimization, now based on the MVPPs for discrete random events occurring in the WSN, can be applied to develop the stochastic characteristics and optimality conditions for cross-layer designs of sensor network protocols. Functional dependencies of WSN performance metrics are described in

  17. Self-Organized Link State Aware Routing for Multiple Mobile Agents in Wireless Network

    NASA Astrophysics Data System (ADS)

    Oda, Akihiro; Nishi, Hiroaki

    Recently, the importance of data sharing structures in autonomous distributed networks has been increasing. A wireless sensor network is used for managing distributed data. This type of distributed network requires effective information exchanging methods for data sharing. To reduce the traffic of broadcasted messages, reduction of the amount of redundant information is indispensable. In order to reduce packet loss in mobile ad-hoc networks, QoS-sensitive routing algorithm have been frequently discussed. The topology of a wireless network is likely to change frequently according to the movement of mobile nodes, radio disturbance, or fading due to the continuous changes in the environment. Therefore, a packet routing algorithm should guarantee QoS by using some quality indicators of the wireless network. In this paper, a novel information exchanging algorithm developed using a hash function and a Boolean operation is proposed. This algorithm achieves efficient information exchanges by reducing the overhead of broadcasting messages, and it can guarantee QoS in a wireless network environment. It can be applied to a routing algorithm in a mobile ad-hoc network. In the proposed routing algorithm, a routing table is constructed by using the received signal strength indicator (RSSI), and the neighborhood information is periodically broadcasted depending on this table. The proposed hash-based routing entry management by using an extended MAC address can eliminate the overhead of message flooding. An analysis of the collision of hash values contributes to the determination of the length of the hash values, which is minimally required. Based on the verification of a mathematical theory, an optimum hash function for determining the length of hash values can be given. Simulations are carried out to evaluate the effectiveness of the proposed algorithm and to validate the theory in a general wireless network routing algorithm.

  18. Making MANET secured against malicious attack

    NASA Astrophysics Data System (ADS)

    Kush, Ashwani; Taneja, Sunil; Kush, Shagun

    2011-12-01

    A Mobile Adhoc Network (MANET) is characterized by mobile nodes, multihop wireless connectivity, infrastructureless environment and dynamic topology. A recent trend in Ad Hoc network routing is the reactive ondemand philosophy where routes are established only when required. Stable Routing is of major concern in Ad hoc routing. Security and Power efficiency are the major concerns in this field. This paper is an effort to use security to achieve more reliable routing. The ad hoc environment is accessible to both legitimate network users and malicious attackers. The proposed scheme is intended to incorporate security aspect on existing protocols. The study will help in making protocol more robust against attacks to achieve stable routing in routing protocols.

  19. Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

    NASA Technical Reports Server (NTRS)

    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

  20. Concise review: no breakthroughs for human mesenchymal and embryonic stem cell culture: conditioned medium, feeder layer, or feeder-free; medium with fetal calf serum, human serum, or enriched plasma; serum-free, serum replacement nonconditioned medium, or ad hoc formula? All that glitters is not gold!

    PubMed

    Mannello, Ferdinando; Tonti, Gaetana A

    2007-07-01

    The choice of an optimal strategy of stem cell culture is at the moment an impossible task, and the elaboration of a culture medium adapted to the production of embryonic and adult mesenchymal stem cells for the clinical application of cell therapy remains a crucial matter. To make an informed choice, it is crucial to not underestimate the theoretical health risk of using xenogenic compounds, to limit the immunological reactions once stem cells are transplanted, to not overestimate the controversial results obtained with human serum, plasma, and blood derivatives, as well as to carefully examine the pros and cons of serum-free and ad hoc formulation strategies; besides that, to also maintain multipotentiality, self-renewal, and transplantability. The extent to which we are able to achieve effective cell therapies will depend on assimilating a rapidly developing base of scientific knowledge with the practical considerations of design, delivery, and host response. Although clinical studies have already started, many questions remain unsolved, and concomitantly even more evidence on suitable and safe off-the-shelf products (mainly xeno-free) for embryonic and mesenchymal stem cells is cropping up, even though there should be no rush to enter the clinical stage while the underlying basic research is still not so solid; this solely will lead to high-quality translational research, without making blunders stemming from the assumption that all that glitters is not gold. Disclosure of potential conflicts of interest is found at the end of this article. PMID:17395775

  1. Vehicle Density Based Forwarding Protocol for Safety Message Broadcast in VANET

    PubMed Central

    Huang, Jiawei; Wang, Jianxin

    2014-01-01

    In vehicular ad hoc networks (VANETs), the medium access control (MAC) protocol is of great importance to provide time-critical safety applications. Contemporary multihop broadcast protocols in VANETs usually choose the farthest node in broadcast range as the forwarder to reduce the number of forwarding hops. However, in this paper, we demonstrate that the farthest forwarder may experience large contention delay in case of high vehicle density. We propose an IEEE 802.11-based multihop broadcast protocol VDF to address the issue of emergency message dissemination. To achieve the tradeoff between contention delay and forwarding hops, VDF adaptably chooses the forwarder according to the vehicle density. Simulation results show that, due to its ability to decrease the transmission collisions, the proposed protocol can provide significantly lower broadcast delay. PMID:25121125

  2. Vehicle density based forwarding protocol for safety message broadcast in VANET.

    PubMed

    Huang, Jiawei; Huang, Yi; Wang, Jianxin

    2014-01-01

    In vehicular ad hoc networks (VANETs), the medium access control (MAC) protocol is of great importance to provide time-critical safety applications. Contemporary multihop broadcast protocols in VANETs usually choose the farthest node in broadcast range as the forwarder to reduce the number of forwarding hops. However, in this paper, we demonstrate that the farthest forwarder may experience large contention delay in case of high vehicle density. We propose an IEEE 802.11-based multihop broadcast protocol VDF to address the issue of emergency message dissemination. To achieve the tradeoff between contention delay and forwarding hops, VDF adaptably chooses the forwarder according to the vehicle density. Simulation results show that, due to its ability to decrease the transmission collisions, the proposed protocol can provide significantly lower broadcast delay. PMID:25121125

  3. Report of the AD HOC Committee on Patent Documentation.

    ERIC Educational Resources Information Center

    Urbach, Peter; And Others

    The Committee was established in September 1967 to study and make recommendations on Recommendation XXIX and XXX of the Report of the President's Commission on the Patent System. Based on interviews with Patent Office officials, patent examiners and classifiers and a review of Patent Office studies and documents, the Committee concluded that the…

  4. Ad Hoc Physical Hilbert Spaces in Quantum Mechanics

    NASA Astrophysics Data System (ADS)

    Fernández, Francisco M.; Garcia, Javier; Semorádová, Iveta; Znojil, Miloslav

    2015-12-01

    The overall principles of what is now widely known as PT-symmetric quantum mechanics are listed, explained and illustrated via a few examples. In particular, models based on an elementary local interaction V(x) are discussed as motivated by the naturally emergent possibility of an efficient regularization of an otherwise unacceptable presence of a strongly singular repulsive core in the origin. The emphasis is put on the constructive aspects of the models. Besides the overall outline of the formalism we show how the low-lying energies of bound states may be found in closed form in certain dynamical regimes. Finally, once these energies are found real we explain that in spite of a manifest non-Hermiticity of the Hamiltonian the time-evolution of the system becomes unitary in a properly amended physical Hilbert space.

  5. Sensor Sharing in Mobile Ad-Hoc Networks

    ERIC Educational Resources Information Center

    Mitra, Pramita

    2013-01-01

    Today's modern mobile devices (such as smartphones and tablets) present great potential for growth of many novel, powerful, but also highly demanding applications. However, most mobile devices/users operate in isolation from one another, i.e., they are not aware of the presence of other devices in their proximity. There are numerous situations…

  6. Applying Ad Hoc Institutional Research Findings to College Strategic Planning

    ERIC Educational Resources Information Center

    Clagett, Craig A.

    2004-01-01

    Environmental scanning, enrollment forecasting, budget analyses, and institutional effectiveness assessment are examples of the explicit contributions institutional research offices make to campus strategic planning.

  7. Demand on Temporary Parallel Route Recovery for Frequent Link Failure in VANET

    NASA Astrophysics Data System (ADS)

    Sakthi Ganesh, M.; Venkata krishna, P.

    2015-03-01

    Vehicular Ad-hoc Network (VANET) is an upcoming technology for communication between vehicles during the trip, which provides Internet connectivity resulting in safer roads giving access important alerts and comfort during the slip. VANET technology integrates wireless cellular and ad hoc for seamless connectivity between vehicles. VANETs are organizations that allow vehicles to communicate with each other. Wireless-vice can send data to nearby vehicles, and messages can be transported from one vehicle to another, so that the information can be broadcast throughout the metropolis. In the network, link failure is very common due to the high mobility of clients. Frequent link failure occurs as packets do not arrive at the respective goals. The mechanism proposed here establishes a form of route discovery packet parallel to the real time application to be extradited to the destination, while minimizing losses. The primary aim is to establish parallel paths during link failure scenarios for real-time applications to provide information to their destination safely. During link failures, the recovery road is parallel to the fixed temporary parallel path between the nodes. The node before the link failure packet buffers, after setting the new parallel paths before the packets stored in the buffer via the destination newly created path.

  8. Implementation of secure AODV in MANET

    NASA Astrophysics Data System (ADS)

    Akhtar, Rizwan; Amin, Noor U.; Memon, Imran; Shah, Mohsin

    2013-03-01

    Mobile Ad hoc Networks (MANETs) comprised of autonomous and self-organizing mobile computing devices which do not have a fixed infrastructure but rather they use ad-hoc routing protocols for data transmission and reception. Ad hoc on demand distance vector (AODV) is an IP reactive routing protocol which is optimized for MANETs and it can also be used for other wireless ad-hoc networks. Nodes in network cannot perform route discovery or maintenance functions itself. This problem is resolved by using AODV as it computes the routing distance from sending node to receiving node at preset intervals. This research paper proposed Secure Routing Protocol (SRP) AODV for MANETs and its implementation. Performance of proposed SRP is compared to ordinary AODV. The simulation results reveal that proposed SRP is more efficient and secure than ordinary AODV. SRP AODV can be used for further research towards development of a commercial demand for the MANET routing protocol using Blowfish cryptosystem for encryption and decryption for secure routing in a given mobile ad hoc network.

  9. Scalability enhancement of AODV using local link repairing

    NASA Astrophysics Data System (ADS)

    Jain, Jyoti; Gupta, Roopam; Bandhopadhyay, T. K.

    2014-09-01

    Dynamic change in the topology of an ad hoc network makes it difficult to design an efficient routing protocol. Scalability of an ad hoc network is also one of the important criteria of research in this field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for limited-size networks. Ad hoc on-demand distance vector (AODV) is one of the best reactive routing protocols. In this article, modified routing protocols based on local link repairing of AODV are proposed. Method of finding alternate routes for next-to-next node is proposed in case of link failure. These protocols are beacon-less, means periodic hello message is removed from the basic AODV to improve scalability. Few control packet formats have been changed to accommodate suggested modification. Proposed protocols are simulated to investigate scalability performance and compared with basic AODV protocol. This also proves that local link repairing of proposed protocol improves scalability of the network. From simulation results, it is clear that scalability performance of routing protocol is improved because of link repairing method. We have tested protocols for different terrain area with approximate constant node densities and different traffic load.

  10. Contact Graph Routing

    NASA Technical Reports Server (NTRS)

    Burleigh, Scott C.

    2011-01-01

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

  11. Assessing Routing Strategies for Cognitive Radio Sensor Networks

    PubMed Central

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

    2013-01-01

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

  12. Assessing routing strategies for cognitive radio sensor networks.

    PubMed

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

    2013-01-01

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

  13. Satellite Communications Using Commercial Protocols

    NASA Technical Reports Server (NTRS)

    Ivancic, William D.; Griner, James H.; Dimond, Robert; Frantz, Brian D.; Kachmar, Brian; Shell, Dan

    2000-01-01

    NASA Glenn Research Center has been working with industry, academia, and other government agencies in assessing commercial communications protocols for satellite and space-based applications. In addition, NASA Glenn has been developing and advocating new satellite-friendly modifications to existing communications protocol standards. This paper summarizes recent research into the applicability of various commercial standard protocols for use over satellite and space- based communications networks as well as expectations for future protocol development. It serves as a reference point from which the detailed work can be readily accessed. Areas that will be addressed include asynchronous-transfer-mode quality of service; completed and ongoing work of the Internet Engineering Task Force; data-link-layer protocol development for unidirectional link routing; and protocols for aeronautical applications, including mobile Internet protocol routing for wireless/mobile hosts and the aeronautical telecommunications network protocol.

  14. "Recalculating Route".

    PubMed

    Baum, Neil

    2015-01-01

    Can you imagine going to a doctor who uses a paper chart, sends you a bill on a ledger card, and handwrites a prescription? You wouldn't have a great deal of confidence that the clinical skills of the doctor were up to date. This would be an example of a doctor who did not "recalculate his or her route." This article provides 10 examples of adjustments that have been made in medicine where the route has been recalculated. PMID:26399043

  15. Efficient data communication protocols for wireless networks

    NASA Astrophysics Data System (ADS)

    Zeydan, Engin

    In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to

  16. Quality of Service Routing in Manet Using a Hybrid Intelligent Algorithm Inspired by Cuckoo Search

    PubMed Central

    Rajalakshmi, S.; Maguteeswaran, R.

    2015-01-01

    A hybrid computational intelligent algorithm is proposed by integrating the salient features of two different heuristic techniques to solve a multiconstrained Quality of Service Routing (QoSR) problem in Mobile Ad Hoc Networks (MANETs) is presented. The QoSR is always a tricky problem to determine an optimum route that satisfies variety of necessary constraints in a MANET. The problem is also declared as NP-hard due to the nature of constant topology variation of the MANETs. Thus a solution technique that embarks upon the challenges of the QoSR problem is needed to be underpinned. This paper proposes a hybrid algorithm by modifying the Cuckoo Search Algorithm (CSA) with the new position updating mechanism. This updating mechanism is derived from the differential evolution (DE) algorithm, where the candidates learn from diversified search regions. Thus the CSA will act as the main search procedure guided by the updating mechanism derived from DE, called tuned CSA (TCSA). Numerical simulations on MANETs are performed to demonstrate the effectiveness of the proposed TCSA method by determining an optimum route that satisfies various Quality of Service (QoS) constraints. The results are compared with some of the existing techniques in the literature; therefore the superiority of the proposed method is established. PMID:26495429

  17. Quality of Service Routing in Manet Using a Hybrid Intelligent Algorithm Inspired by Cuckoo Search.

    PubMed

    Rajalakshmi, S; Maguteeswaran, R

    2015-01-01

    A hybrid computational intelligent algorithm is proposed by integrating the salient features of two different heuristic techniques to solve a multiconstrained Quality of Service Routing (QoSR) problem in Mobile Ad Hoc Networks (MANETs) is presented. The QoSR is always a tricky problem to determine an optimum route that satisfies variety of necessary constraints in a MANET. The problem is also declared as NP-hard due to the nature of constant topology variation of the MANETs. Thus a solution technique that embarks upon the challenges of the QoSR problem is needed to be underpinned. This paper proposes a hybrid algorithm by modifying the Cuckoo Search Algorithm (CSA) with the new position updating mechanism. This updating mechanism is derived from the differential evolution (DE) algorithm, where the candidates learn from diversified search regions. Thus the CSA will act as the main search procedure guided by the updating mechanism derived from DE, called tuned CSA (TCSA). Numerical simulations on MANETs are performed to demonstrate the effectiveness of the proposed TCSA method by determining an optimum route that satisfies various Quality of Service (QoS) constraints. The results are compared with some of the existing techniques in the literature; therefore the superiority of the proposed method is established. PMID:26495429

  18. A Context-Aware Paradigm for Information Discovery and Dissemination in Mobile Environments

    ERIC Educational Resources Information Center

    Lundquist, Doug

    2011-01-01

    The increasing power and ubiquity of mobile wireless devices is enabling real-time information delivery for many diverse applications. A crucial question is how to allocate finite network resources efficiently and fairly despite the uncertainty common in highly dynamic mobile ad hoc networks. We propose a set of routing protocols, Self-Balancing…

  19. NIST cooperative laboratory for OSI routing technology

    SciTech Connect

    Montgomery, D.

    1994-05-23

    This document is one of two reports on the Integrated ISIS protocol. Required by the IAB/IESG in order for an Internet routing protocol to advance to Draft Standard Status. Integrated ISIS is an Interior Gateway Protocol and is designed to carry both IP and ISO CLNP routing information. Integrated ISIS is currently designated as a Proposed Standard. The protocol was first published in RFC 1195. Internet Draft was published subsequently to RFC 1195 and documents the current version of the protocol. This report documents experience with Integrated ISIS. This includes reports on interoperability testing, field experience and the current state of Integrated ISIS implementations. It also presents a summary of the Integrated ISIS Management Information Base (MIB), and a summary of the Integrated ISIS authentication mechanism.

  20. Improved ZigBee Network Routing Algorithm Based on LEACH

    NASA Astrophysics Data System (ADS)

    Zhao, Yawei; Zhang, Guohua; Xia, Zhongwu; Li, Xinhua

    Energy efficiency design of routing protocol is a kind of the key technologies used to wireless sensor networks. The paper introduces the ZigBee technology, summarizes the current transmitting routing model in wireless sensor networks, and finds that the traditional LEACH protocol can lead to overload of some cluster head nodes. The paper suggested that the existing LEACH agreement was improved and the new algorithm was better than traditional LEACH routing algorithm by the comprasion of simulation. The improved routing algorithm can prolong the networks lifetime and effectively save the scarce energy.

  1. Comparison of the benefits of cochlear implantation versus contra-lateral routing of signal hearing aids in adult patients with single-sided deafness: study protocol for a prospective within-subject longitudinal trial

    PubMed Central

    2014-01-01

    Background Individuals with a unilateral severe-to-profound hearing loss, or single-sided deafness, report difficulty with listening in many everyday situations despite having access to well-preserved acoustic hearing in one ear. The standard of care for single-sided deafness available on the UK National Health Service is a contra-lateral routing of signals hearing aid which transfers sounds from the impaired ear to the non-impaired ear. This hearing aid has been found to improve speech understanding in noise when the signal-to-noise ratio is more favourable at the impaired ear than the non-impaired ear. However, the indiscriminate routing of signals to a single ear can have detrimental effects when interfering sounds are located on the side of the impaired ear. Recent published evidence has suggested that cochlear implantation in individuals with a single-sided deafness can restore access to the binaural cues which underpin the ability to localise sounds and segregate speech from other interfering sounds. Methods/Design The current trial was designed to assess the efficacy of cochlear implantation compared to a contra-lateral routing of signals hearing aid in restoring binaural hearing in adults with acquired single-sided deafness. Patients are assessed at baseline and after receiving a contra-lateral routing of signals hearing aid. A cochlear implant is then provided to those patients who do not receive sufficient benefit from the hearing aid. This within-subject longitudinal design reflects the expected care pathway should cochlear implantation be provided for single-sided deafness on the UK National Health Service. The primary endpoints are measures of binaural hearing at baseline, after provision of a contra-lateral routing of signals hearing aid, and after cochlear implantation. Binaural hearing is assessed in terms of the accuracy with which sounds are localised and speech is perceived in background noise. The trial is also designed to measure the impact of

  2. An Energy Aware Ant Colony Algorithm for the Routing of Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Cheng, Deqiang; Xun, Yangyang; Zhou, Ting; Li, Wenjie

    Based on the characteristics of routing protocol for wireless sensor networks, an energy aware ant colony algorithm (EAACA) for the routing of wireless sensor networks is proposed in this paper. When EAACA routing protocol chooses the next neighbor node, not only the distance of sink node, but also the residual energy of the next node and the path of the average energy are taken into account. Theoretical analysis and simulation results show that compared with the traditional ACA algorithm for the routing of wireless sensor network, EAACA routing protocol balances the energy consumption of nodes in the network and extends the network lifetime.

  3. Design and Performance Evaluation of a Distributed OFDMA-Based MAC Protocol for MANETs

    PubMed Central

    Chung, Jiyoung; Lee, Hyungyu; Lee, Jung-Ryun

    2014-01-01

    In this paper, we propose a distributed MAC protocol for OFDMA-based wireless mobile ad hoc multihop networks, in which the resource reservation and data transmission procedures are operated in a distributed manner. A frame format is designed considering the characteristics of OFDMA that each node can transmit or receive data to or from multiple nodes simultaneously. Under this frame structure, we propose a distributed resource management method including network state estimation and resource reservation processes. We categorize five types of logical errors according to their root causes and show that two of the logical errors are inevitable while three of them are avoided under the proposed distributed MAC protocol. In addition, we provide a systematic method to determine the advertisement period of each node by presenting a clear relation between the accuracy of estimated network states and the signaling overhead. We evaluate the performance of the proposed protocol in respect of the reservation success rate and the success rate of data transmission. Since our method focuses on avoiding logical errors, it could be easily placed on top of the other resource allocation methods focusing on the physical layer issues of the resource management problem and interworked with them. PMID:25133254

  4. Communications protocol

    NASA Technical Reports Server (NTRS)

    Zhou, Xiaoming (Inventor); Baras, John S. (Inventor)

    2010-01-01

    The present invention relates to an improved communications protocol which increases the efficiency of transmission in return channels on a multi-channel slotted Alohas system by incorporating advanced error correction algorithms, selective retransmission protocols and the use of reserved channels to satisfy the retransmission requests.

  5. A Model of Onion Routing with Provable Anonymity

    NASA Astrophysics Data System (ADS)

    Feigenbaum, Joan; Johnson, Aaron; Syverson, Paul

    Onion routing is a scheme for anonymous communication that is designed for practical use. Until now, however, it has had no formal model and therefore no rigorous analysis of its anonymity guarantees. We give an IO-automata model of an onion-routing protocol and, under possibilistic definitions, characterize the situations in which anonymity and unlinkability are guaranteed.

  6. Optical Circuit Switched Protocol

    NASA Technical Reports Server (NTRS)

    Monacos, Steve P. (Inventor)

    2000-01-01

    The present invention is a system and method embodied in an optical circuit switched protocol for the transmission of data through a network. The optical circuit switched protocol is an all-optical circuit switched network and includes novel optical switching nodes for transmitting optical data packets within a network. Each optical switching node comprises a detector for receiving the header, header detection logic for translating the header into routing information and eliminating the header, and a controller for receiving the routing information and configuring an all optical path within the node. The all optical path located within the node is solely an optical path without having electronic storage of the data and without having optical delay of the data. Since electronic storage of the header is not necessary and the initial header is eliminated by the first detector of the first switching node. multiple identical headers are sent throughout the network so that subsequent switching nodes can receive and read the header for setting up an optical data path.

  7. Tree-based shortest-path routing algorithm

    NASA Astrophysics Data System (ADS)

    Long, Y. H.; Ho, T. K.; Rad, A. B.; Lam, S. P. S.

    1998-12-01

    A tree-based shortest path routing algorithm is introduced in this paper. With this algorithm, every network node can maintain a shortest path routing tree topology of the network with itself as the root. In this algorithm, every node constructs its own routing tree based upon its neighbors' routing trees. Initially, the routing tree at each node has the root only, the node itself. As information exchanges, every node's routing tree will evolve until a complete tree is obtained. This algorithm is a trade-off between distance vector algorithm and link state algorithm. Loops are automatically deleted, so there is no count-to- infinity effect. A simple routing tree information storage approach and a protocol data until format to transmit the tree information are given. Some special issues, such as adaptation to topology change, implementation of the algorithm on LAN, convergence and computation overhead etc., are also discussed in the paper.

  8. ZERO: Probabilistic Routing for Deploy and Forget Wireless Sensor Networks

    PubMed Central

    Vilajosana, Xavier; Llosa, Jordi; Pacho, Jose Carlos; Vilajosana, Ignasi; Juan, Angel A.; Vicario, Jose Lopez; Morell, Antoni

    2010-01-01

    As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols route data through most reliable links aiming to ensure 99% packet delivery. However, they suffer from the so-called ”hot spot” problem. Most reliable routes waste their energy fast, thus partitioning the network and reducing the area monitored. To cope with this ”hot spot” problem we propose ZERO a combined approach at Network and Link layers to increase network lifespan while conserving reliability levels by means of probabilistic load balancing techniques. PMID:22163388

  9. Reliable Multihop Broadcast Protocol with a Low-Overhead Link Quality Assessment for ITS Based on VANETs in Highway Scenarios

    PubMed Central

    Galaviz-Mosqueda, Alejandro; Villarreal-Reyes, Salvador; Galeana-Zapién, Hiram; Rubio-Loyola, Javier; Covarrubias-Rosales, David H.

    2014-01-01

    Vehicular ad hoc networks (VANETs) have been identified as a key technology to enable intelligent transport systems (ITS), which are aimed to radically improve the safety, comfort, and greenness of the vehicles in the road. However, in order to fully exploit VANETs potential, several issues must be addressed. Because of the high dynamic of VANETs and the impairments in the wireless channel, one key issue arising when working with VANETs is the multihop dissemination of broadcast packets for safety and infotainment applications. In this paper a reliable low-overhead multihop broadcast (RLMB) protocol is proposed to address the well-known broadcast storm problem. The proposed RLMB takes advantage of the hello messages exchanged between the vehicles and it processes such information to intelligently select a relay set and reduce the redundant broadcast. Additionally, to reduce the hello messages rate dependency, RLMB uses a point-to-zone link evaluation approach. RLMB performance is compared with one of the leading multihop broadcast protocols existing to date. Performance metrics show that our RLMB solution outperforms the leading protocol in terms of important metrics such as packet dissemination ratio, overhead, and delay. PMID:25133224

  10. Reliable multihop broadcast protocol with a low-overhead link quality assessment for ITS based on VANETs in highway scenarios.

    PubMed

    Galaviz-Mosqueda, Alejandro; Villarreal-Reyes, Salvador; Galeana-Zapién, Hiram; Rubio-Loyola, Javier; Covarrubias-Rosales, David H

    2014-01-01

    Vehicular ad hoc networks (VANETs) have been identified as a key technology to enable intelligent transport systems (ITS), which are aimed to radically improve the safety, comfort, and greenness of the vehicles in the road. However, in order to fully exploit VANETs potential, several issues must be addressed. Because of the high dynamic of VANETs and the impairments in the wireless channel, one key issue arising when working with VANETs is the multihop dissemination of broadcast packets for safety and infotainment applications. In this paper a reliable low-overhead multihop broadcast (RLMB) protocol is proposed to address the well-known broadcast storm problem. The proposed RLMB takes advantage of the hello messages exchanged between the vehicles and it processes such information to intelligently select a relay set and reduce the redundant broadcast. Additionally, to reduce the hello messages rate dependency, RLMB uses a point-to-zone link evaluation approach. RLMB performance is compared with one of the leading multihop broadcast protocols existing to date. Performance metrics show that our RLMB solution outperforms the leading protocol in terms of important metrics such as packet dissemination ratio, overhead, and delay. PMID:25133224

  11. Proceedings of the AD HOC Workshop on Ceramics for Li/FeS{sub 2} batteries

    SciTech Connect

    Not Available

    1993-12-31

    Representatives from industry, the U.S. Advanced Battery Consortium (USABC), DOE, national laboratories, and other govt agencies met to develop recommendations and actions for accelerating the development of ceramic components critical to the successful introduction of the Li/FeS{sub 2} bipolar battery for electric vehicles. Most of the workshop is devoted to electrode materials, bipolar designs, separators, and bipolar plates. The bulk of this document is viewographs and is divided into: ceramics, USABC overview, SAFT`s Li/FeS{sub 2} USABC program, bipolar Li/FeS{sub 2} component development, design requirements for bipolar plates, separator design requirements, compatibility of ceramic insulators with lithium, characterization of MgO for use in separators, resistivity measurements of separators, sintered AlN separators for LiMS batteries, etc.

  12. Ad-hoc model acquisition for combat simulation in urban terrain

    NASA Astrophysics Data System (ADS)

    Bulatov, Dimitri; Solbrig, Peter; Wernerus, Peter

    2012-10-01

    Situation awareness in complex urban environments is an important component for a successful task fulfillment both in military and civil area of applications. In the first area, the fields of deployment of the members of the North Atlantic Alliance have been changed, in the past two decades, from the originally assigned task of acting as national and allied defense forces within the partners' own borders to out-of-area missions under conditions of an asymmetric conflict. Because of its complicated structure, urban terrain represents a particular difficulty of military missions such as patrolling. In the civil field of applications, police and rescue forces are also often strongly dependent on a local visibility and accessibility analysis. However, the process of decision-taking within a short time and under enormous pressure can be extensively trained in an environment that is tailored to the concrete situation. The contribution of this work consists of context-based modeling of urban terrain that can be then integrated into simulation software, for example, Virtual Battlespace 2 (VBS2). The input of our procedure is made up by the airborne sensor data, collected either by an active or a passive sensor. The latter is particularly important if the application is time-critical or the area to be explored is small. After description of our procedure for urban terrain modeling with a detailed focus on the recent innovations, the main steps of model integration into simulation software will be presented and two examples of missions for military and civil applications that can be easily created with VBS2 will be given.

  13. Dynamic spectrum access in wireless ad hoc networks: issues and possible solutions

    NASA Astrophysics Data System (ADS)

    Zhang, Zhensheng; Soni, Tarun

    2010-04-01

    In this paper, we present a brief overview on the recent development of the dynamical spectrum access (DSA) techniques, focusing on the following areas: characteristics of the available bandwidth of the primary users, sensing technologies and sensing intervals to detect white spaces, spectrum allocation and management, reliability of the secondary user, tradeoff between spectrum/performance gain versus additional overhead used in implementing DSA, and cross layer optimization in spectrum sharing. Some of tradeoff studies are presented in terms of price of anarchy, which is defined as the price that a decentralized system should pay for not being coordinated. We will also discuss some of the open issues in deploying DSA.

  14. Informal, Incidental and Ad Hoc: The Information-Seeking and Learning Strategies of Health Care Patients

    ERIC Educational Resources Information Center

    Papen, Uta

    2012-01-01

    When people are ill, they want to know what is happening to them and how they can get better. Current health policies support patients' access to health information and encourage them to take part in decisions regarding their health. But little is known about how patients learn and the difficulties they may encounter in the process. This paper…

  15. Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks.

    PubMed

    Liu, Ming; Xu, Yang; Mohammed, Abdul-Wahid

    2016-01-01

    Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent's limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent's cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent's view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved. PMID:26727504

  16. Report of the "MLA Bibliography" Scope and Overlap Committee, an ACRL Ad Hoc Committee.

    ERIC Educational Resources Information Center

    Association of Coll. and Research Libraries, Chicago, IL.

    The "MLA Bibliography" Scope and Overlap Committee was formed in response to a request from the Modern Language Association for librarians' assistance in examining the coverage and overlap between the "MLA International Bibliography" and other reference tools. This report contains the following 20 papers, prepared by the committee between 1991 and…

  17. Do we need an Ad hoc chemical mechanism for Mexico City's photochemical smog?

    NASA Astrophysics Data System (ADS)

    Ruiz-Suárez, L. G.; Castro, T.; Mar, B.; Ruiz-Santoyo, M. E.; Cruz, X.

    Chemical mechanisms in mathematical models for air quality studies represent the synthesis of about 30 years of research in gas kinetics and atmospheric chemistry, and are able to represent, to a good extent, the chemistry of photochemical smog. However, due to the large amount of computer resources required by these models, different well-known approaches have been used in order to make them operative. In any of these approaches, a set of educated guesses is made, based upon the knowledge of the conditions under which the reactions occur and the competition between them, and upon the expected absolute and relative concentrations of the emitted reactive organic gases (ROG). Are those educated guesses applicable to Mexico City? Do we know enough how the prevalent conditions of temperature, total pressure, ultraviolet irradiation and water content in the atmosphere operate over the chemistry of photochemical smog? An answer to these questions has been attempted by performing variational analysis of selected hydrocarbons. Some results for n-butane, propene and trans-2-butene are shown; they show that under conditions of high reactivity, some assumptions may not be applicable to Mexico City. Also, the results serve to show the applicability of the method to preliminary reactivity studies.

  18. Peak sidelobe level distribution computation for ad hoc arrays using extreme value theory

    NASA Astrophysics Data System (ADS)

    Krishnamurthy, Siddhartha

    An equipment setup for manufacturing nanolaminates with potential applications as protective coatings and in transparent armor was designed and constructed to improve upon an existing system in place at UMass Lowell. The design modification was targeted at maximizing the area of the produced nanolaminates. The new design was successful in that the nanolaminates were approximatively 4.5 times larger in area than the ones produced on the previous design. Nanolaminates consisting of poly(1,4- cyclohexanedimethylene terephthalate-co-2,2,4,4-tetramethyl-1,3-cyclobutylene terephalate) (Tritan TX1000 and TX2000, Eastman Chemical) and dimethylditallowammonium montmorillonite clay nanofiller (Cloisite 20A, Southern Clay Products) were produced using the new setup. Nanolaminates with clay loadings of 0%, 10%, 30%, and 50% by volume were produced as freestanding films in the case of both grades of copolyester, while adherent films were produced at clay loadings of 70% and 90% by volume were in the case of Tritan TX2000. Finally, chemical and mechanical characterization of all freestanding films was attempted in order to develop preliminary structure-properties relations for these novel materials.

  19. Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks

    PubMed Central

    Liu, Ming; Xu, Yang; Mohammed, Abdul-Wahid

    2016-01-01

    Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent’s limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent’s cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent’s view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved. PMID:26727504

  20. Mobility Based Key Management Technique for Multicast Security in Mobile Ad Hoc Networks

    PubMed Central

    Madhusudhanan, B.; Chitra, S.; Rajan, C.

    2015-01-01

    In MANET multicasting, forward and backward secrecy result in increased packet drop rate owing to mobility. Frequent rekeying causes large message overhead which increases energy consumption and end-to-end delay. Particularly, the prevailing group key management techniques cause frequent mobility and disconnections. So there is a need to design a multicast key management technique to overcome these problems. In this paper, we propose the mobility based key management technique for multicast security in MANET. Initially, the nodes are categorized according to their stability index which is estimated based on the link availability and mobility. A multicast tree is constructed such that for every weak node, there is a strong parent node. A session key-based encryption technique is utilized to transmit a multicast data. The rekeying process is performed periodically by the initiator node. The rekeying interval is fixed depending on the node category so that this technique greatly minimizes the rekeying overhead. By simulation results, we show that our proposed approach reduces the packet drop rate and improves the data confidentiality. PMID:25834838

  1. A Review of LIDAR Radiometric Processing: From Ad Hoc Intensity Correction to Rigorous Radiometric Calibration

    PubMed Central

    Kashani, Alireza G.; Olsen, Michael J.; Parrish, Christopher E.; Wilson, Nicholas

    2015-01-01

    In addition to precise 3D coordinates, most light detection and ranging (LIDAR) systems also record “intensity”, loosely defined as the strength of the backscattered echo for each measured point. To date, LIDAR intensity data have proven beneficial in a wide range of applications because they are related to surface parameters, such as reflectance. While numerous procedures have been introduced in the scientific literature, and even commercial software, to enhance the utility of intensity data through a variety of “normalization”, “correction”, or “calibration” techniques, the current situation is complicated by a lack of standardization, as well as confusing, inconsistent use of terminology. In this paper, we first provide an overview of basic principles of LIDAR intensity measurements and applications utilizing intensity information from terrestrial, airborne topographic, and airborne bathymetric LIDAR. Next, we review effective parameters on intensity measurements, basic theory, and current intensity processing methods. We define terminology adopted from the most commonly-used conventions based on a review of current literature. Finally, we identify topics in need of further research. Ultimately, the presented information helps lay the foundation for future standards and specifications for LIDAR radiometric calibration. PMID:26561813

  2. Energy Efficient and Stable Weight Based Clustering for Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Bouk, Safdar H.; Sasase, Iwao

    Recently several weighted clustering algorithms have been proposed, however, to the best of our knowledge; there is none that propagates weights to other nodes without weight message for leader election, normalizes node parameters and considers neighboring node parameters to calculate node weights. In this paper, we propose an Energy Efficient and Stable Weight Based Clustering (EE-SWBC) algorithm that elects cluster heads without sending any additional weight message. It propagates node parameters to its neighbors through neighbor discovery message (HELLO Message) and stores these parameters in neighborhood list. Each node normalizes parameters and efficiently calculates its own weight and the weights of neighboring nodes from that neighborhood table using Grey Decision Method (GDM). GDM finds the ideal solution (best node parameters in neighborhood list) and calculates node weights in comparison to the ideal solution. The node(s) with maximum weight (parameters closer to the ideal solution) are elected as cluster heads. In result, EE-SWBC fairly selects potential nodes with parameters closer to ideal solution with less overhead. Different performance metrics of EE-SWBC and Distributed Weighted Clustering Algorithm (DWCA) are compared through simulations. The simulation results show that EE-SWBC maintains fewer average numbers of stable clusters with minimum overhead, less energy consumption and fewer changes in cluster structure within network compared to DWCA.

  3. MSG Instant Messenger: Social Presence and Location for the "'Ad Hoc' Learning Experience"

    ERIC Educational Resources Information Center

    Little, Alex; Denham, Chris; Eisenstadt, Marc

    2008-01-01

    "Elearning2.0" promises to harness the power of three of today's most disruptive technologies: social software, elearning, and Web2.0. Our own work in this disruptive space takes as a starting premise that social networking is critical for learning: finding the right person can be more important than "scouring the web for an answer" particularly…

  4. Performance Evaluation of Mobile Ad Hoc Network Based Communications for Future Mobile Tele-Emergency System

    NASA Astrophysics Data System (ADS)

    Viswacheda, D. V.; Barukang, L.; Hamid, M. Y.; Arifianto, M. S.

    Sparked by awareness of the limitations to provide medical services in remote areas, researchers have perceived that developing telemedicine systems is inevitable. In most cases very remote areas and disaster struck areas lack telecommunication infrastructure. Telemedicine system operating in such areas must have advanced wireless technology supporting it in devastating situation, hence it is called as tele-emergency system. Our approach is on MANET combined with Mobile IP and MIPV6, is the basis of infrastructure for the mobile tele-emergency system. The tele-emergency system requires data, voice and video transmission in its network. In this investigation, evaluation is based on simulation of the various ITU-T standard CODECs of VoIP and video transmission over MANET using discrete event simulator NS-2. The results of simulation showed that ITU-T G723.1 worked well in the MANET environment than the other CODECs for VoIP in fixed and mobility tele-emergency environments. From the simulation of video CODEC performance evaluation, it was observed that H.263 performed to a great extent in random small scale environment and also in multiple video flow of 57.6kbps speed video transmission.

  5. Solar-powered ad-hoc wireless sensor network for border surveillance

    NASA Astrophysics Data System (ADS)

    He, Jun; Norwood, Robert A.; Fallahi, Mahmoud; Peyghambarian, Nasser

    2012-06-01

    Wireless sensor networks (WSNs) have emerged as means of providing automated monitoring, target tracking, and intrusion detection. Solar-powered WSNs that adopt innovative sensors with low power consumption and forefront networking technologies can provide rapidly deployable situational awareness and effective security control at the border at low cost. In our paper, we introduce the prototype of our new solar-powered WSN platform for Border Security. We consider practical issues in WSNs, including sensing environment classification, survivability under harsh weather conditions, and efficient solar energy harvesting. Experimental results demonstrate the performance of our new solar-powered WSN.

  6. Report of the NASA Ad Hoc Committee on failure of high strength structural materials

    NASA Technical Reports Server (NTRS)

    Brown, W. F., Jr. (Editor)

    1972-01-01

    An analysis of structural failures that have occurred in NASA programs was conducted. Reports of 231 examples of structural failure were reviewed. Attempts were made to identify those factors which contributed to the failures, and recommendations were formulated for actions which would minimize their effects on future NASA programs. Two classes of factors were identified: (1) those associated with deficiencies in existing materials and structures technology and (2) those attributable to inadequate documentation or communication of that technology.

  7. A Review of LIDAR Radiometric Processing: From Ad Hoc Intensity Correction to Rigorous Radiometric Calibration.

    PubMed

    Kashani, Alireza G; Olsen, Michael J; Parrish, Christopher E; Wilson, Nicholas

    2015-01-01

    In addition to precise 3D coordinates, most light detection and ranging (LIDAR) systems also record "intensity", loosely defined as the strength of the backscattered echo for each measured point. To date, LIDAR intensity data have proven beneficial in a wide range of applications because they are related to surface parameters, such as reflectance. While numerous procedures have been introduced in the scientific literature, and even commercial software, to enhance the utility of intensity data through a variety of "normalization", "correction", or "calibration" techniques, the current situation is complicated by a lack of standardization, as well as confusing, inconsistent use of terminology. In this paper, we first provide an overview of basic principles of LIDAR intensity measurements and applications utilizing intensity information from terrestrial, airborne topographic, and airborne bathymetric LIDAR. Next, we review effective parameters on intensity measurements, basic theory, and current intensity processing methods. We define terminology adopted from the most commonly-used conventions based on a review of current literature. Finally, we identify topics in need of further research. Ultimately, the presented information helps lay the foundation for future standards and specifications for LIDAR radiometric calibration. PMID:26561813

  8. Inventory of Training Centers; Ad Hoc National Advisory Committee on Training Complexes. Final Report.

    ERIC Educational Resources Information Center

    Clark Univ., Worcester, MA.

    This is a report of a selective survey of training activities in the United States. Selection centered on the representative activities of a variety of institutions which served different audiences, had different goals, and different sources of funding. Most of the inventories were conducted in person by a committee member. The 14 reports are…

  9. A probabilistic dynamic energy model for ad-hoc wireless sensors network with varying topology

    NASA Astrophysics Data System (ADS)

    Al-Husseini, Amal

    In this dissertation we investigate the behavior of Wireless Sensor Networks (WSNs) from the degree distribution and evolution perspective. In specific, we focus on implementation of a scale-free degree distribution topology for energy efficient WSNs. WSNs is an emerging technology that finds its applications in different areas such as environment monitoring, agricultural crop monitoring, forest fire monitoring, and hazardous chemical monitoring in war zones. This technology allows us to collect data without human presence or intervention. Energy conservation/efficiency is one of the major issues in prolonging the active life WSNs. Recently, many energy aware and fault tolerant topology control algorithms have been presented, but there is dearth of research focused on energy conservation/efficiency of WSNs. Therefore, we study energy efficiency and fault-tolerance in WSNs from the degree distribution and evolution perspective. Self-organization observed in natural and biological systems has been directly linked to their degree distribution. It is widely known that scale-free distribution bestows robustness, fault-tolerance, and access efficiency to system. Fascinated by these properties, we propose two complex network theoretic self-organizing models for adaptive WSNs. In particular, we focus on adopting the Barabasi and Albert scale-free model to fit into the constraints and limitations of WSNs. We developed simulation models to conduct numerical experiments and network analysis. The main objective of studying these models is to find ways to reducing energy usage of each node and balancing the overall network energy disrupted by faulty communication among nodes. The first model constructs the wireless sensor network relative to the degree (connectivity) and remaining energy of every individual node. We observed that it results in a scale-free network structure which has good fault tolerance properties in face of random node failures. The second model considers additional constraints on the maximum degree of each node as well as the energy consumption relative to degree changes. This gives more realistic results from a dynamical network perspective. It results in balanced network-wide energy consumption. The results show that networks constructed using the proposed approach have good properties for different centrality measures. The outcomes of the presented research are beneficial to building WSN control models with greater self-organization properties which leads to optimal energy consumption.

  10. Solving data-at-rest for the storage and retrieval of files in ad hoc networks

    NASA Astrophysics Data System (ADS)

    Knobler, Ron; Scheffel, Peter; Williams, Jonathan; Gaj, Kris; Kaps, Jens-Peter

    2013-05-01

    Based on current trends for both military and commercial applications, the use of mobile devices (e.g. smartphones and tablets) is greatly increasing. Several military applications consist of secure peer to peer file sharing without a centralized authority. For these military applications, if one or more of these mobile devices are lost or compromised, sensitive files can be compromised by adversaries, since COTS devices and operating systems are used. Complete system files cannot be stored on a device, since after compromising a device, an adversary can attack the data at rest, and eventually obtain the original file. Also after a device is compromised, the existing peer to peer system devices must still be able to access all system files. McQ has teamed with the Cryptographic Engineering Research Group at George Mason University to develop a custom distributed file sharing system to provide a complete solution to the data at rest problem for resource constrained embedded systems and mobile devices. This innovative approach scales very well to a large number of network devices, without a single point of failure. We have implemented the approach on representative mobile devices as well as developed an extensive system simulator to benchmark expected system performance based on detailed modeling of the network/radio characteristics, CONOPS, and secure distributed file system functionality. The simulator is highly customizable for the purpose of determining expected system performance for other network topologies and CONOPS.

  11. iScout low-cost ad-hoc networked sensor enhancements

    NASA Astrophysics Data System (ADS)

    Winston, Mark A.

    2007-04-01

    McQ has developed a family of state of the art miniaturized low cost unattended ground sensors (UGS). The iScout TM sensors are designed for indoor and outdoor intrusion detection and battle damage assessment. McQ has developed an enhanced version of the iScout TM sensor that is a very flexible platform capable of performing in a variety of applications. Sensors are equipped with mesh radios and integrated seismic, acoustic, infrared, and magnetic transducers. Typical sensor sizes are similar to that of a deck of playing cards. Intended for high volume production, these are tactically useful sensors that can be manufactured in high volumes at a low cost. This paper will provide an overview of the iScout TM sensor systems, features, and performance.

  12. Ad HOC Model Generation Using Multiscale LIDAR Data from a Geospatial Database

    NASA Astrophysics Data System (ADS)

    Gordon, M.; Borgmann, B.; Gehrung, J.; Hebel, M.; Arens, M.

    2015-08-01

    Due to the spread of economically priced laser scanning technology nowadays, especially in the field of topographic surveying and mapping, ever-growing amounts of data need to be handled. Depending on the requirements of the specific application, airborne, mobile or terrestrial laser scanners are commonly used. Since visualizing this flood of data is not feasible with classical approaches like raw point cloud rendering, real time decision making requires sophisticated solutions. In addition, the efficient storage and recovery of 3D measurements is a challenging task. Therefore we propose an approach for the intelligent storage of 3D point clouds using a spatial database. For a given region of interest, the database is queried for the data available. All resulting point clouds are fused in a model generation process, utilizing the fact that low density airborne measurements could be used to supplement higher density mobile or terrestrial laser scans. The octree based modeling approach divides and subdivides the world into cells of varying size and fits one plane per cell, once a specified amount of points is present. The resulting model exceeds the completeness and precision of every single data source and enables for real time visualization. This is especially supported by data compression ratios of about 90%.

  13. Ad Hoc Committee on NAEP Parent Engagement: Reaching Parents with NAEP Resources

    ERIC Educational Resources Information Center

    National Assessment Governing Board, 2012

    2012-01-01

    The National Assessment Governing Board, recognizing that National Assessment of Educational Progress (NAEP) report releases were not conveying a sense of urgency, began an initiative in May 2010 to see what the Board could do to "make a difference" in fostering concern and action about the need to improve achievement and reduce achievement gaps,…

  14. Inter-Vehicular Ad Hoc Networks: From the Ground Truth to Algorithm Design and Testbed Architecture

    ERIC Educational Resources Information Center

    Giordano, Eugenio

    2011-01-01

    Many of the devices we interact with on a daily basis are currently equipped with wireless connectivity. Soon this will be extended to the vehicles we drive/ride every day. Wirelessly connected vehicles will form a new kind of network that will enable a wide set of innovative applications ranging from enhanced safety to entertainment. To…

  15. MUSIC algorithm DoA estimation for cooperative node location in mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Warty, Chirag; Yu, Richard Wai; ElMahgoub, Khaled; Spinsante, Susanna

    In recent years the technological development has encouraged several applications based on distributed communications network without any fixed infrastructure. The problem of providing a collaborative early warning system for multiple mobile nodes against a fast moving object. The solution is provided subject to system level constraints: motion of nodes, antenna sensitivity and Doppler effect at 2.4 GHz and 5.8 GHz. This approach consists of three stages. The first phase consists of detecting the incoming object using a highly directive two element antenna at 5.0 GHz band. The second phase consists of broadcasting the warning message using a low directivity broad antenna beam using 2× 2 antenna array which then in third phase will be detected by receiving nodes by using direction of arrival (DOA) estimation technique. The DOA estimation technique is used to estimate the range and bearing of the incoming nodes. The position of fast arriving object can be estimated using the MUSIC algorithm for warning beam DOA estimation. This paper is mainly intended to demonstrate the feasibility of early detection and warning system using a collaborative node to node communication links. The simulation is performed to show the behavior of detecting and broadcasting antennas as well as performance of the detection algorithm. The idea can be further expanded to implement commercial grade detection and warning system

  16. The Ad Hoc Mars Airplane science working group. [remotely piloted airplane as a Mars exploration vehicle

    NASA Technical Reports Server (NTRS)

    Clarke, V. C., Jr.

    1978-01-01

    The capability of a remotely piloted airplane as a Mars exploration vehicle in the aerial survey mode is assessed. Specific experiment areas covered include: visual imaging; gamma ray and infrared reflectance spectroscopy; gravity field; magnetic field and electromagnetic sounding; and atmospheric composition and dynamics. It is concluded that (1) the most important use of a plane in the aerial survey mode would be in topical studies and returned sample site characterization; (2) the airplane offers the unique capability to do high resolution, oblique imaging, and repeated profile measurements in the atmospheric boundary layer; and (3) it offers the best platform from which to do electromagnetic sounding.

  17. Feeding the Preschool Child: Documents Issued by PAG Ad Hoc Working Group Meetings (1969-1975).

    ERIC Educational Resources Information Center

    United Nations Industrial Development Organization, Vienna (Austria).

    This document contains six papers prepared between 1969 and 1975 by the Protein-Calorie Advisory Group (PAG) of the United Nations on topics related to the feeding of preschool children in underdeveloped countries. Among the topics covered: (1) nutrition in utero; (2) nutritional aspects of breastfeeding; (3) infant mortality rates as indicators…

  18. Report and Recommendation of the Ad Hoc Committee to Review the College Calendar.

    ERIC Educational Resources Information Center

    San Joaquin Delta Coll., Stockton, CA.

    A study was conducted at San Joaquin Delta College (SJDC) to determine whether its present calendar, based on the traditional semester system, should be abandoned in favor of either the quarter or the early semester calendars. The study involved: (1) contacting employers to determine the effect of a calendar change on student employment, (2)…

  19. Using Sphinx to Improve Onion Routing Circuit Construction

    NASA Astrophysics Data System (ADS)

    Kate, Aniket; Goldberg, Ian

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

  20. State alternative route designations

    SciTech Connect

    Not Available

    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.

  1. State alternative route designations

    SciTech Connect

    Not Available

    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.

  2. Defining Dynamic Route Structure

    NASA Technical Reports Server (NTRS)

    Zelinski, Shannon; Jastrzebski, Michael

    2011-01-01

    This poster describes a method for defining route structure from flight tracks. Dynamically generated route structures could be useful in guiding dynamic airspace configuration and helping controllers retain situational awareness under dynamically changing traffic conditions. Individual merge and diverge intersections between pairs of flights are identified, clustered, and grouped into nodes of a route structure network. Links are placed between nodes to represent major traffic flows. A parametric analysis determined the algorithm input parameters producing route structures of current day flight plans that are closest to todays airway structure. These parameters are then used to define and analyze the dynamic route structure over the course of a day for current day flight paths. Route structures are also compared between current day flight paths and more user preferred paths such as great circle and weather avoidance routing.

  3. Multipath routing in wireless sensor networks: survey and research challenges.

    PubMed

    Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks. PMID:22368490

  4. Rational Protocols

    NASA Astrophysics Data System (ADS)

    Cachin, Christian

    Security research continues to provide a plethora of new protocols and mechanisms; these solutions patch either existing vulnerabilities found in practical systems or solve hypothetical security problems in the sense that the problem is often conceived at the same time when the first solution is proposed. Yet only a very small fraction of this research is relevant to ordinary users in the sense that they are willing to actually deploy the technology.

  5. Network-wide BGP route prediction for traffic engineering

    NASA Astrophysics Data System (ADS)

    Feamster, Nick; Rexford, Jennifer

    2002-07-01

    The Internet consists of about 13,000 Autonomous Systems (AS's) that exchange routing information using the Border Gateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS's. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers. Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS's. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT&T's commercial IP network. Our route prediction techniques help support the operation of large IP backbone networks, where interdomain routing is an important aspect of traffic engineering.

  6. View southwest along Route Canterbury Road (Route 169) showing commercial ...

    Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

    View southwest along Route Canterbury Road (Route 169) showing commercial and residential buildings on the east and west sides of the road - Brooklyn Green, North Green, South Green, & West Green, parts of Brown Road, Canterbury Road (Route 169), Hartford Road (Route 6), Hyde Road, Pomfret Road (Route 169), Prince Hill Road, Providence Road (Route 6), Wauregan Road (Routes 169 & 205), & Wolf Den Road, Brooklyn, Windham County, CT

  7. LBR: Load Balancing Routing Algorithm for Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Daabaj, Khaled; Dixon, Mike; Koziniec, Terry

    2010-06-01

    Homogeneous wireless sensor networks (WSNs) are organized using identical sensor nodes, but the nature of WSNs operations results in an imbalanced workload on gateway sensor nodes which may lead to a hot-spot or routing hole problem. The routing hole problem can be considered as a natural result of the tree-based routing schemes that are widely used in WSNs, where all nodes construct a multi-hop routing tree to a centralized root, e.g., a gateway or base station. For example, sensor nodes on the routing path and closer to the base station deplete their own energy faster than other nodes, or sensor nodes with the best link state to the base station are overloaded with traffic from the rest of the network and experience a faster energy depletion rate than their peers. Routing protocols for WSNs are reliability-oriented and their use of reliability metric to avoid unreliable links makes the routing scheme worse. However, none of these reliability oriented routing protocols explicitly uses load balancing in their routing schemes. Since improving network lifetime is a fundamental challenge of WSNs, we present, in this chapter, a novel, energy-wise, load balancing routing (LBR) algorithm that addresses load balancing in an energy efficient manner by maintaining a reliable set of parent nodes. This allows sensor nodes to quickly find a new parent upon parent loss due to the existing of node failure or energy hole. The proposed routing algorithm is tested using simulations and the results demonstrate that it outperforms the MultiHopLQI reliability based routing algorithm.

  8. Intelligent deflection routing in buffer-less networks.

    PubMed

    Haeri, Soroush; Trajković, Ljiljana

    2015-02-01

    Deflection routing is employed to ameliorate packet loss caused by contention in buffer-less architectures such as optical burst-switched networks. The main goal of deflection routing is to successfully deflect a packet based only on a limited knowledge that network nodes possess about their environment. In this paper, we present a framework that introduces intelligence to deflection routing (iDef). iDef decouples the design of the signaling infrastructure from the underlying learning algorithm. It consists of a signaling and a decision-making module. Signaling module implements a feedback management protocol while the decision-making module implements a reinforcement learning algorithm. We also propose several learning-based deflection routing protocols, implement them in iDef using the ns-3 network simulator, and compare their performance. PMID:25532199

  9. ROUTE-SPECIFIC DOSIMETRY

    EPA Science Inventory

    The capacity to perform route-to-route extrapolation of toxicity data is becoming increasingly crucial to the Agency, with a number of strategies suggested and demonstrated. One strategy involves using a combination of existing data and modeling approaches. This strategy propos...

  10. Automatic routing module

    NASA Technical Reports Server (NTRS)

    Malin, Janice A.

    1987-01-01

    Automatic Routing Module (ARM) is a tool to partially automate Air Launched Cruise Missile (ALCM) routing. For any accessible launch point or target pair, ARM creates flyable routes that, within the fidelity of the models, are optimal in terms of threat avoidance, clobber avoidance, and adherence to vehicle and planning constraints. Although highly algorithmic, ARM is an expert system. Because of the heuristics applied, ARM generated routes closely resemble manually generated routes in routine cases. In more complex cases, ARM's ability to accumulate and assess threat danger in three dimensions and trade that danger off with the probability of ground clobber results in the safest path around or through difficult areas. The tools available prior to ARM did not provide the planner with enough information or present it in such a way that ensured he would select the safest path.

  11. Energy efficient medium access protocol for wireless medical body area sensor networks.

    PubMed

    Omeni, O; Wong, A; Burdett, A J; Toumazou, C

    2008-12-01

    This paper presents a novel energy-efficient MAC Protocol designed specifically for wireless body area sensor networks (WBASN) focused towards pervasive healthcare applications. Wireless body area networks consist of wireless sensor nodes attached to the human body to monitor vital signs such as body temperature, activity or heart-rate. The network adopts a master-slave architecture, where the body-worn slave node periodically sends sensor readings to a central master node. Unlike traditional peer-to-peer wireless sensor networks, the nodes in this biomedical WBASN are not deployed in an ad hoc fashion. Joining a network is centrally managed and all communications are single-hop. To reduce energy consumption, all the sensor nodes are in standby or sleep mode until the centrally assigned time slot. Once a node has joined a network, there is no possibility of collision within a cluster as all communication is initiated by the central node and is addressed uniquely to a slave node. To avoid collisions with nearby transmitters, a clear channel assessment algorithm based on standard listen-before-transmit (LBT) is used. To handle time slot overlaps, the novel concept of a wakeup fallback time is introduced. Using single-hop communication and centrally controlled sleep/wakeup times leads to significant energy reductions for this application compared to more ldquoflexiblerdquo network MAC protocols such as 802.11 or Zigbee. As duty cycle is reduced, the overall power consumption approaches the standby power. The protocol is implemented in hardware as part of the Sensiumtrade system-on-chip WBASN ASIC, in a 0.13- mum CMOS process. PMID:23853128

  12. Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

    NASA Technical Reports Server (NTRS)

    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.

  13. Summary of the EPA (Environmental Protection Agency) workshop on carcinogenesis bioassay via the dermal route. Final technical report

    SciTech Connect

    Not Available

    1987-04-29

    Traditionally, the oral route has been the most common route of administration in bioassays which tested the potential carcinogenicity of chemicals. Regulatory agencies, however, prefer to have test chemicals applied by the same route as expected human exposure, whenever possible. Since human exposure to industrial chemicals is frequently via the dermal route, this has become a route of choice for animal testing of certain chemicals. However, protocol design for dermal bioassays presents many unique problems which must be addressed before guidelines for bioassays by the dermal route can be formulated. Furthermore, it may be feasible to develop a limited dermal protocol to screen certain classes of chemicals such as acrylates/methacrylates. Recognizing the need for this workshop, it was designed in two distinct parts; to address the problems inherent in the development of a generic protocol for dermal bioassays and, a specific limited dermal bioassay protocol for acrylates/methacrylates.

  14. Understanding individual routing behaviour.

    PubMed

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

  15. Routing Vehicles with Ants

    NASA Astrophysics Data System (ADS)

    Tan, Wen Fang; Lee, Lai Soon; Majid, Zanariah Abdul; Seow, Hsin Vonn

    Routing vehicles involve the design of an optimal set of routes for a fleet of vehicles to serve a number of customers with known demands. This research develops an Ant Colony Optimization for the vehicle routing with one central depot and identical vehicles. The procedure simulates the behavior of real ants that always find the shortest path between their nest and a food source through a form of communication, pheromone trail. Finally, preliminary results on the learning of the algorithm testing on benchmark data set will be presented in this paper.

  16. Adaptive routing for dynamic on-body wireless sensor networks.

    PubMed

    Maskooki, Arash; Soh, Cheong Boon; Gunawan, Erry; Low, Kay Soon

    2015-03-01

    Energy is scarce in mobile computing devices including wearable and implantable devices in a wireless body area network. In this paper, an adaptive routing protocol is developed and analyzed which minimizes the energy cost per bit of information by using the channel information to choose the best strategy to route data. In this approach, the source node will switch between direct and relayed communication based on the quality of the link and will use the relay only if the channel quality is below a certain threshold. The mathematical model is then validated through simulations which shows that the adaptive routing strategy can improve energy efficiency significantly compared with existing methods. PMID:24686306

  17. Performance Evaluation of AODV with Blackhole Attack

    NASA Astrophysics Data System (ADS)

    Dara, Karuna

    2010-11-01

    A Mobile Ad Hoc Network (MANET) is a temporary network set up by a wireless mobile computers moving arbitrary in the places that have no network infrastructure. These nodes maintain connectivity in a decentralized manner. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network. Thus the nodes find a path to the destination node using routing protocols. However, due to security vulnerabilities of the routing protocols, mobile ad-hoc networks are unprotected to attacks of the malicious nodes. One of these attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur. In this paper, we simulated the black hole attack in various mobile ad-hoc network scenarios using AODV routing protocol of MANET and have tried to find a effect if number of nodes are increased with increase in malicious nodes.

  18. Research on dynamic routing mechanisms in wireless sensor networks.

    PubMed

    Zhao, A Q; Weng, Y N; Lu, Y; Liu, C Y

    2014-01-01

    WirelessHART is the most widely applied standard in wireless sensor networks nowadays. However, it does not provide any dynamic routing mechanism, which is important for the reliability and robustness of the wireless network applications. In this paper, a collection tree protocol based, dynamic routing mechanism was proposed for WirelessHART network. The dynamic routing mechanism was evaluated through several simulation experiments in three aspects: time for generating the topology, link quality, and stability of network. Besides, the data transmission efficiency of this routing mechanism was analyzed. The simulation and evaluation results show that this mechanism can act as a dynamic routing mechanism for the TDMA-based wireless sensor network. PMID:24982927

  19. Class network routing

    DOEpatents

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

    2009-09-08

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

  20. Railroad Routing Model

    1995-01-05

    INTERLINE/PC is an interactive program designed to simulate the routing practices of the United States rail system. The rail industry is divided into a large number of independent competing companies. The INTERLINE data base represents these rail companies as 94 separate subnetworks. An additional two subnetworks represent navigable inland/intracoastal and deep draft marine routes. Interchange points between individual rail systems and waterway systems are also identified.

  1. Licklider Transmission Protocol Implementation

    NASA Technical Reports Server (NTRS)

    Burleigh, Scott C.; Krupiarz, Chris

    2011-01-01

    This software is an implementation of the Licklider Transmission Protocol (LTP), a communications protocol intended to support the Bundle Protocol in Delay-Tolerant Network (DTN) operations. LTP is designed to provide retransmission-based reliability over links characterized by extremely long message round-trip times and/or frequent interruptions in connectivity. Communication in interplanetary space is the most prominent example of this sort of environment, and LTP is principally aimed at supporting long-haul reliable transmission over deep-space RF links. Like any reliable transport service employing ARQ (Automatic Repeat re-Quests), LTP is stateful. In order to assure the reception of a block of data it has sent, LTP must retain for possible retransmission all portions of that block which might not have been received yet. In order to do so, it must keep track of which portions of the block are known to have been received so far, and which are not, together with any additional information needed for purposes of retransmitting part, or all, of the block. Long round-trip times mean substantial delay between the transmission of a block of data and the reception of an acknowledgement from the block s destination, signaling arrival of the block. If LTP postponed transmission of additional blocks of data until it received acknowledgement of the arrival of all prior blocks, valuable opportunities to use what little deep space transmission bandwidth is available would be forever lost. For this reason, LTP is based in part on a notion of massive state retention. Any number of requested transmission conversations (sessions) may be concurrently in flight at various displacements along the link between two LTP engines, and the LTP engines must necessarily retain transmission status and retransmission resources for all of them. Moreover, if any of the data of a given block are lost en route, it will be necessary to retain the state of that transmission during an additional

  2. Contact Graph Routing Enhancements Developed in ION for DTN

    NASA Technical Reports Server (NTRS)

    Segui, John S.; Burleigh, Scott

    2013-01-01

    The Interplanetary Overlay Network (ION) software suite is an open-source, flight-ready implementation of networking protocols including the Delay/Disruption Tolerant Networking (DTN) Bundle Protocol (BP), the CCSDS (Consultative Committee for Space Data Systems) File Delivery Protocol (CFDP), and many others including the Contact Graph Routing (CGR) DTN routing system. While DTN offers the capability to tolerate disruption and long signal propagation delays in transmission, without an appropriate routing protocol, no data can be delivered. CGR was built for space exploration networks with scheduled communication opportunities (typically based on trajectories and orbits), represented as a contact graph. Since CGR uses knowledge of future connectivity, the contact graph can grow rather large, and so efficient processing is desired. These enhancements allow CGR to scale to predicted NASA space network complexities and beyond. This software improves upon CGR by adopting an earliest-arrival-time cost metric and using the Dijkstra path selection algorithm. Moving to Dijkstra path selection also enables construction of an earliest- arrival-time tree for multicast routing. The enhancements have been rolled into ION 3.0 available on sourceforge.net.

  3. Delta Coherence Protocols: The Home Update Protocol

    SciTech Connect

    Williams, C.; Reynolds, P.F.; de Supinoki, B.

    2000-07-21

    We describe a new class of directory coherence protocols called delta coherence protocols that use network guarantees to support a new and highly concurrent approach to maintain a consistent shared memory. Delta coherence protocols are more concurrent than other coherence protocols in that they allow processes to pipeline memory accesses without violating sequential consistency; support multiple concurrent readers and writers to the same cache block; and allow processes to access multiple shared variables atomically without invalidating the copies held by other processes or otherwise obtaining exclusive access to the referenced variables. Delta protocols include both update and invalidate protocols. In this paper we describe the simplest, most basic delta protocol, an update protocol called the home update protocol. Delta protocols are based on isotach network guarantees. An isotach network maintains a logical time system that allows each process to predict and control the logical time at which its messages are received. Processes use isotach guarantees to control the logical time at which their requests on shared memory appear to be executed. We prove the home update protocol is correct using logical time to reason about the order in which requests are executed.

  4. Collective network routing

    DOEpatents

    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.

  5. WDM Network and Multicasting Protocol Strategies

    PubMed Central

    Zaim, Abdul Halim

    2014-01-01

    Optical technology gains extensive attention and ever increasing improvement because of the huge amount of network traffic caused by the growing number of internet users and their rising demands. However, with wavelength division multiplexing (WDM), it is easier to take the advantage of optical networks and optical burst switching (OBS) and to construct WDM networks with low delay rates and better data transparency these technologies are the best choices. Furthermore, multicasting in WDM is an urgent solution for bandwidth-intensive applications. In the paper, a new multicasting protocol with OBS is proposed. The protocol depends on a leaf initiated structure. The network is composed of source, ingress switches, intermediate switches, edge switches, and client nodes. The performance of the protocol is examined with Just Enough Time (JET) and Just In Time (JIT) reservation protocols. Also, the paper involves most of the recent advances about WDM multicasting in optical networks. WDM multicasting in optical networks is given as three common subtitles: Broadcast and-select networks, wavelength-routed networks, and OBS networks. Also, in the paper, multicast routing protocols are briefly summarized and optical burst switched WDM networks are investigated with the proposed multicast schemes. PMID:24744683

  6. WDM network and multicasting protocol strategies.

    PubMed

    Kirci, Pinar; Zaim, Abdul Halim

    2014-01-01

    Optical technology gains extensive attention and ever increasing improvement because of the huge amount of network traffic caused by the growing number of internet users and their rising demands. However, with wavelength division multiplexing (WDM), it is easier to take the advantage of optical networks and optical burst switching (OBS) and to construct WDM networks with low delay rates and better data transparency these technologies are the best choices. Furthermore, multicasting in WDM is an urgent solution for bandwidth-intensive applications. In the paper, a new multicasting protocol with OBS is proposed. The protocol depends on a leaf initiated structure. The network is composed of source, ingress switches, intermediate switches, edge switches, and client nodes. The performance of the protocol is examined with Just Enough Time (JET) and Just In Time (JIT) reservation protocols. Also, the paper involves most of the recent advances about WDM multicasting in optical networks. WDM multicasting in optical networks is given as three common subtitles: Broadcast and-select networks, wavelength-routed networks, and OBS networks. Also, in the paper, multicast routing protocols are briefly summarized and optical burst switched WDM networks are investigated with the proposed multicast schemes. PMID:24744683

  7. A Communications Network Architecture for Future Mars Missions

    NASA Astrophysics Data System (ADS)

    Gilstrap, R.; Alena, R.; Stone, T.

    2012-06-01

    We propose a Mars communications network architecture incorporating the Internet Protocol, small communications relay satellites, laser communications, delay tolerant networking, mobile ad hoc networking, and wireless sensor networks.

  8. Route based forecasting

    NASA Astrophysics Data System (ADS)

    Zuurendonk, I. W.; Wokke, M. J. J.

    2009-09-01

    Road surface temperatures can differ several degrees on a very short distance due to local effects. In order to get more insight in the local temperature differences and to develop safer gritting routes, Meteogroup has developed a system for route based temperature forecasting. The standard version of the road model is addressed to forecast road surface temperature and condition for a specific location. This model consists of two parts. First a physical part, based on the energy balance equations. The second part of the model performs a statistical correction on the calculated physical road surface temperature. The road model is able to create a forecast for one specific location. From infrared measurements, we know that large local differences in road surface temperature exist on a route. Differences can be up to 5 degrees Celsius over a distance of several hundreds of meters. Based on those measurements, the idea came up to develop a system that forecasts road surface temperature and condition for an entire route: route based forecasting. The route is split up in sections with equal properties. For each section a temperature and condition will be calculated. The main factors that influence the road surface temperature are modelled in this forecasting system: •The local weather conditions: temperature, dew point temperature, wind, precipitation, weather type, cloudiness. •The sky view: A very sheltered place will receive less radiation during daytime and emit less radiation during nighttime. For a very open spot, the effects are reversed. •The solar view: A road section with trees on the southern side, will receive less solar radiation during daytime than a section with tress on the southern side. The route based forecast shows by means of a clear Google Maps presentation which sections will be slippery at what time of the coming night. The final goal of this type of forecast, is to make dynamical gritting possible: a variable salt amount and a different

  9. Point-to-Point Multicast Communications Protocol

    NASA Technical Reports Server (NTRS)

    Byrd, Gregory T.; Nakano, Russell; Delagi, Bruce A.

    1987-01-01

    This paper describes a protocol to support point-to-point interprocessor communications with multicast. Dynamic, cut-through routing with local flow control is used to provide a high-throughput, low-latency communications path between processors. In addition multicast transmissions are available, in which copies of a packet are sent to multiple destinations using common resources as much as possible. Special packet terminators and selective buffering are introduced to avoid a deadlock during multicasts. A simulated implementation of the protocol is also described.

  10. Scalability-performance tradeoffs in MPLS and IP routing

    NASA Astrophysics Data System (ADS)

    Yilmaz, Selma; Matta, Ibrahim

    2002-07-01

    MPLS (Multi-Protocol Label Switching) has recently emerged to facilitate the engineering of network traffic. This can be achieved by directing packet flows over paths that satisfy multiple requirements. MPLS has been regarded as an enhancement to traditional IP routing, which has the following problems: (1) all packets with the same IP destination address have to follow the same path through the network; and (2) paths have often been computed based on static and single link metrics. These problems may cause traffic concentration, and thus degradation in quality of service. In this paper, we investigate by simulations a range of routing solutions and examine the tradeoff between scalability and performance. At one extreme, IP packet routing using dynamic link metrics provides a stateless solution but may lead to routing oscillations. At the other extreme, we consider a recently proposed Profile-based Routing (PBR), which uses knowledge of potential ingress-egress pairs as well as the traffic profile among them. Minimum Interference Routing (MIRA) is another recently proposed MPLS-based scheme, which only exploits knowledge of potential ingress-egress pairs but not their traffic profile. MIRA and the more conventional widest-shortest path (WSP) routing represent alternative MPLS-based approaches on the spectrum of routing solutions. We compare these solutions in terms of utility, bandwidth acceptance ratio as well as their scalability (routing state and computational overhead) and load balancing capability. While the simplest of the per-flow algorithms we consider, the performance of WSP is close to dynamic per-packet routing, without the potential instabilities of dynamic routing.

  11. Congestion control and routing over satellite networks

    NASA Astrophysics Data System (ADS)

    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

  12. A multipath video delivery scheme over diffserv wireless LANs

    NASA Astrophysics Data System (ADS)

    Man, Hong; Li, Yang

    2004-01-01

    This paper presents a joint source coding and networking scheme for video delivery over ad hoc wireless local area networks. The objective is to improve the end-to-end video quality with the constraint of the physical network. The proposed video transport scheme effectively integrates several networking components including load-aware multipath routing, class based queuing (CBQ), and scalable (or layered) video source coding techniques. A typical progressive video coder, 3D-SPIHT, is used to generate multi-layer source data streams. The coded bitstreams are then segmented into multiple sub-streams, each with a different level of importance towards the final video reconstruction. The underlay wireless ad hoc network is designed to support service differentiation. A contention sensitive load aware routing (CSLAR) protocol is proposed. The approach is to discover multiple routes between the source and the destination, and label each route with a load value which indicates its quality of service (QoS) characteristics. The video sub-streams will be distributed among these paths according to their QoS priority. CBQ is also applied to all intermediate nodes, which gives preference to important sub-streams. Through this approach, the scalable source coding techniques are incorporated with differentiated service (DiffServ) networking techniques so that the overall system performance is effectively improved. Simulations have been conducted on the network simulator (ns-2). Both network layer performance and application layer performance are evaluated. Significant improvements over traditional ad hoc wireless network transport schemes have been observed.

  13. Hydrologic Flood Routing.

    ERIC Educational Resources Information Center

    Heggen, Richard J.

    1982-01-01

    Discusses a short classroom-based BASIC program which routes stream flow through a system of channels and reservoirs. The program is suitable for analyses of open channel conveyance systems, flood detention reservoirs, and combinations of the two. (Author/JN)

  14. Submarine cable route survey

    SciTech Connect

    Herrouin, G.; Scuiller, T.

    1995-12-31

    The growth of telecommunication market is very significant. From the beginning of the nineties, more and more the use of optical fiber submarine cables is privileged to that of satellites. These submarine telecommunication highways require accurate surveys in order to select the optimum route and determine the cable characteristics. Advanced technology tools used for these surveys are presented along with their implementation.

  15. A Cross Unequal Clustering Routing Algorithm for Sensor Network

    NASA Astrophysics Data System (ADS)

    Tong, Wang; Jiyi, Wu; He, Xu; Jinghua, Zhu; Munyabugingo, Charles

    2013-08-01

    In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the "hot spot" problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node's position and node's remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime

  16. Montreal Protocol: The Gift that Keeps on Giving

    NASA Astrophysics Data System (ADS)

    Reifsnyder, D. A.

    2012-12-01

    Unlike many of my contemporaries, I did not begin my career with CFCs, ozone, and the Montreal Protocol. Instead, I began with climate change issue. In October 1989 I became Director of the Department of State's Office of Global Change, after the George H.W. Bush Administration agreed to host the Third Plenary of the Intergovernmental Panel on Climate Change (IPCC) at Georgetown University. Bert Bolin was IPCC Chair, Bill Reilly was EPA Administrator and John Sununu was White House Chief of Staff. I survived those early years and afterward had a long run with the climate change policy - lasting through six administrations. Last year I even chaired the Ad Hoc Group on Long-Term Cooperative Action in Durban at the 17th Conference of the Parties under the UN FCCC. I really plunged into the ozone issue in 2006 when I became the Deputy Assistant Secretary for Environment. By then ozone was hardly ever mentioned, except to recall that the Montreal Protocol was undoubtedly the most successful multilateral environmental agreement ever undertaken - and to contrast it nostalgically with others that have not fared so well - particularly climate. Even worse, ozone was ancient history and most people thought we had solved that problem. Richard Benedict's Ozone Diplomacy had long been a staple of college courses on the global environment but few graduates saw a career in ozone, and it had become difficult to find people in government who were willing to work on it. In early 2007, my staff and I met with colleagues at EPA to brainstorm about the global effort to phase out chlorofluorocarbons (CFCs) and move to alternatives - hydrochlorofluorocarbons (HCFCs). The transition from CFCs was nearing its end but HCFCs, though less potent, were still a problem for the ozone layer. We began to wonder -- could something be done to accelerate the phaseouts of HCFCs? We realized that proposing an acceleration would mean that developed countries would need to go first. Only later would they

  17. Weather routing in long-distance Mediterranean routes

    NASA Astrophysics Data System (ADS)

    Delitala, A. M. S.; Gallino, S.; Villa, L.; Lagouvardos, K.; Drago, A.

    2010-10-01

    The selection of ship routes based on modern weather forecasting is a mean of computing optimum shipping routes thereby increasing safety and comfort at sea, cutting down on transit time, and reducing fuel consumption. Further empirical research in the effectiveness of modern weather routing applications is required especially in applications concerning shorter routes in enclosed seas of limited geographical extent such as the Mediterranean Sea. The present study used two climatological simulations to test this state-of-the-art approach to ship routing. Simulations represented two theoretical routes: (1) a route between Italy and Greece and (2) a route between Cyprus and Italy. Both routes were analyzed across varying simulated climatic conditions and the results were compared with those of control routes. Furthermore, results were analyzed in terms of passenger and crew comfort, bunker consumption by ships, and time of crossing. The first simulation showed that weather routing would improve ship performance on 37% of days while the second simulation revealed that weather routing would support ship captains virtually all the time.

  18. Masked Proportional Routing

    NASA Technical Reports Server (NTRS)

    Wolpert, David

    2004-01-01

    Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an

  19. A differential evolution-based routing algorithm for environmental monitoring wireless sensor networks.

    PubMed

    Li, Xiaofang; Xu, Lizhong; Wang, Huibin; Song, Jie; Yang, Simon X

    2010-01-01

    The traditional Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol is a clustering-based protocol. The uneven selection of cluster heads results in premature death of cluster heads and premature blind nodes inside the clusters, thus reducing the overall lifetime of the network. With a full consideration of information on energy and distance distribution of neighboring nodes inside the clusters, this paper proposes a new routing algorithm based on differential evolution (DE) to improve the LEACH routing protocol. To meet the requirements of monitoring applications in outdoor environments such as the meteorological, hydrological and wetland ecological environments, the proposed algorithm uses the simple and fast search features of DE to optimize the multi-objective selection of cluster heads and prevent blind nodes for improved energy efficiency and system stability. Simulation results show that the proposed new LEACH routing algorithm has better performance, effectively extends the working lifetime of the system, and improves the quality of the wireless sensor networks. PMID:22219670

  20. Graphical user interface for wireless sensor networks simulator

    NASA Astrophysics Data System (ADS)

    Paczesny, Tomasz; Paczesny, Daniel; Weremczuk, Jerzy

    2008-01-01

    Wireless Sensor Networks (WSN) are currently very popular area of development. It can be suited in many applications form military through environment monitoring, healthcare, home automation and others. Those networks, when working in dynamic, ad-hoc model, need effective protocols which must differ from common computer networks algorithms. Research on those protocols would be difficult without simulation tool, because real applications often use many nodes and tests on such a big networks take much effort and costs. The paper presents Graphical User Interface (GUI) for simulator which is dedicated for WSN studies, especially in routing and data link protocols evaluation.