Abstract-PHY layer authentication of a wireless sender has gained much interest recently. In this paper, we consider the famous Alice, Bob and Eve model and investigate (for the first time) the feasibility of using time-varying clock offsets for sendernode-authentication at Bob. Specifically, we exploit the fact (and de-facto problem) that clock offset between every node pair is unique; moreover, the two clock offsets between any two node pairs drift independently and randomly over time. Therefore, an explicit mechanism is needed to track the time-varying clock offsets. To this end, we model oscillator drift as brownian motion frequency and phase drift, and present a novel framework which is based on interplay between a hypothesis testing device and a bank of two Kalman filters; one KF (KF H 0 ) tracks Alice's clock while other KF (KF H 1 ) tracks Eve's clock. Building on aforementioned framework, we then propose a novel sendernode-authentication method (so-called MHF method) by means of which Bob can automatically accept (reject) a received packet if it is sent by Alice (Eve). Finally, simulation results are presented which corroborate the efficiency of the proposed method.

This paper proposes to exploit the so-called reciprocity parameters (modelling non-reciprocal communication hardware) to use them as decision metric for binary hypothesis testing based authentication framework at a receiver node Bob. Specifically, Bob first learns the reciprocity parameters of the legitimate sender Alice via initial training. Then, during the test phase, Bob first obtains a measurement of reciprocity parameters of channel occupier (Alice, or, the intruder Eve). Then, with ground truth and current measurement both in hand, Bob carries out the hypothesis testing to automatically accept (reject) the packets sent by Alice (Eve). For the proposed scheme, we provide its success rate (the detection probability of Eve), and its performance comparison with other schemes.

Abstract-Token-passing wireless network protocols (TP-WNP) (e.g., EchoRing), designed for hard real-time systems, typically need to provide ultra-low-latency coupled with ultrahigh-reliability guarantees. In this paper, we initiate a study to investigate the feasibility of distributed relay beamforming (DRBF) in a TP-WNP with the aim to enhance its reliability (and latency) performance even further. Specifically, we consider employing N i) amplify-and-forward (AF), ii) decode-and-forward (DF) relays in a wireless network running a TP-WNP. The relays operate in FDD mode, and do distributed transmit beamforming to realize low-latency, highly-reliable communication between each of the M source-destination pairs in the TP-WNP (a.k.a TDMA) system.The enablers/pre-requisites for the proposed DRBF-TDMA system are frequency, phase and timing synchronization among the relay nodes. To this end, we propose a novel distributed method for frequency synchronization among the AF/DF relay nodes operating in FDD mode. Furthermore, for oscillators with drift, we derive a rule of thumb which provides us the maximum relaying delay T delay up to which the proposed frequency synchronization method is effective. For phase and timing synchronization, we employ standard techniques from the literature. Our simulation results verify the analytical results, i.e., by means of proposed DRBF using N AF (DF) relays, upto a factor of N (N 2 ) gains in received SNR can be achieved, at each of the M destination nodes in the proposed system.

We consider the optimal economic dispatch of power generators in a smart electric grid for allocating power between generators to meet load requirements at minimum total cost. We assume that each generator has a piecewise linear cost function. We first present a polynomial time algorithm that achieves optimal dispatch. We then present a decentralized algorithm where, each generator independently adjusts its power output using only the aggregate power imbalance in the network, which can be observed by each generator through local measurements of the frequency deviation on the grid. The algorithm we propose exponentially erases the power imbalance, while eventually minimizing the generation cost. iii