9,990 research outputs found
Distributed Wireless Networked H
A new approach to solving the distributed control problem for a class of discrete-time nonlinear systems via a wireless neural control network (WNCN) is presented in this paper. A unified Lurie-type model termed delayed standard neural network model (DSNNM) is used to describe these nonlinear systems. We assume that all neuron nodes in WNCN which have limited energy, storage space, and computing ability can be regarded as a subcontroller, then the whole WNCN is characterized by a mesh-like structure with partially connected neurons distributed over a wide geographical area, which can be considered as a fully distributed nonlinear output feedback dynamic controller. The unreliable wireless communication links within WNCN are modeled by fading channels. Based on the Lyapunov functional and the S-procedure, the WNCN is solved and configured for the DSNNM to absolutely stabilize the whole closed-loop system in the sense of mean square
with a H∞ disturbance attenuation index using LMI approach. A numerical example shows the effectiveness of the proposed design approaches
Adaptive Controller Placement for Wireless Sensor-Actuator Networks with Erasure Channels
Wireless sensor-actuator networks offer flexibility for control design. One
novel element which may arise in networks with multiple nodes is that the role
of some nodes does not need to be fixed. In particular, there is no need to
pre-allocate which nodes assume controller functions and which ones merely
relay data. We present a flexible architecture for networked control using
multiple nodes connected in series over analog erasure channels without
acknowledgments. The control architecture proposed adapts to changes in network
conditions, by allowing the role played by individual nodes to depend upon
transmission outcomes. We adopt stochastic models for transmission outcomes and
characterize the distribution of controller location and the covariance of
system states. Simulation results illustrate that the proposed architecture has
the potential to give better performance than limiting control calculations to
be carried out at a fixed node.Comment: 10 pages, 8 figures, to be published in Automatic
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
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling
Traditionally, routing in wireless sensor networks consists of
two steps: First, the routing protocol selects a next hop,
and, second, the MAC protocol waits for the intended destination
to wake up and receive the data. This design makes
it difficult to adapt to link dynamics and introduces delays
while waiting for the next hop to wake up.
In this paper we introduce ORW, a practical opportunistic
routing scheme for wireless sensor networks. In a dutycycled
setting, packets are addressed to sets of potential receivers
and forwarded by the neighbor that wakes up first
and successfully receives the packet. This reduces delay and
energy consumption by utilizing all neighbors as potential
forwarders. Furthermore, this increases resilience to wireless
link dynamics by exploiting spatial diversity. Our results
show that ORW reduces radio duty-cycles on average
by 50% (up to 90% on individual nodes) and delays by 30%
to 90% when compared to the state of the art
- …