Jie Wu - Selected Publications#
Dr. Wu has published extensively in his research areas with 5 books and over 900 referred papers, including many Best Paper Awards. His Google H-Index is 106 with a total of over 45,200 citations. In global ranking site research.com of top 1,000 computer science scientists, he is ranked 118th in the world and 73rd in the U.S.
Q. Liu, G. Wang, F. Li, S. Yang, and J. Wu, “Preserving privacy with probabilistic indistinguishability in weighted social networks”, IEEE Transactions on Parallel and Distributed Systems, 28 (5), 1417-1429, 2016.
Principle author – All authors were Dr. Wu’s Ph.D. students, except the second author who was a visiting scholar. As social networks often contain sensitive information about individuals, preserving privacy when publishing social graphs becomes an important issue. A key privacy property, probabilistic indistinguishability, is proposed in this paper, together with a heuristic indistinguishable group anonymization (HIGA) scheme to anonymize a weighted social graph with such a property. The paper was published in IEEE Transactions on Parallel and Distributed Systems, an IEEE Computer Society premier journal with an impact factor of 2.6. The paper has been cited by many top IEEE and ACM transactions. (Google citation 129).
W. Jiang, G. Wang, M. Z. A. Bhuiyan, and J. Wu, “Understanding graph-based trust evaluation in online social networks: Methodologies and challenges”, ACM Computing Surveys, 49 (1), 1-35, 2016.
Principle author – The first author was Dr. Wu’s joint Ph.D. student. The second and third authors were a visiting scholar and a post-doctoral fellow, respectively. This paper gives a comprehensive survey of graph-based trust evaluation models in OSNs. The paper first summarizes the features of OSNs and the properties of trust. Then, the paper comparatively reviews two categories of graph-simplification-based and graph-analogy-based approaches and discusses their individual problems and challenges. Finally, the common challenges of all graph-based models are given. The paper was published in ACM Computing Surveys, an ACM premier journal with a high impact factor of 7.99. The paper has been cited by many top journals. (Google citation 164).
M. Xiao, J. Wu, L. Huang, R. Cheng, and Y. Wang, “Online task assignment for crowdsensing in predictable mobile social networks”, IEEE Transactions on Mobile Computing, 16 (8), 2306-2320, Aug. 2016.
Principle author – The first author was a visiting scholar under Dr. Wu’s supervision. In this paper, makespan-sensitive task assignment problems for crowdsensing in mobile social networks are considered, where the mobility model is predictable and the time of sending tasks and recycling results is non-negligible. To solve these problems, an Average makespan-sensitive Online Task Assignment (AOTA) algorithm and the Largest makespan-sensitive Online Task Assignment (LOTA) algorithm were proposed with a good competitive ratio. The paper was published in IEEE Transactions on Mobile Computing, an IEEE Computer Society premier journal with a high impact factor of 5.11. The paper has been cited by many top IEEE and ACM transactions. (Google citation 118).
J. Wu and Y. Wang, “Social feature-based multi-path routing in delay tolerant networks”, 2012 Proceedings IEEE INFOCOM, 1368-1376, 2012.
First author - Dr. Wu and his Ph.D. student proposed using the internal social features of nodes in human contact networks (a special type of SNs) to perform the routing process. In social networks, people tend to contact others more frequently if they have similar social features (e.g., race and profession), and based on this social phenomenon, Dr. Wu converted a routing problem from a highly mobile and unstructured contact space to a static and structured hypercube-like feature space for simple and controllable multiple-copy dissemination. This paper has been cited by many top research groups in the delay-tolerant network community. INFOCOM is the flag-ship conference in IEEE ComSoc. Based on Guide2Research, INFOCOM has an impact score of 10.72, is ranked 17 among all conferences in computer science, and is ranked 2nd in the field of networks and communications. (Google citation 170).
E. Wang, Y. Yang, J. Wu, W. Liu, and X. Wang, “An Efficient Prediction-based User Recruitment for Mobile Crowdsensing,” IEEE Transactions on Mobile Computing, 17 (1), 16-28, 2017.
Principle author – The first author was Dr. Wu’s visiting Ph.D. student and visiting professor later. This paper, supervised by Dr. Wu, deals with mobile crowdsensing in which a group of mobile users exploit their smart devices to cooperatively perform a large-scale sensing job. An efficient Prediction-based User Recruitment for mobile crowdsEnsing (PURE) that meets the given objective with guaranteed performance is given together with several extensions. The paper was published in one of top IEEE transactions. It was cited in several important surveys of the research field, including one appeared in IEEE Communications Surveys & Tutorials. (Google citation: 104)
G. Wang, Q. Liu, and J. Wu, "Hierarchical Attribute-Based Encryption for Fine-Grained Access Control in Cloud Computing," 2010 ACM Proceedings of CCS, 735-737, 2010.
Principle author – The first author was a visiting scholar under the supervision of Dr. Wu, and the second author is a joint Ph.D. student of Dr. Wu. This paper deals with keeping sensitive user data confidential against the untrusted cloud system. A novel hierarchical attribute-based encryption system is proposed to support fine-grained access control as well as to provide high performance, full delegation, and scalability. This is done by first combining the hierarchical identity-based encryption system and the ciphertext-policy attribute-based encryption (CP-ABE) system, then making a performance-expressivity tradeoff, and finally applying proxy re-encryption and lazy re-encryption to our scheme. This paper was widely cited in the security and cloud computing fields worldwide and by industrial research groups from Intel, Google, and Cisco. ACM CCS is a top conference in computer security. Based on Guide2Research, CCS has an impact score of 12.54, is ranked 12 among all conferences in computer science, and is ranked 1st in the field of networks and communications. (Google Citation 856).
E. Luo, M. Z. A. Bhuiyan, G. Wang, M. A. Rahman, J. Wu, and M. Atiquzzaman, “PrivacyProtector: Privacy-protected patient data collection in IoT-based healthcare systems”, IEEE Communications Magazine, 56 (2), 163-168, 2018.
Coauthor – The contacting author was Dr. Wu's post-doctoral fellow. In this paper, the challenges with privacy-protected data collection were first reviewed. Then, a practical framework called PrivacyProtector, a patient privacy-protected data collection with the objective of preventing these types of attacks, was proposed. PrivacyProtector includes the ideas of secret sharing and share repairing (in case of data loss or compromise) for patients' data privacy. A distributed database consisting of multiple cloud servers is used, which ensures that the privacy of patients' personal data can remain protected if one of the servers remains uncompromised. This paper was published in IEEE Communications Magazine with a very high impact factor of 11.06. (Google citation 170).
J. Wu and F. Fai, “A generic distributed broadcast scheme in ad hoc wireless networks”, IEEE Transactions on Computers, 53 (10), 1343-1354, Oct. 2004.
First author – Co-author was Dr. Wu’s Ph.D. student. This innovative work applied a connected dominating set for efficient broadcasting in wireless networks to ensure full coverage without excessive relays that may cause message collisions. Specifically, Dr. Wu and his student proposed a set of rules to construct a virtual backbone scheduler (VBS). VBS can potentially form multiple overlapped backbones that work alternatively to prolong the network lifetime. The paper was published in IEEE Transactions on Computers (TC), which is a premier journal in the computer field with a high impact factor of 3.13. This result and its applications have been used in different applications by many prominent research groups in the field, including Cornell, Stony Brook, UVa, UC Santa Cruz, UCLA, and HKUST, as well as by leading telecommunication corporations such as Microsoft, Motorola, and Nokia. (Google citation 250).
J. Wu, “A fault-tolerant and deadlock-free routing protocol in 2D meshes based on odd-even turn model”, IEEE Transactions on Computers, 52 (9), 1154-1169, Sept. 2003.
Single author – Dr. Wu proposed a deterministic fault-tolerant and deadlock-free routing protocol in two-dimensional (2D) meshes based on dimension-order routing and the odd-even turn model. The proposed protocol, called extended X-Y routing, does not use any virtual channels by prohibiting certain locations of faults and destinations. This paper has been widely cited in NoC and multi-core design communities in papers that appeared in top conferences in computer systems such as ISCA and HPCA and by researchers from all over the world: US, Germany, France, Spain, Finland, Sweden, Demark, China, Taiwan, and Japan. (Google citation 267).
J. Wu and H. Li, “On calculating connected dominating set for efficient routing in ad hoc wireless networks”, Proc. of the 3rd Int’l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, in conjunction with ACM MobiCom, 1999.
First author – Dr. Wu and his student proposed the notation of local solution and used it to construct a connected dominating set (CDS) for efficient communication in wireless sensor networks (WSNs). The main idea behind the local solution is to ensure global properties (in this case, node domination and global connectivity) by using local information only without propagation. This pioneering work inspired many other researchers to study clustering and backbone formation in wireless networks and mobile computing, including groups from ETH Zurich, the University of Minnesota, Stanford, and MIT. (Google citation 1,530).
