Science.gov

Sample records for ad-hoc sensor networks

  1. Time synchronization in ad-hoc wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Sharma, Nishant

    2013-06-01

    Advances in micro-electronics and developments in the various technologies have given birth to this era of wireless sensor networks. A sensor network is the one which provides information about the surrounding environment by sensing it and clock synchronization in wireless sensor networks plays a vital role to maintain the integrity of entire network. In this paper two major low energy consumption clock synchronization algorithms, Reference Broadcast Synchronization (RBS) and Timing-Sync Protocol for Sensor Networks (TPSN) are simulated, which result in high level of accuracy, reliability, handles substantially greater node densities, supports mobility, and hence perform well under all possible conditions.

  2. Information Fusion in Ad hoc Wireless Sensor Networks for Aircraft Health Monitoring

    NASA Astrophysics Data System (ADS)

    Fragoulis, Nikos; Tsagaris, Vassilis; Anastassopoulos, Vassilis

    In this paper the use of an ad hoc wireless sensor network for implementing a structural health monitoring system is discussed. The network is consisted of sensors deployed throughout the aircraft. These sensors being in the form of a microelectronic chip and consisted of sensing, data processing and communicating components could be easily embedded in any mechanical aircraft component. The established sensor network, due to its ad hoc nature is easily scalable, allowing adding or removing any number of sensors. The position of the sensor nodes need not necessarily to be engineered or predetermined, giving this way the ability to be deployed in inaccessible points. Information collected from various sensors of different modalities throughout the aircraft is then fused in order to provide a more comprehensive image of the aircraft structural health. Sensor level fusion along with decision quality information is used, in order to enhance detection performance.

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

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

  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. Opportunistic Hybrid Transport Protocol (OHTP) for Cognitive Radio Ad Hoc Sensor Networks.

    PubMed

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

    2015-12-15

    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.

  7. Energy-efficient algorithm for broadcasting in ad hoc wireless sensor networks.

    PubMed

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

    2013-04-12

    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.

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

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

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

    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.

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

  13. Efficient target tracking with an ad-hoc network of omni-directional sensors

    NASA Astrophysics Data System (ADS)

    Atanassov, Kalin

    2015-05-01

    Ad-hoc networks of omni-directional sensors provide an efficient means to obtain low-cost, easily deployed, reliable target tracking systems. To remove target position dependency on the target power, a transformation to another coordinate system is introduced. It can be shown that the problem of sensing target position with omni-directional sensors can be adapted to the conventional Kalman filter framework. To validate the proposed methodology, first an analysis is conducted to show that by converting to log-ratio space and at the same time reducing the number of parameters to track, no information about target position is lost. The analysis is done by deriving the CRLBs for the position estimation error in both original and transformed spaces and showing that they are the same. Second, to show how the traditional Kalman filter framework performs, a particle filter that works off the transformed coordinates is designed. The number of particles is selected to be sufficiently large and the result is used as ground truth to compare with the performance of the Kalman tracker. The comparisons are done for different target movement speeds and sensor density modes. The results provide an insight into Kalman tracker performance in different situations.

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

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

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

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

  18. FRCA: A Fuzzy Relevance-Based Cluster Head Selection Algorithm for Wireless Mobile Ad-Hoc Sensor Networks

    PubMed Central

    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

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

  20. Trust Based Routing in Ad Hoc Network

    NASA Astrophysics Data System (ADS)

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

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

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

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

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

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

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

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

  7. Non-Repudiation in Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Tandel, Purvi; Valiveti, Sharada; Agrawal, K. P.; Kotecha, K.

    With the phenomenal growth of the Internet and open networks in general, security services, such as non-repudiation, become crucial to many applications. In conventional network non-repudiation is achieved using protocols involving TTP. Non-repudiation in conventional network is achieved using different protocols, but in ad hoc networks due to mobility problem we can't use trusted third party (TTP). There is a scope to implement a non-repudiation protocol, which satisfies non-repudiation requirements emerged by the application in a peer-to-peer network.

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

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

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

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

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

  13. Spontaneous ad hoc mobile cloud computing network.

    PubMed

    Lacuesta, Raquel; Lloret, Jaime; 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.

  14. Public-key management in mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Lin, Haifeng; Jiang, Anna; Bai, Di; Liu, Yunfei

    A mobile ad hoc network is a new type of wireless networking paradigm which, in general, consists of solely mobile hosts and dispenses with infrastructure. One main challenge in design of mobile ad hoc networks is the vulnerability to security attacks. Without physical boundaries, a mobile ad hoc network faces many more security threats than a wired network does. Therefore the security of mobile ad hoc networks is one of the major research interests in wireless communications. In contrast with conventional networks, public key management protocols of mobile ad hoc networks do not based on infrastructures, where we can use trusted third parties or centralized servers for key management. This is because that the topology of mobile ad hoc networks is unknown due to link and node failures and to node mobility. For these factors, traditional key management solutions which require on-line trusted authorities or certificate authorities are not suitable for securing mobile ad hoc networks. In this report, we first review some existed public-key management protocols for mobile ad hoc networks and after that we propose a fully distributed public -key management model which does not need the third trusted authority.

  15. Opportunistic Information Retrieval in Sparsely Connected Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Chuah, Mooi-Choo; Han, Jian-Bin

    With the advancement in technology, many users carry wireless computing de-vices e.g., PDAs, cell-phones etc. Such devices can form mobile ad hoc networks and communicate with one another via the help of intermediate nodes. Such ad hoc networks are very useful in several scenarios e.g., battlefield operations, vehicular ad hoc networks and disaster response scenarios. The ability to access important information in these scenarios is highly critical. Many ad hoc routing schemes have been designed for ad hoc networks but such routing schemes are not useful in some challenging network scenarios where the nodes have intermittent connectivity and suffer frequent partitioning. Recently, disruption tolerant network technologies [5, 12] have been proposed to allow nodes in such extreme network-ing environment to communicate with one another. Several DTN routing schemes [4, 14] have been proposed.

  16. Asynchronous ad hoc network discovery for low-power systems

    NASA Astrophysics Data System (ADS)

    Joslin, Todd W.

    2008-04-01

    Unattended ground sensor systems (UGS) have become an important part of a covert monitoring arsenal in operations throughout the world. With the increased use of unattended ground sensor systems, there is a need to develop communication architectures that allow the systems to have simple emplacement procedures, have a long mission life, and be difficult to detect. Current ad-hoc networking schemes use either a network beacon, extensive preambles, or guaranteed time synchronization to achieve reliable communications. When used in wireless sensor systems many of these schemes waste power through unnecessary transmissions. These schemes compromise the covert nature of UGS through excess transmissions for a non-beaconed network or the periodic beaconing in a beaconed network. These factors are detrimental to sensor systems, which chiefly rely on being covert and low-power. This paper discusses a nonarbitrated, non-GPS synchronized, beaconless approach to discovering, joining, and reliably transmitting and receiving in a low-power ad-hoc wireless sensor network. This solution is capable of performing network discovery upon demand to get an initial alignment with other nodes in the network. Once aligned, end points maintain alignment and can predict when other nodes will be available to listen.

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

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

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

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

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

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

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

  4. Distributed data fusion over an ad hoc network

    NASA Astrophysics Data System (ADS)

    Anderson, Sean; Binns, Lewis A.; Collins, Peter R. C.; Cooke, Andrew; Greenway, Phil; Valachis, Dimitris

    2002-08-01

    We have been developing a decentralised architecture for data fusion for several years. In this architecture, sensing nodes, each with their own processing, are networked together. Previously, we have researched fully connected networks, tree-connected networks, and networks with loops, and have developed a range of theoretical and empirical results for dynamic networks. Here we report the results obtained from building and demonstrating a decentralised data fusion system in which the nodes are connected via an ad hoc network. Several vision based tracking nodes are linked via a wireless LAN. We use UDP to establish local routing tables within the network whenever a node joins, and TCP/IP to provide point to point communications within the network. We show that the resulting data fusion system is modular, scalable and fault tolerant. In particular, we demonstrate robustness to nodes joining and leaving the network, either by choice or as a result of link drop-out. In addition to experimental results from the project, we present some thoughts on how the technology could be applied to large scale, heterogeneous sensor networks.

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

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

  7. CSR: Constrained Selfish Routing in Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    Bassem, Christine; Bestavros, Azer

    Routing protocols for ad-hoc networks assume that the nodes forming the network are either under a single authority, or else that they would be altruistically forwarding data for other nodes with no expectation of a return. These assumptions are unrealistic since in ad-hoc networks, nodes are likely to be autonomous and rational (selfish), and thus unwilling to help unless they have an incentive to do so. Providing such incentives is an important aspect that should be considered when designing ad-hoc routing protocols. In this paper, we propose a dynamic, decentralized routing protocol for ad-hoc networks that provides incentives in the form of payments to intermediate nodes used to forward data for others. In our Constrained Selfish Routing (CSR) protocol, game-theoretic approaches are used to calculate payments (incentives) that ensure both the truthfulness of participating nodes and the fairness of the CSR protocol. We show through simulations that CSR is an energy efficient protocol and that it provides lower communication overhead in the best and average cases compared to existing approaches.

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

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

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

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

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

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

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

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

  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. Enhancement of node connectivity for mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Shi, Xiyu; Li, Fanzhi; Adams, Christopher

    2006-05-01

    For secure mobile wireless networks whose topologies are changed dynamically in insecure environments, mobile users need to keep in contact with each other for the purpose of user authentications. For instance, the network formed by a group of soldiers equipped with wireless devices in a battlefield. Maintaining a high connectivity is crucial in such networks in order to authenticate scattered individuals and to be able to communicate with each other. To establish connections, different mobile ad hoc network routing protocols have been developed. However, much research has shown that these protocols are incapable of maintaining high connectivity when the node density is lower in the network. This paper proposes a mechanism to enhance the node connectivity, which is specifically effective for mobile ad hoc networks with lower node densities. It selects some nodes with larger transmission power as strategic nodes to assist in establishing connections with remote nodes, which are unable to connect with otherwise. The strategic nodes have the ability to connect with each other. Whenever a remote mobile node has a request to connect to another remote mobile node, the strategic nodes function as normal mobile nodes and may forward the connection requests to the desired remote destination node. The mechanism is simulated in different scenarios with various node densities, and the results show that the node connectivity is generally enhanced with the benefit of lower node density network, gaining significant improvement.

  19. Ubiquitous and Secure Certificate Service for Wireless Ad Hoc Network

    NASA Astrophysics Data System (ADS)

    Ge, Meng; Lam, Kwok-Yan; Li, Jianbin; Chung, Siu-Leung

    Wireless ad hoc network is one of the most suitable platforms for providing communication services to support mobile applications in public areas where no fixed communication infrastructure exists. However, due to the open nature of wireless links and lack of security infrastructure in an ad hoc network environment, applications operating on ad hoc network platforms are subjected to non-trivial security challenges. Asymmetric key management, which is widely adopted to be an effective basis for security services in an open network environment, typically plays a crucial role in meeting the security requirements of such applications. In this paper, we propose a secure asymmetric key management scheme, the Ubiquitous and Secure Certificate Service (USCS), which is based on a variant of the Distributed Certificate Authority (DCA) - the Fully Distributed Certificate Authority (FDCA). Similar to FDCA, USCS introduces the presence of 1-hop neighbors which hold shares of DCA's private signature key, and can collaborate to issue certificates, thereby providing asymmetric key management service. Both USCS and FDCA aim to achieve higher availability than the basic DCA scheme; however, USCS is more secure than FDCA in that the former achieves high availability by distributing existing shares to new members, rather than generating new shares as the FDCA scheme does. In order to realise the high availability potential of USCS, a share selection algorithm is also proposed. Experimental results demonstrated that USCS is a more secure approach of the DCA scheme in that it can achieve stronger security than FDCA while attaining high availability similar to that of FDCA. Experiments also showed that USCS incurs only moderate communication overheads.

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

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

  2. Security Condition for Exact Localization in Wireless Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Kim, Jin Seok; Yum, Dae Hyun; Hong, Sung Je; Kim, Jong; Lee, Pil Joong

    As deployment of wireless ad hoc networks for location-based services increases, accurate localization of mobile nodes is becoming more important. Localization of a mobile node is achieved by estimating its distances from a group of anchor nodes. If some anchors are malicious and colluding, localization accuracy cannot be guaranteed. In this article, we present the security conditions for exact localization in the presence of colluding malicious anchors. We first derive the minimum number of truthful anchors that are required for exact localization in 2-D Euclidean space where some anchors may be collinear. Second, we extend our security condition to 3-D localization where some anchors may be coplanar.

  3. On service differentiation in mobile Ad Hoc networks.

    PubMed

    Zhang, Shun-liang; Ye, Cheng-qing

    2004-09-01

    A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can provide different kinds of QoS (Quality of Service) for various applications. Admission controllers determine a committed bandwidth based on the reserved bandwidth of flows and the source utilization of networks. Packets are marked when entering into networks by markers according to the committed rate. By the mark in the packet header, intermediate nodes handle the received packets in different manners to provide applications with the QoS corresponding to the pre-negotiated profile. Extensive simulation experiments showed that the proposed mechanism can provide QoS guarantee to assured service traffic and increase the channel utilization of networks.

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

  6. A Trust Based Clustering Framework for Securing Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Chatterjee, Pushpita; Sengupta, Indranil; Ghosh, S. K.

    In this paper we present a distributed self-organizing trust based clustering framework for securing ad hoc networks. The mobile nodes are vulnerable to security attacks, so ensuring the security of the network is essential. To enhance security, it is important to evaluate the trustworthiness of nodes without depending on central authorities. In our proposal the evidence of trustworthiness is captured in an efficient manner and from broader perspectives including direct interactions with neighbors, observing interactions of neighbors and through recommendations. Our prediction scheme uses a trust evaluation algorithm at each node to calculate the direct trust rating normalized as a fuzzy value between zero and one. The evidence theory of Dempster-Shafer [9], [10] is used in order to combine the evidences collected by a clusterhead itself and the recommendations from other neighbor nodes. Moreover, in our scheme we do not restrict to a single gateway node for inter cluster routing.

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

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

  9. Extending Service Area of IEEE 802.11 Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Choi, Woo-Yong

    2012-06-01

    According to the current IEEE 802.11 wireless LAN standards, IEEE 802.11 ad hoc networks have the limitation that all STAs (Stations) are in the one-hop transmission range of each other. In this paper, to alleviate the limitation of IEEE 802.11 ad hoc networks we propose the efficient method for selecting the most appropriate pseudo AP (Access Point) from among the set of ad hoc STAs and extending the service area of IEEE 802.11 ad hoc networks by the pseudo AP's relaying the internal traffic of IEEE 802.11 ad hoc networks. Numerical examples show that the proposed method significantly extends the service area of IEEE 802.11 ad hoc networks.

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

  11. Preferential survival in models of complex ad hoc networks

    NASA Astrophysics Data System (ADS)

    Kong, Joseph S.; Roychowdhury, Vwani P.

    2008-05-01

    There has been a rich interplay in recent years between (i) empirical investigations of real-world dynamic networks, (ii) analytical modeling of the microscopic mechanisms that drive the emergence of such networks, and (iii) harnessing of these mechanisms to either manipulate existing networks, or engineer new networks for specific tasks. We continue in this vein, and study the deletion phenomenon in the web by the following two different sets of websites (each comprising more than 150,000 pages) over a one-year period. Empirical data show that there is a significant deletion component in the underlying web networks, but the deletion process is not uniform. This motivates us to introduce a new mechanism of preferential survival (PS), where nodes are removed according to the degree-dependent deletion kernel, D(k)∝k, with α≥0. We use the mean-field rate equation approach to study a general dynamic model driven by Preferential Attachment (PA), Double PA (DPA), and a tunable PS (i.e., with any α>0), where c nodes ( c<1) are deleted per node added to the network, and verify our predictions via large-scale simulations. One of our results shows that, unlike in the case of uniform deletion (i.e., where α=0), the PS kernel when coupled with the standard PA mechanism, can lead to heavy-tailed power-law networks even in the presence of extreme turnover in the network. Moreover, a weak DPA mechanism, coupled with PS, can help to make the network even more heavy-tailed, especially in the limit when deletion and insertion rates are almost equal, and the overall network growth is minimal. The dynamics reported in this work can be used to design and engineer stable ad hoc networks and explain the stability of the power-law exponents observed in real-world networks.

  12. Scaling of critical connectivity of mobile ad hoc networks.

    PubMed

    Wang, Li; Zhu, Chen-Ping; Gu, Zhi-Ming

    2008-12-01

    In this paper, critical global connectivity of mobile ad hoc networks (MANETs) is investigated. We model the two-dimensional plane on which nodes move randomly with a triangular lattice. Demanding the best communication of the network, we account the global connectivity eta as a function of occupancy sigma of sites in the lattice by mobile nodes. Critical phenomena of the connectivity for different transmission ranges r are revealed by numerical simulations, and these results fit well to the analysis based on the assumption of homogeneous mixing. Scaling behavior of the connectivity is found as eta approximately f(R;{beta}sigma) , where R=(r-r_{0})r_{0} , r_{0} is the length unit of the triangular lattice, and beta is the scaling index in the universal function f(x) . The model serves as a sort of geometric distance-dependent site percolation on dynamic complex networks. Moreover, near each critical sigma_{c}(r) corresponding to certain transmission range r , there exists a cutoff degree k_{c} below which the clustering coefficient of such self-organized networks keeps a constant while the averaged nearest-neighbor degree exhibits a unique linear variation with the degree k , which may be useful to the designation of real MANETs.

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

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

  15. Performance improvement in geographic routing for Vehicular Ad Hoc Networks.

    PubMed

    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

  16. Performance improvement in geographic routing for Vehicular Ad Hoc Networks.

    PubMed

    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.

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

  18. Experimental characterization and mitigation of turbulence induced signal fades within an ad hoc FSO network.

    PubMed

    Perez, Joaquin; Zvanovec, Stanislav; Ghassemlooy, Zabih; Popoola, Wasiu O

    2014-02-10

    Optical beams propagating through the turbulent atmospheric channel suffer from both the attenuation and phase distortion. Since future wireless networks are envisaged to be deployed in the ad hoc mesh topology, this paper presents the experimental laboratory characterization of mitigation of turbulence induced signal fades for two ad hoc scenarios. Results from measurements of the thermal structure constant along the propagation channels, changes of the coherence lengths for different turbulence regimes and the eye diagrams for partially correlated turbulences in free space optical channels are discussed. Based on these results future deployment of optical ad hoc networks can be more straightforwardly planned.

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

  20. A group based key sharing and management algorithm for vehicular ad hoc networks.

    PubMed

    Khan, Zeeshan Shafi; Moharram, Mohammed Morsi; Alaraj, Abdullah; 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.

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

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

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

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

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

  6. Hybrid Packet-Pheromone-Based Probabilistic Routing for Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Kashkouli Nejad, Keyvan; Shawish, Ahmed; Jiang, Xiaohong; Horiguchi, Susumu

    Ad-Hoc networks are collections of mobile nodes communicating using wireless media without any fixed infrastructure. Minimal configuration and quick deployment make Ad-Hoc networks suitable for emergency situations like natural disasters or military conflicts. The current Ad-Hoc networks can only support either high mobility or high transmission rate at a time because they employ static approaches in their routing schemes. However, due to the continuous expansion of the Ad-Hoc network size, node-mobility and transmission rate, the development of new adaptive and dynamic routing schemes has become crucial. In this paper we propose a new routing scheme to support high transmission rates and high node-mobility simultaneously in a big Ad-Hoc network, by combining a new proposed packet-pheromone-based approach with the Hint Based Probabilistic Protocol (HBPP) for congestion avoidance with dynamic path selection in packet forwarding process. Because of using the available feedback information, the proposed algorithm does not introduce any additional overhead. The extensive simulation-based analysis conducted in this paper indicates that the proposed algorithm offers small packet-latency and achieves a significantly higher delivery probability in comparison with the available Hint-Based Probabilistic Protocol (HBPP).

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

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

  9. Mobile agent and multilayer integrated distributed intrusion detection model for clustering ad hoc networks

    NASA Astrophysics Data System (ADS)

    Feng, Jianxin; Wang, Guangxing

    2004-04-01

    Ad hoc networks do not depend on any predefined infrastructure or centralized administration to operate. Their security characters require more complex security preventions. As the second line of defense, Intrusion detection is the necessary means of getting the high survivability. In this paper the security characters of ad hoc networks and the related contents of intrusion detection are discussed. Mobile Agent and Multi-layer Integrated Distributed Intrusion Detection Model (MAMIDIDM) and a heuristic global detection algorithm are proposed tentatively by combining the mobile agent technology with the multi-layer conception. This heuristic global detection algorithm combines the mobile agent detection engine with the multi-layer detection engines and analyzes the results obtained by the corresponding detection engines. MAMIDIDM has the better flexibility and extensibility, can execute the intrusion detection in clustering ad hoc networks effectively.

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

  11. Multicasting in Wireless Communications (Ad-Hoc Networks): Comparison against a Tree-Based Approach

    NASA Astrophysics Data System (ADS)

    Rizos, G. E.; Vasiliadis, D. C.

    2007-12-01

    We examine on-demand multicasting in ad hoc networks. The Core Assisted Mesh Protocol (CAMP) is a well-known protocol for multicast routing in ad-hoc networks, generalizing the notion of core-based trees employed for internet multicasting into multicast meshes that have much richer connectivity than trees. On the other hand, wireless tree-based multicast routing protocols use much simpler structures for determining route paths, using only parent-child relationships. In this work, we compare the performance of the CAMP protocol against the performance of wireless tree-based multicast routing protocols, in terms of two important factors, namely packet delay and ratio of dropped packets.

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

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

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

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

  16. Reinforcement Learning for Routing in Cognitive Radio Ad Hoc Networks

    PubMed Central

    Al-Rawi, Hasan A. A.; Mohamad, Hafizal; 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

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

  18. Teachers' Support with Ad-Hoc Collaborative Networks

    ERIC Educational Resources Information Center

    Cortez, C.; Nussbaum, M.; Lpez, X.; Rodrguez, P.; Santelices, R.; Rosas, R.; Marianov, V.

    2005-01-01

    Efforts to improve the educational process must focus on those most responsible for implementing it: the teachers. It is with them in mind that we propose a face-to-face computer-supported collaborative learning system that uses wirelessly networked hand-held computers to create an environment for helping students assimilate and transfer…

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

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

    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.

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

  2. Group Monitoring in Mobile Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    Gaba, Albana; Voulgaris, Spyros; van Steen, Maarten

    Maintaining bonds of cohesion between members of small groups in densely populated venues (e.g., a family in an amusement park, or some friends in a stadium) is increasingly gaining interest, both as a safety measure against malicious activity and as a convenient tool to prevent group splitting. Note that the use of mobile phones is often ruled out in such scenarios, due to extreme network load. Current solutions are typically based on custom installations of antennas, centralized control, and user devices with high transmission power.

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

  4. Artificial neural networks for closed loop control of in silico and ad hoc type 1 diabetes.

    PubMed

    Fernandez de Canete, J; Gonzalez-Perez, S; Ramos-Diaz, J C

    2012-04-01

    The closed loop control of blood glucose levels might help to reduce many short- and long-term complications of type 1 diabetes. Continuous glucose monitoring and insulin pump systems have facilitated the development of the artificial pancreas. In this paper, artificial neural networks are used for both the identification of patient dynamics and the glycaemic regulation. A subcutaneous glucose measuring system together with a Lispro insulin subcutaneous pump were used to gather clinical data for each patient undergoing treatment, and a corresponding in silico and ad hoc neural network model was derived for each patient to represent their particular glucose-insulin relationship. Based on this nonlinear neural network model, an ad hoc neural network controller was designed to close the feedback loop for glycaemic regulation of the in silico patient. Both the neural network model and the controller were tested for each patient under simulation, and the results obtained show a good performance during food intake and variable exercise conditions.

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

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

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

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

  9. A lightweight secure routing algorithm for ad hoc networks with free-space optics

    NASA Astrophysics Data System (ADS)

    Xu, Zhong; Dai, Guanzhong; Zhang, Guoqing; Liu, Xue; Yang, Deming

    2007-11-01

    Nowadays, there are some works with free-space laser communication system, but security issues of this network are always neglected. We present an efficient online/offline routing based on identity-based signature for ad hoc networks with Free-Space-Optics (FSO). The protocol is especially suitable for ad hoc networks with FSO because the major computational overhead is shifted to the offline phase, whereas the online phase requires only a very low computational overhead to achieve a full scale of authentication. In addition, since the signature scheme uses an identity-based cryptosystem, it does not need to maintain a public key directory and to exchange any certificate. The effectiveness of our protocol is simulated using QualNet tools.

  10. A Face Centered Cubic Key Agreement Mechanism for Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Askoxylakis, Ioannis G.; Markantonakis, Konstantinos; Tryfonas, Theo; May, John; Traganitis, Apostolos

    Mobile ad hoc networking is an operating mode for rapid mobile node networking. Each node relies on adjacent nodes in order to achieve and maintain connectivity and functionality. Security is considered among the main issues for the successful deployment of mobile ad hoc networks (MANETs). In this paper we introduce a weak to strong authentication mechanism associated with a multiparty contributory key establishment method. The latter is designed for MANETs with dynamic changing topologies, due to continuous flow of incoming and departing nodes. We introduce a new cube algorithm based on the face-centered cubic (FCC) structure. The proposed architecture employs elliptic curve cryptography, which is considered more efficient for thin clients where processing power and energy consumption are significant constraints.

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

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

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

    PubMed

    Vara, M Isabel; Campo, Celeste

    2015-07-20

    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.

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

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

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

  17. Distributed generation of shared RSA keys in mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    Liu, Yi-Liang; Huang, Qin; Shen, Ying

    2005-12-01

    Mobile Ad Hoc Networks is a totally new concept in which mobile nodes are able to communicate together over wireless links in an independent manner, independent of fixed physical infrastructure and centralized administrative infrastructure. However, the nature of Ad Hoc Networks makes them very vulnerable to security threats. Generation and distribution of shared keys for CA (Certification Authority) is challenging for security solution based on distributed PKI(Public-Key Infrastructure)/CA. The solutions that have been proposed in the literature and some related issues are discussed in this paper. The solution of a distributed generation of shared threshold RSA keys for CA is proposed in the present paper. During the process of creating an RSA private key share, every CA node only has its own private security. Distributed arithmetic is used to create the CA's private share locally, and that the requirement of centralized management institution is eliminated. Based on fully considering the Mobile Ad Hoc network's characteristic of self-organization, it avoids the security hidden trouble that comes by holding an all private security share of CA, with which the security and robustness of system is enhanced.

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

  19. Performance Impacts of Lower-Layer Cryptographic Methods in Mobile Wireless Ad Hoc Networks

    SciTech Connect

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

    2002-10-01

    In high consequence systems, all layers of the protocol stack need security features. If network and data-link layer control messages are not secured, a network may be open to adversarial manipulation. The open nature of the wireless channel makes mobile wireless mobile ad hoc networks (MANETs) especially vulnerable to control plane manipulation. The objective of this research is to investigate MANET performance issues when cryptographic processing delays are applied at the data-link layer. The results of analysis are combined with modeling and simulation experiments to show that network performance in MANETs is highly sensitive to the cryptographic overhead.

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

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

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

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

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

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

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

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

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

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

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

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

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

  13. Adaptive Reliable Routing Protocol Using Combined Link Stability Estimation for Mobile Ad hoc Networks

    NASA Astrophysics Data System (ADS)

    Vadivel, R.; Bhaskaran, V. Murali

    2010-10-01

    The main reason for packet loss in ad hoc networks is the link failure or node failure. In order to increase the path stability, it is essential to distinguish and moderate the failures. By knowing individual link stability along a path, path stability can be identified. In this paper, we develop an adaptive reliable routing protocol using combined link stability estimation for mobile ad hoc networks. The main objective of this protocol is to determine a Quality of Service (QoS) path along with prolonging the network life time and to reduce the packet loss. We calculate a combined metric for a path based on the parameters Link Expiration Time, Node Remaining Energy and Node Velocity and received signal strength to predict the link stability or lifetime. Then, a bypass route is established to retransmit the lost data, when a link failure occurs. By simulation results, we show that the proposed reliable routing protocol achieves high delivery ratio with reduced delay and packet drop.

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

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

  16. A robust cross-layer metric for routing protocol in mobile wireless ad hoc networks

    NASA Astrophysics Data System (ADS)

    Mucchi, Lorenzo; Chisci, Luigi; Fabbrini, Luca; Giovannetti, Giulio

    2012-12-01

    In a mobile ad-hoc network (MANET) where Mobile Nodes (MNs) self-organize to ensure the communication over radio links, routing protocols clearly play a significant role. In future MANETs, protocols should provide routing under full mobility, power constraints, fast time-varying channels, and nodes subject to high loading. In this article, a novel robust routing protocol, named distributed X-layer fastest path (DXFP), is proposed. The protocol is based on a cross-layer metric which is robust against the time-variations of the network as far as topology (mobility), congestion of the nodes and channel quality (fading, power constraints) are concerned. All these features are integrated in a single physical cost, i.e., the network crossing time, which has to be minimized. Furthermore, several routes from source to destination are stored for a given data flow to efficiently face the disconnections which frequently occur in MANETs. It is shown that the DXFP protocol, though locally operating in a fully distributed way within the MNs, provides, for each data flow, the optimum routes according to the considered metric. The DXFP protocol has been compared with two of the most commonly used routing protocols for MANETs, i.e., dynamic source routing and ad hoc on-demand distance vector, showing significant improvements in performance and robustness.

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

  18. Trusted Routing Based on Dynamic Trust Mechanism in Mobile Ad-Hoc Networks

    NASA Astrophysics Data System (ADS)

    Peng, Sancheng; Jia, Weijia; Wang, Guojun; Wu, Jie; Guo, Minyi

    Due to the distributed nature, mobile ad-hoc networks (MANETs) are vulnerable to various attacks, resulting in distrusted communications. To achieve trusted communications, it is important to build trusted routes in routing algorithms in a self-organizing and decentralized fashion. This paper proposes a trusted routing to locate and to preserve trusted routes in MANETs. Instead of using a hard security mechanism, we employ a new dynamic trust mechanism based on multiple constraints and collaborative filtering. The dynamic trust mechanism can effectively evaluate the trust and obtain the precise trust value among nodes, and can also be integrated into existing routing protocols for MANETs, such as ad hoc on-demand distance vector routing (AODV) and dynamic source routing (DSR). As an example, we present a trusted routing protocol, based on dynamic trust mechanism, by extending DSR, in which a node makes a routing decision based on the trust values on its neighboring nodes, and finally, establish a trusted route through the trust values of the nodes along the route in MANETs. The effectiveness of our approach is validated through extensive simulations.

  19. Distributed Spectrum Sharing for Video Streaming in Cognitive Radio Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Ding, Lei; Pudlewski, Scott; Melodia, Tommaso; Batalama, Stella; Matyjas, John D.; Medley, Michael J.

    A distributed joint routing and spectrum sharing algorithm for video streaming applications over cognitive radio ad hoc networks is proposed in this article. The proposed cross-layer control scheme dynamically allocates routes, spectrum and power to maximize the network throughput under the constraints posed by delay-sensitive video applications. The algorithm evaluates the expected delay of competing flows in single-hop and two-hop networks considering the time-varying spectrum condition and occupancy, traffic characteristics, and the condition of queues at intermediate nodes. Simulation results show that the proposed algorithm significantly reduces the packet loss rate and improves the average peak signal-to-noise ratio (PSNR) of the received video streams.

  20. Reducing Congestion in Obstructed Highways with Traffic Data Dissemination Using Ad hoc Vehicular Networks

    NASA Astrophysics Data System (ADS)

    Hewer, Thomas D.; Nekovee, Maziar; Coveney, Peter V.

    2010-12-01

    Vehicle-to-vehicle communications can be used effectively for intelligent transport systems (ITSs) and location-aware services. The ability to disseminate information in an ad hoc fashion allows pertinent information to propagate faster through a network. In the realm of ITS, the ability to spread warning information faster and further is of great advantage to receivers. In this paper we propose and present a message-dissemination procedure that uses vehicular wireless protocols to influence vehicular flow, reducing congestion in road networks. The computational experiments we present show how a car-following model and lane-change algorithm can be adapted to "react" to the reception of information. This model also illustrates the advantages of coupling together with vehicular flow modelling tools and network simulation tools.

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

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

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

    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.

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

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

    PubMed

    Chen, Huifang; Ge, Linlin; Xie, Lei

    2015-07-14

    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.

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

  8. A Secure Routing Using Reliable 1-Hop Broadcast in Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Park, Seungjin; Yoo, Seong-Moo

    Among many ways to achieve security in wireless mobile ad hoc networks, the approach taken in this paper is to ensure that all nodes in the network receive critical information on security such as public keys. To achieve this, a reliable global broadcasting of the information must be accomplished, which in turn, relies on a reliable 1-hop broadcasting in which a message from the source node is guaranteed to be delivered to all nodes within the source node's transmission range. This paper presents a MAC protocol that guarantees a reliable and efficient 1-hop broadcast. The unique feature of the proposed algorithm is that each node is able to dynamically adjust its transmission range depending on the node density around it. Simulation results show the effectiveness of the proposed algorithm.

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

  10. Effective route maintenance and restoration schemes in mobile ad hoc networks.

    PubMed

    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.

  11. Security enhancement for mobile ad hoc networks routing with OLSRv2

    NASA Astrophysics Data System (ADS)

    Wei, Zhexiong; Tang, Helen; Yu, F. Richard; Wang, Maoyu

    2013-05-01

    Some features of Mobile Ad hoc Networks (MANETs), including dynamic membership, topology, and open wireless medium, introduce a variety of security risks. Malicious nodes can drop or modify packets that are received from other nodes. These malicious activities may seriously affect the availability of services in MANETs. Therefore, secure routing in MANETs has emerged as an important MANET research area. In this paper, we propose a scheme that enhances the security of Optimal Link State Routing version 2 (OLSRv2) in MANETs based on trust. In the proposed scheme, more accurate trust can be obtained by considering different types of packets and other important factors that may cause dropping packets in friendly nodes, such as buffer overflows and unreliable wireless connections. Simulation results are presented to demonstrate the effectiveness of the proposed scheme.

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

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

    PubMed

    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.

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

  15. Data delivery method based on neighbor nodes' information in a mobile ad hoc network.

    PubMed

    Kashihara, Shigeru; 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.

  16. Secure and Fair Cluster Head Selection Protocol for Enhancing Security in Mobile Ad Hoc Networks

    PubMed Central

    Paramasivan, B.; Kaliappan, M.

    2014-01-01

    Mobile ad hoc networks (MANETs) are wireless networks consisting of number of autonomous mobile devices temporarily interconnected into a network by wireless media. MANETs become one of the most prevalent areas of research in the recent years. Resource limitations, energy efficiency, scalability, and security are the great challenging issues in MANETs. Due to its deployment nature, MANETs are more vulnerable to malicious attack. The secure routing protocols perform very basic security related functions which are not sufficient to protect the network. In this paper, a secure and fair cluster head selection protocol (SFCP) is proposed which integrates security factors into the clustering approach for achieving attacker identification and classification. Byzantine agreement based cooperative technique is used for attacker identification and classification to make the network more attack resistant. SFCP used to solve this issue by making the nodes that are totally surrounded by malicious neighbors adjust dynamically their belief and disbelief thresholds. The proposed protocol selects the secure and energy efficient cluster head which acts as a local detector without imposing overhead to the clustering performance. SFCP is simulated in network simulator 2 and compared with two protocols including AODV and CBRP. PMID:25143986

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

  18. Secure and fair cluster head selection protocol for enhancing security in mobile ad hoc networks.

    PubMed

    Paramasivan, B; Kaliappan, M

    2014-01-01

    Mobile ad hoc networks (MANETs) are wireless networks consisting of number of autonomous mobile devices temporarily interconnected into a network by wireless media. MANETs become one of the most prevalent areas of research in the recent years. Resource limitations, energy efficiency, scalability, and security are the great challenging issues in MANETs. Due to its deployment nature, MANETs are more vulnerable to malicious attack. The secure routing protocols perform very basic security related functions which are not sufficient to protect the network. In this paper, a secure and fair cluster head selection protocol (SFCP) is proposed which integrates security factors into the clustering approach for achieving attacker identification and classification. Byzantine agreement based cooperative technique is used for attacker identification and classification to make the network more attack resistant. SFCP used to solve this issue by making the nodes that are totally surrounded by malicious neighbors adjust dynamically their belief and disbelief thresholds. The proposed protocol selects the secure and energy efficient cluster head which acts as a local detector without imposing overhead to the clustering performance. SFCP is simulated in network simulator 2 and compared with two protocols including AODV and CBRP.

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

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

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

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

    DOE PAGES

    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

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

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

  5. An artificial immune system for securing mobile ad hoc networks against intrusion attacks

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    2003-08-01

    To mitigate the problem of intrusion attacks by malicious nodes in mobile ad hoc networks (MANETs), security attributes and quantifiable trust levels, unique to the MANET's transient, self-organizing topology, augment or replace traditional protocol metrics of throughput, packet delay and hop-count in the ad hoc route discovery procedures. The new features are unique to the candidate security protocol, which views security as a quality metric to improve the relevance of the routes discovered by established reactive ad hoc routing protocols. Attributes of a secure route are identified in order to define the appropriate metrics to quantify the "level of security" associated with the protocol messaging and the detection of malicious activities by some intrusive nodes. A state vector of features and metrics based on the published Secure Routing Protocol (SRP) for MANETs is constructed to encode network security characteristics. This route discovery protocol mitigates the detrimental effects of various malicious behaviors to provide trustworthy connectivity information. The protocol ensures that fabricated, compromised, or replayed route replies would either be rejected or never reach the querying source node. In this paper, the pattern of values, taken by the state vector of the SRP features in the route request, discovery and reply operations, are analyzed to detect evidence of intrusion attacks by malicious nodes that could lead to denial of service and network shutdown. The pattern analysis applies a technique based on negative selection found in natural immune systems that can detect extraneous patterns in the (nonself) space that is the complement of vector values associated with correct route discovery and route maintenance. The immune system is well-suited to the distributed nature of the MANET. It does not rely on a central controller, but instead uses a distributed detection and response mechanism in order to respond to foreign invaders, mirroring the

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

  7. Efficient and Secure Self-Organized Public Key Management for Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Choi, Daeseon; Lee, Younho; Park, Yongsu; Jin, Seung-Hun; Yoon, Hyunsoo

    This paper presents a fully self-organized key management scheme for mobile ad hoc networks. Unlike most previous schemes, there is no priori shared secret or no priori trust relationship in the proposed scheme; every node plays the same role and carries out the same function of key management. The proposed scheme consists of (1) Handshaking (HS) and (2) Certificate request/reply (CRR) procedures. In HS, a node acquires the public key of the approaching node via a secure side channel. In CRR, a node requests certificates of a remote node via a radio channel to the nodes that it has HSed. If the number of received valid certificates that contain the same public key exceeds a given threshold, the node accepts the remote node's public key as valid. Security is rigorously analyzed against various known attacks and network costs are intensively analyzed mathematically. Using this analysis, we provide parameter selection guideline to optimize performance and to maintain security for diverse cases. Simulation results show that every node acquires the public keys of all other nodes at least 5 times faster than in a previous scheme.

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

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

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

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

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

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

    PubMed

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

    2016-03-26

    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.

  14. Delay-dependent asymptotic stability of mobile ad-hoc networks: A descriptor system approach

    NASA Astrophysics Data System (ADS)

    Yang, Juan; Yang, Dan; Huang, Bin; Zhang, Xiao-Hong; Luo, Jian-Lu

    2014-07-01

    In order to analyze the capacity stability of the time-varying-propagation and delay-dependent of mobile ad-hoc networks (MANETs), in this paper, a novel approach is proposed to explore the capacity asymptotic stability for the delay-dependent of MANETs based on non-cooperative game theory, where the delay-dependent conditions are explicitly taken into consideration. This approach is based on the Lyapunov—Krasovskii stability theory for functional differential equations and the linear matrix inequality (LMI) technique. A corresponding Lyapunov—Krasovskii functional is introduced for the stability analysis of this system with use of the descriptor and “neutral-type” model transformation without producing any additional dynamics. The delay-dependent stability criteria are derived for this system. Conditions are given in terms of linear matrix inequalities, and for the first time referred to neutral systems with the time-varying propagation and delay-dependent stability for capacity analysis of MANETs. The proposed criteria are less conservative since they are based on an equivalent model transformation. Furthermore, we also provide an effective and efficient iterative algorithm to solve the constrained stability control model. Simulation experiments have verified the effectiveness and efficiency of our algorithm.

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

    PubMed

    Ganeshkumar, P; 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.

  16. Enhancing the selection of backoff interval using fuzzy logic over wireless Ad Hoc networks.

    PubMed

    Ranganathan, Radha; Kannan, Kathiravan

    2015-01-01

    IEEE 802.11 is the de facto standard for medium access over wireless ad hoc network. The collision avoidance mechanism (i.e., random binary exponential backoff-BEB) of IEEE 802.11 DCF (distributed coordination function) is inefficient and unfair especially under heavy load. In the literature, many algorithms have been proposed to tune the contention window (CW) size. However, these algorithms make every node select its backoff interval between [0, CW] in a random and uniform manner. This randomness is incorporated to avoid collisions among the nodes. But this random backoff interval can change the optimal order and frequency of channel access among competing nodes which results in unfairness and increased delay. In this paper, we propose an algorithm that schedules the medium access in a fair and effective manner. This algorithm enhances IEEE 802.11 DCF with additional level of contention resolution that prioritizes the contending nodes according to its queue length and waiting time. Each node computes its unique backoff interval using fuzzy logic based on the input parameters collected from contending nodes through overhearing. We evaluate our algorithm against IEEE 802.11, GDCF (gentle distributed coordination function) protocols using ns-2.35 simulator and show that our algorithm achieves good performance.

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

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

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

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

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

  3. A Distributed and Cooperative Algorithm for the Detection and Elimination of Multiple Black Hole Nodes in Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Yu, Chang Wu; Wu, Tung-Kuang; Cheng, Rei-Heng; Yu, Kun-Ming; Chang, Shun Chao

    A mobile node in ad hoc networks may move arbitrarily and act as a router and a host simultaneously. Such a characteristic makes nodes in MANET vulnerable to potential attacks. The black hole problem, in which some malicious nodes pretend to be intermediate nodes of a route to some given destinations and drop packets that pass through it, is one of the major types of attack. In this paper, we propose a distributed and cooperative mechanism to tackle the black hole problem. The mechanism is distributed so that it suits the ad hoc nature of network, and nodes in the protocol cooperate so that they can analyze, detect, and eliminate possible multiple black-hole nodes in a more reliable fashion. Simulation results show that our method achieves a high black hole detection rate and good packet delivery rate, while the overhead is comparatively lower as the network traffic increases.

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

  5. A novel clustering algorithm for mobile ad hoc networks based on determination of virtual links' weight to increase network stability.

    PubMed

    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.

  6. Enabling real-time H.26L video services over wireless ad hoc networks using joint admission and transmission power control

    NASA Astrophysics Data System (ADS)

    Pei, Yong; Modestino, James W.; Qu, Qi; Wang, Xiaochun

    2003-06-01

    In a wireless ad hoc network, packets are sent from node-to-node in a multihop fashion until they reach the destination. In this paper we investigate the capacity of a wireless ad hoc network in supporting packet video transport. The ad hoc network consists of n homogeneous video users with each of them also serving as a relay node for other users. We investigate how the time delay aspects the video throughput in such an ad hoc network and how to provide a time-delay bounded packet video delivery service over such a network? The analytical results indicate that appropriate joint admission and power control have to be employed in order to efficiently utilize the network capacity while operating under the delay constraint as the distance between source and destination changes.

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

  8. Dynamic cooperative clustering based power assignment: network capacity and lifetime efficient topology control in cooperative ad hoc networks.

    PubMed

    Li, Xiao-Hong; Xiao, Ling; Wang, Dong

    2014-01-01

    Cooperative communication (CC) is used in topology control as it can reduce the transmission power and expand the transmission range. However, all previous research on topology control under the CC model focused on maintaining network connectivity and minimizing the total energy consumption, which would lead to low network capacity, transmission interruption, or even network paralysis. Meanwhile, without considering the balance of energy consumption in the network, it would reduce the network lifetime and greatly affect the network performance. This paper tries to solve the above problems existing in the research on topology control under the CC model by proposing a power assignment (DCCPA) algorithm based on dynamic cooperative clustering in cooperative ad hoc networks. The new algorithm clusters the network to maximize network capacity and makes the clusters communicate with each other by CC. To reduce the number of redundant links between clusters, we design a static clustering method by using Kruskal algorithm. To maximize the network lifetime, we also propose a cluster head rotating method which can reach a good tradeoff between residual energy and distance for the cluster head reselection. Experimental results show that DCCPA can improve 80% network capacity with Cooperative Bridges algorithm; meanwhile, it can improve 20% network lifetime.

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

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

  11. BCDP: Budget constrained and delay-bounded placement for hybrid roadside units in vehicular ad hoc networks.

    PubMed

    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

  12. BCDP: Budget constrained and delay-bounded placement for hybrid roadside units in vehicular ad hoc networks.

    PubMed

    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.

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

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

  15. Performance Evaluation Analysis of Group Mobility in Mobile Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Irshad, Ehtsham; Noshairwan, Wajahat; Shafiq, Muhammad; Khurram, Shahzada; Irshad, Azeem; Usman, Muhammad

    Mobility of nodes is an important issue in mobile adhoc networks (MANET). Nodes in MANET move from one network to another individually and in the form of group. In single node mobility scheme every node performs registration individually in new MANET whereas in group mobility scheme only one node in a group i.e group representative (GR) performs registration on behalf of all other nodes in the group and is assigned Care of Address (CoA). Internet protocol (IP) of all other nodes in the group remains same. Our simulated results prove that group mobility scheme reduces number of messages and consumes less time for registration of nodes as compared to single node mobility scheme. Thus network load is reduced in group mobility scheme. This research paper evaluates the performance of group mobility with single node mobility scheme. Test bed for this evaluation is based on Network Simulator 2 (NS-2) environment.

  16. A Proposal and Evaluation of Security Camera System at a Car Park in an Ad-Hoc Network

    NASA Astrophysics Data System (ADS)

    Uemura, Wataru; Murata, Masashi

    In recent year, ad-hoc network technology has gained attention, which consists of not access points and base stations but of wireless nodes. In this network, it is difficult to maintain the whole data flow because of the absence of access points as the network administrator when nodes share the data. This paper proposes the security camera system which has only nodes sharing the taken pictures and has the robustness against the data destroying. The sender node cannot know whether packets are received or not by neighboring nodes in broadcasting because of a unidirectional communication. So in our proposed method, the sender node selects the receiver node from neighboring nodes, and they communicate with each other. On the other hand, neighboring nodes listen to packets between the sender node and the receiver node. After that, this method guarantees nodes of more than 1 which receive a data in broadcasting. We construct the security camera system using wireless nodes with the IEEE 802.15.4 specification and show the performance for security. At last, using the simulator we show the efficiency in the large environment, and conclude this paper.

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

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

  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. Comparative Study of Vehicular Ad-hoc Network Mobility Models and Simulators

    NASA Astrophysics Data System (ADS)

    K. Patel, Mitul

    2012-06-01

    In this paper we have discussed about the number of automobiles that has been increased on the road in the past few years. Due to high density of vehicles, the potential threats and road accident is increasing. Wireless technology is aiming to equip technology in vehicles to reduce these factors by sending messages to each other. The vehicular safety application should be thoroughly tested before it is deployed in a real world to use. Simulator tool has been preferred over out door experiment because it simple, easy and cheap. VANET requires that a traffic and network simulator should be used together to perform this test. Many tools exist for this purpose but most of them have the problem with the proper interaction. Simulating vehicular networks with external stimulus to analyze its effect on wireless communication but to do this job a good simulator is also needed.

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

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

  3. Probabilistic monitoring in intrusion detection module for energy efficiency in mobile ad hoc networks

    NASA Astrophysics Data System (ADS)

    De Rango, Floriano; Lupia, Andrea

    2016-05-01

    MANETs allow mobile nodes communicating to each other using the wireless medium. A key aspect of these kind of networks is the security, because their setup is done without an infrastructure, so external nodes could interfere in the communication. Mobile nodes could be compromised, misbehaving during the multi-hop transmission of data, or they could have a selfish behavior to save energy, which is another important constraint in MANETs. The detection of these behaviors need a framework that takes into account the latest interactions among nodes, so malicious or selfish nodes could be detected also if their behavior is changed over time. The monitoring activity increases the energy consumption, so our proposal takes into account this issue reducing the energy required by the monitoring system, keeping the effectiveness of the intrusion detection system. The results show an improvement in the saved energy, improving the detection performance too.

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

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

  6. A maintenance scheme of communication link in mobile robot ad hoc networks based on potential field

    NASA Astrophysics Data System (ADS)

    Jiang, Hong; Jin, WenPing; Yang, GyoYing; Li, LeiMin

    2007-12-01

    Maintaining communication link in mobile robot networks between task robots and a control center is very important in some urgent application occasions such as remote danger detections. To offer a reliable multi-hop communication link, a link maintaining scheme based on artificial potential field is presented. The scheme is achieved by a task robot and communication relay ones. The task robot performs predefined tasks, and relay ones are simple robots which form a communication relay chain. When robots move towards destination in formation, a kind of attractive force created by communication quality is added to traditional potential field, and relay robots follow the task robot and automatically stop at adequate locations to form a relay chain from the control station to the task robot. In order to increase relay usage efficiency, when some relays are replaced by other short cut relays, the redundant relays can be reused by initiating another moving toward specified location. Simulation results show that the scheme can provide a reliable multi-hop communication link, and that the communication connection can be obtained through minimal number of relays.

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

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

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

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

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

  13. Effective Ad-Hoc Committees.

    ERIC Educational Resources Information Center

    Young, David G.

    1983-01-01

    Ad-hoc committees may be symbolic, informational, or action committees. A literature survey indicates such committees' structural components include a suprasystem and three subsystems involving linkages, production, and implementation. Other variables include size, personal factors, and timing. All the factors carry implications about ad-hoc…

  14. Vehicle monitoring under Vehicular Ad-Hoc Networks (VANET) parameters employing illumination invariant correlation filters for the Pakistan motorway police

    NASA Astrophysics Data System (ADS)

    Gardezi, A.; Umer, T.; Butt, F.; Young, R. C. D.; Chatwin, C. R.

    2016-04-01

    A spatial domain optimal trade-off Maximum Average Correlation Height (SPOT-MACH) filter has been previously developed and shown to have advantages over frequency domain implementations in that it can be made locally adaptive to spatial variations in the input image background clutter and normalised for local intensity changes. The main concern for using the SPOT-MACH is its computationally intensive nature. However in the past enhancements techniques were proposed for the SPOT-MACH to make its execution time comparable to its frequency domain counterpart. In this paper a novel approach is discussed which uses VANET parameters coupled with the SPOT-MACH in order to minimise the extensive processing of the large video dataset acquired from the Pakistan motorways surveillance system. The use of VANET parameters gives us an estimation criterion of the flow of traffic on the Pakistan motorway network and acts as a precursor to the training algorithm. The use of VANET in this scenario would contribute heavily towards the computational complexity minimization of the proposed monitoring system.

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

  16. Ultra-wideband radar sensors and networks

    DOEpatents

    Leach, Jr., Richard R; Nekoogar, Faranak; Haugen, Peter C

    2013-08-06

    Ultra wideband radar motion sensors strategically placed in an area of interest communicate with a wireless ad hoc network to provide remote area surveillance. Swept range impulse radar and a heart and respiration monitor combined with the motion sensor further improves discrimination.

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

  18. MWAHCA: a multimedia wireless ad hoc cluster architecture.

    PubMed

    Diaz, Juan R; Lloret, Jaime; 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.

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

  20. Hierarchical sensor network architecture for stationary smart node supervision

    NASA Astrophysics Data System (ADS)

    Jin, Ming-Hui; Wu, Wen-Jong; Chen, Chun-Kuang; Chen, Yih-Fan; Wen, Chih-Min; Kao, Cheng-Yan; Yu, Shih-An; Lin, Yun-Han; Huang, Jhen-Gang; Rao, Herman; Hsu, Ching-Hsiang; Lee, Chih-Kung

    2004-07-01

    Most wireless sensor networks base their design on an ad hoc (multi-hop) network technology that focus on organizing and maintaining a network formed by a group of moving objects with a communication device in an area with no fixed base stations or access points. Although ad hoc network technologies are capable of constructing a sensor network, the design and implementation of sensor networks for monitoring stationary nodes such as construction sites and nature-disaster-prone areas can be furthered simplified to reduce power consumption and overhead. Based on the nature of immobile nodes, a hierarchical sensor network architecture and its associated communication protocols are proposed in this paper. In this proposed architecture, most elements in the sensor network are designed to be equipped with no functions for message forwarding or channel scheduling. The local control center uses a centralized communication protocol to communicate with each sensor node. The local control center can also use ad hoc network technology to relay the data between each of the sensors. This approach not only minimizes the complexity of the sensor nodes implemented but also significantly reduces the cost, size and power consumption of each sensor node. In addition, the benefit of using ad-hoc network technology is that the local controller retains its routing capabilities. Therefore, power efficiency and communication reliability can be both achieved and maximized by this type of hierarchical sensor network.

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

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

  3. 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.903 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION INFORMATION SECURITY PROGRAM NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is...

  4. 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 § 1203.903 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION INFORMATION SECURITY PROGRAM NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson...

  5. 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.903 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION INFORMATION SECURITY PROGRAM NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is...

  6. 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.903 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION INFORMATION SECURITY PROGRAM NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is...

  7. 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 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION INFORMATION SECURITY PROGRAM NASA Information Security Program Committee § 1203.903 Ad hoc committees. The Chairperson is authorized...

  8. Forward Interference Avoidance in Ad Hoc Communications Using Adaptive Array Antennas

    NASA Astrophysics Data System (ADS)

    Sakaguchi, Tomofumi; Kamiya, Yukihiro; Fujii, Takeo; Suzuki, Yasuo

    Wireless ad hoc communications such as ad hoc networks have been attracting researchers' attention. They are expected to become a key technology for “ubiquitous” networking because of the ability to configure wireless links by nodes autonomously, without any centralized control facilities. Adaptive array antennas (AAA) have been expected to improve the network efficiency by taking advantage of its adaptive beamforming capability. However, it should be noted that AAA is not almighty. Its interference cancellation capability is limited by the degree-of-freedom (DOF) and the angular resolution as a function of the number of element antennas. Application of AAA without attending to these problems can degrade the efficiency of the network. Let us consider wireless ad hoc communication as a target application for AAA, taking advantage of AAA's interference cancellation capability. The low DOF and insufficient resolution will be crucial problems compared to other wireless systems, since there is no centralized facility to control the nodes to avoid interferences in such systems. A number of interferences might impinge on a node from any direction of arrival (DOA) without any timing control. In this paper, focusing on such limitations of AAA applied in ad hoc communications, we propose a new scheme, Forward Interference Avoidance (FIA), using AAA for ad hoc communications in order to avoid problems caused by the limitation of the AAA capability. It enables nodes to avoid interfering with other nodes so that it increases the number of co-existent wireless links. The performance improvement of ad hoc communications in terms of the number of co-existent links is investigated through computer simulations.

  9. Apache Drill: Interactive Ad-Hoc Analysis at Scale.

    PubMed

    Hausenblas, Michael; Nadeau, Jacques

    2013-06-01

    Apache Drill is a distributed system for interactive ad-hoc analysis of large-scale datasets. Designed to handle up to petabytes of data spread across thousands of servers, the goal of Drill is to respond to ad-hoc queries in a low-latency manner. In this article, we introduce Drill's architecture, discuss its extensibility points, and put it into the context of the emerging offerings in the interactive analytics realm.

  10. A communication theoretical analysis of FRET-based mobile ad hoc molecular nanonetworks.

    PubMed

    Kuscu, Murat; Akan, Ozgur B

    2014-09-01

    Nanonetworks refer to a group of nanosized machines with very basic operational capabilities communicating to each other in order to accomplish more complex tasks such as in-body drug delivery, or chemical defense. Realizing reliable and high-rate communication between these nanomachines is a fundamental problem for the practicality of these nanonetworks. Recently, we have proposed a molecular communication method based on Förster Resonance Energy Transfer (FRET) which is a nonradiative excited state energy transfer phenomenon observed among fluorescent molecules, i.e., fluorophores. We have modeled the FRET-based communication channel considering the fluorophores as single-molecular immobile nanomachines, and shown its reliability at high rates, and practicality at the current stage of nanotechnology. In this study, for the first time in the literature, we investigate the network of mobile nanomachines communicating through FRET. We introduce two novel mobile molecular nanonetworks: FRET-based mobile molecular sensor/actor nanonetwork (FRET-MSAN) which is a distributed system of mobile fluorophores acting as sensor or actor node; and FRET-based mobile ad hoc molecular nanonetwork (FRET-MAMNET) which consists of fluorophore-based nanotransmitter, nanoreceivers and nanorelays. We model the single message propagation based on birth-death processes with continuous time Markov chains. We evaluate the performance of FRET-MSAN and FRET-MAMNET in terms of successful transmission probability and mean extinction time of the messages, system throughput, channel capacity and achievable communication rates.

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

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

  13. Project "Freestyle": Ad Hoc: Fast-Turn-Around Evaluation.

    ERIC Educational Resources Information Center

    Smith, Karen

    Project "Freestyle" involved the development of prototypical television materials and a comic book intended to combat sex-role stereotyping in career-related attitudes of nine to twelve-year-old children. At various times during the early developmental stages of "Freestyle" materials, "ad hoc fast-turn-around" formative evaluations were conducted.…

  14. Ad Hoc Technical Committee for Vocational Agriculture. Final Report.

    ERIC Educational Resources Information Center

    Indiana State Commission on Vocational and Technical Education, Indianapolis.

    The goal of the Ad Hoc Technical Committee for Vocational Agriculture in Indiana was to develop a model and recommendations that would result in improved student knowledge and skills for the present and future, address labor market needs, and promote program excellence at all levels of education. The committee developed recommendations for…

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

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

  17. Metadata-driven Ad Hoc Query of Patient Data

    PubMed Central

    Deshpande, Aniruddha M.; Brandt, Cynthia; Nadkarni, Prakash M.

    2002-01-01

    Clinical study data management systems (CSDMSs) have many similarities to clinical patient record systems (CPRSs) in their focus on recording clinical parameters. Requirements for ad hoc query interfaces for both systems would therefore appear to be highly similar. However, a clinical study is concerned primarily with collective responses of groups of subjects to standardized therapeutic interventions for the same underlying clinical condition. The parameters that are recorded in CSDMSs tend to be more diverse than those required for patient management in non-research settings, because of the greater emphasis on questionnaires for which responses to each question are recorded separately. The differences between CSDMSs and CPRSs are reflected in the metadata that support the respective systems' operation, and need to be reflected in the query interfaces. The authors describe major revisions of their previously described CSDMS ad hoc query interface to meet CSDMS needs more fully, as well as its porting to a Web-based platform. PMID:12087118

  18. LinkMind: link optimization in swarming mobile sensor networks.

    PubMed

    Ngo, Trung Dung

    2011-01-01

    A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation. PMID:22164070

  19. LinkMind: Link Optimization in Swarming Mobile Sensor Networks

    PubMed Central

    Ngo, Trung Dung

    2011-01-01

    A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation. PMID:22164070

  20. LinkMind: link optimization in swarming mobile sensor networks.

    PubMed

    Ngo, Trung Dung

    2011-01-01

    A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

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

  2. 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... Administration announces a two-part meeting of the Ad-Hoc Task Force on Planetary Defense of the NASA Advisory...@nasa.gov . SUPPLEMENTARY INFORMATION: The agenda topic is: Drafting of the Ad-Hoc Task Force...

  3. 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... Administration announces a meeting of the Ad-Hoc Task Force on Planetary Defense of the NASA Advisory Council... include: Ad-Hoc Task Force on Planetary Defense Terms of Reference. NASA Near Earth Object (NEO)...

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

  5. Quality of Service Metrics in Wireless Sensor Networks: A Survey

    NASA Astrophysics Data System (ADS)

    Snigdh, Itu; Gupta, Nisha

    2016-03-01

    Wireless ad hoc network is characterized by autonomous nodes communicating with each other by forming a multi hop radio network and maintaining connectivity in a decentralized manner. This paper presents a systematic approach to the interdependencies and the analogy of the various factors that affect and constrain the wireless sensor network. This article elaborates the quality of service parameters in terms of methods of deployment, coverage and connectivity which affect the lifetime of the network that have been addressed, till date by the different literatures. The analogy of the indispensable rudiments was discussed that are important factors to determine the varied quality of service achieved, yet have not been duly focused upon.

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

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

  8. Stochastic does not equal ad hoc. [theories of lunar origin

    NASA Technical Reports Server (NTRS)

    Hartmann, W. K.

    1984-01-01

    Some classes of influential events in solar system history are class-predictable but not event-predictable. Theories of lunar origin should not ignore class-predictable stochastic events. Impacts and close encounters with large objects during planet formation are class-predictable. These stochastic events, such as large impacts that triggered ejection of Earth-mantle material into a circum-Earth cloud, should not be rejected as ad hoc. A way to deal with such events scientifically is to investigate their consequences; if it can be shown that they might produce the Moon, they become viable concepts in theories of lunar origin.

  9. Approximate ad-hoc query engine for simulation data

    SciTech Connect

    Abdulla, G; Baldwin, C; Critchlow, T; Kamimura, R; Lozares, I; Musick, R; Tang, N; Lee, B S; Snapp, R

    2001-02-01

    In this paper, we describe AQSim, an ongoing effort to design and implement a system to manage terabytes of scientific simulation data. The goal of this project is to reduce data storage requirements and access times while permitting ad-hoc queries using statistical and mathematical models of the data. In order to facilitate data exchange between models based on different representations, we are evaluating using the ASCI common data model which is comprised of several layers of increasing semantic complexity. To support queries over the spatial-temporal mesh structured data we are in the process of defining and implementing a grammar for MeshSQL.

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

  12. 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 sensor webs. ad hoc constellations, mission autonomy and

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

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

  15. Managing heterogeneous networks of mobile and stationary sensors

    NASA Astrophysics Data System (ADS)

    Bürkle, Axel; Solbrig, Peter; Segor, Florian; Bulatov, Dimitri; Wernerus, Peter; Müller, Sven

    2011-11-01

    Protecting critical infrastructure against intrusion, sabotage or vandalism is a task that requires a comprehensive situation picture. Modern security systems should provide a total solution including sensors, software, hardware, and a "control unit" to ensure complete security. Incorporating unmanned mobile sensors can significantly help to close information gaps and gain an ad hoc picture of areas where no pre-installed supervision infrastructure is available or damaged after an incident. Fraunhofer IOSB has developed the generic ground control station AMFIS which is capable of managing sensor data acquisition with all kinds of unattended stationary sensors, mobile ad hoc sensor networks, and mobile sensor platforms. The system is highly mobile and able to control various mobile platforms such as small UAVs (Unmanned Aerial Vehicles) and UGVs (Unmanned Ground Vehicles). In order to establish a real-time situation picture, also an image exploitation process is used. In this process, video frames from different sources (mainly from small UAVs) are georeferenced by means of a system of image registration methods. Relevant information can be obtained by a motion detection module. Thus, the image exploitation process can accelerate the situation assessment significantly.

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

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

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

  19. Cognitive radio wireless sensor networks: applications, challenges and research trends.

    PubMed

    Joshi, Gyanendra Prasad; Nam, Seung Yeob; Kim, Sung Won

    2013-08-22

    A cognitive radio wireless sensor network is one of the candidate areas where cognitive techniques can be used for opportunistic spectrum access. Research in this area is still in its infancy, but it is progressing rapidly. The aim of this study is to classify the existing literature of this fast emerging application area of cognitive radio wireless sensor networks, highlight the key research that has already been undertaken, and indicate open problems. This paper describes the advantages of cognitive radio wireless sensor networks, the difference between ad hoc cognitive radio networks, wireless sensor networks, and cognitive radio wireless sensor networks, potential application areas of cognitive radio wireless sensor networks, challenges and research trend in cognitive radio wireless sensor networks. The sensing schemes suited for cognitive radio wireless sensor networks scenarios are discussed with an emphasis on cooperation and spectrum access methods that ensure the availability of the required QoS. Finally, this paper lists several open research challenges aimed at drawing the attention of the readers toward the important issues that need to be addressed before the vision of completely autonomous cognitive radio wireless sensor networks can be realized.

  20. Environmental Sensor Networks: A revolution in the earth system science?

    NASA Astrophysics Data System (ADS)

    Hart, Jane K.; Martinez, Kirk

    2006-10-01

    Environmental Sensor Networks (ESNs) facilitate the study of fundamental processes and the development of hazard response systems. They have evolved from passive logging systems that require manual downloading, into 'intelligent' sensor networks that comprise a network of automatic sensor nodes and communications systems which actively communicate their data to a Sensor Network Server (SNS) where these data can be integrated with other environmental datasets. The sensor nodes can be fixed or mobile and range in scale appropriate to the environment being sensed. ESNs range in scale and function and we have reviewed over 50 representative examples. Large Scale Single Function Networks tend to use large single purpose nodes to cover a wide geographical area. Localised Multifunction Sensor Networks typically monitor a small area in more detail, often with wireless ad-hoc systems. Biosensor Networks use emerging biotechnologies to monitor environmental processes as well as developing proxies for immediate use. In the future, sensor networks will integrate these three elements ( Heterogeneous Sensor Networks). The communications system and data storage and integration (cyberinfrastructure) aspects of ESNs are discussed, along with current challenges which need to be addressed. We argue that Environmental Sensor Networks will become a standard research tool for future Earth System and Environmental Science. Not only do they provide a 'virtual' connection with the environment, they allow new field and conceptual approaches to the study of environmental processes to be developed. We suggest that although technological advances have facilitated these changes, it is vital that Earth Systems and Environmental Scientists utilise them.

  1. Cognitive Radio Wireless Sensor Networks: Applications, Challenges and Research Trends

    PubMed Central

    Joshi, Gyanendra Prasad; Nam, Seung Yeob; Kim, Sung Won

    2013-01-01

    A cognitive radio wireless sensor network is one of the candidate areas where cognitive techniques can be used for opportunistic spectrum access. Research in this area is still in its infancy, but it is progressing rapidly. The aim of this study is to classify the existing literature of this fast emerging application area of cognitive radio wireless sensor networks, highlight the key research that has already been undertaken, and indicate open problems. This paper describes the advantages of cognitive radio wireless sensor networks, the difference between ad hoc cognitive radio networks, wireless sensor networks, and cognitive radio wireless sensor networks, potential application areas of cognitive radio wireless sensor networks, challenges and research trend in cognitive radio wireless sensor networks. The sensing schemes suited for cognitive radio wireless sensor networks scenarios are discussed with an emphasis on cooperation and spectrum access methods that ensure the availability of the required QoS. Finally, this paper lists several open research challenges aimed at drawing the attention of the readers toward the important issues that need to be addressed before the vision of completely autonomous cognitive radio wireless sensor networks can be realized. PMID:23974152

  2. TCPL: A Defense against wormhole attacks in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Kumar, K. E. Naresh; Waheed, Mohd. Abdul; Basappa, K. Kari

    2010-10-01

    Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.

  3. TCPL: A Defense against wormhole attacks in wireless sensor networks

    SciTech Connect

    Kumar, K. E. Naresh; Waheed, Mohd. Abdul; Basappa, K. Kari

    2010-10-26

    Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.

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

  5. Reliable Geographical Forwarding in Cognitive Radio Sensor Networks Using Virtual Clusters

    PubMed Central

    Zubair, Suleiman; Fisal, Norsheila

    2014-01-01

    The need for implementing reliable data transfer in resource-constrained cognitive radio ad hoc networks is still an open issue in the research community. Although geographical forwarding schemes are characterized by their low overhead and efficiency in reliable data transfer in traditional wireless sensor network, this potential is still yet to be utilized for viable routing options in resource-constrained cognitive radio ad hoc networks in the presence of lossy links. In this paper, a novel geographical forwarding technique that does not restrict the choice of the next hop to the nodes in the selected route is presented. This is achieved by the creation of virtual clusters based on spectrum correlation from which the next hop choice is made based on link quality. The design maximizes the use of idle listening and receiver contention prioritization for energy efficiency, the avoidance of routing hot spots and stability. The validation result, which closely follows the simulation result, shows that the developed scheme can make more advancement to the sink as against the usual decisions of relevant ad hoc on-demand distance vector route select operations, while ensuring channel quality. Further simulation results have shown the enhanced reliability, lower latency and energy efficiency of the presented scheme. PMID:24854362

  6. Reliable geographical forwarding in cognitive radio sensor networks using virtual clusters.

    PubMed

    Zubair, Suleiman; Fisal, Norsheila

    2014-01-01

    The need for implementing reliable data transfer in resource-constrained cognitive radio ad hoc networks is still an open issue in the research community. Although geographical forwarding schemes are characterized by their low overhead and efficiency in reliable data transfer in traditional wireless sensor network, this potential is still yet to be utilized for viable routing options in resource-constrained cognitive radio ad hoc networks in the presence of lossy links. In this paper, a novel geographical forwarding technique that does not restrict the choice of the next hop to the nodes in the selected route is presented. This is achieved by the creation of virtual clusters based on spectrum correlation from which the next hop choice is made based on link quality. The design maximizes the use of idle listening and receiver contention prioritization for energy efficiency, the avoidance of routing hot spots and stability. The validation result, which closely follows the simulation result, shows that the developed scheme can make more advancement to the sink as against the usual decisions of relevant ad hoc on-demand distance vector route select operations, while ensuring channel quality. Further simulation results have shown the enhanced reliability, lower latency and energy efficiency of the presented scheme. PMID:24854362

  7. Reliable geographical forwarding in cognitive radio sensor networks using virtual clusters.

    PubMed

    Zubair, Suleiman; Fisal, Norsheila

    2014-05-21

    The need for implementing reliable data transfer in resource-constrained cognitive radio ad hoc networks is still an open issue in the research community. Although geographical forwarding schemes are characterized by their low overhead and efficiency in reliable data transfer in traditional wireless sensor network, this potential is still yet to be utilized for viable routing options in resource-constrained cognitive radio ad hoc networks in the presence of lossy links. In this paper, a novel geographical forwarding technique that does not restrict the choice of the next hop to the nodes in the selected route is presented. This is achieved by the creation of virtual clusters based on spectrum correlation from which the next hop choice is made based on link quality. The design maximizes the use of idle listening and receiver contention prioritization for energy efficiency, the avoidance of routing hot spots and stability. The validation result, which closely follows the simulation result, shows that the developed scheme can make more advancement to the sink as against the usual decisions of relevant ad hoc on-demand distance vector route select operations, while ensuring channel quality. Further simulation results have shown the enhanced reliability, lower latency and energy efficiency of the presented scheme.

  8. Capacity Limit, Link Scheduling and Power Control in Wireless Networks

    ERIC Educational Resources Information Center

    Zhou, Shan

    2013-01-01

    The rapid advancement of wireless technology has instigated the broad deployment of wireless networks. Different types of networks have been developed, including wireless sensor networks, mobile ad hoc networks, wireless local area networks, and cellular networks. These networks have different structures and applications, and require different…

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

  10. Current capability of a matured disposable acoustic sensor network

    NASA Astrophysics Data System (ADS)

    Beale, D. A. R.; Geddes, N. J., II; Hume, A.; Gray, A. J.

    2006-05-01

    In response to the needs of the UK MOD QinetiQ have designed, developed and trialled an ad-hoc, self organising network of acoustic nodes for in-depth deployment that can detect and track military targets in a range of environments and for all types of weapon locating. Research conducted has shown that disposable technologies are sufficiently mature to provide a useful military capability. Work this year has included a 3 month series of trials to exercise the prototype equipment and has provided an indication of in-service capability across a broad range of environments. This paper will discuss the scientific approach that was applied to the development of the equipment, from early laboratory development through to the prototype sensor network deployment in operationally representative environments. Highlights from the trials have been provided. New findings from the fusion of a low cost thermal imager that can be cued by the acoustic network are also discussed.

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

  12. Flexible quality of service model for wireless body area sensor networks.

    PubMed

    Liao, Yangzhe; Leeson, Mark S; Higgins, Matthew D

    2016-03-01

    Wireless body area sensor networks (WBASNs) are becoming an increasingly significant breakthrough technology for smart healthcare systems, enabling improved clinical decision-making in daily medical care. Recently, radio frequency ultra-wideband technology has developed substantially for physiological signal monitoring due to its advantages such as low-power consumption, high transmission data rate, and miniature antenna size. Applications of future ubiquitous healthcare systems offer the prospect of collecting human vital signs, early detection of abnormal medical conditions, real-time healthcare data transmission and remote telemedicine support. However, due to the technical constraints of sensor batteries, the supply of power is a major bottleneck for healthcare system design. Moreover, medium access control (MAC) needs to support reliable transmission links that allow sensors to transmit data safely and stably. In this Letter, the authors provide a flexible quality of service model for ad hoc networks that can support fast data transmission, adaptive schedule MAC control, and energy efficient ubiquitous WBASN networks. Results show that the proposed multi-hop communication ad hoc network model can balance information packet collisions and power consumption. Additionally, wireless communications link in WBASNs can effectively overcome multi-user interference and offer high transmission data rates for healthcare systems.

  13. Flexible quality of service model for wireless body area sensor networks.

    PubMed

    Liao, Yangzhe; Leeson, Mark S; Higgins, Matthew D

    2016-03-01

    Wireless body area sensor networks (WBASNs) are becoming an increasingly significant breakthrough technology for smart healthcare systems, enabling improved clinical decision-making in daily medical care. Recently, radio frequency ultra-wideband technology has developed substantially for physiological signal monitoring due to its advantages such as low-power consumption, high transmission data rate, and miniature antenna size. Applications of future ubiquitous healthcare systems offer the prospect of collecting human vital signs, early detection of abnormal medical conditions, real-time healthcare data transmission and remote telemedicine support. However, due to the technical constraints of sensor batteries, the supply of power is a major bottleneck for healthcare system design. Moreover, medium access control (MAC) needs to support reliable transmission links that allow sensors to transmit data safely and stably. In this Letter, the authors provide a flexible quality of service model for ad hoc networks that can support fast data transmission, adaptive schedule MAC control, and energy efficient ubiquitous WBASN networks. Results show that the proposed multi-hop communication ad hoc network model can balance information packet collisions and power consumption. Additionally, wireless communications link in WBASNs can effectively overcome multi-user interference and offer high transmission data rates for healthcare systems. PMID:27222727

  14. The possibility for collaboration of Arecibo with international S2 ad-hoc array

    NASA Astrophysics Data System (ADS)

    Molotov, I. E.; Chuprikov, A. A.; Salter, C.; Ghosh, T.

    2001-05-01

    The loan of an S2 VLBI recording terminal to Arecibo Observatory by the Space Geodynamics Laboratory, ISTS (now CRESTech), Canada, for support of the VSOP mission, opens the possibility of Arecibo participating in ground based VLBI observations. I.e. in collaboration with an international ad-hoc S2 array that has begun to operate under the Low Frequency VLBI Network (LFVN) project. LFVN arranges VLBI experiments using the telescopes in 11 countries which are equipped with S2 systems, together with the Penticton S2 correlator in Canada. A wide spectrum of baselines has been achieved, up to the largest on Earth, while the participation of Arecibo can ensure the high sensitivity of this S2 array. The first LFVN S2 observations including Arecibo were carried out at a wavelength of 18 cm on December 2, 1998, as part of INTAS98.5. This experiment with participation of three Russian antennas (Bear Lakes RT-64, Puschino RT-22 and Svetloe RT-32), Green Bank RT-43 and HartRAO RT-26 included 7 hrs of observation of weak sources on the Arecibo-Green Bank baseline. The successful processing of INTAS98.5 and two other observations (INTAS98.2 and INTAS99.4) by the Penticton correlator confirms the feasibility of this initiative (the post-processing was made at Astro Space Center, Russia). These VLBI observations may be continued with the Green Bank RT-100, Penticton RT-26 and Madrid RT-70. (The next S2 experiment is planned for October-November 2001). The recent equipping of Arecibo with a 92-cm receiver also opens new opportunities for LFVN cooperation, especially as there is a plan to also supply AlgoPark RT-46 and Penticton RT-26 in Canada with 92-cm facilities. Another field of interest for cooperation may be the radar VLBI research of the nearer planets with the S2 system recording of transmitted and reflected signals.

  15. A multi-agent system architecture for sensor networks.

    PubMed

    Fuentes-Fernández, Rubén; Guijarro, María; Pajares, Gonzalo

    2009-01-01

    The design of the control systems for sensor networks presents important challenges. Besides the traditional problems about how to process the sensor data to obtain the target information, engineers need to consider additional aspects such as the heterogeneity and high number of sensors, and the flexibility of these networks regarding topologies and the sensors in them. Although there are partial approaches for resolving these issues, their integration relies on ad hoc solutions requiring important development efforts. In order to provide an effective approach for this integration, this paper proposes an architecture based on the multi-agent system paradigm with a clear separation of concerns. The architecture considers sensors as devices used by an upper layer of manager agents. These agents are able to communicate and negotiate services to achieve the required functionality. Activities are organized according to roles related with the different aspects to integrate, mainly sensor management, data processing, communication and adaptation to changes in the available devices and their capabilities. This organization largely isolates and decouples the data management from the changing network, while encouraging reuse of solutions. The use of the architecture is facilitated by a specific modelling language developed through metamodelling. A case study concerning a generic distributed system for fire fighting illustrates the approach and the comparison with related work. PMID:22303172

  16. A Multi-Agent System Architecture for Sensor Networks

    PubMed Central

    Fuentes-Fernández, Rubén; Guijarro, María; Pajares, Gonzalo

    2009-01-01

    The design of the control systems for sensor networks presents important challenges. Besides the traditional problems about how to process the sensor data to obtain the target information, engineers need to consider additional aspects such as the heterogeneity and high number of sensors, and the flexibility of these networks regarding topologies and the sensors in them. Although there are partial approaches for resolving these issues, their integration relies on ad hoc solutions requiring important development efforts. In order to provide an effective approach for this integration, this paper proposes an architecture based on the multi-agent system paradigm with a clear separation of concerns. The architecture considers sensors as devices used by an upper layer of manager agents. These agents are able to communicate and negotiate services to achieve the required functionality. Activities are organized according to roles related with the different aspects to integrate, mainly sensor management, data processing, communication and adaptation to changes in the available devices and their capabilities. This organization largely isolates and decouples the data management from the changing network, while encouraging reuse of solutions. The use of the architecture is facilitated by a specific modelling language developed through metamodelling. A case study concerning a generic distributed system for fire fighting illustrates the approach and the comparison with related work. PMID:22303172

  17. On the routing protocol influence on the resilience of wireless sensor networks to jamming attacks.

    PubMed

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

    2015-03-27

    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.

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

  19. A Comparison of Alternative Distributed Dynamic Cluster Formation Techniques for Industrial Wireless Sensor Networks

    PubMed Central

    Gholami, Mohammad; Brennan, Robert W.

    2016-01-01

    In this paper, we investigate alternative distributed clustering techniques for wireless sensor node tracking in an industrial environment. The research builds on extant work on wireless sensor node clustering by reporting on: (1) the development of a novel distributed management approach for tracking mobile nodes in an industrial wireless sensor network; and (2) an objective comparison of alternative cluster management approaches for wireless sensor networks. To perform this comparison, we focus on two main clustering approaches proposed in the literature: pre-defined clusters and ad hoc clusters. These approaches are compared in the context of their reconfigurability: more specifically, we investigate the trade-off between the cost and the effectiveness of competing strategies aimed at adapting to changes in the sensing environment. To support this work, we introduce three new metrics: a cost/efficiency measure, a performance measure, and a resource consumption measure. The results of our experiments show that ad hoc clusters adapt more readily to changes in the sensing environment, but this higher level of adaptability is at the cost of overall efficiency. PMID:26751447

  20. A Comparison of Alternative Distributed Dynamic Cluster Formation Techniques for Industrial Wireless Sensor Networks.

    PubMed

    Gholami, Mohammad; Brennan, Robert W

    2016-01-06

    In this paper, we investigate alternative distributed clustering techniques for wireless sensor node tracking in an industrial environment. The research builds on extant work on wireless sensor node clustering by reporting on: (1) the development of a novel distributed management approach for tracking mobile nodes in an industrial wireless sensor network; and (2) an objective comparison of alternative cluster management approaches for wireless sensor networks. To perform this comparison, we focus on two main clustering approaches proposed in the literature: pre-defined clusters and ad hoc clusters. These approaches are compared in the context of their reconfigurability: more specifically, we investigate the trade-off between the cost and the effectiveness of competing strategies aimed at adapting to changes in the sensing environment. To support this work, we introduce three new metrics: a cost/efficiency measure, a performance measure, and a resource consumption measure. The results of our experiments show that ad hoc clusters adapt more readily to changes in the sensing environment, but this higher level of adaptability is at the cost of overall efficiency.

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

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

  3. Assessing routing strategies for cognitive radio sensor networks.

    PubMed

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

    2013-09-26

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

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

  5. An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks

    PubMed Central

    Lachowski, Rosana; Pellenz, Marcelo E.; Penna, Manoel C.; Jamhour, Edgard; Souza, Richard D.

    2015-01-01

    Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing. PMID:25594593

  6. An efficient distributed algorithm for constructing spanning trees in wireless sensor networks.

    PubMed

    Lachowski, Rosana; Pellenz, Marcelo E; Penna, Manoel C; Jamhour, Edgard; Souza, Richard D

    2015-01-01

    Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.

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

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

  9. Strategies for generating multiple instances of common and ad hoc categories.

    PubMed

    Vallée-Tourangeau, F; Anthony, S H; Austin, N G

    1998-09-01

    In a free-emission procedure participants were asked to generate instances of a given category and to report, retrospectively, the strategies that they were aware of using in retrieving instances. In two studies reported here, participants generated instances for common categories (e.g. fruit) and for ad hoc categories (e.g., things people keep in their pockets) for 90 seconds and for each category described how they had proceeded in doing so. Analysis of the protocols identified three broad classes of strategy: (1) experiential, where memories of specific or generic personal experiences involving interactions with the category instances acted as cues; (2) semantic, where a consideration of abstract conceptual characteristics of a category were employed to retrieve category exemplars; (3) unmediated, where instances were effortlessly retrieved without mediating cognitions of which subjects were aware. Experiential strategies outnumbered semantic strategies (on average 4 to 1) not only for ad hoc categories but also for common categories. This pattern was noticeably reversed for ad hoc categories that subjects were unlikely to have experienced personally (e.g. things sold on the black market in Russia). Whereas more traditional accounts of semantic memory have favoured decontextualised abstract representations of category knowledge, to the extent that mode of access informs us of knowledge structures, our data suggest that category knowledge is significantly grounded in terms of everyday contexts where category instances are encountered. PMID:10197163

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

  11. Low-Power Direct-Sequence Spread-Spectrum Modem Architecture for Distributed Wireless Sensor Networks

    SciTech Connect

    Chien, C; Elgorriaga, I; McConaghy, C

    2001-07-03

    Emerging CMOS and MEMS technologies enable the implementation of a large number of wireless distributed microsensors that can be easily and rapidly deployed to form highly redundant, self-configuring, and ad hoc sensor networks. To facilitate ease of deployment, these sensors should operate on battery for extended periods of time. A particular challenge in maintaining extended battery lifetime lies in achieving communications with low power. This paper presents a direct-sequence spread-spectrum modem architecture that provides robust communications for wireless sensor networks while dissipating very low power. The modem architecture has been verified in an FPGA implementation that dissipates only 33 mW for both transmission and reception. The implementation can be easily mapped to an ASIC technology, with an estimated power performance of less than 1 mW.

  12. Scientific and Technological Information for Development. Proceedings of the Ad-hoc Panel of Experts on Information Systems for Science and Technology for Development (Rome, Italy, January 21-25, 1985).

    ERIC Educational Resources Information Center

    United Nations, New York, NY.

    The report of the ad-hoc panel and the 25 papers in these proceedings cover a wide spectrum of issues and perspectives relating to information systems, services, and networks at both the national and international levels. The first part of this six-part volume presents the panel's report, which reviews the history of the panel and its purpose and…

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

  14. RoCoMAR: robots' controllable mobility aided routing and relay architecture for mobile sensor networks.

    PubMed

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

    2013-07-05

    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.

  15. Wireless Sensors Network (Sensornet)

    NASA Technical Reports Server (NTRS)

    Perotti, J.

    2003-01-01

    The Wireless Sensor Network System presented in this paper provides a flexible reconfigurable architecture that could be used in a broad range of applications. It also provides a sensor network with increased reliability; decreased maintainability costs, and assured data availability by autonomously and automatically reconfiguring to overcome communication interferences.

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

  17. Automated generation of discrete event controllers for dynamic reconfiguration of autonomous sensor networks

    NASA Astrophysics Data System (ADS)

    Damiani, Sarah; Griffin, Christopher; Phoha, Shashi

    2003-12-01

    Autonomous Sensor Networks have the potential for broad applicability to national security, intelligent transportation, industrial production and environmental and hazardous process control. Distributed sensors may be used for detecting bio-terrorist attacks, for contraband interdiction, border patrol, monitoring building safety and security, battlefield surveillance, or may be embedded in complex dynamic systems for enabling fault tolerant operations. In this paper we present algorithms and automation tools for constructing discrete event controllers for complex networked systems that restrict the dynamic behavior of the system according to given specifications. In our previous work we have modeled dynamic system as a discrete event automation whose open loop behavior is represented as a language L of strings generated with the alphabet 'Elipson' of all possible atomic events that cause state transitions in the network. The controlled behavior is represented by a sublanguage K, contained in L, that restricts the behavior of the system according to the specifications of the controller. We have developed the algebraic structure of controllable sublanguages as perfect right partial ideals that satisfy a precontrollability condition. In this paper we develop an iterative algorithm to take an ad hoc specification described using a natural language, and to formulate a complete specification that results in a controllable sublanguage. A supervisory controller modeled as an automaton that runs synchronously with the open loop system in the sense of Ramadge and Wonham is automatically generated to restrict the behavior of the open loop system to the controllable sublanguage. A battlefield surveillance scenario illustrates the iterative evolution of ad hoc specifications for controlling an autonomous sensor network and the generation of a controller that reconfigures the sensor network to dynamically adapt to environmental perturbations.

  18. Analysis of Wireless Sensor Network Topology and Estimation of Optimal Network Deployment by Deterministic Radio Channel Characterization

    PubMed Central

    Aguirre, Erik; Lopez-Iturri, Peio; Azpilicueta, Leire; Astrain, José Javier; Villadangos, Jesús; Falcone, Francisco

    2015-01-01

    One of the main challenges in the implementation and design of context-aware scenarios is the adequate deployment strategy for Wireless Sensor Networks (WSNs), mainly due to the strong dependence of the radiofrequency physical layer with the surrounding media, which can lead to non-optimal network designs. In this work, radioplanning analysis for WSN deployment is proposed by employing a deterministic 3D ray launching technique in order to provide insight into complex wireless channel behavior in context-aware indoor scenarios. The proposed radioplanning procedure is validated with a testbed implemented with a Mobile Ad Hoc Network WSN following a chain configuration, enabling the analysis and assessment of a rich variety of parameters, such as received signal level, signal quality and estimation of power consumption. The adoption of deterministic radio channel techniques allows the design and further deployment of WSNs in heterogeneous wireless scenarios with optimized behavior in terms of coverage, capacity, quality of service and energy consumption. PMID:25664434

  19. Analysis of wireless sensor network topology and estimation of optimal network deployment by deterministic radio channel characterization.

    PubMed

    Aguirre, Erik; Lopez-Iturri, Peio; Azpilicueta, Leire; Astrain, José Javier; Villadangos, Jesús; Falcone, Francisco

    2015-02-05

    One of the main challenges in the implementation and design of context-aware scenarios is the adequate deployment strategy for Wireless Sensor Networks (WSNs), mainly due to the strong dependence of the radiofrequency physical layer with the surrounding media, which can lead to non-optimal network designs. In this work, radioplanning analysis for WSN deployment is proposed by employing a deterministic 3D ray launching technique in order to provide insight into complex wireless channel behavior in context-aware indoor scenarios. The proposed radioplanning procedure is validated with a testbed implemented with a Mobile Ad Hoc Network WSN following a chain configuration, enabling the analysis and assessment of a rich variety of parameters, such as received signal level, signal quality and estimation of power consumption. The adoption of deterministic radio channel techniques allows the design and further deployment of WSNs in heterogeneous wireless scenarios with optimized behavior in terms of coverage, capacity, quality of service and energy consumption.

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

  1. Sensor Authentication in Collaborating Sensor Networks

    SciTech Connect

    Bielefeldt, Jake Uriah

    2014-11-01

    In this thesis, we address a new security problem in the realm of collaborating sensor networks. By collaborating sensor networks, we refer to the networks of sensor networks collaborating on a mission, with each sensor network is independently owned and operated by separate entities. Such networks are practical where a number of independent entities can deploy their own sensor networks in multi-national, commercial, and environmental scenarios, and some of these networks will integrate complementary functionalities for a mission. In the scenario, we address an authentication problem wherein the goal is for the Operator Oi of Sensor Network Si to correctly determine the number of active sensors in Network Si. Such a problem is challenging in collaborating sensor networks where other sensor networks, despite showing an intent to collaborate, may not be completely trustworthy and could compromise the authentication process. We propose two authentication protocols to address this problem. Our protocols rely on Physically Unclonable Functions, which are a hardware based authentication primitive exploiting inherent randomness in circuit fabrication. Our protocols are light-weight, energy efficient, and highly secure against a number of attacks. To the best of our knowledge, ours is the first to addresses a practical security problem in collaborating sensor networks.

  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. Distributed sensor networks

    NASA Astrophysics Data System (ADS)

    Lacoss, Richard T.

    1986-09-01

    The Distributed Sensor Networks (DSN) program was aimed at developing distributed target surveillance and tracking methods for systems employing multiple spatially distributed sensors and processing resources. Such systems would be made up of sensors, data bases, and processors distributed throughout an area and interconnected by an appropriate digital data communication system. The hypothesis of the program was that through netting and distributed processing, the information from many sensors could be combined to yield effective surveillance systems. The overall concept called for a mix of sensor types as well as geographically distributed sensors. Surveillance and tracking of low-flying aircraft with ground-based acoustic and imaging sensors was used to develop and evaluate DSN concepts in the light of a specific problem. An experimental DSN testbed system was developed and has been used to test and demonstrate DSN techniques. Small arrays of microphones providing directional information were employed as acoustic sensors and visible TV cameras were used as imaging sensors in the testbed system. The primary accomplishment during this final report period was the demonstration of distributed real time tracking using both TV and acoustic sensors. Tracking was implemented as a geographically decentralized confederacy of autonomous cooperating nodes. Thus the feasibility of this organization has been established for a DSN system containing multiple sensor types as well as distributed nodes.

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

  5. Modular sensor network node

    DOEpatents

    Davis, Jesse Harper Zehring; Stark, Jr., Douglas Paul; Kershaw, Christopher Patrick; Kyker, Ronald Dean

    2008-06-10

    A distributed wireless sensor network node is disclosed. The wireless sensor network node includes a plurality of sensor modules coupled to a system bus and configured to sense a parameter. The parameter may be an object, an event or any other parameter. The node collects data representative of the parameter. The node also includes a communication module coupled to the system bus and configured to allow the node to communicate with other nodes. The node also includes a processing module coupled to the system bus and adapted to receive the data from the sensor module and operable to analyze the data. The node also includes a power module connected to the system bus and operable to generate a regulated voltage.

  6. ReTrust: attack-resistant and lightweight trust management for medical sensor networks.

    PubMed

    He, Daojing; Chen, Chun; Chan, Sammy; Bu, Jiajun; Vasilakos, Athanasios V

    2012-07-01

    Wireless medical sensor networks (MSNs) enable ubiquitous health monitoring of users during their everyday lives, at health sites, without restricting their freedom. Establishing trust among distributed network entities has been recognized as a powerful tool to improve the security and performance of distributed networks such as mobile ad hoc networks and sensor networks. However, most existing trust systems are not well suited for MSNs due to the unique operational and security requirements of MSNs. Moreover, similar to most security schemes, trust management methods themselves can be vulnerable to attacks. Unfortunately, this issue is often ignored in existing trust systems. In this paper, we identify the security and performance challenges facing a sensor network for wireless medical monitoring and suggest it should follow a two-tier architecture. Based on such an architecture, we develop an attack-resistant and lightweight trust management scheme named ReTrust. This paper also reports the experimental results of the Collection Tree Protocol using our proposed system in a network of TelosB motes, which show that ReTrust not only can efficiently detect malicious/faulty behaviors, but can also significantly improve the network performance in practice.

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

  8. Ad Hoc Conference on the Education of Migrants: Conclusions and Recommendations (Strasbourg, France, November 5-8, 1974).

    ERIC Educational Resources Information Center

    Council of Europe, Strasbourg (France). Documentation Center for Education in Europe.

    The 9th session of the Ad Hoc Conference on the Education of Migrants had 3 themes. Theme I was "measures to improve the position of immigrants and their families, primarily in respect of their educational circumstances, at the time of arrival in the host country." The second theme was "measures to secure satisfactory educational provision before…

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

  10. Programming Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Lopes, Luís; Martins, Francisco; Barros, João

    Sensor networks can be viewed as a collection of tiny, low-cost devices programmed to sense the physical world and that communicate over radio links [12]. The devices are commonly called motes or smart dust [676], in allusion to their computational and sensing capabilities, as well as their increasingly small size.

  11. Managing daily intensive care activities: An observational study concerning ad hoc decision making of charge nurses and intensivists

    PubMed Central

    2011-01-01

    Introduction Management of daily activities in ICUs is challenging. ICU shift leaders, charge nurses and intensivists have to make several immediate ad hoc decisions to enable the fluent flow of ICU activities. Even though the management of ICU activities is quite well delineated by international consensus guidelines, we know only a little about the content of the real clinical decision making of ICU shift leaders. Methods We conducted an observational study with the think-aloud technique to describe the ad hoc decision making of ICU shift leaders. The study was performed in two university-affiliated hospital ICUs. Twelve charge nurses and eight intensivists were recruited. Observations were recorded and transcribed for qualitative content analysis using the protocol analysis method. The software program NVivo 7 was used to manage the data. The interrater agreement was assessed with percentages and by Cohen's κ. Results We identified 463 ad hoc decisions made by the charge nurses and 444 made by the intensivists. During our data collection time, this breaks down to over 230 immediately made decisions per day (24 hours). We divided the ad hoc decision making of ICU shift leaders into two types: process-focused and situation-focused. Process-focused decision making included more permanent information, such as human resources, know-how and material resources, whereas situation-focused decision making included decisions about single events, such as patient admission. We named eight different categories for ICU ad hoc decision making: (1) adverse events, (2) diagnostics, (3) human resources and know-how, (4) material resources, (5) patient admission, (6) patient discharge, (7) patient information and vital signs and (8) special treatments. Conclusions ICU shift leaders make a great number of complex ad hoc decisions throughout the day. Often this decision making involves both intensivists and charge nurses. It forms a bundle that requires versatile, immediate

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

  13. Standardization of negative controls in diagnostic immunohistochemistry: recommendations from the international ad hoc expert panel.

    PubMed

    Torlakovic, Emina E; Francis, Glenn; Garratt, John; Gilks, Blake; Hyjek, Elizabeth; Ibrahim, Merdol; Miller, Rodney; Nielsen, Søren; Petcu, Eugen B; Swanson, Paul E; Taylor, Clive R; Vyberg, Mogens

    2014-04-01

    Standardization of controls, both positive and negative controls, is needed for diagnostic immunohistochemistry (dIHC). The use of IHC-negative controls, irrespective of type, although well established, is not standardized. As such, the relevance and applicability of negative controls continues to challenge both pathologists and laboratory budgets. Despite the clear theoretical notion that appropriate controls serve to demonstrate the sensitivity and specificity of the dIHC test, it remains unclear which types of positive and negative controls are applicable and/or useful in day-to-day clinical practice. There is a perceived need to provide "best practice recommendations" for the use of negative controls. This perception is driven not only by logistics and cost issues, but also by increased pressure for accurate IHC testing, especially when IHC is performed for predictive markers, the number of which is rising as personalized medicine continues to develop. Herein, an international ad hoc expert panel reviews classification of negative controls relevant to clinical practice, proposes standard terminology for negative controls, considers the total evidence of IHC specificity that is available to pathologists, and develops a set of recommendations for the use of negative controls in dIHC based on "fit-for-use" principles.

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

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

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

  17. Ad-hoc Solutions for Capturing Electronic Structure Details in Classical Dynamics Simulations

    NASA Astrophysics Data System (ADS)

    Crill, John Wesley

    Traditional empirical potentials used in molecular dynamics (MD) simulations replace an explicit treatment of the electronic structure with an appropriate interatomic potential energy expression. This enables MD simulations to model atomistic processes, such as dislocation dynamics and plastic deformation, which typically require size and time domains exceeding what is currently feasible with computationally-demanding first principles techniques. However, discarding the electronic degrees of freedom prevents MD simulations from properly resolving certain phenomena which are dominated by electronic interactions. One example is thermal transport in metals, which is often underestimated by orders of magnitude in MD simulations. A recently-developed multi-scale simulation approach, allowing ad-hoc feedback from continuum heat flow solutions to thermostat atoms in an MD simulation, is used to model Joule-heating in nano-scale metallic contacts under electromagnetic stress. The simulations are carried out under conditions representative of contact surfaces in Radio Frequency Electromechanical Switches (RF MEMS) and rail/armature components of Electromagnetic Launchers (EMLs) and are used to speculate on the mechanisms for experimentally-observed material transfer. Another phenomenon that is typically neglected in MD simulations is charge transfer between atoms of dissimilar electronegativity. A common approach to incorporating a dynamic treatment of charge in a classical potential simulation is to solve atomic charges using an equalization of electronegativity in the charge equilibration (QEq) method. The current work studies the effectiveness of the QEq to mimic the charge distribution properties of f-center defects in a sodium chloride crystal. The results indicate that the QEq is able to replicate some of the electrostatic energy features of an f-center, which include an extremely localized potential well in the vicinity of the defect.

  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. Wide area sensor network

    NASA Astrophysics Data System (ADS)

    Mukhopadhyay, Sanjoy; Nix, Tricia; Junker, Robert; Brentano, Josef; Khona, Dhiren

    2006-05-01

    The technical concept for this project has existed since the Chernobyl accident in 1986. A host of Eastern European nations have developed countrywide grid of sensors to monitor airborne radiation. The objective is to build a radiological sensor network for real-time monitoring of environmental radiation levels in order to provide data for warning, and consequentially the assessment of a nuclear event. A network of radiation measuring equipment consisting of gamma, neutron, alpha, and beta counters would be distributed over a large area (preferably on fire station roof tops) and connected by a wireless network to the emergency response center. The networks would be deployed in urban environments and would supply first responders and federal augmentation teams (including those from the U.S. Departments of Energy, Defense, Justice, and Homeland Security) with detailed, accurate information regarding the transport of radioactive environmental contaminants, so the agencies can provide a safe and effective response. A networked sensor capability would be developed, with fixed sensors deployed at key locations and in sufficient numbers, to provide adequate coverage for early warning, and input to post-event emergency response. An overall system description and specification will be provided, including detector characteristics, communication protocols, infrastructure and maintenance requirements, and operation procedures. The system/network can be designed for a specifically identified urban area, or for a general urban area scalable to cities of specified size. Data collected via the network will be transmitted directly to the appropriate emergency response center and shared with multiple agencies via the Internet or an Intranet. The data collected will be managed using commercial off - the - shelf Geographical Information System (GIS). The data will be stored in a database and the GIS software will aid in analysis and management of the data. Unique features of the

  20. Non-line-of-sight optical wireless sensor network operating in multiscattering channel

    NASA Astrophysics Data System (ADS)

    Kedar, Debbie; Arnon, Shlomi

    2006-11-01

    Networks of sensors are envisaged to be major participants in future data-gathering systems for civilian and military applications, including medical and environmental monitoring and surveillance, home security, agriculture, and industry. Typically, a very large number of miniature sensing and communicating nodes are distributed ad hoc at the location of interest, where they establish a network and wirelessly communicate sensed data either to one another or to a base station using various network topologies. The optical modality is a potential solution for the links, due to the small and lightweight hardware and low power consumption, as well as other special features. Notably, the backscattering of light by molecules and aerosols in the atmosphere can function as a vehicle of communication in a way similar to the deployment of numerous tiny reflecting mirrors. The scattering of light at solar-blind ultraviolet wavelengths is of particular interest since scattering by atmospheric particles is significant and ambient solar interference is minimal. In this paper we derive a mathematical model of a simple and low-cost non-line-of-sight (NLOS) optical wireless sensor network operating in the solar-blind ultraviolet spectral range. The viability and limitations of the internode link are evaluated and found to facilitate miniature operational sensor networks.

  1. Wireless sensor network

    NASA Astrophysics Data System (ADS)

    Perotti, Jose M.; Lucena, Angel R.; Mullenix, Pamela A.; Mata, Carlos T.

    2006-05-01

    Current and future requirements of aerospace sensors and transducers demand the design and development of a new family of sensing devices, with emphasis on reduced weight, power consumption, and physical size. This new generation of sensors and transducers will possess a certain degree of intelligence in order to provide the end user with critical data in a more efficient manner. Communication between networks of traditional or next-generation sensors can be accomplished by a Wireless Sensor Network (WSN) developed by NASA's Instrumentation Branch and ASRC Aerospace Corporation at Kennedy Space Center (KSC), consisting of at least one central station and several remote stations and their associated software. The central station is application-dependent and can be implemented on different computer hardware, including industrial, handheld, or PC-104 single-board computers, on a variety of operating systems: embedded Windows, Linux, VxWorks, etc. The central stations and remote stations share a similar radio frequency (RF) core module hardware that is modular in design. The main components of the remote stations are an RF core module, a sensor interface module, batteries, and a power management module. These modules are stackable, and a common bus provides the flexibility to stack other modules for additional memory, increased processing, etc. WSN can automatically reconfigure to an alternate frequency if interference is encountered during operation. In addition, the base station will autonomously search for a remote station that was perceived to be lost, using relay stations and alternate frequencies. Several wireless remote-station types were developed and tested in the laboratory to support different sensing technologies, such as resistive temperature devices, silicon diodes, strain gauges, pressure transducers, and hydrogen leak detectors.

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

  3. Mobility based key management technique for multicast security in mobile ad hoc networks.

    PubMed

    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.

  4. Next Generation RFID-Based Medical Service Management System Architecture in Wireless Sensor Network

    NASA Astrophysics Data System (ADS)

    Tolentino, Randy S.; Lee, Kijeong; Kim, Yong-Tae; Park, Gil-Cheol

    Radio Frequency Identification (RFID) and Wireless Sensor Network (WSN) are two important wireless technologies that have wide variety of applications and provide unlimited future potentials most especially in healthcare systems. RFID is used to detect presence and location of objects while WSN is used to sense and monitor the environment. Integrating RFID with WSN not only provides identity and location of an object but also provides information regarding the condition of the object carrying the sensors enabled RFID tag. However, there isn't any flexible and robust communication infrastructure to integrate these devices into an emergency care setting. An efficient wireless communication substrate for medical devices that addresses ad hoc or fixed network formation, naming and discovery, transmission efficiency of data, data security and authentication, as well as filtration and aggregation of vital sign data need to be study and analyze. This paper proposed an efficient next generation architecture for RFID-based medical service management system in WSN that possesses the essential elements of each future medical application that are integrated with existing medical practices and technologies in real-time, remote monitoring, in giving medication, and patient status tracking assisted by embedded wearable wireless sensors which are integrated in wireless sensor network.

  5. A Survey on Multimedia-Based Cross-Layer Optimization in Visual Sensor Networks

    PubMed Central

    Costa, Daniel G.; Guedes, Luiz Affonso

    2011-01-01

    Visual sensor networks (VSNs) comprised of battery-operated electronic devices endowed with low-resolution cameras have expanded the applicability of a series of monitoring applications. Those types of sensors are interconnected by ad hoc error-prone wireless links, imposing stringent restrictions on available bandwidth, end-to-end delay and packet error rates. In such context, multimedia coding is required for data compression and error-resilience, also ensuring energy preservation over the path(s) toward the sink and improving the end-to-end perceptual quality of the received media. Cross-layer optimization may enhance the expected efficiency of VSNs applications, disrupting the conventional information flow of the protocol layers. When the inner characteristics of the multimedia coding techniques are exploited by cross-layer protocols and architectures, higher efficiency may be obtained in visual sensor networks. This paper surveys recent research on multimedia-based cross-layer optimization, presenting the proposed strategies and mechanisms for transmission rate adjustment, congestion control, multipath selection, energy preservation and error recovery. We note that many multimedia-based cross-layer optimization solutions have been proposed in recent years, each one bringing a wealth of contributions to visual sensor networks. PMID:22163908

  6. Use of synthesized data to support complex ad-hoc queries in an enterprise information warehouse: a diabetes use case.

    PubMed

    Rogers, Patrick; Erdal, Selnur; Santangelo, Jennifer; Liu, Jianhua; Schuster, Dara; Kamal, Jyoti

    2008-11-06

    The Ohio State University Medical Center (OSUMC) Information Warehouse (IW) is a comprehensive data warehousing facility incorporating operational, clinical, and biological data sets from multiple enterprise system. It is common for users of the IW to request complex ad-hoc queries that often require significant intervention by data analyst. In response to this challenge, we have designed a workflow that leverages synthesized data elements to support such queries in an more timely, efficient manner.

  7. HOW GAS-DYNAMIC FLARE MODELS POWERED BY PETSCHEK RECONNECTION DIFFER FROM THOSE WITH AD HOC ENERGY SOURCES

    SciTech Connect

    Longcope, D. W.; Klimchuk, J. A.

    2015-11-10

    Aspects of solar flare dynamics, such as chromospheric evaporation and flare light curves, have long been studied using one-dimensional models of plasma dynamics inside a static flare loop, subjected to some energy input. While extremely successful at explaining the observed characteristics of flares, all such models so far have specified energy input ad hoc, rather than deriving it self-consistently. There is broad consensus that flares are powered by magnetic energy released through reconnection. Recent work has generalized Petschek’s basic reconnection scenario, topological change followed by field line retraction and shock heating, to permit its inclusion in a one-dimensional flare loop model. Here we compare the gas dynamics driven by retraction and shocking to those from more conventional static loop models energized by ad hoc source terms. We find significant differences during the first minute, when retraction leads to larger kinetic energies and produces higher densities at the loop top, while ad hoc heating tends to rarify the loop top. The loop-top density concentration is related to the slow magnetosonic shock, characteristic of Petschek’s model, but persists beyond the retraction phase occurring in the outflow jet. This offers an explanation for observed loop-top sources of X-ray and EUV emission, with advantages over that provided by ad hoc heating scenarios. The cooling phases of the two models are, however, notably similar to one another, suggesting that observations at that stage will yield little information on the nature of energy input.

  8. remote sensor network

    NASA Astrophysics Data System (ADS)

    von Unold, Georg; Junker, Astrid; Altmann, Thomas

    2016-04-01

    High-throughput (HT) plant phenotyping systems enable the quantitative analysis of a variety of plant features in a fully automated fashion. The comprehensive phenomics infrastructure at IPK comprises three LemnaTec conveyor belt-based (plant-to-sensor) systems for the simultaneous analysis of large numbers of individual plants of different sizes. For monitoring of environmental conditions within the plant growth area and soil conditions in individual pots, highly modular and flexible remote sensing devices are required. We present the architecture of a wireless sensor network implemented in the HT plant phenotyping systems at IPK in the frame of the German Plant Phenotyping Network (DPPN). This system comprises 350 soil monitoring modules, each measuring water content, water matrix potential, temperature and electric conductivity. Furthermore small and large sensor platforms enable the continuous monitoring of environmental parameters such as incident photosynthetic active radiation, total radiation balance, relative humidity and CO2 concentration and more. Finally we present an introduction into data management and maintenance."

  9. Bio-Mimic Optimization Strategies in Wireless Sensor Networks: A Survey

    PubMed Central

    Adnan, Md. Akhtaruzzaman; Razzaque, Mohammd Abdur; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

    2014-01-01

    For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted. PMID:24368702

  10. Bio-mimic optimization strategies in wireless sensor networks: a survey.

    PubMed

    Adnan, Md Akhtaruzzaman; Abdur Razzaque, Mohammd; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

    2013-01-01

    For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted. PMID:24368702

  11. Bio-mimic optimization strategies in wireless sensor networks: a survey.

    PubMed

    Adnan, Md Akhtaruzzaman; Abdur Razzaque, Mohammd; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

    2013-12-24

    For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted.

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

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

  14. Underwater Sensor Nodes and Networks

    PubMed Central

    Lloret, Jaime

    2013-01-01

    Sensor technology has matured enough to be used in any type of environment. The appearance of new physical sensors has increased the range of environmental parameters for gathering data. Because of the huge amount of unexploited resources in the ocean environment, there is a need of new research in the field of sensors and sensor networks. This special issue is focused on collecting recent advances on underwater sensors and underwater sensor networks in order to measure, monitor, surveillance of and control of underwater environments. On the one hand, from the sensor node perspective, we will see works related with the deployment of physical sensors, development of sensor nodes and transceivers for sensor nodes, sensor measurement analysis and several issues such as layer 1 and 2 protocols for underwater communication and sensor localization and positioning systems. On the other hand, from the sensor network perspective, we will see several architectures and protocols for underwater environments and analysis concerning sensor network measurements. Both sides will provide us a complete view of last scientific advances in this research field. PMID:24013489

  15. Software Architecture of Sensor Data Distribution In Planetary Exploration

    NASA Technical Reports Server (NTRS)

    Lee, Charles; Alena, Richard; Stone, Thom; Ossenfort, John; Walker, Ed; Notario, Hugo

    2006-01-01

    Data from mobile and stationary sensors will be vital in planetary surface exploration. The distribution and collection of sensor data in an ad-hoc wireless network presents a challenge. Irregular terrain, mobile nodes, new associations with access points and repeaters with stronger signals as the network reconfigures to adapt to new conditions, signal fade and hardware failures can cause: a) Data errors; b) Out of sequence packets; c) Duplicate packets; and d) Drop out periods (when node is not connected). To mitigate the effects of these impairments, a robust and reliable software architecture must be implemented. This architecture must also be tolerant of communications outages. This paper describes such a robust and reliable software infrastructure that meets the challenges of a distributed ad hoc network in a difficult environment and presents the results of actual field experiments testing the principles and actual code developed.

  16. Mobile Wireless Sensor Networks for Advanced Soil Sensing and Ecosystem Monitoring

    NASA Astrophysics Data System (ADS)

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

    2015-04-01

    For an adequate characterization of ecosystems it is necessary to detect individual processes with suitable monitoring strategies and methods. Due to the natural complexity of all environmental compartments, single point or temporally and spatially fixed measurements are mostly insufficient for an adequate representation. The application of mobile wireless sensor networks for soil and atmosphere sensing offers significant benefits, due to the simple adjustment of the sensor distribution, the sensor types and the sample rate (e.g. by using optimization approaches or event triggering modes) to the local test conditions. This can be essential for the monitoring of heterogeneous and dynamic environmental systems and processes. One significant advantage in the application of mobile ad-hoc wireless sensor networks is their self-organizing behavior. Thus, the network autonomously initializes and optimizes itself. Due to the localization via satellite a major reduction in installation and operation costs and time is generated. In addition, single point measurements with a sensor are significantly improved by measuring at several optimized points continuously. Since performing analog and digital signal processing and computation in the sensor nodes close to the sensors a significant reduction of the data to be transmitted can be achieved which leads to a better energy management of nodes. Furthermore, the miniaturization of the nodes and energy harvesting are current topics under investigation. First results of field measurements are given to present the potentials and limitations of this application in environmental science. In particular, collected in-situ data with numerous specific soil and atmosphere parameters per sensor node (more than 25) recorded over several days illustrates the high performance of this system for advanced soil sensing and soil-atmosphere interaction monitoring. Moreover, investigations of biotic and abiotic process interactions and optimization

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

  18. Application of Game Theory Approaches in Routing Protocols for Wireless Networks

    NASA Astrophysics Data System (ADS)

    Javidi, Mohammad M.; Aliahmadipour, Laya

    2011-09-01

    An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that applied game theory approaches for various wireless networks such as ad hoc networks, mobile ad hoc networks and sensor networks that all of them lead to improve the network performance.

  19. Cooperative Localization Bounds for Indoor Ultra-Wideband Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Alsindi, Nayef; Pahlavan, Kaveh

    2007-12-01

    In recent years there has been growing interest in ad-hoc and wireless sensor networks (WSNs) for a variety of indoor applications. Localization information in these networks is an enabling technology and in some applications it is the main sought after parameter. The cooperative localization performance of WSNs is constrained by the behavior of the utilized ranging technology in dense cluttered indoor environments. Recently, ultra-wideband (UWB) Time-of-Arrival (TOA) based ranging has exhibited potential due to its large bandwidth and high time resolution. The performance of its ranging and cooperative localization capabilities in dense indoor multipath environments, however, needs to be further investigated. Of main concern is the high probability of non-line of sight (NLOS) and Direct Path (DP) blockage between sensor nodes which biases the TOA estimation and degrades the localization performance. In this paper, based on empirical models of UWB TOA-based Outdoor-to-Indoor (OTI) and Indoor-to-Indoor (ITI) ranging, we derive and analyze cooperative localization bounds for WSNs in different indoor multipath environments: residential, manufacturing floor, old office and modern office buildings. First, we highlight the need for cooperative localization in indoor applications. Then we provide comprehensive analysis of the factors affecting localization accuracy such as network and ranging model parameters.

  20. An ontology for sensor networks

    NASA Astrophysics Data System (ADS)

    Compton, Michael; Neuhaus, Holger; Bermudez, Luis; Cox, Simon

    2010-05-01

    Sensors and networks of sensors are important ways of monitoring and digitizing reality. As the number and size of sensor networks grows, so too does the amount of data collected. Users of such networks typically need to discover the sensors and data that fit their needs without necessarily understanding the complexities of the network itself. The burden on users is eased if the network and its data are expressed in terms of concepts familiar to the users and their job functions, rather than in terms of the network or how it was designed. Furthermore, the task of collecting and combining data from multiple sensor networks is made easier if metadata about the data and the networks is stored in a format and conceptual models that is amenable to machine reasoning and inference. While the OGC's (Open Geospatial Consortium) SWE (Sensor Web Enablement) standards provide for the description and access to data and metadata for sensors, they do not provide facilities for abstraction, categorization, and reasoning consistent with standard technologies. Once sensors and networks are described using rich semantics (that is, by using logic to describe the sensors, the domain of interest, and the measurements) then reasoning and classification can be used to analyse and categorise data, relate measurements with similar information content, and manage, query and task sensors. This will enable types of automated processing and logical assurance built on OGC standards. The W3C SSN-XG (Semantic Sensor Networks Incubator Group) is producing a generic ontology to describe sensors, their environment and the measurements they make. The ontology provides definitions for the structure of sensors and observations, leaving the details of the observed domain unspecified. This allows abstract representations of real world entities, which are not observed directly but through their observable qualities. Domain semantics, units of measurement, time and time series, and location and mobility

  1. An Overview of the Sensor Networks

    NASA Astrophysics Data System (ADS)

    Ikegami, Tetsushi

    Recently, the sensor network technology attracts a great deal of attention achieving a safe and comfortable ubiquitous society. The sensor networks are already used in environment and disaster monitoring, medical care, logistics and transportation. This paper aimed to understand the outline of the sensor network technology centering on the wireless sensor network technology.

  2. Wireless Sensor Networks: Monitoring and Control

    SciTech Connect

    Hastbacka, Mildred; Ponoum, Ratcharit; Bouza, Antonio

    2013-05-31

    The article discusses wireless sensor technologies for building energy monitoring and control. This article, also, addresses wireless sensor networks as well as benefits and challenges of using wireless sensors. The energy savings and market potential of wireless sensors are reviewed.

  3. Sensorpedia: Information Sharing Across Autonomous Sensor Systems

    SciTech Connect

    Gorman, Bryan L; Resseguie, David R; Tomkins-Tinch, Christopher H

    2009-01-01

    The concept of adapting social media technologies is introduced as a means of achieving information sharing across autonomous sensor systems. Historical examples of interoperability as an underlying principle in loosely-coupled systems is compared and contrasted with corresponding tightly-coupled, integrated systems. Examples of ad hoc information sharing solutions based on Web 2.0 social networks, mashups, blogs, wikis, and data tags are presented and discussed. The underlying technologies of these solutions are isolated and defined, and Sensorpedia is presented as a formalized application for implementing sensor information sharing across large-scale enterprises with incompatible autonomous sensor systems.

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

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

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

  7. Networked Sensor Arrays

    SciTech Connect

    R. J. Tighe

    2002-10-01

    A set of independent radiation sensors, coupled with real-time data telemetry, offers the opportunity to run correlation algorithms for the sensor array as well as to incorporate non-radiological data into the system. This may enhance the overall sensitivity of the sensors and provide an opportunity to project the location of a source within the array. In collaboration with Lawrence Livermore National Laboratory (LLNL) and Sandia National Laboratories (SNL), we have conducted field experiments to test a prototype system. Combining the outputs of a set of distributed sensors permits the correlation that the independent sensor outputs. Combined with additional information such as traffic patterns and velocities, this can reduce random/false detections and enhance detection capability. The principle components of such a system include: (1) A set of radiation sensors. These may be of varying type and complexity, including gamma and/or neutron detectors, gross count and spectral-capable sensors, and low to high energy-resolution sensors. (2) A set of non-radiation sensors. These may include sensors such as vehicle presence and imaging sensors. (3) A communications architecture for near real-time telemetry. Depending upon existing infrastructure and bandwidth requirements, this may be a radio or hard-wire based system. (4) A central command console to pole the sensors, correlate their output, and display the data in a meaningful form to the system operator. Both sensitivity and selectivity are important considerations when evaluating the performance of a detection system. Depending on the application, the optimization of sensitivity as well as the rejection of ''nuisance'' radioactive sources may or may not be critical.

  8. Network compensation for missing sensors

    NASA Technical Reports Server (NTRS)

    Ahumada, Albert J., Jr.; Mulligan, Jeffrey B.

    1991-01-01

    A network learning translation invariance algorithm to compute interpolation functions is presented. This algorithm with one fixed receptive field can construct a linear transformation compensating for gain changes, sensor position jitter, and sensor loss when there are enough remaining sensors to adequately sample the input images. However, when the images are undersampled and complete compensation is not possible, the algorithm need to be modified. For moderate sensor losses, the algorithm works if the transformation weight adjustment is restricted to the weights to output units affected by the loss.

  9. A Low-Power Sensor Network for Long Duration Monitoring in Deep Caves

    NASA Astrophysics Data System (ADS)

    Silva, A.; Johnson, I.; Bick, T.; Winclechter, C.; Jorgensen, A. M.; Teare, S. W.; Arechiga, R. O.

    2010-12-01

    Monitoring deep and inaccessible caves is important and challenging for a variety of reasons. It is of interest to study caves environments for understanding cave ecosystems, and human impact on the ecosystems. Caves may also hold clues to past climate changes. Cave instrumentation must however carry out its job with minimal human intervention and without disturbing the fragile environment. This requires unobtrusive and autonomous instrumentation. Earth-bound caves can also serve as analogs for caves on other planets and act as testbeds for autonomous sensor networks. Here we report on a project to design and implement a low-power, ad-hoc, wireless sensor network for monitoring caves and similar environments. The implemented network is composed of individual nodes which consist of a sensor, processing unit, memory, transceiver and a power source. Data collected at these nodes is transmitted through a wireless ZigBee network to a central data collection point from which the researcher may transfer collected data to a laptop for further analysis. The project accomplished a node design with a physical footprint of 2 inches long by 3 inches wide. The design is based on the EZMSP430-RF2480, a Zigbee hardware base offered by Texas Instruments. Five functioning nodes have been constructed at very low cost and tested. Due to the use of an external analog-to-digital converter the design was able to achieve a 16-bit resolution. The operational time achieved by the prototype was calculated to be approximately 80 days of autonomous operation while sampling once per minute. Each node is able to support and record data from up to four different sensors.

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

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

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

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

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

  15. Energy efficient sensor network implementations

    SciTech Connect

    Frigo, Janette R; Raby, Eric Y; Brennan, Sean M; Kulathumani, Vinod; Rosten, Ed; Wolinski, Christophe; Wagner, Charles; Charot, Francois

    2009-01-01

    In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. We analyze the following modes of operation; event detection, sleep(wake-up), data acquisition, data processing modes using low power, high performance embedded technology such as specialized embedded DSP processors and a low power FPGAs at the sensing node. We use compute intensive sensor node applications: an acoustic vehicle classifier (frequency domain analysis) and a video license plate identification application (learning algorithm) as a case study. We report performance and total energy usage for our system implementations and discuss the system architecture design trade offs.

  16. Sensor Network Architectures for Monitoring Underwater Pipelines

    PubMed Central

    Mohamed, Nader; Jawhar, Imad; Al-Jaroodi, Jameela; Zhang, Liren

    2011-01-01

    This paper develops and compares different sensor network architecture designs that can be used for monitoring underwater pipeline infrastructures. These architectures are underwater wired sensor networks, underwater acoustic wireless sensor networks, RF (Radio Frequency) wireless sensor networks, integrated wired/acoustic wireless sensor networks, and integrated wired/RF wireless sensor networks. The paper also discusses the reliability challenges and enhancement approaches for these network architectures. The reliability evaluation, characteristics, advantages, and disadvantages among these architectures are discussed and compared. Three reliability factors are used for the discussion and comparison: the network connectivity, the continuity of power supply for the network, and the physical network security. In addition, the paper also develops and evaluates a hierarchical sensor network framework for underwater pipeline monitoring. PMID:22346669

  17. Sensor network architectures for monitoring underwater pipelines.

    PubMed

    Mohamed, Nader; Jawhar, Imad; Al-Jaroodi, Jameela; Zhang, Liren

    2011-01-01

    This paper develops and compares different sensor network architecture designs that can be used for monitoring underwater pipeline infrastructures. These architectures are underwater wired sensor networks, underwater acoustic wireless sensor networks, RF (radio frequency) wireless sensor networks, integrated wired/acoustic wireless sensor networks, and integrated wired/RF wireless sensor networks. The paper also discusses the reliability challenges and enhancement approaches for these network architectures. The reliability evaluation, characteristics, advantages, and disadvantages among these architectures are discussed and compared. Three reliability factors are used for the discussion and comparison: the network connectivity, the continuity of power supply for the network, and the physical network security. In addition, the paper also develops and evaluates a hierarchical sensor network framework for underwater pipeline monitoring.

  18. Availability and End-to-end Reliability in Low Duty Cycle Multihop Wireless Sensor Networks

    PubMed Central

    Suhonen, Jukka; Hämäläinen, Timo D.; Hännikäinen, Marko

    2009-01-01

    A wireless sensor network (WSN) is an ad-hoc technology that may even consist of thousands of nodes, which necessitates autonomic, self-organizing and multihop operations. A typical WSN node is battery powered, which makes the network lifetime the primary concern. The highest energy efficiency is achieved with low duty cycle operation, however, this alone is not enough. WSNs are deployed for different uses, each requiring acceptable Quality of Service (QoS). Due to the unique characteristics of WSNs, such as dynamic wireless multihop routing and resource constraints, the legacy QoS metrics are not feasible as such. We give a new definition to measure and implement QoS in low duty cycle WSNs, namely availability and reliability. Then, we analyze the effect of duty cycling for reaching the availability and reliability. The results are obtained by simulations with ZigBee and proprietary TUTWSN protocols. Based on the results, we also propose a data forwarding algorithm suitable for resource constrained WSNs that guarantees end-to-end reliability while adding a small overhead that is relative to the packet error rate (PER). The forwarding algorithm guarantees reliability up to 30% PER. PMID:22574002

  19. Sensor Fusion of Position- and Micro-Sensors (MEMS) integrated in a Wireless Sensor Network for movement detection in landslide areas

    NASA Astrophysics Data System (ADS)

    Arnhardt, Christian; Fernández-Steeger, Tomas; Azzam, Rafig

    2010-05-01

    Monitoring systems in landslide areas are important elements of effective Early Warning structures. Data acquisition and retrieval allows the detection of movement processes and thus is essential to generate warnings in time. Apart from the precise measurement, the reliability of data is fundamental, because outliers can trigger false alarms and leads to the loss of acceptance of such systems. For the monitoring of mass movements and their risk it is important to know, if there is movement, how fast it is and how trustworthy is the information. The joint project "Sensorbased landslide early warning system" (SLEWS) deals with these questions, and tries to improve data quality and to reduce false alarm rates, due to the combination of sensor date (sensor fusion). The project concentrates on the development of a prototypic Alarm- and Early Warning system (EWS) for different types of landslides by using various low-cost sensors, integrated in a wireless sensor network (WSN). The network consists of numerous connection points (nodes) that transfer data directly or over other nodes (Multi-Hop) in real-time to a data collection point (gateway). From there all the data packages are transmitted to a spatial data infrastructure (SDI) for further processing, analyzing and visualizing with respect to end-user specifications. The ad-hoc characteristic of the network allows the autonomous crosslinking of the nodes according to existing connections and communication strength. Due to the independent finding of new or more stable connections (self healing) a breakdown of the whole system is avoided. The bidirectional data stream enables the receiving of data from the network but also allows the transfer of commands and pointed requests into the WSN. For the detection of surface deformations in landslide areas small low-cost Micro-Electro-Mechanical-Systems (MEMS) and positionsensors from the automobile industries, different industrial applications and from other measurement

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

  1. Wireless sensor network: an aimless gadget or a necessary tool for natural hazards warning systems

    NASA Astrophysics Data System (ADS)

    Hloupis, George; Stavrakas, Ilias; Triantis, Dimos

    2010-05-01

    The purpose of the current study is to review the current technical and scientific state of wireless sensor networks (WSNs) with application on natural hazards. WSN have received great attention from the research community in the last few years, mainly due to the theoretical and practical efforts from challenges that led to mature solutions and adoption of standards, such as Bluetooth [2] and ZigBee [3]. Wireless technology solutions allows Micro-ElectroMechanical Systems sensors (MEMS) to be integrated (with all the necessary circuitry) to small wireless capable devices, the nodes. Available MEMS today include pressure, temperature, humidity, inertial and strain-gauge sensors as well as transducers for velocity, acceleration, vibration, flow position and inclination [4]. A WSN is composed by a large number of nodes which are deployed densely adjacent to the area under monitoring. Each node collects data which transmitted to a gateway. The main requirements that WSNs must fulfilled are quite different than those of ad-hoc networks. WSNs have to be self-organized (since the positions of individual nodes are not known in advance), they must present cooperative processing of tasks (where groups of nodes cooperate in order to provide the gathered data to the user), they require security mechanisms that are adaptive to monitoring conditions and all algorithms must be energy optimized. In this paper, the state of the art in hardware, software, algorithms and protocols for WSNs, focused on natural hazards, is surveyed. Architectures for WSNs are investigated along with their advantages and drawbacks. Available research prototypes as well as commercially proposed solutions that can be used for natural hazards monitoring and early warning systems are listed and classified. [1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey, Comput. Networks (Elsevier) 38 (4) (2002) 393-422. [2] Dursch, A.; Yen, D.C.; Shih, D.H. Bluetooth

  2. Ad Hoc Conference on the Education of Migrants (Strasbourg, France, November 5-8, 1974). Council of Europe, Standing Conference of European Ministers of Education, Country Reports.

    ERIC Educational Resources Information Center

    Council of Europe, Strasbourg (France). Documentation Center for Education in Europe.

    In Resolution No. 4 of their 7th Conference (Brussels, June 1971) the Ministers of Education of 21 nations signatory to the European Cultural Convention instructed the Committee of Senior Officials to study, in collaboration with the Secretariat of the Council of Europe, the practical arrangements for holding an ad hoc conference on problems…

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

  4. Report of the Ad Hoc Committee to Review the Status of Women at The Ohio State University, Phases I and II.

    ERIC Educational Resources Information Center

    Schoen, Kathryn T.; And Others

    In the late summer of 1970, an Ad Hoc Committee at the Ohio State University was appointed (1) to review the status of all women at the University; and (2) to submit a report of the findings and recommendations. The Committee consisted of 3 undergraduate students, 1 graduate student, 2 administrative personnel, and 3 faculty members, one of whom…

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

  6. Meeting the Needs of CALS Students for Computing Capabilities. Final Report of the Ad Hoc Committee on College of Agriculture and Life Sciences Student Computing Competencies.

    ERIC Educational Resources Information Center

    Monk, David; And Others

    The Ad Hoc Committee on the Cornell University (New York) College of Agriculture and Life Sciences (CALS) Student Computing Competencies was appointed in the fall of 1995 to determine (1) what all CALS undergraduate students should know about computing and related technologies; (2) how the college can make it possible for students to develop these…

  7. Consensus statement: the use of intravenous immunoglobulin in the treatment of neuromuscular conditions report of the AANEM ad hoc committee.

    PubMed

    Donofrio, Peter D; Berger, Alan; Brannagan, Thomas H; Bromberg, Mark B; Howard, James F; Latov, Normal; Quick, Adam; Tandan, Rup

    2009-11-01

    Intravenous immunoglobulin (IVIG) is a therapeutic biologic agent that has been prescribed for over two decades to treat various neuromuscular conditions. Most of the treatments are given off-label, as little evidence from large randomized trials exists to support its use. Recently, IGIV-C has received an indication for the treatment of chronic inflammatory demyelinating polyneuropathy (CIDP). Because of the lack of evidence, an ad hoc committee of the AANEM was convened to draft a consensus statement on the rational use of IVIG for neuromuscular disorders. Recommendations were categorized as Class I-IV based on the strength of the medical literature. Class I evidence exists to support the prescription of IVIG to treat patients with Guillain-Barré syndrome (GBS), CIDP, multifocal motor neuropathy, refractory exacerbations of myasthenia gravis, Lambert-Eaton syndrome, dermatomyositis, and stiff person syndrome. Treatment of Fisher syndrome, polymyositis, and certain presumed autoimmune neuromuscular disorders is supported only by Class IV studies, whereas there is no convincing data to substantiate the treatment of inclusion body myopathy (IBM), idiopathic neuropathies, brachial plexopathy, or diabetic amyotrophy using IVIG. Treatment with IVIG must be administered in the context of its known adverse effects. There is little evidence to advise the clinician on the proper dosing of IVIG and duration of therapy.

  8. Two new ad-hoc models of detection physics and their evaluation for navigated beta probe surface imaging

    NASA Astrophysics Data System (ADS)

    Shakir, Dzhoshkun I.; Hartl, Alexander; Schneider, Florian R.; Pulko, Jozef; Ziegler, Sibylle I.; Navab, Nassir; Lasser, Tobias

    2012-02-01

    Intra-operative surface imaging with navigated beta probes in conjunction with positron-emitting radiotracers like 18F-FDG has been shown to enable control of tumor resection borders. We showed previously that employing iterative reconstruction (MLEM) in conjunction with an ad-hoc model of the detection physics (based on solid-angle geometry, SA) improves the image quality. In this study, we sampled the beta probe readings of a point source using a precision step-motor to generate a look-up-table (LUT) model. We also generated a simplified geometrical model (SG) based on this data set. To see how these two models influence the image quality compared to the old SA model, we reconstructed images from sparsely sampled datasets of a phantom with three hotspots using each model. The images yielded 76% (SA), 81% (SG), and 81% (LUT) mean NCC compared to the ground truth. The SG and LUT models, however, could resolve the hotspots better in the datasets where the detector-to-phantom distance was larger. Additionally, we compared the deviations of the SA and SG analytical models to the measured LUT model, where we found that the SG model gives estimates substantially closer to the actual beta probe readings than the previous SA model.

  9. Canonical and kinetic forms of the electromagnetic momentum in an ad hoc quantization scheme for a dispersive dielectric

    SciTech Connect

    Garrison, J.C.; Chiao, R.Y.

    2004-11-01

    An ad hoc quantization scheme for the electromagnetic field in a weakly dispersive, transparent dielectric leads to the definition of canonical and kinetic forms for the momentum of the electromagnetic field in a dispersive medium. The canonical momentum is uniquely defined as the operator that generates spatial translations in a uniform medium, but the quantization scheme suggests two possible choices for the kinetic momentum operator, corresponding to the Abraham or the Minkowski momentum in classical electrodynamics. Another implication of this procedure is that a wave packet containing a single dressed photon travels at the group velocity through the medium. The physical significance of the canonical momentum has already been established by considerations of energy and momentum conservation in the atomic recoil due to spontaneous emission, the Cerenkov effect, the Doppler effect, and phase matching in nonlinear optical processes. In addition, the data of the Jones and Leslie radiation pressure experiment is consistent with the assignment of one ({Dirac_h}/2{pi})k unit of canonical momentum to each dressed photon. By contrast, experiments in which the dielectric is rigidly accelerated by unbalanced electromagnetic forces require the use of the Abraham momentum.

  10. Environmental Monitoring Using Sensor Networks

    NASA Astrophysics Data System (ADS)

    Yang, J.; Zhang, C.; Li, X.; Huang, Y.; Fu, S.; Acevedo, M. F.

    2008-12-01

    Environmental observatories, consisting of a variety of sensor systems, computational resources and informatics, are important for us to observe, model, predict, and ultimately help preserve the health of the nature. The commoditization and proliferation of coin-to-palm sized wireless sensors will allow environmental monitoring with unprecedented fine spatial and temporal resolution. Once scattered around, these sensors can identify themselves, locate their positions, describe their functions, and self-organize into a network. They communicate through wireless channel with nearby sensors and transmit data through multi-hop protocols to a gateway, which can forward information to a remote data server. In this project, we describe an environmental observatory called Texas Environmental Observatory (TEO) that incorporates a sensor network system with intertwined wired and wireless sensors. We are enhancing and expanding the existing wired weather stations to include wireless sensor networks (WSNs) and telemetry using solar-powered cellular modems. The new WSNs will monitor soil moisture and support long-term hydrologic modeling. Hydrologic models are helpful in predicting how changes in land cover translate into changes in the stream flow regime. These models require inputs that are difficult to measure over large areas, especially variables related to storm events, such as soil moisture antecedent conditions and rainfall amount and intensity. This will also contribute to improve rainfall estimations from meteorological radar data and enhance hydrological forecasts. Sensor data are transmitted from monitoring site to a Central Data Collection (CDC) Server. We incorporate a GPRS modem for wireless telemetry, a single-board computer (SBC) as Remote Field Gateway (RFG) Server, and a WSN for distributed soil moisture monitoring. The RFG provides effective control, management, and coordination of two independent sensor systems, i.e., a traditional datalogger-based wired

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

  12. Modeling IoT-based solutions using human-centric wireless sensor networks.

    PubMed

    Monares, Álvaro; Ochoa, Sergio F; Santos, Rodrigo; Orozco, Javier; Meseguer, Roc

    2014-08-25

    The Internet of Things (IoT) has inspired solutions that are already available for addressing problems in various application scenarios, such as healthcare, security, emergency support and tourism. However, there is no clear approach to modeling these systems and envisioning their capabilities at the design time. Therefore, the process of designing these systems is ad hoc and its real impact is evaluated once the solution is already implemented, which is risky and expensive. This paper proposes a modeling approach that uses human-centric wireless sensor networks to specify and evaluate models of IoT-based systems at the time of design, avoiding the need to spend time and effort on early implementations of immature designs. It allows designers to focus on the system design, leaving the implementation decisions for a next phase. The article illustrates the usefulness of this proposal through a running example, showing the design of an IoT-based solution to support the first responses during medium-sized or large urban incidents. The case study used in the proposal evaluation is based on a real train crash. The proposed modeling approach can be used to design IoT-based systems for other application scenarios, e.g., to support security operatives or monitor chronic patients in their homes.

  13. Modeling IoT-based solutions using human-centric wireless sensor networks.

    PubMed

    Monares, Álvaro; Ochoa, Sergio F; Santos, Rodrigo; Orozco, Javier; Meseguer, Roc

    2014-01-01

    The Internet of Things (IoT) has inspired solutions that are already available for addressing problems in various application scenarios, such as healthcare, security, emergency support and tourism. However, there is no clear approach to modeling these systems and envisioning their capabilities at the design time. Therefore, the process of designing these systems is ad hoc and its real impact is evaluated once the solution is already implemented, which is risky and expensive. This paper proposes a modeling approach that uses human-centric wireless sensor networks to specify and evaluate models of IoT-based systems at the time of design, avoiding the need to spend time and effort on early implementations of immature designs. It allows designers to focus on the system design, leaving the implementation decisions for a next phase. The article illustrates the usefulness of this proposal through a running example, showing the design of an IoT-based solution to support the first responses during medium-sized or large urban incidents. The case study used in the proposal evaluation is based on a real train crash. The proposed modeling approach can be used to design IoT-based systems for other application scenarios, e.g., to support security operatives or monitor chronic patients in their homes. PMID:25157549

  14. Modeling IoT-Based Solutions Using Human-Centric Wireless Sensor Networks

    PubMed Central

    Monares, Álvaro; Ochoa, Sergio F.; Santos, Rodrigo; Orozco, Javier; Meseguer, Roc

    2014-01-01

    The Internet of Things (IoT) has inspired solutions that are already available for addressing problems in various application scenarios, such as healthcare, security, emergency support and tourism. However, there is no clear approach to modeling these systems and envisioning their capabilities at the design time. Therefore, the process of designing these systems is ad hoc and its real impact is evaluated once the solution is already implemented, which is risky and expensive. This paper proposes a modeling approach that uses human-centric wireless sensor networks to specify and evaluate models of IoT-based systems at the time of design, avoiding the need to spend time and effort on early implementations of immature designs. It allows designers to focus on the system design, leaving the implementation decisions for a next phase. The article illustrates the usefulness of this proposal through a running example, showing the design of an IoT-based solution to support the first responses during medium-sized or large urban incidents. The case study used in the proposal evaluation is based on a real train crash. The proposed modeling approach can be used to design IoT-based systems for other application scenarios, e.g., to support security operatives or monitor chronic patients in their homes. PMID:25157549

  15. Design and implementation of a framework for monitoring patients in hospitals using wireless sensors in ad hoc configuration.

    PubMed

    O'Donoughue, Nicholas; Kulkarni, Sarvesh; Marzella, Douglas

    2006-01-01

    Patients in hospital intensive care units (ICUs) have to be monitored constantly. Typically, unless the attending physician is at the bedside, he or she has no information of the patient's progress, and must be paged manually in case of emergencies. A far better system would be one that keeps the patient's information available to the doctor or nurse at all times, possibly through the use of a handheld device. The doctor would then be able to check on the patient's progress in real time. Should an emergency arise, the doctor would be notified directly by the monitoring system itself, saving valuable response time. This paper aims to set up an infrastructure for monitoring patients in hospital ICUs. An architectural framework and related protocols to support communication between the various components of such a system are presented. The prototyped product was successfully demonstrated to industry representatives, in November 2005, at Villanova University, PA.

  16. Hybrid architecture for building secure sensor networks

    NASA Astrophysics Data System (ADS)

    Owens, Ken R., Jr.; Watkins, Steve E.

    2012-04-01

    Sensor networks have various communication and security architectural concerns. Three approaches are defined to address these concerns for sensor networks. The first area is the utilization of new computing architectures that leverage embedded virtualization software on the sensor. Deploying a small, embedded virtualization operating system on the sensor nodes that is designed to communicate to low-cost cloud computing infrastructure in the network is the foundation to delivering low-cost, secure sensor networks. The second area focuses on securing the sensor. Sensor security components include developing an identification scheme, and leveraging authentication algorithms and protocols that address security assurance within the physical, communication network, and application layers. This function will primarily be accomplished through encrypting the communication channel and integrating sensor network firewall and intrusion detection/prevention components to the sensor network architecture. Hence, sensor networks will be able to maintain high levels of security. The third area addresses the real-time and high priority nature of the data that sensor networks collect. This function requires that a quality-of-service (QoS) definition and algorithm be developed for delivering the right data at the right time. A hybrid architecture is proposed that combines software and hardware features to handle network traffic with diverse QoS requirements.

  17. Bidirectional QoS support for novelty detection applications based on hierarchical wireless sensor network model

    NASA Astrophysics Data System (ADS)

    Edwards, Mark; Hu, Fei; Kumar, Sunil

    2004-10-01

    The research on the Novelty Detection System (NDS) (called as VENUS) at the authors' universities has generated exciting results. For example, we can detect an abnormal behavior (such as cars thefts from the parking lot) from a series of video frames based on the cognitively motivated theory of habituation. In this paper, we would like to describe the implementation strategies of lower layer protocols for using large-scale Wireless Sensor Networks (WSN) to NDS with Quality-of-Service (QoS) support. Wireless data collection framework, consisting of small and low-power sensor nodes, provides an alternative mechanism to observe the physical world, by using various types of sensing capabilities that include images (and even videos using Panoptos), sound and basic physical measurements such as temperature. We do not want to lose any 'data query command' packets (in the downstream direction: sink-to-sensors) or have any bit-errors in them since they are so important to the whole sensor network. In the upstream direction (sensors-to-sink), we may tolerate the loss of some sensing data packets. But the 'interested' sensing flow should be assigned a higher priority in terms of multi-hop path choice, network bandwidth allocation, and sensing data packet generation frequency (we hope to generate more sensing data packet for that novel event in the specified network area). The focus of this paper is to investigate MAC-level Quality of Service (QoS) issue in Wireless Sensor Networks (WSN) for Novelty Detection applications. Although QoS has been widely studied in other types of networks including wired Internet, general ad hoc networks and mobile cellular networks, we argue that QoS in WSN has its own characteristics. In wired Internet, the main QoS parameters include delay, jitter and bandwidth. In mobile cellular networks, two most common QoS metrics are: handoff call dropping probability and new call blocking probability. Since the main task of WSN is to detect and report

  18. Availability issues in wireless visual sensor networks.

    PubMed

    Costa, Daniel G; Silva, Ivanovitch; Guedes, Luiz Affonso; Vasques, Francisco; Portugal, Paulo

    2014-01-01

    Wireless visual sensor networks have been considered for a large set of monitoring applications related with surveillance, tracking and multipurpose visual monitoring. When sensors are deployed over a monitored field, permanent faults may happen during the network lifetime, reducing the monitoring quality or rendering parts or the entire network unavailable. In a different way from scalar sensor networks, camera-enabled sensors collect information following a directional sensing model, which changes the notions of vicinity and redundancy. Moreover, visual source nodes may have different relevancies for the applications, according to the monitoring requirements and cameras' poses. In this paper we discuss the most relevant availability issues related to wireless visual sensor networks, addressing availability evaluation and enhancement. Such discussions are valuable when designing, deploying and managing wireless visual sensor networks, bringing significant contributions to these networks. PMID:24526301

  19. Availability Issues in Wireless Visual Sensor Networks

    PubMed Central

    Costa, Daniel G.; Silva, Ivanovitch; Guedes, Luiz Affonso; Vasques, Francisco; Portugal, Paulo

    2014-01-01

    Wireless visual sensor networks have been considered for a large set of monitoring applications related with surveillance, tracking and multipurpose visual monitoring. When sensors are deployed over a monitored field, permanent faults may happen during the network lifetime, reducing the monitoring quality or rendering parts or the entire network unavailable. In a different way from scalar sensor networks, camera-enabled sensors collect information following a directional sensing model, which changes the notions of vicinity and redundancy. Moreover, visual source nodes may have different relevancies for the applications, according to the monitoring requirements and cameras' poses. In this paper we discuss the most relevant availability issues related to wireless visual sensor networks, addressing availability evaluation and enhancement. Such discussions are valuable when designing, deploying and managing wireless visual sensor networks, bringing significant contributions to these networks. PMID:24526301

  20. Autonomic and Coevolutionary Sensor Networking

    NASA Astrophysics Data System (ADS)

    Boonma, Pruet; Suzuki, Junichi

    (WSNs) applications are often required to balance the tradeoffs among conflicting operational objectives (e.g., latency and power consumption) and operate at an optimal tradeoff. This chapter proposes and evaluates a architecture, called BiSNET/e, which allows WSN applications to overcome this issue. BiSNET/e is designed to support three major types of WSN applications: , and hybrid applications. Each application is implemented as a decentralized group of, which is analogous to a bee colony (application) consisting of bees (agents). Agents collect sensor data or detect an event (a significant change in sensor reading) on individual nodes, and carry sensor data to base stations. They perform these data collection and event detection functionalities by sensing their surrounding network conditions and adaptively invoking behaviors such as pheromone emission, reproduction, migration, swarming and death. Each agent has its own behavior policy, as a set of genes, which defines how to invoke its behaviors. BiSNET/e allows agents to evolve their behavior policies (genes) across generations and autonomously adapt their performance to given objectives. Simulation results demonstrate that, in all three types of applications, agents evolve to find optimal tradeoffs among conflicting objectives and adapt to dynamic network conditions such as traffic fluctuations and node failures/additions. Simulation results also illustrate that, in hybrid applications, data collection agents and event detection agents coevolve to augment their adaptability and performance.

  1. Wi-GIM system: a new wireless sensor network (WSN) for accurate ground instability monitoring

    NASA Astrophysics Data System (ADS)

    Mucchi, Lorenzo; Trippi, Federico; Schina, Rosa; Fornaciai, Alessandro; Gigli, Giovanni; Nannipieri, Luca; Favalli, Massimiliano; Marturia Alavedra, Jordi; Intrieri, Emanuele; Agostini, Andrea; Carnevale, Ennio; Bertolini, Giovanni; Pizziolo, Marco; Casagli, Nicola

    2016-04-01

    Landslides are among the most serious and common geologic hazards around the world. Their impact on human life is expected to increase in the next future as a consequence of human-induced climate change as well as the population growth in proximity of unstable slopes. Therefore, developing better performing technologies for monitoring landslides and providing local authorities with new instruments able to help them in the decision making process, is becoming more and more important. The recent progresses in Information and Communication Technologies (ICT) allow us to extend the use of wireless technologies in landslide monitoring. In particular, the developments in electronics components have permitted to lower the price of the sensors and, at the same time, to actuate more efficient wireless communications. In this work we present a new wireless sensor network (WSN) system, designed and developed for landslide monitoring in the framework of EU Wireless Sensor Network for Ground Instability Monitoring - Wi-GIM project (LIFE12 ENV/IT/001033). We show the preliminary performance of the Wi-GIM system after the first period of monitoring on the active Roncovetro Landslide and on a large subsiding area in the neighbourhood of Sallent village. The Roncovetro landslide is located in the province of Reggio Emilia (Italy) and moved an inferred volume of about 3 million cubic meters. Sallent village is located at the centre of the Catalan evaporitic basin in Spain. The Wi-GIM WSN monitoring system consists of three levels: 1) Master/Gateway level coordinates the WSN and performs data aggregation and local storage; 2) Master/Server level takes care of acquiring and storing data on a remote server; 3) Nodes level that is based on a mesh of peripheral nodes, each consisting in a sensor board equipped with sensors and wireless module. The nodes are located in the landslide ground perimeter and are able to create an ad-hoc WSN. The location of each sensor on the ground is

  2. Visualization and Analysis of Wireless Sensor Network Data for Smart Civil Structure Applications Based On Spatial Correlation Technique

    NASA Astrophysics Data System (ADS)

    Chowdhry, Bhawani Shankar; White, Neil M.; Jeswani, Jai Kumar; Dayo, Khalil; Rathi, Manorma

    2009-07-01

    Disasters affecting infrastructure, such as the 2001 earthquakes in India, 2005 in Pakistan, 2008 in China and the 2004 tsunami in Asia, provide a common need for intelligent buildings and smart civil structures. Now, imagine massive reductions in time to get the infrastructure working again, realtime information on damage to buildings, massive reductions in cost and time to certify that structures are undamaged and can still be operated, reductions in the number of structures to be rebuilt (if they are known not to be damaged). Achieving these ideas would lead to huge, quantifiable, long-term savings to government and industry. Wireless sensor networks (WSNs) can be deployed in buildings to make any civil structure both smart and intelligent. WSNs have recently gained much attention in both public and research communities because they are expected to bring a new paradigm to the interaction between humans, environment, and machines. This paper presents the deployment of WSN nodes in the Top Quality Centralized Instrumentation Centre (TQCIC). We created an ad hoc networking application to collect real-time data sensed from the nodes that were randomly distributed throughout the building. If the sensors are relocated, then the application automatically reconfigures itself in the light of the new routing topology. WSNs are event-based systems that rely on the collective effort of several micro-sensor nodes, which are continuously observing a physical phenomenon. WSN applications require spatially dense sensor deployment in order to achieve satisfactory coverage. The degree of spatial correlation increases with the decreasing inter-node separation. Energy consumption is reduced dramatically by having only those sensor nodes with unique readings transmit their data. We report on an algorithm based on a spatial correlation technique that assures high QoS (in terms of SNR) of the network as well as proper utilization of energy, by suppressing redundant data transmission

  3. Comparison of two commonly practiced atropinization regimens in acute organophosphorus and carbamate poisoning, doubling doses vs. ad hoc: a prospective observational study.

    PubMed

    Perera, P M S; Shahmy, S; Gawarammana, I; Dawson, A H

    2008-06-01

    There is a wide variation and lack of evidence in current recommendations for atropine dosing schedules leading to subsequent variation in clinical practice. Therefore, we sought to examine the safety and effectiveness of a titrated vs. ad hoc atropine treatment regimen in a cohort of patients with acute cholinesterase inhibitor pesticide poisoning. A prospective cohort study was conducted in three district secondary referral hospitals in Sri Lanka using a structured data collection form that collected details of clinical symptoms and outcomes of cholinesterase inhibitor pesticide poisoning, atropine doses, and signs of atropinization. We compared two hospitals that used a titrated dosing protocol based on a structured monitoring sheet for atropine infusion with another hospital using an ad hoc regime. During the study, 272 symptomatic patients with anticholinesterase poisoning requiring atropine were admitted to the three hospitals. Outcomes of death and ventilation were analyzed for all patients, 226 patients were prospectively assessed for atropine toxicity. At baseline, patients in the titrated dose cohort had clinical signs consistent with greater toxicity. This in part may be due to ingestion of more toxic organophosphates. They received less pralidoxime and atropine, and were less likely to develop features of atropine toxicity, such as delirium (1% vs. 17%), hallucinations (1% vs. 35%), or either (1% vs. 35%) and need for patient restraint (3% vs. 48%) compared with the ad hoc dose regime. After adjusting for the pesticides ingested, there was no difference in mortality and ventilatory rates between protocols. Ad hoc high dose atropine regimens are associated with more frequent atropine toxicity without any obvious improvement in patient outcome compared with doses titrated to clinical effect. Atropine doses should be titrated against response and toxicity. Further education and the use of a structured monitoring sheet may assist in more appropriate

  4. Improvement of optical and acoustical technologies for the protection: Project IMOTEP: Network of heterogeneous sensor types for the protection of camps or mobile troops

    NASA Astrophysics Data System (ADS)

    Hengy, Sébastien; Laurenzis, Martin; Zimpfer, Véronique; Schneider, Armin

    2014-10-01

    Snipers have emerged as a major threat to troops in recent conflicts. To reduce this menace, the objective of the French- German Research Institute of Saint Louis (ISL) research project "IMOTEP" is to improve the detection of snipers on the battlefield. Our basic approach is to combine several sources of information for a fast and appropriate reaction when an unusual signal (e.g. a flash or a shot) is detected. The project includes several technologies developed at ISL: acoustical detection, fusion of distributed sensor network data, active imaging and 3D audio communication. The protection of camps, convoys or dismounted soldiers rests on a distributed acoustical sensor network that detects and localizes sniper attacks. An early estimation of the threat position is transmitted through a network to an active imaging system in order to confirm and refine this position by 3D imaging. The refined position is then sent to the control center which generates an alert message that displays the threat position using two formats: a tactical map and a 3D audio signal. In addition, the camp is protected by an ad-hoc sensor network used for intruder detection.

  5. Collaborative Clustering for Sensor Networks

    NASA Technical Reports Server (NTRS)

    Wagstaff. Loro :/; Green Jillian; Lane, Terran

    2011-01-01

    Traditionally, nodes in a sensor network simply collect data and then pass it on to a centralized node that archives, distributes, and possibly analyzes the data. However, analysis at the individual nodes could enable faster detection of anomalies or other interesting events, as well as faster responses such as sending out alerts or increasing the data collection rate. There is an additional opportunity for increased performance if individual nodes can communicate directly with their neighbors. Previously, a method was developed by which machine learning classification algorithms could collaborate to achieve high performance autonomously (without requiring human intervention). This method worked for supervised learning algorithms, in which labeled data is used to train models. The learners collaborated by exchanging labels describing the data. The new advance enables clustering algorithms, which do not use labeled data, to also collaborate. This is achieved by defining a new language for collaboration that uses pair-wise constraints to encode useful information for other learners. These constraints specify that two items must, or cannot, be placed into the same cluster. Previous work has shown that clustering with these constraints (in isolation) already improves performance. In the problem formulation, each learner resides at a different node in the sensor network and makes observations (collects data) independently of the other learners. Each learner clusters its data and then selects a pair of items about which it is uncertain and uses them to query its neighbors. The resulting feedback (a must and cannot constraint from each neighbor) is combined by the learner into a consensus constraint, and it then reclusters its data while incorporating the new constraint. A strategy was also proposed for cleaning the resulting constraint sets, which may contain conflicting constraints; this improves performance significantly. This approach has been applied to collaborative

  6. Mechanisms for Prolonging Network Lifetime in Wireless Sensor Networks

    ERIC Educational Resources Information Center

    Yang, Yinying

    2010-01-01

    Sensors are used to monitor and control the physical environment. A Wireless Sensor Network (WSN) is composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it [18][5]. Sensor nodes measure various parameters of the environment and transmit data collected to one or more sinks, using…

  7. Primary Traffic Based Cooperative Multihop Relaying with Preliminary Farthest Relay Selection in Cognitive Radio Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Lin, I.-Te; Sasase, Iwao

    We propose a primary traffic based multihop relaying algorithm with cooperative transmission (PTBMR-CT). It enlarges the hop transmission distances to reduce the number of cognitive relays on the route from the cognitive source (CS) to the cognitive destination (CD). In each hop, from the cognitive nodes in a specified area depending on whether the primary source (PS) transmits data to the primary destination (PD), the cognitive node that is farthest away from the cognitive relay that sends data is selected as the other one that receives data. However, when the PS is transmitting data to the PD, from the cognitive nodes in a specified area, another cognitive node is also selected and prepared to be the cognitive relay that receives data of cooperative transmission. Cooperative transmission is performed if the PS is still transmitting data to the PD when the cognitive relay that receives data of the next hop transmission is being searched. Simulation results show that the average number of cognitive relays is reduced by PTBMR-CT compared to conventional primary traffic based farthest neighbor relaying (PTBFNR), and PTBMR-CT outperforms conventional PTBFNR in terms of the average end-to-end reliability, the average end-to-end throughput, the average required transmission power of transmitting data from the CS to the CD, and the average end-to-end transmission latency.

  8. Select algorithm for local certificate repository of self-organized key management scheme in ad hoc networks

    NASA Astrophysics Data System (ADS)

    Liu, Shizhong; Zhang, Zongyun

    2013-07-01

    Based on the Maximum Degree Construction algorithm, a new select algorithm is proposed in this paper. In the algorithm, each node and its neighbors issue the certificates each other to generate the local In-degree and Out-degree certificate repository. Similar to the ant colony algorithm, it finds the certificate chain between the source node and destination node by selecting the node of the maximum certificated times from the beginning. The algorithm reduces the complexity of the selection, provides a guarantee to find the certificate chain, and saves the spending of space as well. Next, this paper gives the simulation of the algorithm and the simulated results show that this is an optimized select algorithm for local certificate repository.

  9. Modelling the Energy Efficient Sensor Nodes for Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Dahiya, R.; Arora, A. K.; Singh, V. R.

    2015-09-01

    Energy is an important requirement of wireless sensor networks for better performance. A widely employed energy-saving technique is to place nodes in sleep mode, corresponding to low-power consumption as well as to reduce operational capabilities. In this paper, Markov model of a sensor network is developed. The node is considered to enter a sleep mode. This model is used to investigate the system performance in terms of energy consumption, network capacity and data delivery delay.

  10. Networked sensors for the combat forces

    NASA Astrophysics Data System (ADS)

    Klager, Gene

    2004-11-01

    Real-time and detailed information is critical to the success of ground combat forces. Current manned reconnaissance, surveillance, and target acquisition (RSTA) capabilities are not sufficient to cover battlefield intelligence gaps, provide Beyond-Line-of-Sight (BLOS) targeting, and the ambush avoidance information necessary for combat forces operating in hostile situations, complex terrain, and conducting military operations in urban terrain. This paper describes a current US Army program developing advanced networked unmanned/unattended sensor systems to survey these gaps and provide the Commander with real-time, pertinent information. Networked Sensors for the Combat Forces plans to develop and demonstrate a new generation of low cost distributed unmanned sensor systems organic to the RSTA Element. Networked unmanned sensors will provide remote monitoring of gaps, will increase a unit"s area of coverage, and will provide the commander organic assets to complete his Battlefield Situational Awareness (BSA) picture for direct and indirect fire weapons, early warning, and threat avoidance. Current efforts include developing sensor packages for unmanned ground vehicles, small unmanned aerial vehicles, and unattended ground sensors using advanced sensor technologies. These sensors will be integrated with robust networked communications and Battle Command tools for mission planning, intelligence "reachback", and sensor data management. The network architecture design is based on a model that identifies a three-part modular design: 1) standardized sensor message protocols, 2) Sensor Data Management, and 3) Service Oriented Architecture. This simple model provides maximum flexibility for data exchange, information management and distribution. Products include: Sensor suites optimized for unmanned platforms, stationary and mobile versions of the Sensor Data Management Center, Battle Command planning tools, networked communications, and sensor management software. Details

  11. On computer vision in wireless sensor networks.

    SciTech Connect

    Berry, Nina M.; Ko, Teresa H.

    2004-09-01

    Wireless sensor networks allow detailed sensing of otherwise unknown and inaccessible environments. While it would be beneficial to include cameras in a wireless sensor network because images are so rich in information, the power cost of transmitting an image across the wireless network can dramatically shorten the lifespan of the sensor nodes. This paper describe a new paradigm for the incorporation of imaging into wireless networks. Rather than focusing on transmitting images across the network, we show how an image can be processed locally for key features using simple detectors. Contrasted with traditional event detection systems that trigger an image capture, this enables a new class of sensors which uses a low power imaging sensor to detect a variety of visual cues. Sharing these features among relevant nodes cues specific actions to better provide information about the environment. We report on various existing techniques developed for traditional computer vision research which can aid in this work.

  12. Energy optimization in mobile sensor networks

    NASA Astrophysics Data System (ADS)

    Yu, Shengwei

    Mobile sensor networks are considered to consist of a network of mobile robots, each of which has computation, communication and sensing capabilities. Energy efficiency is a critical issue in mobile sensor networks, especially when mobility (i.e., locomotion control), routing (i.e., communications) and sensing are unique characteristics of mobile robots for energy optimization. This thesis focuses on the problem of energy optimization of mobile robotic sensor networks, and the research results can be extended to energy optimization of a network of mobile robots that monitors the environment, or a team of mobile robots that transports materials from stations to stations in a manufacturing environment. On the energy optimization of mobile robotic sensor networks, our research focuses on the investigation and development of distributed optimization algorithms to exploit the mobility of robotic sensor nodes for network lifetime maximization. In particular, the thesis studies these five problems: 1. Network-lifetime maximization by controlling positions of networked mobile sensor robots based on local information with distributed optimization algorithms; 2. Lifetime maximization of mobile sensor networks with energy harvesting modules; 3. Lifetime maximization using joint design of mobility and routing; 4. Optimal control for network energy minimization; 5. Network lifetime maximization in mobile visual sensor networks. In addressing the first problem, we consider only the mobility strategies of the robotic relay nodes in a mobile sensor network in order to maximize its network lifetime. By using variable substitutions, the original problem is converted into a convex problem, and a variant of the sub-gradient method for saddle-point computation is developed for solving this problem. An optimal solution is obtained by the method. Computer simulations show that mobility of robotic sensors can significantly prolong the lifetime of the whole robotic sensor network while

  13. Sustainable coastal sensor networks: technologies and challenges

    NASA Astrophysics Data System (ADS)

    Carapezza, Edward M.; Butman, Jerry; Babb, Ivar; Bucklin, Ann

    2008-04-01

    This paper describes a distributed sensor network for a coastal maritime security system. This concept incorporates a network of small passive and active multi-phenomenological unattended sensors and shore based optical sensors to detect, classify, and track submerged threat objects approaching high value coastal assets, such as ports, harbors, residential, commercial, and military facilities and areas. The network of unattended, in-water sensors perform the initial detection, classification, and coarse tracking and then queues shore based optical laser radar sensors. These shore-based sensors perform a queued sector search to develop a refined track on the submerged threat objects that were initially detected by the unattended sensor network. Potential threat objects include swimmers, small unmanned underwater vehicles (UUV's), small submarines, and submerged barges. All of these threats have the potential to transport threat objects such as explosives, chemical, biological, radiological, and nuclear materials. Reliable systems with low false alarm rates (FAR) are proposed. Tens to hundreds of low cost passive sensors are proposed to be deployed conjunctively with several active acoustic and optical sensors in threat and facility dependant patterns to maximize the detection, tracking and classification of submerged threat objects. The integrated command and control system and novel microbial fuel cells to power these sensor networks are also described.

  14. Querying and tasking in sensor networks

    NASA Astrophysics Data System (ADS)

    Jaikaeo, Chaiporn; Srisathapornphat, Chavalit; Shen, Chien-Chung

    2000-08-01

    With the advancement of hardware technology, it becomes feasible to develop a networked system of pervasive computing platforms that combine programmable general purpose computers with multiple sensing and wireless communication capability. This networked system of programmable sensor nodes, together called a sensor network, poses unique challenges on how information collected by and stored within the sensor network should be queried and accessed, and how concurrent sensing tasks should be programmed from external clients. In this paper, we describe an architecture that facilitates querying and tasking of sensor networks. The key idea to the architecture lies in the development of the Sensor Querying and Tasking Language (SQTL) and the corresponding Sensor Execution Environment (SEE). We model a sensor network as a distributed set of collaborating nodes that carry out querying and tasking activities programmed in SQTL. A frontend node injects a message, that encapsulates an SQTL program, into a sensor node and starts a diffusion computation. A sensor node may diffuse the encapsulated SQTL program to other nodes as dictated by its logic and collaborately perform the specified querying or tasking activity. We will present the SQTL language and demonstrate its applicability using a maximum temperature querying application and a vehicle tracking application.

  15. Time-domain fiber loop ringdown sensor and sensor network

    NASA Astrophysics Data System (ADS)

    Kaya, Malik

    Optical fibers have been mostly used in fiber optic communications, imaging optics, sensing technology, etc. Fiber optic sensors have gained increasing attention for scientific and structural health monitoring (SHM) applications. In this study, fiber loop ringdown (FLRD) sensors were fabricated for scientific, SHM, and sensor networking applications. FLRD biosensors were fabricated for both bulk refractive index (RI)- and surface RI-based DNA sensing and one type of bacteria sensing. Furthermore, the effect of glucose oxidase (GOD) immobilization at the sensor head on sensor performance was evaluated for both glucose and synthetic urine solutions with glucose concentration between 0.1% and 10%. Detection sensitivities of the glucose sensors were achieved as low as 0.05%. For chemical sensing, heavy water, ranging from 97% to 10%, and several elemental solutions were monitored by using the FLRD chemical sensors. Bulk index-based FLRD sensing showed that trace elements can be detected in deionized water. For physical sensing, water and cracking sensors were fabricated and embedded into concrete. A partially-etched single-mode fiber (SMF) was embedded into a concrete bar for water monitoring while a bare SMF without any treatment was directly embedded into another concrete bar for monitoring cracks. Furthermore, detection sensitivities of water and crack sensors were investigated as 10 ml water and 0.5 mm surface crack width, respectively. Additionally fiber loop ringdown-fiber Bragg grating temperature sensors were developed in the laboratory; two sensor units for water, crack, and temperature sensing were deployed into a concrete cube in a US Department of Energy test bed (Miami, FL). Multi-sensor applications in a real concrete structure were accomplished by testing the six FLRD sensors. As a final stage, a sensor network was assembled by multiplexing two or three FLRD sensors in series and parallel. Additionally, two FLRD sensors were combined in series and

  16. Distributed estimation for adaptive sensor selection in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Mahmoud, Magdi S.; Hassan Hamid, Matasm M.

    2014-05-01

    Wireless sensor networks (WSNs) are usually deployed for monitoring systems with the distributed detection and estimation of sensors. Sensor selection in WSNs is considered for target tracking. A distributed estimation scenario is considered based on the extended information filter. A cost function using the geometrical dilution of precision measure is derived for active sensor selection. A consensus-based estimation method is proposed in this paper for heterogeneous WSNs with two types of sensors. The convergence properties of the proposed estimators are analyzed under time-varying inputs. Accordingly, a new adaptive sensor selection (ASS) algorithm is presented in which the number of active sensors is adaptively determined based on the absolute local innovations vector. Simulation results show that the tracking accuracy of the ASS is comparable to that of the other algorithms.

  17. Networked sensors for the objective force

    NASA Astrophysics Data System (ADS)

    Howden, Ellen A.; Brendley, Keith

    2002-08-01

    The technical objectives of this effort are to develop low cost sensor packages optimized for three types of unmanned platforms: UGVs, SUAVs and UGS. Additional goals are to develop robust communications to network these sensor systems throughout complex terrain, develop command and control software tools to incldue mission planning, monitoring, dynamic re-planning, sensor planning and management functions; and to demonstrate a system-of-systems capability when fusing information from these various unmanned sensor systems. These capabilities provide the battlefield commander organic unmanned sensor network assets to compelte his Battlespace Situational Awareness picture for targeting, direct and indirect-fire weapons, and threat avoidance. The networked sensors will provide remote monitoring of areas of interest out to approximately 10km not covered by higher echelon surveillance assets and without placing soldiers in harm's way, will increase unit areas of coverage and will provide near real time BSA and targeting data for early warning to speed decision making and reaction time.

  18. Using Neural Networks for Sensor Validation

    NASA Technical Reports Server (NTRS)

    Mattern, Duane L.; Jaw, Link C.; Guo, Ten-Huei; Graham, Ronald; McCoy, William

    1998-01-01

    This paper presents the results of applying two different types of neural networks in two different approaches to the sensor validation problem. The first approach uses a functional approximation neural network as part of a nonlinear observer in a model-based approach to analytical redundancy. The second approach uses an auto-associative neural network to perform nonlinear principal component analysis on a set of redundant sensors to provide an estimate for a single failed sensor. The approaches are demonstrated using a nonlinear simulation of a turbofan engine. The fault detection and sensor estimation results are presented and the training of the auto-associative neural network to provide sensor estimates is discussed.

  19. Sensor Networks in the Low Lands

    PubMed Central

    Meratnia, Nirvana; van der Zwaag, Berend Jan; van Dijk, Hylke W.; Bijwaard, Dennis J. A.; Havinga, Paul J. M.

    2010-01-01

    This paper provides an overview of scientific and industrial developments of the last decade in the area of sensor networks in The Netherlands (Low Lands). The goal is to highlight areas in which the Netherlands has made most contributions and is currently a dominant player in the field of sensor networks. On the one hand, motivations, addressed topics, and initiatives taken in this period are presented, while on the other hand, special emphasis is given to identifying current and future trends and formulating a vision for the coming five to ten years. The presented overview and trend analysis clearly show that Dutch research and industrial efforts, in line with recent worldwide developments in the field of sensor technology, present a clear shift from sensor node platforms, operating systems, communication, networking, and data management aspects of the sensor networks to reasoning/cognition, control, and actuation. PMID:22163669

  20. Secured network sensor-based defense system

    NASA Astrophysics Data System (ADS)

    Wei, Sixiao; Shen, Dan; Ge, Linqiang; Yu, Wei; Blasch, Erik P.; Pham, Khanh D.; Chen, Genshe

    2015-05-01

    Network sensor-based defense (NSD) systems have been widely used to defend against cyber threats. Nonetheless, if the adversary finds ways to identify the location of monitor sensors, the effectiveness of NSD systems can be reduced. In this paper, we propose both temporal and spatial perturbation based defense mechanisms to secure NSD systems and make the monitor sensor invisible to the adversary. The temporal-perturbation based defense manipulates the timing information of published data so that the probability of successfully recognizing monitor sensors can be reduced. The spatial-perturbation based defense dynamically redeploys monitor sensors in the network so that the adversary cannot obtain the complete information to recognize all of the monitor sensors. We carried out experiments using real-world traffic traces to evaluate the effectiveness of our proposed defense mechanisms. Our data shows that our proposed defense mechanisms can reduce the attack accuracy of recognizing detection sensors.

  1. Minimum energy information fusion in sensor networks

    SciTech Connect

    Chapline, G

    1999-05-11

    In this paper we consider how to organize the sharing of information in a distributed network of sensors and data processors so as to provide explanations for sensor readings with minimal expenditure of energy. We point out that the Minimum Description Length principle provides an approach to information fusion that is more naturally suited to energy minimization than traditional Bayesian approaches. In addition we show that for networks consisting of a large number of identical sensors Kohonen self-organization provides an exact solution to the problem of combing the sensor outputs into minimal description length explanations.

  2. Securing radars using secure wireless sensor networking

    NASA Astrophysics Data System (ADS)

    Tahmoush, David

    2014-06-01

    Radar sensors can be viewed as a limited wireless sensor network consisting of radar transmitter nodes, target nodes, and radar receiver nodes. The radar transmitter node sends a communication signal to the target node which then reflects it in a known pattern to the radar receiver nodes. This type of wireless sensor network is susceptible to the same types of attacks as a traditional wireless sensor network, but there is less opportunity for defense. The target nodes in the network are unable to validate the return signal, and they are often uncooperative. This leads to ample opportunities for spoofing and man-in-the-middle attacks. This paper explores some of the fundamental techniques that can be used against a limited wireless network system as well as explores the techniques that can be used to counter them.

  3. Vital signs monitoring and patient tracking over a wireless network.

    PubMed

    Gao, Tia; Greenspan, Dan; Welsh, Matt; Juang, Radford; Alm, Alex

    2005-01-01

    Patients at a disaster scene can greatly benefit from technologies that continuously monitor their vital status and track their locations until they are admitted to the hospital. We have designed and developed a real-time patient monitoring system that integrates vital signs sensors, location sensors, ad-hoc networking, electronic patient records, and web portal technology to allow remote monitoring of patient status. This system shall facilitate communication between providers at the disaster scene, medical professionals at local hospitals, and specialists available for consultation from distant facilities.

  4. Networked sensors: armor for the future force

    NASA Astrophysics Data System (ADS)

    Gowens, John W., II; Eicke, John

    2001-08-01

    The U.S. Army has embarked on an important campaign to field a lighter, more agile force, capable of being deployed in a fraction of the time currently required. The survivability of this force will depend more heavily on the use of integrated command and control capabilities with unsurpassed situational understanding for all levels of command. Arrays of small, low cost sensors will play a key role in detecting, locating, tracking, and identifying targets, particularly in areas where the terrain or other circumstances prevent traditional high performance sensors from providing critical information. Individual sensor types will provide modest performance but with a wide range of sensing modalities. When deployed in large numbers, the data fused from multiple sensing modalities will provide a detailed view of the battlespace over a wide area. A critical element necessary to deploy unattended ground sensor technology is the underlying communications and networking infrastructure. Communication networks will constitute the major challenge to making unattended ground sensors networks practical.

  5. Establishing trust in decentralized smart sensor networks

    NASA Astrophysics Data System (ADS)

    Vagts, H.; Cosar, T.; Beyerer, J.

    2011-06-01

    Smart sensors can gather all kind of information and process it. Cameras are still dominating and smart cameras can offer services for face recognition or person tracking. Operators are building collaborations to cover a larger area, to save costs and to add more and different sensors. Cryptographic methods may achieve integrity and confidentiality between operators, but not trust. Even if a partner or one of his sensors is authenticated, no statements can be made about the quality of the sensor data. Hence, trust must be established between the partners and their sensors. Trust can be built based on past experience. A reputation system collects opinions of operators about the behavior of sensors and calculates trust based on these opinions. Many reputation systems have been proposed, e.g., for authentication of files in peer-topeer networks. This work presents a new reputation system, which is designed to calculate the trustworthiness of smart sensors and smart sensor systems. A new trust model, including functions to calculate and update trust on past experiences, is proposed. When fusing information of multiple sensors, it cannot always be reconstructed, which information led to a bad result. Hence, an approach for fair rating is shown. The proposed system has been realized in a Service-Oriented Architecture for easy integration in existing smart sensor systems, e.g., smart surveillance systems. The model itself can be used in every decentralized heterogeneous smart sensor network.

  6. Reputation-based secure sensor localization in wireless sensor networks.

    PubMed

    He, Jingsha; Xu, Jing; Zhu, Xingye; Zhang, Yuqiang; Zhang, Ting; Fu, Wanqing

    2014-01-01

    Location information of sensor nodes in wireless sensor networks (WSNs) is very important, for it makes information that is collected and reported by the sensor nodes spatially meaningful for applications. Since most current sensor localization schemes rely on location information that is provided by beacon nodes for the regular sensor nodes to locate themselves, the accuracy of localization depends on the accuracy of location information from the beacon nodes. Therefore, the security and reliability of the beacon nodes become critical in the localization of regular sensor nodes. In this paper, we propose a reputation-based security scheme for sensor localization to improve the security and the accuracy of sensor localization in hostile or untrusted environments. In our proposed scheme, the reputation of each beacon node is evaluated based on a reputation evaluation model so that regular sensor nodes can get credible location information from highly reputable beacon nodes to accomplish localization. We also perform a set of simulation experiments to demonstrate the effectiveness of the proposed reputation-based security scheme. And our simulation results show that the proposed security scheme can enhance the security and, hence, improve the accuracy of sensor localization in hostile or untrusted environments.

  7. Reputation-Based Secure Sensor Localization in Wireless Sensor Networks

    PubMed Central

    He, Jingsha; Xu, Jing; Zhu, Xingye; Zhang, Yuqiang; Zhang, Ting; Fu, Wanqing

    2014-01-01

    Location information of sensor nodes in wireless sensor networks (WSNs) is very important, for it makes information that is collected and reported by the sensor nodes spatially meaningful for applications. Since most current sensor localization schemes rely on location information that is provided by beacon nodes for the regular sensor nodes to locate themselves, the accuracy of localization depends on the accuracy of location information from the beacon nodes. Therefore, the security and reliability of the beacon nodes become critical in the localization of regular sensor nodes. In this paper, we propose a reputation-based security scheme for sensor localization to improve the security and the accuracy of sensor localization in hostile or untrusted environments. In our proposed scheme, the reputation of each beacon node is evaluated based on a reputation evaluation model so that regular sensor nodes can get credible location information from highly reputable beacon nodes to accomplish localization. We also perform a set of simulation experiments to demonstrate the effectiveness of the proposed reputation-based security scheme. And our simulation results show that the proposed security scheme can enhance the security and, hence, improve the accuracy of sensor localization in hostile or untrusted environments. PMID:24982940

  8. A lightweight sensor network management system design

    USGS Publications Warehouse

    Yuan, F.; Song, W.-Z.; Peterson, N.; Peng, Y.; Wang, L.; Shirazi, B.; LaHusen, R.

    2008-01-01

    In this paper, we propose a lightweight and transparent management framework for TinyOS sensor networks, called L-SNMS, which minimizes the overhead of management functions, including memory usage overhead, network traffic overhead, and integration overhead. We accomplish this by making L-SNMS virtually transparent to other applications hence requiring minimal integration. The proposed L-SNMS framework has been successfully tested on various sensor node platforms, including TelosB, MICAz and IMote2. ?? 2008 IEEE.

  9. Ocean current mapping using networked distributed sensors

    NASA Astrophysics Data System (ADS)

    Huang, Chen-Fen; Yang, T. C.; Liu, Jin-Yuan; Burchfield, Tom; Schindall, Jeff

    2012-11-01

    Distributed underwater sensors are expected to provide environmental (oceanographic) monitoring over large areas. As fabrication technology advances, low cost sensors will be available for many applications. The sensors communicate to each other and are networked using acoustic communications. This paper proposes a method for ocean current tomography using distributed networked sensors and presents preliminary experimental results by this approach. Conventional acoustic tomography uses the acoustic sensors distributed on the periphery of an area of interest. Environmental reconstruction requires solving a challenging high dimensional inverse problem, typically requiring substantial computational effort. Given distributed sensors, currents can be constructed locally based on data from neighboring sensors. It is shown using simulated data that results obtained by the proposed method are similar to those obtained by a conventional tomographic method based on peripheral sensors. In addition, one finds that the distributed sensors consume much less energy than that by the conventional tomographic approach. An acoustic communication and networking experiment was conducted near the Sizihwan Bay in Kaohsiung, Taiwan, in May 2011. The communication signals are analyzed to measure currents as a function of space and time. The procedure is simple and can be implemented in real-time using in-buoy processing.

  10. Routing protocols in wireless sensor networks.

    PubMed

    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

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

  12. Robust, Distributed Target Tracking Using Sensor Network

    NASA Astrophysics Data System (ADS)

    Neema, Kartavya

    Distributed target tracking using sensor networks is crucial for supporting a variety of applications such as battlefield monitoring, weather monitoring, and air traffic management. This dissertation presents a problem formulation and solution approach for distributed target tracking, comprising of sensor fusion and sensor target allocation problems, in the presence of faults in the sensor measurements. There are times when an architecture with central node is preferred but other times when distributed is necessary, we seek a distributed case that can approach the attractive features of centralized case. Therefore, we propose that the underlying two-fold goals of the distributed target tracking problem is to: (1) reach a consensus in the allocation decisions across the sensor network, and (2) achieve a consensus in the state estimates across all the sensors in the network. These goals ensure that each sensor node has the same information across the sensor network, and any node can behave as a central node. In the process of achieving our goals, we develop two new algorithms, one for distributed sensor-target allocation and another for distributed sensor fusion. The Dual Phase Consensus Algorithm (DPCA) for distributed sensor target allocation is a real time algorithm that works in two phases. The first phase of DPCA is similar to distributed sequential greedy search that combines the benefits of greedy and consensus algorithms to reach a feasible solution. The second phase iteratively improves the allocation eventually leading toward a global optimum. DPCA converges to a feasible solution at the order of number of sensors, and thus can be useful for implementation in real time systems. For distributed sensor fusion, we extend the state-of-art distributed Kalman filtering technique called Generalized Kalman Consensus Filter (GKCF), and make it robust against faults present in the sensor measurements. We particularly focus on two types of faults: (1) outliers in the

  13. Planning and Scheduling for Environmental Sensor Networks

    NASA Astrophysics Data System (ADS)

    Frank, J. D.

    2005-12-01

    Environmental Sensor Networks are a new way of monitoring the environment. They comprise autonomous sensor nodes in the environment that record real-time data, which is retrieved, analyzed, integrated with other data sets (e.g. satellite images, GIS, process models) and ultimately lead to scientific discoveries. Sensor networks must operate within time and resource constraints. Sensors have limited onboard memory, energy, computational power, communications windows and communications bandwidth. The value of data will depend on when, where and how it was collected, how detailed the data is, how long it takes to integrate the data, and how important the data was to the original scientific question. Planning and scheduling of sensor networks is necessary for effective, safe operations in the face of these constraints. For example, power bus limitations may preclude sensors from simultaneously collecting data and communicating without damaging the sensor; planners and schedulers can ensure these operations are ordered so that they do not happen simultaneously. Planning and scheduling can also ensure best use of the sensor network to maximize the value of collected science data. For example, if data is best recorded using a particular camera angle but it is costly in time and energy to achieve this, planners and schedulers can search for times when time and energy are available to achieve the optimal camera angle. Planning and scheduling can handle uncertainty in the problem specification; planners can be re-run when new information is made available, or can generate plans that include contingencies. For example, if bad weather may prevent the collection of data, a contingent plan can check lighting conditions and turn off data collection to save resources if lighting is not ideal. Both mobile and immobile sensors can benefit from planning and scheduling. For example, data collection on otherwise passive sensors can be halted to preserve limited power and memory

  14. JSC Wireless Sensor Network Update

    NASA Technical Reports Server (NTRS)

    Wagner, Robert

    2010-01-01

    Sensor nodes composed of three basic components... radio module: COTS radio module implementing standardized WSN protocol; treated as WSN modem by main board main board: contains application processor (TI MSP430 microcontroller), memory, power supply; responsible for sensor data acquisition, pre-processing, and task scheduling; re-used in every application with growing library of embedded C code sensor card: contains application-specific sensors, data conditioning hardware, and any advanced hardware not built into main board (DSPs, faster A/D, etc.); requires (re-) development for each application.

  15. Attack detection in unattended sensor networks

    NASA Astrophysics Data System (ADS)

    Wu, Curt; Monnier, Camille; Fry, Gerald; Girod, Lewis; Luke, Jahn

    2010-04-01

    Because sensor networks are often deployed in hostile environments where their security and integrity may be compromised, it is essential to maximize the reliability and trustworthiness of existing and envisioned sensor networks. During operations, the sensor network must be robust to deception, node compromise, and various other attacks, while maintaining the operator's situational awareness regarding the health and integrity of the system. To address these needs, we have designed a Framework to Ensure and Assess Trustworthiness in Sensor systems (FEATS) to identify attacks on sensor system integrity and inform the operator of sensor data trustworthiness. We have developed and validated unsupervised anomaly detection algorithms for sensor data captured from an experimental acoustic sensor platform under a number of attack scenarios. The platform, which contains four audio microphones, was exposed to two physical attacks (audio filtering and audio playback) as well as a live replay attack (replaying live audio data that is captured at a remote location), which is analogous to a wormhole attack in the routing layer. With our unsupervised learning algorithms, we were able to successfully identify the presence of various attacks.

  16. Simulating Operation of a Complex Sensor Network

    NASA Technical Reports Server (NTRS)

    Jennings, Esther; Clare, Loren; Woo, Simon

    2008-01-01

    Simulation Tool for ASCTA Microsensor Network Architecture (STAMiNA) ["ASCTA" denotes the Advanced Sensors Collaborative Technology Alliance.] is a computer program for evaluating conceptual sensor networks deployed over terrain to provide military situational awareness. This or a similar program is needed because of the complexity of interactions among such diverse phenomena as sensing and communication portions of a network, deployment of sensor nodes, effects of terrain, data-fusion algorithms, and threat characteristics. STAMiNA is built upon a commercial network-simulator engine, with extensions to include both sensing and communication models in a discrete-event simulation environment. Users can define (1) a mission environment, including terrain features; (2) objects to be sensed; (3) placements and modalities of sensors, abilities of sensors to sense objects of various types, and sensor false alarm rates; (4) trajectories of threatening objects; (5) means of dissemination and fusion of data; and (6) various network configurations. By use of STAMiNA, one can simulate detection of targets through sensing, dissemination of information by various wireless communication subsystems under various scenarios, and fusion of information, incorporating such metrics as target-detection probabilities, false-alarm rates, and communication loads, and capturing effects of terrain and threat.

  17. Wireless Sensor Networks for Ambient Assisted Living

    PubMed Central

    Aquino-Santos, Raúl; Martinez-Castro, Diego; Edwards-Block, Arthur; Murillo-Piedrahita, Andrés Felipe

    2013-01-01

    This paper introduces wireless sensor networks for Ambient Assisted Living as a proof of concept. Our workgroup has developed an arrhythmia detection algorithm that we evaluate in a closed space using a wireless sensor network to relay the information collected to where the information can be registered, monitored and analyzed to support medical decisions by healthcare providers. The prototype we developed is then evaluated using the TelosB platform. The proposed architecture considers very specific restrictions regarding the use of wireless sensor networks in clinical situations. The seamless integration of the system architecture enables both mobile node and network configuration, thus providing the versatile and robust characteristics necessary for real-time applications in medical situations. Likewise, this system architecture efficiently permits the different components of our proposed platform to interact efficiently within the parameters of this study. PMID:24351665

  18. Wireless sensor networks for ambient assisted living.

    PubMed

    Aquino-Santos, Raúl; Martinez-Castro, Diego; Edwards-Block, Arthur; Murillo-Piedrahita, Andrés Felipe

    2013-11-29

    This paper introduces wireless sensor networks for Ambient Assisted Living as a proof of concept. Our workgroup has developed an arrhythmia detection algorithm that we evaluate in a closed space using a wireless sensor network to relay the information collected to where the information can be registered, monitored and analyzed to support medical decisions by healthcare providers. The prototype we developed is then evaluated using the TelosB platform. The proposed architecture considers very specific restrictions regarding the use of wireless sensor networks in clinical situations. The seamless integration of the system architecture enables both mobile node and network configuration, thus providing the versatile and robust characteristics necessary for real-time applications in medical situations. Likewise, this system architecture efficiently permits the different components of our proposed platform to interact efficiently within the parameters of this study.

  19. Target Coverage in Wireless Sensor Networks with Probabilistic Sensors.

    PubMed

    Shan, Anxing; Xu, Xianghua; Cheng, Zongmao

    2016-01-01

    Sensing coverage is a fundamental problem in wireless sensor networks (WSNs), which has attracted considerable attention. Conventional research on this topic focuses on the 0/1 coverage model, which is only a coarse approximation to the practical sensing model. In this paper, we study the target coverage problem, where the objective is to find the least number of sensor nodes in randomly-deployed WSNs based on the probabilistic sensing model. We analyze the joint detection probability of target with multiple sensors. Based on the theoretical analysis of the detection probability, we formulate the minimum ϵ-detection coverage problem. We prove that the minimum ϵ-detection coverage problem is NP-hard and present an approximation algorithm called the Probabilistic Sensor Coverage Algorithm (PSCA) with provable approximation ratios. To evaluate our design, we analyze the performance of PSCA theoretically and also perform extensive simulations to demonstrate the effectiveness of our proposed algorithm. PMID:27618902

  20. Target Coverage in Wireless Sensor Networks with Probabilistic Sensors

    PubMed Central

    Shan, Anxing; Xu, Xianghua; Cheng, Zongmao

    2016-01-01

    Sensing coverage is a fundamental problem in wireless sensor networks (WSNs), which has attracted considerable attention. Conventional research on this topic focuses on the 0/1 coverage model, which is only a coarse approximation to the practical sensing model. In this paper, we study the target coverage problem, where the objective is to find the least number of sensor nodes in randomly-deployed WSNs based on the probabilistic sensing model. We analyze the joint detection probability of target with multiple sensors. Based on the theoretical analysis of the detection probability, we formulate the minimum ϵ-detection coverage problem. We prove that the minimum ϵ-detection coverage problem is NP-hard and present an approximation algorithm called the Probabilistic Sensor Coverage Algorithm (PSCA) with provable approximation ratios. To evaluate our design, we analyze the performance of PSCA theoretically and also perform extensive simulations to demonstrate the effectiveness of our proposed algorithm. PMID:27618902

  1. In-Network Processing of Joins in Wireless Sensor Networks

    PubMed Central

    Kang, Hyunchul

    2013-01-01

    The join or correlated filtering of sensor readings is one of the fundamental query operations in wireless sensor networks (WSNs). Although the join in centralized or distributed databases is a well-researched problem, join processing in WSNs has quite different characteristics and is much more difficult to perform due to the lack of statistics on sensor readings and the resource constraints of sensor nodes. Since data transmission is orders of magnitude more costly than processing at a sensor node, in-network processing of joins is essential. In this paper, the state-of-the-art techniques for join implementation in WSNs are surveyed. The requirements and challenges, join types, and components of join implementation are described. The open issues for further research are identified. PMID:23478603

  2. Distributed policy based access to networked heterogeneous ISR data sources

    NASA Astrophysics Data System (ADS)

    Bent, G.; Vyvyan, D.; Wood, David; Zerfos, Petros; Calo, Seraphin

    2010-04-01

    Within a coalition environment, ad hoc Communities of Interest (CoI's) come together, perhaps for only a short time, with different sensors, sensor platforms, data fusion elements, and networks to conduct a task (or set of tasks) with different coalition members taking different roles. In such a coalition, each organization will have its own inherent restrictions on how it will interact with the others. These are usually stated as a set of policies, including security and privacy policies. The capability that we want to enable for a coalition operation is to provide access to information from any coalition partner in conformance with the policies of all. One of the challenges in supporting such ad-hoc coalition operations is that of providing efficient access to distributed sources of data, where the applications requiring the data do not have knowledge of the location of the data within the network. To address this challenge the International Technology Alliance (ITA) program has been developing the concept of a Dynamic Distributed Federated Database (DDFD), also know as a Gaian Database. This type of database provides a means for accessing data across a network of distributed heterogeneous data sources where access to the information is controlled by a mixture of local and global policies. We describe how a network of disparate ISR elements can be expressed as a DDFD and how this approach enables sensor and other information sources to be discovered autonomously or semi-autonomously and/or combined, fused formally defined local and global policies.

  3. Integrating Sensors and Social Networks

    NASA Astrophysics Data System (ADS)

    Aggarwal, Charu C.; Abdelzaher, Tarek

    A number of sensor applications in recent years collect data which can be directly associated with human interactions. Some examples of such applications include GPS applications on mobile devices, accelerometers, or location sensors designed to track human and vehicular traffic. Such data lends itself to a variety of rich applications in which one can use the sensor data in order to model the underlying relationships and interactions. It also leads to a number of challenges, since such data may often be private, and it is important to be able to perform the mining process without violating the privacy of the users. In this chapter, we provide a broad survey of the work in this important and rapidly emerging field. We also discuss the key problems which arise in the context of this important field and the corresponding solutions.

  4. Cursor on Target: Research for a Sensor Network

    PubMed Central

    Stevenson, G; Naiman, M; Valenta, AL; Boyd, AD

    2012-01-01

    Summary Terrorism, epidemics, natural, and man-made disasters have increased over the last decade, prompting ongoing evaluation and incremental rebuilding of the American public health system (Chan, Killeen, Griswold, & Lenert, 2004a; Yu, Brock, Mecozzi, Tran, & Kost, 2010). In February 2002, the Center for Disease Control (CDC) identified six focus areas to generate response capacities to bioterrorism and public emergencies. According to one focus area, information sharing and alert notifications between systems and public health agencies must be continuous and automatic (Popovich, Henderson, & Stinn, 2002) Advancements in technology set the stage for this uninterrupted data-sharing requirement to be met; for example, “smart devices” can digitally record and transmit information and text messages from remote disaster sites using wireless ad hoc networks. In this context, medical systems and personnel can provide enhanced patient support from the extraction point to the hospital, even when normal landline infrastructure has been damaged. However, care may be restricted due to the limited recognition of proprietary information and the distance between the transmitter and collector system. This article suggests that overcoming these limitations necessitates the adoption of interoperability by basic operations and illustrates how an Internet Protocol called Cursor-on-Target can facilitate communication between open source and propriety systems. PMID:23569647

  5. Cursor on target: research for a sensor network.

    PubMed

    Stevenson, G; Naiman, M; Valenta, Al; Boyd, Ad

    2012-01-01

    Terrorism, epidemics, natural, and man-made disasters have increased over the last decade, prompting ongoing evaluation and incremental rebuilding of the American public health system (Chan, Killeen, Griswold, & Lenert, 2004a; Yu, Brock, Mecozzi, Tran, & Kost, 2010). In February 2002, the Center for Disease Control (CDC) identified six focus areas to generate response capacities to bioterrorism and public emergencies. According to one focus area, information sharing and alert notifications between systems and public health agencies must be continuous and automatic (Popovich, Henderson, & Stinn, 2002) Advancements in technology set the stage for this uninterrupted data-sharing requirement to be met; for example, "smart devices" can digitally record and transmit information and text messages from remote disaster sites using wireless ad hoc networks. In this context, medical systems and personnel can provide enhanced patient support from the extraction point to the hospital, even when normal landline infrastructure has been damaged. However, care may be restricted due to the limited recognition of proprietary information and the distance between the transmitter and collector system. This article suggests that overcoming these limitations necessitates the adoption of interoperability by basic operations and illustrates how an Internet Protocol called Cursor-on-Target can facilitate communication between open source and propriety systems. PMID:23569647

  6. Sensor Webs in the Wild

    NASA Astrophysics Data System (ADS)

    Delin, K. A.

    2004-12-01

    In October 2001, a new era in wireless sensor systems began when the NASA/JPL Sensor Web deployed at the Huntington Botanical Gardens in Southern California went online. For the first time, it was possible for a person with nothing more than a computer, an Internet connection, and a standard browser to watch streaming, real-time data generated by an ad hoc wireless networked system permanently embedded in an outdoor environment. Unlike other wireless sensor networks, the central purpose of a Sensor Web system is to extract knowledge from the data it collects and use this information to intelligently react and adapt to its surroundings. It acts as a single, distributed instrument that links a remote end-user's cognizance with the observed environment. The Sensor Web's capabilities are useful in a diverse set of outdoor applications ranging from precision agriculture to perimeter security to effluent tracking. Wireless networked systems, and Sensor Webs in particular, are only just beginning to change the ways in which we can sense, monitor, and control large spatial areas. Here, we both explore the possibilities that Sensor Webs bring to Earth science and examine several recent deployments (real-time data streams from these sites are available at http://sensorwebs.jpl.nasa.gov/).

  7. Sensor Anomaly Detection in Wireless Sensor Networks for Healthcare

    PubMed Central

    Haque, Shah Ahsanul; Rahman, Mustafizur; Aziz, Syed Mahfuzul

    2015-01-01

    Wireless Sensor Networks (WSN) are vulnerable to various sensor faults and faulty measurements. This vulnerability hinders efficient and timely response in various WSN applications, such as healthcare. For example, faulty measurements can create false alarms which may require unnecessary intervention from healthcare personnel. Therefore, an approach to differentiate between real medical conditions and false alarms will improve remote patient monitoring systems and quality of healthcare service afforded by WSN. In this paper, a novel approach is proposed to detect sensor anomaly by analyzing collected physiological data from medical sensors. The objective of this method is to effectively distinguish false alarms from true alarms. It predicts a sensor value from historic values and compares it with the actual sensed value for a particular instance. The difference is compared against a threshold value, which is dynamically adjusted, to ascertain whether the sensor value is anomalous. The proposed approach has been applied to real healthcare datasets and compared with existing approaches. Experimental results demonstrate the effectiveness of the proposed system, providing high Detection Rate (DR) and low False Positive Rate (FPR). PMID:25884786

  8. Wireless sensors and sensor networks for homeland security applications

    PubMed Central

    Potyrailo, Radislav A.; Nagraj, Nandini; Surman, Cheryl; Boudries, Hacene; Lai, Hanh; Slocik, Joseph M.; Kelley-Loughnane, Nancy; Naik, Rajesh R.

    2012-01-01

    New sensor technologies for homeland security applications must meet the key requirements of sensitivity to detect agents below risk levels, selectivity to provide minimal false-alarm rates, and response speed to operate in high throughput environments, such as airports, sea ports, and other public places. Chemical detection using existing sensor systems is facing a major challenge of selectivity. In this review, we provide a brief summary of chemical threats of homeland security importance; focus in detail on modern concepts in chemical sensing; examine the origins of the most significant unmet needs in existing chemical sensors; and, analyze opportunities, specific requirements, and challenges for wireless chemical sensors and wireless sensor networks (WSNs). We further review a new approach for selective chemical sensing that involves the combination of a sensing material that has different response mechanisms to different species of interest, with a transducer that has a multi-variable signal-transduction ability. This new selective chemical-sensing approach was realized using an attractive ubiquitous platform of battery-free passive radio-frequency identification (RFID) tags adapted for chemical sensing. We illustrate the performance of RFID sensors developed in measurements of toxic industrial materials, humidity-independent detection of toxic vapors, and detection of chemical-agent simulants, explosives, and strong oxidizers. PMID:23175590

  9. EMMNet: Sensor Networking for Electricity Meter Monitoring

    PubMed Central

    Lin, Zhi-Ting; Zheng, Jie; Ji, Yu-Sheng; Zhao, Bao-Hua; Qu, Yu-Gui; Huang, Xu-Dong; Jiang, Xiu-Fang

    2010-01-01

    Smart sensors are emerging as a promising technology for a large number of application domains. This paper presents a collection of requirements and guidelines that serve as a basis for a general smart sensor architecture to monitor electricity meters. It also presents an electricity meter monitoring network, named EMMNet, comprised of data collectors, data concentrators, hand-held devices, a centralized server, and clients. EMMNet provides long-distance communication capabilities, which make it suitable suitable for complex urban environments. In addition, the operational cost of EMMNet is low, compared with other existing remote meter monitoring systems based on GPRS. A new dynamic tree protocol based on the application requirements which can significantly improve the reliability of the network is also proposed. We are currently conducting tests on five networks and investigating network problems for further improvements. Evaluation results indicate that EMMNet enhances the efficiency and accuracy in the reading, recording, and calibration of electricity meters. PMID:22163551

  10. EMMNet: sensor networking for electricity meter monitoring.

    PubMed

    Lin, Zhi-Ting; Zheng, Jie; Ji, Yu-Sheng; Zhao, Bao-Hua; Qu, Yu-Gui; Huang, Xu-Dong; Jiang, Xiu-Fang

    2010-01-01

    Smart sensors are emerging as a promising technology for a large number of application domains. This paper presents a collection of requirements and guidelines that serve as a basis for a general smart sensor architecture to monitor electricity meters. It also presents an electricity meter monitoring network, named EMMNet, comprised of data collectors, data concentrators, hand-held devices, a centralized server, and clients. EMMNet provides long-distance communication capabilities, which make it suitable suitable for complex urban environments. In addition, the operational cost of EMMNet is low, compared with other existing remote meter monitoring systems based on GPRS. A new dynamic tree protocol based on the application requirements which can significantly improve the reliability of the network is also proposed. We are currently conducting tests on five networks and investigating network problems for further improvements. Evaluation results indicate that EMMNet enhances the efficiency and accuracy in the reading, recording, and calibration of electricity meters.

  11. Optimizing Retransmission Threshold in Wireless Sensor Networks.

    PubMed

    Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

    2016-01-01

    The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is O n Δ · max 1 ≤ i ≤ n { u i } , where u i is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based ( 1 + p m i n ) -approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O ( 1 ) -approximation algorithm with time complexity O ( 1 ) is proposed. Experimental results show that the proposed algorithms have better performance. PMID:27171092

  12. Optimizing Retransmission Threshold in Wireless Sensor Networks

    PubMed Central

    Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

    2016-01-01

    The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is OnΔ·max1≤i≤n{ui}, where ui is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based (1+pmin)-approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O(1)-approximation algorithm with time complexity O(1) is proposed. Experimental results show that the proposed algorithms have better performance. PMID:27171092

  13. Group scheduling problems in directional sensor networks

    NASA Astrophysics Data System (ADS)

    Singh, Alok; Rossi, André

    2015-12-01

    This article addresses the problem of scheduling a set of groups of directional sensors arising as a result of applying an exact or a heuristic approach for solving a problem involving directional sensors. The problem seeks a schedule for these groups that minimizes the total energy consumed in switching from one group to the next group in the schedule. In practice, when switching from a group to the next one, active sensors in the new group have to rotate in order to face their working direction. These rotations consume energy, and the problem is to schedule the groups so as to minimize the total amount of energy consumed by all the sensor rotations, knowing the initial angular positions of all the sensors. In this article, it is assumed that energy consumption is proportional to the angular movement for all the sensors. Another problem version is also investigated that seeks to minimize the total time during which the sensor network cannot cover all the targets because active sensors are rotating. Both problems are proved to be ?-hard, and a lower bound for the first problem is presented. A greedy heuristic and a genetic algorithm are also proposed for addressing the problem of minimizing total rotation in the general case. Finally, a local search is also proposed to improve the solutions obtained through a genetic algorithm.

  14. Underwater sensor networks: applications, advances and challenges.

    PubMed

    Heidemann, John; Stojanovic, Milica; Zorzi, Michele

    2012-01-13

    This paper examines the main approaches and challenges in the design and implementation of underwater wireless sensor networks. We summarize key applications and the main phenomena related to acoustic propagation, and discuss how they affect the design and operation of communication systems and networking protocols at various layers. We also provide an overview of communications hardware, testbeds and simulation tools available to the research community.

  15. Toward controlling perturbations in robotic sensor networks

    NASA Astrophysics Data System (ADS)

    Banerjee, Ashis G.; Majumder, Saikat R.

    2014-06-01

    Robotic sensor networks (RSNs), which consist of networks of sensors placed on mobile robots, are being increasingly used for environment monitoring applications. In particular, a lot of work has been done on simultaneous localization and mapping of the robots, and optimal sensor placement for environment state estimation1. The deployment of RSNs, however, remains challenging in harsh environments where the RSNs have to deal with significant perturbations in the forms of wind gusts, turbulent water flows, sand storms, or blizzards that disrupt inter-robot communication and individual robot stability. Hence, there is a need to be able to control such perturbations and bring the networks to desirable states with stable nodes (robots) and minimal operational performance (environment sensing). Recent work has demonstrated the feasibility of controlling the non-linear dynamics in other communication networks like emergency management systems and power grids by introducing compensatory perturbations to restore network stability and operation2. In this paper, we develop a computational framework to investigate the usefulness of this approach for RSNs in marine environments. Preliminary analysis shows promising performance and identifies bounds on the original perturbations within which it is possible to control the networks.

  16. Cooperative UAV-Based Communications Backbone for Sensor Networks

    SciTech Connect

    Roberts, R S

    2001-10-07

    The objective of this project is to investigate the use of unmanned air vehicles (UAVs) as mobile, adaptive communications backbones for ground-based sensor networks. In this type of network, the UAVs provide communication connectivity to sensors that cannot communicate with each other because of terrain, distance, or other geographical constraints. In these situations, UAVs provide a vertical communication path for the sensors, thereby mitigating geographic obstacles often imposed on networks. With the proper use of UAVs, connectivity to a widely disbursed sensor network in rugged terrain is readily achieved. Our investigation has focused on networks where multiple cooperating UAVs are used to form a network backbone. The advantage of using multiple UAVs to form the network backbone is parallelization of sensor connectivity. Many widely spaced or isolated sensors can be connected to the network at once using this approach. In these networks, the UAVs logically partition the sensor network into sub-networks (subnets), with one UAV assigned per subnet. Partitioning the network into subnets allows the UAVs to service sensors in parallel thereby decreasing the sensor-to-network connectivity. A UAV services sensors in its subnet by flying a route (path) through the subnet, uplinking data collected by the sensors, and forwarding the data to a ground station. An additional advantage of using multiple UAVs in the network is that they provide redundancy in the communications backbone, so that the failure of a single UAV does not necessarily imply the loss of the network.

  17. Target tracking for heterogeneous smart sensor networks

    NASA Astrophysics Data System (ADS)

    Bevington, James E.; McDonnell, Timothy X.

    2001-08-01

    Distributed sensor networks will play a key role in the network centric warfighting environments of the future. We envision a ubiquitous sensing `fabric,' comprising sensors distributed over the terrain and carried on manned and unmanned, terrestrial and airborne vehicles. As a complex `system of systems,' this fabric will need to adapt and self-organize to perform a variety of higher-level tasks such as surveillance and target acquisition. The topology and availability of the sensors will be constantly changing, as will the needs of users as dictated by evolving missions and operational environments. In this work, focusing on the task of target tracking, we address approaches for locating and organizing sensing and processing resources and present algorithms for suitably fusing the observations obtained from a varied and changing set of sensors. Run-time discovery and access of new sensing resources are obtained through the use of Java Jini, treating sensing resources as `services' and viewing higher-level processes such as tracking as clients. Algorithms for fusing generic sensor observations for target tracking are based on the extended Kalman filter, while detection and track initiation are based on a new likelihood projection technique. We present results from an implementation of these concepts in a real- time sensor testbed and discuss lessons learned.

  18. A Wireless Sensor Network For Soil Monitoring

    NASA Astrophysics Data System (ADS)

    Szlavecz, K.; Cogan, J.; Musaloiu-Elefteri, R.; Small, S.; Terzis, A.; Szalay, A.

    2005-12-01

    The most spatially complex stratum of a terrestrial ecosystem is its soil. Among the major challenges of studying the soil ecosystem are the diversity and the cryptic nature of biota, and the enormous heterogeneity of the soil substrate. Often this patchiness drives spatial distribution of soil organisms, yet our knowledge on the spatio-temporal patterns of soil conditions is limited. To monitor the environmental conditions at biologically meaningful spatial scales we have developed and deployed a wireless sensor network of thirty nodes. Each node is based on a MICAz mote connected to a custom-built sensor suite that includes a Watermark soil moisture sensor, an Irrometer soil temperature sensor, and sensors capable of recording ambient temperature and light intensity. To assess CO2 production at the ground level a subset of the nodes is equipped with Telaire 6004 CO2 sensor. We developed the software running on the motes from scratch, using the TinyOS development environment. Each mote collects measurements every minute, and stores them persistently in a non-volatile memory. The decision to store data locally at each node enables us to reliably retrieve the data in the face of network losses and premature node failures due to power depletion. Collected measurements are retrieved over the wireless network through a PC-class computer acting as a gateway between the sensor network and the Internet. Considering that motes are battery powered, the largest obstacle hindering long-term sensor network deployments is power consumption. To address this problem, our software powers down sensors between sampling cycles and turns off the radio (the most energy prohibitive mote component) when not in use. By doing so we were able to increase node lifetime by a factor of ten. We collected field data over several weeks. The data was ingested into a SQL Server database, which provides data access through a .NET web services interface. The database provides functions for spatial

  19. Distributed estimation of sensors position in underwater wireless sensor network

    NASA Astrophysics Data System (ADS)

    Zandi, Rahman; Kamarei, Mahmoud; Amiri, Hadi

    2016-05-01

    In this paper, a localisation method for determining the position of fixed sensor nodes in an underwater wireless sensor network (UWSN) is introduced. In this simple and range-free scheme, the node localisation is achieved by utilising an autonomous underwater vehicle (AUV) that transverses through the network deployment area, and that periodically emits a message block via four directional acoustic beams. A message block contains the actual known AUV position as well as a directional dependent marker that allows a node to identify the respective transmit beam. The beams form a fixed angle with the AUV body. If a node passively receives message blocks, it could calculate the arithmetic mean of the coordinates existing in each messages sequence, to find coordinates at two different time instants via two different successive beams. The node position can be derived from the two computed positions of the AUV. The major advantage of the proposed localisation algorithm is that it is silent, which leads to energy efficiency for sensor nodes. The proposed method does not require any synchronisation among the nodes owing to being silent. Simulation results, using MATLAB, demonstrated that the proposed method had better performance than other similar AUV-based localisation methods in terms of the rates of well-localised sensor nodes and positional root mean square error.

  20. Clock Synchronization for Multihop Wireless Sensor Networks

    ERIC Educational Resources Information Center

    Solis Robles, Roberto

    2009-01-01

    In wireless sensor networks, more so generally than in other types of distributed systems, clock synchronization is crucial since by having this service available, several applications such as media access protocols, object tracking, or data fusion, would improve their performance. In this dissertation, we propose a set of algorithms to achieve…

  1. Fiber-connected position localization sensor networks

    NASA Astrophysics Data System (ADS)

    Pan, Shilong; Zhu, Dan; Fu, Jianbin; Yao, Tingfeng

    2014-11-01

    Position localization has drawn great attention due to its wide applications in radars, sonars, electronic warfare, wireless communications and so on. Photonic approaches to realize position localization can achieve high-resolution, which also provides the possibility to move the signal processing from each sensor node to the central station, thanks to the low loss, immunity to electromagnetic interference (EMI) and broad bandwidth brought by the photonic technologies. In this paper, we present a review on the recent works of position localization based on photonic technologies. A fiber-connected ultra-wideband (UWB) sensor network using optical time-division multiplexing (OTDM) is proposed to realize high-resolution localization and moving the signal processing to the central station. A 3.9-cm high spatial resolution is achieved. A wavelength-division multiplexed (WDM) fiber-connected sensor network is also demonstrated to realize location which is independent of the received signal format.

  2. Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

    ERIC Educational Resources Information Center

    Yu, Chao

    2013-01-01

    In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

  3. Sensor placement for municipal water networks.

    SciTech Connect

    Watson, Jean-Paul; Berry, Jonathan W.; Phillips, Cynthia Ann; Boman, Erik Gunnar; Hart, David Blaine; Carr, Robert D.; McKenna, Sean Andrew; Hart, William Eugene; Murray, Regan Elizabeth; Riesen, Lee Ann

    2010-12-01

    We consider the problem of placing a limited number of sensors in a municipal water distribution network to minimize the impact over a given suite of contamination incidents. In its simplest form, the sensor placement problem is a p-median problem that has structure extremely amenable to exact and heuristic solution methods. We describe the solution of real-world instances using integer programming or local search or a Lagrangian method. The Lagrangian method is necessary for solution of large problems on small PCs. We summarize a number of other heuristic methods for effectively addressing issues such as sensor failures, tuning sensors based on local water quality variability, and problem size/approximation quality tradeoffs. These algorithms are incorporated into the TEVA-SPOT toolkit, a software suite that the US Environmental Protection Agency has used and is using to design contamination warning systems for US municipal water systems.

  4. Intruder Activity Analysis under Unreliable Sensor Networks

    SciTech Connect

    Tae-Sic Yoo; Humberto E. Garcia

    2007-09-01

    This paper addresses the problem of counting intruder activities within a monitored domain by a sensor network. The deployed sensors are unreliable. We characterize imperfect sensors with misdetection and false-alarm probabilities. We model intruder activities with Markov Chains. A set of Hidden Markov Models (HMM) models the imperfect sensors and intruder activities to be monitored. A novel sequential change detection/isolation algorithm is developed to detect and isolate a change from an HMM representing no intruder activity to another HMM representing some intruder activities. Procedures for estimating the entry time and the trace of intruder activities are developed. A domain monitoring example is given to illustrate the presented concepts and computational procedures.

  5. Sensor Data Security Level Estimation Scheme for Wireless Sensor Networks

    PubMed Central

    Ramos, Alex; Filho, Raimir Holanda

    2015-01-01

    Due to their increasing dissemination, wireless sensor networks (WSNs) have become the target of more and more sophisticated attacks, even capable of circumventing both attack detection and prevention mechanisms. This may cause WSN users, who totally trust these security mechanisms, to think that a sensor reading is secure, even when an adversary has corrupted it. For that reason, a scheme capable of estimating the security level (SL) that these mechanisms provide to sensor data is needed, so that users can be aware of the actual security state of this data and can make better decisions on its use. However, existing security estimation schemes proposed for WSNs fully ignore detection mechanisms and analyze solely the security provided by prevention mechanisms. In this context, this work presents the sensor data security estimator (SDSE), a new comprehensive security estimation scheme for WSNs. SDSE is designed for estimating the sensor data security level based on security metrics that analyze both attack prevention and detection mechanisms. In order to validate our proposed scheme, we have carried out extensive simulations that show the high accuracy of SDSE estimates. PMID:25608215

  6. Sensor data security level estimation scheme for wireless sensor networks.

    PubMed

    Ramos, Alex; Filho, Raimir Holanda

    2015-01-19

    Due to their increasing dissemination, wireless sensor networks (WSNs) have become the target of more and more sophisticated attacks, even capable of circumventing both attack detection and prevention mechanisms. This may cause WSN users, who totally trust these security mechanisms, to think that a sensor reading is secure, even when an adversary has corrupted it. For that reason, a scheme capable of estimating the security level (SL) that these mechanisms provide to sensor data is needed, so that users can be aware of the actual security state of this data and can make better decisions on its use. However, existing security estimation schemes proposed for WSNs fully ignore detection mechanisms and analyze solely the security provided by prevention mechanisms. In this context, this work presents the sensor data security estimator (SDSE), a new comprehensive security estimation scheme for WSNs. SDSE is designed for estimating the sensor data security level based on security metrics that analyze both attack prevention and detection mechanisms. In order to validate our proposed scheme, we have carried out extensive simulations that show the high accuracy of SDSE estimates.

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

  8. Fuzzy controlled neural network for sensor fusion with adaptability to sensor failure

    NASA Astrophysics Data System (ADS)

    Chen, Judy; Kostrzewski, Andrew A.; Kim, Dai Hyun; Savant, Gajendra D.; Kim, Jeongdal; Vasiliev, Anatoly A.

    1997-10-01

    Artificial neural networks have proven to be powerful tools for sensor fusion, but they are not adaptable to sensor failure in a sensor suite. Physical Optics Corporation (POC) presents a new sensor fusion algorithm, applying fuzzy logic to give a neural network real-time adaptability to compensate for faulty sensors. Identifying data that originates from malfunctioning sensors, and excluding it from sensor fusion, allows the fuzzy neural network to achieve better results. A fuzzy logic-based functionality evaluator detects malfunctioning sensors in real time. A separate neural network is trained for each potential sensor failure situation. Since the number of possible sensor failure situations is large, the large number of neural networks is then fuzzified into a small number of fuzzy neural networks. Experimental results show the feasibility of the proposed approach -- the system correctly recognized airplane models in a computer simulation.

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

  10. LONG-TERM MONITORING SENSOR NETWORK

    SciTech Connect

    Stephen P. Farrington; John W. Haas; Neal Van Wyck

    2003-10-16

    Long-term monitoring (LTM) associated with subsurface contamination sites is a key element of Long Term Stewardship and Legacy Management across the Department of Energy (DOE) complex. However, both within the DOE and elsewhere, LTM is an expensive endeavor, often exceeding the costs of the remediation phase of a clean-up project. The primary contributors to LTM costs are associated with labor. Sample collection, storage, preparation, analysis, and reporting can add a significant financial burden to project expense when extended over many years. Development of unattended, in situ monitoring networks capable of providing quantitative data satisfactory to regulatory concerns has the potential to significantly reduce LTM costs. But survival and dependable operation in a difficult environment is a common obstacle to widespread use across the DOE complex or elsewhere. Deploying almost any sensor in the subsurface for extended periods of time will expose it to chemical and microbial degradation. Over the time-scales required for in situ LTM, even the most advanced sensor systems may be rendered useless. Frequent replacement or servicing (cleaning) of sensors is expensive and labor intensive, offsetting most, if not all, of the cost savings realized with unattended, in situ sensors. To enable facile, remote monitoring of contaminants and other subsurface parameters over prolonged periods, Applied Research Associates, Inc has been working to develop an advanced LTM sensor network consisting of three key elements: (1) an anti-fouling sensor chamber that can accommodate a variety of chemical and physical measurement devices based on electrochemical, optical and other techniques; (2) two rapid, cost effective, and gentle means of emplacing sensor packages either at precise locations directly in the subsurface or in pre-existing monitoring wells; and (3) a web browser-based data acquisition and control system (WebDACS) utilizing field-networked microprocessor-controlled smart

  11. Proceedings of the Censorship Conference of the National Ad Hoc Committee Against Censorship (Dec. 9, 1975, New York City); A Day Long Discussion of Three Threats to the First Amendment and How Organizations Can Respond.

    ERIC Educational Resources Information Center

    National Ad Hoc Committee Against Censorship, New York, NY.

    The contents of this document consist of a transcript of the 1975 Censorship Conference proceedings, a list of conference participants, an outline of the National Ad Hoc Committee against Censorship, a statement of concern, and three appendixes. Contents of the transcript include introductory remarks by William F. Fore; a welcoming address by Dave…

  12. Ad Hoc Conference on the Education of Migrants: Introductory Report on Theme I, "The Position of the Immigrant and His Family on Arrival in the Host Country" (Strasbourg, France, November 5-8, 1974).

    ERIC Educational Resources Information Center

    Morin, Emma

    Theme I of the Ad Hoc Conference on the Education of Migrants was "measures to improve the position of the immigrant and his family at the time of arrival in the host country (including measures taken in the sending country on behalf of those intending to emigrate), primarily in respect of their educational circumstances". This report presents an…

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

  14. Ad Hoc Conference on the Education of Migrants: Introductory Report on Theme II, "Educational Provision Before and During the Host Country's Compulsory Schooling Period" (Strasbourg, France, November 5-8, 1974).

    ERIC Educational Resources Information Center

    Warzee, Louis

    Theme II of the Ad Hoc Conference on the Education of Migrants was "measures to secure satisfactory educational provision before and during the host country's compulsory schooling period (including specialized and additional training for teachers dealing with migrant workers' children)". This paper briefly discusses this theme. Major topics are:…

  15. IR sensors and imagers in networked operations

    NASA Astrophysics Data System (ADS)

    Breiter, Rainer; Cabanski, Wolfgang

    2005-05-01

    "Network-centric Warfare" is a common slogan describing an overall concept of networked operation of sensors, information and weapons to gain command and control superiority. Referring to IR sensors, integration and fusion of different channels like day/night or SAR images or the ability to spread image data among various users are typical requirements. Looking for concrete implementations the German Army future infantryman IdZ is an example where a group of ten soldiers build a unit with every soldier equipped with a personal digital assistant (PDA) for information display, day photo camera and a high performance thermal imager for every unit. The challenge to allow networked operation among such a unit is bringing information together and distribution over a capable network. So also AIM's thermal reconnaissance and targeting sight HuntIR which was selected for the IdZ program provides this capabilities by an optional wireless interface. Besides the global approach of Network-centric Warfare network technology can also be an interesting solution for digital image data distribution and signal processing behind the FPA replacing analog video networks or specific point to point interfaces. The resulting architecture can provide capabilities of data fusion from e.g. IR dual-band or IR multicolor sensors. AIM has participated in a German/UK collaboration program to produce a demonstrator for day/IR video distribution via Gigabit Ethernet for vehicle applications. In this study Ethernet technology was chosen for network implementation and a set of electronics was developed for capturing video data of IR and day imagers and Gigabit Ethernet video distribution. The demonstrator setup follows the requirements of current and future vehicles having a set of day and night imager cameras and a crew station with several members. Replacing the analog video path by a digital video network also makes it easy to implement embedded training by simply feeding the network with

  16. A survey of body sensor networks.

    PubMed

    Lai, Xiaochen; Liu, Quanli; Wei, Xin; Wang, Wei; Zhou, Guoqiao; Han, Guangyi

    2013-01-01

    The technology of sensor, pervasive computing, and intelligent information processing is widely used in Body Sensor Networks (BSNs), which are a branch of wireless sensor networks (WSNs). BSNs are playing an increasingly important role in the fields of medical treatment, social welfare and sports, and are changing the way humans use computers. Existing surveys have placed emphasis on the concept and architecture of BSNs, signal acquisition, context-aware sensing, and system technology, while this paper will focus on sensor, data fusion, and network communication. And we will introduce the research status of BSNs, the analysis of hotspots, and future development trends, the discussion of major challenges and technical problems facing currently. The typical research projects and practical application of BSNs are introduced as well. BSNs are progressing along the direction of multi-technology integration and intelligence. Although there are still many problems, the future of BSNs is fundamentally promising, profoundly changing the human-machine relationships and improving the quality of people's lives. PMID:23615581

  17. A survey of body sensor networks.

    PubMed

    Lai, Xiaochen; Liu, Quanli; Wei, Xin; Wang, Wei; Zhou, Guoqiao; Han, Guangyi

    2013-04-24

    The technology of sensor, pervasive computing, and intelligent information processing is widely used in Body Sensor Networks (BSNs), which are a branch of wireless sensor networks (WSNs). BSNs are playing an increasingly important role in the fields of medical treatment, social welfare and sports, and are changing the way humans use computers. Existing surveys have placed emphasis on the concept and architecture of BSNs, signal acquisition, context-aware sensing, and system technology, while this paper will focus on sensor, data fusion, and network communication. And we will introduce the research status of BSNs, the analysis of hotspots, and future development trends, the discussion of major challenges and technical problems facing currently. The typical research projects and practical application of BSNs are introduced as well. BSNs are progressing along the direction of multi-technology integration and intelligence. Although there are still many problems, the future of BSNs is fundamentally promising, profoundly changing the human-machine relationships and improving the quality of people's lives.

  18. Distributed intelligence in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Shirgur, Vikram L.; Rao, Vittal S.

    2003-07-01

    With the advent of new wireless standards, faster microprocessors and smart sensors, it has become possible to construct wireless sensor networks with ample processing and communication capability. Our thrust in this paper is toward implementing a collaborative processing system for wireless sensor networks. A number of research groups have developed algorithms for applications such as target tracking and location, environment monitoring, and health monitoring of structures. What has been missing is a distributed sensor processing system which provides a framework for these algorithms to function. The system described here borrows heavily from the parallel processing sphere especially the Parallel Virtual Machine (PVM) system developed by ORNL. To facilitate distribution of computational resources, a new algorithm has been proposed for efficient distribution with the use of minimum system resources, in other words, determining an optimal set of nodes which can handle the distributed computation. For this purpose, we assign costs to the various parameters of interest in the network such as the node energy level, the communication energy cost/complexity and resource availability. We then arrive at a cost function by assigning suitable weights to these costs and choose only those nodes whose cost function evaluates to above a particular threshold value. Implementation of typical feature extraction algorithms such as the Discrete Fourier Transform (DFT) and the Discrete Wavelet Transform (DWT) are discussed.

  19. Serial FBG sensor network allowing overlapping spectra

    NASA Astrophysics Data System (ADS)

    Abbenseth, S.; Lochmann, S.; Ahrens, A.; Rehm, B.

    2016-05-01

    For structure or material monitoring low impact serial fiber Bragg grating (FBG) networks have attracted increasing research interest. Common sensor networks using wavelength division multiplexing (WDM) for FBG interrogation are limited in their efficiency by the spectral width of their light source, the FBG tuning range and the spectral guard bands. Overlapping spectra are strictly forbidden in this case. Applying time division multiplexing (TDM) or active resonator schemes may overcome these restrictions. However, they introduce other substantial disadvantages like signal roundtrip dependency or sophisticated control of active resonating structures. Code division multiplexing (CDM) as a means of FBG interrogation by simple autocorrelation of appropriate codes has been shown to be superior in this respect. However, it came at the cost of a second spectrometer introducing additional equalization efforts. We demonstrate a new serial FBG sensor network utilizing CDM signal processing for efficient sensor interrogation without the need of a second spectrometer and additional state of polarization (SOP) controlling components. It allows overlapping spectra even when all sensing FBGs are positioned at the same centre wavelength and it shows a high degree of insensitivity to SOP. Sequence inversed keyed (SIK) serial signal processing utilizing quasi-orthogonal balanced codes ensures simple and quick sensor interrogation with high signal-to-interference/noise ratio.

  20. A Survey of Body Sensor Networks

    PubMed Central

    Lai, Xiaochen; Liu, Quanli; Wei, Xin; Wang, Wei; Zhou, Guoqiao; Han, Guangyi

    2013-01-01

    The technology of sensor, pervasive computing, and intelligent information processing is widely used in Body Sensor Networks (BSNs), which are a branch of wireless sensor networks (WSNs). BSNs are playing an increasingly important role in the fields of medical treatment, social welfare and sports, and are changing the way humans use computers. Existing surveys have placed emphasis on the concept and architecture of BSNs, signal acquisition, context-aware sensing, and system technology, while this paper will focus on sensor, data fusion, and network communication. And we will introduce the research status of BSNs, the analysis of hotspots, and future development trends, the discussion of major challenges and technical problems facing currently. The typical research projects and practical application of BSNs are introduced as well. BSNs are progressing along the direction of multi-technology integration and intelligence. Although there are still many problems, the future of BSNs is fundamentally promising, profoundly changing the human-machine relationships and improving the quality of people's lives. PMID:23615581

  1. Sensor Network Provides Environmental Data

    NASA Technical Reports Server (NTRS)

    2007-01-01

    The National Biocomputation Center, a joint partnership between the Stanford University School of Medicine's Department of Surgery and NASA's Ames Research Center, is the test bed for much of NASA's research in telemedicine, the remote delivery of medical care. In early 2005, researchers at the National Biocomputation Center formed a spinoff company, Intelesense Technologies, to use the telemedicine sensors to provide integrated global monitoring systems. Intelesense uses the systems to better understand how environments and people are linked, monitor and protect natural resources, predict and adapt to environmental changes, provide for sustainable development, reduce the costs and impacts of natural disasters, and provide an effective and intelligent response to such disasters. Current projects range from protecting the environment to tracking emerging infectious diseases like avian influenza (bird flu) and helping people from around the world connect and interact with each other to better understand their environment and themselves.

  2. Sociocultural barriers to medical care among Mexican Americans in Texas: a summary report of research conducted by the Southwest Medical Sociology Ad Hoc Committee.

    PubMed

    Quesada, G M; Heller, P L

    1977-05-01

    This paper summarizes research findings from members of the Southwest Medical Sociology Ad Hoc Committee concerning sociocultural barriers to medical care among Mexican Americans in Texas. Committee members individually, or in two-person groups, studied a number of factors concerning Mexican-American medical care in Texas such as: 1) mortality, morbidity, and other health status indicators; 2) health manpower and educational needs; 3) political factors impeding economical health care; 4) alienation, familism, and their relationship to utilization of the health services; 5) language and communication barriers; and 6) folk medicine. Findings include documentation that structural alienation of Mexican-Americans from mainstream Anglo-American middle-class society is carried over into their relation with utilization of the health care delivery system; that their emphasis on familism works alternatively to encourage and discourage their seeking access to health care; the language differences serve to perpetuate certain cultural differences that are inimical to health care delivery; and that curanderismo can be seen as complementing other types of health care. The report concludes with a number of recommendations for accomplishing cultural integration that will lead to better care for this segment of the health population. PMID:857103

  3. Sociocultural barriers to medical care among Mexican Americans in Texas: a summary report of research conducted by the Southwest Medical Sociology Ad Hoc Committee.

    PubMed

    Quesada, G M; Heller, P L

    1977-05-01

    This paper summarizes research findings from members of the Southwest Medical Sociology Ad Hoc Committee concerning sociocultural barriers to medical care among Mexican Americans in Texas. Committee members individually, or in two-person groups, studied a number of factors concerning Mexican-American medical care in Texas such as: 1) mortality, morbidity, and other health status indicators; 2) health manpower and educational needs; 3) political factors impeding economical health care; 4) alienation, familism, and their relationship to utilization of the health services; 5) language and communication barriers; and 6) folk medicine. Findings include documentation that structural alienation of Mexican-Americans from mainstream Anglo-American middle-class society is carried over into their relation with utilization of the health care delivery system; that their emphasis on familism works alternatively to encourage and discourage their seeking access to health care; the language differences serve to perpetuate certain cultural differences that are inimical to health care delivery; and that curanderismo can be seen as complementing other types of health care. The report concludes with a number of recommendations for accomplishing cultural integration that will lead to better care for this segment of the health population.

  4. Optimal topologies for wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Tillett, Jason C.; Yang, Shanchieh J.; Rao, Raghuveer M.; Sahin, Ferat

    2004-11-01

    Since untethered sensor nodes operate on battery, and because they must communicate through a multi-hop network, it is vital to optimally configure the transmit power of the nodes both to conserve power and optimize spatial reuse of a shared channel. Current topology control algorithms try to minimize radio power while ensuring connectivity of the network. We propose that another important metric for a sensor network topology will involve consideration of hidden nodes and asymmetric links. Minimizing the number of hidden nodes and asymmetric links at the expense of increasing the transmit power of a subset of the nodes may in fact increase the longevity of the sensor network. In this paper we explore a distributed evolutionary approach to optimizing this new metric. Inspiration from the Particle Swarm Optimization technique motivates a distributed version of the algorithm. We generate topologies with fewer hidden nodes and asymmetric links than a comparable algorithm and present some results that indicate that our topologies deliver more data and last longer.

  5. Radiation detection with distributed sensor networks

    NASA Astrophysics Data System (ADS)

    Mielke, Angela M.; Smith, Mark C.; Brennan, Sean M.; Torney, David C.; Jackson, Diana; Karlin, Josh F.; Maccabe, Arthur B.

    2005-05-01

    Given the heightened awareness and response to threats posed to national security, it is important to evaluate, and if possible, improve current measures being taken to ensure our nation"s safety. With terrorism so prevalent in our thoughts, the possible risk of nuclear attacks remains a major concern. Portal monitors are one type of technology that may be used to combat this risk. Their purpose is to detect nuclear materials and, if found, alert first responders to such a discovery. Los Alamos National Laboratory (LANL) is currently working on an alternative to these costly portal monitors through the Distributed Sensor Network (DSN) project. In collaboration with the University of New Mexico (UNM), this project aims to develop distributed networks of heterogeneous sensors with the ability to process data in-situ in order to produce real-time decisions regarding the presence of radioactive material within the network. The focus of the work described in this paper has been the evaluation of current commercial products available for application deployments, as well as the development of a sensor network in simulation to reduce key deployment issues.

  6. Dynamic Privacy Management in Pervasive Sensor Networks

    NASA Astrophysics Data System (ADS)

    Gong, Nan-Wei; Laibowitz, Mathew; Paradiso, Joseph A.

    This paper describes the design and implementation of a dynamic privacy management system aimed at enabling tangible privacy control and feedback in a pervasive sensor network. Our work began with the development of a potentially invasive sensor network (with high resolution video, audio, and motion tracking capabilities) featuring different interactive applications that created incentive for accepting this network as an extension of people's daily social space. A user study was then conducted to evaluate several privacy management approaches - an active badge system for both online and on-site control, on/off power switches for physically disabling the hardware, and touch screen input control. Results from a user study indicated that an active badge for on-site privacy control is the most preferable method among all provided options. We present a set of results that yield insight into the privacy/benefit tradeoff from various sensing capabilities in pervasive sensor networks and how privacy settings and user behavior relate in these environments.

  7. A smart indoor air quality sensor network

    NASA Astrophysics Data System (ADS)

    Wen, Jin

    2006-03-01

    The indoor air quality (IAQ) has an important impact on public health. Currently, the indoor air pollution, caused by gas, particle, and bio-aerosol pollutants, is considered as the top five environmental risks to public health and has an estimated cost of $2 billion/year due to medical cost and lost productivity. Furthermore, current buildings are especially vulnerable for chemical and biological warfare (CBW) agent contamination because the central air conditioning and ventilation system serve as a nature carrier to spread the released agent from one location to the whole indoor environment within a short time period. To assure the IAQ and safety for either new or existing buildings, real time comprehensive IAQ and CBW measurements are needed. With the development of new sensing technologies, economic and reliable comprehensive IAQ and CBW sensors become promising. However, few studies exist that examine the design and evaluation issues related to IAQ and CBW sensor network. In this paper, relevant research areas including IAQ and CBW sensor development, demand control ventilation, indoor CBW sensor system design, and sensor system design for other areas such as water system protection, fault detection and diagnosis, are reviewed and summarized. Potential research opportunities for IAQ and CBW sensor system design and evaluation are discussed.

  8. Gas Main Sensor and Communications Network System

    SciTech Connect

    Hagen Schempf

    2006-05-31

    Automatika, Inc. was contracted by the Department of Energy (DOE) and with co-funding from the Northeast Gas Association (NGA), to develop an in-pipe natural gas prototype measurement and wireless communications system for assessing and monitoring distribution networks. This projected was completed in April 2006, and culminated in the installation of more than 2 dozen GasNet nodes in both low- and high-pressure cast-iron and steel mains owned by multiple utilities in the northeastern US. Utilities are currently logging data (off-line) and monitoring data in real time from single and multiple networked sensors over cellular networks and collecting data using wireless bluetooth PDA systems. The system was designed to be modular, using in-pipe sensor-wands capable of measuring, flow, pressure, temperature, water-content and vibration. Internal antennae allowed for the use of the pipe-internals as a waveguide for setting up a sensor network to collect data from multiple nodes simultaneously. Sensor nodes were designed to be installed with low- and no-blow techniques and tools. Using a multi-drop bus technique with a custom protocol, all electronics were designed to be buriable and allow for on-board data-collection (SD-card), wireless relaying and cellular network forwarding. Installation options afforded by the design included direct-burial and external polemounted variants. Power was provided by one or more batteries, direct AC-power (Class I Div.2) and solar-array. The utilities are currently in a data-collection phase and intend to use the collected (and processed) data to make capital improvement decisions, compare it to Stoner model predictions and evaluate the use of such a system for future expansion, technology-improvement and commercialization starting later in 2006.

  9. Mapping carbon monoxide using GPS tracked sensors.

    PubMed

    Milton, Richard; Steed, Anthony

    2007-01-01

    In this paper we discuss a pilot study where we have mapped urban air pollution using mobile carbon monoxide (CO) sensors. Our objective is to use inexpensive Global Positioning System (GPS) receivers to track the sensors and explore CO variations at a fine geographic scale. The critical issue in data processing is the treatment of the imprecise logs from the GPS. By using knowledge about the route and the geometry of the buildings, we are able to increase the position accuracy significantly, while at the same time showing that certain events, such as CO profiles while crossing roads, can be detected with a high degree of accuracy. Comparisons between data from our own mobile sensors and a fixed sensor site show good agreement in the vicinity of the fixed sensor, while at the same time identifying significant CO peaks within 100 m of this location. Using the mobile sensors to collect data along two of the main roads in the area, we are able to show CO variations along an urban canyon for parallel and perpendicular wind directions. Finally, a number of significant sources of CO were discovered during the course of the study, which suggest possible locations for fixed sensor sites in the future. We conclude by discussing the results in the context of the push towards large sensor networks and mobile communications. The potential for ad hoc mobile sensor networks may be very large.

  10. Achieving network level privacy in Wireless Sensor Networks.

    PubMed

    Shaikh, Riaz Ahmed; Jameel, Hassan; d'Auriol, Brian J; Lee, Heejo; Lee, Sungyoung; Song, Young-Jae

    2010-01-01

    Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

  11. Connectivity, Coverage and Placement in Wireless Sensor Networks

    PubMed Central

    Li, Ji; Andrew, Lachlan L.H.; Foh, Chuan Heng; Zukerman, Moshe; Chen, Hsiao-Hwa

    2009-01-01

    Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes. PMID:22408474

  12. Wireless Sensor Network Handles Image Data

    NASA Technical Reports Server (NTRS)

    2008-01-01

    To relay data from remote locations for NASA s Earth sciences research, Goddard Space Flight Center contributed to the development of "microservers" (wireless sensor network nodes), which are now used commercially as a quick and affordable means to capture and distribute geographical information, including rich sets of aerial and street-level imagery. NASA began this work out of a necessity for real-time recovery of remote sensor data. These microservers work much like a wireless office network, relaying information between devices. The key difference, however, is that instead of linking workstations within one office, the interconnected microservers operate miles away from one another. This attribute traces back to the technology s original use: The microservers were originally designed for seismology on remote glaciers and ice streams in Alaska, Greenland, and Antarctica-acquiring, storing, and relaying data wirelessly between ground sensors. The microservers boast three key attributes. First, a researcher in the field can establish a "managed network" of microservers and rapidly see the data streams (recovered wirelessly) on a field computer. This rapid feedback permits the researcher to reconfigure the network for different purposes over the course of a field campaign. Second, through careful power management, the microservers can dwell unsupervised in the field for up to 2 years, collecting tremendous amounts of data at a research location. The third attribute is the exciting potential to deploy a microserver network that works in synchrony with robotic explorers (e.g., providing ground truth validation for satellites, supporting rovers as they traverse the local environment). Managed networks of remote microservers that relay data unsupervised for up to 2 years can drastically reduce the costs of field instrumentation and data rec

  13. Tritium-powered radiation sensor network

    NASA Astrophysics Data System (ADS)

    Litz, Marc S.; Russo, Johnny A.; Katsis, Dimos

    2016-05-01

    Isotope power supplies offer long-lived (100 years using 63Ni), low-power energy sources, enabling sensors or communications nodes for the lifetime of infrastructure. A tritium beta-source (12.5-year half-life) encapsulated in a phosphor-lined vial couples directly to a photovoltaic (PV) to generate a trickle current into an electrical load. An inexpensive design is described using commercial-of-the-shelf (COTS) components that generate 100 μWe for nextgeneration compact electronics/sensors. A matched radiation sensor has been built for long-duration missions utilizing microprocessor-controlled sleep modes, low-power electronic components, and a passive interrupt driven environmental wake-up. The low-power early-warning radiation detector network and isotope power source enables no-maintenance mission lifetimes.

  14. SITRUS: Semantic Infrastructure for Wireless Sensor Networks.

    PubMed

    Bispo, Kalil A; Rosa, Nelson S; Cunha, Paulo R F

    2015-01-01

    Wireless sensor networks (WSNs) are made up of nodes with limited resources, such as processing, bandwidth, memory and, most importantly, energy. For this reason, it is essential that WSNs always work to reduce the power consumption as much as possible in order to maximize its lifetime. In this context, this paper presents SITRUS (semantic infrastructure for wireless sensor networks), which aims to reduce the power consumption of WSN nodes using ontologies. SITRUS consists of two major parts: a message-oriented middleware responsible for both an oriented message communication service and a reconfiguration service; and a semantic information processing module whose purpose is to generate a semantic database that provides the basis to decide whether a WSN node needs to be reconfigurated or not. In order to evaluate the proposed solution, we carried out an experimental evaluation to assess the power consumption and memory usage of WSN applications built atop SITRUS.

  15. SITRUS: Semantic Infrastructure for Wireless Sensor Networks.

    PubMed

    Bispo, Kalil A; Rosa, Nelson S; Cunha, Paulo R F

    2015-01-01

    Wireless sensor networks (WSNs) are made up of nodes with limited resources, such as processing, bandwidth, memory and, most importantly, energy. For this reason, it is essential that WSNs always work to reduce the power consumption as much as possible in order to maximize its lifetime. In this context, this paper presents SITRUS (semantic infrastructure for wireless sensor networks), which aims to reduce the power consumption of WSN nodes using ontologies. SITRUS consists of two major parts: a message-oriented middleware responsible for both an oriented message communication service and a reconfiguration service; and a semantic information processing module whose purpose is to generate a semantic database that provides the basis to decide whether a WSN node needs to be reconfigurated or not. In order to evaluate the proposed solution, we carried out an experimental evaluation to assess the power consumption and memory usage of WSN applications built atop SITRUS. PMID:26528974

  16. SITRUS: Semantic Infrastructure for Wireless Sensor Networks

    PubMed Central

    Bispo, Kalil A.; Rosa, Nelson S.; Cunha, Paulo R. F.

    2015-01-01

    Wireless sensor networks (WSNs) are made up of nodes with limited resources, such as processing, bandwidth, memory and, most importantly, energy. For this reason, it is essential that WSNs always work to reduce the power consumption as much as possible in order to maximize its lifetime. In this context, this paper presents SITRUS (semantic infrastructure for wireless sensor networks), which aims to reduce the power consumption of WSN nodes using ontologies. SITRUS consists of two major parts: a message-oriented middleware responsible for both an oriented message communication service and a reconfiguration service; and a semantic information processing module whose purpose is to generate a semantic database that provides the basis to decide whether a WSN node needs to be reconfigurated or not. In order to evaluate the proposed solution, we carried out an experimental evaluation to assess the power consumption and memory usage of WSN applications built atop SITRUS. PMID:26528974

  17. Probabilistic deployment for multiple sensor systems

    NASA Astrophysics Data System (ADS)

    Qian, Ming; Ferrari, Silvia

    2005-05-01

    The performance of many multi-sensor systems can be significantly improved by using a priori environmental information and sensor data to plan the movements of sensor platforms that are later deployed with the purpose of improving the quality of the final detection and classification results. However, existing path planning algorithms and ad-hoc data processing (e.g., fusion) techniques do not allow for the systematic treatment of multiple and heterogeneous sensors and their platforms. This paper presents a method that combines Bayesian network inference with probabilistic roadmap (PRM) planners to utilize the information obtained by different sensors and their level of uncertainty. The uncertainty of prior sensed information is represented by entropy values obtained from the Bayesian network (BN) models of the respective sensor measurement processes. The PRM algorithm is modified to utilize the entropy distribution in optimizing the path of posterior sensor platforms that have the following objectives: (1) improve the quality of the sensed information, i.e., through fusion, (2) minimize the distance traveled by the platforms, and (3) avoid obstacles. This so-called Probabilistic Deployment (PD) method is applied to a demining system comprised of ground-penetrating radars (GPR), electromagnetic (EMI), and infrared sensors (IR) installed on ground platforms, to detect and classify buried mines. Numerical simulations show that PD is more efficient than path planning techniques that do not utilize a priori information, such as complete coverage, random coverage method, or PRM methods that do not utilize Bayesian inference.

  18. Three-dimensional ocean sensor networks: A survey

    NASA Astrophysics Data System (ADS)

    Wang, Yu; Liu, Yingjian; Guo, Zhongwen

    2012-12-01

    The past decade has seen a growing interest in ocean sensor networks because of their wide applications in marine research, oceanography, ocean monitoring, offshore exploration, and defense or homeland security. Ocean sensor networks are generally formed with various ocean sensors, autonomous underwater vehicles, surface stations, and research vessels. To make ocean sensor network applications viable, efficient communication among all devices and components is crucial. Due to the unique characteristics of underwater acoustic channels and the complex deployment environment in three dimensional (3D) ocean spaces, new efficient and reliable communication and networking protocols are needed in design of ocean sensor networks. In this paper, we aim to provide an overview of the most recent advances in network design principles for 3D ocean sensor networks, with focuses on deployment, localization, topology design, and position-based routing in 3D ocean spaces.

  19. Wireless sensor network for monitoring soil moisture and weather conditions

    Technology Transfer Automated Retrieval System (TEKTRAN)

    A wireless sensor network (WSN) was developed and deployed in three fields to monitor soil water status and collect weather data for irrigation scheduling. The WSN consists of soil-water sensors, weather sensors, wireless data loggers, and a wireless modem. Soil-water sensors were installed at three...

  20. Contactless Biometrics in Wireless Sensor Network: A Survey

    NASA Astrophysics Data System (ADS)

    Razzak, Muhammad Imran; Khan, Muhammad Khurram; Alghathbar, Khaled

    Security can be enhanced through wireless sensor network using contactless biometrics and it remains a challenging and demanding task due to several limitations of wireless sensor network. Network life time is very less if it involves image processing task due to heavy energy required for image processing and image communication. Contactless biometrics such as face recognition is most suitable and applicable for wireless sensor network. Distributed face recognition in WSN not only help to reduce the communication overload but it also increase the node life time by distributing the work load on the nodes. This paper presents state-of-art of biometrics in wireless sensor network.

  1. A novel compound chaotic block cipher for wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Tong, Xiao-Jun; Wang, Zhu; Liu, Yang; Zhang, Miao; Xu, Lianjie

    2015-05-01

    The nodes of wireless sensor network (WSN) have limited calculation and communication ability. Traditional encryption algorithms need large amounts of resources, so they cannot be applied to the wireless sensor network. To solve this problem, this paper proposes a block cipher algorithm for wireless sensor network based on compound chaotic map. The algorithm adopts Feistel network and constructs a Cubic function including discretized chaotic map, and its key is generated by the compound chaotic sequence. Security and performance tests show that the algorithm has high security and efficiency, low resource depletion. So the novel chaotic algorithm is suitable for the wireless sensor networks.

  2. Mobile Networked Sensors for Environmental Observatories

    NASA Astrophysics Data System (ADS)

    Kaiser, W. J.

    2005-12-01

    The development of the first embedded networked sensing (ENS) systems has been rapidly followed by their successful deployment for investigations in environments ranging from forest ecosystems, to rivers and lakes, and to subsurface soil observations. As ENS systems have been deployed, many technology challenges have been successfully addressed. For example, the requirements for local and remote data access and long operating life have been encountered and solved with a novel hierarchical network architecture and unique, low power platforms. This presentation will describe this progress and also the development and applications of a new ENS system addressing the most current challenges: A robotic ENS platform providing precise, reliable, and sustained observation capability with diverse sensing capabilities that may adapt to environmental dynamics. In the development of methods for autonomous observation by networked sensors, many applications have emerged requiring spatially and temporally intensive data sampling. Examples include the mapping of forest understory solar radiation, autonomous acquisition of imaging for plant phenology, and mapping of contaminant concentration in aquatic systems. Common to these applications is the need to actively and continuously configure the location and orientation of sensors for high fidelity mapping of the spatial distribution of phenomena. To address this primary environmental observation need, a new sensing platform, Networked Infomechanical Systems (NIMS) has been developed. NIMS relies on deployed aerial infrastructure (for example, cable suspension systems) in the natural environment to permit robotic devices to precisely and reliably move or remain stationary as required at elevations that may lie directly in or above the forest canopy or within a river or stream. NIMS systems are suspended to allow devices to translate a sensor node horizontally, and also to raise and lower devices. Examples of sensors that are now

  3. Robust Forecasting for Energy Efficiency of Wireless Multimedia Sensor Networks

    PubMed Central

    Wang, Xue; Ma, Jun-Jie; Ding, Liang; Bi, Dao-Wei

    2007-01-01

    An important criterion of wireless sensor network is the energy efficiency in specified applications. In this wireless multimedia sensor network, the observations are derived from acoustic sensors. Focused on the energy problem of target tracking, this paper proposes a robust forecasting method to enhance the energy efficiency of wireless multimedia sensor networks. Target motion information is acquired by acoustic sensor nodes while a distributed network with honeycomb configuration is constructed. Thereby, target localization is performed by multiple sensor nodes collaboratively through acoustic signal processing. A novel method, combining autoregressive moving average (ARMA) model and radial basis function networks (RBFNs), is exploited to perform robust target position forecasting during target tracking. Then sensor nodes around the target are awakened according to the forecasted target position. With committee decision of sensor nodes, target localization is performed in a distributed manner and the uncertainty of detection is reduced. Moreover, a sensor-to-observer routing approach of the honeycomb mesh network is investigated to solve the data reporting considering the residual energy of sensor nodes. Target localization and forecasting are implemented in experiments. Meanwhile, sensor node awakening and dynamic routing are evaluated. Experimental results verify that energy efficiency of wireless multimedia sensor network is enhanced by the proposed target tracking method.

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

  5. Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

    PubMed Central

    Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; 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

  6. Neural network based analysis for chemical sensor arrays

    SciTech Connect

    Hashem, S.; Keller, P.E.; Kouzes, R.T.; Kangas, L.J.

    1995-04-01

    Compact, portable systems capable of quickly identifying contaminants in the field are of great importance when monitoring the environment. In this paper, we examine the effectiveness of using artificial neural networks for real-time data analysis of a sensor array. Analyzing the sensor data in parallel may allow for rapid identification of contaminants in the field without requiring highly selective individual sensors. We use a prototype sensor array which consists of nine tin-oxide Taguchi-type sensors, a temperature sensor, and a humidity sensor. We illustrate that by using neural network based analysis of the sensor data, the selectivity of the sensor array may be significantly improved, especially when some (or all) the sensors are not highly selective.

  7. Artillery localization using networked wireless ground sensors

    NASA Astrophysics Data System (ADS)

    Swanson, David C.

    2002-08-01

    This paper presents the results of an installation of four acoustic/seismic ground sensors built using COTS computers and networking gear and operating on a continuous basis at Yuma Proving Grounds, Arizona. A description of the design can be found as well, which is essentially a Windows 2000 PC with 24-bit data acquisition, GPS timing, and environmental sensors for wind and temperature. A 4-element square acoustic array 1.8m on a side can be used to detect the time and angle of arrival of the muzzle blast and the impact explosion. A 3-component geophone allows the seismic wave direction to be estimated. The 8th channel of the 24-bit data acquisition system has a 1-pulse-per-second time signal from the GPS. This allows acoustic/seismic 'snapshots' to be coherently related from multiple disconnected ground sensor nodes. COTS 2.4 GHz frequency hopping radios (802.11 standard) are used with either omni or yagi antennas depending on the location on the range. Localization of the artillery or impact can be done by using the time and angle of arrival of the waves at 2 or more ground sensor locations. However, this straightforward analysis can be significantly complicated by weather and wind noise and is also the subject of another research contract. This work will present a general description of the COTS ground sensor installation, show example data autonomously collected including agent-based atmospheric data, and share some of the lessons learned from operating a Windows 2000 based system continuously outdoors.

  8. Bioconversion of α-Linolenic Acid into n-3 Long-Chain Polyunsaturated Fatty Acid in Hepatocytes and Ad Hoc Cell Culture Optimisation

    PubMed Central

    Alhazzaa, Ramez; Sinclair, Andrew J.; Turchini, Giovanni M.

    2013-01-01

    This study aimed to establish optimal conditions for a cell culture system that would allow the measurement of 18∶3n-3 (ALA) bioconversion into n-3 long-chain polyunsaturated fatty acid (n-3 LC-PUFA), and to determine the overall pathway kinetics. Using rat hepatocytes (FaO) as model cells, it was established that a maximum 20∶5n-3 (EPA) production from 50 µM ALA initial concentration was achieved after 3 days of incubation. Next, it was established that a gradual increase in the ALA concentration from 0 up to 125µM lead to a proportional increase in EPA, without concomitant increase in further elongated or desaturated products, such as 22∶5n-3 (DPA) and 22∶6n-3 (DHA) in 3 day incubations. Of interest, ALA bioconversion products were observed in the culture medium. Therefore, in vitro experiments disregarding the medium fatty acid content are underestimating the metabolism efficiency. The novel application of the fatty acid mass balance (FAMB) method on cell culture system (cells with medium) enabled quantifying the apparent enzymatic activities for the biosynthesis of n-3 LC-PUFA. The activity of the key enzymes was estimated and showed that, under these conditions, 50% (Km) of the theoretical maximal (Vmax = 3654 µmol.g−1 of cell protein.hour−1) Fads2 activity on ALA can be achieved with 81 µM initial ALA. Interestingly, the apparent activity of Elovl2 (20∶5n-3 elongation) was the slowest amongst other biosynthesis steps. Therefore, the possible improvement of Elovl2 activity is suggested toward a more efficient DHA production from ALA. The present study proposed and described an ad hoc optimised cell culture conditions and methodology towards achieving a reliable experimental platform, using FAMB, to assist in studying the efficiency of ALA bioconversion into n-3 LC-PUFA in vitro. The FAMB proved to be a powerful and inexpensive method to generate a detailed description of the kinetics of n-3 LC-PUFA biosynthesis enzymes activities in vitro

  9. Decentralized sensor fusion for Ubiquitous Networking Robotics in Urban Areas.

    PubMed

    Sanfeliu, Alberto; Andrade-Cetto, Juan; Barbosa, Marco; Bowden, Richard; Capitán, Jesús; Corominas, Andreu; Gilbert, Andrew; Illingworth, John; Merino, Luis; Mirats, Josep M; Moreno, Plínio; Ollero, Aníbal; Sequeira, João; Spaan, Matthijs T J

    2010-01-01

    In this article we explain the architecture for the environment and sensors that has been built for the European project URUS (Ubiquitous Networking Robotics in Urban Sites), a project whose objective is to develop an adaptable network robot architecture for cooperation between network robots and human beings and/or the environment in urban areas. The project goal is to deploy a team of robots in an urban area to give a set of services to a user community. This paper addresses the sensor architecture devised for URUS and the type of robots and sensors used, including environment sensors and sensors onboard the robots. Furthermore, we also explain how sensor fusion takes place to achieve urban outdoor execution of robotic services. Finally some results of the project related to the sensor network are highlighted. PMID:22294927

  10. Decentralized Sensor Fusion for Ubiquitous Networking Robotics in Urban Areas

    PubMed Central

    Sanfeliu, Alberto; Andrade-Cetto, Juan; Barbosa, Marco; Bowden, Richard; Capitán, Jesús; Corominas, Andreu; Gilbert, Andrew; Illingworth, John; Merino, Luis; Mirats, Josep M.; Moreno, Plínio; Ollero, Aníbal; Sequeira, João; Spaan, Matthijs T.J.

    2010-01-01

    In this article we explain the architecture for the environment and sensors that has been built for the European project URUS (Ubiquitous Networking Robotics in Urban Sites), a project whose objective is to develop an adaptable network robot architecture for cooperation between network robots and human beings and/or the environment in urban areas. The project goal is to deploy a team of robots in an urban area to give a set of services to a user community. This paper addresses the sensor architecture devised for URUS and the type of robots and sensors used, including environment sensors and sensors onboard the robots. Furthermore, we also explain how sensor fusion takes place to achieve urban outdoor execution of robotic services. Finally some results of the project related to the sensor network are highlighted. PMID:22294927

  11. Neural Network-Based Sensor Validation for Turboshaft Engines

    NASA Technical Reports Server (NTRS)

    Moller, James C.; Litt, Jonathan S.; Guo, Ten-Huei

    1998-01-01

    Sensor failure detection, isolation, and accommodation using a neural network approach is described. An auto-associative neural network is configured to perform dimensionality reduction on the sensor measurement vector and provide estimated sensor values. The sensor validation scheme is applied in a simulation of the T700 turboshaft engine in closed loop operation. Performance is evaluated based on the ability to detect faults correctly and maintain stable and responsive engine operation. The set of sensor outputs used for engine control forms the network input vector. Analytical redundancy is verified by training networks of successively smaller bottleneck layer sizes. Training data generation and strategy are discussed. The engine maintained stable behavior in the presence of sensor hard failures. With proper selection of fault determination thresholds, stability was maintained in the presence of sensor soft failures.

  12. Decentralized sensor fusion for Ubiquitous Networking Robotics in Urban Areas.

    PubMed

    Sanfeliu, Alberto; Andrade-Cetto, Juan; Barbosa, Marco; Bowden, Richard; Capitán, Jesús; Corominas, Andreu; Gilbert, Andrew; Illingworth, John; Merino, Luis; Mirats, Josep M; Moreno, Plínio; Ollero, Aníbal; Sequeira, João; Spaan, Matthijs T J

    2010-01-01

    In this article we explain the architecture for the environment and sensors that has been built for the European project URUS (Ubiquitous Networking Robotics in Urban Sites), a project whose objective is to develop an adaptable network robot architecture for cooperation between network robots and human beings and/or the environment in urban areas. The project goal is to deploy a team of robots in an urban area to give a set of services to a user community. This paper addresses the sensor architecture devised for URUS and the type of robots and sensors used, including environment sensors and sensors onboard the robots. Furthermore, we also explain how sensor fusion takes place to achieve urban outdoor execution of robotic services. Finally some results of the project related to the sensor network are highlighted.

  13. Water quality sensor placement in water networks with budget constraints.

    SciTech Connect

    Walski, Thomas M.; Uber, James G.; Hart, William Eugene; Phillips, Cynthia Ann; Berry, Jonathan W.

    2005-02-01

    In recent years, several integer programming models have been proposed to place sensors in municipal water networks in order to detect intentional or accidental contamination. Although these initial models assumed that it is equally costly to place a sensor at any place in the network, there clearly are practical cost constraints that would impact a sensor placement decision. Such constraints include not only labor costs but also the general accessibility of a sensor placement location. In this paper, we extend our integer program to explicitly model the cost of sensor placement. We partition network locations into groups of varying placement cost, and we consider the public health impacts of contamination events under varying budget constraints. Thus our models permit cost/benefit analyses for differing sensor placement designs. As a control for our optimization experiments, we compare the set of sensor locations selected by the optimization models to a set of manually-selected sensor locations.

  14. GAS MAIN SENSOR AND COMMUNICATIONS NETWORK SYSTEM

    SciTech Connect

    Hagen Schempf, Ph.D.

    2003-02-27

    Automatika, Inc. was contracted by the Department of Energy (DOE) and with co-funding from the New York Gas Group (NYGAS), to develop an in-pipe natural gas prototype measurement and wireless communications system for assessing and monitoring distribution networks. A prototype system was built for low-pressure cast-iron mains and tested in a spider- and serial-network configuration in a live network in Long Island with the support of Keyspan Energy, Inc. The prototype unit combined sensors capable of monitoring pressure, flow, humidity, temperature and vibration, which were sampled and combined in data-packages in an in-pipe master-slave architecture to collect data from a distributed spider-arrangement, and in a master-repeater-slave configuration in serial or ladder-network arrangements. It was found that the system was capable of performing all data-sampling and collection as expected, yielding interesting results as to flow-dynamics and vibration-detection. Wireless in-pipe communications were shown to be feasible and valuable data was collected in order to determine how to improve on range and data-quality in the future.

  15. Fast notification architecture for wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Lee, Dong-Hahk

    2013-03-01

    In an emergency, since it is vital to transmit the message to the users immediately after analysing the data to prevent disaster, this article presents the deployment of a fast notification architecture for a wireless sensor network. The sensor nodes of the proposed architecture can monitor an emergency situation periodically and transmit the sensing data, immediately to the sink node. We decide on the grade of fire situation according to the decision rule using the sensing values of temperature, CO, smoke density and temperature increasing rate. On the other hand, to estimate the grade of air pollution, the sensing data, such as dust, formaldehyde, NO2, CO2, is applied to the given knowledge model. Since the sink node in the architecture has a ZigBee interface, it can transmit the alert messages in real time according to analysed results received from the host server to the terminals equipped with a SIM card-type ZigBee module. Also, the host server notifies the situation to the registered users who have cellular phone through short message service server of the cellular network. Thus, the proposed architecture can adapt an emergency situation dynamically compared to the conventional architecture using video processing. In the testbed, after generating air pollution and fire data, the terminal receives the message in less than 3 s. In the test results, this system can also be applied to buildings and public areas where many people gather together, to prevent unexpected disasters in urban settings.

  16. Sensor Selection for Target Tracking in Wireless Sensor Networks With Uncertainty

    NASA Astrophysics Data System (ADS)

    Cao, Nianxia; Choi, Sora; Masazade, Engin; Varshney, Pramod K.

    2016-10-01

    In this paper, we propose a multiobjective optimization framework for the sensor selection problem in uncertain Wireless Sensor Networks (WSNs). The uncertainties of the WSNs result in a set of sensor observations with insufficient information about the target. We propose a novel mutual information upper bound (MIUB) based sensor selection scheme, which has low computational complexity, same as the Fisher information (FI) based sensor selection scheme, and gives estimation performance similar to the mutual information (MI) based sensor selection scheme. Without knowing the number of sensors to be selected a priori, the multiobjective optimization problem (MOP) gives a set of sensor selection strategies that reveal different trade-offs between two conflicting objectives: minimization of the number of selected sensors and minimization of the gap between the performance metric (MIUB and FI) when all the sensors transmit measurements and when only the selected sensors transmit their measurements based on the sensor selection strategy. Illustrative numerical results that provide valuable insights are presented.

  17. Automated sensor networks to advance ocean science

    NASA Astrophysics Data System (ADS)

    Schofield, O.; Orcutt, J. A.; Arrott, M.; Vernon, F. L.; Peach, C. L.; Meisinger, M.; Krueger, I.; Kleinert, J.; Chao, Y.; Chien, S.; Thompson, D. R.; Chave, A. D.; Balasuriya, A.

    2010-12-01

    The National Science Foundation has funded the Ocean Observatories Initiative (OOI), which over the next five years will deploy infrastructure to expand scientist’s ability to remotely study the ocean. The deployed infrastructure will be linked by a robust cyberinfrastructure (CI) that will integrate marine observatories into a coherent system-of-systems. OOI is committed to engaging the ocean sciences community during the construction pahse. For the CI, this is being enabled by using a “spiral design strategy” allowing for input throughout the construction phase. In Fall 2009, the OOI CI development team used an existing ocean observing network in the Mid-Atlantic Bight (MAB) to test OOI CI software. The objective of this CI test was to aggregate data from ships, autonomous underwater vehicles (AUVs), shore-based radars, and satellites and make it available to five different data-assimilating ocean forecast models. Scientists used these multi-model forecasts to automate future glider missions in order to demonstrate the feasibility of two-way interactivity between the sensor web and predictive models. The CI software coordinated and prioritized the shared resources that allowed for the semi-automated reconfiguration of assett-tasking, and thus enabled an autonomous execution of observation plans for the fixed and mobile observation platforms. Efforts were coordinated through a web portal that provided an access point for the observational data and model forecasts. Researchers could use the CI software in tandem with the web data portal to assess the performance of individual numerical model results, or multi-model ensembles, through real-time comparisons with satellite, shore-based radar, and in situ robotic measurements. The resulting sensor net will enable a new means to explore and study the world’s oceans by providing scientists a responsive network in the world’s oceans that can be accessed via any wireless network.

  18. Data Transport in a Novel Wireless Sensor Network

    SciTech Connect

    Roberts, R S

    2001-06-01

    The deployment and operation of large wireless sensor networks can pose difficult problems, particularly in time critical situations, over large geographic areas, or in rugged terrain. An approach to this problem is to use unmanned air vehicles to first deploy the sensors, and then provide communication services to the sensors. This paper presents a network model that describes the flow of data through such a sensor network. Simulation results are presented that illustrate the behavior of the data flow in steady state and transient conditions.

  19. Wireless Sensor Networks for Environmental Monitoring

    NASA Astrophysics Data System (ADS)

    Liang, X.; Liang, Y.; Navarro, M.; Zhong, X.; Villalba, G.; Li, Y.; Davis, T.; Erratt, N.

    2015-12-01

    Wireless sensor networks (WSNs) have gained an increasing interest in a broad range of new scientific research and applications. WSN technologies can provide high resolution for spatial and temporal data which has not been possible before, opening up new opportunities. On the other hand, WSNs, particularly outdoor WSNs in harsh environments, present great challenges for scientists and engineers in terms of the network design, deployment, operation, management, and maintenance. Since 2010, we have been working on the deployment of an outdoor multi-hop WSN testbed for hydrological/environmental monitoring in a forested hill-sloped region at the Audubon Society of Western Pennsylvania (ASWP), Pennsylvania, USA. The ASWP WSN testbed has continuously evolved and had more than 80 nodes by now. To our knowledge, the ASWP WSN testbed represents one of the first known long-term multi-hop WSN deployments in an outdoor environment. As simulation and laboratory methods are unable to capture the complexity of outdoor environments (e.g., forests, oceans, mountains, or glaciers), which significantly affect WSN operations and maintenance, experimental deployments are essential to investigate and understand WSN behaviors and performances as well as its maintenance characteristics under these harsh conditions. In this talk, based on our empirical studies with the ASWP WSN testbed, we will present our discoveries and investigations on several important aspects including WSN energy profile, node reprogramming, network management system, and testbed maintenance. We will then provide our insight into these critical aspects of outdoor WSN deployments and operations.

  20. Wireless sensor network for irrigation application in cotton

    Technology Transfer Automated Retrieval System (TEKTRAN)

    A wireless sensor network was deployed in a cotton field to monitor soil water status for irrigation. The network included two systems, a Decagon system and a microcontroller-based system. The Decagon system consists of soil volumetric water-content sensors, wireless data loggers, and a central data...