336 research outputs found
Pheromone-based In-Network Processing for wireless sensor network monitoring systems
Monitoring spatio-temporal continuous fields using wireless sensor networks (WSNs) has emerged as a novel solution. An efficient data-driven routing mechanism for sensor querying and information gathering in large-scale WSNs is a challenging problem. In particular, we consider the case of how to query the sensor network information with the minimum energy cost in scenarios where a small subset of sensor nodes has relevant readings. In order to deal with this problem, we propose a Pheromone-based In-Network Processing (PhINP) mechanism. The proposal takes advantages of both a pheromone-based iterative strategy to direct queries towards nodes with relevant information and query- and response-based in-network filtering to reduce the number of active nodes. Additionally, we apply reinforcement learning to improve the performance. The main contribution of this work is the proposal of a simple and efficient mechanism for information discovery and gathering. It can reduce the messages exchanged in the network, by allowing some error, in order to maximize the network lifetime. We demonstrate by extensive simulations that using PhINP mechanism the query dissemination cost can be reduced by approximately 60% over flooding, with an error below 1%, applying the same in-network filtering strategy.Fil: Riva, Guillermo Gaston. Universidad Nacional de CĂłrdoba. Facultad de Ciencias Exactas, FĂsicas y Naturales; Argentina. Universidad TecnolĂłgica Nacional; Argentina. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas. Centro CientĂfico TecnolĂłgico Conicet - CĂłrdoba; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas. Centro CientĂfico TecnolĂłgico Conicet - CĂłrdoba. Instituto de Estudios Avanzados en IngenierĂa y TecnologĂa. Universidad Nacional de CĂłrdoba. Facultad de Ciencias Exactas FĂsicas y Naturales. Instituto de Estudios Avanzados en IngenierĂa y TecnologĂa; Argentin
Homology-based Distributed Coverage Hole Detection in Wireless Sensor Networks
Homology theory provides new and powerful solutions to address the coverage
problems in wireless sensor networks (WSNs). They are based on algebraic
objects, such as Cech complex and Rips complex. Cech complex gives accurate
information about coverage quality but requires a precise knowledge of the
relative locations of nodes. This assumption is rather strong and hard to
implement in practical deployments. Rips complex provides an approximation of
Cech complex. It is easier to build and does not require any knowledge of nodes
location. This simplicity is at the expense of accuracy. Rips complex can not
always detect all coverage holes. It is then necessary to evaluate its
accuracy. This work proposes to use the proportion of the area of undiscovered
coverage holes as performance criteria. Investigations show that it depends on
the ratio between communication and sensing radii of a sensor. Closed-form
expressions for lower and upper bounds of the accuracy are also derived. For
those coverage holes which can be discovered by Rips complex, a homology-based
distributed algorithm is proposed to detect them. Simulation results are
consistent with the proposed analytical lower bound, with a maximum difference
of 0.5%. Upper bound performance depends on the ratio of communication and
sensing radii. Simulations also show that the algorithm can localize about 99%
coverage holes in about 99% cases
Delaunay Triangulation as a New Coverage Measurement Method in Wireless Sensor Network
Sensing and communication coverage are among the most important trade-offs in Wireless Sensor Network (WSN) design. A minimum bound of sensing coverage is vital in scheduling, target tracking and redeployment phases, as well as providing communication coverage. Some methods measure the coverage as a percentage value, but detailed information has been missing. Two scenarios with equal coverage percentage may not have the same Quality of Coverage (QoC). In this paper, we propose a new coverage measurement method using Delaunay Triangulation (DT). This can provide the value for all coverage measurement tools. Moreover, it categorizes sensors as âfatâ, âhealthyâ or âthinâ to show the dense, optimal and scattered areas. It can also yield the largest empty area of sensors in the field. Simulation results show that the proposed DT method can achieve accurate coverage information, and provides many tools to compare QoC between different scenarios
An analytic Study of the Key Factors Influencing the Design and Routing Techniques of a Wireless Sensor Network
A wireless sensor network contains various nodes having certain sensing, processing & communication capabilities. Actually they are multifunctional battery operated nodes called motes. These motes are small in size & battery constrained. They are operated by a power source. A wireless sensor network consists of a huge number of tiny sensor nodes which are deployed either randomly or according to some predefined distribution. The sensors nodes in a sensor network are cooperative among themselves having self-organizing ability. This ensures that a wireless network serves a wide variety of applications. Few of them are weather monitoring, health, security & military etc. As their applications are wide, this requires that sensors in a sensor network must play their role very efficiently. But, as discussed above, the sensor nodes have energy limitation. This limitation leads failure of nodes after certain round of communication. So, a sensor network suffers with sensors having energy limitations. Beside this, sensor nodes in a sensor network must fulfill connectivity & coverage requirements. In this paper, we have discussed various issues affecting the design of a wireless sensor network. This provides the readers various research issues in designing a wireless sensor network
A Search Strategy of Level-Based Flooding for the Internet of Things
This paper deals with the query problem in the Internet of Things (IoT).
Flooding is an important query strategy. However, original flooding is prone to
cause heavy network loads. To address this problem, we propose a variant of
flooding, called Level-Based Flooding (LBF). With LBF, the whole network is
divided into several levels according to the distances (i.e., hops) between the
sensor nodes and the sink node. The sink node knows the level information of
each node. Query packets are broadcast in the network according to the levels
of nodes. Upon receiving a query packet, sensor nodes decide how to process it
according to the percentage of neighbors that have processed it. When the
target node receives the query packet, it sends its data back to the sink node
via random walk. We show by extensive simulations that the performance of LBF
in terms of cost and latency is much better than that of original flooding, and
LBF can be used in IoT of different scales
EdgeSense: Edge-Mediated Spatial-Temporal Crowdsensing
Edge computing recently is increasingly popular due to the growth of data size and the need of sensing with the reduced center. Based on Edge computing architecture, we propose a novel crowdsensing framework called Edge-Mediated Spatial-Temporal Crowdsensing. This algorithm targets on receiving the environment information such as air pollution, temperature, and traffic flow in some parts of the goal area, and does not aggregate sensor data with its location information. Specifically, EdgeSense works on top of a secured peer-To-peer network consisted of participants and propose a novel Decentralized Spatial-Temporal Crowdsensing framework based on Parallelized Stochastic Gradient Descent. To approximate the sensing data in each part of the target area in each sensing cycle, EdgeSense uses the local sensor data in participants\u27 mobile devices to learn the low-rank characteristic and then recovers the sensing data from it. We evaluate the EdgeSense on the real-world data sets (temperature [1] and PM2.5 [2] data sets), where our algorithm can achieve low error in approximation and also can compete with the baseline algorithm which is designed using centralized and aggregated mechanism
Distributed estimation over a low-cost sensor network: a review of state-of-the-art
Proliferation of low-cost, lightweight, and power efficient sensors and advances in networked systems enable the employment of multiple sensors. Distributed estimation provides a scalable and fault-robust fusion framework with a peer-to-peer communication architecture. For this reason, there seems to be a real need for a critical review of existing and, more importantly, recent advances in the domain of distributed estimation over a low-cost sensor network. This paper presents a comprehensive review of the state-of-the-art solutions in this research area, exploring their characteristics, advantages, and challenging issues. Additionally, several open problems and future avenues of research are highlighted
Exploring Cross-Layer Dependencies in Congested Wireless Ad Hoc Networks
Steen, M.R. van [Promotor]Voulgaris, S. [Copromotor
- âŠ