Elements of information theory
Elements of information theory
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Proceedings of the 1st international conference on Embedded networked sensor systems
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Principles of Embedded Networked Systems Design
Principles of Embedded Networked Systems Design
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Perpetual environmentally powered sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Hot topic: physical-layer network coding
Proceedings of the 12th annual international conference on Mobile computing and networking
Embracing wireless interference: analog network coding
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
On the capacity of non-coherent network coding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
PAQ: time series forecasting for approximate query answering in sensor networks
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory
Nonintersecting subspaces based on finite alphabets
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.