EDBT 2026 Demo / reviewers in the wild / expert
Tong Feng
dblp:251/4175
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-7794-2499ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1Security and privacy · 1 · 1 since 2021
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 · 37% Edge and fog computing · 37% Network optimization and economics · 26% | |
| Network and information security
2 papers |
Privacy and data protection · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Smart cities and intelligent transportation · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection › privacy-preserving sensing
privacy-preserving crowdsensing |
0.7 | 2 | 2022 | DREAM: Online Control Mechanisms for Data Aggregation Error Minimization in Privacy-Preserving Crowdsensing · IEEE Trans. Dependable Secur. Comput. 2022 COMP: Online Control Mechanism for Profit Maximization in Privacy- Preserving Crowdsensing · IEEE J. Sel. Areas Commun. 2020 |
Edge and fog computing
task allocation |
0.6 | 2 | 2022 | COMP: Online Control Mechanism for Profit Maximization in Privacy- Preserving Crowdsensing · IEEE J. Sel. Areas Commun. 2020 DREAM: Online Control Mechanisms for Data Aggregation Error Minimization in Privacy-Preserving Crowdsensing · IEEE Trans. Dependable Secur. Comput. 2022 |
Internet of things and sensor networks
crowdsensing |
0.4 | 1 | 2020 | COMP: Online Control Mechanism for Profit Maximization in Privacy- Preserving Crowdsensing · IEEE J. Sel. Areas Commun. 2020 |
Network optimization and economics › pricing
profit maximization |
0.4 | 1 | 2020 | COMP: Online Control Mechanism for Profit Maximization in Privacy- Preserving Crowdsensing · IEEE J. Sel. Areas Commun. 2020 |
Privacy and data protection
location privacy |
0.4 | 1 | 2020 | COMP: Online Control Mechanism for Profit Maximization in Privacy- Preserving Crowdsensing · IEEE J. Sel. Areas Commun. 2020 |
Internet of things and sensor networks
mobile crowdsensing |
0.2 | 1 | 2022 | DREAM: Online Control Mechanisms for Data Aggregation Error Minimization in Privacy-Preserving Crowdsensing · IEEE Trans. Dependable Secur. Comput. 2022 |
Methods — techniques the papers use, named apart from their topics
online control mechanism · 1.7lyapunov stochastic optimization · 1.7queue stability · 0.9lyapunov optimization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | MBGNet:Multi-branch boundary generation network with temporal context aggregation for temporal action detection
Xiaoying Pan, Nijuan Zhang, Hewei Xie, Shoukun Li, Tong Feng |
Appl. Intell. | 5 |
| 2022 | DREAM: Online Control Mechanisms for Data Aggregation Error Minimization in Privacy-Preserving CrowdsensingabstractNowadays, by integrating the smart devices carried by users with existing communication infrastructures to provide large-scale, fine-grained and complex sensing services, crowdsensing as a novel sensing paradigm has significantly enriched the applications of smart city and promoted the development of Internet of Things (IoT). However, privacy has become skyrocketing concern for crowdsensing and gravely affected the deployment of crowdsensing. In this article, we present a framework to make the tradeoff between minimizing data aggregation error and guaranteeing system stability by jointly considering the privacy of participants, the randomness of sensing task arrival and the cost of platform. We propose an online control mechanism by exploiting Lyapunov stochastic optimization technique. Additionally, considering that, in reality, it always takes different time for different tasks to make sensing decisions, we extend standard Lyapunov stochastic optimization technique to make separate decisions for different types of sensing tasks in consecutive time. Through rigorous theoretical analysis, we prove that our time-average data aggregation error is approximately optimal while still maintaining system stability. By carrying out extensive simulations, we demonstrate the superiority of our proposed mechanisms. Yang Liu 0038, Tong Feng, Mugen Peng, Jianfeng Guan, Yu Wang 0003 |
IEEE Trans. Dependable Secur. Comput. | 2 |
| 2020 | COMP: Online Control Mechanism for Profit Maximization in Privacy- Preserving CrowdsensingabstractAs a novel sensing paradigm, crowdsensing has gained great attention due to large-scale user participation, low cost and wide data source, replacing traditional sensor based sensing in intelligent transportation, environmental monitoring, urban public management, etc. In crowdsensing, however, user privacy leakage is a common but fatal problem, where the participants in crowdsensing might not provide their data if their sensing data expose their personal private information or even lead to malicious attacks. Additionally, it is still challenging for the platform to consider the randomness of sensing task arrival, the dynamic participation of participants and the complexity of task allocation. To this end, an online control mechanism is presented to maximize the profit of platform while guaranteeing system stability and providing personalized location privacy protection. By exploiting Lyapunov optimization theory, we transform the optimization problem into a queue stability problem, decomposing it into three subproblems further. Through rigorous theoretical analysis, we prove that our time-averaged profit is approximately optimal. We also carry out extensive simulations to verify the superiority of our proposed mechanism. Yang Liu 0038, Tong Feng, Mugen Peng, Zhongbai Jiang, Jianfeng Guan, Su Yao |
IEEE J. Sel. Areas Commun. | 2 |