Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Yu Liu 0002

dblp:97/2274-2 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Internet of things and sensor networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network
sensor network simulation
0.112010
Data-enriched simulation of data management applications for wireless sensor networks · SenSys 2010
Internet of things and sensor networks › sensor network query processing
approximate query processing
0.112009
Enabling epsilon-Approximate Querying in Sensor Networks · Proc. VLDB Endow. 2009
Internet of things and sensor networks › query processing
energy-efficient query processing
0.112009
Enabling epsilon-Approximate Querying in Sensor Networks · Proc. VLDB Endow. 2009
Internet of things and sensor networks
sensor network query processing
0.112009
Enabling epsilon-Approximate Querying in Sensor Networks · Proc. VLDB Endow. 2009
Performance modeling and evaluation
simulation
0.012010
Data-enriched simulation of data management applications for wireless sensor networks · SenSys 2010

Methods — techniques the papers use, named apart from their topics

statistical device emulation · 0.2dataset integration · 0.2multi-version array · 0.1data shuffling · 0.1
YearPublicationVenuePosition
2010 Data-enriched simulation of data management applications for wireless sensor networks
abstract
Simulation is an essential means for evaluating WSN applications. As many WSN applications embrace in-network data processing functionalities, more sophisticated simulation tools with data-enriched test case scenarios, such as extensive environment input and accurate hardware models, are necessary. This work devises TOSSIM DB, a data-enriched WSN simulation framework, allowing unmodified applications to be evaluated as if virtually deployed in a third-party environment. Notable features of TOSSIM DB include i) integrating third-party sensor datasets as virtual test scenarios, ii) emulating the statistical properties of sensor devices, and iii) seamless integration with the TinyOS tool-chain.
Yu Liu 0002, Jianzhong Li 0001, Hong Gao 0001, Shengfei Shi
SenSys1
2009 Enabling epsilon-Approximate Querying in Sensor Networks
abstract
Data approximation is a popular means to support energy-efficient query processing in sensor networks. Conventional data approximation methods require users to specify fixed error bounds a prior to address the trade-off between result accuracy and energy efficiency of queries. We argue that this can be infeasible and inefficient when, as in many real-world scenarios, users are unable to determine in advance what error bounds can lead to affordable cost in query processing. We envision ε- approximate querying (EAQ) to bridge the gap. EAQ is a uniform data access scheme underlying various queries in sensor networks. It allows users or query executors to incrementally 'refine' previously obtained approximate data to reach arbitrary accuracy. EAQ not only grants more flexibility to in-network query processing, but also minimizes energy consumption through communicating data upto a just-sufficient level. To enable the EAQ scheme, we propose a novel data shuffling algorithm. The algorithm converts sensed datasets into special representations called multi-version array (MVA) . From prefixes of MVA , we can recover approximate versions of the entire dataset, where all individual data items have guaranteed error bounds. The EAQ scheme supports efficient and flexible processing of various queries including spatial window query, value range query, and queries with QoS constraints. The effectiveness and efficiency of the EAQ scheme are evaluated in a real sensor network testbed.
Yu Liu 0002, Jianzhong Li 0001, Hong Gao 0001, Xiaolin Fang 0001
Proc. VLDB Endow.1