Two timescale convergent Q-learning for sleep-scheduling in wireless sensor networks

In this paper, we consider an intrusion detection application for Wireless Sensor Networks. We study the problem of scheduling the sleep times of the individual sensors, where the objective is to maximize the network lifetime while keeping the tracking error to a minimum. We formulate this problem as a partially-observable Markov decision process (POMDP) with continuous stateaction spaces, in a manner similar to Fuemmeler and Veeravalli (IEEE Trans Signal Process 56(5), 2091-2101, 2008). However, unlike their formulation, we consider infinite horizon discounted and average cost objectives as performance criteria. For each criterion, we propose a convergent on-policy Q-learning algorithm that operates on two timescales, while employing function approximation. Feature-based representations and function approximation is necessary to handle the curse of dimensionality associated with the underlying POMDP. Our proposed algorithm incorporates a policy gradient update using a one-simulation simultaneous perturbation stochastic approximation estimate on the faster timescale, while the Q-value parameter (arising from a linear function approximation architecture for the Q-values) is updated in an on-policy temporal difference algorithm-like fashion on the slower timescale. The feature selection scheme employed in each of our algorithms manages the energy and tracking components in a manner that assists the search for the optimal sleep-scheduling policy. For the sake of comparison, in both discounted and average settings, we also develop a function approximation analogue of the Q-learning algorithm. This algorithm, unlike the two-timescale variant, does not possess theoretical convergence guarantees. Finally, we also adapt our algorithms to include a stochastic iterative estimation scheme for the intruder's mobility model and this is useful in settings where the latter is not known. Our simulation results on a synthetic 2-dimensional network setting suggest that our algorithms result in better tracking accuracy at the cost of only a few additional sensors, in comparison to a recent prior work.

Fabrication and Experimentation of a Cantilever Beam Based Piezoelectric Actuator and Sensor for Vibration Energy Harvesting

In the immediate surroundings of our daily life, we can find a lot of places where the energy in the form of vibration is being wasted. Therefore, we have enormous opportunities to utilize the same. Piezoelectric character of matter enables us to convert this mechanical vibration energy into electrical energy which can be stored and used to power other device, instead of being wasted. This work is done to realize both actuator and sensor in a cantilever beam based on piezoelectricity. The sensor part is called vibration energy harvester. The numerical analyses were performed for the cantilever beam using the commercial package ANSYS and MATLAB. The cantilever beam is realized by taking a plate and fixing its one end between two massive plates. Two PZT patches were glued to the beam on its two faces. Experiments were performed using data acquisition system (DAQ) and LABVIEW software for actuating and sensing the vibration of the cantilever beam.

A model for the classification and survey of clock synchronization protocols in WSNs

Clock synchronization in wireless sensor networks (WSNs) assures that sensor nodes have the same reference clock time. This is necessary not only for various WSN applications but also for many system level protocols for WSNs such as MAC protocols, and protocols for sleep scheduling of sensor nodes. Clock value of a node at a particular instant of time depends on its initial value and the frequency of the crystal oscillator used in the sensor node. The frequency of the crystal oscillator varies from node to node, and may also change over time depending upon many factors like temperature, humidity, etc. As a result, clock values of different sensor nodes diverge from each other and also from the real time clock, and hence, there is a requirement for clock synchronization in WSNs. Consequently, many clock synchronization protocols for WSNs have been proposed in the recent past. These protocols differ from each other considerably, and so, there is a need to understand them using a common platform. Towards this goal, this survey paper categorizes the features of clock synchronization protocols for WSNs into three types, viz, structural features, technical features, and global objective features. Each of these categories has different options to further segregate the features for better understanding. The features of clock synchronization protocols that have been used in this survey include all the features which have been used in existing surveys as well as new features such as how the clock value is propagated, when the clock value is propagated, and when the physical clock is updated, which are required for better understanding of the clock synchronization protocols in WSNs in a systematic way. This paper also gives a brief description of a few basic clock synchronization protocols for WSNs, and shows how these protocols fit into the above classification criteria. In addition, the recent clock synchronization protocols for WSNs, which are based on the above basic clock synchronization protocols, are also given alongside the corresponding basic clock synchronization protocols. Indeed, the proposed model for characterizing the clock synchronization protocols in WSNs can be used not only for analyzing the existing protocols but also for designing new clock synchronization protocols. (C) 2014 Elsevier B.V. All rights reserved.

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known as spatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.

An Implementation of Partitioned Scheduling Scheme for Hard Real-Time Tasks in Multicore Linux with Fair Share for Linux Tasks

The correctness of a hard real-time system depends its ability to meet all its deadlines. Existing real-time systems use either a pure real-time scheduler or a real-time scheduler embedded as a real-time scheduling class in the scheduler of an operating system (OS). Existing implementations of schedulers in multicore systems that support real-time and non-real-time tasks, permit the execution of non-real-time tasks in all the cores with priorities lower than those of real-time tasks, but interrupts and softirqs associated with these non-real-time tasks can execute in any core with priorities higher than those of real-time tasks. As a result, the execution overhead of real-time tasks is quite large in these systems, which, in turn, affects their runtime. In order that the hard real-time tasks can be executed in such systems with minimal interference from other Linux tasks, we propose, in this paper, an integrated scheduler architecture, called SchedISA, which aims to considerably reduce the execution overhead of real-time tasks in these systems. In order to test the efficacy of the proposed scheduler, we implemented partitioned earliest deadline first (P-EDF) scheduling algorithm in SchedISA on Linux kernel, version 3.8, and conducted experiments on Intel core i7 processor with eight logical cores. We compared the execution overhead of real-time tasks in the above implementation of SchedISA with that in SCHED_DEADLINE's P-EDF implementation, which concurrently executes real-time and non-real-time tasks in Linux OS in all the cores. The experimental results show that the execution overhead of real-time tasks in the above implementation of SchedISA is considerably less than that in SCHED_DEADLINE. We believe that, with further refinement of SchedISA, the execution overhead of real-time tasks in SchedISA can be reduced to a predictable maximum, making it suitable for scheduling hard real-time tasks without affecting the CPU share of Linux tasks.

Nonlinear Optical Properties and Temperature-Dependent UV-Vis Absorption and Photoluminescence Emission in 2D Hexagonal Boron Nitride Nanosheets

Recently, a lot of interest has been centred on the optical properties of hexagonal boron nitride (h-BN), which has a similar lattice structure to graphene. Interestingly, h-BN has a wide bandgap and is biocompatible, so it has potential applications in multiphoton bioimaging, if it can exhibit large nonlinear optical (NLO) properties. However, extensive investigation into the NLO properties of h-BN have not been done so far. Here, NLO properties of 2D h-BN nanosheets (BNNS) are reported for the first time, using 1064-nm NIR laser radiation with a pulse duration of 10 ns using the Z-scan technique. The reverse saturable absorption occurs in aqueous colloidal solutions of BNNS with a very large two-photon absorption cross section (sigma(2PA)) of approximate to 57 x 10(-46) cm(4) s(-1) photon(-1). Also, by using UV-Vis absorption spectroscopy, the temperature coefficient of the bandgap (dE(g)/dT) of BNNS is determined to be 5.9 meV K-1. Further defect-induced photoluminescence emission in the UV region is obtained in the 283-303 K temperature range, under excitations of different wavelengths. The present report of large sigma(2PA) combined with stability and biocompatibility could open up new possibilities for the application of BNNS as a potential optical material for multiphoton bioimaging and advanced photonic devices.

Performance of New Dynamic Benefit-Weighted Scheduling Scheme in DiffServ Networks

In this paper, we design a new dynamic packet scheduling scheme suitable for differentiated service (DiffServ) network. Designed dynamic benefit weighted scheduling (DBWS) uses a dynamic weighted computation scheme loosely based on weighted round robin (WRR) policy. It predicts the weight required by expedited forwarding (EF) service for the current time slot (t) based on two criteria; (i) previous weight allocated to it at time (t-1), and (ii) the average increase in the queue length of EF buffer. This prediction provides smooth bandwidth allocation to all the services by avoiding overbooking of resources for EF service and still providing guaranteed services for it. The performance is analyzed for various scenarios at high, medium and low traffic conditions. The results show that packet loss is minimized, end to end delay is minimized and jitter is reduced and therefore meet quality of service (QoS) requirement of a network.

PLAStiCC: Predictive Look-Ahead Scheduling for Continuous dataflows on Clouds

Scalable stream processing and continuous dataflow systems are gaining traction with the rise of big data due to the need for processing high velocity data in near real time. Unlike batch processing systems such as MapReduce and workflows, static scheduling strategies fall short for continuous dataflows due to the variations in the input data rates and the need for sustained throughput. The elastic resource provisioning of cloud infrastructure is valuable to meet the changing resource needs of such continuous applications. However, multi-tenant cloud resources introduce yet another dimension of performance variability that impacts the application's throughput. In this paper we propose PLAStiCC, an adaptive scheduling algorithm that balances resource cost and application throughput using a prediction-based lookahead approach. It not only addresses variations in the input data rates but also the underlying cloud infrastructure. In addition, we also propose several simpler static scheduling heuristics that operate in the absence of accurate performance prediction model. These static and adaptive heuristics are evaluated through extensive simulations using performance traces obtained from Amazon AWS IaaS public cloud. Our results show an improvement of up to 20% in the overall profit as compared to the reactive adaptation algorithm.

Probabilistic Prediction based Scheduling for Delay Sensitive Traffic in Internet of Things

This paper proposes a probabilistic prediction based approach for providing Quality of Service (QoS) to delay sensitive traffic for Internet of Things (IoT). A joint packet scheduling and dynamic bandwidth allocation scheme is proposed to provide service differentiation and preferential treatment to delay sensitive traffic. The scheduler focuses on reducing the waiting time of high priority delay sensitive services in the queue and simultaneously keeping the waiting time of other services within tolerable limits. The scheme uses the difference in probability of average queue length of high priority packets at previous cycle and current cycle to determine the probability of average weight required in the current cycle. This offers optimized bandwidth allocation to all the services by avoiding distribution of excess resources for high priority services and yet guaranteeing the services for it. The performance of the algorithm is investigated using MPEG-4 traffic traces under different system loading. The results show the improved performance with respect to waiting time for scheduling high priority packets and simultaneously keeping tolerable limits for waiting time and packet loss for other services. Crown Copyright (C) 2015 Published by Elsevier B.V.

Load Balancing with Availability Checker and Load Reporters (LB-ACLRs) for improved Performance in Distributed Systems

Distributed system has quite a lot of servers to attain increased availability of service and for fault tolerance. Balancing the load among these servers is an important task to achieve better performance. There are various hardware and software based load balancing solutions available. However there is always an overhead on Servers and the Load Balancer while communicating with each other and sharing their availability and the current load status information. Load balancer is always busy in listening to clients' request and redirecting them. It also needs to collect the servers' availability status frequently, to keep itself up-to-date. Servers are busy in not only providing service to clients but also sharing their current load information with load balancing algorithms. In this paper we have proposed and discussed the concept and system model for software based load balancer along with Availability-Checker and Load Reporters (LB-ACLRs) which reduces the overhead on server and the load balancer. We have also described the architectural components with their roles and responsibilities. We have presented a detailed analysis to show how our proposed Availability Checker significantly increases the performance of the system.

Binary group III-nitride based heterostructures: band offsets and transport properties

In the last few years, there has been remarkable progress in the development of group III-nitride based materials because of their potential application in fabricating various optoelectronic devices such as light emitting diodes, laser diodes, tandem solar cells and field effect transistors. In order to realize these devices, growth of device quality heterostructures are required. One of the most interesting properties of a semiconductor heterostructure interface is its Schottky barrier height, which is a measure of the mismatch of the energy levels for the majority carriers across the heterojunction interface. Recently, the growth of non-polar III-nitrides has been an important subject due to its potential improvement on the efficiency of III-nitride-based opto-electronic devices. It is well known that the c-axis oriented optoelectronic devices are strongly affected by the intrinsic spontaneous and piezoelectric polarization fields, which results in the low electron-hole recombination efficiency. One of the useful approaches for eliminating the piezoelectric polarization effects is to fabricate nitride-based devices along non-polar and semi-polar directions. Heterostructures grown on these orientations are receiving a lot of focus due to enhanced behaviour. In the present review article discussion has been carried out on the growth of III-nitride binary alloys and properties of GaN/Si, InN/Si, polar InN/GaN, and nonpolar InN/GaN heterostructures followed by studies on band offsets of III-nitride semiconductor heterostructures using the x-ray photoelectron spectroscopy technique. Current transport mechanisms of these heterostructures are also discussed.

Rapid synthesis of hybrids and hollow PdO nanostructures by controlled in situ dissolution of a ZnO nanorod template: insights into the formation mechanism and thermal stability

Hollow nanomaterials have attracted a lot of interest by virtue of their wide range of applications that arise primarily due to their unique architecture. A common strategy to synthesize hollow nanomaterials is by nucleation of the shell material over a preformed core and subsequent dissolution of the core in the second step. Herein an ultrafast, microwave route has been demonstrated, to synthesize PdO nanotubes in a single step using ZnO as a sacrificial template. The mechanism of the nanotube formation has been investigated in detail using control experiments. By tuning the starting ratio of PdCl2 : ZnO, hollow to hybrid PdO nanostructures could be obtained using the same method. Conversion of the PdO to Pd nanotubes has been shown by simple NaBH4 treatment. The thermal stability of the PdO nanotubes has been studied. The insights presented here are general and applicable for the synthesis of hybrids/hollow structures in other systems as well.