385 research outputs found
A Physical Estimation based Continuous Monitoring Scheme for Wireless Sensor Networks
Data estimation is emerging as a powerful strategy for energy conservation in sensor networks. In this thesis is reported a technique, called Data Estimation using Physical Method (DEPM), that efficiently conserves battery power in an environment that may take a variety of complex manifestations in real situations. The methodology can be ported easily with minor changes to address a multitude of tasks by altering the parameters of the algorithm and ported on any platform. The technique aims at conserving energy in the limited energy supply source that runs a sensor network by enabling a large number of sensors to go to sleep and having a minimal set of active sensors that may gather data and communicate the same to a base station. DEPM rests on solving a set of linear inhomogeneous algebraic equations which are set up using well-established physical laws. The present technique is powerful enough to yield data estimation at an arbitrary number of point-locations, and provides for easy experimental verification of the estimated data by using only a few extra sensors
Connectivity of confined 3D Networks with Anisotropically Radiating Nodes
Nodes in ad hoc networks with randomly oriented directional antenna patterns
typically have fewer short links and more long links which can bridge together
otherwise isolated subnetworks. This network feature is known to improve
overall connectivity in 2D random networks operating at low channel path loss.
To this end, we advance recently established results to obtain analytic
expressions for the mean degree of 3D networks for simple but practical
anisotropic gain profiles, including those of patch, dipole and end-fire array
antennas. Our analysis reveals that for homogeneous systems (i.e. neglecting
boundary effects) directional radiation patterns are superior to the isotropic
case only when the path loss exponent is less than the spatial dimension.
Moreover, we establish that ad hoc networks utilizing directional transmit and
isotropic receive antennas (or vice versa) are always sub-optimally connected
regardless of the environment path loss. We extend our analysis to investigate
boundary effects in inhomogeneous systems, and study the geometrical reasons
why directional radiating nodes are at a disadvantage to isotropic ones.
Finally, we discuss multi-directional gain patterns consisting of many equally
spaced lobes which could be used to mitigate boundary effects and improve
overall network connectivity.Comment: 12 pages, 10 figure
Amorphous Placement and Informed Diffusion for Timely Monitoring by Autonomous, Resource-Constrained, Mobile Sensors
Personal communication devices are increasingly equipped with sensors for passive monitoring of encounters and surroundings. We envision the emergence of services that enable a community of mobile users carrying such resource-limited devices to query such information at remote locations in the ļ¬eld in which they collectively roam. One approach to implement such a service is directed placement and retrieval (DPR), whereby readings/queries about a specific location are routed to a node responsible for that location. In a mobile, potentially sparse setting, where end-to-end paths are unavailable, DPR is not an attractive solution as it would require the use of delay-tolerant (flooding-based store-carry-forward) routing of both readings and queries, which is inappropriate for applications with data freshness constraints, and which is incompatible with stringent device power/memory constraints. Alternatively, we propose the use of amorphous placement and retrieval (APR), in which routing and ļ¬eld monitoring are integrated through the use of a cache management scheme coupled with an informed exchange of cached samples to diffuse sensory data throughout the network, in such a way that a query answer is likely to be found close to the query origin. We argue that knowledge of the distribution of query targets could be used effectively by an informed cache management policy to maximize the utility of collective storage of all devices. Using a simple analytical model, we show that the use of informed cache management is particularly important when the mobility model results in a non-uniform distribution of users over the ļ¬eld. We present results from extensive simulations which show that in sparsely-connected networks, APR is more cost-effective than DPR, that it provides extra resilience to node failure and packet losses, and that its use of informed cache management yields superior performance
Future scenarios of parallel computing: Distributed sensor networks
Over the past few years, motivated by the accelerating technological convergence of sensing, computing and communications, there has been a growing interest in potential and technological challenges of Wireless Sensor Network. This paper will introduce a wide range of current basic research lines dealing with ad hoc networks of spatially distributed systems, data rate requirements and constraints, real-time fusion and registration of data from distributed sensors, cooperative control, hypothesis generation, and network consensus filtering. This technical domain has matured to the point where a number of industrial products and systems have appeared. The presentation will also describe the state of the art regarding current and soon-to-appear applications
An effective data-collection scheme with AUV path planning in underwater wireless sensor networks
Data collection in underwater wireless sensor networks (UWSNs) using autonomous underwater vehicles (AUVs) is a more robust solution than traditional approaches, instead of transmitting data from each node to a destination node. However, the design of delay-aware and energy-efficient path planning for AUVs is one of the most crucial problems in collecting data for UWSNs. To reduce network delay and increase network lifetime, we proposed a novel reliable AUV-based data-collection routing protocol for UWSNs. The proposed protocol employs a route planning mechanism to collect data using AUVs. The sink node directs AUVs for data collection from sensor nodes to reduce energy consumption. First, sensor nodes are organized into clusters for better scalability, and then, these clusters are arranged into groups to assign an AUV to each group. Second, the traveling path for each AUV is crafted based on the Markov decision process (MDP) for the reliable collection of data. The simulation results affirm the effectiveness and efficiency of the proposed technique in terms of throughput, energy efficiency, delay, and reliability. Ā© 2022 Wahab Khan et al
ICELUS: Investigating strategy switching for throughput maximization to a mobile sink
Wireless sensor networks offer a pragmatic solution for monitoring in a variety of scenarios. For efficient and practical data gathering, especially in large-scale systems deployed in inaccessible areas, unmanned vehicles are becoming a compelling solution. The added infrastructure flexibility comes at the cost of limited contact time between the mobile entity and the stationary devices. The channel fading caused by mobility further decreases the data yield.We address this challenge by analysing the relevant classes of data transfer schemes and identifying adaptation conditions that enable the selection of the best fitting strategy. The result of this analysis, ICELUS, provides an integrated protocol that exploits the available communication resources. Ā© 2016 IFIP
A survey on gas leakage source detection and boundary tracking with wireless sensor networks
Gas leakage source detection and boundary tracking of continuous objects have received a significant research attention in the academic as well as the industries due to the loss and damage caused by toxic gas leakage in large-scale petrochemical plants. With the advance and rapid adoption of wireless sensor networks (WSNs) in the last decades, source localization and boundary estimation have became the priority of research works. In addition, an accurate boundary estimation is a critical issue due to the fast movement, changing shape, and invisibility of the gas leakage compared with the other single object detections. We present various gas diffusion models used in the literature that offer the effective computational approaches to measure the gas concentrations in the large area. In this paper, we compare the continuous object localization and boundary detection schemes with respect to complexity, energy consumption, and estimation accuracy. Moreover, this paper presents the research directions for existing and future gas leakage source localization and boundary estimation schemes with WSNs
Control and optimization approaches for energy-limited systems: applications to wireless sensor networks and battery-powered vehicles
This dissertation studies control and optimization approaches to obtain energy-efficient and reliable routing schemes for battery-powered systems in network settings.
First, incorporating a non-ideal battery model, the lifetime maximization problem for static wireless sensor networks is investigated. Adopting an optimal control approach, it is shown that there exists a time-invariant optimal routing vector in a fixed topology network. Furthermore, under very mild conditions, this optimal policy is robust with respect to the battery model used. Then, the lifetime maximization problem is investigated for networks with a mobile source node. Redefining the network lifetime, two versions of the problem are studied: when there exist no prior knowledge about the source nodeās motion dynamics vs. when source nodeās trajectory is known in advance. For both cases, problems are formulated in the optimal control framework. For the former, the solution can be reduced to a sequence of nonlinear programming problems solved on line as the source node trajectory evolves. For the latter, an explicit off-line numerical solution is required.
Second, the problem of routing for vehicles with limited energy through a network
with inhomogeneous charging nodes is studied. The goal is to minimize the total elapsed time, including traveling and recharging time, for vehicles to reach their destinations. Adopting a game-theoretic approach, the problem is investigated from two different points of view: user-centric vs. system-centric. The former is first formulated as a mixed integer nonlinear programming problem. Then, by exploiting properties of an optimal solution, it is reduced to a lower dimensionality problem. For the latter, grouping vehicles into subflows and including the traffic congestion effects, a system-wide optimization problem is defined. Both problems are studied in a dynamic programming framework as well.
Finally, the thesis quantifies the Price Of Anarchy (POA) in transportation net- works using actual traffic data. The goal is to compare the network performance under user-optimal vs. system-optimal policies. First, user equilibria flows and origin- destination demands are estimated for the Eastern Massachusetts transportation net- work using speed and capacity datasets. Then, obtaining socially-optimal flows by solving a system-centric problem, the POA is estimated
- ā¦