Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sensor networks”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks

Here, we consider underwater multi-modal wireless sensor networks (UWSNs) suitable for applications on submarine surveillance and monitoring, where nodes offload data to a mobile autonomous underwater vehicle (AUV) via optical technology, and coordinate using acoustic communication. Sensed data are associated with a value, decaying in time. In this scenario, we address the problem of finding the path of the AUV so that the Value of Information (VoI) of the data delivered to a sink on the surface is maximized. We define a Greedy and Adaptive AUV Path-finding (GAAP) heuristic that drives the AUV to collect data from nodes depending on the VoI of their data. For benchmarking the performance of AUV path-finding heuristics, we define an integer linear programming (ILP) formulation that accurately models the considered scenario, deriving a path that drives the AUV to collect and deliver data with the maximum VoI. In our experiments GAAP consistently delivers more than 80 percent of the theoretical maximum VoI determined by the ILP model. We also compare the performance of GAAP with that of other strategies for driving the AUV among sensing nodes, namely, random paths, TSP-based paths and a “lawn mower”-like strategy. Our results show that GAAP always outperforms every other heuristic in terms of delivered VoI, also obtaining higher energy efficiency.

47 OTHER INSTRUMENTATION↗

Detecting Rain–Snow-Transition Elevations in Mountain Basins Using Wireless Sensor Networks

Here, to provide complementary information on the hydrologically important rain–snow-transition elevation in mountain basins, this study provides two estimation methods using ground measurements from basin-scale wireless sensor networks: one based on wet-bulb temperature T wet and the other based on snow-depth measurements of accumulation and ablation. With data from 17 spatially distributed clusters (178 nodes) from two networks, in the American and Feather River basins of California’s Sierra Nevada, we analyzed transition elevation during 76 storm events in 2014–18. A T wet threshold of 0.5°C best matched the transition elevation defined by snow depth. Transition elevations using T wet in upper elevations of the basins generally agreed with atmospheric snow level from radars located at lower elevations, while radar snow level was ~100 m higher due to snow-level lowering on windward mountainsides during orographic lifting. Diurnal patterns of the difference between transition elevation and radar snow level were observed in the American basin, related to diurnal ground-temperature variations. However, these patterns were not found in the Feather basin due to complex terrain and higher uncertainties in transition-elevation estimates. The American basin tends to exhibit 100-m-higher transition elevations than does the Feather basin, consistent with the Feather basin being about 1° latitude farther north. Transition elevation averaged 155 m higher in intense atmospheric river events than in other events; meanwhile, snow-level lowering was enhanced with a 90-m-larger difference between radar snow level and transition elevation. On-the-ground continuous observations from distributed sensor networks can complement radar data and provide important ground truth and spatially resolved information on transition elevations in mountain basins.

54 ENVIRONMENTAL SCIENCES↗

Blockchain Secured Alternative to Mixed Routing / Non-Routing Nodes Wireless Sensor Network Topologies for Industrial Settings

Mesh networking of wireless sensors implies that individual sensor nodes will be able to communicate with neighboring nodes thereby forming a communication fabric. In the case of traditional wireless sensors, their radio frequency coverage – or RF footprint – is defined by the maximum separation distance between neighboring nodes while still achieving some level of, typically degrading from maximum, information transfer (throughput). Security issues arise in the situations where the sensor nodes are deployed near the physical boundary of an industrial site (edge nodes). In the more general case of the sensors relying on omnidirectional antennas, the edge nodes’ RF footprint may extend beyond the edge of the facility. If the edge nodes perform as routing nodes, then it may be possible for similar sensors/devices outside of the facility boundary to join the network. Here, while various schemes have been implemented to address this security issue, we report on the possibility of using blockchain for security of such edge nodes.

47 OTHER INSTRUMENTATION↗

Thoreau: A fully-buried wireless underground sensor network in an urban environment

This paper describes the design and deployment of a functional Wireless Underground Sensor Network (WUSN) on a university campus. This is an unique system that is operational over a large area and over a long period of time, providing real time monitoring of the environment with the data being curated and displayed on an open website. The system details, including the architecture, node design, user interface, and deployment are provided. Initial measurement results are analyzed to show the functionality and performance of the system.

internet of things↗

Real-Time Alpine Measurement System Using Wireless Sensor Networks

Monitoring the snow pack is crucial for many stakeholders, whether for hydro-power optimization, water management or flood control. Traditional forecasting relies on regression methods, which often results in snow melt runoff predictions of low accuracy in non-average years. Existing ground-based real-time measurement systems do not cover enough physiographic variability and are mostly installed at low elevations. We present the hardware and software design of a state-of-the-art distributedWireless Sensor Network (WSN)-based autonomous measurement system with real-time remote data transmission that gathers data of snow depth, air temperature, air relative humidity, soil moisture, soil temperature, and solar radiation in physiographically representative locations. Elevation, aspect, slope and vegetation are used to select network locations, and distribute sensors throughout a given network location, since they govern snow pack variability at various scales. Three WSNs were installed in the Sierra Nevada of Northern California throughout the North Fork of the Feather River, upstream of the Oroville dam and multiple powerhouses along the river. The WSNs gathered hydrologic variables and network health statistics throughout the 2017 water year, one of northern Sierra’s wettest years on record. These networks leverage an ultra-low-power wireless technology to interconnect their components and offer recovery features, resilience to data loss due to weather and wildlife disturbances and real-time topological visualizations of the network health. Data show considerable spatial variability of snow depth, even within a 1 km 2 network location. In conclusion, combined with existing systems, these WSNs can better detect precipitation timing and phase in, monitor sub-daily dynamics of infiltration and surface runoff during precipitation or snow melt, and inform hydro power managers about actual ablation and end-of-season date across the landscape.

47 OTHER INSTRUMENTATION↗

On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks

Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which critically affects network lifetime. We generalize and solve the problem of deploying multiple base stations to maximize network lifetime in terms of two different metrics under one-hop and multihop communication models. In the one-hop communication model, the sensors far away from base stations always deplete their energy much faster than others. We propose an optimal solution and a heuristic approach based on the minimal enclosing circle algorithm to deploy a base station at the geometric center of each cluster. In the multihop communication model, both base station location and data routing mechanism need to be considered in maximizing network lifetime. We propose an iterative algorithm based on rigorous mathematical derivations and use linear programming to compute the optimal routing paths for data transmission. Simulation results show the distinguished performance of the proposed deployment algorithms in maximizing network lifetime.

Lin, Yunyue↗

Prolonging Wireless Sensor Network Lifetime Using Routing Protocol

Prolonging network lifetime is one of the challenging issues of Wireless Sensor Networks (WSN). Many techniques have been proposed to achieve a longer battery life for the sensor nodes. In this paper, we focus on the routing technique to improve the battery life and extend the network lifetime. Our protocol is based upon the two existing protocols, namely, LEACH (Low-Energy Adaptive Clustering Hierarchy) and PEGASIS (Power Efficient GAthering in Sensor Information Systems). By combining these two basic routing techniques, we propose a new protocol which provides an increase in network lifetime compared to the existing basic protocols.

Salam, Mohammad Abdus↗

Performance Comparison of Wireless Sensor Network Standard Protocols in an Aerospace Environment: ISA100.11a and ZigBee

Wireless Sensor Networks (WSNs) can provide a substantial benefit in spacecraft systems, reducing launch weight and providing unprecedented flexibility by allowing instrumentation capabilities to grow and change over time. Achieving data transport reliability on par with that of wired systems, however, can prove extremely challenging in practice. Fortunately, much progress has been made in developing standard WSN radio protocols for applications from non-critical home automation to mission-critical industrial process control. The relative performances of candidate protocols must be compared in representative aerospace environments, however, to determine their suitability for spaceflight applications. In this paper, we will present the results of a rigorous laboratory analysis of the performance of two standards-based, low power, low data rate WSN protocols: ZigBee Pro and ISA100.11a. Both are based on IEEE 802.15.4 and augment that standard's specifications to build complete, multi-hop networking stacks. ZigBee Pro targets primarily the home and office automation markets, providing an ad-hoc protocol that is computationally lightweight and easy to implement in inexpensive system-on-a-chip components. As a result of this simplicity, however, ZigBee Pro can be susceptible to radio frequency (RF) interference. ISA100.11a, on the other hand, targets the industrial process control market, providing a robust, centrally-managed protocol capable of tolerating a significant amount of RF interference. To achieve these gains, a coordinated channel hopping mechanism is employed, which entails a greater computational complexity than ZigBee and requires more sophisticated and costly hardware. To guide future aerospace deployments, we must understand how well these standards relatively perform in analog environments under expected operating conditions. Specifically, we are interested in evaluating goodput -- application level throughput -- in a representative crewed environment in the presence of varying levels of 802.11g Wi-Fi traffic. To do so, we use the NASA Johnson Space Center Wireless Habitat Testbed (WHT), a metallic, habitation-sized module designed for co-existence testing of wireless systems. In its quiescent state, the sealed WHT provides an RF-quiet environment to which we can selectively add interfering systems; it also provides a realistic level of multi-path self-interference for systems under investigation. In our test, we deploy two representative five node networks, configured in a star topology with all nodes reporting directly to a WSN gateway. Each ZigBee network WSN node is built using a Texas Instruments (TI) CC2530 system-on-a-chip radio running TI's ZigBee Pro Z-stack. Each ISA100.11a network node is built using a Nivis VersaNode 210 system-on-a-chip radio. In both cases, radios interface with TI MSP430-F5438 microcontroller implementing a common test application. Interference is provided by a D-link 802.11g Wi-Fi router transporting traffic generated using the Iperf network testing tool. For the single-channel ZigBee network, effects of both direct and indirect Wi-Fi interference are evaluated. For the channel-hopping ISA100.11a network, effects of interference from multiple Wi-Fi routers configured in non-overlapping 802.11g channels are evaluated. Our results show that, in general, the more lightweight ZigBee network performs well at low interference levels, but performance degrades as interference increases. Conversely, the more complex and costly ISA100.11a network continues to perform well as Wi-Fi interference levels increase.

Wagner, Raymond S.↗

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

97 MATHEMATICS AND COMPUTING↗

Applications of Wireless Sensor Networks for Area Coverage in Microgrids

Area coverage is a critical issue which will have a major impact on the sensing quality over targeted regions in wireless sensor networks. This paper studies the area coverage problem (ACP) with non-penetrable obstacles in microgrids, where a sensor cannot be deployed or sensing signals cannot pass through. The target coverage region is discretized in a deployment map representation of non-penetrable obstacles. A probability detection model is utilized to represent sensors with a variable distance coverage. The ACP is formulated as a mixed integer nonlinear programming problem and an iterative process is developed to solve the problem. The microgrid at Illinois Institute of Technology (IL Tech) is used as a practical example. Both the normal and the N-1 contingency deployments of sensors are simulated for optimizing the ACP at the IL Tech microgrid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Web-Based Interface for Command and Control of Network Sensors

This software allows for the visualization and control of a network of sensors through a Web browser interface. It is currently being deployed for a network of sensors monitoring Mt. Saint Helen s volcano; however, this innovation is generic enough that it can be deployed for any type of sensor Web. From this interface, the user is able to fully control and monitor the sensor Web. This includes, but is not limited to, sending "test" commands to individual sensors in the network, monitoring for real-world events, and reacting to those events

Wallick, Michael N.↗

TCPL: A Defense against wormhole attacks in wireless sensor networks

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.

99 GENERAL AND MISCELLANEOUS↗

Wireless Sensor Networks for Improved Snow Water Equivalent and Runoff Estimates

We leverage the frontiers of the Internet of Things technology in a recently developed end-to-end wireless sensor network (WSN) system that samples, collects, stores, and displays mountain hydrology measurements in near real-time. At the core of the system lies an ultra-low power, radio channel-hoping, and self-organizing mesh that allows for remote autonomous sampling of snow. Such properties, combined with a rugged weather-sealed design of the devices and multi-level data replication, provides reliable real-time data at spatial and temporal scales previously impractical to achieve in mountain environments. The system was deployed at three 1 km 2 sites across the North Fork of the Feather River basin with a cluster of 12 sensor nodes for each location. Measurements show that existing operational autonomous systems are non-representative spatially, with biases that can reach up to 50%. A comparison between a wet and dry year showed that snow depths exhibit strong multi-scale inter-year spatial stationarity with major rank conservation. Temporally dense analysis using elastic net regression shows that dominant features at the sub-km 2 scale are site-dependent and differ from the watershed scale. Newly introduced explanatory variables, based on the nearest neighbor with a Landsat assimilated historical product, consistently explained up to 90% of the variance in the watershed-scale SWE for both years. At two WSN sites, lagged cross-correlation of snowmelt with stream flow measurements showed a significant improvement of up to 100% compared with existing systems, suggesting that WSNs can be instrumental in improving runoff forecasting and water management.

47 OTHER INSTRUMENTATION↗

Communication and Energy Efficiency in Visual Sensor Networks for People Localization

This paper addresses the communication and energy efficiency in collaborative visual sensor networks (VSNs) for people localization, a challenging computer vision problem of its own. We focus on the design of a light-weight and energy efficient solution where people are localized based on distributed camera nodes integrating the so-called certainty map generated at each node, that records the target non-existence information within the camera s field of view. We first present a dynamic itinerary for certainty map integration where not only each sensor node transmits a very limited amount of data but that a limited number of camera nodes is involved. Then, we perform a comprehensive analytical study to evaluate communication and energy efficiency between different integration schemes, i.e., centralized and distributed integration. Based on results obtained from analytical study and real experiments, the distributed method shows effectiveness in detection accuracy as well as energy and bandwidth efficiency.

Karakaya, Mahmut↗