Information retrieval and processing in sensor networks: deterministic scheduling vs. random access
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
There is a critical threshold of e/sup -/spl lambda/(1+o(1))/, where /spl lambda/ is the throughput of the random access protocol, on the sensor outage probability P/sub out/ beyond which the reconstruction performance of deterministic central scheduling is inferior to that of distributed random access.
Abstract
The effect of medium access control (MAC) for information retrieval on signal field reconstruction in large-scale sensor networks with finite density is analyzed. Two MAC schemes are compared: the deterministic scheduling and random access. For fixed sensor density, we show that there is a critical threshold of e/sup -/spl lambda/(1+o(1))/, where /spl lambda/ is the throughput of the random access protocol, on the sensor outage probability P/sub out/ beyond which the reconstruction performance of deterministic central scheduling is inferior to that of distributed random access.
