2,419 research outputs found
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
RTXP : A Localized Real-Time Mac-Routing Protocol for Wireless Sensor Networks
Protocols developed during the last years for Wireless Sensor Networks (WSNs)
are mainly focused on energy efficiency and autonomous mechanisms (e.g.
self-organization, self-configuration, etc). Nevertheless, with new WSN
applications, appear new QoS requirements such as time constraints. Real-time
applications require the packets to be delivered before a known time bound
which depends on the application requirements. We particularly focus on
applications which consist in alarms sent to the sink node. We propose
Real-Time X-layer Protocol (RTXP), a real-time communication protocol. To the
best of our knowledge, RTXP is the first MAC and routing real-time
communication protocol that is not centralized, but instead relies only on
local information. The solution is cross-layer (X-layer) because it allows to
control the delays due to MAC and Routing layers interactions. RTXP uses a
suited hop-count-based Virtual Coordinate System which allows deterministic
medium access and forwarder selection. In this paper we describe the protocol
mechanisms. We give theoretical bound on the end-to-end delay and the capacity
of the protocol. Intensive simulation results confirm the theoretical
predictions and allow to compare with a real-time centralized solution. RTXP is
also simulated under harsh radio channel, in this case the radio link
introduces probabilistic behavior. Nevertheless, we show that RTXP it performs
better than a non-deterministic solution. It thus advocates for the usefulness
of designing real-time (deterministic) protocols even for highly unreliable
networks such as WSNs
Energy efficient data collection and dissemination protocols in self-organised wireless sensor networks
Wireless sensor networks (WSNs) are used for event detection and data collection in
a plethora of environmental monitoring applications. However a critical factor limits
the extension of WSNs into new application areas: energy constraints. This thesis
develops self-organising energy efficient data collection and dissemination protocols in
order to support WSNs in event detection and data collection and thus extend the use
of sensor-based networks to many new application areas.
Firstly, a Dual Prediction and Probabilistic Scheduler (DPPS) is developed. DPPS
uses a Dual Prediction Scheme combining compression and load balancing techniques
in order to manage sensor usage more efficiently. DPPS was tested and evaluated
through computer simulations and empirical experiments. Results showed that DPPS
reduces energy consumption in WSNs by up to 35% while simultaneously maintaining
data quality and satisfying a user specified accuracy constraint.
Secondly, an Adaptive Detection-driven Ad hoc Medium Access Control (ADAMAC)
protocol is developed. ADAMAC limits the Data Forwarding Interruption problem
which causes increased end-to-end delay and energy consumption in multi-hop sensor
networks. ADAMAC uses early warning alarms to dynamically adapt the sensing
intervals and communication periods of a sensor according to the likelihood of any
new events occurring. Results demonstrated that compared to previous protocols such
as SMAC, ADAMAC dramatically reduces end-to-end delay while still limiting energy
consumption during data collection and dissemination. The protocols developed in this thesis, DPPS and ADAMAC, effectively alleviate
the energy constraints associated with WSNs and will support the extension of sensorbased
networks to many more application areas than had hitherto been readily possible
Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications
Wireless sensor networks monitor dynamic environments that change rapidly
over time. This dynamic behavior is either caused by external factors or
initiated by the system designers themselves. To adapt to such conditions,
sensor networks often adopt machine learning techniques to eliminate the need
for unnecessary redesign. Machine learning also inspires many practical
solutions that maximize resource utilization and prolong the lifespan of the
network. In this paper, we present an extensive literature review over the
period 2002-2013 of machine learning methods that were used to address common
issues in wireless sensor networks (WSNs). The advantages and disadvantages of
each proposed algorithm are evaluated against the corresponding problem. We
also provide a comparative guide to aid WSN designers in developing suitable
machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial
- …