Tao Zhang

Tao Zhang

Auto-generated profile, based on publicly available information

Tao Zhang

Department of Computer Science, New York Institute of Technology, New York, NY, USA

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 January 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YZYanlin Zhang
Yanlin Zhang
PLPeng Li
Peng Li
TZTao Zhang
Tao Zhang
JLJing Liu
Jing Liu
WHWeiyi Huang
Weiyi Huang
LNLei Nie
Lei Nie
Most of the existing user recruitment methods are designed for the two-tier structure. However, the computational consumption of the cloud platform rises rapidly as data volumes increase. In recent years, edge computing has been introduced into mobile crowdsensing. In this paper, we study dynamic user recruitment with edge-aided mobile crowdsensing. Specifically, we consider the scenarios for different sensing tasks. One is the long-duration task, and the other is the short-duration task. For the former, it is time-insensitive, while the latter is time-sensitive. In the scenario with the long-duration task, we consider a simple offline scenario and propose an Edge-Node User Recruitment (ENUR) algorithm to recruit users statically. Then, we consider the online scenario and propose a Budget Re-Distribution algorithm for Edge Nodes User Recruitment (BRD-ENUR). It dynamically redistributes the budget according to the task completion ratio of different edge nodes. In the scenario with the short-duration task, the whole sensing process consists of multiple rounds. In each round, edge nodes need to recruit users between selected users (exploitation) and unselected users (exploration) under the budget. We model such a user recruitment process as a novel combinatorial multi-armed bandit problem. Then, we propose an Edge Nodes User Recruitment algorithm based on combinatorial Multi-armed Bandit (EN-URMB). Extensive experiments show the validity and reliability of our user recruitment algorithms based on the real data set.

27 April 2011 in International Journal of Communication Systems
Verified
Journal Article
Closed access
PDF file
TZTao Zhang
Tao Zhang

10 January 2014 in International Journal of Communication Systems
Verified
Journal Article
Closed access
PDF file
TZTao Zhang
Tao Zhang
JWJin Wang
Jin Wang

12 January 2021 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
WHWeiyi Huang
Weiyi Huang
PLPeng Li
Peng Li
BLBo Li
Bo Li
TZTao Zhang
Tao Zhang
Vehicular ad-hoc networks (VANETs) have been widely studied in intelligent transportation. Content delivery is an important topic that attracts many researchers. Due to vehicles that may have intermittent connections and uncertain routes, it is difficult to select an appropriate node. In this paper, we analyze the movement pattern of vehicles from real taxis’ trajectories and propose a framework for delivery prediction, which aims to select appropriate nodes. First, we propose the framework which consists of a contact clique model, a social clique model, and a prediction model based on Markov chains, to characterize the movement pattern of vehicles. Second, we capture dynamic movement patterns by dividing the time requirement into equal length slots and construct clique sequences. Based on the fact that the sociality of nodes has strong temporal correlations, we utilize the prediction model to derive future cliques and evaluate two kinds of delivery performance in the future. Finally, we design a content delivery algorithm with dynamic movement pattern (DMP) to select the appropriate node. In our experiment, DMP performs better than that of other methods in terms of overhead, average hops. Also, as the number of nodes increases, our algorithm keeps small fluctuations in node sociality.

1 October 2006
Verified
Conference Paper
Closed access
XHXiaodong Huang
Xiaodong Huang
QSQingya She
Qingya She
TZTao Zhang
Tao Zhang
KLKejie Lu
Kejie Lu
JJJason P. Jue
Jason P. Jue
In this paper, we focus on the problem of effectively supporting a large number of small group multicasts in optical burst switched (OBS) networks. We first propose a multicast scheme for small group multicast in OBS networks. To reduce burst loss due to potential burst contentions, a deflection routing scheme for multicast is proposed. We then develop a generic analytical model to evaluate the performance of the multicast scheme and the deflection routing scheme. To the best of our knowledge, this is the first analytical model proposed for the problem of multicast with deflection routing. The analytical model is verified through simulations. Numerical results show that the analytical model is accurate and that deflection routing can significantly reduce burst loss probability while slightly increasing burst delay.