Part Ⅰ: Selected Journal Papers (Guangzhou University, SCI Indexed, ESI Category for Computer Science, "*" denotes corresponding author.)
No. Paper Download the Paper from Publisher Download the Paper Here Abstract in English Abstract in Chinese Remark
36 Qiang Zhang, Qin Liu, and Guojun Wang*, "PRMS: A Personalized Mobile Search over Encrypted Outsourced Data," IEEE ACCESS, 6, 31541 – 31552, June 2018. DOI: https://doi.org/10.1109/ACCESS.2018.2845468 Download At present, searchable encryption is a very promising direction in the field of cloud computing. However, most existing works focus on keyword-based search schemes and regardless of personalized search needs, a keyword-based search does not take into account the user's location information and cannot exactly match users' search intentions. Since location information is very important in mobile searches, we propose a personalized mobile search (PRMS) over encrypted outsourced data, and we convert the user's location information into distance information to generate the user location model, forming a location query matrix with user location information. The matrix is then used to encrypt the user's location query and conceal the location information in the location query matrix. In this paper, we combine a user's interest preference and location information in personalized searches over encrypted outsourced data, adopt the law of universal gravitation to calculate scores of files in the cloud, and return the first K results with the highest gravitational forces. For the first time, we propose a PRMS-improvement scheme that is applied to an encryption method to build the content index and location index, which can greatly reduce the time for model construction. Through the PRMS scheme, we realized personalized mobile searches based on user's interests and location information. 目前,可搜索加密是云计算领域非常有前途的方向。然而,大多数现有方案都侧重于基于关键字的搜索而忽视了个性化搜索需求,基于关键字的搜索既不考虑用户的位置信息,也不能完全匹配用户的搜索意图。由于位置信息在移动搜索中非常重要,我们提出了一种对加密外包数据进行个性化移动搜索(PRMS)的方案,并将用户的位置信息转换为距离信息以生成用户位置模型,形成具有用户位置信息的位置查询矩阵。然后,使用矩阵加密用户的位置查询并将位置信息隐藏在位置查询矩阵中。本文中,在加密外包数据的个性化搜索方案中,我们将用户的兴趣偏好和位置信息进行了有机的结合,采用万有引力定律计算云中文件的分数,并返回具有最高引力的前K个结果。我们首次提出了一种PRMS_improvement方案,该方案使用了新的加密方法来构建内容索引和位置索引,这可以大大减少模型构建的时间。通过PRMS方案,我们实现了基于用户兴趣和位置信息的个性化移动搜索。 [SCI&EI检索,IF: 3.244, JCR 1区, 计算机科学]
35 Shaobo Zhang, Guojun Wang*, Md Zakirul Alam Bhuiyan and Qin Liu, “A dual privacy preserving scheme in continuous location-based services,” IEEE Internet of Things Journal, June 2018. DOI: https://doi.org/10.1109/JIOT.2018.2842470 Download With the development of wireless communication and positioning technology, location-based services (LBSs) have been gaining tremendous popularity, due to its ability to greatly facilitate the people’s daily lives. Meanwhile, it also entails the risk of location privacy disclosure. To address this issue, general solutions introduce a single trusted anonymizer between the users and the location service provider (LSP). However, a single anonymizer offers limited privacy guarantees and incurs high communication overhead in continuous LBSs. Once the anonymizer is compromised, it may put the user information in jeopardy. In this paper, we propose a dual privacy preserving (DPP) scheme in continuous LBSs to protect the users’ trajectory and query privacy. Our scheme introduces multiple anonymizers between the users and LSP, and combines with Shamir threshold mechanism, dynamic pseudonym mechanism and K-anonymity technology to improve the users’ trajectory and content privacy in continuous LBSs. An anonymizer alone cannot get the users’ trajectory and query contents, and it thus can be semi-trusted. Our scheme can enhance the users’ privacy and effectively solve the single point of failure in single anonymizer structure. At the same time, the query authentication can guarantee the correctness of the query results. The analysis and simulation results demonstrate that the proposed scheme has the ability to protect users’ trajectory and content privacy effectively, and to reduce the computation and communication overhead of the single anonymizer. 提出了一种保护用户轨迹和内容的双隐私保护方案。针对单匿名器结构中存在的隐私风险和性能瓶颈问题,通过在用户和LSP之间部署多个匿名器,结合Shamir门限、动态假名和k匿名技术,使单个匿名器不能获得用户的轨迹和查询内容,并有效解决单匿名器结构中的单点失效和性能瓶颈问题,同时采用查询验证机制确保用户查询结果的正确性。分析和实验结果显示,该方案能有效保护用户的轨迹和查询内容隐私,并减少单个匿名器的开销。 [SCI&EI检索, IF:7.596, JCR 1区,计算机科学]
34 Karim Alinani, Annadil Alinani, Dua Hussain Narejo, and Guojun Wang*, "Aggregating Author Profiles from Multiple Publisher Networks to Build a List of Potential Collaborators," IEEE ACCESS, 6, 20298 – 20308, April 2018. DOI: https://doi.org/10.1109/ACCESS.2018.2823720 Download Recommender systems have roots in numerous fields, and their use is widespread in the modern world. The scientific community is striving to enhance the quality of life by breaking innovative barriers and developing solutions that had never previously been considered. In an ideal world, an individual researcher would participate in various fields of research and make cumulative impactful contributions to benefit society. However, in reality, this goal is difficult to attain without a team of collaborators. Collaboration refers to the information of partnerships that bring uniquely talented researchers together around a common idea. However, efforts to seek such co-authors not only are challenging but also occasionally yield no significant results. In this paper, we propose a recommender system to aggregate author information from multiple publisher networks. It evaluates the trustworthiness of the author recommendations based on the impact of the authors' contributions and the recency and popularity of their work as well as the correlations among these factors. On this basis, the system generates a list of prospective collaborators who might be of interest to a given researcher. TBD [SCI&EI检索,IF: 3.244, JCR 1区, 计算机科学]
33 Wenyin Yang, Guojun Wang*, Kim-Kwang Raymond Chood, and Shuhong Chen, "HEPart: A balanced hypergraph partitioning algorithm for big data applications," Future Generation Computer Systems, 83: 250-268, June 2018. DOI: https://doi.org/10.1016/j.future.2018.01.009 Download Minimizing the query cost among multi-hosts is important to data processing for big data applications. Hypergraph is good at modelling data and data relationships of complex networks, the typical big data applications, by representing multi-way relationships or interactions as hyperedges. Hypergraph partitioning (HP) helps to partition the query loads on several hosts, enabling the horizontal scaling of large-scale networks. Existing heuristic HP algorithms are generally vertex hypergraph partitioning, designed to minimize the number of cut hyperedges while satisfying the balance requirements of part weights regarding vertices. However, since workloads are mainly produced by group operations, minimizing query costs landing on hyperedges and balancing the workloads should be the objectives in horizontal scaling. We thus propose a heuristic hyperedge partitioning algorithm, HEPart. Specifically, HEPart directly partitions the hypergraph into K sub-hypergraphs with a minimum cutsize for vertices, while satisfying the balance constraint on hyperedge weights, based on the effective move of hyperedges. The performance of HEPart is evaluated using several complex network datasets modeled by undirected hypergraphs, under different cutsize metrics. The partitioning quality of HEPart is then compared with alternative hyperedge partitioners and vertex hypergraph partitioning algorithms. The experimental findings demonstrate the utility of HEPart (e.g. low cut cost while keeping load balancing as required, especially over scale-free networks). 提出了一种启发式超图划分算法(HEPart)以实现超图的直接k路划分。算法以超边的高效移动为基本操作,在满足超边权重平衡约束条件下实现最小顶点切割值的超图超边划分。经过对若干个复杂网络数据集实施无向超图建模后应用该算法进行超图划分,划分结果对比分析发现,HEPart的划分质量高于基于超边交换的超图超边划分算法和传统的超图顶点划分算法,尤其是在无标度网络数据集上优势更加明显。 [SCI&EI检索,IF: 3.997, JCR 1区, 计算机科学]
32 Yinglong Dai and Guojun Wang*, "Analyzing Tongue Images Using a Conceptual Alignment Deep Autoencoder," IEEE ACCESS, 6: 5962-5972, March 2018. DOI: https://doi.org/10.1109/ACCESS.2017.2788849 Download Artificial intelligence can learn some concepts by analyzing sensory data similar to humans. This paper explores how artificial neural networks (ANNs) can learn abstract concepts by analyzing tongue images based on concepts from traditional Chinese medicine (TCM), which is a discipline that relies heavily on practitioner experience. A computer-aided method will be investigated that analyzes sensory data for TCM practitioners. This paper proposes capitalizing on deep learning techniques. A method called the conceptual alignment deep autoencoder (CADAE) is proposed to analyze tongue images that represent different body constitution (BC) types, which are the underlying concepts in TCM. In the first step, CADAE encodes the images to a representation space; in the second step, it decodes the patterns. The experiments demonstrate that CADAE can learn effective representations of abstract concepts aligned with BC types by encoding the tongue images. Furthermore, the representation space of the hidden conceptual neurons can be visualized by a decoder network. The experiments also demonstrate that ANNs acquire different data perspectives when different loss functions are used for training. Numerous representation spaces of ANNs remain to be explored. To some extent, our exploration demonstrates that artificial intelligence (AI) has the ability to learn some concepts in a manner similar to human beings. Based on this ability, AI shows promise in helping humans form new effective concepts that can facilitate medical development and alleviate the burdens of medical practitioners. 提出了一种概念对齐深度自编码网络(CADAE)用于分析舌部图像,能够将高维度的图像数据映射到低维度的与人类概念相关的表示空间,并且能够从低维度的表示空间解码还原为可视化图像。在一定程度上,本文展示了人工智能有能力以类似人类的方式学习到一些概念,人工智能也很有希望通过大量数据的分析来辅助人类学习到一些有效的概念。本文的方法可以用于高维度数据的表示学习,以及应用于基于概念特征组合的模拟实体生成。 [SCI&EI检索,IF: 3.244, JCR 1区, 计算机科学]
31 Yinglong Dai, Guojun Wang* and Kuan-Ching Li, "Conceptual alignment deep neural networks," Journal of Intelligent & Fuzzy Systems, 34(3): 1631-1642, March 2018. DOI: https://doi.org/10.3233/JIFS-169457 Download Deep Neural Networks (DNNs) have powerful recognition abilities to classify different objects. Although the models of DNNs can reach very high accuracy even beyond human level, they are regarded as black boxes that are absent of interpretability. In the training process of DNNs, abstract features can be automatically extracted from high-dimensional data, such as images. However, the extracted features are usually mapped into a representation space that is not aligned with human knowledge. In some cases, the interpretability is necessary, e.g. medical diagnoses. For the purpose of aligning the representation space with human knowledge, this paper proposes a kind of DNNs, termed as Conceptual Alignment Deep Neural Networks (CADNNs), which can produce interpretable representations in the hidden layers. In CADNNs, some hidden neurons are selected as conceptual neurons to extract the human-formed concepts, while other hidden neurons, called free neurons, can be trained freely. All hidden neurons will contribute to the final classification results. Experiments demonstrate that the CADNNs can keep up with the accuracy of DNNs, even though CADNNs have extra constraints of conceptual neurons. Experiments also reveal that the free neurons could learn some concepts aligned with human knowledge in some cases. 提出了一种概念对齐深度神经网络(CADNN),将人类形成的层次化概念融入到深度神经网络的隐藏层神经单元中,用于改善深度神经网络模型的可解释性。CADNN在fashion-MNIST数据集中进行了测试,表明其虽然加上了额外的概念神经元的限制,依然能够达到没有限制的深度神经网络的准确度;实验还揭示了自由的隐藏神经元在某些情况下也能够学到与人类概念类似的表示。 [SCI&EI检索,IF: 1.261, JCR 3区, 计算机科学]
30 Sancheng Peng, Guojun Wang*, Yongmei Zhou, Cong Wan, Cong Wang, Shui Yu, and Jianwei Niu, "An Immunization Framework for Social Networks through Big Data Based Influence Modeling," IEEE Transactions on Dependable and Secure Computing, PP(99): 1-1, July 2017. DOI: https://doi.org/10.1109/TDSC.2017.2731844 Download Social networks are critical in terms of information or malware propagation. However, how to contain the spreading of malware in social networks is still an open and challenging issue. In this paper, we propose a novel defending method through big data based influence modeling. We first establish a social interaction graph based on big data sets of the studied object. Based on the graph, we are able to measure direct influence of individuals by computing each node’s strength, which includes the degree of the node and the total number of messages sent by each user to her friends. Then, we design an algorithm to construct influence spreading tree using the breadth first search strategy, and measure indirect influence of individuals by traversing the tree. We identify the top k influential nodes among all the nodes via the social influence strength, and propose an immunization algorithm to defend social networks against various attacks. The extensive experiments show that influence can spread easily in social networks, and the greater the influence of initial spread node is, the more impact it is on the malware propagation in social networks. The proposed method provides an effective solution to the prevention of malware or malicious messages propagation in social networks. 提出了一种社交网络中基于影响力建模的免疫框架,该框架首先采用社交大数据构建社交关系图,并使用该图以测量节点的直接影响力;然后,采用广度优先搜索算法以构建节点的影响力传播树,并通过该树来测量节点的间接影响力;根据节点影响力的大小以挑选影响力最大的前k个节点,并将这些节点进行免疫以确保社交网络免遭恶意程序的攻击。 [SCI&EI检索,IF: 2.926,CCF A类, JCR 1区, 计算机科学]
29 Shaobo Zhang, Kim-Kwang Raymond Choo, Qin Liu, and Guojun Wang*, "Enhancing Privacy through Uniform Grid and Caching in Location-based Services," Future Generation Computer Systems, 86: 881-892, September 2018. DOI: http://dx.doi.org/10.1016/j.future.2017.06.022 Download With the increasing popularity of location-based services (LBSs), there is a corresponding increase in the potential for location privacy leakage. Existing solutions generally introduce a fully-trusted third party between the users and the location service provider (LSP). However, such an approach offers limited privacy guarantees and incurs high communication overhead. Specifically, once a fully-trusted third party is compromised, user information would likely be exposed. In this paper, we propose a solution designed to enhance location privacy in LBSs. Our scheme is based on the uniform grid, and adopts both order- preserving symmetric encryption (OPSE) and k-anonymity technique. Thus, the anonymizer knows noth- ing about a user’s real location, and it can only implement simple matching and comparison operations. In our approach, we also employ an entity (hereafter referred to as the converter) to transform the user- defined grid structure into the uniform grid structure. This combined with the caching mechanism, allow us to avoid repeated queries from different users on the same query spatial region and consequently, reduce the overhead of the LBS server. The analysis and simulation results demonstrate that our proposal can effectively preserve a user’s location privacy, with reduced overheads at the anonymizer and the LBS server. 提出了一种基于统一网格和缓存加强用户位置隐私的保护方案。针对基于可信第三方中心服务器结构存在的不足,提出通过统一网格和缓存来加强用户位置隐私。该方法利用保序对称加密、K-匿名技术,并结合统一的网格和缓存技术,中间匿名器不知道用户的具体位置,且它不需要完全可信,加强了用户位置的隐私保护。分析和实验表明该方法能有效保护用户的位置隐私,并能减少匿名器和LBS服务器的开销。 [SCI&EI检索,IF: 3.997, CCF C类, JCR 1区, 计算机科学]
28 Shaobo Zhang, Guojun Wang*, Qin Liu, and Jemal H. Abawajy, "A Trajectory Privacy-Preserving Scheme based on Query Exchange in Mobile Social Networks," Soft Computing, June 2017. DOI: https://dx.doi.org/10.1007/s00500-017-2676-6 Download With the increase in the number of active location- based service (LBS) users, protecting the privacy of user trajectory has become a significant concern. In this paper, we propose a deviation-based query exchange (DQE) scheme that obfuscates the users’ query point to mitigate trajectory disclosure in mobile social networks (MSNs). The user finds a best matching user (BMU) in an MSN to exchange queries when a query request is issued. The DQE scheme can pre- vent the attacker from reconstructing the user’s trajectory by collecting data from the LBS server which records only the user’s ID and his BMUs’ locations (fake locations). By virtue of the private matching algorithm based on the matrix confusion, the DQE scheme allows LBS users to enjoy the service while preserving their privacy. In order to test the effectiveness and efficiency of the proposed scheme, we car- ried out extensive security and performance analyses under various conditions. The results of the experiments show that the proposed DQE scheme can protect users’ trajectory pri- vacy effectively and reduce the overhead of the LBS server. 提出了一种基于代理转发机制的轨迹隐私保护方案。针对连续查询中K匿名不能满足用户轨迹隐私保护的需求,提出通过在移动社交网络中寻找最匹配的用户做代理,并由代理转发用户的请求到LBS服务器进行查询,使LBS服务器不能将查询请求信息与用户真实身份进行关联,攻击者也不能通过LBS服务器中数据推断出用户的真实轨迹。理论分析和实验结果显示,AFM能有效保护用户的轨迹隐私,同时相对K-匿名它能减小LBS服务器开销。 [SCI&EI检索,IF: 2.472, CCF C类, JCR 2区, 计算机科学]
27 Feng Wang, Wenjun Jiang, Xiaolin Li, and Guojun Wang*, "Maximizing Positive Influence Spread in Online Social Networks via Fluid Dynamics," Future Generation Computer Systems, 86: 1491-1502, September 2018. DOI: http://dx.doi.org/10.1016/j.future.2017.05.050 Download In online social networks, many application problems can be generalized as influence maximization problem, which targets at finding the top-k influential users. Most of the existing influence spread models ignore user’s attitude and interaction and cannot model the dynamic influence process. We propose a novel influence spread model called Fluidspread, using the fluid dynamics theory to reveal the time- evolving influence spread process. In this paper, we model the influence spread process as the fluid update process in three dimensions: the fluid height difference, the fluid temperature and the temperature difference. To the best of our knowledge, this is first attempt of using the fluid dynamics theory in this field. Moreover, we formulate the Maximizing Positive Influenced Users (MPIU) problem and design the Fluidspread greedy algorithm to solve it. Through the experimental results, we demonstrate the effectiveness and efficiency of our Fluidspread model and Fluidspread greedy algorithm. 设计了一个基于流体动力学的影响力传播模型Fluidspread,该模型利用流体动力学理论较好地展现了影响力传播的动态过程。模型中利用流体系统中流体运动过程中的流体高度差、流体温度以及流体温度差等数据,对影响力传播过程进行建模。并且本文针对该模型提出了用户积极影响力最大化问题,并给出相应的解决方案。最后通过真实数据集上的实验,对模型和算法的有效性进行了验证。 [SCI&EI检索,IF: 3.997, CCF C类, JCR 1区, 计算机科学]
26 Tian Wang, Yang Li, Guojun Wang*, Jiannong Cao, Md Zakirul Alam Bhuiyan, Weijia Jia, "Sustainable and Efficient Data Collection from WSNs to Cloud," IEEE Transactions on Sustainable Computing, PP(99): 1-1, March 2017. DOI: https://dx.doi.org/10.1109/TSUSC.2017.2690301 Download The development of cloud computing pours great vitality into traditional wireless sensor networks (WSNs). The integration of WSNs and cloud computing has received a lot of attention from both academia and industry. However, collecting data from WSNs to cloud is not sustainable. Due to the weak communication ability of WSNs, uploading big sensed data to the cloud within the limited time becomes a bottleneck. Moreover, the limited power of sensor usually results in a short lifetime of WSNs. To solve these problems, we propose to use multiple mobile sinks (MSs) to help with data collection. We formulate a new problem which focuses on collecting data from WSNs to cloud within a limited time and this problem is proved to be NP-hard. To reduce the delivery latency caused by unreasonable task allocation, a time adaptive schedule algorithm (TASA) for data collection via multiple MSs is designed, with several provable properties. In TASA, a non-overlapping and adjustable trajectory is projected for each MS. In addition, a minimum cost spanning tree (MST) based routing method is designed to save the transmission cost. We conduct extensive simulations to evaluate the performance of the proposed algorithm. The results show that the TASA can collect the data from WSNs to Cloud within the limited latency and optimize the energy consumption, which makes the sensor-cloud sustainable. 提出了一种从无线传感器网络到云端持续高效的数据收集算法TASA。该算法采用多个移动汇聚节点协助无线传感器网络进行数据收集,既可以延长无线传感器网络的生命周期又可以增强无线传感器网络的通信能力。另外,该时间自适应算法很好地降低了不合理的任务分配造成的交付延迟问题。在TASA中,为每一个移动汇聚节点设计一个非重叠和可调整的轨道,并且设计了最小成本生成树MST路由算法减少传输成本。 [SCI&EI检索,IF: 2.456]
25 Qin Liu, Yuhong Guo, Jie Wu, Guojun Wang*,"Effective Query Grouping Strategy in Clouds," Journal of Computer Science and Technology, 32(6): 1231-1249, December 2017. DOI: https://doi.org/10.1007/s11390-017-1797-9 Download As the demand for the development of cloud computing grows, more and more organizations have outsourced their data and query services to the cloud for cost-saving and flexibility. Suppose an organization that has a great number of users querying the cloud-deployed multiple proxy servers to achieve cost efficiency and load balancing. Given n queries, each of which is expressed as several keywords, and k proxy servers, the problem to be solved is how to classify n queries into k groups, in order to minimize the difference between each group and the number of distinct keywords in all groups. Since this problem is NP-hard, it is solved in mathematic and heuristic ways. Mathematic grouping uses a local optimization method, and heuristic grouping is based on k-means. Specifically, two extensions are provided: the first one focuses on robustness, i.e., each user obtains search results even if some proxy servers fail; the second one focuses on benefit, i.e., each user can retrieve as many files as possible that may be of interest without increasing the sum. Extensive evaluations have been conducted on both a synthetic dataset and real query traces to verify the effectiveness of our strategies. 提出了云计算环境下有效的查询分组策略。该策略从负载均衡和查询开销两个方面考虑,同时采用数学方式和启发式算法来设计查询分组策略,使得云端产生的开销能够最小化的同时,平衡每个查询服务器的通信开销和计算开销。同时,从结果鲁棒性和用户收益两个方向进行扩展查询策略,使得用户及时在查询服务器失效的情况下,尽可能多地取回自己感兴趣的数据。 [SCI&EI检索,IF: 0.956, CCF B类, JCR 3区, 计算机科学]
24 Md Zakirul Alam Bhuiyan, Guojun Wang*, Jie Wu, Jiannong Cao, Xuefeng Liu, and Tian Wang, "Dependable Structural Health Monitoring Using Wireless Sensor Networks," IEEE Transactions on Dependable and Secure Computing, 14(4): 363-376, August 2017. DOI: https://doi.org/10.1109/TDSC.2015.2469655 Download As an alternative to current wired-based networks, wireless sensor networks (WSNs) are becoming an increasingly compelling platform for engineering structural health monitoring (SHM) due to relatively low-cost, easy installation, and so forth. However, there is still an unaddressed challenge: the application-specific dependability in terms of sensor fault detection and tolerance. The dependability is also affected by a reduction on the quality of monitoring when mitigating WSN constrains (e.g., limited energy, narrow bandwidth). We address these by designing a dependable distributed WSN framework for SHM (called DependSHM) and then examining its ability to cope with sensor faults and constraints. We find evidence that faulty sensors can corrupt results of a health event (e.g., damage) in a structural system without being detected. More specifically, we bring attention to an undiscovered yet interesting fact, i.e., the real measured signals introduced by one or more faulty sensors may cause an undamaged location to be identified as damaged (false positive) or a damaged location as undamaged (false negative) diagnosis. This can be caused by faults in sensor bonding, precision degradation, amplification gain, bias, drift, noise, and so forth. In DependSHM, we present a distributed automated algorithm to detect such types of faults, and we offer an online signal reconstruction algorithm to recover from the wrong diagnosis. Through comprehensive simulations and a WSN prototype system implementation, we evaluate the effectiveness of DependSHM. 设计了一个可靠的分布式无线传感器网络的结构框架DependSHM。该框架能够应对传感器故障和资源受限的情况。该框架注意到一个尚未发现但有趣的事实,即,由一个或多个故障传感器引入的实际测量信号可能导致未损坏的位置被识别为损坏(假阳性)或损坏的位置为未损坏(假阴性)诊断。这可能是由于传感器连接中的故障、精度退化、放大增益、偏置、漂移、噪声等原因引起的。提出了一个分布式的自动算法来检测这种类型的故障,并提供了一个在线的信号重建算法从错误诊断恢复。通过全面的模拟和无线传感器网络的原型系统实现评估了框架的有效性。 [SCI&EI检索,IF: 2.926,CCF A类, JCR 1区, 计算机科学,ESI高被引论文(记录时间:2018年1月)]
23 Ziran Peng, Guojun Wang*, Huabin Jiang, Shuangwu Meng, "Research and Improvement of ECG Compression Algorithm based on EZW," Computer Methods and Programs in Biomedicine, 145: 157-166, July 2017. DOI: https://doi.org/10.1016/j.cmpb.2017.04.015 Download Embedded zerotree wavelet (EZW) is an efficient compression method that has advantages in coding, but its multilayer structure information coding reduces signal compression ratio. This paper studies the optimization of the EZW compression algorithm and aims to improve it. First, we used lifting wavelet transformation to process electrocardiograph (ECG) signals, focusing on the lifting algorithm. Second, we utilized the EZW compression coding algorithm, through the ECG information decomposition to deter- mine the feature detection value. Then, according to the feature information, we weighted the wavelet coefficients of ECG (through the coefficient as a measure of weight) to achieve the goal of improved compression benefit. 提出了一种基于嵌入式零树小波(EZW)高效压缩方法。首先,利用提升小波变换对心电信号进行处理。其次,通过对心电信号进行小波分解确定ECG特征值,然后根据特征信息对心电信号的小波系数进行加权处理(通过系数作为权重的度量),达到提高压缩效果的目的。实验结果表明,在不影响影响信号有效性的前提下,新的ECG压缩算法压缩比要比传统EZW算法提高25%。 [SCI&EI检索,IF: 2.503, JCR 2区, 计算机科学]
22 Wenyin Yang, Guojun Wang*, Md Zakirul Alam Bhuiyan, and Kim-Kwang Raymond Choo, "Hypergraph Partitioning for Social Networks Based on Information Entropy Modularity," Journal of Network and Computer Applications, 86: 59-71, May 2017. DOI: https://doi.org/10.1016/j.jnca.2016.10.002 Download A social network is a typical scale-free network with power-law degree distribution characteristics. It demonstrates several natural imbalanced clusters when it is abstracted as a graph, and expands quickly under its generative mechanism. Hypergraph is superior for modeling multi-user operations in social networks, and partitioning the hypergraph modeled social networks could ease the scaling problems. However, today's popular hypergraph partitioning tools are not sufficiently scalable; thus, unable to achieve high partitioning quality for naturally imbalanced datasets. Recently proposed hypergraph partitioner, hyperpart, replaces the balance constraint with an entropy constraint to achieve high-fidelity partitioning solutions, but it is not tailored for scale-free networks, like social networks. In order to achieve scalable and high quality partitioning results for hypergraph modeled social networks, we propose a partitioning method, EQHyperpart, which utilizes information-Entropy-based modularity Q value (EQ) to direct the hypergraph partitioning process. This EQ considers power-law degree distribution while describing the “natural” structure of scale-free networks. We then apply simulated annealing and introduce a new definition of hyperedge cut, micro cut, to avoid the local minima in convergence of partitioning, developing EQHyperpart into two specific partitioners, namely: EQHyperpart-SA and EQHyperpart-MC. Finally, we evaluate the utility of our proposed method using classical social network datasets, including Facebook dataset. Findings show that EQHyperpart partitioners are more scalable than competing approaches, achieving a tradeoff between modularity retaining and cut size minimizing under balance constraints, and an auto-tradeoff without balance constraints for hypergraph modeled social networks. 提出了在社交网络中基于信息熵模块度的超图划分算法。该算法使用一种能够体现无标度网络特征的信息熵来引导社会网络的数据划分。该信息熵利用了顶点的度分布,反映出网络系统的能量分布。由于熵的分布规则与顶点度分布的相一致,我们使用基于信息熵计算得到的模块度Q值来描绘无标度网络的社团结构,再以此来引导最小割超图划分的划分过程,生成高保真的划分结果,并且信息熵的统计特征可以克服划分结果不稳定的缺点。实验和分析表明,该算法可应用于如社交网络这类复杂网络的划分,兼顾了负载均衡、划分代价最小且模块度值最大这三个目标,具有较强的可扩展性。 [SCI&EI检索,IF: 3.5,CCF C类, JCR 1区, 计算机科学]
21 Qin Liu, Guojun Wang*, Feng Li, Shuhui Yang, and Jie Wu, "Preserving Privacy with Probabilistic Indistinguishability in Weighted Social Networks," IEEE Transactions on Parallel and Distributed Systems, 28(5): 1417-1429, May 2017. DOI: https://doi.org/10.1109/TPDS.2016.2615020 Download The increasing popularity of social networks has inspired recent research to explore social graphs for marketing and data mining. As social networks often contain sensitive information about individuals, preserving privacy when publishing social graphs becomes an important issue. In this paper, we consider the identity disclosure problem in releasing weighted social graphs. We identify weighted 1*-neighborhood attacks, which assume that an attacker has knowledge about not only a target’s one-hop neighbors and connections between them (1-neighborhood graph), but also related node degrees and edge weights. With this information, an attacker may re-identify a target with high confidence, even if any node’s 1-neighborhood graph is isomorphic with k 1 other nodes’ graphs. To counter this attack while preserving high utility of the published graph, we define a key privacy property, probabilistic indistinguishability, and propose a heuristic indistinguishable group anonymization (HIGA) scheme to anonymize a weighted social graph with such a property. Extensive experiments on both real and synthetic data sets illustrate the effectiveness and efficiency of the proposed scheme. 提出了一种社会网络数据的安全发布方案。提出了节点之间概率不可区分的概念,设计了一个启发式算法更好地抵抗1-neighborhood攻击。启发式算法首先将满足某些条件的节点进行分组,使得每个分组的节点至少为k个。然后,利用随机漫步(Random Walk)测试一个分组内的节点的1-neighborhood图是否匹配,对于不匹配的节点,利用启发式匿名算法将两个节点图做相似处理。最后,利用一定概率p随机修改每个节点的1-neighborhood图。通过对真实社会数据(Arxiv ASTRO-PH collaboration network)进行实验,验证了方案的有效性和可行性。 [SCI&EI检索,IF: 4.181, CCF A类, JCR 1区, 计算机科学]
20 Ziran Peng, Guojun Wang*, "An Optimal Energy-Saving Real-Time Task-Scheduling Algorithm for Mobile Terminals," International Journal of Distributed Sensor Networks, 13(5), 12 pages, May 2017. DOI: https://doi.org/10.1177/1550147717707891 Download This article discusses the principles, mechanisms, and strategy of hard real-time task scheduling appropriate for mobile terminal equipment. Mobile terminals have timeliness requirements for completing hard real-time tasks and also clear energy-management requirements. Therefore, this study attempts to schedule tasks under these two constraints to achieve an optimal level of energy savings. First, terminal equipment operating time and standby time should meet the maximum requirements, and second, all tasks should meet the constraints of real-time parallel scheduling. We propose a scheduling strategy based on grouping according to the latest cut-off time, with each group adopting a dynamic optimiza- tion strategy to make scheduling decisions. The feasibility and validity of this algorithm are demonstrated through experi- ments and simulations. 提出了一种新的心电图(ECG)特征自动分析检测方法。首先基于小波变换提取特征信号的频率分量,然后利用能量积分处理对信号特征进行定位。其次建立心肌膜动作电位方程模型,并将ECG特征值代入模型经过线性回归分析估算出心肌膜的电位特征值。实验结果表明,心电图特征的识别准确率超过99.27%,与心脏疾病如心肌衰竭的准确率超过86.7%。/span> [SCI&EI检索,IF: 1.239, JCR 3区, 计算机科学]
19 Md Zakirul Alam Bhuiyan, Jie Wu, Guojun Wang*, Tian Wang, and Mehedi Hassan, "e-Sampling: Event-Sensitive Autonomous Adaptive Sensing and Low-cost Monitoring in Networked Sensing Systems," ACM Transactions on Autonomous and Adaptive Systems, 12(1): Article 1, 29 pages, March 2017. DOI: http://doi.acm.org/10.1145/2994150 Download Sampling rate adaptation is a critical issue in many resource-constrained networked systems, including wireless sensor networks (WSNs). Existing algorithms are primarily employed to detect events such as ob- jects or physical changes at a high, low, or fixed frequency sampling usually adapted by a central unit or a sink, therefore requiring additional resource usage. Additionally, this algorithm potentially makes a net- work unable to capture a dynamic change or event of interest, which therefore affects monitoring quality. This paper studies the problem of a fully autonomous adaptive sampling regarding the presence of a change or event. We propose a novel scheme, termed “event-sensitive adaptive sampling and low-cost monitoring (e-Sampling)” by addressing the problem in two stages, which leads to reduced resource usage (e.g., energy, radio bandwidth). First, e-Sampling provides the embedded algorithm to adaptive sampling that automat- ically switches between high- and low-frequency intervals to reduce the resource usage, while minimizing false negative detections. Second, by analyzing the frequency content, e-Sampling presents an event identi- fication algorithm suitable for decentralized computing in resource-constrained networks. In the absence of an event, the “uninteresting” data is not transmitted to the sink. Thus, the energy cost is further reduced. e-Sampling can be useful in a broad-range of applications. We apply e-Sampling to structural health mon- itoring (SHM) and fire event monitoring (FEM), which are typical applications of high frequency events. Evaluation via both simulations and experiments validates the advantages of e-Sampling in low-cost event monitoring, and in effectively expanding the capacity of WSNs for high data rate applications. 提出了一个新的事件敏感自适应采样和低开销监控框架(e-Sampling)。该框架通过两个阶段来解决问题,从而降低资源的使用(例如,能源,无线带宽)。首先,提供嵌入式算法进行自适应采样从而自动在高低频之间切换,以减少资源的使用,同时最大限度地减少假阴性的检测。其次,通过分析频率内容,提出了一种事件识别算法来适应资源受限的网络中的分布式计算。在没有事件的情况下,无用的数据不会传输到接收器,因此,能源成本进一步降低。通过仿真和实验验证了低开销事件监测的优势以及高数据速率应用中WSN的扩展能力。 [SCI&EI检索,IF: 2.133,CCF B类, JCR 2区, 计算机科学]
18 Tao Peng, Qin Liu, Dacheng Meng, and Guojun Wang*, "Collaborative Trajectory Privacy Preserving Scheme in Location-based Services," Information Sciences, 387: 165-179, May 2017. DOI: https://doi.org/10.1016/j.ins.2016.08.010 Download Location-based services (LBSs) have been gaining considerable popularity and are becom- ing the fastest growing activity-related services that people use in their daily life. While users benefit from LBSs, the collection and analysis of participators’ location data and tra- jectory information may jeopardize their privacy. Existing proposals focus mostly on snap- shot queries. However, privacy preservation in continuous LBSs is more challenging than in snapshot queries because adversaries could use the spatial and temporal correlations on the user trajectory to infer the user’s private information. In this paper, we propose the collaborative trajectory privacy preserving (CTPP) scheme for continuous queries, in which trajectory privacy is guaranteed by caching-aware collaboration between users, without the need for any fully trusted entities. The main idea of our scheme is to obfuscate the actual trajectory of a user by issuing fake queries to confuse the LBS adversary. We first present a multi-hop caching-aware cloaking algorithm to collect valuable information from multi- hop peers based on collaborative caching. Then, we describe a collaborative privacy pre- serving querying algorithm that issues a fake query to confuse the location service provider (LSP). Extensive experimental results verify the effectiveness and efficiency of our scheme in terms of processing time and communication cost. 提出了一种基于用户合作的轨迹隐私保护方法(Collaborative Trajectory Privacy Preserving,CTPP)。针对位置服务中的用户轨迹隐私,通过向移动用户周围多跳邻居搜寻有价值的信息构造匿名区域,并发布假查询以扰乱真实轨迹中的查询时间和变换查询区域位置,使得攻击者很难重构用户轨迹。( [SCI&EI检索,IF:4.832, CCF B类, JCR 1区, 计算机科学]
17 Shuhong Chen, Guojun Wang*, Guofeng Yan, Dongqing Xie, "Multi-dimensional Fuzzy Trust Evaluation for Mobile Social Networks based on Dynamic Community Structures," Concurrency and Computation: Practice and Experience, 29(7): 1-22, April 2017. DOI: https://doi.org/10.1002/cpe.3901 Download As mobile social networks (MSNs) are booming and gaining tremendous popularity, there have been an increasing number of communications and interactions among users. Taking this advantage, users in MSNs make decisions via collecting and combining trust information from different users. Hence, trust evalua- tion technology has become a key requirement for network security in MSNs. In such MSNs, however, the community/group structures are dynamically changing, and users may belong to multiple communi- ties/groups. Therefore, trust evaluation plays a critical role in inferring trustworthy contacts among users. In this paper, an innovative trust inference model is proposed for MSNs, in which multiple dimensional trust metrics are incorporated to reflect the complexity of trust. To infer trust relations between users in MSNs with complex communities, we first construct dynamic implicit social behavioral graphs (DynISBG) based on dynamic complex community/group structures and propose an efficient detection algorithm for DynISBG under fuzzy degree . We then present a multi-dimensional fuzzy trust inferring approach that involves four metrics, that is, static attribute trust factor, dynamic behavioral trust factor, long-term trust evolution fac- tor, and recommendation-based trust opinion. Moreover, to obtain the recommendation-based trust opinion about indirect connected users, we discuss the trust aggregation and propagation along trust path. Finally, we evaluate the performance of our novel approach with simulations. The results show that, compared with the existing approaches, the proposed model provides a more detailed analysis in trust evaluation with higher accuracy. 提出了一个综合多维度信任评价的移动社会网信任推导模型。基于复杂动态社会结构,构建动态隐式社会行为图(DynISBG),并提出模糊度Kappa下的DynISBG检测算法。提出了一个多维模糊信任推导方法,其中包括四个指标,即静态属性信任因子,动态行为信任因子,信任演化因子和基于推荐的信任评价因子。此外,为了获得基于推荐的间接信任评价,提出了基于信任路径的信任汇聚和信任传递机制。实验结果表明,与现有的方法相比,该模型提供了更详细的分析,具有更高的信任评估精度。 [SCI&EI检索,IF: 1.133, CCF C类, JCR 3区, 计算机科学]
16 Qin Liu, Guojun Wang*, Xuhui Liu, Tao Peng, and Jie Wu, "Achieving Reliable and Secure Services in Cloud Computing Environments," Computers and Electrical Engineering, 59: 153-164, April 2017. DOI: https://doi.org/10.1016/j.compeleceng.2016.10.005 Download In cloud computing environments, resources stored on the cloud servers are transmitted in the form of data flow to the clients via networks. Due to the real-time and ubiquitous re- quirements of cloud computing services, how to design a sophisticated transmission model to ensure service reliability and security becomes a key problem. In this paper, we first propose a Comprehensive Transmission (CT) model, by combining the Client/Server (C/S) mode and the Peer-to-Peer (P2P) mode for reliable data transmission. Then, we design a Two-Phase Resource Sharing (TPRS) protocol, which mainly consists of a pre-filtering phase and a verification phase, to efficiently and privately achieve authorized resource sharing in the CT model. Extensive experiments have been conducted on the synthetic data set to verify the feasibility of our protocol. 提出了综合传输模型(CT)和两阶段资源共享方案(TPRS)。CT模型结合了C/S模型和P2P模型的优势,一方面可以避免服务器成为性能瓶颈,另一方面可以提高服务的可靠性。同时,为了实现P2P传输模式下的资源安全共享,TPRS协议通过预删除过程和验证过程使得用户能够在不泄露自己隐私的情况下找到自己所需资源。 [SCI&EI检索,IF:1.57, JCR 3区, 计算机科学]
15 Entao Luo, Qin Liu, Jemal H. Abawajy, and Guojun Wang*, "Privacy-Preserving Multi-Hop Profile-Matching Protocol for Proximity Mobile Social Networks," Future Generation Computer Systems, 68: 222-223, March 2017. DOI: https://doi.org/10.1016/j.future.2016.09.013 Download Proximity-based mobile social networks (PMSNs) enable users to easily discover and foster social interactions with others through user-profile matching. The user profiles in PMSNs contain sensitive personal information and an occasional leak will violate people’s privacy. Hence, it is a major concern. In this paper, we propose a privacy-preserving multi-hop profile-matching protocol for PMSNs. The proposed protocol allows users to customize their own matching preference and to make the matching results more precise. Unlike the state-of-the-art profile matching approaches that focus only within a single-hop, the proposed approach makes profile matching within several hops. Moreover, analysis of the security and performance indicates that the proposed protocol achieves secure and privacy-preserving friend discovery with higher efficiency. It executes in less time and consumes less energy than other related protocols. 基于近邻的移动社交网络(PMSNs)使用户能够通过用户配置的匹配,轻松发现和促进与他人的社交互动。PMSNs中的用户资料包含敏感的个人信息,偶尔泄露会侵犯个人隐私。因此,这是一个主要问题。本文提出了一种保护PMSNs隐私的多跳profile匹配协议。该协议允许用户自定义自己的匹配偏好,并使匹配结果更加精确。不像最先进的配置文件匹配方法只集中在单跳内,所提出的方法在几个跳内进行配置文件匹配。对安全性和性能的分析表明,所提出的协议能够以更高的效率实现安全、隐私保护的朋友发现。与其他相关协议相比,它执行的时间更短,消耗的能量也更少。 [SCI&EI检索,IF: 3.997,CCF C类, JCR 1区, 计算机科学]
14 Feng Wang, Jianbin Li*, Wenjun Jiang, and Guojun Wang*, "Temporal Topic-Based Multi-Dimensional Social Influence Evaluation in Online Social Networks," Wireless Personal Communications, 95(3): 2143-2171, February 2017. DOI: https://doi.org/10.1007/s11277-017-4047-0 Download Analytical applications in online social networks can be generalized as the influence evaluation problem, which targets at finding most influential users. Nowadays social influence evaluation is still an open and challenging issue. Most influence evaluation models focus on the single dimensional evaluation factor but fail to research on the multi- dimensional factors. In this paper, we propose a novel influence evaluation model: the temporal topic influence (TTI) evaluation model, which is a time-aware, content-aware and structure-aware evaluation model. For the aim of multi-dimensional evaluation, we incorporate multi-dimensional measure factors into our model, including the time factor, the topological information and the topic distribution information, etc. We propose a novel concept of user gravitational ability which is inspired by Newton’s law of universal gravitation. It can integrate multi-dimensional factors in an appropriate way. Our experi- ments are conducted on the Sina Weibo data set. Through the experimental analysis, we prove TTI model can calculate users’ influences effectively and efficiently. The TTI model can distinguish the value of users’ influences. And the TTI model identifies the top-k influential users with higher quality. We also validate the effect of time and topic measure factors in the influence evaluation process. 提出了一个时间、内容和网络结构多方面感知的用户影响力度量模型。该模型旨在同时考虑多个维度的度量因素来对用户影响力进行度量分析,包括时间、拓扑结构和主题分布等等。并提出一种新型方法来对用户的多维度度量数据进行融合统一。最后通过实验验证表明,该模型能更好地区分用户的影响力,并能更好地识别出top-k高影响力用户。同时该模型验证了时间和主题度量因素在影响力度量过程中的重要作用。 [SCI&EI检索,IF: 0.951, JCR 4区, 计算机科学]
13 Sancheng Peng, Guojun Wang*, and Dongqing Xie, "Social Influence Analysis in Social Networking Big Data: Opportunities and Challenges," IEEE Network, 33(1): 11-17, January 2017. DOI: https://doi.org/10.1109/MNET.2016.1500104NM Download Social influence analysis has become one of the most important technologies in modern information and service industries. It will de nite- ly become an essential mechanism to perform complex analysis in social networking big data. It is attracting an increasing amount of research ranging from popular topics extraction to social influence analysis, including analysis and pro- cessing of big data, social influence evaluation, influential users identification, and information diffusion modeling. We provide a comprehen- sive investigation of social in uence analysis, and discuss the characteristics of social in uence and the architecture of social in uence analysis based on social networking big data. The relationship between big data and social influence analysis is also discussed. In addition, research challeng- es relevant to real-world issues based on social networking big data in social influence analysis are discussed, focusing on research issues such as scalability, data collection, dynamic evolution, causal relationships, network heterogeneity, eval- uation metrics, and effective mechanisms. Our goal is to provide a broad research guideline of existing and ongoing efforts via social influence analysis in large-scale social networks, and to help researchers better understand the existing work, and design new algorithms and methods for social in uence analysis. 提出了一种针对社会影响力分析的研究框架。该框架分析社会影响力的特点,给出基于社会网络大数据的社会影响力分析机制,讨论大数据与社会影响力分析的关系;另外,分析基于社会网络大数据的社会影响力分析研究所面临的挑战,主要包括:可扩展性、数据收集、动态演化、因果关系、异构网络、评价指标以及有效的机制等挑战。本框架有助于为研究人员进一步理解现有的工作和设计新的面向社会影响力分析算法。 [SCI&EI检索,IF:7.23, JCR 1区, 计算机科学]
12 Tao Peng, Qin Liu, and Guojun Wang*, "A Multilevel Access Control Scheme for Data Security in Transparent Computing," IEEE Computing in Science and Engineering, 19(1): 46-53, January/February 2017. DOI: https://doi.org/10.1109/MCSE.2017.13 Download The Multilevel Access Control Scheme in Transparent Computing (MACTC) can protect user data by providing different security levels, while offering multilevel access control and valid identity authentication. The proposed scheme is effective in multilevel data security, exible in authorized resource sharing, and secure against various malicious attacks. 提出了透明计算环境下多安全级别的访问控制方法(The Multilevel Access Control Scheme in Transparent 设计了一个基于无线传感器网络的建筑体健康事件监测信息物理系统,并提出了一个新的基于模型的网内决策支持框架MODEM。该框架针对通用的事件监测结构利用传感器节点进行感知并对复杂事件进行简单的本地决策。针对工程建筑中大型物理建筑由一系列子建筑结构组成这一现象,该框架将无线传感器节点进行分组并利用组内的最终决策来独立处理建筑体子结构中的事件监测问题。该框架是分布式的,并能够达到与原始的基于有线的监测架构相近的监测质量,与以往的监测模型相比,该框架中数据传输和计算的能耗更小。该框架的有效性通过模拟实验和真实实验进行了证实。Computing,MACTC)。利用透明计算跨平台的特点,结合身份认证方法实现不同安全级别数据访问控制。在认证服务器上引入多项式的方法动态地管理不同安全级别数据的访问控制及授权用户的更改和撤销。 [SCI&EI检索,IF: 2.074, JCR 2区, 计算机科学]
11 Entao Luo, Qin Liu, Guojun Wang*, "Hierarchical Multi-authority and Attribute-based Encryption Friend Discovery Scheme in Mobile Social Networks," IEEE Communications Letters, 20(9): 1772-1775, June 2016. DOI: https://doi.org/10.1109/LCOMM.2016.2584614 Download In mobile social networks, to guarantee the secu- rity and privacy in the friend discovery process, we propose a hierarchical multi-authority and attribute-based encryption (ABE) friend discovery scheme based on ciphertext-policy (CP)- ABE. It employs character attribute subsets to achieve flexible fine-grained access control, which solves the problem of single- point failure and performance bottleneck. Performance analysis demonstrates the superiority of our scheme in terms of system initialization time and key generation time. 在移动社交网络中,针对朋友发现过程中存在的安全和隐私保护问题,用户将带访问策略的加密数据应用到多权限好友发现系统中,通过属性子集设计的灵活的细粒度访问控制,实现了分层的多权限CP-ABE (HMCP-ABE)支持。该方案不仅解决了单点故障和性能瓶颈问题,而且解决了智能终端不依赖授权中心的权限和应用场景的局限性问题。 [SCI&EI检索,IF:1.988, JCR 2区, 计算机科学]
10 Li Li, Wang Yang, Md. Zakirul Alam Bhuiyan, Guojun Wang, "Unsupervised Learning of Indoor Localization based on Received Signal Strength," Wireless Communications and Mobile Computing, 16(15): 2225-2237, May 2016. DOI: https://doi.org/10.1002/wcm.2678 Download Most indoor wireless sensor network localization methods require costly site surveys to collect fingerprint information for later comparison. Moreover, due to the dynamic nature of fingerprint information in indoor wireless environments, the need for site surveys may be ongoing. In this work, indoor localization is addressed with an unsupervised learning algorithm. Our novel algorithm based on received signal strength combines the information conveyed by both range-based and range-free localization with state-of-art optimization techniques. A specially designed hierarchical Bayesian hidden Markov model coupled with a particle filter helps mitigate non-line-of-sight and multipath errors. This grid-based data sample process, derived from the theory of Dirichlet processes, simplifies the global optimization problem of unsupervised learning by employing a single initial hyper-parameter. Meanwhile, for obtaining accurate coordinates of mobile nodes, a unique semidefinite programming method is used to provide feedback to the radio propagation model. This feedback step can enable the grid-based algorithms not only to establish the coordinates of a mobile node, but also to optimize the accuracy iteratively. Theoretical and experimental analyses indicate that the proposed algorithm can achieve better localization accuracy than conventional range-based algorithms without adding computation cost. 提出了一种混合使用rang-based算法和无监督学习算法解决无线网络室内定位问题的新算法。比较了rang-free算法、rang-based算法和无监督学习算法三种算 法的优缺点。针对无监督学习的局部优化问题,利用Dirichlet分布改进求解算法。另外针对无监督学习算法的实时定位问题,使用PF算法避免模型中状态长间隔依赖的问题。利用了基于核密度估计的计算方法,用于计算数据与位置变量的似然概率。对于混合模型中的层次贝叶斯隐马尔科夫模型,用合理的参数设计和函数选择满足了将聚类方法, 迭代方法,rang-based方法,核密度方法,运动模型,概率模型嵌入到同一个模型中的任务,设计了Gibbs采样算法进行推导求解。为更好地将无监督学习方法的结果反馈到rang-based算法,以让rang-free算法的定位结果和无监督学习算法的定位结果差距最小为优化目标,建立了一种最大似然估计模型,并将其转化为二阶锥规划问题,进而转化为半正定规划,运用启发式算法进行求解。通过实验,验证了算法的有效性和可行性。 [SCI&EI检索,IF: 1.899, CCF C, JCR 2区, 计算机科学]
9 Wenjun Jiang, and Guojun Wang*, Md Zakirul Alam Bhuiyan, and Jie Wu, "Understanding Graph-based Trust Evaluation in Online Social Networks: Methodologies and Challenges," ACM Computing Surveys, 49(1), Article 10, May 2016. DOI: http://doi.acm.org/10.1145/2906151 Download Online social networks (OSNs) are becoming a popular method of meeting people and keeping in touch with friends. OSNs resort to trust evaluation models and algorithms, as to improve service qualities and enhance user experiences. Much research has been done to evaluate trust and predict the trustworthiness of a target, usually from the view of a source. Graph-based approaches make up a major portion of the existing works, in which the trust value is calculated through a trusted graph (or trusted network, web of trust, multiple trust chains). In this paper, we focus on graph-based trust evaluation models in OSNs, particularly in computer science literature. We first summarize the features of OSNs and the properties of trust. Then, we comparatively review two categories of graph-simplification based and graph-analogy based approaches, and discuss their individual problems and challenges. We also analyze the common challenges of all graph-based models. To provide an integrated view of trust evaluation, we conduct a brief review of its pre-and-post processes, i.e., the preparation and the validation of trust models, including information collection, performance evaluation, and related applications. Finally, we identify some open challenges that all trust models are facing. 提出了基于图论的在线社会网络信任模型、技术及挑战综述。研究了300余篇社交网络信任评价模型、推荐模型与算法等方面的代表性文献,总结提炼基于图论的信任模型,将其分为基于图简化和基于图类比两种方式。总结对比每种方式的技术特点和面临的挑战。另外,对数据获取、模型性能评估、相关应用等,做了详尽的总结凝练。 [SCI&EI检索,IF:6.748, JCR 1区, 计算机科学]
8 Li Li, Wang Yang, and Guojun Wang, "Intelligent Fusion of Information Derived from Received Signal Strength and Inertial Measurements for Indoor Wireless Localization," AEU-International Journal of Electronics and Communications, 70(9): 1105-1113, April 2016. DOI: https://doi.org/10.1016/j.aeue.2016.04.017 Download In this paper, we focus on improving the accuracy of wireless localization in wireless sensor networks using information derived from the inertial measurement unit (IMU) in a smartphone and the received signal strength (RSS). We propose an algorithm to relate the RSSs and measurements obtained from the IMU to the coordinates of an indoor robot. To deal with the dynamic nature of fingerprint information in an indoor radio environment, we first use the hierarchical Bayesian hidden Markov model (HB-HMM) to process a time series of RSSs. Unlike other HMM-based methods, the HB-HMM depends only on a single initial hyper-parameter for global optimization. Next, we evaluate the measurements obtained from the IMU to identify the robot’s state, which includes the rotating, moving, and bumping states. We used the IMU accelerometers to estimate the velocity. Lastly, a method based on the particle filter (PF) was used to fuse the results obtained from RSS and IMU. Experiments show that our algorithm can achieve better accuracy than related algorithms. 提出了一种混合模型与基于PF算法的总体框架用于解决室内移动机器人定位问题。分析了物联网定位系统的设计原则及目 标;整合智能手机的惯性导航单元的磁力计和陀螺仪、加速度计等测量数据,与无线传感器网络的RSS信号融合,具体分析了混合模型和PF算法所实现的功能,并对算法用实验进行了对比验证,证明了算法的有效性。 [SCI&EI检索, IF: 1.147, JCR 4区, 计算机科学]
7 Zheng Ma, Jin Zheng, Weijia Jia, Guojun Wang*, "An Efficient Spatial Query Processing Algorithm in Multi-sink Wireless Sensor Networks," International Journal of Sensor Networks, 22(4): 274-282, April 2016. DOI: https://doi.org/10.1504/IJSNET.2016.10001243 Download In order to address the problem of energy and time-efficient execution of spatial queries in multi-sink wireless sensor networks, an efficient hybrid spatial query processing algorithm (EHSQP) is proposed in this paper. In EHSQP, sink nodes perform the sector selection for the query region and seek the query route to a query region using the known infrastructure information. Sensor nodes can adjust the query dissemination and reversing route for query results based on the available local information. To minimise the energy consumption and the response time, the proposed EHSQP algorithm ensures that only the relevant nodes are involved in the query execution. Experimental results show that the proposed algorithm reduces communication cost significantly, and saves energy and time very effectively for the connected sensors in the given region. The proposed technique has an advantage over other techniques in terms of energy and time-efficient query cover with lower communication cost. TBD [SCI&EI检索,IF: 0.635, JCR 4区, 计算机科学]
6 Shui Yu, Guojun Wang, and Wanlei Zhou, "Modeling Malicious Activities in Cyber Space," IEEE Network, 29(6): 83-87, December 2015. DOI: https://doi.org/10.1109/MNET.2015.7340429 Download Cyber attacks are an unfortunate part of society as an increasing amount of critical infrastructure is managed and controlled via the Internet. In order to protect legit- imate users, it is critical for us to obtain an accurate and timely understanding of our cyber opponents. However, at the moment we lack effective tools to do this. In this article we summarize the work on modeling malicious activities from various perspectives, discuss the pros and cons of current models, and present promising directions for possible efforts in the near future. 介绍了网络空间的现状,提出了可能存在的攻击以及深入分析网络组成部分。针对目前缺少有效的工具检测这些网络攻击,从多个角度分析总结现有的一些关于恶意攻击建模的工作,并进一步讨论该领域所面临的一些挑战和机遇。同时,僵尸网络作为目前典型的恶意网络,本文主要讨论了与其相关的恶意活动,并分析针对该攻击的一些方案的可行性。 [SCI&EI检索,IF:7.23, JCR 1区, 计算机科学]
5 Tian Wang, Yiqiao Cai, Weijia Jia, Sheng Wen, Guojun Wang, Hui Tian, Yonghong Chen, and Bineng Zhong, "Maximizing Real-time Streaming Services based on A Multi-servers Networking Framework," Computer Networks, 93(1): 199-212, December 2015. DOI: https://doi.org/10.1016/j.comnet.2015.10.019 Download In recent years, we have witnessed substantial exploitation of real-time streaming applica- tions, such as video surveillance system on road crosses of a city. So far, real world applica- tions mainly rely on the traditional well-known client–server and peer-to-peer schemes as the fundamental mechanism for communication. However, due to the limited resources on each terminal device in the applications, these two schemes cannot well leverage the process- ing capability between the source and destination of the video traffic, which leads to limited streaming services. For this reason, many QoS sensitive application cannot be supported in the real world. In this paper, we are motivated to address this problem by proposing a novel multi- server based framework. In this framework, multiple servers collaborate with each other to form a virtual server (also called cloud-server), and provide high-quality services such as real- time streams delivery and storage. Based on this framework, we further introduce a (1 − ε) approximation algorithm to solve the NP-complete “maximum services” (MS) problem with the intention of handling large number of streaming flows originated by networks and max- imizing the total number of services. Moreover, in order to backup the streaming data for later retrieval, based on the framework, an algorithm is proposed to implement backups and maximize streaming flows simultaneously. We conduct a series of experiments based on sim- ulations to evaluate the performance of the newly proposed framework. We also compare our scheme to several traditional solutions. The results suggest that our proposed scheme signifi- cantly outperforms the traditional solutions. 提出了一种多服务框架和一些算法。多服务框架解决的问题是“在流媒体服务中,由于终端设备资源有限,现有模式不能充分利用源和目的之间设备的处理能力,使得一些服务质量QoS敏感型应用不能很好地工作”。在该框架中,将多个服务虚拟成一个云服务,很好地提供传输和存储任务。(1−)近似算法解决了最大化服务MS这个NP难问题,能处理网络中产生的大量数据流并且最大化整个服务的数量。另外,提出了一种算法解决备份和最大化同步数据流问题。 [SCI&EI检索,IF: 2.516,CCF B类, JCR 1区, 计算机科学]
4 Zhenyu Zhou, Mianxiong Dong, Kaoru Ota, Guojun Wang, and Laurence Yang, "Energy-Efficient Resource Allocation for D2D Communications Underlaying Cloud-RAN based LTE-A Networks," IEEE Internet of Things Journal, 3(3): 428-438, November 2015. DOI: https://doi.org/10.1109/JIOT.2015.2497712 Download Device-to-device (D2D) communication is a key enabler to facilitate the realization of the Internet of Things (IoT). In this paper, we study the deployment of D2D communications as an underlay to long-term evolution-advanced (LTE-A) net- works based on novel architectures such as cloud radio access network (C-RAN). The challenge is that both energy efficiency (EE) and quality of service (QoS) are severely degraded by the strong intracell and intercell interference due to dense deploy- ment and spectrum reuse. To tackle this problem, we propose an energy-efficient resource allocation algorithm through joint chan- nel selection and power allocation design. The proposed algorithm has a hybrid structure that exploits the hybrid architecture of C-RAN: distributed remote radio heads (RRHs) and centralized baseband unit (BBU) pool. The distributed resource allocation problem is modeled as a noncooperative game, and each player optimizes its EE individually with the aid of distributed RRHs. We transform the nonconvex optimization problem into a con- vex one by applying constraint relaxation and nonlinear fractional programming. We propose a centralized interference mitigation algorithm to improve the QoS performance. The centralized algo- rithm consists of an interference cancellation technique and a transmission power constraint optimization technique, both of which are carried out in the centralized BBU pool. The achievable performance of the proposed algorithm is analyzed through simu- lations, and the implementation issues and complexity analysis are discussed in detail. 提出了一种利用联合信道选择和功率分配设计的高效的资源分配算法。该算法利用了混合体系架构C-RAN:分布式远程射频头(RRH)和集中式基带单元(BBU)池。将分布式资源分配问题模拟为一个非合作博弈,每个参与者在分布式RRH的帮助下分别优化能量效率(EE)。通过应用约束松弛和非线性分数规划,将非凸优化问题转化为凸优化问题。同时,为了提高服务质量,提出了一种集中式干扰抑制算法(QoS)。该算法由干扰取消技术和传输功率约束优化技术组成,二者均在集中式BBU池中进行。 [SCI&EI检索,IF: 7.596, JCR 1区, 计算机科学,ESI高被引论文(记录时间:2018年1月)]
3 Xiaofei Xing, Dongqing Xie, and Guojun Wang, "Energy-Balanced Data Gathering and Aggregating in WSNs: A Compressed Sensing Scheme," International Journal of Distributed Sensor Networks, 2015: 1-10, January 2015. DOI: https://doi.org/10.1155/2015/585191 Download Compressed sensing (CS) is an emerging sampling technique by which the data sampling and aggregating can be done simultaneously, which can be applied to many elds, including data processing in wireless sensor networks (WSNs). In WSNs, data aggregating can reduce data transmission cost and improve energy e ciency. Existing CS-based data gathering work in WSNs utilizes the centralized method to process the data by a sink node, which causes the load imbalance and “coverage hole” problems, and so forth. In this paper, we propose an energy-balanced data gathering and aggregating (EDGA) scheme that integrates a clustering hierarchical structure with the CS to optimize and balance the amount of data transmitted. We also design a data reconstruction algorithm to perform data recovery tasks by utilizing the orthogonal matching pursuit theory, which helps to reconstruct the original data accurately and e ectively at sink node. e advantages of the proposed scheme compared with other state-of-the-art related methods are measured on the metrics of data recovery ratio and energy e ciency. We implement our scheme on a simulation platform using a real dataset from Intel lab. Simulation results demonstrate that the proposed data gathering and aggregating scheme guarantees accurate data reconstruction performance and obtains energy e ciency signi cantly compared to existing methods. 提出了一个基于压缩感知理论的数据采集和数据融合算法,在确保数据质量的同时有效降低网络节点的数据通信量。 [SCI&EI检索,IF: 1.239, JCR 3区, 计算机科学]
2 Xiaofei Xing, Guojun Wang*, Jie Li, "Collaborative Target Tracking in Wireless Sensor Networks, "Ad Hoc & Sensor Wireless Networks, 23(1/2): 117-135, October 2014. DOI: http://www.oldcitypublishing.com/journals/ahswn-home/ahswn-issue-contents/ahswn-volume-23-number-1-2-2014/ahswn-23-1-2-p-117-135/ Download Target tracking is a killer application in wireless sensor networks. A lot of work has been done to improve the localization and tracking algo- rithms with smart sensors. However, achieving a high tracking accuracy with energy efficiency is challenging. In this paper, we propose a col- laborative target tracking (CTT) scheme that enables accurate tracking with a binary detection model. In this scheme, all sensors in the moni- toring field are divided into clusters using a clustering algorithm. This scheme consists of three parts: (i) A tracking node group near the tar- get is first constructed when the distance weights of the sensors meet the requirements of tracking accuracy; (ii) A tracking group is updated dynamically with the moving of the target; (iii) A tracking group pre- dicts the target trajectory and adjusts the frequency of data reporting according to the target’s velocity. Extensive simulation results show that our scheme achieves high performance in terms of tracking accuracy and energy efficiency under different settings. 提出了一个基于分簇模型的目标跟踪方案,节点根据目标速度自适应调整数据报告频率,提高了目标跟踪的精度。 [SCI&EI检索,IF: 1.034, JCR 4区, 计算机科学]
1 Jin Zheng, Md Zakirul Alam Bhuiyan, Shaohua Liang, Xiaofei Xing, and Guojun Wang*, "Auction-Based Adaptive Sensor Activation Algorithm for Target Tracking in Wireless Sensor Networks," Future Generation Computer Systems, 39: 88-99, October 2014. DOI: https://doi.org/10.1016/j.future.2013.12.014 Download Due to the severe resource constraints in wireless sensor networks (WSNs), designing an efficient target tracking algorithm for WSNs in terms of energy efficiency and high tracking quality becomes a challenging issue. WSNs usually provide centralized information, e.g., the locations and directions of a target, choosing sensors around the target, etc. However, some ready strategies may not be used directly because of high communication costs to get the responses for tracking tasks from a central server and low quality of tracking. In this paper, we propose a fully distributed algorithm, an auction-based adaptive sensor activation algorithm (AASA), for target tracking in WSNs. Clusters are formed ahead of the target movements in an interesting way where the process of cluster formation is due to a predicted region (PR) and cluster members are chosen from the PR via an auction mechanism. On the basis of PR calculation, only the nodes in the PR are activated and the rest of the nodes remain in the sleeping state. To make a trade-off between energy efficiency and tracking quality, the radius of PR and the number of nodes are adaptively adjusted according to current tracking quality. Instead of fixed interval (usually used in existing work), tracking interval is also dynamically adapted. Extensive simulation results, compared to existing work, show that AASA achieves high performance in terms of quality of tracking, energy efficiency, and network lifetime. 提出了一个基于审计策略的目标跟踪方案,解决了传感器网络目标过早丢失问 题。 [SCI&EI检索,IF: 3.997, CCF C类, JCR 1区, 计算机科学]
Part Ⅱ: Selected Journal Papers (Guangzhou University, SCI Indexed, ESI Category for NON-Computer Science, including "ENGINEERING", "BIOLOGY & BIOCHEMISTRY", etc, "*" denotes corresponding author.)
No. Paper Download the Paper from Publisher Remark
6 Yinglong Dai and Guojun Wang*, "A Deep Inference Learning Framework for Healthcare," Accepted to appear in Pattern Recognition Letters, February 2018. DOI: https://doi.org/10.1016/j.patrec.2018.02.009 [SCI&EI检索,IF: 1.995, CCF C类, JCR 2区, 工程学]
5 Tian Wang, Jiyuan Zhou, Xinlei Chen, Guojun Wang*, Anfeng Liu, and Yang Liu, "A Three-Layer Privacy Preserving Cloud Storage Scheme Based on Computational Intelligence in Fog Computing," IEEE Transactions on Emerging Topics in Computational Intelligence, 2(1): 3-12, January 2018. DOI: https://doi.org/10.1109/TETCI.2017.2764109 TBD
4 Md Zakirul Alam Bhuiyan, Jie Wu, Guojun Wang*, Zhigang Chen, Jianer Chen, Tian Wang, "Quality-Guaranteed Event-Sensitive Data Collection and Monitoring in Vibration Sensor Networks," IEEE Transactions on Industrial Informatics, 13(2): 572-583, April 2017. DOI: https://doi.org/10.1109/TII.2017.2665463 [SCI&EI检索,IF: 6.764, JCR 1区, 工程学]
3 Md Zakirul Alam Bhuiyan, Jie Wu, Guojun Wang*, and Jiannong Cao, "Sensing and Decision Making in Cyber-Physical Systems: The Case of Structural Event Monitoring," IEEE Transactions on Industrial Informatics, 12(6): 2103-2114, December 2016. DOI: https://doi.org/10.1109/TII.2016.2518642 [SCI&EI检索,IF: 6.764, JCR 1区, 工程学]
2 Tian Wang, Zhen Peng, Wenzheng Xu, Junbin Liang, Guojun Wang, Hui Tian, Yiqiao Cai, and Yonghong Chen, "Cascading Target Tracking Control in Wireless Camera Sensor and Actuator Networks," Asian Journal of Control, 19(4): 1350–1364, June 2017. DOI: https://doi.org/10.1002/asjc.1525 [SCI&EI检索,IF: 1.421, JCR 3区, 工程学]
1 Ziran Peng and Guojun Wang*, "A Novel ECG Eigenvalue Detection Algorithm Based on Wavelet Transform," BioMed Research International, Volume 2017, Article ID 5168346, 12pages, May 2017. DOI: https://doi.org/10.1155/2017/5168346 [SCI&EI检索,IF: 2.476, JCR 3区, 生物与生物化学]
Part Ⅲ: Selected Journal Papers (Guangzhou University, EI Indexed, "*" denotes corresponding author.)
No. Paper Download the Paper from Publisher Remark
3 Md Zakirul Alam Bhuiyan, Jie Wu, Gary M. Weiss, Thaier Hayajneh, Tian Wang, and Guojun Wang*, "Event Detection through Differential Pattern Mining in Cyber-Physical Systems," IEEE Transactions on Big Data, PP(99): 1-1, June 2017. DOI: https://doi.org/10.1109/TBDATA.2017.2731838 [EI检索]
2 Md. Zakirul Alam Bhuiyan, Jie Wu, Guojun Wang*, Jiannong Cao, Wenjun Jiang, Mohammed Atiquzzaman, "Towards Cyber-Physical Systems Design for Structural Health Monitoring: Hurdles and Opportunities," ACM Transactions on Cyber-Physical Systems, 1(4): 19:1-19:26, 2017. DOI: http://doi.acm.org/10.1145/3086508 [EI检索]
1 Pengfei Yin, Guojun Wang*, Wenjun Jiang, "U-Search: Usage-based Search with Collective Intelligence," International Journal of High Performance Computing and Networking, 10(4/5): 341-351, 2017. DOI: https://doi.org/10.1504/IJHPCN.2017.10007203 [EI检索]
Part Ⅳ: Selected Journal Papers (Central South University, SCI&EI Indexed)
No. Paper Download Link from Publisher Remark
62 Md Zakirul Alam Bhuiyan, Guojun Wang, and Athanasios V. Vasilakos, "Local Area Prediction-Based Mobile Target Tracking in Wireless Sensor Networks," IEEE Transactions on Computers, 64(7): 1968-1982, July 2015. DOI: http://dx.doi.org/10.1109/TC.2014.2346209 [SCI&EI检索,IF: 1.723, CCF A类,ESI高被引论文(记录时间:2018年1月)]
61 Guojun Wang, Felix Musau, Song Guo, and Muhammad Bashir Abdullahi, "Neighbor Similarity Trust against Sybil Attack in P2P E-Commerce," IEEE Transactions on Parallel and Distributed Systems, 26(3): 824-833, March 2015. DOI: http://dx.doi.org/10.1109/TPDS.2014.2312932 [SCI&EI检索,IF: 2.661, CCF A类]
60 Guojun Wang, Wenjun Jiang, Jie Wu, Zhengli Xiong, "Fine-Grained Feature-Based Social Influence Evaluation in Online Social Networks," IEEE Transactions on Parallel and Distributed Systems, 25(9): 2286-2296, August 2014. DOI: http://dx.doi.org/10.1109/TPDS.2013.135 [SCI&EI检索,IF: 2.661, CCF A类]
59 Guojun Wang, Md Zakirul Alam Bhuiyan, Jiannong Cao, and Jie Wu, "Detecting Movements of a Target Using Face Tracking in Wireless Sensor Networks," IEEE Transactions on Parallel and Distributed Systems, 25(4): 939-949, April 2014. DOI: http://dx.doi.org/10.1109/TPDS.2013.91 [SCI&EI检索,IF: 2.661, CCF A类]
58 Md Zakirul Alam Bhuiyan, Jie Wu, Guojun Wang, and Jiannong Cao, "Sensing and Decision-making in Cyber-Physical Systems: The Case of Structural Health Monitoring," IEEE Transactions on Industrial Informatics, 12(6): 2103-2114, 2016. DOI: http://dx.doi.org/10.1109/TII.2016.2518642 [SCI&EI检索,IF: 4.708]
57 Wenjun Jiang, Jie Wu, Guojun Wang, and Huanyang Zheng, "Forming Opinions via Trusted Friends: Time-Evolving Rating Prediction Using Fluid Dynamics," IEEE Transactions on Computers, 65(4): 1211-1224, 2016. DOI: http://dx.doi.org/10.1109/TC.2015.2444842 [SCI&EI检索,IF: 1.659; CCF A类]
56 Wenjun Jiang, Jie Wu, Feng Li, Guojun Wang, and Huanyang Zheng, "Trust Evaluation in Online Social Networks Using Generalized Flow," IEEE Transactions on Computers, 65(3): 952-963, 2016. DOI: http://dx.doi.org/10.1109/TC.2015.2435785 [SCI&EI检索,IF: 1.659; CCF A类]
55 Md Zakirul Alam Bhuiyan, Guojun Wang, Jiannong Cao, and Jie Wu, "Deploying Wireless Sensor Networks with Fault-Tolerance for Structural Health Monitoring," IEEE Transactions on Computers, 64(2): 382-395, February 2015. DOI: http://dx.doi.org/10.1109/TC.2013.195 [SCI&EI检索,IF: 1.723, CCF A类]
54 Wenjun Jiang, Jie Wu, and Guojun Wang, "On Selecting Recommenders for Trust Evaluation in Online Social Networks," ACM Transactions on Internet Technology, 15(4), Article No.14, December 2015. DOI: http://dx.doi.org/10.1145/2807697 [SCI&EI检索,IF: 0.769, CCF B类]
53 Md Zakirul Alam Bhuiyan, Guojun Wang, Jiannong Cao, and Jie Wu, "Sensor Placement with Multiple Objectives for Structural Health Monitoring," ACM Transactions on Sensor Networks, 10(4): 1-45, June 2014. DOI: http://dx.doi.org/10.1145/2533669 [SCI&EI检索,IF: 1.448, CCF B类]
52 Qin Liu, Chiu C. Tan, Jie Wu, and Guojun Wang, "Towards Differential Query Services in Cost-Efficient Clouds," IEEE Transactions on Parallel and Distributed Systems, 25(6): 1648-1658, May 2014. DOI: http://dx.doi.org/10.1109/TPDS.2013.132 [SCI&EI检索,IF: 2.17, CCF A类]
51 Qin Liu, Guojun Wang, and Jie Wu, "Consistency as a Service: Auditing Cloud Consistency," IEEE Transactions on Network and Service Management, 11(1): 25-35, January 2014. DOI: http://dx.doi.org/10.1109/TNSM.2013.122613.130411 [EI检索]
50 Felix Musau, Guojun Wang, Shui Yu, Muhammad Bashir Abdullahi, "Securing Recommendations in Grouped P2P E-Commerce Trust Model," IEEE Transactions on Network and Service Management, 9(4): 407-420, December 2012. DOI: http://dx.doi.org/10.1109/TNSM.2012.091712.120269 [EI检索]
49 Jiannong Cao, Guojun Wang, and Chan Keith C. C., "A Fault-Tolerant Group Communication Protocol in Large Scale and Highly Dynamic Mobile Next-Generation Networks," IEEE Transactions on Computers, 56(1): 80-94, January 2007. DOI: http://dx.doi.org/10.1109/TC.2007.250625 [SCI&EI检索,IF: 1.659, CCF A类]
48 Jianer Chen, Guojun Wang, and Songqiao Chen, "Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results," IEEE Transactions on Computers, 51(5): 530-540, May 2002. DOI: http://dx.doi.org/10.1109/TC.2002.1004592 [SCI&EI检索,IF: 1.659, CCF A类]
47 Ke Gu, Weijia Jia, Guojun Wang, and Sheng Wen, "Efficient and Secure Attribute-based Signature for Monotone Predicates," Acta Informatica, 54(5): 521-541, August 2017. DOI: http://dx.doi.org/10.1007/s00236-016-0270-5 [SCI&EI检索,IF: 1.0]
46 Tao Peng, Qin Liu, and Guojun Wang, "Enhanced Location Privacy Preserving Scheme in Location-Based Services," IEEE Systems Journal, 11(1): 219-230, March 2017. DOI: http://dx.doi.org/10.1109/JSYST.2014.2354235 [SCI&EI检索,IF: 1.98]
45 Entao Luo, Qin Liu, and Guojun Wang, "Hierachical Multi-Authority and Attribute-Based Encryption Friend Discovery Scheme in Mobile Social Networks," IEEE Communications Letters, 20(9): 1772-1775, June 2016. DOI: http://dx.doi.org/10.1109/LCOMM.2016.2584614 [SCI&EI检索,IF: 1.291]
44 Karim Alinani, Annadil Alinani, Xiangyong Liu and Guojun Wang, "Heterogeneous Educational Resource Recommender System based on User Preferences," International Journal of Autonomous and Adaptive Communications Systems, 9(1/2): 20-39, March 2016. DOI: https://doi.org/10.1504/IJAACS.2016.075384 [EI检索]
43 Shuhong Chen, Guojun Wang, and Weijia Jia, "Cluster-Group Based Trusted Computing for Mobile Social Networks Using Implicit Social Behavioral Graph," Future Generation Computer Systems, 55: 391-400, 2016. DOI: http://dx.doi.org/10.1016/j.future.2014.06.005 [SCI&EI检索,IF: 2.786]
42 Wei Zhou, Yang Xu, and Guojun Wang, "Decentralized Group Key Management for Hierarchical Access Control Using Multilinear Forms," Concurrency and Computation: Practice and Experience, 28(3): 631-645, March 2016. DOI: http://dx.doi.org/10.1002/cpe.3328 [SCI&EI检索,IF: 0.997]
41 Shuhong Chen, Guojun Wang, and Weijia Jia, "K-FuzzyTrust: Efficient Trust Computation for Large-scale Mobile Social Networks Using a Fuzzy Implicit Social Graph," Information Sciences, 318(10): 123–143, 2015. DOI: http://dx.doi.org/10.1016/j.ins.2014.09.058 [SCI&EI检索,IF: 4.038; CCF B类]
40 Felix Musau, Guojun Wang, and Muhammad Bashir Abdullahi, "Group Formation with Neighbor Similarity Trust in P2P E-Commerce," Peer-to-Peer Networking and Applications, 7(4): 295-310, December 2014. DOI: http://dx.doi.org/10.1007/s12083-011-0116-4 [SCI&EI检索,IF: 0.632]
39 Sancheng Peng, Min Wu, Guojun Wang, Shui Yu, "Containing Smartphone Worm Propagation with an Influence Maximization Algorithm," Computer Networks, 74(Part B): 103-113, December 2014. DOI: http://dx.doi.org/10.1016/j.comnet.2014.09.004 [SCI&EI检索,IF: 1.256, CCF B类]
38 Xiaofei Xing, Guojun Wang, and Jie Li, "Polytype Target Coverage Scheme for Heterogeneous Wireless Sensor Networks Using Linear Programming," Wiley's Journal of Wireless Communications and Mobile Computing, 14(14): 1397-1408, October 2014. DOI: http://dx.doi.org/10.1002/wcm.2269 [SCI&EI检索,IF: 1.291]
37 Jin Zheng, Md. Zakirul Alam Bhuiyan, Shaohua Liang, Xiaofei Xing, and Guojun Wang, "Auction-Based Adaptive Sensor Activation Algorithm for Target Tracking in Wireless Sensor Networks," Future Generation Computer Systems, 39: 88-99, October 2014. DOI: http://dx.doi.org/10.1016/j.future.2013.12.014 [SCI&EI检索,IF: 2.786]
36 Chaoliang Li, Guojun Wang, and Jin Zheng, "An Aggregated Signature-Based Fast RFID Batch Detection Protocol," Security and Communication Networks, 7(9): 1364-1371, September 2014. DOI: http://dx.doi.org/10.1002/sec.838 [SCI&EI检索,IF: 0.72]
35 Yongming Xie and Guojun Wang, "Message Matching-Based Greedy Behavior Detection in Delay Tolerant Networks," Journal of Computer and System Sciences, 80(5): 903-915, August 2014. DOI: http://dx.doi.org/10.1016/j.jcss.2014.02.001 [SCI&EI检索,IF: 1.1138, CCF B类]
34 Sancheng Peng, Min Wu, Guojun Wang, Shui Yu, "Propagation Model of Smartphone Worms Based on Semi-Markov Process and Social Relationship Graph," Computers & Security, 44: 92-103, July 2014. DOI: http://dx.doi.org/10.1016/j.cose.2014.04.006 [SCI&EI检索,IF: 1.172, CCF B类]
33 Wenjun Jiang, Guojun Wang, and Jie Wu, "Generating Trusted Graphs for Trust Evaluation in Online Social Networks," Future Generation Computer Systems, 31: 48-58, February 2014. DOI: http://dx.doi.org/10.1016/j.future.2012.06.010 [SCI&EI检索,IF: 1.864]
32 Qin Liu, Guojun Wang, and Jie Wu, "Time-Based Proxy Re-Encryption Scheme for Secure Data Sharing in a Cloud Environment," Information Sciences (Elsevier), 258(10): 355-370, February 2014. DOI: http://dx.doi.org/10.1016/j.ins.2012.09.034 [SCI&EI检索,IF: 4.832, CCF B类, JCR 1区, 计算机科学,ESI高被引论文(记录时间:2015年3月)]
31 Yongming Xie and Guojun Wang, "Practical Distributed Secret Key Generation for Delay Tolerant Networks," Wiley's Concurrency and Computation: Practice and Experience, 25(14): 2067-2079, September 2013. DOI: http://dx.doi.org/10.1002/cpe.2885 [SCI&EI检索,IF: 0.784]
30 Sancheng Peng, Guojun Wang, and Shui Yu, "Modeling the Dynamics of Worm Propagation Using Two-Dimensional Cellular Automata in Smartphones," Journal of Computer and System Sciences, 79(5): 586-595, August 2013. DOI: http://dx.doi.org/10.1016/j.jcss.2012.11.007 [SCI&EI检索,IF: 1.091, CCF B类]
29 Guojun Wang, Qiushuang Du, Wei Zhou, and Qin Liu, "A Scalable Encryption Scheme for Multi-Privileged Group Communications," The Journal of Supercomputing, 64(3): 1075-1091, June 2013. DOI: http://dx.doi.org/10.1007/s11227-011-0683-4 [SCI&EI检索,IF: 0.858]
28 Fang Qi, Zhe Tang, Guojun Wang, and Jie Wu, "User Requirements-Aware Security Ranking in SSL Protocol," The Journal of Supercomputing, 64(3): 762-776, June 2013. DOI: http://dx.doi.org/10.1007/s11227-010-0546-4 [SCI&EI检索,IF: 0.858]
27 Guojun Wang, Fengshun Yue, and Qin Liu, "A Secure Self-Destructing Scheme for Electronic Data," Journal of Computer and System Sciences, 79(2): 279-290, March 2013. DOI: http://dx.doi.org/10.1016/j.jcss.2012.05.008 [SCI&EI检索,IF: 1.138, CCF B类]
26 Yueming Deng, Guojun Wang, Jiannong Cao, and Xin Xiao, "Practical Secure and Fast Handoff Framework for Pervasive Wi-Fi Access," IET Information Security, 7(1): 22-29, March 2013. DOI: http://dx.doi.org/10.1049/iet-ifs.2012.0092 [SCI&EI检索,IF: 0.753]
25 Qin Liu, Chiu C. Tan, Jie Wu, and Guojun Wang, "Cooperative Private Searching in Clouds," Journal of Parallel and Distributed Computing, 72(8): 1019-1031, August 2012. DOI: http://dx.doi.org/10.1016/j.jpdc.2012.04.012 [SCI&EI检索,IF: 1.179, CCF B类]
24 Gaocai Wang, Guojun Wang, and Zhiguang Shan, "Fault Tolerance Analysis of Mesh Networks with Uniform Versus Nonuniform Node Failure Probability," Information Processing Letters (Elsevier), 112(10): 396-401, May 2012. DOI: http://dx.doi.org/10.1016/j.ipl.2011.12.013 [SCI&EI检索,IF: 0.546]
23 Qin Liu, Guojun Wang, and Jie Wu, "Secure and Privacy Preserving Keyword Searching for Cloud Storage Services," Journal of Network and Computer Applications, 35(3): 927-933, May 2012. DOI: http://dx.doi.org/10.1016/j.jnca.2011.03.010 [SCI&EI检索,IF: 2.229]
22 Tian Wang, Weijia Jia, Guojun Wang, Minyi Guo, and Jie Li, "Hole Avoiding in Advance Routing with Hole Recovery Mechanism in Wireless Sensor Networks," Ad Hoc & Sensor Wireless Networks, 16(1-3): 191-138, 2012. DOI: http://cityusr.lib.cityu.edu.hk/jspui/handle/123456789/5298 [SCI&EI检索,IF: 0.435]
21 Lin Yao, Guowei Wu, Jia Wang, Feng Xia, Chi Lin, and Guojun Wang, "A Clustering K-Anonymity Scheme for Location Privacy Preservation," IEICE Transactions on Information and Systems, E95-D(1): 134-142, January 2012. DOI: http://dx.doi.org/10.1587/transinf.E95.D.134 [SCI&EI检索,IF: 0.191]
20 Guojun Wang, Qin Liu, and Jie Wu, "Achieving Fine-Grained Access Control for Secure Data Sharing on Cloud Servers," Concurrency and Computation-Practice & Experience, 23(12): 1443-1464, August 2011. DOI: http://dx.doi.org/10.1002/cpe.1698 [SCI&EI检索,IF: 0.997]
19 Sancheng Peng, Guojun Wang, Zhongwang Hu, and Jianping Chen, "Survivability Modeling and Analysis on 3D Mobile Ad-Hoc Networks," Journal of Central South University of Technology (Springer), 18(4): 1144-1152, August 2011. DOI: http://dx.doi.org/10.1007/s11771-011-0816-1 [SCI&EI检索,IF: 0.52]
18 Guojun Wang, Qin Liu, Jie Wu, and Minyi Guo, "Hierarchical Attribute-Based Encryption and Scalable User Revocation for Sharing Data in Cloud Servers," Computers & Security, 30(5): 320-331, July 2011. DOI: http://dx.doi.org/10.1016/j.cose.2011.05.006 [SCI&EI检索,IF: 1.301, CCF B类]
17 Guojun Wang and Jie Wu, "FlowTrust: Trust Inference with Network Flows," Frontiers of Computer Science in China, 5(2): 181-194, 2011. DOI: http://dx.doi.org/10.1007/s11704-011-0323-4 [SCI&EI检索,IF: 0.434]
16 Guojun Wang and Jie Wu, "Multi-Dimensional Evidence-Based Trust Management with Multi-Trusted Paths," Future Generation Computer Systems, 27(5): 529-538, May 2011. DOI: http://dx.doi.org/10.1016/j.future.2010.04.015 [SCI&EI检索,IF: 2.786]
15 Fang Qi, Zhe Tang, Guojun Wang, and Jie Wu, "SSL-Enabled Trusted Communication: Spoofing and Protecting The Non-Cautious Users," Security and Communication Networks, 4(4): 372-383, April 2011. DOI: http://dx.doi.org/10.1002/sec.159 [SCI&EI检索,IF: 0.72]
14 Md. Zakirul Alam Bhuiyan, Guojun Wang, Li Zhang, and Yong Peng, "Prediction Based Energy-Efficient Target Tracking Protocol in Wireless Sensor Networks," Journal of Central South University of Technology, 17(2): 340-348, April 2010. DOI: http://dx.doi.org/10.1007/s11771-010-0051-1 [SCI&EI检索,F: 0.464]
13 Sancheng Peng, Weijia Jia, Guojun Wang, Jie Wu, and Minyi Guo, "Trusted Routing Based on Dynamic Trust Mechanism in Mobile Ad-Hoc Networks," IEICE Transactions on Information and Systems, E93-D(3): 510-517, March 2010. DOI: http://dx.doi.org/10.1587/transinf.E93.D.510 [SCI&EI检索,IF: 0.191]
12 Guojun Wang, Md Zakirul Alam Bhuiyan, and Li Zhang, "Two-Level Cooperative and Energy-Efficient Tracking Algorithm in Wireless Sensor Networks," Concurrency and Computation-Practice & Experience, 22(4): 518-537, February 2010. DOI: http://dx.doi.org/10.1002/cpe.1503 [SCI&EI检索,IF: 0.784]
11 Minyi Guo, Elizabeth Olule, Guojun Wang, and Song Guo, "Designing Energy Efficient Target Tracking Protocol with Quality Monitoring in Wireless Sensor Networks," Journal of Supercomputing, 51(2): 131-148, February 2010. DOI: http://dx.doi.org/10.1007/s11227-009-0278-5 [SCI&EI检索,IF: 0.841]
10 Yun Ge, Guojun Wang, Qing Zhang, and Minyi Guo, "Multipath Routing with Reliable Nodes in Large-Scale Mobile Ad-Hoc Networks," IEICE Transactions on Information and Systems, E92-D(9): 1675-1682, September 2009. DOI: http://dx.doi.org/10.1587/transinf.E92.D.1675 [SCI&EI检索,IF: 0.191]
9 Sancheng Peng, Weijia Jia, and Guojun Wang, "Survivability Evaluation in Large-Scale Mobile Ad-Hoc Networks," Journal of Computer Science and Technology, 24(4): 761-774, July 2009. DOI: http://dx.doi.org/10.1007/s11390-009-9260-1 [SCI&EI检索,IF: 0.642, CCF B类]
8 Jiannong Cao, Lin Liao, Guojun Wang, Hao Ma, and Bin Xiao, "A Novel Dual-Key Management Protocol Based on a Hierarchical Multicast Infrastructure in Mobile Internet," International Journal of Ad Hoc and Ubiquitous Computing, 4(3): 183-190, May 2009. DOI: http://dx.doi.org/10.1007/11534310_60 [SCI&EI检索,IF: 0.9]
7 Guojun Wang, Tian Wang, Weijia Jia, Minyi Guo, and Jie Li, "Adaptive Location Updates for Mobile Sinks in Wireless Sensor Networks," Journal of Supercomputing, 47(2): 127-145, February 2009. DOI: http://dx.doi.org/10.1007/s11227-008-0181-5 [SCI&EI检索,IF: 0.841]
6 Wenfeng Du, Weijia Jia, Guojun Wang, and Wenyan Lu, "Analysis of Channel Allocation Scheme for Wireless Cellular Network," International Journal of Ad Hoc and Ubiquitous Computing (Inderscience Publishers), 4(3/4): 201-209, 2009. DOI: http://citeseerx.ist.psu.edu/viewdoc/versions?doi=10.1.1.164.9456 [SCI&EI检索,IF: 0.9]
5 Guojun Wang, Lifan Zhang, Jiannong Cao, "Hole-Shadowing Routing in Large-Scale MANETs," International Journal of Sensor Networks, 4(4): 220-229, August 2008. DOI: http://dx.doi.org/10.1504/IJSNet.2008.022706 [EI检索]
4 Tian Wang, Guojun Wang, Minyi Guo, and Weijia Jia, "Hash-Area-Based Data Dissemination Protocol in Wireless Sensor Networks," Journal of Central South University of Technology (Springer), 15(3): 392-398, June 2008. DOI: http://dx.doi.org/10.1007/s11771-008-0074-z [SCI&EI检索,IF: 0.464]
3 Guojun Wang, Ouyang Jie, Hsiao-Hwa Chen, and Minyi Guo, "Efficient Group Key Management for Multi-Privileged Groups," Computer Communications, 30(11-12): 2497-2509, September 2007. DOI: http://dx.doi.org/10.1016/j.comcom.2007.04.019 [SCI&EI检索,IF: 1.352]
2 Jianer Chen, Gaocai Wang, Chuang Lin, Tao Wang, and Guojun Wang, "Probabilistic Analysis on Mesh Network Fault Tolerance," Journal of Parallel and Distributed Computing (Elsevier Science), 67 (1): 100-110, January 2007. DOI: http://dx.doi.org/10.1016/j.jpdc.2006.09.002 [SCI&EI检索,IF: 1.011, CCF B类]
1 Guojun Wang, Lin Liao, Jiannong Cao, and Keith C.C.Chan, "A Novel Secure Multicast Scheme in Mobile Internet," Journal of Central South University of Technology, 12(6): 720-725, December 2005. DOI: http://dx.doi.org/10.1007/s11771-005-0076-z [SCI&EI检索,IF: 0.464]
Part V: Selected Conference Papers
No. Paper Download Link from Publisher Remark
32 Wenjun Jiang, Jie Wu, Guojun Wang, and Huanyang Zheng, " FluidRating: A Time-Evolving Rating Scheme in Trust-based Recommendation Systems Using Fluid Dynamics," Proceedings of the 33rd Annual IEEE International Conference on Computer Communications(IEEE INFOCOM-14), Toronto, Canada, pp. 1707-1715, April 27-May 2, 2014. DOI: http://dx.doi.org/10.1109/INFOCOM.2014.6848108 EI: 20143017978514;CCF A类
31 Guojun Wang, Qin Liu, Yang Xiang, and Jianer Chen, "Security from the Transparent Computing Aspect," Proceedings of the 2014 International Conference on Computing, Networking and Communications (ICNC 2014), Honolulu, Hawaii, USA, pp. 216-220, February 3-6, 2014. DOI: http://dx.doi.org/10.1109/ICCNC.2014.6785334 EI: 20141917689424
30 Md Zakirul Alam Bhuiyan, Guojun Wang, Jiannong Cao, and Jie Wu, "Local Monitoring and Maintenance for Operational Wireless Sensor Networks," Proceedings of the 11th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA-13), Melbourne, Australia, pp. 837-844, 16-18 July, 2013. DOI: http://dx.doi.org/10.1109/TrustCom.2013.102 IDS Number: BA1QE;
EI: 20140617288471;
Best Paper Award
29 Md Zakirul Alam Bhuiyan, Guojun Wang, Jiannong Cao, and Jie Wu, "Energy and Bandwidth-Efficient Wireless Sensor Networks for Monitoring High-Frequency Events," Proceedings of the 10th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON 2013), New Orleans, USA, pp. 194-202, June 24-27, 2013. DOI: http://dx.doi.org/10.1109/SAHCN.2013.6644978 EI: 20135217146848;
28 Guojun Wang, Qin Liu, Feng Li, Shuhui Yang, and Jie Wu, "Outsourcing Privacy-Preserving Social Networks to a Cloud," Proceedings of the 32nd IEEE International Conference on Computer Communications (IEEE INFOCOM-13), Turin, Italy, pp. 2886-2894, 14-19 April, 2013. DOI: http://dx.doi.org/10.1109/INFCOM.2013.6567099 IDS Number: BHQ33;
EI: 20133616693345;
CCF A类
27 Md Zakirul Alam Bhuiyan, Jiannong Cao, Guojun Wang, and Xuefeng Liu, "Energy-Efficient and Fault-Tolerant Structural Health Monitoring in Wireless Sensor Networks," Proceedings of the 31st IEEE International Symposium on Reliable Distributed Systems (IEEE SRDS 2012), California, USA, pp. 301-310, 8-11 October 2012. DOI: http://dx.doi.org/10.1109/SRDS.2012.26 IDS Number: BEM72;
EI: 20130916073360;
CCF B类
26 Qin Liu, Guojun Wang, and Jie Wu, "Clock-Based Proxy Re-encryption Scheme in Unreliable Clouds," Proceedings of the 41st International Conference on Parallel Processing (ICPP 2012), Philadelphia, USA, pp. 304-305, September 10-13, 2012. DOI: http://dx.doi.org/10.1109/ICPPW.2012.45 EI: 20125115821846;
CCF B类
25 Md. Zakirul Alam Bhuiyan, Jiannong Cao, and Guojun Wang, "Deploying Wireless Sensor Networks with Fault Tolerance for structural Health Monitoring," Proceedings of the 8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS 2012), Hangzhou, China, pp. 194-202, May 16-18, 2012. DOI: http://dx.doi.org/10.1109/DCOSS.2012.38 IDS Number: BBZ75;
EI: 20123115287589
24 Qin Liu, Chiu C. Tan, Jie Wu, and Guojun Wang, "Efficient Information Retrieval for Ranked Queries in Cost-Effective Cloud Environments," Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM 2012), Orlando, Florida, USA, pp. 2581-2585, March 25-30, 2012. DOI: http://dx.doi.org/10.1109/INFCOM.2012.6195657 IDS Number: BBZ88;
EI: 20122315083343;
CCF A类
23 Xuefeng Liu, Jiannong Cao, Md. Zakirul Alam Bhuiyan, Steven Lai, Hejun Wu, and Guojun Wang, "Fault Tolerant WSN-Based Structural Health Monitoring," Proceedings of the 41st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2011), Hong Kong, China, pp. 37-48, June 27-30, 2011. DOI: http://dx.doi.org/10.1109/DSN.2011.5958205 IDS Number: BXB87;
EI: 20113414262353;
CCF B类
22 Fengshun Yue, Guojun Wang, and Qin Liu, "A Secure Self-Destructing Scheme for Electronic Data," Proceedings of the 2010 IEEE/IFIP International Symposium on Trusted Computing and Communications (TrustCom 2010), in conjunction with the 8th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC-10), Hong Kong, pp. 651-658, December 11-13, 2010. DOI: http://dx.doi.org/10.1109/EUC.2010.104 IDS Number: 054OV;
EI: 20110813692126;
est Paper Award
21 Guojun Wang, Qin Liu, and Jie Wu, "Hierarchical attribute-based encryption for fine-grained access control in cloud storage services," Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS-10), Chicago, IL, USA, pp. 735-737, October 4-8, 2010. DOI: http://dx.doi.org/10.1145/1866307.1866414 EI: 20105013486020;
CCF A类
20 Khoriba Ghada, Jie Li, Yusheng Ji, and Guojun Wang, "Cross-layer Approach for Energy Efficient Routing in WANETs," Proceedings of the Sixth IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2009), Macau SAR, P. R. China, pp. 393-402, October 2009. DOI: http://dx.doi.org/10.1109/MOBHOC.2009.5336975 IDS Number: BUC69;
EI: 20100312646696
19 Fang Qi, Zhe Tang, Guojun Wang, and Jie Wu, "QoS-aware Optimization Strategy for Security Ranking in SSL Protocol," Proceedings of IEEE TSP-09, in conjunction with IEEE MASS-09, Macau SAR, P.R. China, pp. 842-847, October 2009. DOI: http://dx.doi.org/10.1109/MOBHOC.2009.5337048 IDS Number: BUC69;
EI: 20100312649053
18 Elizabeth Olule, Guojun Wang, Minyi Guo, and Mianxiong Dong, "RARE: An Energy-Efficient Target Tracking Protocol for Wireless Sensor Networks," Proceedings of the 2007 IEEE International Conference on Parallel Processing Workshops (ICPPW 2007), Xi'an, China, pp. 76-81, September 2007. DOI: http://dx.doi.org/10.1109/ICPPW.2007.71 EI: 20083111412072;
CCF B类
17 Jiannong Cao, Lifan Zhang, Guojun Wang, and Hui Cheng, "SSR: Segment-by-Segment Routing in Large-Scale MANETs," Proceedings of the Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2006), Vancouver, Canada, pp. 216-225, October 2006. DOI: http://dx.doi.org/10.1109/MOBHOC.2006.278560 EI: 080811108454
16 Guojun Wang, Yingjun Lin, and Minyi Guo, "A Scalable and Reliable Multiple Home Regions Based Location Service in Mobile Ad Hoc Networks," Proceedings of the 2005 IFIP International Conference on Embedded and Ubiquitous Computing (EUC 2005), LNCS 3824, Nagasaki, Japan, pp. 550-559, December 2005. DOI: http://dx.doi.org/10.1007/11596356_56 IDS Number: BDP33;
EI: 06249940228
15 Guojun Wang, Dingzhu Lu, Weijia Jia, and Jiannong Cao, "Reliable Gossip-Based Broadcast Protocol in Mobile Ad Hoc Networks," Proceedings of International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2005), LNCS 3794, Wuhan, P. R. China, pp. 207-218, December 2005. DOI: http://dx.doi.org/10.1007/11599463_21 IDS Number: BDP31;
EI: 06229908763
14 Guojun Wang, Zhongshan Gao, Lifan Zhang, and Jiannong Cao, "Prediction-Based Multicast Mobility Management in Mobile Internet," Proceedings of Third International Symposium on Parallel and Distributed Processing and Applications (ISPA 2005), LNCS 3758, Nanjing, P. R. China, pp. 1024-1035, November 2005. DOI: http://dx.doi.org/10.1007/11576235_102 IDS Number: BDJ13;
EI: 06219894430
13 Guojun Wang, Lifan Zhang, and Jiannong Cao, "A Virtual Circle-Based Clustering Algorithm with Mobility Prediction in Large-Scale MANETs," Proceedings of International Conference on Computer Networks and Mobile Computing (ICCNMC 2005), LNCS 3619, Zhangjiajie, P. R. China, pp. 364-374, August 2005. http://dx.doi.org/10.1007/11534310_40 IDS Number: BCT45;
EI:05429422021
12 Jiannong Cao, Lin Liao, Guojun Wang, and Bin Xiao, "A Novel Dual-Key Management Protocol Based on a Hierarchical Multicast Infrastructure in Mobile Internet," Proceedings of International Conference on Computer Networks and Mobile Computing (ICCNMC 2005), LNCS 3619, Zhangjiajie, P. R. China, pp. 560-569, August 2005. DOI: http://dx.doi.org/10.1007/11534310_60 IDS Number: BCT45;
EI: 05429422041
11 Fang Qi, Jin Zheng, Weijia Jia, and Guojun Wang, "Available Bandwidth Measurement Schemes over Networks," Proceedings of International Conference on Computer Networks and Mobile Computing (ICCNMC 2005), LNCS 3619, Zhangjiajie, P. R. China, pp. 931-940, August 2005. DOI: http://dx.doi.org/10.1007/11534310_98 IDS Number: BCT45;
EI: 05429422079
10 Wenfeng Du, Lidong Lin, Weijia Jia, and Guojun Wang, "Modeling and Performance Evaluation of Handover Service in Wireless Networks," Proceedings of International Conference on Computer Networks and Mobile Computing (ICCNMC 2005), LNCS 3619, Zhangjiajie, P. R. China, pp. 229-238, August 2005. DOI: http://dx.doi.org/10.1007/11534310_26 IDS Number: BCT45;
EI: 05429422007
9 Guojun Wang, Jiannong Cao, Lifan Zhang, Keith C.C. Chan, and Jie Wu, "A Novel QoS Multicast Model in Mobile Ad Hoc Networks," Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005), Denver, Colorado, USA, pp. 206-213, April 2005. DOI: http://dx.doi.org/10.1109/IPDPS.2005.53 EI: 05509538269;
CCF B类
8 Guojun Wang, Jun Luo, Jiannong Cao, and Keith C.C. Chan, "QoSRHMM: A QoS-Aware Ring-Based Hierarchical Multi-Path Multicast Routing Protocol," Proceedings of the second International Symposium of Parallel and Distributed Processing and Applications (ISPA 2004), LNCS 3358, Hong Kong, pp. 568-577, December 2004. DOI: http://dx.doi.org/10.1007/978-3-540-30566-8_68 IDS Number: BBM37;
EI: 8315176
7 Xiaolin Xiao, Guojun Wang, and Jianer Chen, "Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support," Proceedings of the second International Symposium of Parallel and Distributed Processing and Applications (ISPA 2004), LNCS 3358, Hong Kong, pp. 698-704, December 2004. DOI: http://dx.doi.org/10.1007/978-3-540-30566-8_81 IDS Number: BBM37;
EI: 8348377
6 Guojun Wang, Lin Liao, Jiannong Cao, and Keith C.C. Chan, "Key Management for Secure Multicast Using the RingNet Hierarchy," Proceedings of the 2004 International Symposium on Computational and Information Sciences (CIS 2004), LNCS 3314, Shanghai, China, pp. 77-84, December 2004. DOI: http://dx.doi.org/10.1007/978-3-540-30497-5_13 IDS Number: BBO38;
EI: 8425897
5 Guojun Wang, Jiannong Cao, and Keith C.C. Chan, "RGB: A Scalable and Reliable Group Membership Protocol in Mobile Internet," Proceedings of the IEEE 33rd International Conference on Parallel Processing (ICPP 2004), Montreal, Quebec, Canada, pp. 326-333, August 2004. DOI: http://dx.doi.org/10.1109/ICPP.2004.1327939 IDS Number: BAW07;
EI: 04518731734;
CCF B类
4 Guojun Wang, Jiannong Cao, and Keith C.C. Chan, "A Reliable Totally-Ordered Group Multicast Protocol for Mobile Internet," Proceedings of the IEEE 33rd International Conference on Parallel Processing Workshops (ICPPW 2004), Montreal, Quebec, Canada, pp. 108-115, August 2004. DOI: http://dx.doi.org/10.1109/ICPPW.2004.1328003 IDS Number: BAW08;
EI: 04518731639;
CCF B类
3 Gaocai Wang, Jianer Chen, and Guojun Wang, "On Fault Tolerance of 3-Dimensional Mesh Networks," Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 2004), Hong Kong, pp. 149-154, May 2004. DOI: http://dx.doi.org/10.1109/ISPAN.2004.1300473 IDS Number: 803DV;
EI: 04348316717
2 Gaocai Wang, Jianer Chen, and Guojun Wang, "Probability Model for Faults in Large-Scale Multicomputer Systems," Proceedings of the IEEE 12th Asian Test Symposium (ATS 2003), Xi’An, China, pp. 452-457, November 2003. DOI: http://dx.doi.org/10.1109/ATS.2003.1250855 IDS Number: BY38Z;
EI: 7905624
1 Jianer Chen, Iyad A. Kanj, and Guojun Wang, "Hypercube Network Fault Tolerance: A Probabilistic Approach," Proceedings of the 2002 International Conference on Parallel Processing (ICPP 2002), Vancouver, British Columbia, pp. 65-72, August 2002. DOI: http://dx.doi.org/10.1109/ICPP.2002.1040860 IDS Number: BV03Y;
EI: 7462333;CCF B类