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.
? Tutorial for this page

Jiawei Han 0005

dblp:254/9786 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · unresolved

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

Computer networks · 1

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
1 paper
Network optimization and economics · 87% Edge and fog computing · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 50% Computational finance and economics · 50%

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

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities › social computing › crowdsourcing
crowd sensing
0.412020
A Distributed Game Methodology for Crowdsensing in Uncertain Wireless Scenario · IEEE Trans. Mob. Comput. 2020
Computational finance and economics › mechanism design
incentive design
0.412020
A Distributed Game Methodology for Crowdsensing in Uncertain Wireless Scenario · IEEE Trans. Mob. Comput. 2020
Network optimization and economics › resource allocation › market-based resource allocation
auction-based resource allocation
0.412020
A Distributed Game Methodology for Crowdsensing in Uncertain Wireless Scenario · IEEE Trans. Mob. Comput. 2020
Network optimization and economics › game theory
game-theoretic networking
0.412020
A Distributed Game Methodology for Crowdsensing in Uncertain Wireless Scenario · IEEE Trans. Mob. Comput. 2020
Edge and fog computing › collaborative computing
mobile device collaboration
0.112020
A Distributed Game Methodology for Crowdsensing in Uncertain Wireless Scenario · IEEE Trans. Mob. Comput. 2020

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

multi-stage stochastic programming · 0.9game theory · 0.9auction mechanism · 0.9
YearPublicationVenuePosition
2020 A Distributed Game Methodology for Crowdsensing in Uncertain Wireless Scenario
abstract
With the exponentially increasing number of mobile devices, crowdsensing has been a hot topic to use the available resource of neighbor mobile devices to perform sensing tasks cooperatively. However, there still remain three main obstacles to be solved in the practical system. First, since mobile devices are selfish and rational, it is natural to provide cooperation for sensing with a reasonable payment. Meanwhile, due to the arrival and departure of sensing tasks, resource should be allocated and released dynamically when sensing task comes or leaves. To this end, this paper designs a game theoretic approach based incentive mechanism to encourage the “best” neighbor mobile devices to share their own resource for sensing. Next, in order to adjust resource among mobile devices for the better crowdsensing response, an auction based task migration algorithm is proposed, which can guarantee the truthfulness of announced price of auctioneer, individual rationality, profitability, and computational efficiency. Moreover, taking into account the random movement of mobile devices resulting in the stochastic connection, we also use multi-stage stochastic decision to take posterior resource allocation to compensate for inaccurate prediction. The numerical results show the effectiveness and improvement of the proposed multi-stage stochastic programming based distributed game theoretic methodology (SPG) for crowdsensing.
Bin Cao 0002, Shichao Xia, Jiawei Han 0005, Yun Li 0001
IEEE Trans. Mob. Comput.3