Premium
Networked estimation under contention‐based medium access
Author(s) -
Rabi Maben,
Stabellini Luca,
Proutiere Alexandre,
Johansson Mikael
Publication year - 2009
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.1459
Subject(s) - computer science , rule of thumb , network packet , channel (broadcasting) , sample (material) , real time computing , heuristic , algorithm , computer network , artificial intelligence , chemistry , chromatography
This paper studies networked estimation over a communication channel shared by a contention‐based medium access protocol. A collection of N identical and physically decoupled scalar systems are sampled without sensor noise and transmitted over a common channel, using a contention‐based medium access mechanism. We first carry out a calculation of the average distortion in estimation with irregular samples. Given the rate of packet generation at sensors, we characterize the traffic characteristics of the some contention‐based MAC schemes. This lets us derive the statistics of inter‐arrival times which in turn allows us to compute the packet loss rates and also the statistics of delay within a sample period. Using these results, we track the estimation performance as the sample generation rate and the number of contending nodes are varied. We provide a heuristic rule‐of‐thumb for choosing the sampling interval which minimizes the average distortion. By combining the network traffic characterization with that of the estimation performance, we show this rule performs pretty well. Carrying along the same lines, we are able to compute the scaling limits of estimation performance with respect to the number of contending nodes. Copyright © 2009 John Wiley & Sons, Ltd.