1,403 research outputs found
Operator calculus approach for route optimizing and enhancing wireless sensor network
Route optimization is one of important feature in wireless sensor networks in order to enhancing the life time of
WSNs. Since Centrality is one of the greatest challenges in computing and estimating the important node
metrics of a structural graph, it is necessary to calculate and determine the importance of a node in a network.
This paper proposes an alternative way to optimizing the route problems which is based on multi-constrained
optimal path (MCOP) and operator calculus approach. A novel routing protocol called Path Operator Calculus
Centrality (POCC) is proposed as a new method to determine the main path which contains high centrality
nodes in a wireless sensor network deployment. The estimation of centrality is using the operator calculus
approach based on network topology which provides optimal paths for each source node to base station. Some
constraints such as energy level and bit error rate (BER) of node are considered to define the path centrality in
this approach. The simulation evaluation shows improved performance in terms of energy consumption and
network lifetime
Statistical Delay Bound for WirelessHART Networks
In this paper we provide a performance analysis framework for wireless
industrial networks by deriving a service curve and a bound on the delay
violation probability. For this purpose we use the (min,x) stochastic network
calculus as well as a recently presented recursive formula for an end-to-end
delay bound of wireless heterogeneous networks. The derived results are mapped
to WirelessHART networks used in process automation and were validated via
simulations. In addition to WirelessHART, our results can be applied to any
wireless network whose physical layer conforms the IEEE 802.15.4 standard,
while its MAC protocol incorporates TDMA and channel hopping, like e.g.
ISA100.11a or TSCH-based networks. The provided delay analysis is especially
useful during the network design phase, offering further research potential
towards optimal routing and power management in QoS-constrained wireless
industrial networks.Comment: Accepted at PE-WASUN 201
Operator Calculus Algorithms for Multi-Constrained Paths
Classical approaches to multi-constrained routing problems generally require construction of trees and the use of heuristics to prevent combinatorial explosion. Introduced here is the notion of constrained path algebras and their application to multi-constrained path problems. The inherent combinatorial properties of these algebras make them useful for routing problems by implicitly pruning the underlying tree structures. Operator calculus (OC) methods are generalized to multiple non-additive constraints in order to develop algorithms for the multi constrained path problem and multi constrained optimization problem. Theoretical underpinnings are developed first, then algorithms are presented. These algorithms demonstrate the tremendous simplicity, flexibility and speed of the OC approach. Algorithms are implemented in Mathematica and Java and applied to a problem first proposed by Ben Slimane et al. as an example
Towards a System Theoretic Approach to Wireless Network Capacity in Finite Time and Space
In asymptotic regimes, both in time and space (network size), the derivation
of network capacity results is grossly simplified by brushing aside queueing
behavior in non-Jackson networks. This simplifying double-limit model, however,
lends itself to conservative numerical results in finite regimes. To properly
account for queueing behavior beyond a simple calculus based on average rates,
we advocate a system theoretic methodology for the capacity problem in finite
time and space regimes. This methodology also accounts for spatial correlations
arising in networks with CSMA/CA scheduling and it delivers rigorous
closed-form capacity results in terms of probability distributions. Unlike
numerous existing asymptotic results, subject to anecdotal practical concerns,
our transient one can be used in practical settings: for example, to compute
the time scales at which multi-hop routing is more advantageous than single-hop
routing
A Survey on IT-Techniques for a Dynamic Emergency Management in Large Infrastructures
This deliverable is a survey on the IT techniques that are relevant to the three use cases of the project EMILI. It describes the state-of-the-art in four complementary IT areas: Data cleansing, supervisory control and data acquisition, wireless sensor networks and complex event processing. Even though the deliverableās authors have tried to avoid a too technical language and have tried to explain every concept referred to, the deliverable might seem rather technical to readers so far little familiar with the techniques it describes
Spatial Whitening Framework for Distributed Estimation
Designing resource allocation strategies for power constrained sensor network
in the presence of correlated data often gives rise to intractable problem
formulations. In such situations, applying well-known strategies derived from
conditional-independence assumption may turn out to be fairly suboptimal. In
this paper, we address this issue by proposing an adjacency-based spatial
whitening scheme, where each sensor exchanges its observation with their
neighbors prior to encoding their own private information and transmitting it
to the fusion center. We comment on the computational limitations for obtaining
the optimal whitening transformation, and propose an iterative optimization
scheme to achieve the same for large networks. We demonstrate the efficacy of
the whitening framework by considering the example of bit-allocation for
distributed estimation.Comment: 4 pages, 2 figures, this paper has been presented at CAMSAP 2011;
Proc. 4th Intl. Workshop on Computational Advances in Multi-Sensor Adaptive
Processing (CAMSAP 2011), San Juan, Puerto Rico, Dec 13-16, 201
- ā¦