Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jiejun Hu
dblp:172/4107 · also Jiejun Hu-Bolz
· DBLP profile ↗
14ranked-venue papers
5as first author
6since 2021 · last 2026
0000-0002-5274-1869ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 2Software engineering, systems software and programming languages · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 |
Edge and fog computing · 79% Network optimization and economics · 21% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Edge and fog computing › resource management
edge resource provisioning |
0.4 | 1 | 2019 | Mobile Edge Provision with Flexible Deployment · IEEE Trans. Serv. Comput. 2019 |
Edge and fog computing
mobile edge computing |
0.4 | 1 | 2019 | Mobile Edge Provision with Flexible Deployment · IEEE Trans. Serv. Comput. 2019 |
Network optimization and economics
operational cost minimization |
0.2 | 1 | 2023 | Service-Based, Multi-Provider, Fog Ecosystem With Joint Optimization of Request Mapping and Response Routing · IEEE Trans. Serv. Comput. 2023 |
Methods — techniques the papers use, named apart from their topics
optimization algorithm · 0.7analytical evaluation · 0.7two-tier placement · 0.4dynamic minimum spanning tree · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | To Trust or Not to Trust: Optimal Trust-Aware Task Offloading in Vehicular Fog ComputingabstractGiven a Vehicular Fog Computing (VFC) scenario, computing tasks with varying sensitivity levels must be offloaded while jointly balancing latency, energy, and trust requirements. Existing trust-based schemes often neglect some of these trade-offs or fail to adapt to task sensitivity and node reliability in dynamic vehicular settings. This paper proposes a trust-based task offloading (TTO) framework that employs a multi-dimensional trust model, combining Reputation, Experience, and Knowledge (REK) to compute a trust-aware overhead function that adapts to task requirements.We also incorporate computable encryption options, enabling task owners (TOs) to protect highly sensitive tasks. The interaction among TOs is modeled as a potential game, which implies the finite-improvement property and the existence of a Nash equilibrium, enabling distributed, self-adaptive decision-making that aligns individual incentives with overall system efficiency. This design allows vehicles to achieve an optimal balance between trust assurance and performance without centralized coordination. The efficiency of the framework against centralized approaches is validated by analyzing the price of anarchy. The simulation results confirm that TTO converges in 60 iterations for 100 nodes, achieving a 30-35% lower average delay and up to 25% lower total overhead compared to the considered baselines. These results indicate that TTO effectively balances trust, latency, and energy requirements. Zahra Seyedi, Jiejun Hu, Shahzad Ahmad 0001 |
IEEE Internet Things J. | 2 |
| 2025 | Federated data acquisition market: Architecture and a mean-field based data pricing strategyabstractWith the increasing global mobile data traffic and daily user engagement, technologies, such as mobile crowdsensing, benefit hugely from the constant data flows from smartphone and IoT owners. However, the device users, as data owners, urgently require a secure and fair marketplace to negotiate with the data consumers. In this paper, we introduce a novel federated data acquisition market that consists of a group of local data aggregators (LDAs); a number of data owners; and, one data union to coordinate the data trade with the data consumers. Data consumers offer each data owner an individual price to stimulate participation. The mobile data owners naturally cooperate to gossip about individual prices with each other, which also leads to price fluctuation. It is challenging to analyse the interactions among the data owners and the data consumers using traditional game theory due to the complex price dynamics in a large-scale heterogeneous data acquisition scenario. Hence, we propose a data pricing strategy based on mean-field game (MFG) theory to model the data owners’ cost considering the price dynamics. We then investigate the interactions among the LDAs by using the distribution of price, namely the mean-field term. A numerical method is used to solve the proposed pricing strategy. The evaluations demonstrate that the proposed pricing strategy efficiently allows the data owners from multiple LDAs to reach an equilibrium on data quantity to sell regarding the current individual price scheme. The result further demonstrates that the influential LDAs determine the final price distribution. Last but not least, it shows that cooperation among mobile data owners leads to optimal social welfare even with the additional cost of information exchange. Jiejun Hu, Martin J. Reed, Zelei Liu |
High Confid. Comput. | 1 |
| 2024 | Beyond the Surface of Digital Contact Tracing: Delving into the Interconnected World of Technology, Individuals, and SocietyabstractInformation-enabled technology, such as digital contact tracing (DCT), is designed to assist decision-making. However, during the pandemic, DCT also contributes additional factors to consider for individuals and policymakers. In this article, we conceptualise the interactions between individuals and policymakers and propose a leader-followers mean-field Game model to analyse their decision-making processes by integrating key factors, such as individuals’ health state, self-control effort, privacy, and social activities, under the influence of interventions and subsidies from policymakers. The simulation demonstrates that moderate subsidies are sufficient to induce early control efforts and higher collective efforts even with privacy concerns and the negative influence of engaging activities; Equilibrium and system stability can be reached when healthy or the summation of healthy and mediocre healthy populations dominates; The model highlights the crucial elements for future data analysis and collection, such as DCT is vital to indicate population health states. Jiejun Hu, Katayoun Farrahi, Manuel Cebrián |
IEEE Trans. Syst. Man Cybern. Syst. | 1 |
| 2023 | Service-Based, Multi-Provider, Fog Ecosystem With Joint Optimization of Request Mapping and Response RoutingabstractDigital transformation is increasingly reliant onservice-based operations in fog networks. The latter is a geo-dispersed form of the cloud, extending resources closer to end-users for improved privacy and reduced latency. The dispersion leverages diversity of compute-network capacities and energy prices, while promotes the coexistence of multiple providers. This drives variation in operational cost, coupled with limited information sharing across providers. Consequently, there is a critical need for an orchestration solution that preserves autonomy and optimizes operational cost across domains, while meeting service requirements. This paper proposes a novel service-based fog management and network orchestrator (sbMANO), which utilizes service metadata in enabling multi-provider resource management. The sbMANO is empowered with a novel optimization algorithm for service-based joint request mapping and response routing. The algorithm acts on partial information and preserves the edge for delay-critical services. The performance of the algorithm is evaluated analytically fordelay-awareanddelay-agnosticvariants. The results show that both achieve near-optimal performance in maximizing user satisfaction with minimum operational cost. Furthermore, the delay-aware variant outperforms the agnostic counterpart, with higher user satisfaction and lower operational cost. Mays F. Al-Naday, Nikolaos Thomos, Jiejun Hu, Bruno Volckaert, Filip De Turck, Martin J. Reed |
IEEE Trans. Serv. Comput. | 3 |
| 2022 | A Dynamic Service Trading in a DLT-Assisted Industrial IoT MarketplaceabstractWith the increasing demand for digitalization and participation in Industry 4.0, new challenges have emerged concerning the market of digital services to compensate for the lack of processing, computation, and other resources within Industrial Internet of Things (IIoTs). At the same time, the complexity of interplay among stakeholders has grown in size, granularity, and variation of trust. In this paper, we consider an IIoT resource market with heterogeneous buyers such as manufacturer owners. The buyers interact with the resource supplier dynamically with specific resource demands. This work introduces a broker between the supplier and the buyers, equipped with Distributed Ledger Technologies (DLT) providing a service for market security and trustworthiness. We first model the DLT-assisted IIoT market analytically to determine an offline solution and understand the selfish interactions among different entities (buyers, supplier, broker). Considering the non-cooperative heterogeneous buyers in the dynamic market, we then follow an independent learners framework to determine an online solution. In particular, the decision-making procedures of buyers are modeled as a Partially Observable Markov Decision Process which is solved using independent Q-learning. We evaluate both the offline and online solutions with analytical simulations, and the results show that the proposed approaches successfully maximize players’ satisfaction. The results further demonstrate that independent Q-learners achieve equilibrium in a dynamic market even without the availability of complete information and communication, and reach a better solution compared to that of centralized Q-learning. Jiejun Hu, Martin J. Reed, Nikolaos Thomos, Mays F. Al-Naday, Kun Yang 0001 |
IEEE Trans. Netw. Serv. Manag. | 1 |
| 2021 | Securing SDN-Controlled IoT Networks Through Edge BlockchainabstractThe Internet of Things (IoT) connected by software-defined networking (SDN) promises to bring great benefits to cyber-physical systems. However, the increased attack surface offered by the growing number of connected vulnerable devices and separation of SDN control and data planes could overturn the huge benefits of such a system. This article addresses the vulnerability of the trust relationship between the control and data planes. To meet this aim, we propose an edge computing-based Blockchain as a Service (BaaS), enabled by an external BaaS provider. The proposed solution provides verification of inserted flows through an efficient, edge-distributed, blockchain solution. We study two scenarios for the blockchain reward purpose: 1) information symmetry, in which the SDN operator has direct knowledge of the real effort spent by the BaaS provider and 2) information asymmetry, in which the BaaS provider controls the exposure of information regarding spent effort. The latter yields the so-called “moral hazard,” where the BaaS may claim higher than actual effort. We develop a novel mathematical model of the edge BaaS solution and propose an innovative algorithm of a fair reward scheme based on game theory that takes into account moral hazard. We evaluate the viability of our solution through analytical simulations. The results demonstrate the ability of the proposed algorithm to maximize the joint profits of the BaaS and SDN operator, i.e., maximizing the social welfare. Jiejun Hu, Martin J. Reed, Nikolaos Thomos, Mays F. Al-Naday, Kun Yang 0001 |
IEEE Internet Things J. | 1 |
| 2020 | A Blockchain-Based Reward Mechanism for Mobile CrowdsensingabstractMobile crowdsensing (MCS) is a novel sensing scenario of cyber-physical-social systems. MCS has been widely adopted in smart cities, personal health care, and environment monitor areas. MCS applications recruit participants to obtain sensory data from the target area by allocating reward to them. Reward mechanisms are crucial in stimulating participants to join and provide sensory data. However, while the MCS applications execute the reward mechanisms, sensory data and personal private information can be in great danger because of malicious task initiators/participants and hackers. This article proposes a novel blockchain-based MCS framework that preserves privacy and secures both the sensing process and the incentive mechanism by leveraging the emergent blockchain technology. Moreover, to provide a fair incentive mechanism, this article has considered an MCS scenario as a sensory data market, where the market separates the participants into two categories: monthly-pay participants and instant-pay participants. By analyzing two different kinds of participants and the task initiator, this article proposes an incentive mechanism aided by a three-stage Stackelberg game. Through theoretical analysis and simulation, the evaluation addresses two aspects: the reward mechanism and the performance of the blockchain-based MCS. The proposed reward mechanism achieves up to a 10% improvement of the task initiator's utility compared with a traditional Stackelberg game. It can also maintain the required market share for monthly-pay participants while achieving sustainable sensory data provision. The evaluation of the blockchain-based MCS shows that the latency increases in a tolerable manner as the number of participants grows. Finally, this article discusses the future challenges of blockchain-based MCS. Jiejun Hu, Kun Yang 0001, Kezhi Wang |
IEEE Trans. Comput. Soc. Syst. | 1 |
| 2019 | Mobile Edge Provision with Flexible DeploymentabstractThe Mobile Edge Network (MEN) has emerged as the basic infrastructure to support fifth-generation networks, mobile edge computing and fog computing. The characteristics of mobility must be addressed to guarantee the quality of service in MENs. As one of the critical problems in MENs, flexible deployment plays a part in exploiting edge networks. Despite the abundance of recently proposed strategies, most concentrate on the change in user demands and inevitably ignore the influence for the user mobility, which is common in future networks. We propose Provision for Mobile Edge Computing (PMEC), a prototype that takes advantage of storage devices with flexible placement. In PMEC, we accommodate various considerations and select different storage devices to cache, deploying the cache with the relationship of a two-tiered structure in the MEN. Thus, we construct a flexible overlay network with the objective of minimizing the cost in a two-tiered edge network. Based on the analysis of the problem, we solve the two-tiered placement from bottom to top using the dynamic minimal spanning tree (MST) algorithm and design two algorithms for each tier including the basic algorithm and the improved algorithms. The simulation is conducted on realistic data to demonstrate the performance of our algorithms. Pingting Hao, Liang Hu 0001, Jingyan Jiang, Jiejun Hu, Xilong Che |
IEEE Trans. Serv. Comput. | 4 |
| 2018 | SRMCS: A semantic-aware recommendation framework for mobile crowd sensing
Feng Wang 0014, Liang Hu 0001, Jiejun Hu, Kuo Zhao |
Inf. Sci. | 4 |
| 2018 | Q-FDBA: improving QoE fairness for video streaming
Jingyan Jiang, Liang Hu 0001, Pingting Hao, Jiejun Hu, Hongtu Li |
Multim. Tools Appl. | 5 |
| 2017 | Role-based intelligent application state computing for OpenFlow distributed controllers in software-defined networking
Fu Tao, Liang Hu 0001, Xiaodi Yu, Jiejun Hu, Kuo Zhao |
Soft Comput. | 4 |
| 2017 | A semantics-based approach to multi-source heterogeneous information fusion in the internet of things
Feng Wang 0014, Liang Hu 0001, Jin Zhou 0012, Jiejun Hu, Kuo Zhao |
Soft Comput. | 4 |
| 2016 | Computer forensic analysis model for the reconstruction of chain of evidence of volatile memory data
Feng Wang 0014, Liang Hu 0001, Jiejun Hu, Kuo Zhao |
Multim. Tools Appl. | 3 |
| 2015 | Estimating online vacancies in real-time road traffic monitoring with traffic sensor data stream
Feng Wang 0014, Liang Hu 0001, Dongdai Zhou, Jiejun Hu, Kuo Zhao |
Ad Hoc Networks | 5 |