On network correlated data gathering
By Razvan Cristescu, Baltasar Beferull-Lozano, Martin Vetterli. IEEE INFOCOM 2004, 2004
388 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/a0b481701c10dec559785781ae1a79f0d6ae75d5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Electrical and Electronic Engineering
- Michele Zorzi
- Stefano Galli
- J. Widmer
- Michele Rossi
- Elena Fasolo
- Anna Scaglione
- Melike Erol-Kantarci
- Hussein T. Mouftah
Citations in the corpus
- In-network aggregation techniques for wireless sensor networks: a survey (2007, background): “The authors of reference [77] highlight the drawbacks of previous approaches [75] [76] when the network is error prone and, as a partial solution, propose to exploit multi-path routing schemes.”
- Distributed Compressive Sensing (2009, neutral): “Anumberofdistributedcodingalgorithmshavebeendevelopedthatinvolvecollaboration amongstthesensors,includingseveralbasedonpredictivecoding[18] [19] [20],adistributedKLT[21], anddistributedwavelettransforms[22] [23].”
- Compressive data gathering for large-scale wireless sensor networks (2009, background): “Distributed source coding techniques [9][11][18] intend to reduce complexity at sensor nodes and utilize correlation at the sink.”
- An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation (2007, background): “Transferring the model parameters, instead of the raw time series, can significantly decrease the energy consumption on communication.”
- For the Grid and Through the Grid: The Role of Power Line Communications in the Smart Grid (2010, background): “correlation among the sensor data to reduce the information flows and to manage the rise in complexity of routing and processing data [62], [63], [64], [65], [66], [67].”