Energy Consumption Of Visual Sensor Networks: Impact Of Spatio-Temporal Coverage

Wireless visual sensor networks (VSNs) are expected to play a major role in future IEEE 802.15.4 personal area networks (PAN) under recently-established collision-free medium access control (MAC) protocols, such as the IEEE 802.15.4e-2012 MAC. In such environments, the VSN energy consumption is affected by the number of camera sensors deployed (spatial coverage), as well as the number of captured video frames out of which each node processes and transmits data (temporal coverage). In this paper, we explore this aspect for uniformly-formed VSNs, i.e., networks comprising identical wireless visual sensor nodes connected to a collection node via a balanced cluster-tree topology, with each node producing independent identically-distributed bitstream sizes after processing the video frames captured within each network activation interval. We derive analytic results for the energy-optimal spatio-temporal coverage parameters of such VSNs under a-priori known bounds for the number of frames to process per sensor and the number of nodes to deploy within each tier of the VSN. Our results are parametric to the probability density function characterizing the bitstream size produced by each node and the energy consumption rates of the system of interest. Experimental results reveal that our analytic results are always within 7% of the energy consumption measurements for a wide range of settings. In addition, results obtained via a multimedia subsystem show that the optimal spatio-temporal settings derived by the proposed framework allow for substantial reduction of energy consumption in comparison to ad-hoc settings. As such, our analytic modeling is useful for early-stage studies of possible VSN deployments under collision-free MAC protocols prior to costly and time-consuming experiments in the field.Comment: to appear in IEEE Transactions on Circuits and Systems for Video Technology, 201

Fast Desynchronization For Decentralized Multichannel Medium Access Control

Distributed desynchronization algorithms are key to wireless sensor networks as they allow for medium access control in a decentralized manner. In this paper, we view desynchronization primitives as iterative methods that solve optimization problems. In particular, by formalizing a well established desynchronization algorithm as a gradient descent method, we establish novel upper bounds on the number of iterations required to reach convergence. Moreover, by using Nesterov's accelerated gradient method, we propose a novel desynchronization primitive that provides for faster convergence to the steady state. Importantly, we propose a novel algorithm that leads to decentralized time-synchronous multichannel TDMA coordination by formulating this task as an optimization problem. Our simulations and experiments on a densely-connected IEEE 802.15.4-based wireless sensor network demonstrate that our scheme provides for faster convergence to the steady state, robustness to hidden nodes, higher network throughput and comparable power dissipation with respect to the recently standardized IEEE 802.15.4e-2012 time-synchronized channel hopping (TSCH) scheme.Comment: to appear in IEEE Transactions on Communication

Study of Techniques For Reliable Data Transmission In Wireless Sensor Networks

This thesis addresses the problem of traffic transfer in wireless sensor networks (WSN). In such networks, the foremost challenge in the design of data communication techniques is that the sensor's transceiver circuitry consumes the major portion of the available power. Thus, due to stringent limitations on the nodes' hardware and power resources in WSN, data transmission must be power-efficient in order to reduce the nodes' power consumption, and hence to maximize the network lifetime while satisfying the required data rate. The transmit power is itself under the influence of data rate and source-destination distance. Thanks to the dense deployment of nodes in WSN, multi-hop communication can be applied to mitigate the transmit power for sending bits of information, i.e., gathered data by the sensor nodes to the destination node (gateway) compared to single-hop scenarios. In our approach, we achieve a reasonable trade-off between power-efficiency and transmission data rate by devising cooperative communication strategies through which the network traffic (i.e. nodes' gathered information) is relayed hop-by-hop to the gateway. In such strategies, the sensor nodes serve as data originator as well as data router, and assist the data transfer from the sensors to the gateway. We develop several data transmission schemes, and we prove their capability in transmitting the data from the sensor nodes at the highest possible rates allowed by the network limitations. In particular, we consider that (i) network has linear or quasi-linear topology, (ii) nodes are equipped with half-duplex radios, implying that they cannot transmit and receive simultaneously, (iii) nodes transmit their traffic at the same average rate. We compute the average data rate corresponding to each proposed strategy. Next, we take an information-theoretic approach and derive an upper bound to the achievable rate of traffic transfer in the networks under consideration, and analyze its tightness. We show that our proposed strategies outperform the conventional multi-hop scheme, and their average achievable rate approaches the upper bound at low levels of signal to noise ratio

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

On Optimal Neighbor Discovery

Mobile devices apply neighbor discovery (ND) protocols to wirelessly initiate a first contact within the shortest possible amount of time and with minimal energy consumption. For this purpose, over the last decade, a vast number of ND protocols have been proposed, which have progressively reduced the relation between the time within which discovery is guaranteed and the energy consumption. In spite of the simplicity of the problem statement, even after more than 10 years of research on this specific topic, new solutions are still proposed even today. Despite the large number of known ND protocols, given an energy budget, what is the best achievable latency still remains unclear. This paper addresses this question and for the first time presents safe and tight, duty-cycle-dependent bounds on the worst-case discovery latency that no ND protocol can beat. Surprisingly, several existing protocols are indeed optimal, which has not been known until now. We conclude that there is no further potential to improve the relation between latency and duty-cycle, but future ND protocols can improve their robustness against beacon collisions.Comment: Conference of the ACM Special Interest Group on Data Communication (ACM SIGCOMM), 201

RF-Powered Cognitive Radio Networks: Technical Challenges and Limitations

The increasing demand for spectral and energy efficient communication networks has spurred a great interest in energy harvesting (EH) cognitive radio networks (CRNs). Such a revolutionary technology represents a paradigm shift in the development of wireless networks, as it can simultaneously enable the efficient use of the available spectrum and the exploitation of radio frequency (RF) energy in order to reduce the reliance on traditional energy sources. This is mainly triggered by the recent advancements in microelectronics that puts forward RF energy harvesting as a plausible technique in the near future. On the other hand, it is suggested that the operation of a network relying on harvested energy needs to be redesigned to allow the network to reliably function in the long term. To this end, the aim of this survey paper is to provide a comprehensive overview of the recent development and the challenges regarding the operation of CRNs powered by RF energy. In addition, the potential open issues that might be considered for the future research are also discussed in this paper.Comment: 8 pages, 2 figures, 1 table, Accepted in IEEE Communications Magazin