Do you want to publish a course? Click here

Multi-sensor Transmission Management for Remote State Estimation under Coordination

230   0   0.0 ( 0 )
 Added by Kemi Ding
 Publication date 2017
and research's language is English




Ask ChatGPT about the research

This paper considers the remote state estimation in a cyber-physical system (CPS) using multiple sensors. The measurements of each sensor are transmitted to a remote estimator over a shared channel, where simultaneous transmissions from other sensors are regarded as interference signals. In such a competitive environment, each sensor needs to choose its transmission power for sending data packets taking into account of other sensors behavior. To model this interactive decision-making process among the sensors, we introduce a multi-player non-cooperative game framework. To overcome the inefficiency arising from the Nash equilibrium (NE) solution, we propose a correlation policy, along with the notion of correlation equilibrium (CE). An analytical comparison of the game value between the NE and the CE is provided, with/without the power expenditure constraints for each sensor. Also, numerical simulations demonstrate the comparison results.



rate research

Read More

Novel low-power wireless technologies and IoT applications open the door to the Industrial Internet of Things (IIoT). In this new paradigm, Wireless Sensor Networks (WSNs) must fulfil, despite energy and transmission power limitations, the challenging communication requirements of advanced manufacturing processes and technologies. In industrial networks, this is possible thanks to the availability of network infrastructure and the presence of a network coordinator that efficiently allocates the available radio resources. In this work, we consider a WSN that simultaneously transmits measurements of Networked Control Systems (NCSs) dynamics to remote state estimators over a shared packet-erasure channel. We develop a minimum transmission power control (TPC) policy for the coordination of the wireless medium by formulating an infinite horizon Markov decision process (MDP) optimization problem. We compute the policy using an approximate value iteration algorithm and provide an extensive evaluation of its parameters in different interference scenarios and NCSs dynamics. The evaluation results present a comprehensive characterization of the algorithms performance, proving that it can flexibly adapt to arbitrary use cases.
Highly directional millimeter wave (mmWave) radios need to perform beam management to establish and maintain reliable links. To do so, existing solutions mostly rely on explicit coordination between the transmitter (TX) and the receiver (RX), which significantly reduces the airtime available for communication and further complicates the network protocol design. This paper advances the state of the art by presenting DeepBeam, a framework for beam management that does not require pilot sequences from the TX, nor any beam sweeping or synchronization from the RX. This is achieved by inferring (i) the Angle of Arrival (AoA) of the beam and (ii) the actual beam being used by the transmitter through waveform-level deep learning on ongoing transmissions between the TX to other receivers. In this way, the RX can associate Signal-to-Noise-Ratio (SNR) levels to beams without explicit coordination with the TX. This is possible because different beam patterns introduce different impairments to the waveform, which can be subsequently learned by a convolutional neural network (CNN). We conduct an extensive experimental data collection campaign where we collect more than 4 TB of mmWave waveforms with (i) 4 phased array antennas at 60.48 GHz, (ii) 2 codebooks containing 24 one-dimensional beams and 12 two-dimensional beams; (iii) 3 receiver gains; (iv) 3 different AoAs; (v) multiple TX and RX locations. Moreover, we collect waveform data with two custom-designed mmWave software-defined radios with fully-digital beamforming architectures at 58 GHz. Results show that DeepBeam (i) achieves accuracy of up to 96%, 84% and 77% with a 5-beam, 12-beam and 24-beam codebook, respectively; (ii) reduces latency by up to 7x with respect to the 5G NR initial beam sweep in a default configuration and with a 12-beam codebook. The waveform dataset and the full DeepBeam code repository are publicly available.
We consider the problem of communication allocation for remote state estimation in a cognitive radio sensor network~(CRSN). A sensor collects measurements of a physical plant, and transmits the data to a remote estimator as a secondary user (SU) in the shared network. The existence of the primal users (PUs) brings exogenous uncertainties into the transmission scheduling process, and how to design an event-based scheduling scheme considering these uncertainties has not been addressed in the literature. In this work, we start from the formulation of a discrete-time remote estimation process in the CRSN, and then analyze the hidden information contained in the absence of data transmission. In order to achieve a better tradeoff between estimation performance and communication consumption, we propose both open-loop and closed-loop schedules using the hidden information under a Bayesian setting. The open-loop schedule does not rely on any feedback signal but only works for stable plants. For unstable plants, a closed-loop schedule is designed based on feedback signals. The parameter design problems in both schedules are efficiently solved by convex programming. Numerical simulations are included to illustrate the theoretical results.
In this paper we consider the problem of transmission power allocation for remote estimation of a dynamical system in the case where the estimator is able to simultaneously receive packets from multiple interfering sensors, as it is possible e.g. with the latest wireless technologies such as 5G and WiFi. To this end we introduce a general model where packet arrival probabilities are determined based on the received Signal-to-Interference-and-Noise Ratio and with two different receivers design schemes, one implementing standard multi-packet reception technique and one implementing Successive Interference Cancellation decoding algorithm in addition. Then we cast the power allocation problem as an optimization task where the mean error covariance at the remote estimator is minimized, while penalizing the mean transmission power consumption. For the infinite-horizon problem we show the existence of a stationary optimal policy, while for the finite-horizon case we derive some structural properties under the special scenario where the overall system to be estimated can be seen as a set of independent subsystems. Numerical simulations illustrate the improvement given by the proposed receivers over orthogonal schemes that schedules only one sensor transmission at a time in order to avoid interference.
In this work, we consider the problem of jointly minimizing the average cost of sampling and transmitting status updates by users over a wireless channel subject to average Age of Information (AoI) constraints. Errors in the transmission may occur and a scheduling policy has to decide if the users sample a new packet or attempt for retransmission of the packet sampled previously. The cost consists of both sampling and transmission costs. The sampling of a new packet after a failure imposes an additional cost on the system. We formulate a stochastic optimization problem with the average cost in the objective under average AoI constraints. To solve this problem, we propose three scheduling policies; a) a dynamic policy, that is centralized and requires full knowledge of the state of the system, b) two stationary randomized policies that require no knowledge of the state of the system. We utilize tools from Lyapunov optimization theory in order to provide the dynamic policy, and we prove that its solution is arbitrary close to the optimal one. In order to provide the randomized policies, we model the system by utilizing Discrete Time Markov Chain (DTMC). We provide closed-form and approximated expressions for the average AoI and its distribution, for each randomized policy. Simulation results show the importance of providing the option to transmit an old packet in order to minimize the total average cost.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا