Joint identity-message coding

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit - for instance, in many cases, sensors are used to detect whether and where a certain interesting co...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2010-09, Vol.28 (7), p.1083-1093
Main Authors: Keller, L, Siavoshani, M J, Fragouli, C, Argyraki, K, Diggavi, S
Format: Article
Language:English
Subjects:
Coding
Encoding
Energy efficiency
Environmental impact statements
Identity-aware sensor networks
Mathematical analysis
Messages
Network coding
Networks
Optimization
Pediatrics
Pollution measurement
Protocols
Sensors
Simulation
Subspaces
Temperature sensors
Vectors
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit - for instance, in many cases, sensors are used to detect whether and where a certain interesting condition occurred, or to track incremental environmental changes at fixed locations. In such scenarios, the traditional network-protocol paradigm of separately specifying the source identity and the message in distinct fields leads to inefficient communication. This work addresses the question of how communication should happen in such identity-aware sensor networks. We calculate theoretical performance bounds for this type of communication, where 'performance' refers to the number of transmitted bits. We propose a communication protocol, where the identity and message of each source are specified jointly using subspace coding. We show through analysis and simulation that our protocol's performance is close to optimal and compare it to the performance of a traditional protocol, where identity and message are specified separately.
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2010.100913