Wenan Tan

Prof. Wenan Tan


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
2 June 2021 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
WTWenan Tan
Wenan Tan
LZLU ZHAO
LU ZHAO
BLBo Li
Bo Li
Lida XuLida Xu
Lida Xu
YYYun Yang
Yun Yang
Multiple cooperative task allocation (MCTA) is a crucial problem in mobile crowdsensing, where each task requires more than one user to cooperatively complete. As more and more users join sensing tasks in groups, it is indispensable to develop a group-oriented crowdsensing mechanism supporting MCTA. However, existing studies generally focus on a group that can provide sufficient users to accomplish a task. Once these groups no longer exist, the corresponding task will be discarded or be performed with compromised quality. In this paper, we propose a novel three-phase approach named Group-oriented Cooperative Crowdsensing (GoCC) to tackle the MCTA problem in social mobile crowdsensing. This approach exploits real-life relationships in the social network to form compatible groups, which improves the task coverage via group-oriented cooperation while achieving good task cooperation quality. Specifically, phase 1 selects a subset of users on the social network as initial leaders and directly pushes sensing tasks to them. Phase 2 utilizes the leaders to search for their socially connected users to model groups. Phase 3 presents the process of group-oriented task allocation for solving the MCTA problem. Experiments on the real-world dataset validate that our approach significantly outperforms the representative approaches.

13 June 2021 in Enterprise Information Systems
Verified
Journal Article
Closed access
WTWenan Tan
Wenan Tan
HZHai Zhu
Hai Zhu
JTJinjing Tan
Jinjing Tan
YZYao Zhao
Yao Zhao
LXLi Da Xu
Li Da Xu
KGKai Guo
Kai Guo
The number of service offerings in cloud manufacturing continues to grow, so that service level agreement (SLA) within cloud manufacturing is increasingly used to ensure the coordination of the cross-organisational business processes between the cloud service providers (CSP) and cloud service consumers (CSC). The definition of SLA and monitoring SLA’s performance are significant and should be highly valued to ensure the effectiveness and efficiency of business services. At present, the third-party monitoring methods based on service credit are mainly applied in cloud manufacturing environments. There is no effective supervision mechanism to monitor the third party and no efficient punishment mechanism on SLA violation. To address aforementioned issues, this paper proposes a novel Service Level Agreement model by integrating Blockchain and Smart Contract (SLABSC), in which trust issues among CSP, CSC, and the third-party monitoring can be addressed through Blockchain technologies. The method proposed in this paper realises the full functionality of SLABSC and facilitates data security, and it can be used to supervise CSP to provide better services. Experiments results show that the performance of the proposed model is valid and efficient.

26 April 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
LZLU ZHAO
LU ZHAO
BLBo Li
Bo Li
WTWenan Tan
Wenan Tan
GCGuangming Cui
Guangming Cui
QHQiang He
Qiang He
YYYun Yang
Yun Yang
Mobile edge computing (MEC), as an emerging technology, allows application vendors to deploy application instances on edge servers to deliver low-latency services to nearby end-users. However, due to hardware faults, software exceptions, or cyberattacks, edge servers are prone to failures in the highly distributed and dynamic MEC environment. Hence service reliability must be ensured when failures occur. This raises a critical and open problem - improving service reliability when deploying application instances in the MEC environment. In this article, we jointly consider both user coverage and service reliability when deploying application instances on edge servers with a given application deployment budget $\mathcal {K}$ . We formally define this joint C overage- R eliability for $\mathcal {K}$ - B udgeted E dge A pplication D eployment ( CR-BEAD ) problem and model it as a constrained optimization problem. Next, we propose an optimal approach (named BEAD-O ) based on integer programming to find optimal solutions to small-scale CR-BEAD problems. We also propose a greedy approach named BEAD-G with a constant approximation ratio of $1 - 1/e$ to solve large-scale CR-BEAD problems efficiently. Extensive experimental evaluation against three representative approaches illustrates the effectiveness and efficiency of our approaches.

11 June 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
LZLU ZHAO
LU ZHAO
WTWenan Tan
Wenan Tan
BLBo Li
Bo Li
QHQiang He
Qiang He
LHLi Huang
Li Huang
YYYun Yang
Yun Yang
Mobile-edge computing (MEC), as an emerging computing paradigm, allows app vendors to deploy their mobile and/or IoT applications on edge servers to deliver low-latency services to their app users. However, when an edge server needs to serve excessive app users concurrently, severe interference is incurred, which immediately reduces app users’ achievable data rates and, consequently, impacts their perceived service quality. This is a major challenge to the app vendor’s attempt to minimize the edge resources required for serving its app users with a satisfactory service quality. To tackle this challenge, in this article, we present and formulate this multiple edge application deployment (MEAD) problem in the MEC environment, aiming to maximize app users’ overall service quality at minimum deployment cost, considering application shareability and communication interference. We prove that the MEAD problem is $\mathcal {NP}$ -hard. Then, we propose a heuristic approach, namely, the deployment-priority greedy via the divide-and-conquer strategy (DPG-D&C), to solve the MEAD problem effectively and efficiently. We evaluate our approach extensively by using a widely used real-world data set. The experimental results show that DPG-D&C significantly outperforms state-of-the-art approaches.

25 March 2014 in Systems Research and Behavioral Science
Verified
Journal Article
Closed access
PDF file
WTWenan Tan
Wenan Tan
SCSenbo Chen
Senbo Chen
JLJingxian Li
Jingxian Li
LLLingxia Li
Lingxia Li
TWTong Wang
Tong Wang
XHXiaoming Hu
Xiaoming Hu

18 March 2024 in Computation
Verified
Journal Article
Open access
PDF file
Deepanjal ShresthaDeepanjal Shrestha
Deepanjal Shrestha
WTWenan Tan
Wenan Tan
DSDeepmala Shrestha
Deepmala Shrestha
NRNeesha Rajkarnikar
Neesha Rajkarnikar
SJSeung Ryul Jeong
Seung Ryul Jeong
This study introduces a data-driven and machine-learning approach to design a personalized tourist recommendation system for Nepal. It examines key tourist attributes, such as demographics, behaviors, preferences, and satisfaction, to develop four sub-models for data collection and machine learning. A structured survey is conducted with 2400 international and domestic tourists, featuring 28 major questions and 125 variables. The data are preprocessed, and significant features are extracted to enhance the accuracy and efficiency of the machine-learning models. These models are evaluated using metrics such as accuracy, precision, recall, F-score, ROC, and lift curves. A comprehensive database for Pokhara City, Nepal, is developed from various sources that includes attributes such as location, cost, popularity, rating, ranking, and trend. The machine-learning models provide intermediate categorical recommendations, which are further mapped using a personalized recommender algorithm. This algorithm makes decisions based on weights assigned to each decision attribute to make the final recommendations. The system’s performance is compared with other popular recommender systems implemented by TripAdvisor, Google Maps, the Nepal tourism website, and others. It is found that the proposed system surpasses existing ones, offering more accurate and optimized recommendations to visitors in Pokhara. This study is a pioneering one and holds significant implications for the tourism industry and the governing sector of Nepal in enhancing the overall tourism business.