Adaptive Duty Cycling MAC Protocols Using Closed-Loop Control for Wireless Sensor Networks

The fundamental design goal of wireless sensor MAC protocols is to minimize unnecessary power consumption of the sensor nodes, because of its stringent resource constraints and ultra-power limitation. In existing MAC protocols in wireless sensor networks (WSNs), duty cycling, in which each node periodically cycles between the active and sleep states, has been introduced to reduce unnecessary energy consumption. Existing MAC schemes, however, use a fixed duty cycling regardless of multi-hop communication and traffic fluctuations. On the other hand, there is a tradeoff between energy efficiency and delay caused by duty cycling mechanism in multi-hop communication and existing MAC approaches only tend to improve energy efficiency with sacrificing data delivery delay. In this paper, we propose two different MAC schemes (ADS-MAC and ELA-MAC) using closed-loop control in order to achieve both energy savings and minimal delay in wireless sensor networks. The two proposed MAC schemes, which are synchronous and asynchronous approaches, respectively, utilize an adaptive timer and a successive preload frame with closed-loop control for adaptive duty cycling. As a result, the analysis and the simulation results show that our schemes outperform existing schemes in terms of energy efficiency and delivery delay

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

Implementation of RTOS to the WSN node

Bezdrátové senzorické sieťe zväčša používajú `event-driven` operačné systémy. Táto práca diskutuje výhody nevýhody použitia RTOS v bezdrátových senzorických sieťach. Najvhodnejší RTOS je vybratý a sú podniknuté všetky kroky aby bolo možne demonštrovať schopnosť mikrokontrolérov Gecko od EnergyMicro prevádzkovať tento RTOS s nízkou spotrebou energie a demonštrovať jednoduchú bezdrátovú komunikáciu s Atmel AT86RF212 rádiami.Wireless sensors networks mostly use event-driven OSes. This works discusses pros and cons of using RTOS in wirless sensors networks. A most appropriate RTOS is chosen and all necessary steps are undergone to demonstrate EnergyMicro Gecko MCU's ability to run the RTOS with low energy consumption and demonstrate wireless simple communication with Atmel AT86RF212 radios.

Supporting Cyber-Physical Systems with Wireless Sensor Networks: An Outlook of Software and Services

Sensing, communication, computation and control technologies are the essential building blocks of a cyber-physical system (CPS). Wireless sensor networks (WSNs) are a way to support CPS as they provide fine-grained spatial-temporal sensing, communication and computation at a low premium of cost and power. In this article, we explore the fundamental concepts guiding the design and implementation of WSNs. We report the latest developments in WSN software and services for meeting existing requirements and newer demands; particularly in the areas of: operating system, simulator and emulator, programming abstraction, virtualization, IP-based communication and security, time and location, and network monitoring and management. We also reflect on the ongoing efforts in providing dependable assurances for WSN-driven CPS. Finally, we report on its applicability with a case-study on smart buildings

Efficient Time of Arrival Calculation for Acoustic Source Localization Using Wireless Sensor Networks

Acoustic source localization is a very useful tool in surveillance and tracking applications. Potential exists for ubiquitous presence of acoustic source localization systems. However, due to several significant challenges they are currently limited in their applications. Wireless Sensor Networks (WSN) offer a feasible solution that can allow for large, ever present acoustic localization systems. Some fundamental challenges remain. This thesis presents some ideas for helping solve the challenging problems faced by networked acoustic localization systems. We make use of a low-power WSN designed specifically for distributed acoustic source localization. Our ideas are based on three important observations. First, sounds emanating from a source will be free of reflections at the beginning of the sound. We make use of this observation by selectively processing only the initial parts of a sound to be localized. Second, the significant features of a sound are more robust to various interference sources. We perform key feature recognition such as the locations of significant zero crossings and local peaks. Third, these features which are compressed descriptors, can also be used for distributed pattern matching. For this we perform basic pattern analysis by comparing sampled signals from various nodes in order to determine better Time Of Arrivals (TOA). Our implementation tests these ideas in a predictable test environment. A complete system for general sounds is left for future wor

Efficient Time of Arrival Calculation for Acoustic Source Localization Using Wireless Sensor Networks

Acoustic source localization is a very useful tool in surveillance and tracking applications. Potential exists for ubiquitous presence of acoustic source localization systems. However, due to several significant challenges they are currently limited in their applications. Wireless Sensor Networks (WSN) offer a feasible solution that can allow for large, ever present acoustic localization systems. Some fundamental challenges remain. This thesis presents some ideas for helping solve the challenging problems faced by networked acoustic localization systems. We make use of a low-power WSN designed specifically for distributed acoustic source localization. Our ideas are based on three important observations. First, sounds emanating from a source will be free of reflections at the beginning of the sound. We make use of this observation by selectively processing only the initial parts of a sound to be localized. Second, the significant features of a sound are more robust to various interference sources. We perform key feature recognition such as the locations of significant zero crossings and local peaks. Third, these features which are compressed descriptors, can also be used for distributed pattern matching. For this we perform basic pattern analysis by comparing sampled signals from various nodes in order to determine better Time Of Arrivals (TOA). Our implementation tests these ideas in a predictable test environment. A complete system for general sounds is left for future wor

Randomized and efficient time synchronization in dynamic wireless sensor networks: a gossip-consensus-based approach

This paper proposes novel randomized gossip-consensus-based sync (RGCS) algorithms to realize efficient time correction in dynamic wireless sensor networks (WSNs). First, the unreliable links are described by stochastic connections, reflecting the characteristic of changing connectivity gleaned from dynamicWSNs. Secondly, based on the mutual drift estimation, each pair of activated nodes fully adjusts clock rate and offset to achieve network-wide time synchronization by drawing upon the gossip consensus approach. The converge-to-max criterion is introduced to achieve a much faster convergence speed. The theoretical results on the probabilistic synchronization performance of the RGCS are presented. Thirdly, a Revised-RGCS is developed to counteract the negative impact of bounded delays, because the uncertain delays are always present in practice and would lead to a large deterioration of algorithm performances. Finally, extensive simulations are performed on the MATLAB and OMNeT++ platform for performance evaluation. Simulation results demonstrate that the proposed algorithms are not only efficient for synchronization issues required for dynamic topology changes but also give a better performance in term of converging speed, collision rate, and the robustness of resisting delay, and outperform other existing protocols

Efficient Time of Arrival Calculation for Acoustic Source Localization Using Wireless Sensor Networks

Acoustic source localization is a very useful tool in surveillance and tracking applications. Potential exists for ubiquitous presence of acoustic source localization systems. However, due to several significant challenges they are currently limited in their applications. Wireless Sensor Networks (WSN) offer a feasible solution that can allow for large, ever present acoustic localization systems. Some fundamental challenges remain. This thesis presents some ideas for helping solve the challenging problems faced by networked acoustic localization systems. We make use of a low-power WSN designed specifically for distributed acoustic source localization. Our ideas are based on three important observations. First, sounds emanating from a source will be free of reflections at the beginning of the sound. We make use of this observation by selectively processing only the initial parts of a sound to be localized. Second, the significant features of a sound are more robust to various interference sources. We perform key feature recognition such as the locations of significant zero crossings and local peaks. Third, these features which are compressed descriptors, can also be used for distributed pattern matching. For this we perform basic pattern analysis by comparing sampled signals from various nodes in order to determine better Time Of Arrivals (TOA). Our implementation tests these ideas in a predictable test environment. A complete system for general sounds is left for future wor